传感器网络覆盖调度机制研究
|
摘要
近年来,无线传感网络已成为一个热门研究课题。他们有巨大的长期经济潜力,有能力改变我们的生活,并带来许多新体制建设的挑战。传感器网络还引起大量的新概念和优化方面的问题。诸如定位、部署和跟踪,这些问题,很大程度上都是依靠他们来获得所需要的信息。传感器网络发展至今,仍有许多可以应用的环境待开发,也仍有许多技术问题需要克服,值得各界学者及研究团队继续深入地研究。
覆盖调度机制作为无线传感器网络中的一个基本问题,反映了网络所能提供的“感知”服务质量,可以使无线传感器网络的空间资源得到优化分配,进而更好地完成环境感知、信息获取和有效传输的任务。要保障整体信息的完整性,节点首先要判定该感兴趣的区域是否被一组给定的传感器节点覆盖,因此,对传感器网络中的覆盖调度机制问题进行深入研究具有重要意义。
本文讨论了传感器网络的覆盖问题。覆盖是衡量传感器网络工作性能的重要指标之一,通过对覆盖问题的研究可以寻求提高传感器网络服务质量的方法。本文研究了传感器网络的覆盖调度机制,已有的固定概率调度模型调度概率不能随网络的运行得到更新,这样会导致性能下降,不具有扩展性和适应性,邻居信息指导的概率模型在网络密度很大的情况下节点睡眠概率太大,网络覆盖率会急剧下降。本文在分析已有固定概率模型和邻居信息指导的概率模型的基础上,提出了一种基于能量和邻居信息指导的概率调度模型。传感器节点根据自身的能量以及邻居节点的数量来决定自己在每一轮中的睡眠概率,使自身能量小,活跃邻居节点多的节点具有较高的睡眠概率,达到延缓传感器节点死亡时间的目的。
另外,本文分析了一种分布式的与位置无关的传感器网络覆盖协议,并对其做出了改进。仿真实验的结果表明,改进的协议具有较好的性能。最后,本文简要介绍了传感器网络仿真算法的设计与实现。
Wireless sensor networks have recently emerged as a premier research topic. They have great long-term economic potential, ability to transform our lives, and pose many new system-building challenges. Sensor networks also pose a number of new conceptual and optimization problems. Some, such as location, deployment, and tracking, are fundamental issues, in that many applications rely on them for needed information. Today, there are still many application cases can be designed, and many questions needed to be covered. It calls for the researchers to research deeply.
Cover scheduling protocol is one of the key guideline for evaluating the sensor networks work performance. It provide a detailed statement about the network Quality and service. It can improve the allocation of the network source, and then perceive the environment, obtain information efficiently, and effective transfer. To ensuring the information completely, the node should decide the area is coved or not firstly. So, researching Cover scheduling protocol is very important.
Cover scheduling protocol is research deeply in this paper. Regular probability model can not renew its probability as the network moving, like this will lead to performance drop, and has not expansibility. Neighbor nodes advising- probability model also has limitation, with increasing of the net work density, coverage of the network will decrease sharply. This paper analysis regular probability model and neighbor nodes advising- probability model, and then put forward a new protocol based on node energy and its neighbor information. Nodes adjust its sleeping probability according to its own energy and neighbor information. Let those nodes have high energy and more living neighbor nodes to sleep easily, to prolong the lifetime of the network.
Furthermore, this paper analysis a distributed and location indifferent sensor net work cover protocol, and then improved it. The next lab indicate that the protocol has good ability. At last this paper introduces the lab platform and its designing process, this platform provide a lab environment.
覆盖调度机制作为无线传感器网络中的一个基本问题,反映了网络所能提供的“感知”服务质量,可以使无线传感器网络的空间资源得到优化分配,进而更好地完成环境感知、信息获取和有效传输的任务。要保障整体信息的完整性,节点首先要判定该感兴趣的区域是否被一组给定的传感器节点覆盖,因此,对传感器网络中的覆盖调度机制问题进行深入研究具有重要意义。
本文讨论了传感器网络的覆盖问题。覆盖是衡量传感器网络工作性能的重要指标之一,通过对覆盖问题的研究可以寻求提高传感器网络服务质量的方法。本文研究了传感器网络的覆盖调度机制,已有的固定概率调度模型调度概率不能随网络的运行得到更新,这样会导致性能下降,不具有扩展性和适应性,邻居信息指导的概率模型在网络密度很大的情况下节点睡眠概率太大,网络覆盖率会急剧下降。本文在分析已有固定概率模型和邻居信息指导的概率模型的基础上,提出了一种基于能量和邻居信息指导的概率调度模型。传感器节点根据自身的能量以及邻居节点的数量来决定自己在每一轮中的睡眠概率,使自身能量小,活跃邻居节点多的节点具有较高的睡眠概率,达到延缓传感器节点死亡时间的目的。
另外,本文分析了一种分布式的与位置无关的传感器网络覆盖协议,并对其做出了改进。仿真实验的结果表明,改进的协议具有较好的性能。最后,本文简要介绍了传感器网络仿真算法的设计与实现。
Wireless sensor networks have recently emerged as a premier research topic. They have great long-term economic potential, ability to transform our lives, and pose many new system-building challenges. Sensor networks also pose a number of new conceptual and optimization problems. Some, such as location, deployment, and tracking, are fundamental issues, in that many applications rely on them for needed information. Today, there are still many application cases can be designed, and many questions needed to be covered. It calls for the researchers to research deeply.
Cover scheduling protocol is one of the key guideline for evaluating the sensor networks work performance. It provide a detailed statement about the network Quality and service. It can improve the allocation of the network source, and then perceive the environment, obtain information efficiently, and effective transfer. To ensuring the information completely, the node should decide the area is coved or not firstly. So, researching Cover scheduling protocol is very important.
Cover scheduling protocol is research deeply in this paper. Regular probability model can not renew its probability as the network moving, like this will lead to performance drop, and has not expansibility. Neighbor nodes advising- probability model also has limitation, with increasing of the net work density, coverage of the network will decrease sharply. This paper analysis regular probability model and neighbor nodes advising- probability model, and then put forward a new protocol based on node energy and its neighbor information. Nodes adjust its sleeping probability according to its own energy and neighbor information. Let those nodes have high energy and more living neighbor nodes to sleep easily, to prolong the lifetime of the network.
Furthermore, this paper analysis a distributed and location indifferent sensor net work cover protocol, and then improved it. The next lab indicate that the protocol has good ability. At last this paper introduces the lab platform and its designing process, this platform provide a lab environment.
引文
[1] 任丰原,黄海宁,林闯.无线传感器网络.软件学报,2003,14(7):1282-1291
[2] 李建中,李金宝,石胜飞.传感器网络及其数据管理的概念,问题与进展.软件学报,2003,14(10): 1717-1727
[3] L.wiebert,S.K.S.Gupta,and J.Weinmann.Research Challenges in Wireless Networks of Biomedical Sensors. MOBICOM ’01,Jul 2001,151-165
[4] Ratnasamy S, Karp B. GHT: A geographic hash table for data-centric storage. In: Reghavendrv CS, ed. Proceedings of the 1st ACM International Workshop on Wireless Sensor Networks and Applications. New York: ACM Press, 2002. 94-103
[5] J.Elson,L.Girod and D.Estrin.Fine-Grained Network Time Synchronization using Reference Broadcasts.OSDI 2002
[6] G.Wang,Chi Fu Huang, Yu Chee Tseng, The Coverage Problem in a Wireless Sensor Network, Proceedings of the 2nd ACM International Conference on Wireless Sensor Networks and Applications (WSNA), 2003: 115-121
[7] Chi Fu Huang, Yu Chee Tseng, Li Chu Lo, The Coverage Problem in Three Dimensional Wireless Sensor Networks, In: Shah R, ed. Proc. of the GLOBECOM. Dallas: IEEE Press, 2004,3182-3186
[8] Anthony Man-Cho So, Yinyu Ye. On Sloving Coverage Problems in a Wireless Sensor Network Using Voronoi Diagrams. Proceedings of the 1st Workshop on Internet and Network Economics. 2005,584-593
[9] Q.Fang,HW. Gellersen, A.Schmidt, etal. Multi-Sensor Context Awareness in Mobile Devices and SmartArtifacts. Journal on Mobile Networks and Applications,Special Issue on Mobility of Systems,Users,Data and computing in Mobile Networks and Applications(M ONET).2002,(10)
[10] M . Bechler , A. Beafour, M.Leopold, etal. Smart Tag Based Data issemination in adhoc. WSNA 2002,68-77
[11] W.Lou,A.Mainwaring, J.Polastre, etal. Wireless sensor networks for habitat monitoring. WSNA 2002,88-97
[12] W.Zhang,Estrin D, Govindan R, etal. In: J. Heidemann, ed. Next century challenges: Scalable coordination in sensor networks. In: Proc. of the 5th Annual ACM/IEEE Int’l Conf. on Mobile Computing and Networking. Seattle,Washington, USA, ACM Press, 1999,263-270
[13] A.Savvides, H.Park, MB, etal. The Bitsand Flops of the N-hop Multilateration Primitive For Node Localization Problems. W SNA 2002, 112-l21
[14] J.Elson, K.Romer. A New Regime for Time Synchronization. Wireless Sensor Networks. 2002,(10)
[15] K.Whitehouse, D.Culler. Calibration as Parameter Estimation in Sensor Networks.WSNA 2002,59-67
[16] V.Bychkovskiy, S.Megerian, D.Estrin, etal. A Collaborative Approach to InPlace Sensor Calibration.IPSN ’03,Apr 2003
[17] S.Meguerdichian, F.Koushanfar, G.Qu, etal. Exposure in wireless Ad-Hoc sensor networks.MOBIC0M ’01,Jul 2001:139-150
[18] J.Staddon, D.Balfanz, G.Durfee. Efficient Tracing of Failed Nodes in Sensor Networks. WSNA 2002,122-130
[19] 任彦, 张思东, 张宏科. 无线传感器网络中覆盖控制理论与算法.软件学报, 2006:158-166
[20] 孙雨耕, 张静,孙永进.无线自组传感器网络,传感技术学报, 2004:253-261
[21] 崔 莉 , 鞠 海 玲 , 苗 勇 等 . 无 线 传 感 器 网 络 研 究 进 展 , 计 算 机 研 究 与 发展,2005:225-233
[22] Akyildiz IF, Su W, Sankarasubramaniam Y, etal. Wireless sensor networks: A survey. Computer Networks, 2002,38(4):393-422
[23] Pottie GJ, Kaiser WJ. Wireless integrated network sensors. Communications of the ACM, 2000,43(5):51-58
[24] Sohrabi K, Gao J, Ailawadhi V, etal. Protocols for self-organization of a wireless sensor network. IEEE Personal Communications, 2000,7(5):16-27
[25] Cardei M, Wu J. Coverage in wireless sensor networks. In: Ilyas M, Magboub I, eds. Handbook of Sensor Networks, chapter 19. CRC Press, 2004
[26] Li JZ, Li JB, Shi SF. Concepts, issues and advance of sensor networks and data management of sensor networks. Journal of Software, 2003,14(10):1717-1727 (in Chinese with English abstract)
[27] Slijepcevic S, Potkonjak M. Power efficient organization of wireless sensor networks. In: Glisic S, ed. Proc. of the IEEE Int’l Conf. on Communications (ICC). Helsinki: IEEE Press, 2001:472-476
[28] Cardei M, Du DZ. Improving wireless sensor network lifetime through power aware organization. Wireless Networks, 2005,11(3):333-340
[29] Lin FYS, Chiu PL. A near-optimal sensor placement algorithm to achievecomplete coverage/discrimination in sensor networks. IEEE Communications Letters, 2005,9(1):43-45
[30] Megerian S, Koushanfar F, Potkonjak M, etal. Worst and best-case coverage in sensor networks. IEEE Trans. on Mobile Computing, 2005,4(1):84-92
[31] Meguerdichian S, Koushanfar F, Qu G, etal. Exposure in wireless ad-hoc sensor networks. In: Rose C, ed. Proc. of the ACM Int’l Conf. on Mobile Computing and Networking (MobiCom). New York: ACM Press, 2001. 139-150
[32] Cortes J, Martinez S, Karatas T, etal. Coverage control for mobile sensing networks. IEEE Trans. on Robotics and Automation, 2004,20(2):243-255
[33] Kar K, Banerjee S. Node placement for connected coverage in sensor networks. In: Crowcroft J, ed. Proc. of the Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks. Sophia-Antipolis: IEEE Press, 2003. 50-52
[34] Yan T, He T, Stankovic JA. Differentiated surveillance for sensor networks. In: Akyildiz IF, Estion D, eds. Proc. of the ACM Int’l Conf. on Embedded Networked Sensor Systems (SenSys). New York: ACM Press,2003. 51-62
[35] Tian D, Georganas ND. A node scheduling scheme for energy conservation in large wireless sensor networks. Wireless Communications and Mobile Computing, 2003,3(2):271-290
[36] upta H, Das SR, Gu Q. Connected sensor cover: Self-Organization of sensor networks for efficient query execution. In: Gerla M, ed. Proc. of the ACM Int’l Symp. on Mobile Ad Hoc Networking and Computing (MobiHOC). New York: ACM Press,2003. 189-200
[37] Huang CF, Tseng YC. A survey of solutions to the coverage problems in wireless sensor networks. Journal of Internet Technology, 2005,6(1):1-8
[38] Shakkottai S, Srikant R, Shroff N. Unreliable sensor grids: Coverage, connectivity and diameter. In: Bauer F, ed. Proc. of the IEEE Infocom. San Francisco: IEEE Press, 2003. 1073-1083
[39] Chakrabarty K, Lyengar SS, Qi H, etal. Grid coverage for surveillance and target location in distributed sensor networks. IEEE Trans. on Computers, 2002,51(12):1448-1453
[40] Meguerdichian S, Koushanfar F, Potkonjak M, etal. Coverage problems in wireless ad-hoc sensor network. In: Sengupta B, ed. Proc. of the IEEE INFOCOM. Anchorage: IEEE Press, 2001. 1380-1387
[41] Ye F, Zhong G, Cheng J, Lu SW, etal. PEAS: A robust energy conservingprotocol for long-lived sensor networks. In: Stankovic J, Zhao W, eds. Proc. of the Int’l Conf. on Distributed Computing Systems (ICDCS). Providence: IEEE Press, 2003. 28-37
[42] Meguerdichian S, Slijepcevic S, Karayan V, etal.Localized algorithms in wireless ad-hoc networks: Location discovery and sensor exposure. In: Vaidya NH, ed. Proc. of the ACM Int’l Symp. on Mobile Ad Hoc Networking and Computing (MobiHOC). New York: ACM Press, 2001. 106-116
[43] Li XY, Wan PJ, Frieder O. Coverage in wireless ad hoc sensor networks. IEEE Trans. on Computers, 2003,52(6):753-763
[44] Huang CF, Tseng YC. The coverage problem in a wireless sensor network. In: Sivalingam KM, Raghavendra CS, eds. Proc. of the ACM Int’l Workshop on Wireless Sensor Networks and Applications (WSNA). New York: ACM Press, 2003. 115-121
[45] Wang X, Xing G, Zhang Y, etal. Integrated coverage and connectivity configuration in wireless sensor networks. In: Akyildiz IF, Estion D, eds. Proc. of the ACM Int’l Conf. on Embedded Networked Sensor Systems (SenSys). New York: ACM Press, 2003. 28-39.
[46] Huang CF, Tseng YC, Lo LC. The coverage problem in three-dimensional wireless sensor networks. In: Shah R, ed. Proc. of the GLOBECOM. Dallas: IEEE Press, 2004. 3182-3186
[47] Ravelomanana V. Extremal properties of three-dimensional sensor networks with applications. IEEE Trans. on Mobile Computing, 2004,3(3):246-257
[48] Sun LM, Li JZ, Chen Y, etal. Wireless Sensor Networks. Beijing: Tsinghua University Press, 2005 (in Chinese)
[49] Veltri G, Huang Q, Potkonjak M. Minimal and maximal exposure path algorithms for wireless embedded sensor networks. In: Akyildiz IF, Estion D, eds. Proc. of the ACM Int’l Conf. on Embedded Networked Sensor Systems (SenSys). New York: ACM Press, 2003: 40-50
[50] D.Tian , N.D.Georganas . A coverage-preserving node scheduling scheme for large wireless sensor networks .In :Proc. First ACM Int’l Workshop on Wireless Sensor Networks and Applications. New York: ACM press , 2002. 32-41
[51] H.Zhang,J.C.Hou.On deriving the upper bound of alphalifetime for large sensor networks. In:Proc. 5th ACM Int’l Symposium on Mobile Ad Hoe Networking and Co mputing.New York:ACM Press.2004.121-132
[52] O.Dousse,P Mannersalo,P Thiran.Latency of wireless sensor networks with uncoordinated power saving mechanisms.In:Proc.5th ACM Int’l Symposium on Mobile Ad Hoc Networking and Computing . New York : ACM Pre&~.2004.109-120
[53] S.Slijepsevic , M.Potkonjak . Power efficient organization of wireless sensor networks. IEEE Conf .Communications. Helsinki,Finland,2001
[54] M.Cardei ,D.Marcallum, X.Cheng ,et al. Wireless sensor networks with energy efficient organization. Journal of interconnection Networks, 2002,3 (3-4): 213-229
[55] 石高涛, 廖明宏. 大规模传感器网络随机睡眠调度节能机制, 计算机研究与发展, 2005:579-585
[56] I.stojmenovic.Position based routing in ad hoc networks.IEEE Communica- tions Magazine, 2002 40(7):128-134
[57] SAVVIDES A, HAN C, SRIVASTAVA M. Dynamic fine-grained localization in ad-hoc networks of sensors [A]. 7th ACM Int Conf on Mobile Computing and Networking (Mobicom)[C]. Rome, Italy, 2001.166-179
[58] R. Williams .The Geometrical Foundation of Natural Structure :A Source Book of Design .New York :Dover Publication Inc.,1999.51-52
[59] Sohrabi K, Gao J,Ailawadhi V, etal. Protocols for self-organization of a wireless sensor network. IEEE Personal Communications, 2000,7(5):16-27
[60] Cardei M., Wu J.. Coverage in wireless sensor networks. In: Ilyas M, Magboub I, eds. Handbook of Sensor Networks, chapter 19. CRC Press, 2004.89-95
[61] H.Zhang,J.C.Hou . Maintaining scheme coverage and connectivity in large sensor networks .NSF Int’l Workshop on Theoretical and Algorithmic Aspects of sensor, Peer-to-peer Networks,Chicago,USA,2004.266-275
[61] F.Ye,G.Zhang,S.Lu,al.PEAS:A robust energy conserving protocol for long-lived sensor networks. The 23rd Int’l Conf. Distributed Computing Systems ,Providence , Rhodeisland ,USA,2003.184-191
[62] 毛莺池, 刘明.一种高效节能的与节点位置无关的传感器网络覆盖协议, 计算机研究与发展, 2006:187-195
[2] 李建中,李金宝,石胜飞.传感器网络及其数据管理的概念,问题与进展.软件学报,2003,14(10): 1717-1727
[3] L.wiebert,S.K.S.Gupta,and J.Weinmann.Research Challenges in Wireless Networks of Biomedical Sensors. MOBICOM ’01,Jul 2001,151-165
[4] Ratnasamy S, Karp B. GHT: A geographic hash table for data-centric storage. In: Reghavendrv CS, ed. Proceedings of the 1st ACM International Workshop on Wireless Sensor Networks and Applications. New York: ACM Press, 2002. 94-103
[5] J.Elson,L.Girod and D.Estrin.Fine-Grained Network Time Synchronization using Reference Broadcasts.OSDI 2002
[6] G.Wang,Chi Fu Huang, Yu Chee Tseng, The Coverage Problem in a Wireless Sensor Network, Proceedings of the 2nd ACM International Conference on Wireless Sensor Networks and Applications (WSNA), 2003: 115-121
[7] Chi Fu Huang, Yu Chee Tseng, Li Chu Lo, The Coverage Problem in Three Dimensional Wireless Sensor Networks, In: Shah R, ed. Proc. of the GLOBECOM. Dallas: IEEE Press, 2004,3182-3186
[8] Anthony Man-Cho So, Yinyu Ye. On Sloving Coverage Problems in a Wireless Sensor Network Using Voronoi Diagrams. Proceedings of the 1st Workshop on Internet and Network Economics. 2005,584-593
[9] Q.Fang,HW. Gellersen, A.Schmidt, etal. Multi-Sensor Context Awareness in Mobile Devices and SmartArtifacts. Journal on Mobile Networks and Applications,Special Issue on Mobility of Systems,Users,Data and computing in Mobile Networks and Applications(M ONET).2002,(10)
[10] M . Bechler , A. Beafour, M.Leopold, etal. Smart Tag Based Data issemination in adhoc. WSNA 2002,68-77
[11] W.Lou,A.Mainwaring, J.Polastre, etal. Wireless sensor networks for habitat monitoring. WSNA 2002,88-97
[12] W.Zhang,Estrin D, Govindan R, etal. In: J. Heidemann, ed. Next century challenges: Scalable coordination in sensor networks. In: Proc. of the 5th Annual ACM/IEEE Int’l Conf. on Mobile Computing and Networking. Seattle,Washington, USA, ACM Press, 1999,263-270
[13] A.Savvides, H.Park, MB, etal. The Bitsand Flops of the N-hop Multilateration Primitive For Node Localization Problems. W SNA 2002, 112-l21
[14] J.Elson, K.Romer. A New Regime for Time Synchronization. Wireless Sensor Networks. 2002,(10)
[15] K.Whitehouse, D.Culler. Calibration as Parameter Estimation in Sensor Networks.WSNA 2002,59-67
[16] V.Bychkovskiy, S.Megerian, D.Estrin, etal. A Collaborative Approach to InPlace Sensor Calibration.IPSN ’03,Apr 2003
[17] S.Meguerdichian, F.Koushanfar, G.Qu, etal. Exposure in wireless Ad-Hoc sensor networks.MOBIC0M ’01,Jul 2001:139-150
[18] J.Staddon, D.Balfanz, G.Durfee. Efficient Tracing of Failed Nodes in Sensor Networks. WSNA 2002,122-130
[19] 任彦, 张思东, 张宏科. 无线传感器网络中覆盖控制理论与算法.软件学报, 2006:158-166
[20] 孙雨耕, 张静,孙永进.无线自组传感器网络,传感技术学报, 2004:253-261
[21] 崔 莉 , 鞠 海 玲 , 苗 勇 等 . 无 线 传 感 器 网 络 研 究 进 展 , 计 算 机 研 究 与 发展,2005:225-233
[22] Akyildiz IF, Su W, Sankarasubramaniam Y, etal. Wireless sensor networks: A survey. Computer Networks, 2002,38(4):393-422
[23] Pottie GJ, Kaiser WJ. Wireless integrated network sensors. Communications of the ACM, 2000,43(5):51-58
[24] Sohrabi K, Gao J, Ailawadhi V, etal. Protocols for self-organization of a wireless sensor network. IEEE Personal Communications, 2000,7(5):16-27
[25] Cardei M, Wu J. Coverage in wireless sensor networks. In: Ilyas M, Magboub I, eds. Handbook of Sensor Networks, chapter 19. CRC Press, 2004
[26] Li JZ, Li JB, Shi SF. Concepts, issues and advance of sensor networks and data management of sensor networks. Journal of Software, 2003,14(10):1717-1727 (in Chinese with English abstract)
[27] Slijepcevic S, Potkonjak M. Power efficient organization of wireless sensor networks. In: Glisic S, ed. Proc. of the IEEE Int’l Conf. on Communications (ICC). Helsinki: IEEE Press, 2001:472-476
[28] Cardei M, Du DZ. Improving wireless sensor network lifetime through power aware organization. Wireless Networks, 2005,11(3):333-340
[29] Lin FYS, Chiu PL. A near-optimal sensor placement algorithm to achievecomplete coverage/discrimination in sensor networks. IEEE Communications Letters, 2005,9(1):43-45
[30] Megerian S, Koushanfar F, Potkonjak M, etal. Worst and best-case coverage in sensor networks. IEEE Trans. on Mobile Computing, 2005,4(1):84-92
[31] Meguerdichian S, Koushanfar F, Qu G, etal. Exposure in wireless ad-hoc sensor networks. In: Rose C, ed. Proc. of the ACM Int’l Conf. on Mobile Computing and Networking (MobiCom). New York: ACM Press, 2001. 139-150
[32] Cortes J, Martinez S, Karatas T, etal. Coverage control for mobile sensing networks. IEEE Trans. on Robotics and Automation, 2004,20(2):243-255
[33] Kar K, Banerjee S. Node placement for connected coverage in sensor networks. In: Crowcroft J, ed. Proc. of the Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks. Sophia-Antipolis: IEEE Press, 2003. 50-52
[34] Yan T, He T, Stankovic JA. Differentiated surveillance for sensor networks. In: Akyildiz IF, Estion D, eds. Proc. of the ACM Int’l Conf. on Embedded Networked Sensor Systems (SenSys). New York: ACM Press,2003. 51-62
[35] Tian D, Georganas ND. A node scheduling scheme for energy conservation in large wireless sensor networks. Wireless Communications and Mobile Computing, 2003,3(2):271-290
[36] upta H, Das SR, Gu Q. Connected sensor cover: Self-Organization of sensor networks for efficient query execution. In: Gerla M, ed. Proc. of the ACM Int’l Symp. on Mobile Ad Hoc Networking and Computing (MobiHOC). New York: ACM Press,2003. 189-200
[37] Huang CF, Tseng YC. A survey of solutions to the coverage problems in wireless sensor networks. Journal of Internet Technology, 2005,6(1):1-8
[38] Shakkottai S, Srikant R, Shroff N. Unreliable sensor grids: Coverage, connectivity and diameter. In: Bauer F, ed. Proc. of the IEEE Infocom. San Francisco: IEEE Press, 2003. 1073-1083
[39] Chakrabarty K, Lyengar SS, Qi H, etal. Grid coverage for surveillance and target location in distributed sensor networks. IEEE Trans. on Computers, 2002,51(12):1448-1453
[40] Meguerdichian S, Koushanfar F, Potkonjak M, etal. Coverage problems in wireless ad-hoc sensor network. In: Sengupta B, ed. Proc. of the IEEE INFOCOM. Anchorage: IEEE Press, 2001. 1380-1387
[41] Ye F, Zhong G, Cheng J, Lu SW, etal. PEAS: A robust energy conservingprotocol for long-lived sensor networks. In: Stankovic J, Zhao W, eds. Proc. of the Int’l Conf. on Distributed Computing Systems (ICDCS). Providence: IEEE Press, 2003. 28-37
[42] Meguerdichian S, Slijepcevic S, Karayan V, etal.Localized algorithms in wireless ad-hoc networks: Location discovery and sensor exposure. In: Vaidya NH, ed. Proc. of the ACM Int’l Symp. on Mobile Ad Hoc Networking and Computing (MobiHOC). New York: ACM Press, 2001. 106-116
[43] Li XY, Wan PJ, Frieder O. Coverage in wireless ad hoc sensor networks. IEEE Trans. on Computers, 2003,52(6):753-763
[44] Huang CF, Tseng YC. The coverage problem in a wireless sensor network. In: Sivalingam KM, Raghavendra CS, eds. Proc. of the ACM Int’l Workshop on Wireless Sensor Networks and Applications (WSNA). New York: ACM Press, 2003. 115-121
[45] Wang X, Xing G, Zhang Y, etal. Integrated coverage and connectivity configuration in wireless sensor networks. In: Akyildiz IF, Estion D, eds. Proc. of the ACM Int’l Conf. on Embedded Networked Sensor Systems (SenSys). New York: ACM Press, 2003. 28-39.
[46] Huang CF, Tseng YC, Lo LC. The coverage problem in three-dimensional wireless sensor networks. In: Shah R, ed. Proc. of the GLOBECOM. Dallas: IEEE Press, 2004. 3182-3186
[47] Ravelomanana V. Extremal properties of three-dimensional sensor networks with applications. IEEE Trans. on Mobile Computing, 2004,3(3):246-257
[48] Sun LM, Li JZ, Chen Y, etal. Wireless Sensor Networks. Beijing: Tsinghua University Press, 2005 (in Chinese)
[49] Veltri G, Huang Q, Potkonjak M. Minimal and maximal exposure path algorithms for wireless embedded sensor networks. In: Akyildiz IF, Estion D, eds. Proc. of the ACM Int’l Conf. on Embedded Networked Sensor Systems (SenSys). New York: ACM Press, 2003: 40-50
[50] D.Tian , N.D.Georganas . A coverage-preserving node scheduling scheme for large wireless sensor networks .In :Proc. First ACM Int’l Workshop on Wireless Sensor Networks and Applications. New York: ACM press , 2002. 32-41
[51] H.Zhang,J.C.Hou.On deriving the upper bound of alphalifetime for large sensor networks. In:Proc. 5th ACM Int’l Symposium on Mobile Ad Hoe Networking and Co mputing.New York:ACM Press.2004.121-132
[52] O.Dousse,P Mannersalo,P Thiran.Latency of wireless sensor networks with uncoordinated power saving mechanisms.In:Proc.5th ACM Int’l Symposium on Mobile Ad Hoc Networking and Computing . New York : ACM Pre&~.2004.109-120
[53] S.Slijepsevic , M.Potkonjak . Power efficient organization of wireless sensor networks. IEEE Conf .Communications. Helsinki,Finland,2001
[54] M.Cardei ,D.Marcallum, X.Cheng ,et al. Wireless sensor networks with energy efficient organization. Journal of interconnection Networks, 2002,3 (3-4): 213-229
[55] 石高涛, 廖明宏. 大规模传感器网络随机睡眠调度节能机制, 计算机研究与发展, 2005:579-585
[56] I.stojmenovic.Position based routing in ad hoc networks.IEEE Communica- tions Magazine, 2002 40(7):128-134
[57] SAVVIDES A, HAN C, SRIVASTAVA M. Dynamic fine-grained localization in ad-hoc networks of sensors [A]. 7th ACM Int Conf on Mobile Computing and Networking (Mobicom)[C]. Rome, Italy, 2001.166-179
[58] R. Williams .The Geometrical Foundation of Natural Structure :A Source Book of Design .New York :Dover Publication Inc.,1999.51-52
[59] Sohrabi K, Gao J,Ailawadhi V, etal. Protocols for self-organization of a wireless sensor network. IEEE Personal Communications, 2000,7(5):16-27
[60] Cardei M., Wu J.. Coverage in wireless sensor networks. In: Ilyas M, Magboub I, eds. Handbook of Sensor Networks, chapter 19. CRC Press, 2004.89-95
[61] H.Zhang,J.C.Hou . Maintaining scheme coverage and connectivity in large sensor networks .NSF Int’l Workshop on Theoretical and Algorithmic Aspects of sensor, Peer-to-peer Networks,Chicago,USA,2004.266-275
[61] F.Ye,G.Zhang,S.Lu,al.PEAS:A robust energy conserving protocol for long-lived sensor networks. The 23rd Int’l Conf. Distributed Computing Systems ,Providence , Rhodeisland ,USA,2003.184-191
[62] 毛莺池, 刘明.一种高效节能的与节点位置无关的传感器网络覆盖协议, 计算机研究与发展, 2006:187-195
© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号 地址：北京市海淀区学院路29号 邮编：100083 电话：办公室：(+86 10)66554848；文献借阅、咨询服务、科技查新：66554700 |