ویراساینس.
سند علمی

Optimal stochastic routing in low duty-cycled wireless sensor networks

Dongsook Kim, Mingyan Liu

چکیده

We study a routing problem in wireless sensor networks where sensors are duty-cycled. When sensors alternate between on and off modes, delay encountered in packet delivery due to loss in connectivity can become a critical problem, and how to achieve delay-optimality is non-trivial. For instance, when sensors’ sleep schedules are uncoordinated, it is not immediately clear whether a sensor with data to transmit should wait for a particular neighbor (who may be on a short route) to become available/active before transmission, or simply transmit to an available/active neighbor to avoid waiting. To obtain some insight into this problem, in this paper we formulate it as an optimal stochastic routing problem, where the randomness in the system comes from random duty cycling, as well as the uncertainty in packet transmission due to channel variations. Similar framework has been used in prior work which results in optimal routing algorithms that are sample-path dependent, also referred to as opportunistic in some cases. We show such algorithms are no longer optimal when duty cycling is introduced. We first develop and analyze an optimal centralized stochastic routing algorithm for randomly duty-cycled wireless sensor networks, and then simplify the algorithm to work with only local information. We further develop a distributed algorithm utilizing only local sleep/wake information of neighbors. This algorithm is shown to perform better than some existing distributed opportunistic routing algorithms such as ExOR.

اسناد مشابه

  • Opportunistic Routing in Low Duty-Cycled Wireless Sensor Networks

    سند علمی۲۰۱۳Euhanna Ghadimi, Olaf Landsiedel, Pablo Soldati, Simon Duquennoy

    Opportunistic routing is widely known to have substantially better performance than unicast routing in wireless networks with lossy links. However, wireless sensor networks are heavily duty-cycled, i.e. they frequently enter sleep states to ensure long network life-time. This ren

  • Dynamic Routing Algorithm for Priority Guarantee in Low Duty-Cycled Wireless Sensor Networks

    سند علمی۲۰۱۰WASAGuodong Sun, Bin Xu

    It is a new challenge to provide priority-based delivery in low duty-cycled sensor networks where there are not always-awake communication paths and the wireless links are very time-varying and unreliable. In this paper, we propose a Dynamic Routing Algorithm for priority Guarant

  • Understanding a Broadcast Service in Low Duty-Cycle Wireless Sensor Network

    سند علمی۲۰۱۳Pankaj G. Ingole, Archana R. Raut

    In low-duty-cycle networks, sensors stay dormant most of time to save their energy and wake up based on their needs. Such a technique, while prolonging the network lifetime, sets excessive challenges for efficient broadcast within the network. Broadcast service is widely used dur

  • A Comparison Between Neighbour Discovery Protocols in Low Duty-Cycled Wireless Sensor Networks

    سند علمی۲۰۱۵Tao Shang

    Wireless sensor networks are applied in a wide variety of applications, such as environment monitoring, target tracking and so on. Neighbour discovery process is an important component of wireless sensor network’s access and basic communication. Duty-cycle based wireless sensor n

  • L : Lazy Forwarding in Low Duty Cycle Wireless Sensor Networks

    سند علمی۲۰۱۲Zhichao Cao, Yuan He, Yunhao Liu

    Energy-constrained wireless sensor networks are dutycycled, relaying on multi-hop forwarding to collect data packets. A forwarding scheme generally involves three design elements: media access, link estimation, and routing strategy. Most existing studies, however, focus only on a

  • : Lazy Forwarding in Low-Duty-Cycle Wireless Sensor Network

    سند علمی۲۰۱۴Zhichao Cao, Yunhao Liu

    In order to simultaneously achieve good energy efficiency and high packet delivery performance, a multihop forwarding scheme should generally involve three design elements: media access mechanism, link estimation scheme, and routing strategy. Disregarding the low-duty-cycle natur