Using Evolving Graphs Foremost Journeys to Evaluate Ad-Hoc Routing Protocols
暂无分享,去创建一个
Afonso Ferreira | Alfredo Goldman | Julian Monteiro | Afonso Ferreira | A. Goldman | Julian Monteiro
[1] Charles E. Perkins,et al. Performance comparison of two on-demand routing protocols for ad hoc networks , 2001, IEEE Wirel. Commun..
[2] Ian F. Akyildiz,et al. Wireless sensor networks: a survey , 2002, Comput. Networks.
[3] Daniel Lang,et al. A comprehensive overview about selected Ad Hoc Networking Routing Protocols , 2003 .
[4] Joseph P. Macker,et al. Mobile Ad hoc Networking (MANET): Routing Protocol Performance Issues and Evaluation Considerations , 1999, RFC.
[5] Afonso Ferreira,et al. Computing Shortest, Fastest, and Foremost Journeys in Dynamic Networks , 2003, Int. J. Found. Comput. Sci..
[6] Afonso Ferreira,et al. Building a reference combinatorial model for MANETs , 2004, IEEE Network.
[7] Ulrich Herberg. 在事件層平行方法下 NS2 網路模擬器的效能量測 , 2006 .
[8] Afonso Ferreira,et al. Topological design, routing, and handover in satellite networks , 2002 .
[9] Mingyan Liu,et al. Random waypoint considered harmful , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).
[10] David A. Maltz,et al. A performance comparison of multi-hop wireless ad hoc network routing protocols , 1998, MobiCom '98.
[11] Giorgio Ventre,et al. Network Simulator NS2 , 2008 .
[12] Afonso Ferreira,et al. Performance Evaluation of Dynamic Networks using an Evolving Graph Combinatorial Model , 2006, 2006 IEEE International Conference on Wireless and Mobile Computing, Networking and Communications.
[13] Robin Kravets,et al. ARP considered harmful: manycast transactions in ad hoc networks , 2003, 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003..