Ver registro no DEDALUS
Exportar registro bibliográfico

Metrics


Metrics:

Performance evaluation of routing protocols for MANETs with known connectivity patterns using evolving graphs (2010)

  • Authors:
  • USP affiliated authors: LEJBMAN, ALFREDO GOLDMAN VEL - IME
  • USP Schools: IME
  • DOI: 10.1007/s11276-008-0158-6
  • Subjects: WIRELESS
  • Language: Inglês
  • Imprenta:
  • Source:
  • Acesso online ao documento

    Online accessDOI or search this record in
    Informações sobre o DOI: 10.1007/s11276-008-0158-6 (Fonte: oaDOI API)
    • Este periódico é de assinatura
    • Este artigo é de acesso aberto
    • URL de acesso aberto
    • Cor do Acesso Aberto: green
    Versões disponíveis em Acesso Aberto do: 10.1007/s11276-008-0158-6 (Fonte: Unpaywall API)

    Título do periódico: Wireless Networks

    ISSN: 1022-0038,1572-8196



      Não possui versão em Acesso aberto
    Informações sobre o Citescore
  • Título: Wireless Networks

    ISSN: 1022-0038

    Citescore - 2017: 2.03

    SJR - 2017: 0.336

    SNIP - 2017: 1.021


  • How to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas

    • ABNT

      FERREIRA, Afonso Galvão; LEJBMAN, Alfredo Goldman Vel; MONTEIRO, Julian. Performance evaluation of routing protocols for MANETs with known connectivity patterns using evolving graphs. Wireless Networks, Dordrecht, v. 16, n. 3, p. 627-640, 2010. Disponível em: < https://dx.doi.org/10.1007/s11276-008-0158-6 > DOI: 10.1007/s11276-008-0158-6.
    • APA

      Ferreira, A. G., Lejbman, A. G. V., & Monteiro, J. (2010). Performance evaluation of routing protocols for MANETs with known connectivity patterns using evolving graphs. Wireless Networks, 16( 3), 627-640. doi:10.1007/s11276-008-0158-6
    • NLM

      Ferreira AG, Lejbman AGV, Monteiro J. Performance evaluation of routing protocols for MANETs with known connectivity patterns using evolving graphs [Internet]. Wireless Networks. 2010 ; 16( 3): 627-640.Available from: https://dx.doi.org/10.1007/s11276-008-0158-6
    • Vancouver

      Ferreira AG, Lejbman AGV, Monteiro J. Performance evaluation of routing protocols for MANETs with known connectivity patterns using evolving graphs [Internet]. Wireless Networks. 2010 ; 16( 3): 627-640.Available from: https://dx.doi.org/10.1007/s11276-008-0158-6

    Referências citadas na obra
    Akyildiz, I. F., Su, W., Sankarasubramaniam, Y., & Cayirci, E. (2002). Wireless sensor networks: A survey. Computer Networks (Elsevier) Journal, 38(4), 393–422.
    Bhadra, S., & Ferreira, A. (2003). Complexity of connected components in evolving graphs and the computation of multicast trees in dynamic networks. In Proceedings of Adhoc-Now’03, Lecture Notes in Computer Science (vol. 2865, pp. 259–270). Springer Verlag, October. Also appeared as an INRIA research report (RR-4531) in Aug 2002.
    BonnMotion: A mobility scenario generation and analysis tool. http://web.informatik.uni-bonn.de/IV/Mitarbeiter/dewaal/BonnMotion/ . Page accessed on October 2007.
    Boukerche, A. (2004). Performance evaluation of routing protocols for ad hoc wireless networks. ACM Mobile Network Applications (MONET), 9(4), 333–342.
    Broch, J., Maltz, D. A., Johnson, D. B., Hu, Y.-C., & Jetcheva, J. (1998). A performance comparison of multi-hop wireless ad hoc network routing protocols. In Proceedings of the 4th ACM annual international Conference on Mobile Computing and Networking (MobiCom’98) (pp. 85–97). Dallas, TX: ACM Press.
    Bui-Xuan, B., Ferreira, A., & Jarry, A. (2003). Computing shortest, fastest, and foremost journeys in dynamic networks. International Journal of Foundations of Computer Science, 14(2):267–285. Also appeared as an INRIA research report (RR-4589) in October 2002.
    Carter, C., Yi, S., & Kravets, R. (2003). ARP considered harmful: Manycast transactions in ad hoc networks. In Proceedings of the IEEE Wireless Communications and Networking Conference (WCNC 03), New Orleans, LA, March.
    Chen, C., & Ekici, E. (2005). A routing protocol for hierarchical leo/meo satellite ip networks. ACM Wireless Networks (WiNet), 11(4), 507–521.
    Cormen, T. H., Leiserson, C. E., & Rivest, R. L. (1990). Introduction to algorithms. Cambridge, MA: The MIT press.
    Corson, S., & Macker, J. (1999). Mobile ad hoc networking (MANET): Routing protocol performance issues and evaluation considerations. RFC 2501, IETF, January.
    DTNRG. Delay tolerant networking research group: http://www.dtnrg.org . Page accessed on August 2007.
    Farago, A., & Syrotiuk, V. R. (2003). MERIT: A scalable approach for protocol assessment. ACM Mobile Networks and Applications (MONET) Journal, 8(5), 567–577.
    Ferreira, A. (2002). Building a reference combinatorial model for MANETs. IEEE Network, 18(5):24–29, Set 2004. A preliminary version appeared as “On models and algorithms for dynamic communication networks: The case for evolving graphs”, Algotel 2002, Mèze, France.
    Ferreira, A., Galtier, J., & Penna, P. (2002). Topological design, routing and hand-over in satellite networks. In I. Stojmenovic (Ed.), Handbook of wireless networks and mobile computing (pp. 473–493). New York, NY: Wiley.
    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 March 2007.
    Jacquet, P., Muhlethaler, P., Clausen, T., Laouiti, A., Qayyum, A., & Viennot, L. (2001). Optimized link state routing protocol. In Proceedings of 5th IEEE INMIC’01 (pp. 62–68), Lahore, Pakistan, December 2001.
    Jain, S., Fall, K., & Patra, R. (2004). Routing in a delay tolerant network. In SIGCOMM ’04: Proceedings of the 2004 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (pp. 145–158). New York, NY: ACM Press.
    Johnson, D. B., & Maltz, D. A. (1996). Dynamic source routing in ad hoc wireless networks. In T. Imielinski & H. Korth (Eds.), Mobile computing (vol. 353, chap. 5, pp. 153–181). Hingham, MA: Kluwer Academic Publishers.
    Krishnamachari, B. (2005). Networking wireless sensors. New York, NY: Cambridge University Press.
    Manoj, B. S., Kumar, K. J., Frank, C., & Murthy, C. S. R. (2006). On the use of multiple hops in next generation wireless systems. ACM Wireless Networks (WiNet), 12(2), 199–221.
    Merugu, S., Ammar, M., & Zegura, E. (2004). Routing in space and time in networks with predictable mobility. Technical Report GIT-CC-04-7, Georgia Institute of Technology.
    Monteiro, J., Goldman, A., & Ferreira, A. (2006). Performance evaluation of dynamic networks using an evolving graph combinatorial model. In Proceedings of the 2nd IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob’06) (pp. 173–180), Montreal, CA, June. Best Student Paper Award.
    NS2. The network simulator—ns2. http://nsnam.isi.edu/nsnam/ . Page accessed on March 2007.
    Perkins, C., & Bhagwat, P. (1994). Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers. In Conference on Communications Architectures, Protocols and Applications (ACM SIGCOMM’94) (Sep 1994, pp. 234–244), London.
    Perkins, C. E., & Royer, E. M. (1999). Ad-hoc on-demand distance vector routing. In Proceedings of 2nd IEEE Workshop on Mobile Computing Systems and Applications (WMCSA’99) (Feb 1999, pp. 90–100), New Orleans, LA.
    Royer, E. M., & Toh, C.-K. (1999). A review of current routing protocols for ad-hoc mobile wireless networks. IEEE Personal Communications Magazine, 6(2), 46–55.
    Rice University Monarch Project. The CMU monarch wireless and mobility extensions to NS2. http://www.monarch.cs.rice.edu/ . Page accessed on March 2007.
    Ros, F. J. (2007). UM-OLSR implementation (version 0.8.8) for NS2. http://masimum.dif.um.es/?Software:UM-OLSR . Page accessed on March 2007.
    Sen, R., Handorean, R., Roman, G.-C., & Hackmann, G. (2004). Knowledge-driven interactions with services across ad hoc networks. In ICSOC ’04: Proceedings of the 2nd International conference on Service Oriented Computing (pp. 222–231). New York, NY: ACM Press.
    Sharma, G., Mazumdar, R. R., & Shroff, N. B. (2006). On the complexity of scheduling in wireless networks. In Proceedings of the 12th ACM annual international Conference on Mobile Computing and Networking (MobiCom’06) (pp. 227–238).
    Siqueira, I. G., Ruiz, L. B., Loureiro, A. A. F., & Nogueira, J. M. (2007). Coverage area management for wireless sensor networks. International Journal of Network Management, 17(1), 17–31.
    Spyropoulos, T., Psounis, K., & Raghavendra, C. (2008). Efficient routing in intermittently connected mobile networks: The single-copy case. IEEE/ACM Transactions on Networking, 16(1), 63–76.
    Stojmenovic, I. (ed.) (2002). Handbook of wireless networks and mobile computing. New York: Wiley.
    Stojmenovic I. (ed.) (2005). Handbook of sensor networks: Algorithms and architectures. John Wiley and Sons.
    Stojmenovic, I., Nayak, A., & Kuruvila, J. (2005). Design guidelines for routing protocols in ad hoc and sensor networks with a realistic physical layer. IEEE Communications Magazine (Ad Hoc and Sensor Networks Series), 43(3), 101–106.
    Wu, J. (2005). Handbook on theoretical and algorithmic aspects of sensor, ad hoc wireless, and peer-to-peer networks. Boston, MA: Auerbach Publications.
    Yoon, J., Liu, M., & Noble, B. (2003). Random waypoint considered harmful. In The 22nd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM’03) (vol. 2, pp. 1312–1321), San Francisco, CA.
    Zhang, Z. (2006). Routing in intermittently connected mobile ad hoc networks and delay tolerant networks: Overview and challenges. IEEE Communications Surveys, 8(1), 24–37, 1st Quarter.