By Topic

Evaluating a bound for MANETs routing protocols performance using graphs with activation windows

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
David Soler ; Polytechnic University of Valencia, Dept. Applied Mathematics, Camino de Vera, s/n, 46071, SPAIN ; Jose Albiach ; Eulalia Martinez ; Pietro Manzoni

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(sigma2), 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.

Published in:

Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks and Workshops, 2008. WiOPT 2008. 6th International Symposium on

Date of Conference:

1-3 April 2008