Home // SENSORCOMM 2012 , The Sixth International Conference on Sensor Technologies and Applications // View article
Authors:
Samta Shukla
Joy Kuri
Keywords: Network Partition Time (NPT), Maximal Independent Sets(MIS), Node-disjoint Paths (NDPs), Link-Contention graph (LCG)
Abstract:
We consider a scenario where the communication nodes in a sensor network have limited energy, and the objective is to maximize the aggregate bits transported from sources to respective destinations before network partition due to node deaths. This performance metric is novel, and captures the useful information that a network can provide over its lifetime. The optimization problem that results from our approach is nonlinear; however, we show that it can be converted to a Multicommodity Flow (MCF) problem that yields the optimal value of the metric. Subsequently, we compare the performance of a practical routing strategy, based on Node Disjoint Paths (NDPs), with the ideal corresponding to the MCF formulation. Our results indicate that the performance of NDP-based routing is within 7.5% of the optimal.
Pages: 215 to 221
Copyright: Copyright (c) IARIA, 2012
Publication date: August 19, 2012
Published in: conference
ISSN: 2308-4405
ISBN: 978-1-61208-207-3
Location: Rome, Italy
Dates: from August 19, 2012 to August 24, 2012