Construction of Tree Network with Limited Delivery Latency in Homogeneous Wireless Sensor Networks

In this paper we propose an approximation algorithm, which is called ADCMCST (algorithm with the minimum number of child nodes when the depth is restricted), to construct a tree network for homogeneous wireless sensor network, so as to reduce and balance the payload of each node, and consequently prolong the network lifetime. When the monitoring node obtains the neighbor graph, ADCMCST tries to find a tree topology with a minimum number of child nodes, and then broadcast the topology to every node, and finally a tree network is constructed. Simulation results show that ADCMCST could greatly reduce the topology formation time, and achieve good approximation results; when the compression ratio is less than 70 %, the network lifetime of ADCMCST will be larger than that of energy driven tree construction.

[1]  Zhou Su,et al.  Overlay tree construction to distribute layered streaming by application layer multicast , 2010, IEEE Transactions on Consumer Electronics.

[2]  Yu-Chee Tseng,et al.  The Orphan Problem in ZigBee Wireless Networks , 2009, IEEE Transactions on Mobile Computing.

[3]  Yi Pan,et al.  Load-balanced CDS construction in wireless sensor networks via genetic algorithm , 2012, Int. J. Sens. Networks.

[4]  Radha Krishnan,et al.  The Directed Minimum-Degree Spanning Tree Problem , 2001, FSTTCS.

[5]  Byoung-Jo Choi,et al.  Enhanced self-configuration scheme for a robust ZigBee-based home automation , 2010, IEEE Transactions on Consumer Electronics.

[6]  Martin Fürer,et al.  Approximating the minimum degree spanning tree to within one from the optimal degree , 1992, SODA '92.

[7]  Deepti Singhal,et al.  A novel Network architecture for Cognitive Wireless Sensor Network , 2011, 2011 International Conference on Signal Processing, Communication, Computing and Networking Technologies.

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

[9]  Mario Valencia-Pabon,et al.  A distributed approximation algorithm for the minimum degree minimum weight spanning trees , 2008, J. Parallel Distributed Comput..

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

[11]  Daniele Puccinelli,et al.  Lifetime Benefits through Load Balancing in Homogeneous Sensor Networks , 2009, 2009 IEEE Wireless Communications and Networking Conference.

[12]  Yuanyuan Yang,et al.  A cost minimization algorithm for mobile data gathering in wireless sensor networks , 2010, The 7th IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE MASS 2010).

[13]  Ness B. Shroff,et al.  On the Construction of a Maximum-Lifetime Data Gathering Tree in Sensor Networks: NP-Completeness and Approximation Algorithm , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[14]  Bülent Tavli,et al.  Optimal data compression and forwarding in wireless sensor networks , 2010, IEEE Communications Letters.

[15]  M.-Y. Hsieh.  Data aggregation model using energy-efficient delay scheduling in multi-hop hierarchical wireless sensor networks , 2011, IET Commun..

[16]  Panos K. Chrysanthis,et al.  ETC: Energy-Driven Tree Construction in Wireless Sensor Networks , 2009, 2009 Tenth International Conference on Mobile Data Management: Systems, Services and Middleware.

[17]  Javier Bajo,et al.  Using Heterogeneous Wireless Sensor Networks in a Telemonitoring System for Healthcare , 2010, IEEE Transactions on Information Technology in Biomedicine.

[18]  Lélia Blin,et al.  The First Approximated Distributed Algorithm For The Minimum Degree Spanning Tree Problem On General Graphs , 2004, Int. J. Found. Comput. Sci..

[19]  Ming-Syan Chen,et al.  Exploring Application-Level Semantics for Data Compression , 2011, IEEE Transactions on Knowledge and Data Engineering.

[20]  Feng Wang,et al.  Networked Wireless Sensor Data Collection: Issues, Challenges, and Approaches , 2011, IEEE Communications Surveys & Tutorials.