2,256 research outputs found

    Contact probing mechanisms for opportunistic sensor data collection in sparse wireless sensor networks

    Get PDF
    In many emerging wireless sensor network scenarios, the use of a fixed infrastructure of base stations for data collection is either infeasible, or prohibitive in terms of deployment and maintenance costs. Instead, we consider the use of mobile devices (i.e. smartphones) carried by people in their daily life to collect data from sensor nodes opportunistically. As the movement of these mobile nodes is, by definition, not controlled for the purpose of data collection, synchronization through contact probing becomes a challenging task, particularly for sensor nodes, which need to be aggressively duty-cycled to conserve energy and achieve long lifetimes. This paper formulates this important problem, providing an analytical solution framework and systematically investigating the effective use of contact probing for opportunistic data collection. We present two new solutions, Sensor Node-Initiated Probing (SNIP) and SNIP-Rush Hours, the latter taking advantage of the temporal locality of human mobility. These schemes are evaluated using numerical analysis and COOJA network simulations, and the results are validated on a small sensor testbed and with the real-world human mobility traces from Nokia MDC Dataset. Our experimental results quantify the relative performance of alternative solutions on sensor node energy consumption and the efficacy of contact probing for data collection, allowing us to offer insights on this important emerging problem

    A novel cooperative opportunistic routing scheme for underwater sensor networks

    Get PDF
    Increasing attention has recently been devoted to underwater sensor networks (UWSNs) because of their capabilities in the ocean monitoring and resource discovery. UWSNs are faced with different challenges, the most notable of which is perhaps how to efficiently deliver packets taking into account all of the constraints of the available acoustic communication channel. The opportunistic routing provides a reliable solution with the aid of intermediate nodes’ collaboration to relay a packet toward the destination. In this paper, we propose a new routing protocol, called opportunistic void avoidance routing (OVAR), to address the void problem and also the energy-reliability trade-off in the forwarding set selection. OVAR takes advantage of distributed beaconing, constructs the adjacency graph at each hop and selects a forwarding set that holds the best trade-off between reliability and energy efficiency. The unique features of OVAR in selecting the candidate nodes in the vicinity of each other leads to the resolution of the hidden node problem. OVAR is also able to select the forwarding set in any direction from the sender, which increases its flexibility to bypass any kind of void area with the minimum deviation from the optimal path. The results of our extensive simulation study show that OVAR outperforms other protocols in terms of the packet delivery ratio, energy consumption, end-to-end delay, hop count and traversed distance

    A stateless opportunistic routing protocol for underwater sensor networks

    Get PDF
    Routing packets in Underwater Sensor Networks (UWSNs) face different challenges, the most notable of which is perhaps how to deal with void communication areas. While this issue is not addressed in some underwater routing protocols, there exist some partially state-full protocols which can guarantee the delivery of packets using excessive communication overhead. However, there is no fully stateless underwater routing protocol, to the best of our knowledge, which can detect and bypass trapped nodes. A trapped node is a node which only leads packets to arrive finally at a void node. In this paper, we propose a Stateless Opportunistic Routing Protocol (SORP), in which the void and trapped nodes are locally detected in the different area of network topology to be excluded during the routing phase using a passive participation approach. SORP also uses a novel scheme to employ an adaptive forwarding area which can be resized and replaced according to the local density and placement of the candidate forwarding nodes to enhance the energy efficiency and reliability. We also make a theoretical analysis on the routing performance in case of considering the shadow zone and variable propagation delays. The results of our extensive simulation study indicate that SORP outperforms other protocols regarding the routing performance metrics

    Low Power, Low Delay: Opportunistic Routing meets Duty Cycling

    Get PDF
    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
    corecore