简介概要

Delay optimization for planar wireless sensor network with N-policy

来源期刊:中南大学学报(英文版)2014年第12期

论文作者:CHEN Zhi-gang(陈志刚) ZHANG De-yu(张德宇) 陈龙

文章页码:4537 - 4543

Key words:wireless sensor network; N-policy; delay; energy-efficiency; M/M/1

Abstract: In N-policy, the nodes attempt to seize the channel when the number of packets in the buffer approaches N. The performance of N-policy on the energy efficiency is widely studied in the past years. And it is presented that there exists one optimal N to minimize the energy consumption. However, it is noticed that the delay raised by N-policy receives little attention. This work mathematically proves the delay to monotonically increase with increasing N in the collision-unfree channel. For planar network where the near-to-sink nodes burden heavier traffic than the external ones, the data stemming from the latter undergo longer delay. The various-N algorithm is proposed to address this phenomenon by decreasing the threshold N of outer nodes. Without the impacting on the network longevity, the maximum delay among the network has decreased 62.9% by the algorithm. Extensive simulations are given to verify the effectiveness and correctness of our analysis.

详情信息展示

Delay optimization for planar wireless sensor network with N-policy

CHEN Zhi-gang(陈志刚)1, 2, ZHANG De-yu(张德宇)1, CHEN Long(陈龙)2

(1. School of Information Science and Engineering, Central South University, Changsha 410083, China;
2. School of Software, Central South University, Changsha 410075)

Abstract:In N-policy, the nodes attempt to seize the channel when the number of packets in the buffer approaches N. The performance of N-policy on the energy efficiency is widely studied in the past years. And it is presented that there exists one optimal N to minimize the energy consumption. However, it is noticed that the delay raised by N-policy receives little attention. This work mathematically proves the delay to monotonically increase with increasing N in the collision-unfree channel. For planar network where the near-to-sink nodes burden heavier traffic than the external ones, the data stemming from the latter undergo longer delay. The various-N algorithm is proposed to address this phenomenon by decreasing the threshold N of outer nodes. Without the impacting on the network longevity, the maximum delay among the network has decreased 62.9% by the algorithm. Extensive simulations are given to verify the effectiveness and correctness of our analysis.

Key words:wireless sensor network; N-policy; delay; energy-efficiency; M/M/1

<上一页 1 下一页 >

有色金属在线官网  |   会议  |   在线投稿  |   购买纸书  |   科技图书馆

中南大学出版社 技术支持 版权声明   电话:0731-88830515 88830516   传真:0731-88710482   Email:administrator@cnnmol.com

互联网出版许可证:(署)网出证(京)字第342号   京ICP备17050991号-6      京公网安备11010802042557号