Maximizing throughput for low duty-cycled sensor networks

Xu, Dan; Jiao, Wenli; Yin, Zhuang; Huang, Junjie; Yao, Peng; Liu, Chen; Fang, Dingyi; Tang, Zhanyong

doi:10.1016/j.comnet.2018.03.017

Cited by 10 publications

(4 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The results of simulation experiments are as shown in Tables 32,33,34,35,36,37,38,39,40,and 41. From Table 32, we can see that for the 18 fire points, after Bi-adjusting, the average EDL of six fire points decreases, the average EDL of seven fire points increases, and the EDL delay of five fire points is changeless. However, for the entire network, after biadjusting, the average EDL is reduced by 3.91%, which shows that bi-adjusting is effective for reducing the EDL.…”

Section: Experimental and Resultsmentioning

confidence: 99%

“…Therefore, a lot of research in reducing delay under the condition of not reducing lifetime, obviously this is a better way. Some studies have proposed adjusting the active slots between nodes in the sensing range to make these active slots evenly distributed to reduce event detection latency [40]. However, some studies have proposed adjusting the active slots of nodes on the routing path to be continuous, so that packet data can be continuously performed during routing, which reduces the data routing delay [41].However, there is no overall study on delay optimization, so we propose a biadjusting duty cycle schedule (BADCS) scheme which can simultaneously reduce event detection latency as well as data routing delay for low duty cycle wireless sensor network (WSNs).…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Bi-adjusting duty cycle for green communications in wireless sensor networks

Wang

Gui

et al. 2020

J Wireless Com Network

View full text Add to dashboard Cite

Green communications is a challenging issue for communications and networking. In order to save energy, nodes of the wireless sensor networks (WSNs) usually adopt the low duty cycle mode which brings a large delay to the event detection and data transmission to the sink and deteriorates the network's timely processing of the event. In this paper, bi-adjusting duty cycle schedule (BADCS) scheme is proposed to reduce event detection latency as well as data routing delay for low duty cycle wireless sensor networks. BADCS scheme consists mainly of two duty cycle adjustment algorithms: (a) active slot asynchronous adjustment algorithm for nodes in the same sensing area; (b) the continuous adjustment algorithm for two adjacent nodes on the routing path with one active slot interval. Specifically, the operations are 2-fold. First, perform asynchronous operations on the active slots of the nodes in the same sensing area, so that the active slots of the nodes in the same sensing area are distributed as evenly as possible without overlapping. In this way, it is possible to reduce the latency by the time the event is perceived after its occurrence. Secondly, active slots of the nodes on the routing path are adjusted to be with pipeline style, so that when the nodes receive the data packet, they can route through the continuous active slots, thus greatly reducing the delay of data routing. Two adjustment algorithms of active slot are given in detail in this paper. The performance of BADCS mode is discussed in detail, and its performance is better than the previous strategy. Comprehensive experiments are conducted, and the results demonstrate that the proposed BADCS scheme significantly improves event detection performance in terms of detection latency, detection probability, and routing delay. Detection delay and routing delay are reduced as high as 3.91% and 56.22% respectively.

show abstract

Section: Experimental and Resultsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Bi-adjusting duty cycle for green communications in wireless sensor networks

Wang

Gui

et al. 2020

J Wireless Com Network

View full text Add to dashboard Cite

show abstract

“…In 2017, Chen et al proposes a lightweight OR protocol LWOF [8]. LWOF uses the conclusion in [23] to establish the candidate set by dividing a 60-degree sector-shaped candidate area, and it optimizes the length of the preamble in the MAC protocol according to the duty length. Although the LWOF protocol is only suitable for WSNs with high network density, how it designs areas is another effective solution to establish candidate sets without global computation.…”

Section: Related Workmentioning

confidence: 99%

Low-Delay Opportunistic Routing with Reducing Overhead in Asynchronous Duty-Cycled Wireless Sensor Networks

Liu

Zhang

Liu

2022

Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

The Internet of Things (IoT) and cloud computing are well developed and applied in different services. Among these services, some of them take latency and overhead as the metrics to evaluate the quality of services. This paper introduces how an opportunistic routing (OR) protocol reduces latency and overhead when it is applied in wireless sensor network (WSN) application among lightweight devices. OR mitigates the delay problem and balances the energy consumption and delay of the nodes in WSNs. However, OR, with the nature of broadcasting, can easily cause heavy overhead such as redundant data and control packets in the forwarding process. In the current solution, the number of candidates (potential forwarders) is not limited by the dynamics of forwarding process. Also, the overhead of establishing the candidate sets is high due to global information calculation. Therefore, a low-delay OR protocol with reducing overhead which designs the dynamic candidate area (DCA) to establish candidate sets is first proposed in this paper. The main work is as follows. (a) The duty cycle of a node is adjusted according to the distance between the node and sink node in the initialized network. (b) A method to establish dynamic candidate sets is proposed based on the adaptive duty cycle. Before and during the forwarding process, the dynamic candidate area is adjusted in time. (c) According to the feature of the candidate area, the corresponding routing metric is proposed to complete the cooperative communication among candidates. Through further theoretical analysis and simulations, the results indicate that this protocol achieves better performance in terms of transmission delay, data and control overhead, and network lifetime compared to the state-of-the-art solutions.

show abstract

“…The responsibility of chain head is taken by every node in turn and the chain head was responsible for transmitting the aggregation data to the Sink. Paper [14] organized the nodes in a two-level chain structure, which is composed of multiple low-level chains with fixed length and one high-level chain composed of chain head nodes of the low-level chains. The data was transmitted and aggregated from the low-level chains to the high-level chains and finally received by the Sink.…”

Section: Related Workmentioning

confidence: 99%

An Optimized Clustering Communication Protocol Based on Intelligent Computing in Information-Centric Internet of Things

et al. 2019

View full text Add to dashboard Cite

A narrow bandwidth may lead to a large amount of redundant data, which further causes the interruptions of the communication network. In order to address this problem, an optimized clustering communication protocol based on intelligent computing (CCP-IC) is proposed in this paper. First, we adopt the intelligent algorithm to perform the optimization of the clustering in the sensor network. The adaptation function and the heuristic function are introduced to make a targeted choice on the cluster head for the next hop of the nodes in the network. Second, the controllable threshold parameter and variation coefficient are employed to optimize the shortest path chosen by the network routing. Therefore, the node energy consumption is lowered when the minimum network delay is guaranteed and the transmission efficiency is improved. Finally, it is verified via the simulation results and compared with other algorithms; the proposed protocol reduces the network energy consumption by 15.3% and prolongs the network lifetime by 18.72%, which proves the validity and effectiveness of the proposed protocol. INDEX TERMS Internet of Things, clustering communication protocol, intelligent computing, network lifetime.

show abstract

Maximizing throughput for low duty-cycled sensor networks

Cited by 10 publications

References 17 publications

Bi-adjusting duty cycle for green communications in wireless sensor networks

Bi-adjusting duty cycle for green communications in wireless sensor networks

Low-Delay Opportunistic Routing with Reducing Overhead in Asynchronous Duty-Cycled Wireless Sensor Networks

An Optimized Clustering Communication Protocol Based on Intelligent Computing in Information-Centric Internet of Things

Contact Info

Product

Resources

About