Location, location, location: Using central nodes for efficient data collection in WSNs

We study the problem of data collection in Wireless Sensor Networks (WSN). A typical WSN is composed of wireless sensor nodes that periodically sense data and forward it to the base station in a multi-hop fashion. We are interested in designing an efficient data collection tree routing, focusing on three optimization objectives: energy efficiency, transport capacity, and hop-diameter (delay). In this paper we develop single- and multi-hop data collection, which are based on two definitions of node centrality: centroids and balance nodes. We provide theoretical performance analysis for both approaches, present their distributed implementation and discuss the different aspects of using each. Most of our results are for two-dimensional WSNs, however we also show that the centroid-based approach is asymptotically optimal in three-dimensional random node deployments. We also show several simulation results that support our theoretical findings.

[1]  Hanan Shpungin,et al.  On construction of minimum energy k-fault resistant topologies , 2009, Ad Hoc Networks.

[2]  Hanan Shpungin,et al.  Energy and Lifetime Efficient Connectivity in Wireless Ad-Hoc Networks , 2010, Ad Hoc Sens. Wirel. Networks.

[3]  Tian He,et al.  Realistic and Efficient Multi-Channel Communications in Wireless Sensor Networks , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[4]  Andrea E. F. Clementi,et al.  On the Power Assignment Problem in Radio Networks , 2004, Mob. Networks Appl..

[5]  Sartaj Sahni,et al.  Maximum Lifetime Broadcasting in Wireless Networks , 2005, IEEE Trans. Computers.

[6]  J. Michael Steele,et al.  Probability and Problems in Euclidean Combinatorial Optimization , 1993 .

[7]  Afonso Ferreira,et al.  The Minimum Range Assignment Problem on Linear Radio Networks , 2002, Algorithmica.

[8]  Bhaskar Krishnamachari,et al.  Fast Data Collection in Tree-Based Wireless Sensor Networks , 2012, IEEE Transactions on Mobile Computing.

[9]  P. Viswanath,et al.  Upper bounds to transport capacity of wireless networks , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[10]  Magnús M. Halldórsson,et al.  Distributed connectivity of wireless networks , 2012, PODC '12.

[11]  Paul J.M. Havinga,et al.  A Lightweight Medium Access Protocol (LMAC) for Wireless Sensor Networks: Reducing Preamble Transmissions and Transceiver State Switches , 2004 .

[12]  Ariel Orda,et al.  Maximum-lifetime routing algorithms for networks with omnidirectional and directional antennas , 2005, MobiHoc '05.

[13]  Jeffrey Stanford,et al.  Approximation Algorithm for Maximum Lifetime in Wireless Sensor Networks with Data Aggregation , 2006, SNPD.

[14]  Baruch Awerbuch,et al.  Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems , 1987, STOC.

[15]  Gruia Calinescu,et al.  Network Lifetime and Power Assignment in ad hoc Wireless Networks , 2003, ESA.

[16]  Panganamala Ramana Kumar,et al.  On the path-loss attenuation regime for positive cost and linear scaling of transport capacity in wireless networks , 2006, IEEE Transactions on Information Theory.

[17]  Panganamala Ramana Kumar,et al.  The transport capacity of wireless networks over fading channels , 2004, IEEE Transactions on Information Theory.

[18]  Jochen Könemann,et al.  Faster and simpler algorithms for multicommodity flow and other fractional packing problems , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[19]  Gruia Calinescu,et al.  Bounded-hops power assignment in ad-hoc wireless networks , 2004, 2004 IEEE Wireless Communications and Networking Conference (IEEE Cat. No.04TH8733).

[20]  J. Yukich,et al.  Asymptotics for Euclidean functionals with power-weighted edges , 1996 .

[21]  Hanan Shpungin.  Energy efficient online routing in wireless ad hoc networks , 2011, 2011 8th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks.

[22]  Hanan Shpungin,et al.  Near Optimal Multicriteria Spanner Constructions in Wireless Ad-Hoc Networks , 2009, INFOCOM 2009.

[23]  Hanan Shpungin,et al.  Novel algorithms for the network lifetime problem in wireless settings , 2008, Wirel. Networks.

[24]  Bhaskar Krishnamachari,et al.  Enhancing the Data Collection Rate of Tree-Based Aggregation in Wireless Sensor Networks , 2008, 2008 5th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks.

[25]  Ram Ramanathan,et al.  Topology control of multihop wireless networks using transmit power adjustment , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[26]  Andrzej Pelc,et al.  Power consumption in packet radio networks , 2000, Theor. Comput. Sci..

[27]  Kaveh Pahlavan,et al.  Wireless Information Networks , 1995 .

[28]  Panganamala Ramana Kumar,et al.  A network information theory for wireless communication: scaling laws and optimal operation , 2004, IEEE Transactions on Information Theory.

[29]  Yan Gao,et al.  Towards optimal rate allocation for data aggregation in wireless sensor networks , 2011, MobiHoc '11.

[30]  Michael Segal,et al.  Fast algorithm for multicast and data gathering in wireless networks , 2008, Inf. Process. Lett..

[31]  Stefan Funke,et al.  Bounded-Hop Energy-Efficient Broadcast in Low-Dimensional Metrics Via Coresets , 2007, STACS.

[32]  W. Rabiner,et al.  Design considerations for distributed microsensor systems , 1999, Proceedings of the IEEE 1999 Custom Integrated Circuits Conference (Cat. No.99CH36327).

[33]  Clyde L. Monma,et al.  Transitions in geometric minimum spanning trees , 1991, SCG '91.

[34]  Hanan Shpungin,et al.  Bounded-Hop Energy-Efficient Liveness of Flocking Swarms , 2013, IEEE Transactions on Mobile Computing.

[35]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .

[36]  K Ramanan,et al.  Data Gathering Algorithms for Wireless Sensor Networks: A Survey , 2010 .

[37]  Weifa Liang,et al.  Online Data Gathering for Maximizing Network Lifetime in Sensor Networks , 2007, IEEE Transactions on Mobile Computing.

[38]  Andrea E. F. Clementi,et al.  The Power Range Assignment Problem in Radio Networks on the Plane , 2000, STACS.

[39]  Peter Sanders,et al.  Energy Optimal Routing in Radio Networks Using Geometric Data Structures , 2002, ICALP.

[40]  Katia Obraczka,et al.  Energy-efficient collision-free medium access control for wireless sensor networks , 2003, SenSys '03.

[41]  Ian F. Akyildiz,et al.  Wireless sensor networks: a survey , 2002, Comput. Networks.

[42]  M. Segal,et al.  Low-Energy Fault-Tolerant Bounded-Hop Broadcast in Wireless Networks , 2009, IEEE/ACM Transactions on Networking.

[43]  Leandros Tassiulas,et al.  Energy conserving routing in wireless ad-hoc networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[44]  Hanan Shpungin,et al.  Optimizing performance of ad-hoc networks under energy and scheduling constraints , 2010, 8th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks.

[45]  Amit Kumar,et al.  Linear-time approximation schemes for clustering problems in any dimensions , 2010, JACM.

[46]  Konstantinos Kalpakis,et al.  Efficient algorithms for maximum lifetime data gathering and aggregation in wireless sensor networks , 2003, Comput. Networks.