无线传感器网络节点调度算法的研究
|
摘要
在无线传感器网络中,如何合理使用网络中的节点以延长网络寿命是传感器网络规划中的一个关键问题。节点调度算法是解决上述问题的一种可行方案,它以节点轮流工作的方式来节省能源,延长网络寿命。目前很多调度算法需要知道节点的地理位置信息,需要借助GPS等定位系统,不利于构建低成本的传感器网络;已有的一些应用较好的随机调度算法都是基于布尔感知模型建立的,这不符合实际的情形。基于以上问题,本文以随机调度算法为基础,主要作了以下一些工作:
首先概述了随机调度算法并分析了其优缺点,随机调度算法是一种基于网络局部覆盖的方法,无需知道节点的位置信息、容错性好,且局部覆盖控制策略可以简化网络的协议设计,使网络配置更加灵活。但这些算法使用的布尔感知模型并不符合实际的感知情形,为此本文采用更符合实际的概率感知模型,在此感知模型下,分析了随机调度算法中网络覆盖度与节点数之间的关系,给出了解析表达式,利用该表达式可确定出需要布撒的节点数,解决了随机调度算法的节点配置问题。
其次,针对随机调度算法存在的另一个问题,即节点是利用产生随机数的方法加入到不同的工作子集,从而导致初始子集中节点分布不均,本文在概率感知模型下提出了一种基于节点平均度的随机调度算法。该算法通过邻居节点之间信息的传输,利用节点平均度约束使每个节点的邻居节点尽量均匀分散在不同的子集中。仿真结果表明,经新算法处理之后,每个子集中的节点呈现均匀分布;分析表明,新算法具有极低的时间复杂度和消息复杂度,具有很好的实用性。
In Wireless Sensor Networks (WSN), it is a crucial problem that how to prolong the network lifetime using the nodes reasonably in programming sensor networks. Node scheduling algorithm is a feasible method to resolve above-mentioned question, which refers to make the nodes work in turns to save energy. At present, many scheduling algorithms need geographic information with the help of GPS positioning system, which is not conducive to build a low-cost sensor networks; at the same time, all the existing random scheduling algorithms which have better applications are on a basis of Boolean sensing model, and it doesn't accord with the actual case. In view of the above- mentioned problems, based on the existing random scheduling algorithm , we have accomplished the following work.
First of all, the existing random scheduling algorithm is described briefly, and the strengths and weaknesses are analyzed. The random scheduling algorithm is on local coverage of network and without the help of geographic information, and has a good fault tolerance. In addition, using local coverage control strategy can not only simplify the protocol design of network, but also configure nodes more flexibly. But the Boolean sensing model used doesn't accord with the actual sensing case, so based on probabilistic sensing model more close to the practical applications, we have analyzed the relationship between coverage intensity and the number of nodes and given the expression by which we can get the nodes needed to deploy. So configuring nodes in random scheduling algorithm has been resolved.
Secondly, to resolve another question in random scheduling algorithm, that is, how to make the nodes evenly distributed in every subset composed of some sensor nodes, a new method - a random scheduling algorithm based on the average degree of nodes is presented, which is on the basis of probabilistic sensing model. Taking advantage of information transmission between neighbor nodes and average degree of nodes, it makes every node’s neighbor nodes distributed in different subsets evenly. The simulation results show that the nodes in every subset brought by the new algorithm are uniformly distributed, and analysis shows that the new algorithm can work with a very low time complexity and message complexity, so it has a great practicability.
首先概述了随机调度算法并分析了其优缺点,随机调度算法是一种基于网络局部覆盖的方法,无需知道节点的位置信息、容错性好,且局部覆盖控制策略可以简化网络的协议设计,使网络配置更加灵活。但这些算法使用的布尔感知模型并不符合实际的感知情形,为此本文采用更符合实际的概率感知模型,在此感知模型下,分析了随机调度算法中网络覆盖度与节点数之间的关系,给出了解析表达式,利用该表达式可确定出需要布撒的节点数,解决了随机调度算法的节点配置问题。
其次,针对随机调度算法存在的另一个问题,即节点是利用产生随机数的方法加入到不同的工作子集,从而导致初始子集中节点分布不均,本文在概率感知模型下提出了一种基于节点平均度的随机调度算法。该算法通过邻居节点之间信息的传输,利用节点平均度约束使每个节点的邻居节点尽量均匀分散在不同的子集中。仿真结果表明,经新算法处理之后,每个子集中的节点呈现均匀分布;分析表明,新算法具有极低的时间复杂度和消息复杂度,具有很好的实用性。
In Wireless Sensor Networks (WSN), it is a crucial problem that how to prolong the network lifetime using the nodes reasonably in programming sensor networks. Node scheduling algorithm is a feasible method to resolve above-mentioned question, which refers to make the nodes work in turns to save energy. At present, many scheduling algorithms need geographic information with the help of GPS positioning system, which is not conducive to build a low-cost sensor networks; at the same time, all the existing random scheduling algorithms which have better applications are on a basis of Boolean sensing model, and it doesn't accord with the actual case. In view of the above- mentioned problems, based on the existing random scheduling algorithm , we have accomplished the following work.
First of all, the existing random scheduling algorithm is described briefly, and the strengths and weaknesses are analyzed. The random scheduling algorithm is on local coverage of network and without the help of geographic information, and has a good fault tolerance. In addition, using local coverage control strategy can not only simplify the protocol design of network, but also configure nodes more flexibly. But the Boolean sensing model used doesn't accord with the actual sensing case, so based on probabilistic sensing model more close to the practical applications, we have analyzed the relationship between coverage intensity and the number of nodes and given the expression by which we can get the nodes needed to deploy. So configuring nodes in random scheduling algorithm has been resolved.
Secondly, to resolve another question in random scheduling algorithm, that is, how to make the nodes evenly distributed in every subset composed of some sensor nodes, a new method - a random scheduling algorithm based on the average degree of nodes is presented, which is on the basis of probabilistic sensing model. Taking advantage of information transmission between neighbor nodes and average degree of nodes, it makes every node’s neighbor nodes distributed in different subsets evenly. The simulation results show that the nodes in every subset brought by the new algorithm are uniformly distributed, and analysis shows that the new algorithm can work with a very low time complexity and message complexity, so it has a great practicability.
引文
[1] Akyildiz IF, Su WL, Sankarasubramaniam Y. Wireless Sensor Networks: a Survey [J]. Computer Networks. 2002, 38(4). 393-422.
[2] Estrin D, Govindan R, Heidemann J S. Next century challenges: Scalable coordinate in sensor network. In: Proc 5th ACM/IEEE Int’l Conf on Mobile Computing and Networking. 1999.263-270.
[3]李建中,李金宝,石胜飞.传感器网络及其数据管理的概念、问题与进展[J].软件学报. 2003, 14 (10). 1717- 1727.
[4]孙利民等.无线传感器网络[M].北京:清华大学出版社. 2005. 3-6.
[5]石军锋,钟先信,陈帅等.无线传感器网络结构及特点分析.重庆大学学报. 2005, 28 (2). 16-19.
[6] Mainwaring A, Culler D, Polastre J, et al. Wireless Sensor Networks for Habitat Monitoring[C]. Proc of the 1st ACM Int’l Workshop on Wireless Sensor Networks and Applications. 2002. 88- 97.
[7] Xu Ning, Rangwala S, Chintalapudi K K, et al. A Wireless Sensor Network for Structural Monitoring[C]. Proc of the 2nd Int’l Conf on Embedded Networked Sensor Systems. 2004. 13- 24.
[8] A. poerrt, T. Melly, C. Enz, et al. A Low-power Low-Voltage Transceiver Architect- ure Suitable for Wireless Distributed Sensors Network[R]. IEEE International Symposium Circuits and Systems’00, Geneva, 2000.
[9] Shih E, Cho S H, Eckes N, et al. Physical Layer Driven Protocol and Algorithm Design for Energy-Efficient Wireless Sensor Networks[R]. In: Proc 7th Annual Int’l Conf on Mobile Computing and Networking. 2001. 272-287.
[10] Raghunhathan V, Schurgers C, Sung Park, et al. Energy-Aware Wireless Microsen- sor Networks [J]. IEEE Single Processing Magazine. 2002, 19(2). 40-45.
[11] Younis O, fahmy S. HEED: A hybrid, energy-efficient, distributed clustering appro- ach for ad hoc sensor networks. IEEE Trans. on Mobile Computing. 2004, 3(4). 660-669.
[12]金岩,王玲,杨孝宗等.无线传感器网络节点调度算法及研究进展[J].宇航学报. 2007, 28(5). 1086-1093.
[13] Zhou Zongheng, Samir Das, Himanshu Gupta,“Connected K-Coverage Problem in Sensor Networks”, Thirteenth international conference on computer communica-tions and networks (ICCCN2004) October 11-13, 2004 Chicago, ILUSA.
[14] Heinzelman W, Chandrakasan A , Balakrishnan H. Energy efficient communication protocol for wireless micro sensor networks [C]. Proceedings of Hawaii Conference on System Sciences, USA: IEEE . 2000. 3005-3014.
[15] Wook Choi and Sahal K.Das. A Novel Framework for Energy-Conserving Data Gathering in Wireless Sensor Networks [C]. 2005 IEEE. 1985-1996.
[16] Cerpa A, Estrin D. Ascent: adaptive self-configuring sensor networks topologies [J]. IEEE Transactions on Mobile Computing. 2004, 3(3). 1-14.
[17] Abrams Z, Goel A, and Plotkin S. Set k-cover Algorithms for Energy Efficient Monitoring in Wireless Sensor Net works. Proceedings of Information Processing in Sensor Networks 2004, Berkeley, CA, April 2004.
[18] Wang X R, Xing GL, Zhang Y, et al.Integrated coverage and connectivity config- uration in wireless sensor networks [C]. Proceedings of ACM Conference on Embedded Networked Sensor Systems, USA: ACM. 2003. 28-39.
[19] Zou Y, Chakrabarty K. A distributed coverage and connectivity centric technique for selecting active nodes in wireless sensor networks [J]. IEEE Transactions on Computers. 2005, 54(8). 978-991.
[20] M. Vieira, L. Vieira, L. Ruiz, et al. Scheduling Nodes in Wireless Sensor Networks: A Voronoi Approach [J]. LCN 2003. 423-429.
[21] Romit Roy Choudhury, Robin Kravets. Location-Independent Coverage in Wireless Sensor Networks [R]. Technical Report, UIUC. 2005.
[22] Fang Qing, Gao Jie, Leonidas J. Guibas. Locating and Bypassing Routing Holes in Sensor Networks [R]. In IEEE INFOCOM 2004.
[23]康波,柯欣,孙利民等.无线传感器网络中的调度算法研究[J].计算机科学. 2008, 35(02). 47-51.
[24]胡湘华,杨学军.传感网节点调度方法综述[J].计算机工程与科学.2008, 30(03). 93-96, 129.
[25] Hill J, Szewczyk R, Woo A , et al . System Architecture Directions for Networked Sensors [C]. Proc of the 9th Int’l Conf on Architectural Support for Programming Languages and Operating Systems. 2000. 77- 91.
[26] D Tian, N D Georganas. A coverage-preserving node scheduling scheme for large wireless sensor networks [C]. In: Proc of the1st ACM Workshop on Wireless Sensor Networks and Applications. New York: ACM Press. 2002. 32-41.
[27] Zhang H, Hou J C. Maintaining sensing coverage and connectivity in large sensor networks [J]. International Journal of Ad Hoc and Sensor Wireless Networks. 2005,1(1). 89-124.
[28]蒋杰,方力等.无线传感器网络最小连通覆盖集问题求解算法[J].软件学报. 2006, 17(2). 175-184.
[29] Stojmenovic I. Position based routing in ad hoc networks. IEEE Communications Magazine. 2002, 40(7). 128-134.
[30] T yan,T He,J Stankovic. Differentiated surveillance for sensor Networks [C]. In: Proc of ACM SENSYS’03, New York: ACM Press. 2003. 51-62.
[31] W Choi, S K Das. Trade-off between coverage and data reporting latency for energy conserving data gathering in wireless sensor networks [C]. In: Proc of IEEE Int’l Conf on Mobile Ad-hoc and Sensor Systems Piscataway, NJ: IEEE Press. 2004. 25-27.
[32] Liu Chong, Wu Kui, Valerie King. Randomized coverage-preserving scheduling schemes for wireless sensor networks [C]. In: Proc of IFIP Networking Conf, LNCS 3462.Berlin: Springer. 2005. 956 -967.
[33] Liu C, Wu K, Xiao Y, et al. Random coverage with guaranteed connectivity: Joint scheduling for wireless sensor networks [J]. IEEE Trans on Parallel and Distributed Systems. 2006, 17. 562 -575.
[34]刘巍,崔莉,黄长城. EasiFCCT:一种保证连通性的传感器网络局部覆盖算法.计算机研究与进展[J]. 2008, 45(1). 196 -204.
[35] Jiang Jie, Liu Chong, GuofuWu, et al. On Location-Free Node Scheduling Scheme for Random Wireless Sensor Networks. ICESS 2005, LNCS 3820. 484-493.
[36] Xiao Y, Chen H, Wu K, et al. Maximizing Network Life Time under QoS constrain- ts in Wireless Sensor Networks. Proc. Of GLOBECOM 2006.
[37] Xiao Y, Chen H, Wu K, et al. Modeling Detection Metrics in Randomized Scheduling Algorithm in Wireless Sensor Networks. Wireless Communications and Networking Confercence, 2007. IEEE. 2007, March, pages: 3741-3745.
[38] Xiao Y, Chen H, Wu K, et al. Asymptotic Coverage and Detection in Randomized Scheduling Algorithm in Wireless Sensor Networks. IEEE International Conference on Communications, 2007. 2007, 7. 3541-3545.
[39]刘丽萍.无线传感器网络节能覆盖[D].浙江大学. 2006.
[40] Adlakha S, Srivastava M. Critical density thresholds for coverage in wireless sensor networks [A]. Wireless Communications and Networking, IEEE. 2003.1615- 1620.
[41]屈玉贵,翟羽佳.一种新的无线传感器网络传感器放置模型[J].北京邮电大学学报. 2004, 27(6). 1-5.
[42]袁石银,石为人.基于概率模型的无线传感器网络节点调度算法[A]. 2007仪表,自动化及先进集成技术大会论文集(一)[C]. 2007.
[43] Yi Zou. Coverage-driven sensor deployment and energy-efficient information Proceessing in wireless sensor networks [D]. Doctor dissertation, department of electrical and computer engineering Duke University. 2004.
[44] Xu Yong, Yao Xin. A GA approach to the optimal placement of sensor in Wireless sensor networks with obstacles and Preferences [C]. Consumer Communications and Networking Conference, CCNC. 2006 3rd IEEE. 127-131.
[45] Wang Bang. A survey on coverage problems in wireless sensor networks. Technical Report, National University of Singapore. 2006.
[46] Cardei M, Du D Z. Improving wireless sensor network lifetime through power aware organization [J] . Wireless Networks. 2005, 11 (3). 333-340.
[47] Cardei M, Thai M T , Li Y S, et al . Energy- efficient target coverage in wireless se- nsor networks[C]. Proceedings of IEEE INFOCOM, USA: IEEE. 2005.1976-1984.
[48] Cardei M, Wu J, Lu M. Improving network lifetime using sensors with adjustable sensing ranges [J]. International Journal of Sensor Networks. 2006, 1. 41-49.
[49] Ye F, Zhong G, Lu S , et al. Peas: a robust energy conserving protocol for long-lived sensor networks[C]. Proceedings of IEEE Conference on Distributed Computing Systems, USA: IEEE .2003. 28-37.
[50]王殊,阎摎杰,胡富平等.无线传感器网络的理论及应用[M].北京:北京航空航天大学出版社. 2007年7月.
[51]石高涛,廖明宏.大规模传感器网络随机睡眠调度节能机制[J].计算机研究与发展. 2006, 43(4). 579-585.
[52] Xu Y, Heidemann J , Estrin D. Geography-informed energy conservation for ad hoc routing [C]. Proceedings of ACM Conference on Mobile Computing and Networki- ng, USA: ACM. 2001. 16-21.
[53] Chen B, Jamieson K, Balakrishnan H, et al. Span: an energy-efficient Coordination algorithm for topology maintenance in ad hoc wireless networks [J]. Wireless Networks. 2002, 8(5). 481-494.
[54]陈力军,毛鹰池,陈道蓄等.平均度约束的无线传感器网络拓扑控制[J].计算机学报. 2007, 30(07). 1544-1550.
[2] Estrin D, Govindan R, Heidemann J S. Next century challenges: Scalable coordinate in sensor network. In: Proc 5th ACM/IEEE Int’l Conf on Mobile Computing and Networking. 1999.263-270.
[3]李建中,李金宝,石胜飞.传感器网络及其数据管理的概念、问题与进展[J].软件学报. 2003, 14 (10). 1717- 1727.
[4]孙利民等.无线传感器网络[M].北京:清华大学出版社. 2005. 3-6.
[5]石军锋,钟先信,陈帅等.无线传感器网络结构及特点分析.重庆大学学报. 2005, 28 (2). 16-19.
[6] Mainwaring A, Culler D, Polastre J, et al. Wireless Sensor Networks for Habitat Monitoring[C]. Proc of the 1st ACM Int’l Workshop on Wireless Sensor Networks and Applications. 2002. 88- 97.
[7] Xu Ning, Rangwala S, Chintalapudi K K, et al. A Wireless Sensor Network for Structural Monitoring[C]. Proc of the 2nd Int’l Conf on Embedded Networked Sensor Systems. 2004. 13- 24.
[8] A. poerrt, T. Melly, C. Enz, et al. A Low-power Low-Voltage Transceiver Architect- ure Suitable for Wireless Distributed Sensors Network[R]. IEEE International Symposium Circuits and Systems’00, Geneva, 2000.
[9] Shih E, Cho S H, Eckes N, et al. Physical Layer Driven Protocol and Algorithm Design for Energy-Efficient Wireless Sensor Networks[R]. In: Proc 7th Annual Int’l Conf on Mobile Computing and Networking. 2001. 272-287.
[10] Raghunhathan V, Schurgers C, Sung Park, et al. Energy-Aware Wireless Microsen- sor Networks [J]. IEEE Single Processing Magazine. 2002, 19(2). 40-45.
[11] Younis O, fahmy S. HEED: A hybrid, energy-efficient, distributed clustering appro- ach for ad hoc sensor networks. IEEE Trans. on Mobile Computing. 2004, 3(4). 660-669.
[12]金岩,王玲,杨孝宗等.无线传感器网络节点调度算法及研究进展[J].宇航学报. 2007, 28(5). 1086-1093.
[13] Zhou Zongheng, Samir Das, Himanshu Gupta,“Connected K-Coverage Problem in Sensor Networks”, Thirteenth international conference on computer communica-tions and networks (ICCCN2004) October 11-13, 2004 Chicago, ILUSA.
[14] Heinzelman W, Chandrakasan A , Balakrishnan H. Energy efficient communication protocol for wireless micro sensor networks [C]. Proceedings of Hawaii Conference on System Sciences, USA: IEEE . 2000. 3005-3014.
[15] Wook Choi and Sahal K.Das. A Novel Framework for Energy-Conserving Data Gathering in Wireless Sensor Networks [C]. 2005 IEEE. 1985-1996.
[16] Cerpa A, Estrin D. Ascent: adaptive self-configuring sensor networks topologies [J]. IEEE Transactions on Mobile Computing. 2004, 3(3). 1-14.
[17] Abrams Z, Goel A, and Plotkin S. Set k-cover Algorithms for Energy Efficient Monitoring in Wireless Sensor Net works. Proceedings of Information Processing in Sensor Networks 2004, Berkeley, CA, April 2004.
[18] Wang X R, Xing GL, Zhang Y, et al.Integrated coverage and connectivity config- uration in wireless sensor networks [C]. Proceedings of ACM Conference on Embedded Networked Sensor Systems, USA: ACM. 2003. 28-39.
[19] Zou Y, Chakrabarty K. A distributed coverage and connectivity centric technique for selecting active nodes in wireless sensor networks [J]. IEEE Transactions on Computers. 2005, 54(8). 978-991.
[20] M. Vieira, L. Vieira, L. Ruiz, et al. Scheduling Nodes in Wireless Sensor Networks: A Voronoi Approach [J]. LCN 2003. 423-429.
[21] Romit Roy Choudhury, Robin Kravets. Location-Independent Coverage in Wireless Sensor Networks [R]. Technical Report, UIUC. 2005.
[22] Fang Qing, Gao Jie, Leonidas J. Guibas. Locating and Bypassing Routing Holes in Sensor Networks [R]. In IEEE INFOCOM 2004.
[23]康波,柯欣,孙利民等.无线传感器网络中的调度算法研究[J].计算机科学. 2008, 35(02). 47-51.
[24]胡湘华,杨学军.传感网节点调度方法综述[J].计算机工程与科学.2008, 30(03). 93-96, 129.
[25] Hill J, Szewczyk R, Woo A , et al . System Architecture Directions for Networked Sensors [C]. Proc of the 9th Int’l Conf on Architectural Support for Programming Languages and Operating Systems. 2000. 77- 91.
[26] D Tian, N D Georganas. A coverage-preserving node scheduling scheme for large wireless sensor networks [C]. In: Proc of the1st ACM Workshop on Wireless Sensor Networks and Applications. New York: ACM Press. 2002. 32-41.
[27] Zhang H, Hou J C. Maintaining sensing coverage and connectivity in large sensor networks [J]. International Journal of Ad Hoc and Sensor Wireless Networks. 2005,1(1). 89-124.
[28]蒋杰,方力等.无线传感器网络最小连通覆盖集问题求解算法[J].软件学报. 2006, 17(2). 175-184.
[29] Stojmenovic I. Position based routing in ad hoc networks. IEEE Communications Magazine. 2002, 40(7). 128-134.
[30] T yan,T He,J Stankovic. Differentiated surveillance for sensor Networks [C]. In: Proc of ACM SENSYS’03, New York: ACM Press. 2003. 51-62.
[31] W Choi, S K Das. Trade-off between coverage and data reporting latency for energy conserving data gathering in wireless sensor networks [C]. In: Proc of IEEE Int’l Conf on Mobile Ad-hoc and Sensor Systems Piscataway, NJ: IEEE Press. 2004. 25-27.
[32] Liu Chong, Wu Kui, Valerie King. Randomized coverage-preserving scheduling schemes for wireless sensor networks [C]. In: Proc of IFIP Networking Conf, LNCS 3462.Berlin: Springer. 2005. 956 -967.
[33] Liu C, Wu K, Xiao Y, et al. Random coverage with guaranteed connectivity: Joint scheduling for wireless sensor networks [J]. IEEE Trans on Parallel and Distributed Systems. 2006, 17. 562 -575.
[34]刘巍,崔莉,黄长城. EasiFCCT:一种保证连通性的传感器网络局部覆盖算法.计算机研究与进展[J]. 2008, 45(1). 196 -204.
[35] Jiang Jie, Liu Chong, GuofuWu, et al. On Location-Free Node Scheduling Scheme for Random Wireless Sensor Networks. ICESS 2005, LNCS 3820. 484-493.
[36] Xiao Y, Chen H, Wu K, et al. Maximizing Network Life Time under QoS constrain- ts in Wireless Sensor Networks. Proc. Of GLOBECOM 2006.
[37] Xiao Y, Chen H, Wu K, et al. Modeling Detection Metrics in Randomized Scheduling Algorithm in Wireless Sensor Networks. Wireless Communications and Networking Confercence, 2007. IEEE. 2007, March, pages: 3741-3745.
[38] Xiao Y, Chen H, Wu K, et al. Asymptotic Coverage and Detection in Randomized Scheduling Algorithm in Wireless Sensor Networks. IEEE International Conference on Communications, 2007. 2007, 7. 3541-3545.
[39]刘丽萍.无线传感器网络节能覆盖[D].浙江大学. 2006.
[40] Adlakha S, Srivastava M. Critical density thresholds for coverage in wireless sensor networks [A]. Wireless Communications and Networking, IEEE. 2003.1615- 1620.
[41]屈玉贵,翟羽佳.一种新的无线传感器网络传感器放置模型[J].北京邮电大学学报. 2004, 27(6). 1-5.
[42]袁石银,石为人.基于概率模型的无线传感器网络节点调度算法[A]. 2007仪表,自动化及先进集成技术大会论文集(一)[C]. 2007.
[43] Yi Zou. Coverage-driven sensor deployment and energy-efficient information Proceessing in wireless sensor networks [D]. Doctor dissertation, department of electrical and computer engineering Duke University. 2004.
[44] Xu Yong, Yao Xin. A GA approach to the optimal placement of sensor in Wireless sensor networks with obstacles and Preferences [C]. Consumer Communications and Networking Conference, CCNC. 2006 3rd IEEE. 127-131.
[45] Wang Bang. A survey on coverage problems in wireless sensor networks. Technical Report, National University of Singapore. 2006.
[46] Cardei M, Du D Z. Improving wireless sensor network lifetime through power aware organization [J] . Wireless Networks. 2005, 11 (3). 333-340.
[47] Cardei M, Thai M T , Li Y S, et al . Energy- efficient target coverage in wireless se- nsor networks[C]. Proceedings of IEEE INFOCOM, USA: IEEE. 2005.1976-1984.
[48] Cardei M, Wu J, Lu M. Improving network lifetime using sensors with adjustable sensing ranges [J]. International Journal of Sensor Networks. 2006, 1. 41-49.
[49] Ye F, Zhong G, Lu S , et al. Peas: a robust energy conserving protocol for long-lived sensor networks[C]. Proceedings of IEEE Conference on Distributed Computing Systems, USA: IEEE .2003. 28-37.
[50]王殊,阎摎杰,胡富平等.无线传感器网络的理论及应用[M].北京:北京航空航天大学出版社. 2007年7月.
[51]石高涛,廖明宏.大规模传感器网络随机睡眠调度节能机制[J].计算机研究与发展. 2006, 43(4). 579-585.
[52] Xu Y, Heidemann J , Estrin D. Geography-informed energy conservation for ad hoc routing [C]. Proceedings of ACM Conference on Mobile Computing and Networki- ng, USA: ACM. 2001. 16-21.
[53] Chen B, Jamieson K, Balakrishnan H, et al. Span: an energy-efficient Coordination algorithm for topology maintenance in ad hoc wireless networks [J]. Wireless Networks. 2002, 8(5). 481-494.
[54]陈力军,毛鹰池,陈道蓄等.平均度约束的无线传感器网络拓扑控制[J].计算机学报. 2007, 30(07). 1544-1550.