Bounded-distance multi-coverage backbones in wireless sensor networks

Proceedings of the ACM Symposium on Applied Computing

Volumn , Issue , 2007, Pages 203-208

  Sausen, P S ^a   Spohn, M A ^b   Lima, A M N ^b   Perkusich, A ^b  

^a UNIVERSIDADE REGIONAL DO NOROESTE DO ESTADO DO RIO GRANDE DO SUL   (Brazil)

^b FEDERAL UNIVERSITY OF CAMPINA GRANDE   (Brazil)

Author keywords

Backbone; Connected dominating sets; Domination in graphs; Wireless sensor networks

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS; ELECTRIC NETWORK TOPOLOGY; GRAPH THEORY; SET THEORY;

CONNECTED DOMINATING SETS; DOMINATION IN GRAPHS;

WIRELESS SENSOR NETWORKS;

EID: 35248818226     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1244002.1244056     Document Type: Conference Paper

References (13)

1. I. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci. A survey on sensor networks. IEEE Communications Magazine, 40(8):102-114, 2002.
2. K. M. Alzoubi, P.-J. Wan, and O. Frieder. Distributed heuristics for connected dominating sets in wireless ad hoc networks. Journal of Communications and Networks, 4(1):22-29, 2002.
3. L. Bao and J. J. Garcia-Luna-Aceves. Topology management in ad hoc networks. In MobiHoc, pages 129-140, New York, NY, USA, 2003. ACM Press.
4. P. Basu and J. Redi. Movement Control Algorithms for Realization of fault Tolerant Ad Hoc Robot Networks. In IEEE Network, 18:36-44, July-August 2004.
5. Y. P. Chen and A. L. Liestman. Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks. In MobiHoc, pages 165-172, New York, NY, USA, 2002. ACM Press.
6. B. Clark, C. Colbourn, and D. Johnson. Unit disk graphs. Discrete Math, 86:165-177, 1990.
7. F. Dai and J. Wu. On constructing k-connected k-dominating set in wireless networks. In IPDPS, Denver, CA, USA, 2005. IEEE Computer Society.
8. B. Das and V. Bharghavan. Routing in Ad-Hoc Networks Using Minimum Connected Dominating Sets. ICC, pages 376-380, June 1997.
9. M. Garey and D. Johnson. Computers and Intractability: A Guide to NP-Completeness. Freeman, San Francisco, California, 1978.
10. N. Li and J. C. Hou. FLSS: a Fault-Tolerant Topology Control Algorithm for Wireless Networks. In MobiCom, pages 275-286, New York, NY, USA, 2004. ACM Press.
11. V. Paruchuri, A. Durresi, M. Durresi, and L. Barolli. Routing through backbone structures in sensor networks. In ICPADS, volume 2, pages 397-401, Fuduoka, Japani, July 2005.
12. M. A. Spohn and J. J. Garcia-Luna-Aceves. Bounded-distance multi-clusterhead formation in wireless ad hoc networks. Ad Hoc Networks (Elsevier), 2006. http://dx.doi.org/10.1016/j.adhoc.2006.01.005.
13. J. Wu and F. Dai. Broadcasting in ad hoc networks based on self-pruning. IEEE INFOCOM, pages 2240-2250, March 2003.