无线传感器网络节能问题研究
|
摘要
本文在详细分析了各种节能技术,对节能技术进行微观宏观分类的基础上,从软件层面对传感器网络的节能问题展开了深入的研究。主要贡献和创新点包括以下几个方面:
1.提出了数据压缩以及数据融合的节能度量模型,为数据压缩与数据融合方法的选择提供了一种决策方法。并以此为基础提出了一种基于能耗度量的融合树构建算法,通过融合节点反馈能耗以及到达Sink节点的跳数信息,对多个路由的能耗进行评估,进而选择低能耗路由。
2.提出了基于动态博弈理论的能量感知路由算法,将能量感知路由选择问题建模为动态博弈问题,解决了能量感知路由以能耗统计值随机选择下一跳路由节点的缺陷,提高了网络节点路由选择的可预测性,为休眠调度机制提供了有力的技术支持,该路由算法更加适合与休眠调度机制相结合从而延长无线传感器网络的生命期。
3.对定位技术中减少定位信息量的方法进行了研究,提出了使网络节点定位具有确定性约束的约束唯一实现理论,降低了网络定位的能耗上限,由此建立的约束定位方法不仅提高了网络的定位精度,而且使得网络定位所需的定位信息大为减少,该方法同时降低了网络连通度的下限,减少了网络节点退避重传的几率,从而达到网络节能的效果。
4.提出了系统设计全生命周期的面向服务的网络生存期优化体系模型,该模型利用先验统计信息将不同的应用与优化算法统一起来,从服务“供求”的角度对具体应用服务需求与网络服务能力进行量化评估,并以评估结果作为反馈调节网络使之达到网络生存期最大限度的优化。该模型将各种节能技术在服务的层面上综合考虑,贯穿于应用解决方案的各个环节,为传感器网络节能需求发展为应用解决方案的一项独立需求提供理论上的支持。
Severe energy constraint is one of the differences between WSN and traditional network. It is not feasible to supply energy with new batteries to the sensor nodes because there are plenty of sensors which are very cheap and are deployed in a wide and complex area, some of which men can not reach. Besides, WSN can not be reused after its energy burns out because of the features of large scale and its battery not easily replaceable, which makes energy efficient technologies a method to decrease the cost of the network per hour. In the per-hour-cost point of view, energy saving are not only an issue of technology, but also an issue of cost, which can play a competitive role between companies. Even if solar power or vibration technologies can be used in the future, all the energy saved can be stored to supply a more complex application, which can make WSN spread widely and also can make companies competitive. Therefore, energy efficient technologies are very important in WSN, the principal goal of energy aware WSN is the efficient use of energy.
The energy aware issue has become a very hot research point in recent years. A lot of researchers have focused on diminishing the network power consumption. Such work can be illustrated from micro and macro perspectives respectively. In micro aspect, data compression and data aggregation can be used to reduce the power consumption by transmitting less data. Meanwhile, the nodes can be arranged to get into the sleep mode when there is no transmission task, which can be called sleep scheduling. These researches from micro angle have laid a solid foundation for the power saving issue, and furthermore, sleep scheduling plays a very important role especially when the scenario has a low frequency of data transmission. But in the micro aspect, the schemes have only considered the power consumption of individual nodes or path, which has a feature of centralization, that is, the feature of burning the energy of the nodes along those paths. This leaves the network with a wide disparity in the energy levels of the nodes, eventually leading to disconnected subnets, and thus the network loses the ability to serve. However, as is known to all that the goal of the network is to gather information from a specified region of observation and relay this information to the sink node, whether the network can support service should be concentrated on, not the lifetime of a single path. This inspires the work of macro energy saving. In macro aspect, the energy aware issue has stepped into a new stage on which the aim of energy aware technologies should be more service-oriented and the lifetime should be prolonged more systematically.
A whole study of energy aware issues is carried out in this paper in the software perspective view. After a detailed analysis on various energy aware technologies, the issues are deeply investigated. In micro aspect, data compression and data aggregation, as well as the scheme of sleep scheduling and energy efficient localization is explored. The research work of micro aspect can gain an energy efficient impact on local areas. However, for WSN with the aim of gathering data, the essential goal is to hold this issue as a whole. Therefore, in the macro aspect of energy saving, service-oriented lifetime is studied in this paper, treating micro-aspect technologies as the supporting technologies for macro-aspect methods. All the energy aware technologies are considered in the service point of view, so that energy aware issue can be solved more systematically. The contributions of this paper are as follows:
Firstly, an energy consumption assessing model is proposed, which gives a method for the network to make a decision whether to use data compression or data aggregation technology. After that, an aggregation tree constructing algorithm based on energy consumption assessment is proposed, which can get the information of hops from the aggregation point to the sink and the hops from the aggregation point to the source node is used to construct such an aggregation tree. Meanwhile, an approach to reduce the cost of reinforcement is also presented, in which the reinforcement work is done by the source nodes themselves, not by the sink node. Simulation results show that this approach can save more energy than GIT when the aggregation ratio is small, and that the further the sources are away from the sink, the less reinforcement messages are needed.
Secondly, a routing algorithm is proposed that can make better choices is proposed, which is modeled by dynamic game theory takes the available power of the nodes and the power consumption of the path into consideration. This method is more predictable for being combined with sleep scheduling scheme and thus can prolong the lifetime of WSN, which overcomes the random defect of Energy Aware Routing. The method is also easy to be combined with sleep scheduling technologies to prolong the lifetime of WSN.
Thirdly, in microscopic energy-saving area, which takes energy-saving as its specific need, one way to reduce information content in localization technology is studied, taking network localization technology as an example. The problem of energy aware localization is a tradeoff between the amount of information and the accuracy of localization. The constraint unique realization is proposed to make the positions of the network nodes determined, which also decreases the upper bound of energy consumption burning on localization. The lower bound of connectivity is weakened by our theory, which means there will be fewer collisions and further means less energy consumption.
Lastly, a lifetime optimizing scheme is proposed to combine different applications, network service, network deployment and optimizing algorithms together. The statistic model is employed to unify different applications and optimizing algorithms in this scheme, thus application requirements and network service ability are quantified. In every link of the network solutions, various energy aware technologies are considered in the service point of view, which lays a foundation for a more independent requirement of the solutions.
This paper studies the three most representative energy-saving technologies in microscopic energy-saving area, aiming at getting a clear picture of the energy-saving issue in general. So in macroscopic energy-saving area, this paper focuses on service-oriented network lifetime, viewing the three technologies mentioned above as the supporting technology of the entire network energy-saving. Since various energy-saving technologies are taken into consideration from the perspective of service, the energy-saving of WSN is more systematized. This study of service-oriented optimizing scheme of network lifetime enables energy-saving to become the system design for the whole lifetime, which helps establish energy-saving as a relatively independent research area. Thus, energy-saving can be proposed as an independent system requirement like“network security”, consequently facilitating the systematization of solution.
1.提出了数据压缩以及数据融合的节能度量模型,为数据压缩与数据融合方法的选择提供了一种决策方法。并以此为基础提出了一种基于能耗度量的融合树构建算法,通过融合节点反馈能耗以及到达Sink节点的跳数信息,对多个路由的能耗进行评估,进而选择低能耗路由。
2.提出了基于动态博弈理论的能量感知路由算法,将能量感知路由选择问题建模为动态博弈问题,解决了能量感知路由以能耗统计值随机选择下一跳路由节点的缺陷,提高了网络节点路由选择的可预测性,为休眠调度机制提供了有力的技术支持,该路由算法更加适合与休眠调度机制相结合从而延长无线传感器网络的生命期。
3.对定位技术中减少定位信息量的方法进行了研究,提出了使网络节点定位具有确定性约束的约束唯一实现理论,降低了网络定位的能耗上限,由此建立的约束定位方法不仅提高了网络的定位精度,而且使得网络定位所需的定位信息大为减少,该方法同时降低了网络连通度的下限,减少了网络节点退避重传的几率,从而达到网络节能的效果。
4.提出了系统设计全生命周期的面向服务的网络生存期优化体系模型,该模型利用先验统计信息将不同的应用与优化算法统一起来,从服务“供求”的角度对具体应用服务需求与网络服务能力进行量化评估,并以评估结果作为反馈调节网络使之达到网络生存期最大限度的优化。该模型将各种节能技术在服务的层面上综合考虑,贯穿于应用解决方案的各个环节,为传感器网络节能需求发展为应用解决方案的一项独立需求提供理论上的支持。
Severe energy constraint is one of the differences between WSN and traditional network. It is not feasible to supply energy with new batteries to the sensor nodes because there are plenty of sensors which are very cheap and are deployed in a wide and complex area, some of which men can not reach. Besides, WSN can not be reused after its energy burns out because of the features of large scale and its battery not easily replaceable, which makes energy efficient technologies a method to decrease the cost of the network per hour. In the per-hour-cost point of view, energy saving are not only an issue of technology, but also an issue of cost, which can play a competitive role between companies. Even if solar power or vibration technologies can be used in the future, all the energy saved can be stored to supply a more complex application, which can make WSN spread widely and also can make companies competitive. Therefore, energy efficient technologies are very important in WSN, the principal goal of energy aware WSN is the efficient use of energy.
The energy aware issue has become a very hot research point in recent years. A lot of researchers have focused on diminishing the network power consumption. Such work can be illustrated from micro and macro perspectives respectively. In micro aspect, data compression and data aggregation can be used to reduce the power consumption by transmitting less data. Meanwhile, the nodes can be arranged to get into the sleep mode when there is no transmission task, which can be called sleep scheduling. These researches from micro angle have laid a solid foundation for the power saving issue, and furthermore, sleep scheduling plays a very important role especially when the scenario has a low frequency of data transmission. But in the micro aspect, the schemes have only considered the power consumption of individual nodes or path, which has a feature of centralization, that is, the feature of burning the energy of the nodes along those paths. This leaves the network with a wide disparity in the energy levels of the nodes, eventually leading to disconnected subnets, and thus the network loses the ability to serve. However, as is known to all that the goal of the network is to gather information from a specified region of observation and relay this information to the sink node, whether the network can support service should be concentrated on, not the lifetime of a single path. This inspires the work of macro energy saving. In macro aspect, the energy aware issue has stepped into a new stage on which the aim of energy aware technologies should be more service-oriented and the lifetime should be prolonged more systematically.
A whole study of energy aware issues is carried out in this paper in the software perspective view. After a detailed analysis on various energy aware technologies, the issues are deeply investigated. In micro aspect, data compression and data aggregation, as well as the scheme of sleep scheduling and energy efficient localization is explored. The research work of micro aspect can gain an energy efficient impact on local areas. However, for WSN with the aim of gathering data, the essential goal is to hold this issue as a whole. Therefore, in the macro aspect of energy saving, service-oriented lifetime is studied in this paper, treating micro-aspect technologies as the supporting technologies for macro-aspect methods. All the energy aware technologies are considered in the service point of view, so that energy aware issue can be solved more systematically. The contributions of this paper are as follows:
Firstly, an energy consumption assessing model is proposed, which gives a method for the network to make a decision whether to use data compression or data aggregation technology. After that, an aggregation tree constructing algorithm based on energy consumption assessment is proposed, which can get the information of hops from the aggregation point to the sink and the hops from the aggregation point to the source node is used to construct such an aggregation tree. Meanwhile, an approach to reduce the cost of reinforcement is also presented, in which the reinforcement work is done by the source nodes themselves, not by the sink node. Simulation results show that this approach can save more energy than GIT when the aggregation ratio is small, and that the further the sources are away from the sink, the less reinforcement messages are needed.
Secondly, a routing algorithm is proposed that can make better choices is proposed, which is modeled by dynamic game theory takes the available power of the nodes and the power consumption of the path into consideration. This method is more predictable for being combined with sleep scheduling scheme and thus can prolong the lifetime of WSN, which overcomes the random defect of Energy Aware Routing. The method is also easy to be combined with sleep scheduling technologies to prolong the lifetime of WSN.
Thirdly, in microscopic energy-saving area, which takes energy-saving as its specific need, one way to reduce information content in localization technology is studied, taking network localization technology as an example. The problem of energy aware localization is a tradeoff between the amount of information and the accuracy of localization. The constraint unique realization is proposed to make the positions of the network nodes determined, which also decreases the upper bound of energy consumption burning on localization. The lower bound of connectivity is weakened by our theory, which means there will be fewer collisions and further means less energy consumption.
Lastly, a lifetime optimizing scheme is proposed to combine different applications, network service, network deployment and optimizing algorithms together. The statistic model is employed to unify different applications and optimizing algorithms in this scheme, thus application requirements and network service ability are quantified. In every link of the network solutions, various energy aware technologies are considered in the service point of view, which lays a foundation for a more independent requirement of the solutions.
This paper studies the three most representative energy-saving technologies in microscopic energy-saving area, aiming at getting a clear picture of the energy-saving issue in general. So in macroscopic energy-saving area, this paper focuses on service-oriented network lifetime, viewing the three technologies mentioned above as the supporting technology of the entire network energy-saving. Since various energy-saving technologies are taken into consideration from the perspective of service, the energy-saving of WSN is more systematized. This study of service-oriented optimizing scheme of network lifetime enables energy-saving to become the system design for the whole lifetime, which helps establish energy-saving as a relatively independent research area. Thus, energy-saving can be proposed as an independent system requirement like“network security”, consequently facilitating the systematization of solution.
引文
[1] Sun Limin, Li Jianzhong, Chen Yu, Zhu Hongsong. Wireless Sensor Network[M]. Peking: Tsinghua University Press, 2005 (孙利民,李建中,陈渝,朱红松.无线传感器网络[M].北京:清华大学出版社, 2005.)
[2] Akyildiz I F, Su W, Sankarasubramaniam Y, et al. Wireless sensor networks: a survey[J]. Computer Networks, 2002, 38(4): 393-422.
[3] Rabaey, Jan M., Pedram, Massoud (Eds.). Low Power Design Methodologies[M]. Springer, 1995.
[4] Pedram, Massoud, Rabaey, Jan M. Power Aware Design Methodologies[M]. Springer, 2002.
[5] Chunlong Guo, Lizhi Charlie Zhong, Jan. M. Rabaey. Low Power Distributed MAC for Ad Hoc Sensor Radio Networks[C]. Global Telecommunications Conference (GLOBECOM '01), 2001,12.
[6] Shah R, Rabaey J. Energy aware routing for low energy ad hoc sensor networks[C]. In: Proc. of the IEEE Wireless Communications and Networking Conf. Orlando: IEEE Communications Society, 2002:350-355.
[7] Pan Yantao. Research on Lifetime Optimization in Wireless Sensor Networks[Ph D dissertation][D]. Changsha: Nationnal University of Defense and Technology, 2006(in Chinese)潘晏涛.无线传感器网络生存时间优化问题研究[博士学位论文][D].长沙:国防科学技术大学, 2006.
[8] Bhaskar Krishnamachari, Deborah Estrin, Stephen Wicker. Modeling data-centric routing in wireless sensor networks[C]. In: Stojmenovic I, Olariu S, eds. Proc. of the IEEE Infocom. New York: IEEE Computer Society, 2002:2-14.
[9] J. M. Kahn, R. H. Katz, K. S. J. Pister. Emerging Challenges: Mobile Networking for Smart Dust[J]. Journal of Communications and Networks, 2000, 2(3):188–196.
[10] V. Raghunathan, C. Schurgers, S. Park, M. B. Srivastava. Energy-Aware Wireless Microsensor Networks[J]. IEEE Signal Processing Magazine, 2002.19:40–50.
[11] G. J. Pottie and W. J. Kaiser. Embedding the Internet: Wireless Integrated Network Sensors[J]. Communications of the ACM, 2000.43(5):51–58.
[12] Naoto Kimura, Shahram Latifi. A Survey on Data Compression in Wireless Sensor Networks[C]. In: Proceedings of the International Conference on Information Technology: Coding and Computing. Washington: IEEE Computer Society, 2005:8-13.
[13] Kenneth Barr, Krste Asanovi′c. Energy Aware Lossless Data Compression[G]. In: ACM Transactions on Computer Systems. New York: ACM Press. 2006.24(3):250-291.
[14] Xie Zhijun, Wang Lei, Lin Yaping, Chen Hong, Liu Yonghe. An Algorithm of Data Aggregation Based on Data Compression for Sensor Networks[J]. Journal of Software. 2006.17(4):860?867. (谢志军,王雷,林亚平,陈红,刘永和.传感器网络中基于数据压缩的汇聚算法[J]. Journal of Software. 2006.17(4):860?867.)
[15] Olga Saukh, Pedro Jos′e Marr′on, Andreas Lachenmann, Matthias Gauger, Daniel Minder, Kurt Rothermel. Generic Routing Metric and Policies for WSNs[C]. In: Proceedings of the Third European Workshop on Wireless Sensor Networks. 2006:99-114.
[16] Noseong Park, Daeyoung Kim, Yoonmee Doh, Sangsoo Lee, Ji-tae Kim. An Optimal and Lightweight Routing for Minimum Energy Consumption in Wireless Sensor Networks[C]. In: Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications. New York: IEEE Computer Society, 2005:1533-2306.
[17] Chalermek Intanagonwiwat, Deborah Estrin, Ramesh Govindan, John Heidemann. Impact of Network Density on Data Aggregation in Wireless Sensor Networks[C]. In: Proceedings of the 22nd International Conference on Distributed Computing Systems. Washington: IEEE Computer Society. 2002:457-458.
[18] Chalermek Intanagonwiwat, Ramesh Govindan, Deborah Estrin. Directed Diffusion: A Scalable and Robust Communication Paradigm for Sensor Networks.[C] In: Proc. of the ACM MobiCom. Boston: ACM Press, 2000:56-67.
[19] H¨useyin O¨zgu¨r Tan and˙Ibrahim Ko¨rpeogˇlu. Power Efficient Data Gathering and Aggregation in Wireless Sensor Networks[J]. ACM SIGMOD Record. New York: ACM Press, 2003,32(4):66-71.
[20] I. Kadayif, M. Kandemir. Tuning In-Sensor Data Filtering to Reduce Energy Consumption in Wireless Sensor Networks[C]. In: Proceedings of the Design, Automation and Test in Europe Conference and Exhibition. 2004(04):1530-1591
[21] DEBRA A. LELEWER, DANIEL S.HIRSCHBERG .Data Compression[J]. ACM Computing Surveys, 1987.19 (3).
[22] T Rappaport . Wireless Communications : Principles and Practice[M]. New Jersey : Prentice-Hall Inc, 1996.
[23] Cui L, Ju HL, Miao Y, Li TP, Liu W, Zhao Z. Overview of wireless sensor networks[J]. Journal of Computer Research and Development, 2005,42(1):163?174 (in Chinese with English abstract).
[24] Dragan Petrovi?, Rahul C. Shah, Kannan Ramchandran, Jan Rabaey. Data Funneling:Routing with Aggregation and Compression for Wireless Sensor Networks[C]. IEEE ICC Int. Workshop on Sensor Network Protocols and Applications, 2003.
[25] M. Julius Hossain, Oksam Chae, Md. Mamun-Or-Rashid, Choong Seon Hong. Cost-Effective Maximum Lifetime Routing Protocol for Wireless Sensor Networks[C]. In: Proceedings of the Advanced Industrial Conference on Telecommunications/Service Assurance with Partial and Intermittent Resources Conference/E-Learning on Telecommunications Workshop. Washington: IEEE Computer Society, 2005:314-319.
[26] Konstantinos Kalpakis, Koustuv Dasgupta1, Parag Namjoshi. Maximum Lifetime Data Gathering and Aggregation in Wireless Sensor Networks[J]. Computer Networks 2003, 42(6): 697-716.
[27] Merrett, G. V., Harris, N. R., Al-Hashimi, B. M. and White, N. M. Energy Managed Reporting for Wireless Sensor Networks[J]. 2008. 142 (1): 379-389
[28] Tai-Jung Chang. Kuochen Wang. Yi-Ling Hsieh. A color-theory-based energy efficient routing algorithm for mobile wireless sensor networks[J]. 2008.5(3): 531-541
[29]谢识予.经济博弈论(第二版) [M].复旦大学出版社. 2002.
[30] H. T. Friis. A note on a simple transmission formula. Proc. IRE, 34, 1946.
[31] T. S. Rappaport. Wireless communications, principles and practice. Prentice Hall, 1996.
[32] Gang Zhou, Tian He, Sudha Krishnamurthy, John A. Stankovic. Models and Solutions for Radio Irregularity in Wireless Sensor Networks[G]. In: ACM Transactions on Sensor Networks, May 2006: 221–262.
[33] WANG Fu-Bao, SHI Long, REN Feng-Yuan. Self-Localization Systems and Algorithms for Wireless Sensor Networks [J]. Journal of Software. 2005,16(5).
[34] Girod L, Bychovskiy V, Elson J, Estrin D. Locating tiny sensors in time and space: A case study [C]. In: Proc. of the 2002 IEEE Int’l Conf. on Computer Design: VLSI in Computers and Processors. Freiburg: IEEE Computer Society, 2002. 214?219.
[35] Beutel J. Geolocation in a PicoRadio Environment[D]. Berkeley: UC Berkeley, 1999.
[36] Girod L, Estrin D. Robust range estimation using acoustic and multimodal sensing[C]. In: Proc. of the IEEE/RSJ Int’l Conf. on Intelligent Robots and Systems (IROS 01). Vol.3, Maui: IEEE Robotics and Automation Society, 2001. 1312?1320.
[37] Niculescu D, Nath B. Ad hoc positioning system (APS) using AoA[C]. In: Proc. of the IEEE INFOCOM 2003. Vol.3, San Francisco: IEEE Computer and Communications Societies, 2003.
[38] Bulusu N, Heidemann J, Estrin D. GPS-less Low-Cost Outdoor Localization for Very Small Devices[J]. IEEE Personal Communications, 2000, 7(5): 28-34.
[39] Niculescu D, Nath B. Ad Hoc Positioning System (APS)[C]. In: Proc of IEEE Global Telecommunications Conference (IEEE GLOBECOM’01). San Antonio, TX, USA: IEEE, 2001: 2926-2931.
[40] Niculescu D, Nath B. DV Based Positioning in Ad Hoc Networks[J]. Journal of Telecommunication Systems, 2003, 22 (1-4): 267-280.
[41] Priyantha N B, Miu A K L, Balakrishnan H, et al. The Cricket Compass for Context-Aware Mobile Applications[C]. In: Proc of the 7th annual international conference on Mobile computing and networking. New York, NY, USA: ACM, 2001: 1-14.
[42] Doherty L, Pister KSJ, Ghaoui LE. Convex position estimation in wireless sensor networks[C]. In: Proc. of the IEEE INFOCOM 2001.Vol.3, Anchorage: IEEE Computer and Communications Societies, 2001. 1655?1663.
[43] Shang Y, Ruml W, Zhang Y, Fromherz MPJ. Localization from mere connectivity[C]. In: Proc. of the 4th ACM Int’l Symp. on Mobile Ad Hoc Networking & Computing. Annapolis: ACM Press, 2003. 201?212.
[44] Akkaya K, Younis M. A survey on routing protocols in wireless sensor networks[J]. Ad Hoc Networks. 2005, 3(3):325～349.
[45] Bhardwaj M, Chandrakasan A, Garnett T. Upper bounds on the lifetime of sensor networks[C]. In: IEEE Int’l Conf. on Communications. Helsinki: IEEE Computer Society, 2001, 785～790.
[46] Bhardwaj M, Chandrakasan A.P. Bounding the Lifetime of Sensor Networks Via Optimal Role Assignments[C]. In: INFOCOM. New York, USA: IEEE, 2002. 1587～1596.
[47] Kalpakis K. Efficient Algorithms for Maximum Lifetime Data Gathering and Aggregation in Wireless Sensor Networks[J]. Computer Networks: The International Journal of Computer and Telecommunications Networking. August 2003, 42(6): 697～716.
[48] Duarte-Melo E. J, Liu M, Misra A. A Modeling Framework for Computing Lifetime and Information Capacity in Wireless Sensor Networks[C]. In: Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, Cambridge, UK, March 2004.
[49] Enrique J. Duarte-Melo, Mingyan Liu. Analysis of Energy Consumption and Lifetime of Heterogeneous Wireless Sensor Networks[C]. In: Proc. of the GLOBECOM 2002. New York: IEEE Press, 2002. 21～25.
[50] Rai V, Mahapatra R. N. Lifetime Modeling of a Sensor Network[C]. In: Design , Automation and Test in Europe, Munich , Germany ,March 2005. 202～203.
[51] Yuan Xue, Yi Cui and Klara Nahrstedt. Maximizing Lifetime for Data Aggregation in Wireless Sensor Networks[J]. Mobile Networks and Applications. 2006, 10(6): 853–864.
[52] K. Sha,W. Shi. Revisiting the lifetime of wireless sensor networks[C]. In Proceedings of the First ACM SenSys’04. New York: ACM Press, Nov.2004. 299～300.
[53] Wang ZM, Basagni S, Melachrinoudis E, Petrioli C. Exploiting sink mobility for maximizing sensor networks lifetime[C]. In: Sprague RH, ed. Proc. of the 38th Hawaii Int'l Conf. on System Sciences. Washington: IEEE Computer Society, 2005. 287～295.
[54] Haining Shu. Wireless Sensor Network Lifetime Analysis and Energy Efficient Techniques[Ph D dissertation][D]. The University of Texas, 2007.
[55] Soro S, Heinzelman WB. Prolonging the lifetime of wireless sensor networks via unequal clustering[C]. In: Proc. of the 19th IEEE Int'l on Parallel and Distributed Processing Symposium. San Francisco: IEEE Computer Society Press, 2005. 236～240.
[56] Biswanath Dey, Sukumar Nandi. Distributed Location and Lifetime Biased Clustering for Large Scale Wireless Sensor Network[C]. In : Distributed Computing and Networking, 8th International Conference, ICDCN 2006. 534-545.
[57] Moez Esseghir and Nizar Bouabdallah. Node density control for maximizing wireless sensor network lifetime[J]. International Journal of Network Management. 2008,18(2):159-170.
[58] M. Julius Hossain, Oksam Chae, Md. Mamun-Or-Rashid and Choong Seon Hong. Cost-effective Maximum Lifetime Routing Protocol for Wireless Sensor Networks[C]. In: Proceedings of IEEE AICT 2005, 314～319.
[59] Egorova-Forster, Murphy. Exploring Non Uniform Quality of Service for Extending WSN Lifetime[C]. In: Fifth IEEE International Conference on Pervasive Computing and Communications Workshops (PerComW'07) 2007. 285～289.
[60] Pan Yantao, Peng Wei, Lu Xicheng. Maximum Flow Based Model and Method of the Maximum Lifetime Problem of Sensor Networks[J]. Journal of National University of Defense Technology.2006, 28(3). 59～63.
[61] Lu Ke zhong, Huang Liu sheng, Wan Ying yu, Xu Hong li. Deploying Sensor Nodes in Wireless Sensor Networks[J]. Journal of Chinese Computer Systems. 2006, 27(11):2003～2006.
[62] Huang Liu sheng, Li Hong ,Xu Hong li ,Wu Jun min. A load balancing multi-path routing in wireless sensor networks[J]. Journal of University of Science and Technology of China. 2006, 36(8):887～892.
[63] LU Ke zhong, HUANG Liu sheng, WAN Ying yu, XU Hong li. Frequency-Divided Data Dissemination in Wireless Sensor Networks[J]. Journal of Chinese Computer Systems. 2006, 27(12):2236～2239.
[64]李成法,陈贵海等.一种基于非均匀分簇的无线传感器网络路由协议[J].计算机学报. 2007, 30(1):27～36
[65] Zhang Xue,Lu Sang-Lu,Chen Gui-Hai,Chen Dao-Xu,Xie Li. Topology Control for Wireless Sensor Networks[J]. Journal of Software.2007, 18(4):943～954.
[66] Chen Guihai, Li Chengfa, Ye Mao, et al. EECS: an energy- efficient clustering scheme in wireless sensor networks[J]. Journal of Frontiers of Computer Science and Technology. 2007, 1( 2) : 170～179.
[67] Liu M, Cao JN, Chen GH, Chen LJ, Wang XM, Gong HG. EADEEG: An energy-aware data gathering protocol for wireless sensor networks[J]. Journal of Software. 2007, 18(5):1092～1109.
[68] Liu Lin-feng,Liu Ye,Zhuang Yan-yan. Analysis of Model and Design of Routing Algorithm in Energy Efficient Wireless Sensor Networks[J]. Acta Electronica Sinica. 2007, 35(3):459～462.
[69] Yang Wen-Guo, Guo Tian-De, Zhao Tong. An Optimal Lifetime Model and It′s Solution of a Heterogeneous Surveillance Sensor Network[J]. Chinese Journal of Computers. 2007, 30(4): 532～538.
[70] Jiang Jie,Fang Li,Zhang He-Ying,Dou Wen-Hua. An Algorithm for Minimal Connected Cover Set Problem in Wireless Sensor Networks[J]. Journal of Software. 2006, 17(2):175～184.
[71] Jiang Jie. Research on the Coverage Control in Wireless Sensor Networks [Ph D dissertation][D].Changsha: Nationnal University of Defense and Technology, 2006(in Chinese)蒋杰.无线传感器网络覆盖控制研究[博士学位论文][D].长沙:国防科学技术大学,2006]
[72] Zhang Qing, Xie Zhi-Peng, Ling Bo, Sun Wei-Wei, SHI Bai-Le. A Maximum Lifetime Data Gathering Algorithm for Wireless Sensor Networks[J]. Journal of Software. 2005, 16(11): 1946～1957.
[73]张卿.无线自组网中节能相关若干关键问题研究[博士学位论文][D].上海:复旦大学,2005
[74] Tian Le, XieE Dong-Liang, Han Bing, Zhang Lei, Cheng Shi-Duan. Study on Bottleneck Nodes in Wireless Sensor Networks[J]. Journal of Software.2006, 17(4): 830～837.
[75] Li Gui-Lin, Gao Hong. A Load Balance Data Storage Method Based on Ring for Sensor Networks[J]. Journal of Software. 2007, 18(5): 1173～1185.
[76] Shi Gao-Tao , Liao Ming-Hong. Movement-Assisted Data Gathering Scheme with Load-Balancing for Sensor Networks[J]. Journal of Software. 2007, 18(9): 2235～2244.
[2] Akyildiz I F, Su W, Sankarasubramaniam Y, et al. Wireless sensor networks: a survey[J]. Computer Networks, 2002, 38(4): 393-422.
[3] Rabaey, Jan M., Pedram, Massoud (Eds.). Low Power Design Methodologies[M]. Springer, 1995.
[4] Pedram, Massoud, Rabaey, Jan M. Power Aware Design Methodologies[M]. Springer, 2002.
[5] Chunlong Guo, Lizhi Charlie Zhong, Jan. M. Rabaey. Low Power Distributed MAC for Ad Hoc Sensor Radio Networks[C]. Global Telecommunications Conference (GLOBECOM '01), 2001,12.
[6] Shah R, Rabaey J. Energy aware routing for low energy ad hoc sensor networks[C]. In: Proc. of the IEEE Wireless Communications and Networking Conf. Orlando: IEEE Communications Society, 2002:350-355.
[7] Pan Yantao. Research on Lifetime Optimization in Wireless Sensor Networks[Ph D dissertation][D]. Changsha: Nationnal University of Defense and Technology, 2006(in Chinese)潘晏涛.无线传感器网络生存时间优化问题研究[博士学位论文][D].长沙:国防科学技术大学, 2006.
[8] Bhaskar Krishnamachari, Deborah Estrin, Stephen Wicker. Modeling data-centric routing in wireless sensor networks[C]. In: Stojmenovic I, Olariu S, eds. Proc. of the IEEE Infocom. New York: IEEE Computer Society, 2002:2-14.
[9] J. M. Kahn, R. H. Katz, K. S. J. Pister. Emerging Challenges: Mobile Networking for Smart Dust[J]. Journal of Communications and Networks, 2000, 2(3):188–196.
[10] V. Raghunathan, C. Schurgers, S. Park, M. B. Srivastava. Energy-Aware Wireless Microsensor Networks[J]. IEEE Signal Processing Magazine, 2002.19:40–50.
[11] G. J. Pottie and W. J. Kaiser. Embedding the Internet: Wireless Integrated Network Sensors[J]. Communications of the ACM, 2000.43(5):51–58.
[12] Naoto Kimura, Shahram Latifi. A Survey on Data Compression in Wireless Sensor Networks[C]. In: Proceedings of the International Conference on Information Technology: Coding and Computing. Washington: IEEE Computer Society, 2005:8-13.
[13] Kenneth Barr, Krste Asanovi′c. Energy Aware Lossless Data Compression[G]. In: ACM Transactions on Computer Systems. New York: ACM Press. 2006.24(3):250-291.
[14] Xie Zhijun, Wang Lei, Lin Yaping, Chen Hong, Liu Yonghe. An Algorithm of Data Aggregation Based on Data Compression for Sensor Networks[J]. Journal of Software. 2006.17(4):860?867. (谢志军,王雷,林亚平,陈红,刘永和.传感器网络中基于数据压缩的汇聚算法[J]. Journal of Software. 2006.17(4):860?867.)
[15] Olga Saukh, Pedro Jos′e Marr′on, Andreas Lachenmann, Matthias Gauger, Daniel Minder, Kurt Rothermel. Generic Routing Metric and Policies for WSNs[C]. In: Proceedings of the Third European Workshop on Wireless Sensor Networks. 2006:99-114.
[16] Noseong Park, Daeyoung Kim, Yoonmee Doh, Sangsoo Lee, Ji-tae Kim. An Optimal and Lightweight Routing for Minimum Energy Consumption in Wireless Sensor Networks[C]. In: Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications. New York: IEEE Computer Society, 2005:1533-2306.
[17] Chalermek Intanagonwiwat, Deborah Estrin, Ramesh Govindan, John Heidemann. Impact of Network Density on Data Aggregation in Wireless Sensor Networks[C]. In: Proceedings of the 22nd International Conference on Distributed Computing Systems. Washington: IEEE Computer Society. 2002:457-458.
[18] Chalermek Intanagonwiwat, Ramesh Govindan, Deborah Estrin. Directed Diffusion: A Scalable and Robust Communication Paradigm for Sensor Networks.[C] In: Proc. of the ACM MobiCom. Boston: ACM Press, 2000:56-67.
[19] H¨useyin O¨zgu¨r Tan and˙Ibrahim Ko¨rpeogˇlu. Power Efficient Data Gathering and Aggregation in Wireless Sensor Networks[J]. ACM SIGMOD Record. New York: ACM Press, 2003,32(4):66-71.
[20] I. Kadayif, M. Kandemir. Tuning In-Sensor Data Filtering to Reduce Energy Consumption in Wireless Sensor Networks[C]. In: Proceedings of the Design, Automation and Test in Europe Conference and Exhibition. 2004(04):1530-1591
[21] DEBRA A. LELEWER, DANIEL S.HIRSCHBERG .Data Compression[J]. ACM Computing Surveys, 1987.19 (3).
[22] T Rappaport . Wireless Communications : Principles and Practice[M]. New Jersey : Prentice-Hall Inc, 1996.
[23] Cui L, Ju HL, Miao Y, Li TP, Liu W, Zhao Z. Overview of wireless sensor networks[J]. Journal of Computer Research and Development, 2005,42(1):163?174 (in Chinese with English abstract).
[24] Dragan Petrovi?, Rahul C. Shah, Kannan Ramchandran, Jan Rabaey. Data Funneling:Routing with Aggregation and Compression for Wireless Sensor Networks[C]. IEEE ICC Int. Workshop on Sensor Network Protocols and Applications, 2003.
[25] M. Julius Hossain, Oksam Chae, Md. Mamun-Or-Rashid, Choong Seon Hong. Cost-Effective Maximum Lifetime Routing Protocol for Wireless Sensor Networks[C]. In: Proceedings of the Advanced Industrial Conference on Telecommunications/Service Assurance with Partial and Intermittent Resources Conference/E-Learning on Telecommunications Workshop. Washington: IEEE Computer Society, 2005:314-319.
[26] Konstantinos Kalpakis, Koustuv Dasgupta1, Parag Namjoshi. Maximum Lifetime Data Gathering and Aggregation in Wireless Sensor Networks[J]. Computer Networks 2003, 42(6): 697-716.
[27] Merrett, G. V., Harris, N. R., Al-Hashimi, B. M. and White, N. M. Energy Managed Reporting for Wireless Sensor Networks[J]. 2008. 142 (1): 379-389
[28] Tai-Jung Chang. Kuochen Wang. Yi-Ling Hsieh. A color-theory-based energy efficient routing algorithm for mobile wireless sensor networks[J]. 2008.5(3): 531-541
[29]谢识予.经济博弈论(第二版) [M].复旦大学出版社. 2002.
[30] H. T. Friis. A note on a simple transmission formula. Proc. IRE, 34, 1946.
[31] T. S. Rappaport. Wireless communications, principles and practice. Prentice Hall, 1996.
[32] Gang Zhou, Tian He, Sudha Krishnamurthy, John A. Stankovic. Models and Solutions for Radio Irregularity in Wireless Sensor Networks[G]. In: ACM Transactions on Sensor Networks, May 2006: 221–262.
[33] WANG Fu-Bao, SHI Long, REN Feng-Yuan. Self-Localization Systems and Algorithms for Wireless Sensor Networks [J]. Journal of Software. 2005,16(5).
[34] Girod L, Bychovskiy V, Elson J, Estrin D. Locating tiny sensors in time and space: A case study [C]. In: Proc. of the 2002 IEEE Int’l Conf. on Computer Design: VLSI in Computers and Processors. Freiburg: IEEE Computer Society, 2002. 214?219.
[35] Beutel J. Geolocation in a PicoRadio Environment[D]. Berkeley: UC Berkeley, 1999.
[36] Girod L, Estrin D. Robust range estimation using acoustic and multimodal sensing[C]. In: Proc. of the IEEE/RSJ Int’l Conf. on Intelligent Robots and Systems (IROS 01). Vol.3, Maui: IEEE Robotics and Automation Society, 2001. 1312?1320.
[37] Niculescu D, Nath B. Ad hoc positioning system (APS) using AoA[C]. In: Proc. of the IEEE INFOCOM 2003. Vol.3, San Francisco: IEEE Computer and Communications Societies, 2003.
[38] Bulusu N, Heidemann J, Estrin D. GPS-less Low-Cost Outdoor Localization for Very Small Devices[J]. IEEE Personal Communications, 2000, 7(5): 28-34.
[39] Niculescu D, Nath B. Ad Hoc Positioning System (APS)[C]. In: Proc of IEEE Global Telecommunications Conference (IEEE GLOBECOM’01). San Antonio, TX, USA: IEEE, 2001: 2926-2931.
[40] Niculescu D, Nath B. DV Based Positioning in Ad Hoc Networks[J]. Journal of Telecommunication Systems, 2003, 22 (1-4): 267-280.
[41] Priyantha N B, Miu A K L, Balakrishnan H, et al. The Cricket Compass for Context-Aware Mobile Applications[C]. In: Proc of the 7th annual international conference on Mobile computing and networking. New York, NY, USA: ACM, 2001: 1-14.
[42] Doherty L, Pister KSJ, Ghaoui LE. Convex position estimation in wireless sensor networks[C]. In: Proc. of the IEEE INFOCOM 2001.Vol.3, Anchorage: IEEE Computer and Communications Societies, 2001. 1655?1663.
[43] Shang Y, Ruml W, Zhang Y, Fromherz MPJ. Localization from mere connectivity[C]. In: Proc. of the 4th ACM Int’l Symp. on Mobile Ad Hoc Networking & Computing. Annapolis: ACM Press, 2003. 201?212.
[44] Akkaya K, Younis M. A survey on routing protocols in wireless sensor networks[J]. Ad Hoc Networks. 2005, 3(3):325～349.
[45] Bhardwaj M, Chandrakasan A, Garnett T. Upper bounds on the lifetime of sensor networks[C]. In: IEEE Int’l Conf. on Communications. Helsinki: IEEE Computer Society, 2001, 785～790.
[46] Bhardwaj M, Chandrakasan A.P. Bounding the Lifetime of Sensor Networks Via Optimal Role Assignments[C]. In: INFOCOM. New York, USA: IEEE, 2002. 1587～1596.
[47] Kalpakis K. Efficient Algorithms for Maximum Lifetime Data Gathering and Aggregation in Wireless Sensor Networks[J]. Computer Networks: The International Journal of Computer and Telecommunications Networking. August 2003, 42(6): 697～716.
[48] Duarte-Melo E. J, Liu M, Misra A. A Modeling Framework for Computing Lifetime and Information Capacity in Wireless Sensor Networks[C]. In: Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, Cambridge, UK, March 2004.
[49] Enrique J. Duarte-Melo, Mingyan Liu. Analysis of Energy Consumption and Lifetime of Heterogeneous Wireless Sensor Networks[C]. In: Proc. of the GLOBECOM 2002. New York: IEEE Press, 2002. 21～25.
[50] Rai V, Mahapatra R. N. Lifetime Modeling of a Sensor Network[C]. In: Design , Automation and Test in Europe, Munich , Germany ,March 2005. 202～203.
[51] Yuan Xue, Yi Cui and Klara Nahrstedt. Maximizing Lifetime for Data Aggregation in Wireless Sensor Networks[J]. Mobile Networks and Applications. 2006, 10(6): 853–864.
[52] K. Sha,W. Shi. Revisiting the lifetime of wireless sensor networks[C]. In Proceedings of the First ACM SenSys’04. New York: ACM Press, Nov.2004. 299～300.
[53] Wang ZM, Basagni S, Melachrinoudis E, Petrioli C. Exploiting sink mobility for maximizing sensor networks lifetime[C]. In: Sprague RH, ed. Proc. of the 38th Hawaii Int'l Conf. on System Sciences. Washington: IEEE Computer Society, 2005. 287～295.
[54] Haining Shu. Wireless Sensor Network Lifetime Analysis and Energy Efficient Techniques[Ph D dissertation][D]. The University of Texas, 2007.
[55] Soro S, Heinzelman WB. Prolonging the lifetime of wireless sensor networks via unequal clustering[C]. In: Proc. of the 19th IEEE Int'l on Parallel and Distributed Processing Symposium. San Francisco: IEEE Computer Society Press, 2005. 236～240.
[56] Biswanath Dey, Sukumar Nandi. Distributed Location and Lifetime Biased Clustering for Large Scale Wireless Sensor Network[C]. In : Distributed Computing and Networking, 8th International Conference, ICDCN 2006. 534-545.
[57] Moez Esseghir and Nizar Bouabdallah. Node density control for maximizing wireless sensor network lifetime[J]. International Journal of Network Management. 2008,18(2):159-170.
[58] M. Julius Hossain, Oksam Chae, Md. Mamun-Or-Rashid and Choong Seon Hong. Cost-effective Maximum Lifetime Routing Protocol for Wireless Sensor Networks[C]. In: Proceedings of IEEE AICT 2005, 314～319.
[59] Egorova-Forster, Murphy. Exploring Non Uniform Quality of Service for Extending WSN Lifetime[C]. In: Fifth IEEE International Conference on Pervasive Computing and Communications Workshops (PerComW'07) 2007. 285～289.
[60] Pan Yantao, Peng Wei, Lu Xicheng. Maximum Flow Based Model and Method of the Maximum Lifetime Problem of Sensor Networks[J]. Journal of National University of Defense Technology.2006, 28(3). 59～63.
[61] Lu Ke zhong, Huang Liu sheng, Wan Ying yu, Xu Hong li. Deploying Sensor Nodes in Wireless Sensor Networks[J]. Journal of Chinese Computer Systems. 2006, 27(11):2003～2006.
[62] Huang Liu sheng, Li Hong ,Xu Hong li ,Wu Jun min. A load balancing multi-path routing in wireless sensor networks[J]. Journal of University of Science and Technology of China. 2006, 36(8):887～892.
[63] LU Ke zhong, HUANG Liu sheng, WAN Ying yu, XU Hong li. Frequency-Divided Data Dissemination in Wireless Sensor Networks[J]. Journal of Chinese Computer Systems. 2006, 27(12):2236～2239.
[64]李成法,陈贵海等.一种基于非均匀分簇的无线传感器网络路由协议[J].计算机学报. 2007, 30(1):27～36
[65] Zhang Xue,Lu Sang-Lu,Chen Gui-Hai,Chen Dao-Xu,Xie Li. Topology Control for Wireless Sensor Networks[J]. Journal of Software.2007, 18(4):943～954.
[66] Chen Guihai, Li Chengfa, Ye Mao, et al. EECS: an energy- efficient clustering scheme in wireless sensor networks[J]. Journal of Frontiers of Computer Science and Technology. 2007, 1( 2) : 170～179.
[67] Liu M, Cao JN, Chen GH, Chen LJ, Wang XM, Gong HG. EADEEG: An energy-aware data gathering protocol for wireless sensor networks[J]. Journal of Software. 2007, 18(5):1092～1109.
[68] Liu Lin-feng,Liu Ye,Zhuang Yan-yan. Analysis of Model and Design of Routing Algorithm in Energy Efficient Wireless Sensor Networks[J]. Acta Electronica Sinica. 2007, 35(3):459～462.
[69] Yang Wen-Guo, Guo Tian-De, Zhao Tong. An Optimal Lifetime Model and It′s Solution of a Heterogeneous Surveillance Sensor Network[J]. Chinese Journal of Computers. 2007, 30(4): 532～538.
[70] Jiang Jie,Fang Li,Zhang He-Ying,Dou Wen-Hua. An Algorithm for Minimal Connected Cover Set Problem in Wireless Sensor Networks[J]. Journal of Software. 2006, 17(2):175～184.
[71] Jiang Jie. Research on the Coverage Control in Wireless Sensor Networks [Ph D dissertation][D].Changsha: Nationnal University of Defense and Technology, 2006(in Chinese)蒋杰.无线传感器网络覆盖控制研究[博士学位论文][D].长沙:国防科学技术大学,2006]
[72] Zhang Qing, Xie Zhi-Peng, Ling Bo, Sun Wei-Wei, SHI Bai-Le. A Maximum Lifetime Data Gathering Algorithm for Wireless Sensor Networks[J]. Journal of Software. 2005, 16(11): 1946～1957.
[73]张卿.无线自组网中节能相关若干关键问题研究[博士学位论文][D].上海:复旦大学,2005
[74] Tian Le, XieE Dong-Liang, Han Bing, Zhang Lei, Cheng Shi-Duan. Study on Bottleneck Nodes in Wireless Sensor Networks[J]. Journal of Software.2006, 17(4): 830～837.
[75] Li Gui-Lin, Gao Hong. A Load Balance Data Storage Method Based on Ring for Sensor Networks[J]. Journal of Software. 2007, 18(5): 1173～1185.
[76] Shi Gao-Tao , Liao Ming-Hong. Movement-Assisted Data Gathering Scheme with Load-Balancing for Sensor Networks[J]. Journal of Software. 2007, 18(9): 2235～2244.