An efficient distributed algorithm for finding virtual backbones in wireless ad-hoc networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3769 LNCS, Issue , 2005, Pages 302-311

  Paul, B ^a   Rao, S V ^a   Nandi, S ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY GUWAHATI   (India)

Author keywords

Connected dominating set; Independent set; MANET

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; DISTRIBUTED COMPUTER SYSTEMS; ELECTRONIC COMMUNITIES; WIRELESS TELECOMMUNICATION SYSTEMS;

CONNECTED DOMINATING SET; INDEPENDENT SET; MANET; MESSAGE COMPLEXITY;

ALGORITHMS;

EID: 33646743846     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11602569_33     Document Type: Conference Paper

References (17)

1. Clark, B.N., Colbourn, C.J., Johnson, D.S.: Unit disk graphs. Discrete Mathematics. 86 (1990) 165-177
2. Gerla, M., Tsai, J.T.C.: Multicuster, mobile, multimedia radio network. ACM-Baltzer Journal of wireless networks 1 (1995) 255-265
3. Chen, G., Stojmenovic, I.: Clustering and routing in mobile wireless networks. Technical report, University of Ottawa, Computer Science (1999)
4. Guha, S., Khuller, S.: Approximation algorithms for connected dominating sets. Algorithmica 20 (1998) 374-387
5. Bharghavan, V., Das, B.: Routing in adhoc networks using minimum connected dominating sets. In: IEEE International Conference on Communications (ICC'97). Volume 1., Montreal, Canada (1997) 376-380
6. Wu, J., Li, H.: On calculating connected dominating sets for efficient routing in adhoc wireless networks. In: Proc. of the 3rd Int'l Workshop on discrete algorithms and methods for mobile computing and communications. (1999) 7-14
7. Wan, P.J., Alzoubi, K.M., Frieder, O.: Distributed construction of connected dominating set in wireless adhoc networks. In: Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies. (2002) 1597-1604
8. Stojmenovic, I., Seddigh, M., Zunic, J.: Dominating sets and neighbor elimination based broadcasting algorithms in wireless networks. IEEE Transactions on Parallel and Distributed Systems (2002) 14-25
9. Alzoubi, K.M., Wan, P.J., Frieder, O.: Distributed heuristics for connected dominating set in wireless adhoc networks. IEEE ComSoc/KICS Journal of communications and networks 4 (2002) 22-29
10. Alzoubi, K.M., Wan, P.J., Frieder, O.: Message-optimal connected dominating sets in mobile adhoc networks. In: The Third ACM Int'l Symposium on mobile adhoc networking and computing. (2002) 157-164
11. Alzoubi, K.M., Wan, P.J., Frieder, O.: New distributed algorithm for connected dominating set in wireless adhoc networks. In: Proceedings of the 35th Annual Hawaii International Conference on System Sciences. (2002) 3849-3855
12. Dai, F., Wu, J.: An extended localised algorithm for connected dominating set formation in ad-hoc wireless networks. IEEE Transactions on Parallel and distributed systems 15 (2004)
13. Das, B., Sivakumar, R., Bharghavan, V.: Routing in adhoc network using a spine. In: Int'l Conference on computers and communications networks '97, Las Vegas, NV (1997) 34-39
14. Sivakumar, R., Das, B., Bharghaban, V.: An improved spine-based infrustructure for routing in adhoc networks. In: IEEE Symposium on Computers and Communications '98, Athens, Greece (1998)
15. Cidon, I., Mokryn, O.: Propagation and leader election in multihop broadcast environment. In: the 12th Int'l Symposium on Distributed Computing (DISC98), Greece (1998) 104-119
16. Marathe, M.V., Breu, H., III, H.B.H., Ravi, S.S., Rosenkrantz, D.J.: Simple heuristics for unit disk graphs. Networks 25 (1995) 59-68
17. Dai, P.: Dominating set simulation program, http://www.cse.fau.edu/fdai/ adhoc (2001)