ACM Home Page
Please provide us with feedback. Feedback
Predicting node proximity in ad-hoc networks: a least overhead adaptive model for selecting stable routes
Full text PdfPdf (413 KB)
Source International Symposium on Mobile Ad Hoc Networking & Computing archive
Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing table of contents
Boston, Massachusetts
SESSION: Session A: Routing table of contents
Pages: 29 - 33  
Year of Publication: 2000
ISBN:0-7803-6534-8
Authors
A. Bruce McDonald  University of Pittsburgh and Children's Hospital of Pittsburgh
Taieb Znati  University of Pittsburgh
Sponsors
Microsoft Research : Microsoft Research
ACM: Association for Computing Machinery
SIGMOBILE: ACM Special Interest Group on Mobility of Systems, Users, Data and Computing
Publisher
IEEE Press  Piscataway, NJ, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 33,   Citation Count: 4
Additional Information:

abstract   references   cited by   collaborative colleagues  

Tools and Actions: Review this Article  

ABSTRACT

This paper presents a strategy for quantifying the future proximity of adjacent nodes in an ad-hoc network. The proximity model provides a quantitative metric that reflects the future stability of a given link. Because it is not feasible to maintain precise information in an ad-hoc network, our model is designed to require minimal information and uses an adaptive learning strategy to minimize the cost associated with making a wrong decision under uncertain conditions. After computing the initial baseline link availability assuming random-independent mobility, the model adapts future computations depending on the expected time-to-failure of the link based on the independence assumption, and a parameter that reflects the the environment. The purpose for defining this metric is to enhance the performance of routing algorithms and better facilitate mobility-adaptive dynamic clustering in ad-hoc networks.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
A.B. McDonald and T. Znati. A Mobility Based Framework for Adaptive Clustering in Wireless Ad-Hoc Networks. IEEE Journal on Selected Areas in Communications, Special Issue on Ad-Hoc Networks, 17(8):1466-1487, Aug. 1999.
 
2
 
3
R. Dube, C.D. Rais, K. Wang, and S.K. Tripathi. Signal Stability Based Adaptive Routing (SSA) for Ad-Hoc Networks. IEEE Personal Communications, Feb. 1997.
 
4
J. Broch R. Punnoose, P. Nikitin and D. Stancil. Optimizing wireless network protocols using real-time predictive propagation modeling. In Proceedings of the IEEE Radio and Wireless Conference 1999 (RAWCON'99), Denver, CO, August 1999.
 
5
A.B. McDonald and T. Znati. A Path Availabaility Model for Wireless Ad-Hoc Networks. In Proceedings of the IEEE Wireless Communications and Networking Conference 1999 (WCNC'99), New Orleans, LA, September 21-24 1999.
 
6
S. Basagni, I. Chlamtac, A. Faragó, V. R. Syrotiuk, and R. Talebi. Route selection in mobile multimedia ad hoc networks. In Proceedings of the Sixth IEEE International Workshop on Mobile Multimedia Communications, MOMUC'99, San Diego, CA, November 15-17 1999.
 
7
A. Fasbender et al. Any Network, Any Terminal, Anywhere. IEEE Personal Communications, Apr. 1999.
 
8
D. Hong and S. Rappaport. Traffic Models and Performance Analysis for Cellular Mobile Radio Telephone Systems with Prioritized and Nonprioritized Handoff Procedures. IEEE Transactions on Vehicular Technology, 35(3), August 1986.

Collaborative Colleagues:
A. Bruce McDonald: colleagues
Taieb Znati: colleagues