Advertisement

Entropy-Based Individual/Community Mobility Model

  • Radhika Ranjan Roy
Chapter

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.

Keywords

Mobile Node Tabu Search Delivery Ratio Relative Entropy Mobility Model 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    Ochiai, H and Esaki, H (2008) Mobility Entropy and Message Routing in Community-Structured Delay Tolerant NetworksGoogle Scholar
  2. 2.
    Gui, C (2007) An entropy-based stability QoS routing with priority scheduler in MANET using fuzzy controller. Journal of Communication and Computer 4(3)Google Scholar
  3. 3.
    Leguay, J et al (2005) DTN Routing in a Mobility Pattern Space. SIGCOMMGoogle Scholar
  4. 4.
    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
  5. 5.
    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 BuffaloGoogle Scholar
  6. 6.
    Ghosh, J et al. (2005) Sociological Orbits for Efficient Routing in Intermittently Connected Mobile Ad Hoc Networks. UB CSE Technical ReportGoogle Scholar
  7. 7.
    Vahdat, A and Becker, D (2000) Epidemic Routing for Partially connected Ad Hoc Networks. Technical Report CS-200006, Duke UniversityGoogle Scholar
  8. 8.
    Spyropoulos, T et al. (2005) Spray and Wait: An Efficient Routing Scheme for Intermittently Connected Mobile Networks. SIGCOMMGoogle Scholar
  9. 9.
    Chen, C and Chen, Z (2007) Evaluating Contacts for Routing in Highly Partitioned Mobile Networks. MobiOppGoogle Scholar
  10. 10.
    Wang, Y-X (2007) An Entropy-based Weighted Clustering Algorithm and Its Optimization for Ad hoc Networks. WiMoGoogle Scholar
  11. 11.
    Chatterjee, M et al (2002) WCA: a weighted clustering algorithm for mobile ad hoc networks. Cluster Computing 5Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2011

Authors and Affiliations

  1. 1.United States Army Research, Development and Engineering Command (RDECOM)Fort MonmouthUSA

Personalised recommendations