Construction of tree network with limited delivery latency in homogeneous wireless sensor networks

Wireless Personal Communications

Volumn 78, Issue 1, 2014, Pages 231-246

  Xie, Shengdong ^a,b   Wang, Yuxiang ^a  

^a NANJING UNIVERSITY OF INFORMATION SCIENCE AND TECHNOLOGY   (China)

^b SOUTHEAST UNIVERSITY   (China)

Author keywords

Approximation algorithm; Limited delivery latency; Tree network; Wireless sensor networks

Indexed keywords

APPROXIMATION ALGORITHMS; COMPRESSION RATIO (MACHINERY); SENSOR NODES; TOPOLOGY; WIRELESS SENSOR NETWORKS;

APPROXIMATION RESULTS; LIMITED DELIVERY LATENCY; MONI-TORING NODES; NEIGHBOR GRAPH; NETWORK LIFETIME; TOPOLOGY FORMATION; TREE CONSTRUCTION; TREE NETWORK;

TREES (MATHEMATICS);

EID: 84906330795     PISSN: 09296212     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11277-014-1748-5     Document Type: Article

References (21)

1. Wang, F.; Liu, J. (2011). Networked wireless sensor data collection: Issues, challenges, and approaches. IEEE Communications Surveys & Tutorial, 13(4), 1-15.
2. Zhao, M.; Gong, D. W.; Yang, Y. Y. (2010). A cost minimization algorithm for mobile data gathering in wireless sensor networks. In IEEE 7th international conference on mobile adhoc and sensor systems (MASS), San Francisco, CA, pp. 322-331.
3. Hwang, K.; Choi, B. J.; Kang, S. H. (2010). Enhanced self-configure scheme for a robust Zigbee based home automation. IEEE Transactions on Consumer Electronics, 56(3), 583-590.
4. Puccinelli, D.; Haenggi, M. (2009, April). Lifetime benefits through load balancing in homogeneous sensor networks. In IEEE wireless communications and networking conference (WCNC) (pp. 1-6). Hungary: Budapest.
5. Corchado, J. M.; Bajo, J.; Tapia, D. I.; Abraham, A. (2010). Using heterogeneous wireless sensor networks in a telemonitoring system for healthcare. IEEE Transactions on Information Technology in Biomedicine, 14(2), 234-240.
6. He, J.; Ji, S. L.; Yang, M. Y.; Li, Y. S. (2012). Load-balanced CDS construction in wireless sensor networks via genetic algorithm. International Journal of Sensor Networks, 11(3), 166-178.
7. Hsieh, M. Y. (2011). Data aggregation model using energy efficient delay scheduling in multi-hop hierarchical wireless sensor networks. IET Communications, 5(18), 2703-2711.
8. Ding, M.; Cheng, X. Z. (2003). Aggregation tree construction in sensor networks. In IEEE 58th vehicular technology conference (VTC) (pp. 2168-2172). Florida, Orlando.
9. Wu, Y.; Fahmy, S.; Ness, B. S. (2008). On the construction of a maximum lifetime data gathering tree in sensor networks: NP-completeness and approximation algorithm (pp. 356-365). Phoenix, USA: IEEE InfoCom.
10. Singhal, D.; Barjatiya, & S.; Ramamurthy, G. (2011). A novel network architecture for cognitive wireless sensor network. In Proceedings of 2011 international conference on signal processing, communications, computing and networking technologies (pp. 76-80) Thuckalay, India.
11. Andreou, P.; Pamboris, A.; Zeinalipour, D.; Chrysanthis, P.K.; Samaras, G. (2009). ETC: Energy driven tree construction in wireless sensor networks. In IEEE 10th international conference on mobile data management: Systems, services and middleware (MDM), pp. 513-518.
12. Georigios, C.; Demetrios, Z. Y.; Dimitrios, G. (2010). Minimum hot spot query tree for wireless sensor networks (pp. 1-8). Indianapolis: ACM MobiDE.
13. Pan, M. S.; Tsai, C. H.; Tseng, Y. C. (2009). The orphan problem in Zigbee wireless networks. IEEE Transactions on Mobile Computing, 8(11), 1573-1584.
14. Su, Z.; Oguro, M.; Okada, Y.; Katto, J.; Okubo, S. (2010). Overlay tree construction to distribute layered streaming by application layer multicast. IEEE Transactions on Consumer Electronics, 56(3), 1957-1962.
15. Tavli, B.; Bagci, I. E.; Ceylan, O. (2010). Optimal data compression and forwarding in wireless sensor networks. IEEE Communications Letters, 14(5), 408-410.
16. Tsai, H. P.; Yang, D. N.; Chen, M. S. (2011). Exploring application level semantics for data compression. IEEE Transactions on Knowledge and Data Engineering, 23(1), 95-109.
17. Blin, L.; Butelle, F. (2004). The first approximated distributed algorithm for the minimum degree spanning tree problem on general graphs. International Journal of Foundations of Computer Science, 15(3), 507-516.
18. Lavault, C.; Mario, V. P. (2008). A distributed approximation algorithm for the minimum degree minimum weight spanning trees. Journal of Parallel and Distributed Computing, 68(2), 200-208.
19. Martin, F.; Balaji, R. (1992). Approximating the minimum degree spanning tree to within one from the optimal degree. In 3th ACM/SIAM symposium on discrete algorithms (SODA) (pp. 317-324). Florida, Orlando.
20. Radha, K.; Balaji, R. (2001). The directed minimum degree spanning tree problem. Lecture notes in computer science (LNCS), pp. 232-243.
21. Intanagonwiwat, C.; Govindan, R.; Estrin, D. (2000). Directed diffusion: A scalable and robust communication paradigm for sensor networks. In Proceedings of the 6th annual international conference on mobile computing and networking (pp. 56-67). MobiCom: New York, NY.