Multi-hop clustering based on neighborhood benchmark in mobile Ad-hoc networks

Mobile Networks and Applications

Volumn 12, Issue 5-6, 2007, Pages 381-391

  Yau, Stephen S ^a   Gao, Wei ^a  

^a AZ 85281   (United States)

Author keywords

Balanced sizes; Mobile ad hoc networks; Multi hop clusters; Neighborhood benchmark

Indexed keywords

BENCHMARKING; COMPUTER NETWORKS; FARM BUILDINGS; METROPOLITAN AREA NETWORKS; MOBILE TELECOMMUNICATION SYSTEMS; NETWORK PROTOCOLS; NIOBIUM; TELECOMMUNICATION NETWORKS; WIRELESS NETWORKS;

(E ,3E) PROCESS; BUSINESS MEDIA; CLUSTER HEADS (CH); CLUSTER SIZES; DATA COLLECTIONS; HETEROGENEOUS NETWORKING; LINK STABILITY; LOW OVERHEAD; MOBILE AD-HOC NETWORK (MANET); MOBILE NODE (MN); MULTI HOPPING; MULTI-HOP CLUSTERS; NETWORK APPLICATIONS; NETWORK STRUCTURES; PARTIAL PROBABILITY; SPRINGER (CO);

AD HOC NETWORKS;

EID: 45849111445     PISSN: 1383469X     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11036-008-0039-3     Document Type: Article

References (18)

1. Amis AD, Prakash R, Huynh D, Vuong T (2000) Max-min d-cluster formation in wireless ad hoc networks. In: Proc. 19th annual joint conference of the IEEE computer and communications societies (INFOCOM). IEEE, Piscataway, pp 32-41
2. An B, Papavassiliou S (2001) A mobility-based clustering approach to support mobility management and multicast routing in mobile ad-hoc wireless networks. Int J Netw Manage 11(6):387-395
3. Belding-Royer EM (2002) Hierarchical routing in ad-hoc mobile networks. Wirel Commun Mob Comput 2(5):515-532
4. Chatterjee M, Das SK, Turgut D (2002) Wca: a weighted clustering algorithm for mobile ad hoc networks. J Clust Comput 5(2):193-204
5. Chen Y-P, Liestman AL (2002) Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks. In: Proc. 3rd ACM interational symposium on mobile ad hoc networking and computing (MobiHoc). ACM, New York, pp 165-172
6. Chiang C-C, Wu H-K, Liu W, Gerla M (1997) Routing in clustered multihop mobile wireless networks with fading channel. In: Proc. IEEE Singapore international conference on networks (SICON). IEEE, Piscataway, pp 197-211
7. Ephremides A, Wieselthier JE, Baker DJ (1987) A design concept for reliable mobile radio networks with frequency hopping signaling. Proc IEEE 75(1):56-73
8. Kim D, Ha S, Choi Y (1998) k-hop cluster-based dynamic source routing in wireless ad-hoc packet radio networks. In: Proc. IEEE vehicular technology conference (VTC). IEEE, Piscataway, pp 224-228
9. McDonald A, Znati TF (1999) A mobility-based framework for adaptive clustering in wireless ad hoc networks. IEEE J Sel Areas Commun 17(8):1466-1487
10. Nocetti FG, Gonzalez JS, Stojmenovic I (2003) Connectivity based k-hop clustering in wireless networks. Telecommun Syst 22(1-4):205-220
11. Ramaswamy L, Gedik B, Liu L (2005) A distributed approach to node clustering in decentralized peer-to-peer networks. IEEE Trans Parallel Distrib Syst 16(9):814-829
12. Ratnasamy S, Francis P, Handley M, Karp R, Schenker S (2001) A scalable content-addressable network. In: Proc. ACM SIGCOMM. ACM, New York, pp 161-172
13. Stoica I, Morris R, Karger D, Kaashoek F, Balakrishnan H (2001) Chord: a scalable peer-to-peer lookup service for internet applications. In: Proc. ACM SIGCOMM. ACM, New York, pp 149-160
14. Tsai JT, Gerla M (1995) Multicluster, mobile, multimedia radio network. J Wirel Netw 1(3):255-265
15. Wu J, Li H (1999) On calculating connected dominating set for efficient routing in ad hoc wireless networks. In: Proc. 3rd Int'l workshop on discrete algorithms and methods for mobile computing and communications (DIAL-M), Seattle, 20 August 1999, pp 7-14
16. Wu J, Lou W (2003) Forward node set based broadcast in clustered mobile ad hoc networks. Wirel Commun Mob Comput 3(2):155-173
17. Yu JY, Chong PHJ (2005) A survey of clustering schemes for mobile ad hoc networks. Commun Surv Tutor 7(1):32-48
18. Zhao BY, Huang L, Stribling J, Rhea SC, Joseph AD, Kubiatowicz JD (2004) Tapestry: a resilient global-scale overlay for service deployment. IEEE J Sel Areas Commun 22(1):41-53