4,101 research outputs found
Towards Opportunistic Data Dissemination in Mobile Phone Sensor Networks
Recently, there has been a growing interest within the research community in developing opportunistic routing protocols. Many schemes have been proposed; however, they differ greatly in assumptions and in type of network for which they are evaluated. As a result, researchers have an ambiguous understanding of how these schemes compare against each other in their specific applications. To investigate the performance of existing opportunistic routing algorithms in realistic scenarios, we propose a heterogeneous architecture including fixed infrastructure, mobile infrastructure, and mobile nodes. The proposed architecture focuses on how to utilize the available, low cost short-range radios of mobile phones for data gathering and dissemination. We also propose a new realistic mobility model and metrics. Existing opportunistic routing protocols are simulated and evaluated with the proposed heterogeneous architecture, mobility models, and transmission interfaces. Results show that some protocols suffer long time-to-live (TTL), while others suffer short TTL. We show that heterogeneous sensor network architectures need heterogeneous routing algorithms, such as a combination of Epidemic and Spray and Wait
Low Power, Low Delay: Opportunistic Routing meets Duty Cycling
Traditionally, routing in wireless sensor networks consists of
two steps: First, the routing protocol selects a next hop,
and, second, the MAC protocol waits for the intended destination
to wake up and receive the data. This design makes
it difficult to adapt to link dynamics and introduces delays
while waiting for the next hop to wake up.
In this paper we introduce ORW, a practical opportunistic
routing scheme for wireless sensor networks. In a dutycycled
setting, packets are addressed to sets of potential receivers
and forwarded by the neighbor that wakes up first
and successfully receives the packet. This reduces delay and
energy consumption by utilizing all neighbors as potential
forwarders. Furthermore, this increases resilience to wireless
link dynamics by exploiting spatial diversity. Our results
show that ORW reduces radio duty-cycles on average
by 50% (up to 90% on individual nodes) and delays by 30%
to 90% when compared to the state of the art
Timely Data Delivery in a Realistic Bus Network
Abstract—WiFi-enabled buses and stops may form the backbone of a metropolitan delay tolerant network, that exploits nearby communications, temporary storage at stops, and predictable bus mobility to deliver non-real time information. This paper studies the problem of how to route data from its source to its destination in order to maximize the delivery probability by a given deadline. We assume to know the bus schedule, but we take into account that randomness, due to road traffic conditions or passengers boarding and alighting, affects bus mobility. We propose a simple stochastic model for bus arrivals at stops, supported by a study of real-life traces collected in a large urban network. A succinct graph representation of this model allows us to devise an optimal (under our model) single-copy routing algorithm and then extend it to cases where several copies of the same data are permitted. Through an extensive simulation study, we compare the optimal routing algorithm with three other approaches: minimizing the expected traversal time over our graph, minimizing the number of hops a packet can travel, and a recently-proposed heuristic based on bus frequencies. Our optimal algorithm outperforms all of them, but most of the times it essentially reduces to minimizing the expected traversal time. For values of deadlines close to the expected delivery time, the multi-copy extension requires only 10 copies to reach almost the performance of the costly flooding approach. I
- …