skip to main content
10.1145/1859983.1859986acmconferencesArticle/Chapter ViewAbstractPublication PagesmobicomConference Proceedingsconference-collections
research-article

Ad hoc networking via named data

Published:24 September 2010Publication History

ABSTRACT

The design of the Internet protocol stack, with IP at the waist of the hourglass, mandates that packet delivery is governed by the destination IP address. This design has enabled explosive growth of the wired Internet, but faces two basic issues when applied to mobile environments. First, many mobile networks, such as mobile ad-hoc networks, are infrastructure-free, while Internet protocols are generally built with infrastructure support in mind (e.g., DHCP servers to handle IP address assignments). Second, node mobility introduces a high degree of dynamics in node interconnectivity, which defeats conventional routing protocols, originally designed for wired networks. In this paper, we argue that mobile networks can be made more effective and efficient through Named Data Networking (NDN) [4] (aka CCN).

References

  1. }}S. Biswas and R. Morris. ExOR: opportunistic multi-hop routing for wireless networks. In SIGCOMM 2005. ACM. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. }}S. Chachulski, M. Jennings, S. Katti, and D. Katabi. Trading structure for randomness in wireless opportunistic routing. In SIGCOMM 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. }}Z. J. Haas, M. R. Pearlman, and P. Samar. The zone routing protocol (zrp) for ad hoc networks. In http://www.ietf.org/proceedings/55/I-D/draft-ietf-manet-zone-zrp-04.txt.Google ScholarGoogle Scholar
  4. }}V. Jacobson, D. K. Smetters, J. D. Thornton, M. F. Plass, N. H. Briggs, and R. L. Braynard. Networking named content. In Proceedings of the 5th ACM International Conference on Emerging Networking Experiments and Technologies, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. }}D. Johnson and D. A. Maltz. Dynamic source routing in ad hoc wireless networks. In in Mobile Computing, Kluwer Acad. Publ., 1996.Google ScholarGoogle Scholar
  6. }}J. Jubin and J. D. Tornow. The darpa packet radio network protocols. In Proceedings of the IEEE, 75(1): 21--32, January 1987.Google ScholarGoogle Scholar
  7. }}M. Meisel, V. Pappas, and L. Zhang. Listen first, broadcast later: Topology-agnostic forwarding under high dynamics. Technical Report 100021, UCLA Computer Science Department, 2010.Google ScholarGoogle Scholar
  8. }}S. Murthy and J. Garcia-Luna-Aceves. An efficient routing protocol for wireless networks. In ACM Mobile Networks and App. J., Special Issue on Routing in Mobile Communication Networks, Oct. 1996, pp. 183--97. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. }}N. Nikaein, C. Bonnet, and N. Nikaein. Harp - hybrid ad hoc routing protocol. In International Symposium on Telecommunications 2001.Google ScholarGoogle Scholar
  10. }}C. E. Perkins and P. Bhagwat. Ad hoc on demand distance vector routing, mobile computing systems and applications. In Second IEEE Workshop on Mobile Computing Systems and Applications, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. }}C. E. Perkins and P. Bhagwat. Highly dynamic destination-sequenced distance-vector routing (dsdv) for mobile computers. In ACM SIGCOMM'94. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. }}N. Vaidya. Open problems in mobile ad hoc networking. In Keynote talk presented at the Workshop on Local Area Networks 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Ad hoc networking via named data

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Conferences
        MobiArch '10: Proceedings of the fifth ACM international workshop on Mobility in the evolving internet architecture
        September 2010
        54 pages
        ISBN:9781450301435
        DOI:10.1145/1859983

        Copyright © 2010 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 24 September 2010

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • research-article

        Acceptance Rates

        Overall Acceptance Rate47of92submissions,51%

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader