Clustering in mobile ad hoc networks through neighborhood stability-based mobility prediction

Computer Networks

Volumn 52, Issue 9, 2008, Pages 1797-1824

  Konstantopoulos, Charalampos ^a   Gavalas, Damianos ^b   Pantziou, Grammati ^c  

^a UNIVERSITY OF PATRAS   (Greece)

^b UNIVERSITY OF THE AEGEAN   (Greece)

^c UNIVERSITY OF WEST ATTICA   (Greece)

Author keywords

Clustering; Distributed algorithms; Information theory; Mobile ad hoc networks; Routing

Indexed keywords

CLUSTERING ALGORITHMS; DATA STRUCTURES; HIERARCHICAL SYSTEMS; INFORMATION THEORY; PARALLEL ALGORITHMS; ROUTING PROTOCOLS;

CLUSTERING STRUCTURE; MOBILE AD HOC NETWORKS (MANET); PROBABILISTIC MODELS; STABILITY-BASED MOBILITY PREDICTION;

AD HOC NETWORKS;

EID: 43449117179     PISSN: 13891286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comnet.2008.01.018     Document Type: Article

References (29)

1. Yu J., and Chong P. A survey of clustering schemes for mobile ad hoc networks. IEEE Communications Survey 7 1 (2005) 32-48
2. Gerla M., and Tsai J. Multicluster, mobile, multimedia radio network. ACM-Baltzer Journal of Wireless Network 1 3 (1995) 255-265
3. McDonald A., and Znatti T. A mobility-based framework for adaptive clustering in wireless ad hoc networks. IEEE Journal on Selected Areas in Communications 17 8 (1999) 1466-1487
4. P. Basu, N. Khan, T. Little, A mobility based metric for clustering in mobile ad hoc networks, in: Proceedings of the 21st International Conference on Distributed Computing Systems Workshops (ICDCSW'01), 2001, pp. 413-418.
5. I. Er, W. Seah, Mobility-based d-hop clustering algorithm for mobile ad hoc networks, in: Proceedings of IEEE Wireless Communications and Networking Conference (WCNC 2004), vol. 4, pp. 2359-2364.
6. Er I., and Seah W. Performance analysis of mobility-based d-hop (MobDHop) clustering algorithm for mobile ad hoc networks. Computer Networks 50 (2006) 3375-3399
7. Palit R., Hossain E., and Thulasiraman P. MAPLE: a framework for mobility-aware pro-active low energy clustering in ad-hoc mobile wireless networks. Wireless Communications and Mobile Computing 6 (2006) 773-789
8. Schwartz M. Mobile Wireless Communications (2005), Cambridge Univeristy Press
9. S. Basagni, Distributed clustering for ad-hoc networks, in: Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks (I-SPAN'99), June 1999, pp. 310-315.
10. S. Basagni, Distributed and mobility-adaptive clustering for multimedia support in multi-hop wireless networks, in: Proceedings of IEEE International Vehicular Technology Conference, September 1999, pp. 889-893.
11. Chatterjee M., Das S., and Turgut D. WCA: a weighted clustering algorithm for mobile ad hoc networks. Cluster Computing 5 (2002) 193-204
12. S. Sivavakeesar, G. Pavlou, A. Liotta, Stable clustering through mobility prediction for large-scale multihop ad hoc networks, in: Proceedings of the IEEE Wireless Communications and Networking Conference (WCNC'2004), March 2004.
13. Johnson D., and Maltz D. Dynamic source routing in ad hoc wireless networks. In: Imelinsky T., and Korth H. (Eds). Mobile Computing (1996), Kluwer Academic Publishers 153-181
14. Bhattacharya A., and Das S.K. LeZi-Update: an information-theoretic framework for personal mobility tracking in pcs networks. Wireless Networks 8 (2002) 121-135
15. T. Camp, J. Boleng, V. Davies, A survey of mobility models for ad hoc network research, in: Wireless Communication & Mobile Computing (WCMC): Special issue on Mobile Ad Hoc Networking: Research, Trends and Applications, vol. 2, no. 5, 2002, pp. 483-502.
16. Bell T.C., Cleary J.G., and Witten I.H. Text Compression (1990), Prentice Hall
17. Ziv J., and Lempel A. Compression of individual sequences via variable-rate coding. IEEE Transactions on Information Theory 24 5 (1978) 530-536
18. Kleinberg J., and Tardos E. Algorithm Design (2006), Addison Wesley
19. M. Gerla, T.J. Kwon, G. Pei, On demand routing in large ad hoc wireless networks with passive clustering, in: Proceedings of IEEE Wireless Communications and Networking Conference (WCNC'2000), September 2000.
20. C. Konstantopoulos, D. Gavalas, G. Pantziou, A mobility aware technique for clustering on mobile ad-hoc networks, in: Proceedings of the Eighth International Conference on Distributed Computing and Networking ICDCN 2006, LNCS, vol. 4308, Springer Verlag, 2006, pp. 397-408.
21. Huffman W.C., and Pless V. Fundamentals of Error-Correcting Codes (2003), Cambridge University Press
22. Graham R., Knuth D., and Patashnik O. Concrete Mathematics (1994), Addison-Wesley Publishing Company
23. Cohen G., Honkala I., Litsyn S., and Lobstein A. Covering Codes, Mathematical Library vol. 54 (1997), Elsevier, Amsterdam
24. n algorithm for k-SAT based on local search. Theoretical Computer Science 289 (2002) 69-83
25. Marathe V., Breu H., Hunt III H.B., Ravi S.S., and Rosenkrantz D.J. Simple heuristics for unit disk graphs. Networks 25 (1995) 59-68
26. Network Simulator - NS-2. .
27. J. Yoon, M. Liu, B. Noble, Random waypoint considered harmful, in: Proceedings of IEEE INFOCOM, 2003.
28. X. Hong, M. Gerla, G. Pei, C. Chiang, A group mobility model for ad hoc wireless networks, in: Proceedings of the Second ACM International Workshop on Modeling, Analysis and Simulation of Wireless and Mobile Systems, 1999, pp. 53-60.
29. .