Abstract
We have described the entropy-based mobility model that is a good indicator for exploiting the mobility patterns of mobile nodes in mobile ad hoc networks including its application to the virtual space. We have articulated that the use of the entropy-based mobility model in community structure environment has enabled the classification of mobile environments in terms of mobility entropy and the development of the potential-based adaptive routing that has shown superior performance over the variable topology mobile ad hoc network. The entropy-based weighted cluster algorithm is described along with its optimization using Tabu search (TS) in the EWCA-TS algorithm that has enhanced network performances in the mobile ad hoc network.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Ochiai, H and Esaki, H (2008) Mobility Entropy and Message Routing in Community-Structured Delay Tolerant Networks
Gui, C (2007) An entropy-based stability QoS routing with priority scheduler in MANET using fuzzy controller. Journal of Communication and Computer 4(3)
Leguay, J et al (2005) DTN Routing in a Mobility Pattern Space. SIGCOMM
Leguay, J et al Evaluating Mobility Pattern Space Routing for DTN. Universite Pierre et Marie Curie, Laboratorie. http://arxiv.org/PS_cache/cs/pdf/0511/0511102v1.pdf
Ghosh, J (2006) Sociological Orbit Based Mobility Profiling and Routing for Wireless Networks. PhD Thesis, Department of Computer Science and Engineering, The State University of New York at Buffalo
Ghosh, J et al. (2005) Sociological Orbits for Efficient Routing in Intermittently Connected Mobile Ad Hoc Networks. UB CSE Technical Report
Vahdat, A and Becker, D (2000) Epidemic Routing for Partially connected Ad Hoc Networks. Technical Report CS-200006, Duke University
Spyropoulos, T et al. (2005) Spray and Wait: An Efficient Routing Scheme for Intermittently Connected Mobile Networks. SIGCOMM
Chen, C and Chen, Z (2007) Evaluating Contacts for Routing in Highly Partitioned Mobile Networks. MobiOpp
Wang, Y-X (2007) An Entropy-based Weighted Clustering Algorithm and Its Optimization for Ad hoc Networks. WiMo
Chatterjee, M et al (2002) WCA: a weighted clustering algorithm for mobile ad hoc networks. Cluster Computing 5
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2011 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Roy, R.R. (2011). Entropy-Based Individual/Community Mobility Model. In: Handbook of Mobile Ad Hoc Networks for Mobility Models. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-6050-4_39
Download citation
DOI: https://doi.org/10.1007/978-1-4419-6050-4_39
Published:
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-6048-1
Online ISBN: 978-1-4419-6050-4
eBook Packages: Computer ScienceComputer Science (R0)