6533b7d2fe1ef96bd125e1ed
RESEARCH PRODUCT
Evaluating a bound for MANETs routing protocols performance using graphs with activation windows
J. AlbiachE. MartinezPietro ManzoniDavid Solersubject
Routing protocolWireless ad hoc networkEqual-cost multi-path routingComputer sciencebusiness.industryDistributed computingComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKSWireless Routing ProtocolMobile ad hoc networkOptimized Link State Routing ProtocolLink-state routing protocolComputer Science::Networking and Internet ArchitectureDestination-Sequenced Distance Vector routingbusinessComputer networkdescription
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.
| year | journal | country | edition | language |
|---|---|---|---|---|
| 2008-04-01 | Proceedings of the 6th Intl Symposium on Modeling and Optimization |