Maximizing transported data in a wireless sensor network: how much can the network transport before partition?

Shukla, Samta and Kuri, Joy (2012) Maximizing transported data in a wireless sensor network: how much can the network transport before partition? In: Sixth International Conference on Sensor Technologies and Applications, August 24, 2012, Rome, Italy.

PDF Sen_Tech_Appl_215_2012.pdf - Published Version Restricted to Registered users only Download (392kB) | Request a copy

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.

Item Type:	Conference Paper
Publisher:	IARIA
Additional Information:	Copyright of this article belongs to IARIA.
Keywords:	Network Partition Time (NPT); Maximal Independent Sets(MIS); Node-Disjoint Paths (NDPs); Link-Contention Graph (LCG)
Department/Centre:	Division of Electrical Sciences > Electronic Systems Engineering (Formerly Centre for Electronic Design & Technology)
Date Deposited:	29 Nov 2013 05:48
Last Modified:	29 Nov 2013 05:48
URI:	http://eprints.iisc.ac.in/id/eprint/47866

Actions (login required)

View Item