Title :
A cost-efficient algorithm for finding connected dominating sets in static wireless ad hoc networks with obstacles
Author :
Raj, Abhishek ; Saha, Debashis ; Dasgupta, Parthasarathi
Author_Institution :
Tata Consultancy Services Ltd., Mumbai, India
Abstract :
We present a cost-efficient algorithm for spine identification in networks with obstacles with a view for finding connected dominating sets in static wireless ad hoc networks with obstacles (e.g., a sensor network in a disaster site).
Keywords :
ad hoc networks; set theory; connected dominating set; cost efficient algorithm; disaster site; networks obstacles; spine identification; static wireless ad hoc networks; Algorithm design and analysis; Complexity theory; Mobile ad hoc networks; Nominations and elections; Routing; Wireless networks;
Conference_Titel :
Advanced Networks and Telecommunication Systems (ANTS), 2010 IEEE 4th International Symposium on
Conference_Location :
Mumbai
Print_ISBN :
978-1-4244-9852-9
DOI :
10.1109/ANTS.2010.5983533
