Probabilistic multi-path vs. deterministic single-path protocols for dynamic ad-hoc network scenarios

Authors:
Christopher L. Barrett;Stephan J. Eidenbenz;Lukas Kroc;Madhav V. Marathe;James P. Smith
Affiliations:
Los Alamos National Laboratory, Los Alamos, NM;Los Alamos National Laboratory, Los Alamos, NM;Los Alamos National Laboratory, Los Alamos, NM;Los Alamos National Laboratory, Los Alamos, NM;Los Alamos National Laboratory, Los Alamos, NM
Venue:
Proceedings of the 2005 ACM symposium on Applied computing
Year:
2005

Citing 12
Cited 0

Epidemic algorithms for replicated database maintenance

PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
A survey of routing techniques for mobile communications networks

Mobile Networks and Applications - Special issue: routing in mobile communications networks
A performance comparison of multi-hop wireless ad hoc network routing protocols

MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Spatial gossip and resource location protocols

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Highly-resilient, energy-efficient multipath routing in wireless sensor networks

ACM SIGMOBILE Mobile Computing and Communications Review
Characterizing the interaction between routing and MAC protocols in ad-hoc networks

Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Ad-hoc On-Demand Distance Vector Routing

WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
UCAN: a unified cellular and ad-hoc network architecture

Proceedings of the 9th annual international conference on Mobile computing and networking
Parametric probabilistic sensor network routing

WSNA '03 Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications
Stochastic properties of the random waypoint mobility model

Wireless Networks
A survey on sensor networks

IEEE Communications Magazine
A survey on position-based routing in mobile ad hoc networks

IEEE Network: The Magazine of Global Internetworking

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate the performance of different protocol stacks under various application scenarios. Our method of choice is a full-fledged simulation in QualNet, testing the complete protocol stack over fairly large-scale networks. We find that the relative ranking of protocols strongly depends on the network scenario, the session load, the mobility level, and the choice of protocol parameters. We show that the Parametric Probabilistic Protocols, which we generalize from their original definition, can outperform standard routing protocols, such as AODV or Gossiping or Shortest-Path, in a variety of realistic scenarios.