RECA: Referenced energy-based CDS algorithm in wireless sensor networks

International Journal of Communication Systems

Volumn 23, Issue 1, 2010, Pages 125-138

  Ma, Yajie ^a,b   Guo, Yike ^a   Ghanem, Moustafa ^a  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

^b WUHAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

Author keywords

Connected dominating set; Referenced energy; Sensor networks; Topology aggregation

Indexed keywords

CDS; CONNECTED DOMINATING SET; CONNECTED DOMINATING SETS; DOMINATING SETS; ENERGY CHARACTERISTICS; ENERGY SENSORS; HIERARCHICAL ROUTINGS; RANDOM TOPOLOGY; SAVE ENERGY; TOPOLOGY AGGREGATIONS; VIRTUAL BACKBONE;

AD HOC NETWORKS; ALGORITHMS; DATA STORAGE EQUIPMENT; MOBILE TELECOMMUNICATION SYSTEMS; SENSOR NETWORKS; TOPOLOGY; WIRELESS TELECOMMUNICATION SYSTEMS;

WIRELESS SENSOR NETWORKS;

EID: 73849125621     PISSN: 10745351     EISSN: 10991131     Source Type: Journal    
DOI: 10.1002/dac.1053     Document Type: Article

References (27)

1. Römer K. Mattern F. The design space of wireless sensor networks. IEEE Wireless Communications 2004; 11(6):54-61.
2. Hænselmnn T. Sensornetworks. GFDL Wireless Sensor Network Textbook. Informatik: Mannheim, Germany, 2006. Available at: http://www.informatik.uni-mannheim.de/~haensel/sn-book/.
3. Raghunathan V, Schurgers C, Park S, Srivastaval MB. Energy-aware wireless microsensor networks. IEEE Signal Processing Magazine 2002; 19(2):40-50.
4. Blum J, Ding M, Thaeler A, Cheng X. Connected dominating set in sensor networks and MANETs. Handbook of Combinatorial Optimization. Kluwer Academic Publishers: Dordrecht, Netherlands, 2004.
5. Ingelrest F, Simplot-Ryl D, Stojmenovic I. Smaller connected dominating sets in ad hoc and sensor networks based on coverage by two-hop neighbors. Proceedings of 2nd International Conference on Communication Systems Sof tware and Middleware, Bangalore, India, January 2007; 1-8.
6. Wu J. Extended dominating-set-based routing in ad hoc wireless networks with unidirectional links. IEEE Transactions on Parallel and Distributed Systems 2002; 13(9):866-881.
7. Li J, Foh CH, Andrew LLH, Zukerman M. Sizes of minimum connected dominating sets of a class of wireless sensor networks. Proceedings of IEEE International Conference on Communications, Beijing, China, May 2008; 332-336.
8. Yuanyuan Z, Xiaohua J, Yanxuag H. A distributed algorithm for constructing energy-balanced connected dominating set in wireless sensor networks. International Journal of Sensor Networks 2007; 2(1/2):68-76.
9. Haynes TW, Hedetniemi S, Slater P. Fundamentals of Domination in Graphs. Marcel Dekker: New York, 1998.
10. Wu J, Dai F, Gao M. On calculating power-aware connected dominating sets for efficient routing in ad hoc wireless networks. Journal of Communication and Networks 2002; 4(1):59-70.
11. Dai F, Wu J. An extended localized algorithm for connected dominating set formation in ad hoc wireless networks. IEEE Transactions on Parallel and Distributed Systems 2004; 15(10):908-920.
12. Ye F, Zhong G, Lu S, Zhang L. PEAS: a robust energy conserving protocol for long-lived sensor networks. Proceedings of IEEE International Conference on Network Protocols, Washington, DC, U.S.A., November 2002; 200-201.
13. Tian D, Georganas ND. A coverage-preserving node scheduling scheme for large wireless sensor networks. Proceedings of 1st ACM Workshop Wireless Sensor Networks and Applications, Atlanta, U.S.A., September 2002; 32-41.
14. Carle J, Simplot-Ryl D. Energy-efficient area monitoring for sensor networks. Computer 2004; 37(2):40-46.
15. Ingelrest F, Simplot-Ryl D, Stojmenovic I. A dominating sets and target radius based localized activity scheduling and minimum energy broadcast protocol for ad hoc and sensor networks. IEEE Transactions on Parallel and Distributed Systems 2006; 17(6):536-547.
16. Ma J, Ni LM. Low-overhead dominating set based algorithms for maximizing lifetime in wireless sensor networks. Proceedings of IEEE International Conference on Mobile Ad hoc and Sensor Systems, Pisa, Italy, October 2007; 1-9.
17. Garey ML, Johnson DS. Computers and Interactability: A Guide to the Theory of NP-Completeness.W. H. Freeman: San Francisco, 1979.
18. Guha S, Khuller S. Approximation algorithms for connected dominating sets. Algorithmica 1998; 20(4):374-387.
19. Cheng X. Routing issues in ad hoc wireless networks. Ph.D. Thesis, Department of Computer Science, University of Minnesota, 2002.
20. Wan P-J, Alzoubi KM, Frieder O. Distributed construction of connected dominating sets in wireless ad hoc networks. Discrete Algorithms and Methods for Mobile Computing and Communications 2004; 9(2):141-149.
21. Ruan L, Du DH, Jia X, Wu W, Li Y, Ko K-I. A greedy approximation for minimum connected dominating sets. Theoretical Computer Science 2004; 329(1-3):325-330.
22. Das B, Sivakumar R, Bharghavan V. Routing in ad-hoc networks using a spine. Proceedings of the 6th International Conference on Computer Communications and Networks, Las Vegas, U.S.A., September 1997; 34-39.
23. Das B, Bharghavan V. Routing in ad-hoc networks using minimum connected dominating sets. Proceedings of International Conference on Communications, Montreal, Canada, June 1997; 376-380.
24. Wu W, Du H, Jia X, Yingshu L, Huang SC-H. Minimum connected dominating sets and maximal independent sets in unit disk graphs. Theoretical Computer Science 2006; 352(1):1-7.
25. Adjih C, Jacquet P, Viennot L. Computing connected dominated sets with multipoint relays. Ad Hoc and Sensor Networks 2005; 1(1):27-39.
26. Cartigny J, Ingelrest F, Simplot-Ryl D, Stojmenovic I. Localized LMST and RNG based minimum-energy broadcast protocols in ad hoc networks. Ad hoc Networks 2004; 3(1):1-16.
27. Heinzelman WB, Chandrakasan AP, Balakrishnan H. An application-specific protocol architecture for wireless microsensor networks. IEEE Transactions on Wireless Communications 2002; 1(4):660-670.