A simple automata based model for stable routing in dynamic ad hoc networks

Authors:
Raymond A. Marie;Miklós Molnár;Hanen Idoudi
Affiliations:
IRISA/University of Rennes 1, Rennes, France;IRISA/INSA, Rennes, France;ENSI, la Manouba - Tunis, Tunisia
Venue:
Proceedings of the 2nd ACM workshop on Performance monitoring and measurement of heterogeneous wireless and wired networks
Year:
2007

Citing 15
Cited 1

A distance routing effect algorithm for mobility (DREAM)

MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
QoS routing in networks with inaccurate information: theory and algorithms

IEEE/ACM Transactions on Networking (TON)
Location-aided routing (LAR) in mobile ad hoc networks

Wireless Networks
Mobility prediction and routing in ad hoc wireless networks

International Journal of Network Management
Performance of multipath routing for on-demand protocols in mobile ad hoc networks

Mobile Networks and Applications
Predicting node proximity in ad-hoc networks: a least overhead adaptive model for selecting stable routes

MobiHoc '00 Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing
Probability and Statistics with Reliability, Queuing and Computer Science Applications

Probability and Statistics with Reliability, Queuing and Computer Science Applications
Associativity-Based Routing for Ad Hoc Mobile Networks

Wireless Personal Communications: An International Journal
On Quality Of Service Routing in Ad-Hoc Networks

LCN '03 Proceedings of the 28th Annual IEEE International Conference on Local Computer Networks
The stability of paths in a dynamic network

CoNEXT '05 Proceedings of the 2005 ACM conference on Emerging network experiment and technology
A prediction-based link availability estimation for routing metrics in MANETs

IEEE/ACM Transactions on Networking (TON)
Ad hoc routing based on the stability of routes

Proceedings of the 4th ACM international workshop on Mobility management and wireless access
Modeling static and dynamic behavior of routes in mobile ad hoc networks

ACM SIGMOBILE Mobile Computing and Communications Review
Distributed quality-of-service routing in ad hoc networks

IEEE Journal on Selected Areas in Communications
Building a reference combinatorial model for MANETs

IEEE Network: The Magazine of Global Internetworking

A greedy-based stable multi-path routing protocol in mobile ad hoc networks

Ad Hoc Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper focuses on routing protocols for ad hoc networks where nodes can be either awake or sleeping or breakdown and where links can be nonpersistent because of both mobility and the state of the nodes. Routing protocols for ad hoc networks already exist but because of uncertainties they produce a significant traffic overhead. We propose a new algorithm aiming at maximizing the existence probability of a route over a given time period. Our model is based on a dynamic graph where the existence of the nodes and the communication capability between them are modeled by simple two state automata. We exhibit closed form expressions for the existence probabilities of the network elements. Our proposition allows fast computation for stable routes.