On Achieving Asynchronous Energy-Efficient Neighbor Discovery for Mobile Sensor Networks
On Achieving Asynchronous Energy-Efficient Neighbor Discovery for Mobile Sensor Networks
复制标题
实现移动传感器网络的异步节能邻居发现
DOI：
10.1109/tetc.2016.2586192
复制
发表时间：
2018-10-01
影响因子：
5.9
通讯作者：
Xia, Feng
中科院分区：
文献类型：
--
作者：
Chen, Honglong;Lou, Wei;Xia, Feng
Recent advances in mobile sensor networks (MSNs) lead to a wide demand of wireless communication based applications. However, due to the battery technology constraint, many MSNs-based applications are confined by the limited power resource capacity. Thus, discovering neighbors with minimal power consumption and latency becomes an indispensable characteristic to guarantee the feasibility of above applications. Most of previously proposed time-slotted-based neighbor discovery protocols excessively idealize the power consumption model, which ignores the power consumption and time duration of the transient state. In this paper, we propose a more practical model named enhanced power consumption model that considers the power consumption and time duration of the transient state. We then propose the asynchronous energy-efficient neighbor discovery protocols called Quick-Connect (<inline-formula> <tex-math notation="LaTeX">$Q-Connect$</tex-math><alternatives><inline-graphic xlink:href="chen-ieq1-2586192.gif"/> </alternatives></inline-formula>) including <inline-formula><tex-math notation="LaTeX">$Q-Connect_A$</tex-math> <alternatives><inline-graphic xlink:href="chen-ieq2-2586192.gif"/></alternatives></inline-formula>, <inline-formula> <tex-math notation="LaTeX">$Q-Connect_U$</tex-math><alternatives><inline-graphic xlink:href="chen-ieq3-2586192.gif"/> </alternatives></inline-formula> and <inline-formula><tex-math notation="LaTeX">$Q-Connect_{UI}$</tex-math> <alternatives><inline-graphic xlink:href="chen-ieq4-2586192.gif"/></alternatives></inline-formula> protocols, each of which can provide a strict upper bound on the discovery latency. We consider both the slot-aligned and slot-unaligned cases. For slot-aligned case, we propose the <inline-formula><tex-math notation="LaTeX">$Q-Connect_A$</tex-math> <alternatives><inline-graphic xlink:href="chen-ieq5-2586192.gif"/></alternatives></inline-formula> protocol, which can greatly reduce the worst-case discovery latency. For slot-unaligned case, we first propose the <inline-formula> <tex-math notation="LaTeX">$Q-Connect_U$</tex-math><alternatives><inline-graphic xlink:href="chen-ieq6-2586192.gif"/> </alternatives></inline-formula> protocol, based on which we further propose an improved protocol called <inline-formula><tex-math notation="LaTeX">$Q-Connect_{UI}$</tex-math><alternatives> <inline-graphic xlink:href="chen-ieq7-2586192.gif"/></alternatives></inline-formula>. Finally, we conduct state-based simulations to illustrate the effectiveness of the proposed <inline-formula><tex-math notation="LaTeX">$Q-Connect$ </tex-math><alternatives><inline-graphic xlink:href="chen-ieq8-2586192.gif"/></alternatives></inline-formula> protocols.
