Sciweavers

Share
NCA
2007
IEEE

On the Evaluation of Shortest Journeys in Dynamic Networks

9 years 2 months ago
On the Evaluation of Shortest Journeys in Dynamic Networks
The assessment of routing protocols for wireless networks is a difficult task, because of the networks’ highly dynamic behavior and the absence of benchmarks. However, some of these networks, such as intermittent wireless sensors networks, periodic or cyclic networks, and low earth orbit (LEO) satellites systems, have more predictable dynamics, as the temporal variations in the network topology are somehow deterministic, which may make them easier to study. The graph theoretic model – the evolving graphs – was proposed to help capture the dynamic behavior of these networks, in view of the construction of least cost routing and other algorithms. Our recent experiments showed that evolving graphs have all the potentials to be an effective and powerful tool in the development of routing protocols for dynamic networks. In this paper, we evaluated the shortest journey evolving graph algorithm when used in a routing protocol for MANETs. We use the NS2 network simulator to compare thi...
Afonso Ferreira, Alfredo Goldman, Julian Monteiro
Added 04 Jun 2010
Updated 04 Jun 2010
Type Conference
Year 2007
Where NCA
Authors Afonso Ferreira, Alfredo Goldman, Julian Monteiro
Comments (0)
books