Ensuring cache freshness in on-demand ad hoc network routing protocols

Hu, Yih-Chun; Johnson, David B.

doi:10.1145/584495.584496

Cited by 7 publications

(10 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [9] the authors propose a mechanism that avoids propagation of stale route information through the network. They do not want to broadcast new route information periodically, however, to avoid the associated overheads.…”

Section: Related Workmentioning

confidence: 99%

Real-time status: How often should one update?

Kaul

Yates

Gruteser

2012

2012 Proceedings IEEE INFOCOM

2,021

1,634

View full text Add to dashboard Cite

Abstract-Increasingly ubiquitous communication networks and connectivity via portable devices have engendered a host of applications in which sources, for example people and environmental sensors, send updates of their status to interested recipients. These applications desire status updates at the recipients to be as timely as possible; however, this is typically constrained by limited network resources. In this paper, we employ a timeaverage age metric for the performance evaluation of status update systems. We derive general methods for calculating the age metric that can be applied to a broad class of service systems. We apply these methods to queue-theoretic system abstractions consisting of a source, a service facility and monitors, with the model of the service facility (physical constraints) a given. The queue discipline of first-come-first-served (FCFS) is explored. We show the existence of an optimal rate at which a source must generate its information to keep its status as timely as possible at all its monitors. This rate differs from those that maximize utilization (throughput) or minimize status packet delivery delay. While our abstractions are simpler than their real-world counterparts, the insights obtained, we believe, are a useful starting point in understanding and designing systems that support real time status updates.

show abstract

Section: Related Workmentioning

confidence: 99%

Real-time status: How often should one update?

Kaul

Yates

Gruteser

2012

2012 Proceedings IEEE INFOCOM

2,021

1,634

View full text Add to dashboard Cite

show abstract

“…In particular, sensor nodes capturing velocity, acceleration, parking radars measurements etc., disseminate this timecritical content to interconnected vehicles across the network to improve road safety and transportation efficiency [4]. Maintaining data freshness is a requirement in numerous other applications like wireless sensor networks (WSN) for healthcare and environmental monitoring [5,6], active data warehousing [7], content caching [8,9,10,11], realtime databases [12], ad hoc networks [13,14], wireless smart camera networks [15,16], unmanned aerial vehicle (UAV)-assisted IoT networks [17,18], broadcast wireless networks [19,20,21], and the efficient design of freshness-aware IoT [22].…”

Section: Motivationmentioning

confidence: 99%

Age of Information Aware Communication Systems : Modeling and Performance Analysis

Kosta

2020

Linköping Studies in Science and Technology. Dissertations

View full text Add to dashboard Cite

show abstract

“…Even if a route error message erases invalid routes, an in-flight data packet that carries the same stale route puts the route back in caches. Epoch numbers [24] are proposed to prevent the re-learning of a stale information. However, SLR does not employ such a mechanism, since one of the goals of bypass routing is to reduce the reliance on route caches.…”

Section: B Route Cachesmentioning

confidence: 99%

Bypass routing: An on-demand local recovery protocol for ad hoc networks

Sengul

Kravets

2006

Ad Hoc Networks

View full text Add to dashboard Cite

On-demand routing protocols for ad hoc networks reduce the cost of routing in high mobility environments. However, route discovery in on-demand routing is typically performed via network-wide flooding, which consumes a substantial amount of bandwidth. In this paper, we present bypass routing, a local recovery protocol that aims to reduce the frequency of route request floods triggered by broken routes. Specifically, when a broken link is detected, a node patches the affected route using local information, which is acquired on-demand, and thereby bypasses the broken link. We implemented SLR (Source Routing with Local Recovery) as a prototype of our approach. Simulation studies show that SLR achieves efficient and effective local recovery while maintaining acceptable overhead.

show abstract

Ensuring cache freshness in on-demand ad hoc network routing protocols

Cited by 7 publications

References 0 publications

Real-time status: How often should one update?

Real-time status: How often should one update?

Age of Information Aware Communication Systems : Modeling and Performance Analysis

Bypass routing: An on-demand local recovery protocol for ad hoc networks

Contact Info

Product

Resources

About