Size-restricted cluster formation and cluster maintenance technique for mobile ad hoc networks

International Journal of Network Management

Volumn 17, Issue 2, 2007, Pages 171-194

  Venkataraman, Gayathri ^a   Emmanuel, Sabu ^a   Thambipillai, Srikanthan ^a  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; NETWORK MANAGEMENT; SCALABILITY; TELECOMMUNICATION NETWORKS; WIRELESS TELECOMMUNICATION SYSTEMS;

BOTTLENECK FAILURES; CLUSTER MAINTENANCE TECHNIQUE; LEAST CLUSTER HEAD CHANGES (LCC);

AD HOC NETWORKS;

EID: 33947664942     PISSN: 10557148     EISSN: 10991190     Source Type: Journal    
DOI: 10.1002/nem.643     Document Type: Article

References (38)

1. Ramanathan R, Steenstrup M. Hierarchically-organized, multihop mobile wireless networks for quality-of-service support. ACM/Baltzer Mobile Networks and Applications 1998; 3(1): 101-119.
2. Bandyopadhyay S, Coyle EJ. An energy efficient hierarchical clustering algorithm for wireless sensor networks. In Proceedings of the 22nd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2003), San Francisco, CA, 2003.
3. Fernandess Y, Malkhi D. K-clustering in wireless ad-hoc networks. In 2nd ACM Workshop on Principles of Mobile Computing (POMC'02), Toulouse, 2002.
4. Venkataraman G, Emmanuel S. Size and hop restricted cluster formation in mobile ad-hoc network. In Proceedings of LASTED International Conference on Networks and Communication Systems (NCS 2005), Krabi, Thailand, 2005.
5. Basu P, Khan N, Little TDC. A mobility based metric for clustering in mobile ad-hoc networks. In Proceedings of Distributed Computing Systems Workshop, 2001.
6. Gayathri V, Emmanuel S, Thambipillai S. A novel distributed cluster maintenance technique for high mobility ad-hoc networks. In Proceedings of IEEE, First International Symposium of Wireless Communication Systems (ISWCS 2004), Mauritius, September 2004; 125-129.
7. Banerjee S, Khuller S. A clustering scheme for hierarchical control in multi-hop wireless networks. In Proceedings of INFOCOM 2001, Anchorage, AK.
8. Lin CHR, Gerla M. A distributed architecture for multimedia in dynamic wireless networks. IEEE GLOBECOM 1995, Singapore, 1995; 1468-1472.
9. Amis AD, Prakash R, Vuong THP, Huynh DT. Max-min D cluster formation in wireless ad-hoc networks, in Proceedings of IEEE INFOCOM 2000, Tel Aviv, Israel; 32-41.
10. Basagni S. Distributed clustering for ad-hoc networks. In Proceedings of ISPAN'99, International Symposium on Parallel Architectures, Algorithms, and Networks, Fremantle, Australia, 1999; 310-315.
11. Chatterjee M, Das SK, Tugut D. WCA: A Weighted Clustering Algorithm for Mobile Ad-hoc Networks. Kluwer: Dordrecht, 2002.
12. Chen YP, Liestman AL. A zonal algorithm for clustering ad-hoc networks. International Journal of Foundations of Computer Science 2003; 14(2): 305-322.
13. Chen G, Nocetti F, Gonzalez J, Stojmenovic I. Connectivity-based K-hop clustering in wireless networks. In Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS'02), 2002.
14. Gerla M, Tsai TC. Multicluster, mobile, multimedia radio network. ACM Baltzer Journal of Wireless Networks 1995; 1(3): 255-265.
15. Krishna P, Vaidya NH, Chatterjee M, Pradhan DK. A cluster-based approach for routing in dynamic networks. ACM SIGCOMM Computer Communication Review 1997; April: 49-65.
16. Lin CR, Gerla M. Adaptive clustering for mobile wireless networks. IEEE Journal on Selected Areas in Communications 1997; 15(7): 1265-1275.
17. Chen YP, Liestman AL, Liu J. Clustering algorithms for ad hoc wireless networks. In Ad Hoc and Sensor Networks, Xiao Y, Pan Y (eds). Nova Science: Publishes: New York, 2004.
18. Purtoosi R, Taheri H, Mohammadi A, Foroozan F. A light-weight contention-based clustering algorithm for wireless ad hoc networks. In Fourth International Conference on Computer and Information Technology (CIT'04), Vol. 1, 2004; 627-632.
19. Er H, Seah WKG. Mobility-based d-hop clustering algorithm for mobile ad hoc networks. In Proceedings of IEEE WCNC, March 2004; 2359-2364.
20. Bein D, Datta AK, Jagganagari CR, Villain V. A self-stabilizing link-cluster algorithm in mobile ad hoc networks. In Proceedings of the 8th International Symposium on Parallel Architectures, Algorithms and Networks, 2005; 436-441.
21. Lin HC, Chu YH. A clustering technique for large multihop mobile wireless networks. In Proceedings of the IEEE Vehicular Technology Conference, 15-18 May 2000.
22. Dow CR, Lin JH, Hwang SF, Wang YW. An efficient distributed clustering scheme for wireless ad-hoc networks. Transactions of IECEI, Wireless Communication Switching 2002; E85-B(8) 1561-1571.
23. Chiang CC, Wu HK, Liu W, Gerla M. Routing in clustered multihop, mobile wireless networks with fading channel. In IEEE Singapore International Conference on Networks (SICON), April 1997.
24. Lin CHR, Gerla M. A distributed control scheme in multi-hop packet radio networks for voice/data traffic support. In IEEE GLOBECOM 1995, Singapore, 1995, 1238-1242.
25. Basagni S. Distributed and mobility-adaptive clustering for multimedia support in multi-hop wireless networks. In Proceedings of the IEEE International Vehicular Technology Conference (VTC'99), 1999.
26. Clark BN, Colbourn CJ, Johnson DS. Unit disk graphs. Discrete Mathematics 1990; 86(1-3) 165-177.
27. Cicerone S, and Di Stefano G. Graphs with bounded induced distance. Discrete Applied Mathematics 2000; 107(2-3): 173-191.
28. Alzoubi KM, Wan PJ, Frieder O. Message-optimal connected dominating sets in mobile ad-hoc networks. In Third ACM International Symposium on Mobile Ad-hoc Networking and Computing (MobiHoc'02), June 2002; 157-164.
29. Alzoubi KM, Wan P-J, Frieder O. Distributed heuristics for connected dominating sets in wireless ad hoc networks. IEEE ComSoc/KICS Journal on Communication Networks 2002; 4: 22-29.
30. Alzoubi KM, Wan P-J, Frieder O. New distributed algorithm for connected dominating set in wireless ad hoc networks. In IEEE HICSS35, Hawaii, 2002.
31. Cheng X, Huang X, Li D, Du D-Z. Polynomial-time approximation scheme for minimum connected dominating set in ad hoc wireless networks. Networks 2003; 42(4): 202-208.
32. Guha S, Khuller S. Approximation algorithms for connected dominating sets. Algorithmica 1998; 374-387.
33. Wan P-J, Alzoubi KM, Frieder O. Distributed construction of connected dominating set in wireless ad hoc networks. In IEEE INFOCOM, New York, 2002.
34. Gallager RG, Humblet PA, Spira PM. A distributed algorithm for minimum-weight spanning tree. ACM Transactions on Programming Languages and Systems 1983 January; 1983; 5(1): 66-77.
35. Gartner FC. A survey of self-stabilizing spanning-tree construction algorithms. Technical Report IC/2003/38, Swiss Federal Institute of Technology (EPFL), School of Computer and Communication Sciences, 10 June 2003.
36. Baruch A, Gallager GR. A new distributed algorithm to find breadth first search trees. IEEE Transactions on Information Theory 1987; IT33(3): 315-322.
37. Er II, Seah WKG. Clustering overhead and convergence time analysis of the mobility-based multi-hop clustering algorithm for mobile ad hoc networks. In Proceedings of the 1st International Workshop on Performance Modeling in Wired, Wireless, Mobile Networking and Computing (PMW2MNC05), Fukuoka, Japan, 20-22 July 2005.
38. Sucec J, Marsic I. Hierarchical routing overhead in mobile ad hoc networks. JEEE Transactions on Mobile Computing 2004; 3(1): 46-56.