Towards an Understanding of EASE and Its Properties

Authors:
Stratis Ioannidis;Peter Marbach
Affiliations:
University of Toronto;University of Toronto
Venue:
WIOPT '05 Proceedings of the Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
Year:
2005

Citing 3
Cited 2

Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers

SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
GPSR: greedy perimeter stateless routing for wireless networks

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Age matters: efficient route discovery in mobile ad hoc networks using encounter ages

Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing

Efficient routing in intermittently connected mobile networks: the single-copy case

IEEE/ACM Transactions on Networking (TON)
A survey of adaptive services to cope with dynamics in wireless self-organizing networks

ACM Computing Surveys (CSUR)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a model under which several inherent properties of the Exponential Age SEarch routing protocol can be derived. By making simplifications on this model, we are able to address the issue of the optimality of a parameter of the protocol and to improve the existing upper bound on its performance.