Dynamic switching-based reliable flooding in low-duty-cycle wireless sensor networks

Abstract

Abstract-Reliable flooding in wireless sensor networks (WSNs) is desirable for a broad range of applications and network operations, and has been extensively investigated. However, relatively little work has been done for reliable flooding in lowduty-cycle WSNs with unreliable wireless links. It is a challenging problem to efficiently ensure 100% flooding coverage considering the combined effects of low-duty-cycle operation and unreliable wireless transmission. In this work, we propose a novel dynamic switching-based reliable flooding (DSRF) framework, which is designed as an enhancement layer to provide efficient and reliable delivery for a variety of existing flooding tree structures in lowduty-cycle WSNs. The key novelty of DSRF lies in the dynamic switching decision making when encountering a transmission failure, where a flooding tree structure is dynamically adjusted based on the packet reception results for energy saving and delay reduction. DSRF is distinctive from existing works in that it explores both poor links and good links on demand. Through comprehensive performance comparisons, we demonstrate that, compared with the flooding protocol without DSRF enhancement, DSRF effectively reduces the flooding delay and the total number of packet transmission by 12% ∼ 25% and 10% ∼ 15%, respectively. Remarkably, the achieved performance is close to the theoretical lower bound.

Towards energy-fairness for broadcast scheduling with minimum delay in low-duty-cycle sensor networks

“…In recent years, a number of works that focus on energy-efficient broadcast scheduling problem in low-duty-cycle WSNs have been proposed [3][4][5][6][7][8][9][10][11][12][13]. Hong et al [4] studied the Minimum-Transmission Broadcast problem in uncoordinated duty-cycled networks and proved its NP-hardness.…”

“…Due to the NP-hardness of the problem, they designed efficient approximation algorithms with provable performance bounds for it. Cheng et al [12] proposed a novel dynamic switching-based reliable flooding (DSRF) framework, which is designed as an enhancement layer to provide efficient and reliable delivery for a variety of existing flooding tree structures in low duty-cycle WSNs. In [13], the authors investigated the energy efficient broadcast problem with minimum latency constraint in low-duty-cycle WSNs with unreliable links, and proposed a distributed heuristic solution to tackle this problem.…”

“…Note that, our solution is also applicable to the general case where one period of any node's working schedule contains one or more than one active state time slot. As the same with most of the literature for low-duty-cycle WSNs (e.g., [3][4][5]7,[10][11][12][13][24][25][26][27]), we assume that (1) time synchronization is achieved; (2) each node is aware of the working schedules of all its neighboring nodes; and (3) each node can transmit its packets at any time but can only receive packets from its neighbors in active states. Specifically, if any sender wants to send a message to its receiver, it will set a timer to wake up itself at the beginning of the receiver's next active state to finish the transmission.…”

On Minimum-Latency Broadcast in Multichannel Duty-Cycled Wireless Sensor Networks

“…Broadcast is a critical operation in WSNs and thus has attracted plenty of researches [9][10][11][15][16][17][18][19][20][21][22] on this operation. In this paper, we only focus on the work which solves the MLB problem due to the space limit.…”

Adaptive Quantization for Distributed Estimation in Energy-Harvesting Wireless Sensor Networks: A Game-Theoretic Approach

“…There are two kinds of major strategies. One is to reduce energy consumption, such as designing low-complexity software implementation [1], power-efficient coverage, energy-efficient topologies [2, 3], routing techniques [4], and data gathering [5]. Another kind of strategy is to harvest ambient energy from mechanical, thermal, and photovoltaic energy [6] and so forth.…”