摘要
无线传感器由于节点能量有限,sink节点作为多对一数据收集模式的中心,本质上存在能量消耗的不均衡.依据典型的传感器网络参数,主要从理论上分析了一般k跳网络的节点能量消耗特征,证明在一般k跳网络中,必定有一个最佳的k使得网络寿命最长.在此基础上,提出了一种一般k跳网络的TDMA调度算法,并给出了一般k跳网络所需时隙的上界.以此为基础,给出了一般k跳网络全网调度的策略.理论分析与数值模拟计算结果证实了算法的正确性与有效性.
Sensor nodes in wireless sensor networks are constrained by battery power. And the sensor nodes sense a specific phenomenon in the environment and route the sensed data to a relatively small number of central data processing nodes, called sinks. So there exists imbalance in energy consumption in essence. In this paper, the authors are not only interested in determining a TDMA schedule that minimizes the total time required to complete the convergecast, but also consider a TDMA scheduling algorithm can which balance load to prolong network lifetime. They consider a simple version of the problem in which every node generates exactly one packet, and the node has multi-transmission power levels which can vary according to its transmission distance. The formula of energy consumption are analyzed for the general k-hop network in theory according to the typical network parameters. It is proved that there exits a best k that makes the network lifetime the longest. A TDMA scheduling algorithm is proposed for general k-hop network, and the upper bound of time 4 slot required in general k-hop network is given as follows. Based on the analysis, the entire network scheduling strategy can be obtained for general k-hop network. Theoretical analysis and numerical simulation results confirm the accuracy and effectiveness of the algorithms.
出处
《计算机研究与发展》
EI
CSCD
北大核心
2010年第2期245-254,共10页
Journal of Computer Research and Development
基金
湖南省自然科学基金项目(09JJ6095)
湖南省科技计划基金项目(2008FJ3213)
教育部博士学科点专项基金项目(20090162120074)~~
