Performance evaluation of dynamic networks using an evolving graph combinatorial model

IEEE International Conference on Wireless and Mobile Computing, Networking and Communications 2006, WiMob 2006

Volumn , Issue , 2006, Pages 173-180

  Monteiro, Julian ^a   Goldman, Alfredo ^a   Ferreira, Afonso ^b,c  

^a UNIVERSITY OF SÃO PAULO   (Brazil)

^b CNRS   (France)

^c ICT   (Belgium)

Author keywords

Ad hoc wireless networks; Evolving graphs; Performance analysis; Routing protocols; Sensor networks

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; GRAPH THEORY; ROUTING PROTOCOLS; SENSOR NETWORKS;

DYNAMIC NETWORKS; NETWORK SIMULATORS; PERFORMANCE ANALYSIS;

AD HOC NETWORKS;

EID: 40949161442     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WIMOB.2006.1696378     Document Type: Conference Paper

References (30)

1. S. Corson and J. Macker, "Mobile ad hoc networking (MANET): Routing protocol performance issues and evaluation considerations," IETF, RFC 2501, January 1999. [Online]. Available: http://www.ietf. org/rfc/rfc2501.txt
2. D. Estrin, R. Govindan, J. S. Heidemann, and S. Kumar, "Next century challenges: Scalable coordination in sensor networks," in Proceedings of the 5th international conference on Mobile Computing and Networking (MobiCom), 1999, pp. 263-270. [Online]. Available: citeseer.ist.psu.edu/ estrin99next.html
3. D. Lang, "A comprehensive overview about selected ad hoc networking routing protocols," Technische Universitaet Munchen, Department of Computer Science, Tech. Rep. TUM-I0311, March 2003. [Online]. Available: http://wwwbib.informatik.tu-muenchen.de/ infberichte/2003/TUM-I0311.pdf
4. E. M. Royer and C.-K. Toh, "A review of current routing protocols for ad-hoc mobile wireless networks," IEEE Personal Communications, pp. 46-55, Apr 1999. [Online]. Available: citeseer.ist.psu.edu/royer99review. html
5. I. F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, "Wireless sensor networks: a survey," Computer Networks, vol. 38, pp. 393-422, 2002. [Online]. Available: citeseer.ist.psu.edu/ akyildiz02survey.html
6. A. Ferreira, J. Galtier, and P. Penna, "Topological design, routing and hand-over in satellite networks," in Handbook of Wireless Networks and Mobile Computing, I. Stojmenovic, Ed. John Wiley and Sons, 2002, pp. 473-507.
7. M. Werner and G. Maral, "Traffic flows and dynamic routing in leo intersatellite link networks," in Proceedings of the International Mobile Satellite Conference (IMSC), June 1997, pp. 283-288.
8. D. Estrin, L. Girod, G. Pottie, and M. Srivastava, "Instrumenting the world with wireless sensor networks," in Proceedings of the International Conference on Acoustics, Speech, and Signal Processing (ICASSP), Salt Lake City, Utah, May 2001. [Online]. Available: citeseer.ist.psu.edu/ estrin01instrumenting.html
9. B. Bui-Xuan, A. Ferreira, and A. Jarry, "Computing shortest, fastest, and foremost journeys in dynamic networks," International Journal of Foundations of Computer Science, vol. 14, no. 2, pp. 267-285, April 2003. [Online]. Available: http://www.inria.fr/rrrt/rr-4589.html
10. A. Ferreira, "Building a reference combinatorial model for dynamic networks: Initial results in evolving graphs," INRIA, Research Report 5041, Dec 2003. [Online]. Available: http://www.inria.fr/rrrt/rr-5041. html
11. B. Bui-Xuan, A. Ferreira, and A. Jarry, "Evolving graphs and least cost journeys in dynamic networks," in Proceedings of WiOpt - Modeling and Optimization in Mobile, Ad-Hoc, and Wireless Networks. INRIA Press, March 2003, pp. 141-150.
12. S. Bhadra and A. Ferreira, "Computing multicast trees in dynamic networks using evolving graphs," INRIA, Research Report 4531, Ago 2002. [Online]. Available: http://www.inria.fr/rrrt/rr-4531.html
13. _, "Complexity of connected components in evolving graphs and the computation of multicast trees in dynamic networks," in Proceedings of the International Conference on AD-HOC Networks and Wireless (Adhoc-Now), ser. Lecture Notes in Computer Science, vol. 2865. Springer Verlag, Oct 2003, pp. 259-270.
14. A. Ferreira and A. Jarry, "Complexity of minimum spanning tree in evolving graphs and the minimum-energy broadcast routing problem," in Proceedings of WiOpt - Modeling and Optimization in Mobile, AdHoc and Wireless Networks, mar 2004.
15. C. Perkins and P. Bhagwat, "Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers," in Proceedings of ACM SIGCOMM Conference on Communications Architectures, Protocols and Applications, 1994, pp. 234-244. [Online]. Available: citeseer.ist.psu.edu/ perkins94highly.html
16. D. B. Johnson and D. A. Maltz, "Dynamic source routing in ad hoc wireless networks," in Mobile Computing, Imielinski and Korth, Eds. Kluwer Academic Publishers, 1996, vol. 353, pp. 153-181. [Online]. Available: citeseer.ist.psu.edu/johnson96dynamic.html
17. C. E. Perkins and E. M. Royer, "Ad-hoc on-demand distance vector routing," in Proceedings of the 2nd IEEE Workshop on Mobile Computing Systems and Applications (WMCSA), February 1999, pp. 90-100. [Online]. Available: http://www.research.att.com/ conf/wmcsa99/papers/perkins.ps.gz
18. T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms. Cambridge, Massachusetts: The MIT press, 1990.
19. The VINT Project, "Network simulator - ns2," http://www.isi.edu/nsnam/ns/, Page accessed on Dec 2005.
20. Rice University Monarch Project, "The CMU monarch wireless and mobility extensions to NS," http://www.monarch.cs.rice.edu/, Page accessed on Dec 2005.
21. "IEEE standard for wireless LAN medium access control (MAC) and physical layer (PHY) specifications," http://grouper.ieee.org/groups/802/ 11/main.html, Page accessed on Dec 2005.
22. J. Broch, D. A. Maltz, D. B. Johnson, Y.-C. Hu, and J. Jetcheva, "A performance comparison of multi-hop wireless ad hoc network routing protocols," in Proceedings of the 4th international conference on Mobile Computing and Networking (MobiCom), 1998, pp. 85-97.
23. [Online]. Available: citeseer.ist.psu.edu/broch98performance.html
24. P. Johansson, T. Larsson, N. Hedman, B. Mielczarek, and M. Degermark, "Scenario-based performance analysis of routing protocols for mobile ad-hoc networks," in Proceedings of the 5th international conference on Mobile Computing and Networking (MobiCom), 1999, pp. 195-206.
25. C. E. Perkins, E. E. Royer, S. R. Das, and M. K. Marina, "Performance comparison of two on-demand routing protocols for ad hoc networks," in IEEE Personal Communications, Feb 2001, vol. 8, pp. 16-28. [Online]. Available: citeseer.ist.psu.edu/article/perkins01performance. html
26. T. Camp, J. Boleng, and V. Davies, "A survey of mobility models for ad hoc network research," Wireless Communications and Mobile Computing (WCMC): Special issue on Mobile Ad Hoc Networking: Research, Trends and Applications, vol. 2, no. 5, pp. 483-502, 2002. [Online]. Available: citeseer.ist.psu.edu/camp02survey.html
27. J. Yoon, M. Liu, and B. Noble, "Random waypoint considered harmful," in Proceedings of IEEE INFOCOM, 2003, pp. 1312-1321. [Online]. Available: citeseer.ist.psu.edu/yoon03random.html
28. "AODV code for CMU wireless and mobility extensions to NS-2," http://www.cs.sunysb.edu/mahesh/aodv/, Page accessed on Dec 2005.
29. P. Jacquet, P. Mühlethaler, T. Clausen, A. Laouiti, A. Qayyum, and L. Viennot, "Optimized link state routing protocol," in Proceedings of the 5th IEEE International Multitopic Conference (INMIC'01). IEEE, December 2001, pp. 62-68. [Online]. Available: http://hipercom.inria. fr/olsr/inmic2001.ps
30. V. Kakadia and W. Ye, "Energy model update in ns-2," http://www.isi.edu/ilense/software/smac/ns2_energy.html, Page accessed on Dec 2005.