Energy saving proactive neighbor discovery algorithm in mobile low-duty-cycle wireless sensor network

Junbin LIANG; Xiang ZHOU; Taoshen LI

doi:10.11959/j.issn.1000-436x.2018054

您当前的位置：

首页 >

文章列表页 >

Energy saving proactive neighbor discovery algorithm in mobile low-duty-cycle wireless sensor network

Papers | 更新时间：2024-06-05

- Energy saving proactive neighbor discovery algorithm in mobile low-duty-cycle wireless sensor network
- Journal on Communications Vol. 39, Issue 4, Pages: 45-55(2018)
- 作者机构：
  
  广西大学计算机与电子信息学院广西多媒体通信与网络技术重点实验室，广西南宁 530004
- 作者简介：
- 基金信息：
  
  The National Natural Science Foundation of China(61562005);The National Natural Science Foundation of China(61762010);The National Natural Science Foundation of China(61363067);The Natural Science Foundation of Guangxi Zhuang Autonomous Region(2015GXNSFAA139286);The Cultivation Plan For Thousands of Young and Middle-Aged Backbone Teachers in Guangxi Higher Education School (Guangxi Education People (2017)(49)
- DOI：10.11959/j.issn.1000-436x.2018054
  CLC： TP393
- Online First：2018-04，
  
  Published：25 April 2018
- 稿件说明：
移动端阅览
Junbin LIANG, Xiang ZHOU, Taoshen LI. Energy saving proactive neighbor discovery algorithm in mobile low-duty-cycle wireless sensor network[J]. Journal on Communications, 2018, 39(4): 45-55.
DOI：

Junbin LIANG, Xiang ZHOU, Taoshen LI. Energy saving proactive neighbor discovery algorithm in mobile low-duty-cycle wireless sensor network[J]. Journal on Communications, 2018, 39(4): 45-55. DOI： 10.11959/j.issn.1000-436x.2018054.

摘要

移动低占空比无线传感网（MLDC-WSN）是近年新兴的一种无线多跳网络，它由大量具有移动能力且会长时间进入睡眠状态的节点自组织而成，可以部署在恶劣环境中执行长期的监测任务，在国防、工业、农业等领域具有广泛的应用前景。但是，节点的移动和睡眠导致网络拓扑不断发生改变，使节点很难以较少的能耗快速发现其全部的邻居，导致节点无法获得最优的分布式决策结果，影响网络应用的效果。为了解决这个难题，提出一种新的主动式邻居发现算法。该算法使网络中的节点在苏醒时主动寻找自己的邻居，避免传统被动式邻居发现中长时间等待所产生的时延。此外，通过对邻居移动速度及距离的预测，快速确定未来下一时刻的邻居集合，在进一步减少时延的同时获得更准确的邻居发现结果。理论分析和实验结果表明，与已有算法相比，所提算法能够在MLDC-WSN中以更小的能耗、更低的时延发现全部的邻居。

Abstract

Mobile low-duty-cycle wireless sensor network is a new kind of wireless multi-hop network

which is self-organized by a large number of nodes that have mobile ability and are able to get into sleep for a long time.Such networks have wide application prospects in national defense

industry

agriculture and other fields that need long term monitoring in severe environments.However

the movement and the sleeping features of nodes lead to constantly change of network topology

which makes the nodes difficult to discover their neighbors quickly.Therefore

the nodes cannot achieve optimal distribution decisions.In order to solve this problem

a new proactive neighbor discovery algorithm was proposed.This algorithm made the nodes in the network take the initiative to find their neighbors when they woke up

and avoided the delay caused by long time waiting in the traditional passive neighbor discovery.In addition

by predicting the movement speed and distance of neighbors

the neighbor set at the next moment can be quickly determined

which can further reduce the delay and obtain more accurate neighbor discovery results.Theoretical analysis and experimental results show that compared with the existing algorithms

the algorithm can find all the neighbors in MLDC-WSN with less energy consumption and lower delay.

关键词

Keywords

references

RAZAQUE A , ELLEITHY K M . Low duty cycle,energy-efficient and mobility-based boarder node-MAC hybrid protocol for wireless sensor networks [J ] . Journal of Signal Processing Systems , 2015 , 81 ( 2 ): 265 - 284 .

GUO S , YANG Y , WANG C . DaGCM:a concurrent data uploading framework for mobile data gathering in wireless sensor networks [J ] . IEEE Transactions on Mobile Computing , 2016 , 15 ( 3 ): 610 - 626 .

陈权 , 高宏 . 低占空比无线传感器网络中基于动态切换的实时路由协议 [J ] . 通信学报 , 2015 , 10 ( 36 ): 224 - 234 .

CHEN Q , GAO H . Dynamic switching based real-time routing in low-duty-cycle wireless sensor networks [J ] . Journal on Communications , 2015 , 10 ( 36 ): 224 - 234 .

QIU Y , LI S , XU X , et al . Talk more listen less:energy-efficient neighbor discovery in wireless sensor networks [C ] // IEEE International Conference on Computer Communications . 2016 : 1 - 9 .

MENG T , WU F , CHEN G . Code-based neighbor discovery protocols in mobile wireless networks [J ] . IEEE Transactions on Networking , 2016 , 24 ( 2 ): 806 - 819 .

MCGLYNN M J , BORBASH S A . Birthday protocols for low energy deployment and flexible neighbor discovery in ad hoc wireless networks [C ] // The ACM MobiHoc . 2001 : 137 - 145 .

YOU L , YUAN Z , YANG P , et al . ALOHA-like neighbor discovery in low-duty-cycle wireless sensor networks [C ] // 2011 IEEE Wireless Communications and Networking Conference (WCNC) . 2011 : 749 - 754 .

JIANG J R , TSENG Y C , HSU C S , et al . Quorum-based asynchronous power-saving protocols for IEEE 802.11 ad hoc networks [C ] // Proceedings of Mobile Networks and Applications . 2005 , 10 ( 12 ): 169 - 181 .

ZHENG R , HOU J C , SHA L . Asynchronous wakeup for ad hoc networks [C ] // The 4th ACM International Symposium on Mobile Ad Hoc Networking ＆ Computing . 2003 : 35 - 45 .

DUTTA P , CULLER D . Practical asynchronous neighbor discovery and rendezvous for mobile sensing applications [C ] // The 6th ACM Conference on Embedded Network Sensor Systems . 2008 : 71 - 84 .

NIVEN I , ZUCKERMAN H S . An introduction to the theory of numbers.4th ed [J ] . American Mathematical Monthly , 1961 , 68 ( 6 ): 401 - 405 .

KANDHALU A , LAKSHMANAN K , RAJKUMAR R R . U-connect:a low-latency energy-efficient asynchronous neighbor discovery protocol [C ] // The 9th ACM/IEEE International Conference on Information Processing in Sensor Networks . 2010 : 350 - 361 .

CHEN H , LOU W , WANG Z , et al . On achieving asynchronous energy-efficient neighbor discovery for mobile sensor networks [J ] . IEEE Transactions on Emerging Topics in Computing , 2016 ,PP( 99 ): 1 - 12 .

KINDT P H , YUNGE D , REINERTH G , et al . Griassdi:mutually assisted slotless neighbor discovery [C ] // ACM/IEEE International Conference on Information Processing in Sensor Networks . 2017 : 93 - 104 .

CHEN L , SHU Y , GU Y , et al . Group-based neighbor discovery in low-duty-cycle mobile sensor networks [J ] . IEEE Transactions on Mobile Computing , 2016 , 15 ( 8 ): 1996 - 2009 .

陈良银 , 颜秉姝 , 张靖宇 , 等 . 移动低占空比传感网邻居发现算法 [J ] . 软件学报 , 2014 , 25 ( 6 ): 1352 - 1368 .

CHEN L Y , YAN B S , ZHANG J Y , et al . Neighbor discovery algorithm in mobile low-duty-cycle wireless sensor networks [J ] . Journal of Software , 2014 , 25 ( 6 ): 1352 - 1368 .

HUANG T , CHEN H , ZHANG Y , et al . EasiND:effective neighbor discovery algorithms for asynchronous and asymmetric-duty-cycle multi-channel mobile WSNs [J ] . Wireless Personal Communications , 2015 , 84 ( 4 ): 3031 - 3055 .

CAMP T , BOLENG J , DAVIES V . A survey of mobility models for ad hoc network research [J ] . Wireless Communications and Mobile Computing , 2002 , 2 ( 5 ): 483 - 502 .

Views

1981

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Latency model of neighbor discovery based on Bluetooth low energy 5.0

Low-latency neighbor discovery algorithm based on multi-beacon message in mobile low-duty-cycle sensor network

Energy-saving privacy data secure aggregation method

SenLeash:a restricted defense mechanism against wormhole attacks in wireless sensor network

Framework for mobility model detection based on local information

Related Author

Zhixin SUN

Zhengkang WANG

Bingqing LUO

Peipei WANG

Junbin LIANG

Xiang ZHOU

Fangqiang MA

Chan JIANG

Related Institution

Jiangsu Key Laboratory of Big Data Security ＆Intelligent Processing, Nanjing University of Posts and Telecommunications

School of Computer Science, Nanjing University of Posts and Telecommunications

Research and Development Center of Post Industry Technology of the State Posts Bureau (Internet of Things Technology, Nanjing University of Posts and Telecommunications

Engineering Research Center of Broadband Wireless Communication Technology of the Ministry of Education, Nanjing University of Posts and Telecommunications

School of Computer and Electronics Information,Guangxi University

AI问答

⁰