Research Article
Evaluating a bound for MANETs routing protocols performance using graphs with activation windows
@INPROCEEDINGS{10.4108/ICST.WIOPT2008.3166, author={David Soler and Jose Albiach and Eulalia Martinez and Pietro Manzoni}, title={Evaluating a bound for MANETs routing protocols performance using graphs with activation windows}, proceedings={6th International ICST Symposium on Modeling and Optimization}, publisher={IEEE}, proceedings_a={WIOPT}, year={2008}, month={8}, keywords={Ad hoc networks Collaboration Computer networks Mathematics Mobile ad hoc networks Mobile communication Performance evaluation Polynomials Proposals Routing protocols}, doi={10.4108/ICST.WIOPT2008.3166} }- David Soler
Jose Albiach
Eulalia Martinez
Pietro Manzoni
Year: 2008
Evaluating a bound for MANETs routing protocols performance using graphs with activation windows
WIOPT
IEEE
DOI: 10.4108/ICST.WIOPT2008.3166
Abstract
In this paper we present an algorithm called STPA (Shortest Time Path Algorithm) which aims at providing a comparison tool for the evaluation of a bound for Mobile Ad Hoc Networks (MANETs) routing protocols performance. STPA provides an exhaustive evaluation of an ideal routing protocol. Based on the current position and state of the nodes it can determine factors like: how many complete messages get to the destination, which is the smallest amount of time required by a packet to get to the destination, which path followed each packet, and so on. This values would allow a protocol designer to improve or fine tune his proposal. We demonstrate that the complexity of the algorithm is $O(sigma^{2})$, that is polynomial with respect to parameter $sigma$; where $sigma$ corresponds to the sum of all the instants of time during which all nodes are active.