Performance Evaluation of Dynamic Networks using an Evolving Graph Combinatorial Model

@article{Monteiro2006PerformanceEO,
  title={Performance Evaluation of Dynamic Networks using an Evolving Graph Combinatorial Model},
  author={Julian Monteiro and Alfredo Goldman and Afonso Canas Ferreira},
  journal={2006 IEEE International Conference on Wireless and Mobile Computing, Networking and Communications},
  year={2006},
  pages={173-180}
}
The highly dynamic behavior of wireless networks make them very difficult to evaluate, e.g. as far as the performance of routing algorithms is concerned. 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. Recently, a graph theoretic model-the evolving graphs-was proposed to help… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 33 CITATIONS

References

Publications referenced by this paper.
SHOWING 1-10 OF 25 REFERENCES

Network simulator – ns2

  • The VINT Project
  • http://www.isi.edu/nsnam/ns/, Page accessed on…
  • 2005
Highly Influential
12 Excerpts

The CMU monarch wireless and mobility extensions to NS

  • Rice University Monarch Project
  • http://www.monarch.cs.rice.edu/, Page accessed on…
  • 2005
Highly Influential
3 Excerpts

Performance comparison of two on-demand routing protocols for ad hoc networks

  • C. E. Perkins, E. E. Royer, S. R. Das, M. K. Marina
  • IEEE Personal Communications, Feb , vol. 8, pp…
  • 2001
Highly Influential
4 Excerpts

Energy model update in ns-2

  • V. Kakadia, W. Ye
  • http://www.isi.edu/ilense/software/smac/ns2…
  • 2005
1 Excerpt

Complexity of minimum spanning tree in evolving graphs and the minimum-energy broadcast routing problem

  • A. Ferreira, A. Jarry
  • Proceedings of WiOpt – Modeling and Optimization…
  • 2004
2 Excerpts

Similar Papers

Loading similar papers…