A distributed energy-efficient opportunistic routing accompanied by timeslot allocation in wireless sensor networks

被引:10
作者
Ri, Man Gun [1 ]
Han, Ye Song [1 ]
Pak, Jin [1 ]
机构
[1] Kim Chaek Univ Technol, Commun Fac, Pyongyang 999093, North Korea
关键词
One-dimensional queue wireless sensor network; opportunistic routing; routing tree construction; timeslot allocation; energy efficiency; wireless sensor networks; RELAY NODE PLACEMENT; AD HOC; PROTOCOL; RELIABILITY; ALGORITHM; MECHANISM; DELAY;
D O I
10.1177/15501477211049917
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Sensed data can be forwarded only in one direction to the base station in one-dimensional queue wireless sensor networks different from mesh structure, so the network lifetime will be shortened if some continuous neighboring nodes have run out of their energy. So designing routing protocols for balancing energy consumption is a challenging problem. However, traditional and existing opportunistic routing protocols for one-dimensional queue wireless sensor network proposed so far have not yet addressed this problem to prolong the network lifetime by introducing sleep mode. In this article, we propose a distributed energy-efficient opportunistic routing algorithm accompanied by timeslot allocation by using specific network topology of one-dimensional queue wireless sensor network. In our new algorithm, clustering and routing tree construction is performed while introducing the optimal relay transmission distance achieved by using opportunistic routing principle, and at the same time, interference-free wake up time is scheduled, which may optimize energy consumption and decrease the number of various control messages as possible to prolong the network lifetime. Furthermore, this improves energy efficiency by introducing the operation mode giving up cluster head role. Simulation results show that the proposed protocol can significantly improve the network performance such as energy consumption and network connectivity, when compared with other existing protocols.
引用
收藏
页数:15
相关论文
共 33 条
[1]   On the Statistics of MFR Routing in One-Dimensional Ad Hoc Networks [J].
Behnad, Aydin ;
Nader-Esfahani, Said .
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2011, 60 (07) :3276-3289
[2]  
Bhardwaj M, 2001, 2001 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-10, CONFERENCE RECORD, P785, DOI 10.1109/ICC.2001.937346
[3]   ExOR: Opportunistic multi-hop routing for wireless networks [J].
Biswas, S ;
Morris, R .
ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2005, 35 (04) :133-143
[4]   Trading structure for randomness in wireless opportunistic routing [J].
Chachulski, Szymon ;
Jennings, Michael ;
Katti, Sachin ;
Katabi, Dina .
ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2007, 37 (04) :169-180
[5]   QoS Aware Geographic Opportunistic Routing in Wireless Sensor Networks [J].
Cheng, Long ;
Niu, Jianwei ;
Cao, Jiannong ;
Das, Sajal K. ;
Gu, Yu .
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2014, 25 (07) :1864-1875
[6]   An Optimal Wake-Up Scheduling Algorithm for Minimizing Energy Consumption While Limiting Maximum Delay in a Mesh Sensor Network [J].
Cohen, Reuven ;
Kapchits, Boris .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2009, 17 (02) :570-581
[7]   BPA-CRP: A balanced power-aware clustering and routing protocol for wireless sensor networks [J].
Darabkh, Khalid A. ;
El-Yabroudi, Mohammad Z. ;
El-Mousa, Ali H. .
AD HOC NETWORKS, 2019, 82 :155-171
[8]   EA-CRP: A Novel Energy-aware Clustering and Routing Protocol in Wireless Sensor Networks [J].
Darabkh, Khalid A. ;
Al-Maaitah, Noor J. ;
Jafar, Iyad E. ;
Khalifeh, Ala' F. .
COMPUTERS & ELECTRICAL ENGINEERING, 2018, 72 :702-718
[9]   MMSPEED: Multipath multi-SPEED protocol for QoS guarantee of reliability and timeliness in wireless sensor networks [J].
Felemban, E ;
Lee, CG ;
Ekici, E .
IEEE TRANSACTIONS ON MOBILE COMPUTING, 2006, 5 (06) :738-754
[10]   An application-specific protocol architecture for wireless microsensor networks [J].
Heinzelman, WB ;
Chandrakasan, AP ;
Balakrishnan, H .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2002, 1 (04) :660-670