无线传感器网络能量均衡消耗的TDMA调度算法.PDFVIP

ISSN 1000- 1239CN 11- 1777TP Journal of Computer Research and De elopment 47( 2) : 245- 254, 2010 TDMA 1, 2 2 1, 2 刘安丰 徐 娟 陈志刚 1 ( 4 10083) 2 ( 410083) ( anfengliu@ sina. com) A TDMA Scheduling Algorithm to Balance Energy Consumption in WSNs 1, 2 2 1, 2 Liu Anfeng , Xu Juan , and Chen Zhigang 1 ( Colleg e of I nf or mation Sc ience and E ng ineer ing , Centr al S outh Univ er sity , Changsha 4 10083) 2 ( School of S of tw ar e, Centr al South Univ er sity , Changsha 4 10083) Abstract Sensor nodes in w ireless sensor netw orks are constr ained by battery pow er. And the sensor nodes sense a specific phenomenon in the en ironment and route the sensed data to a relati ely small number of central data processing nodes, called sinks. So there ex ists imbalance in ener gy consumption in essence. In this paper, the author s are not only interested in deter mining a TDMA schedule that minimizes the total time requir ed to complete the con ergecast, but also consider a T DM A scheduling algorithm can w hich balance load to prolong netw ork lifetime. T hey consider a simple er sion of the problem in w hich e ery node generates ex actly one packet, and the node has mult-i transmission pow er le els w hich can ary according to its transmission distance. T he formula of energy consumption are analyzed for the general k-hop netw ork in theory according to the typical netw or k parameter s. It is pro ed that there ex its a best k that makes the netw ork lifetime the longest . A TDM A scheduling algorithm is proposed for gener al k-hop netw ork, and the upper bound of time slot required in general k-hop netw ork is gi en as follow s. Based on the analysis, the entire netw or k scheduling