2014/07/15 by Dinesh Ramasamy, Ramasamy, Dinesh, Upamanyu Madhow +1
Computer Science · #Cooperative Communication and Network Coding #FOS: Computer and information sciences #Information Theory (cs.IT) #Mobile Ad Hoc Networks #Networking and Internet Architecture (cs.NI) #Opportunistic and Delay-Tolerant Networks
paper · pdf · doi:10.48550/arxiv.1407.4056
openalex publication_date 2014/07/15 · openalex created_date 2022/08/30 · openalex updated_date 2026/07/28
We propose and evaluate a scalable position-publish and an accompanying\nrouting protocol which is efficient despite operating with imperfect\ninformation regarding the destination's location. The traffic generated by our\nposition-publish protocol fits within the transport capacity of large mobile ad\nhoc networks (MANETs) with constant communication bandwidth allocated for\nrouting overhead, even as the network size increases. The routing protocol\nguarantees, with high probability, routes whose lengths are within a constant\n"stretch" factor of the shortest path from source to destination. The key idea\nunderlying the scalability of the publish protocol is for each potential\ndestination node to send location updates (with frequency decaying with\ndistance) to a subset of network nodes, structured as annular regions around it\n(the natural approach of updating circular regions in distance-dependent\nfashion does not scale). The routing protocol must therefore account for the\nfact that the source and/or relay nodes may not have estimates of the\ndestination's location (or may have stale estimates). Spatial and temporal\nscaling of protocol parameters are chosen so as to guarantee scalability, route\nreliability and route stretch, and these analytical design prescriptions are\nverified using simulations.\n