Bounded-distance multi-clusterhead formation in wireless ad hoc networks

Ad Hoc Networks

Volumn 5, Issue 4, 2007, Pages 504-530

  Spohn, Marco Aurélio ^a   Garcia Luna Aceves, J J ^b,c  

^a FEDERAL UNIVERSITY OF CAMPINA GRANDE   (Brazil)

^b University of California Santa Cruz   (United States)

^c PALO ALTO RESEARCH CENTER   (United States)

Author keywords

(k, r) dominating sets; Ad hoc networks; Clustering; Distance domination; Domination in graphs; Multi core multicast protocols; Multicast protocols; Multiple domination

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; MOBILE TELECOMMUNICATION SYSTEMS; NETWORK PROTOCOLS; WIRELESS TELECOMMUNICATION SYSTEMS;

AD HOC NETWORKS; CLUSTERING; DISTANCE DOMINATION; DOMINATION IN GRAPHS; MULTI CORE MULTICAST PROTOCOLS; MULTICAST PROTOCOLS; MULTIPLE DOMINATION;

TELECOMMUNICATION NETWORKS;

EID: 33847012479     PISSN: 15708705     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.adhoc.2006.01.005     Document Type: Article

References (53)

1. Younis O., and Fahmy S. Heed: a hybrid, energy-efficient, distributed clustering approach for ad hoc sensor networks. Transactions on Mobile Computing 3 4 (2004) 366-379
2. Chen B., Jamieson K., Balakrishnan H., and Morris R. Span: an energy-efficient coordination algorithm for topology maintenance in ad hoc wireless networks. MobiCom'01: Proceedings of the 7th Annual International Conference on Mobile Computing and Networking (2001), ACM Press 85-96
3. S. Bandyopadhyay, E. Coyle, An energy efficient hierarchical clustering algorithm for wireless sensor networks, in: IEEE INFOCOM, 2003, pp. 1713-1723.
4. Bao L., and Garcia-Luna-Aceves J.J. Topology management in ad hoc networks. MobiHoc'03: Proceedings of the 4th ACM International Symposium on Mobile Ad hoc Networking and Computing (2003), ACM Press 129-140
5. Li X.-Y. Ad Hoc Networking (2003), IEEE Press (Chapter: Topology control in wireless ad hoc networks)
6. W. Heinzelman, Application-specific protocol architectures for wireless networks, Ph.D. thesis, Massachusetts Institute of Technology, 2000.
7. Chen Y.P., Liestman A.L., and Liu J. Ad Hoc and Sensor Networks (2004), Nova Science Publisher (Chapter: Clustering algorithms for ad hoc wireless networks)
8. Garey M.R., and Johnson D.S. Computers and Intractability (1978), Freeman, San Francisco
9. In: Haynes T.W., Hedetniemi S.T., and Slater P.J. (Eds). Fundamentals of Domination in Graphs (1998), Marcel Dekker, Inc.
10. D. Joshi, S. Radhakrishnan, C. Narayanan, A fast algorithm for generalized network location problems, in: Proceedings of the ACM/SIGAPP Symposium on Applied Computing, 1993, pp. 701-708.
11. Kleinrock L., and Kamoun F. Optimal clustering structures for hierarchical topological design of large computer networks. Networks 10 (1980) 221-248
12. Tsuchiya P.F. The landmark hierarchy: a new hierarchy for routing in very large networks. SIGCOMM'88: Symposium Proceedings on Communications Architectures and Protocols (1988), ACM Press 35-42
13. Shacham N., and Westcott J. Future directions in packet radio architectures and protocols. Proceedings of the IEEE 75 1 (1987) 83-99
14. G. Pei, M. Gerla, X. Hong, C. Chiang, A wireless hierarchical routing protocol with group mobility, in: Proceedings of the IEEE Wireless Communications and Networking Conference, vol. 3, 1999, pp. 1538-1542.
15. Pei G., Gerla M., and Hong X. Lanmar: landmark routing for large scale wireless ad hoc networks with group mobility. MobiHoc'00: Proceedings of the 1st ACM International Symposium on Mobile Ad hoc Networking and Computing (2000), IEEE Press 11-18
16. Ballardie T., Francis P., and Crowcroft J. Core based trees (cbt). SIGCOMM'93: Conference Proceedings on Communications Architectures, Protocols and Applications (1993), ACM Press 85-95
17. Akyildiz I., Su W., Sankarasubramaniam Y., and Cayirci E. A survey on sensor networks. Communications Magazine 4 8 (2002) 102-114
18. Chen G., Nocetti F., Gonzalez J., and Stojmenovic I. Connectivity based k-hop clustering in wireless networks. HICSS'02: Proceedings of the 35th Annual Hawaii International Conference on System Sciences (2002), IEEE Computer Society 2450-2459
19. M. Gerla, J.K. Taek, G. Pei, On-demand routing in large ad hoc wireless networks with passive clustering, in: Proceedings of the IEEE Wireless Communications and Networking Conference, 2000, pp. 100-105.
20. J. Wu, F. Dai, Broadcasting in ad hoc networks based on self-pruning, in: IEEE INFOCOM, 2003, pp. 2240-2250.
21. Wu J., and Li H. On calculating connected dominating set for efficient routing in ad hoc wireless networks. DIALM'99: Proceedings of the 3rd International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (1999), ACM Press 7-14
22. Sivakumar R., Sinha P., and Bharghavan V. Cedar: a core-extraction distributed ad hoc routing algorithm. IEEE Journal on Selected Areas in Communications 17 8 (1999)
23. F. Dai, J. Wu, Distributed dominant pruning in ad hoc networks, in: Proceedings of the IEEE International Conference on Communications, 2003, pp. 353-357.
24. J. Sucec, I. Marsic, An efficient distributed network-wide broadcast algorithm for mobile ad hoc networks, Tech. Rep. CAIP-248, Rutgers University, September 2000.
25. Stojmenovic I., Seddigh M., and Zunic J. Dominating sets and neighbor elimination-based broadcasting algorithms in wireless networks. IEEE Transactions on Parallel and Distributed Systems 13 1 (2002) 14-25
26. M.A. Spohn, J.J. Garcia-Luna-Aceves, Enhanced dominant pruning applied to the route discovery process of on-demand routing protocols, in: Proceedings of the 12th IEEE International Conference on Computer Communications and Networks, 2003, pp. 497-502.
27. Spohn M.A., and Garcia-Luna-Aceves J.J. Enhancing the route discovery process of on-demand routing in networks with directional antennas. Lecture Notes in Computer Science vol. 3042 (2004), Springer-Verlag GmbH 1000-1011
28. Lou W., and Wu J. On reducing broadcast redundancy in ad hoc wireless networks. IEEE Transactions on Mobile Computing 1 2 (2002) 111-122
29. P.-J. Wan, K.M. Alzoubi, O. Frieder, Distributed construction of connected dominating set in wireless ad hoc networks, in: IEEE INFOCOM, 2002, pp. 1597-1604.
30. Lim H., and Kim C. Flooding in wireless ad hoc networks. Computer Communications 2 3-4 (2001) 353-363
31. B. Das, R. Sivakumar, V. Bharghavan, Routing in ad hoc networks using a spine, in: ICCCN, 1997, pp. 34-39.
32. B. Das, V. Bharghavan, Routing in ad-hoc networks using minimum connected dominating sets, in: ICC (1), 1997, pp. 376-380.
33. T. Clausen, P. Jacquet, A. Laouiti, P. Muhlethaler, A. Qayyum, L. Viennot, Optimized link state routing protocol for ad hoc networks, in: Proceedings of the IEEE International Multi Topic Conference, 2001, pp. 62-68.
34. M.A. Spohn, J.J. Garcia-Luna-Aceves, Improving broadcast operations in ad hoc networks using two-hop connected dominating sets, in: Proceedings of the IEEE Global Telecommunications Conference Workshops, 2004, pp. 147-152.
35. A.D. Amis, R. Prakash, T.H.P. Vuong, D. Huynh, Max-min d-cluster formation in wireless ad hoc networks, in: IEEE INFOCOM, 2000, pp. 32-41.
36. Clark B., Colbourn C., and Johnson D. Unit disk graphs. Discrete Mathematics 86 (1990) 165-177
37. B. Liang, Z.J. Haas, Virtual backbone generation and maintenance in ad hoc network mobility management, in: IEEE INFOCOM, 2000, pp. 1293-1302.
38. Zappala D., Fabbri A., and Lo V. An evaluation of shared multicast trees with multiple cores. Telecommunication Systems 19 3-4 (2002) 461-479
39. Belding-Royer E.M. Multi-level hierarchies for scalable ad hoc routing. Wireless Networks 9 5 (2003) 461-478
40. Ramanathan R., and Steenstrup M. Hierarchically organized, multihop mobile wireless networks for quality-of-service support. Mobile Networks and Applications 3 1 (1998) 101-119
41. F. Dai, J. Wu, On constructing k-connected k-dominating set in wireless networks, in: Proceedings of the IEEE IPDPS, 2005.
42. Z. Shi, P.K. Srimani, A new adaptive distributed routing protocol using d-hop dominating sets for mobile ad hoc networks, in: Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA), 2004.
43. Y. Fernandess, D. Malkhi, K-clustering in wireless ad hoc networks, in: Proceedings of the ACM Workshop on Principles of Mobile Computing (POMC), 2002.
44. P. Krishna, N.N. Vaidya, M. Chatterjee, D.K. Pradhan, A cluster-based approach for routing in dynamic networks, in: ACM SIGCOMM Computer Communication Review, 1997, pp. 49-64.
45. D. Kim, S. Ha, Y. Choi, k-hop cluster-based dynamic source routing in wireless ad-hoc packet radio networks, in: Proceedings of the IEEE VTC, 1998, pp. 224-228.
46. Gafni E. Round-by-round fault detectors (extended abstract): unifying synchrony and asynchrony. PODC'98: Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing (1998), ACM Press 143-152
47. M. Mosko, J.J. Garcia-Luna-Aceves, A self-correcting neighbor protocol for mobile ad hoc wireless networks, in: Proceedings of the IEEE International Conference on Computer Communications and Networks, 2002, pp. 556-560.
48. Gerla M., and Tsai J. Multicluster, mobile, multimedia radio network. ACM Baltzer Journal of Wireless Networks 1 3 (1995) 255-265
49. J. Wu, F. Dai, A generic distributed broadcast scheme in ad hoc wireless networks, in: Proceedings of the IEEE International Conference on Distributed Computing Systems, 2003, pp. 460-467.
50. R. Vaishampayan, J.J. Garcia-Luna-Aceves, Efficient and robust multicast routing in mobile ad hoc networks, in: Proceedings of the IEEE International Conference on Mobile Ad-hoc and Sensor Systems, 2004, pp. 304-313.
51. S.-J. Lee, M. Gerla, C.-C. Chiang, On-demand multicast routing protocol, in: Proceedings of the IEEE Wireless Communications and Networking Conference, 1999, pp. 1298-1302.
52. Royer E.M., and Perkins C.E. Multicast operation of the ad-hoc on-demand distance vector routing protocol. MobiCom'99: Proceedings of the 5th Annual ACM/IEEE International Conference on Mobile Computing and Networking (1999), ACM Press 207-218
53. Scalable Network Technologies, qualnet simulator, Available from: , 2003.