E-Span and LPT for data aggregation in wireless sensor networks

In wireless sensor networks (WSNs), when a stimulus or event is detected within a particular region, data reports from the neighboring sensor nodes (sources) are sent to the sink (destination). Data from these sources are usually aggregated along their way to the sink. The data aggregation via in-network processing reduce communication cost and improves energy efficiency. In this paper, we propose two different tree structures to facilitate data aggregation. We first propose E-Span, which is an energy-aware spanning tree algorithm. In E-span, the source node which has the highest residual energy is chosen as the root. Other source nodes choose their corresponding parent node among their neighbors based on the information of the residual energy and distance to the root. We also propose the Lifetime-Preserving Tree (LPT). In LPT, nodes which have higher residual energy are chosen as the aggregating parents. LPT also includes a self-healing feature by which the tree will be re-constructed again whenever a node is no longer functional or a broken link is detected. By choosing Directed Diffusion [C. Intanagonwiwat, R. Govindan, D. Estrin, Directed diffusion: a scalable and robust communication paradigm for sensor networks, in: Proc. of ACM MobiCom'00, Boston, MA, Aug. 2000, pp. 56-67.] as the underlying routing platform, simulation results show that in a WSN with 250 sensor nodes, the lifetime of sources can be extended significantly when data are aggregated by using either E-Span or LPT algorithms.

[1]  Konstantinos Kalpakis,et al.  An efficient clustering-based heuristic for data gathering and aggregation in sensor networks , 2003, 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003..

[2]  Gregory J. Pottie,et al.  Wireless integrated network sensors , 2000, Commun. ACM.

[3]  Weinan Marc Lee,et al.  LPT for data aggregation in wireless sensor networks , 2005, GLOBECOM '05. IEEE Global Telecommunications Conference, 2005..

[4]  Ossama Younis,et al.  HEED: a hybrid, energy-efficient, distributed clustering approach for ad hoc sensor networks , 2004, IEEE Transactions on Mobile Computing.

[5]  Zhen Liu,et al.  Maximum lifetime routing in wireless ad-hoc networks , 2004, IEEE INFOCOM 2004.

[6]  Paolo Santi,et al.  Investigating upper bounds on network lifetime extension for cell-based energy conservation techniques in stationary ad hoc networks , 2002, MobiCom '02.

[7]  Wei Nan Marc Lee THE CONSTRUCTION OF A LIFETIME-PRESERVING TREE FOR DATA AGGREGATION IN WIRELESS SENSOR NETWORKS , 2004 .

[8]  Jennifer C. Hou,et al.  On deriving the upper bound of α-lifetime for large sensor networks , 2004, MobiHoc '04.

[9]  Mingyan Liu,et al.  Analysis of energy consumption and lifetime of heterogeneous wireless sensor networks , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.

[10]  Sandeep K. S. Gupta,et al.  A low-latency and energy-efficient algorithm for convergecast in wireless sensor networks , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

[11]  Deborah Estrin,et al.  Directed diffusion: a scalable and robust communication paradigm for sensor networks , 2000, MobiCom '00.

[12]  Catherine Rosenberg,et al.  A minimum cost heterogeneous sensor network with a lifetime constraint , 2005, IEEE Transactions on Mobile Computing.

[13]  Guohong Cao,et al.  DCTC: dynamic convoy tree-based collaboration for target tracking in sensor networks , 2004, IEEE Transactions on Wireless Communications.

[14]  Xiuzhen Cheng,et al.  Aggregation tree construction in sensor networks , 2003, 2003 IEEE 58th Vehicular Technology Conference. VTC 2003-Fall (IEEE Cat. No.03CH37484).

[15]  Randy H. Katz,et al.  Next century challenges: mobile networking for “Smart Dust” , 1999, MobiCom.

[16]  David Simplot-Ryl,et al.  Energy-efficient area monitoring for sensor networks , 2004, Computer.

[17]  Mingyan Liu,et al.  A Modeling Framework for Computing Lifetime and Information Capacity in Wireless Sensor Networks , 2004 .

[18]  V.W.S. Wong,et al.  An energy-aware spanning tree algorithm for data aggregation in wireless sensor networks , 2005, PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005..

[19]  Robert Cole,et al.  Computer Communications , 1982, Springer New York.

[20]  Robert Metcalfe,et al.  Reverse path forwarding of broadcast packets , 1978, CACM.