Skip to main content
Back to USENIX
  • Conferences
  • Students
Sign in

USENIX Conference Policies

  • Event Code of Conduct
  • Conference Network Policy
  • Statement on Environmental Responsibility Policy

Mobility Assessment for MANETs Requiring Persistent Links

Mobile ad hoc networks (MANETs) have inherently dynamic topologies. It is important to be able to determine the reliability of the communication paths created under these difficult circumstances. For this purpose, mobility metrics have been proposed in the literature, but most existing research is based on simulation results and empirical analysis. We consider two metrics, link persistence and path persistence, and develop an analytical framework to derive their exact expressions as well as the corresponding link residual time and path residual time, under a random mobility environment. Such exact expressions constitute precise mathematical relationships between the network connectivity and the mobility of mobile nodes. This framework could be used to develop efficient algorithms for medium access control, or to optimize existing network routing protocols

Sanlin Xu, The Australian National University

Kim Blackmore, The Australian National University

Haley Jones, The Australian National University

BibTeX
@inproceedings {269339,
author = {Sanlin Xu and Kim Blackmore and Haley Jones},
title = {Mobility Assessment for {MANETs} Requiring Persistent Links},
booktitle = {International Workshop on Wireless Traffic Measurements and Modeling (WiTMeMo 05)},
year = {2005},
address = {Seattle, WA},
url = {https://www.usenix.org/conference/witmemo-05/mobility-assessment-manets-requiring-persistent-links},
publisher = {USENIX Association},
month = jun
}
Download

Links

Paper: 
http://usenix.org/publications/library/proceedings/mobisys05/witmemo05/tech/full_papers/xu/xu.pdf
Paper (HTML): 
http://usenix.org/publications/library/proceedings/mobisys05/witmemo05/tech/full_papers/xu/xu_html/index.html
  • Log in or register to post comments

© USENIX
EIN 13-3055038

  • Privacy Policy
  • Contact Us