A novel distributed MCDS approximation algorithm for wireless sensor networks

Wireless Communications and Mobile Computing

Volumn 9, Issue 3, 2009, Pages 427-437

  Xie, Rong ^a   Qi, Deyu ^a   Li, Yongjun ^a   Wang, James Z ^b  

^a SOUTH CHINA UNIVERSITY OF TECHNOLOGY   (China)

^b AMRL   (United States)

Author keywords

Connected dominating set; Distributed algorithm; Hierarchical graph; Wireless sensor network

Indexed keywords

DATA STORAGE EQUIPMENT; PARALLEL ALGORITHMS; ROUTING ALGORITHMS; ROUTING PROTOCOLS; SENSOR NETWORKS; WIRELESS SENSOR NETWORKS; WIRELESS TELECOMMUNICATION SYSTEMS;

ALGORITHM MODELS; ARBITRARY GRAPHS; CDS; COMMUNICATION OVERHEADS; CONNECTED DOMINATING SET; DISTRIBUTED ALGORITHM; EFFICIENT ROUTING IN WIRELESS SENSOR NETWORKS; FORMAL ANALYSIS; HIERARCHICAL GRAPH; HIERARCHICAL LEVELS; MINIMUM CONNECTED DOMINATING SETS; NP-HARD PROBLEMS; ROUTE MESSAGES;

APPROXIMATION ALGORITHMS;

EID: 63049097457     PISSN: 15308669     EISSN: None     Source Type: Journal    
DOI: 10.1002/wcm.547     Document Type: Article

References (15)

1. Lee J, Mans B. Energy-efficient virtual backbones for reception-aware MANET. Vehicular Technology Conference. VTC, Vol. 3, pp. 1097-1101, 2006.
2. Guha S, Khuller S. Approximation algorithms for connected dominating sets. Algorithmica 1998; 20(4): 374-387.
3. Das B, Sivakumar R, Bhargavan V. Routing in ad hoc networks using a spine. Proceedings of 6th IEEE International Conference on Computers Communications and Networks (IC3N'97), pp. 1-20, September 1997.
4. Butenko S, Cheng X, Oliveira C, Pardalos PM. A new heuristic for the minimum connected dominating set problem on ad hoc wireless networks. In Recent Developments in Cooperative Control and Optimization, Butenko S, Murphey R, Pardalos P (eds). Kluwer Academic Publishers, 2004; 61-73.
5. Alzoubi KM, Wan P-J, Frieder O. Maximal independent set, weakly connected dominating set, and induced spanners for mobile ad hoc networks. International Journal of Foundations of Computer Science 2003; 14(2): 287-303.
6. Gao B, Yang Y, Ma H. A new distributed approximation algorithm for constructing minimum connected dominating set in wireless ad hoc networks. International Journal of Communication Systems 2005; 18(8): 734-762.
7. Li Y, Thai MT, Wang F, Yi C-W, Wang P-J, Du D-Z. On greedy construction of connected dominating sets in wireless networks. Special issue of Wireless Communications and Mobile Computing (WCMC), 2005.
8. Wang Y, Wang W, Li X-Y Efficient distributed low-cost backbone formation for wireless networks. IEEE Transactions on Parallel and Distributed Systems. 2006; 17(7): 681-693.
9. Gewali L, Mohamad K, Min T. Interference aware dominating set for sensor network, information technology: new generations, 2006. ITNG 2006. Third International Conference on 10-12 April 2006, pp. 268-273.
10. Wu J, Li H. On calculating connected dominating set for efficient routing in ad hoc wireless networks. In Proceedings of the 3rd International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, pp. 7-14, Seattle, USA, August 1999.
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. Stojmenovic I, Seddigh M, Zunic J. Dominating sets and neighbor elimination based broadcasting algorithms in wireless networks. In Proceedings of IEEE Hawaii International Conference on System Sciences, 2001.
13. Ehrig H. Introduction to the algebraic theory of graph grammars (a survey). Proceedings of the International Workshop on Graph-Grammars and Their Application to Computer Science and Biology, pp. 1-69, 30 October-03 November, 1978.
14. Johnson DS. Approximation algorithms for combinatorial problems. Proceedings of the 5th Annual ACM Symposium on Theory of Computing, pp. 38-49, Austin, Texas, USA, 30 April-02 May, 1973.
15. LBL, Xerox PARC, UCB, and USC/ISI, The Network Simulator-ns2, http://www.isi.edu/nsnam/ns/, 2007