无线传感器网络目标覆盖算法研究
|
摘要
随着传感器技术、计算机网络技术、微电子机械系统和信号处理技术的发展,无线传感器网络逐渐成为研究热点。无线传感器网络由许多带有有限能量的节点组成,被随机部署在监测区域内。节点一般具有数据采集、处理、无线通信和自动组网的能力,节点之间互相协作完成复杂的监测任务。探测到的数据通过多跳中继方式发送到汇聚节点,汇聚节点具有更大的处理能力,能够进一步处理信息或有更大的发送范围,可以将信息送往远程中心进行集中处理,使远程用户能够获得信息。无线传感器网络这些特点使它特别适合部署在恶劣环境和人不宜到达场所。
覆盖是无线传感器网络研究的关键问题,直接影响传感器网络的服务质量和使用性能。按照监测对象的不同,覆盖分为区域覆盖、目标覆盖和障碍覆盖。本文主要针对无线传感器网络能量高效的目标覆盖问题进入了深入的讨论研究。
首先,介绍了传感器0-1感知模型和概率感知模型,提出了一种在高密度的传感器网络中达到要求的网络覆盖率的情况下,通过实时改变每个传感器节点的感知阈值去节省传感器节点的能量消耗的方法。论文基于概率感知模型分别提出了贪婪、改进模拟退火和弹性网络算法的传感器网络概率覆盖算法,根据要求的覆盖概率,经过运算得到每个传感器节点的感知阈值调整调度表。通过仿真试验,对比了三种算法的性能和效率。仿真结果表明,贪婪算法求得的解最差,改进模拟退火的解最好,弹性网络的解略逊于改进模拟退火,但其执行速度最快,适合在处理能力不高的传感器节点中执行。
其次,介绍了和连通覆盖相关的基本概念,定义了连接的最大生存时间的目标覆盖问题(CMLSC)和连接的最大生存时间的单目标覆盖问题(CMLSTSC)。针对这两个问题首先提出了一个基于贪婪的启发集中式算法—GCH算法,算法通过在当前传感器集合中搜寻关键传感器节点建立一个目标覆盖集合,并且使用DFS或者BFS建立和汇聚节点的连通。然后又提出分布式启发算法—DCH,算法分两步实现了网络的连通覆盖:首先通过和邻居节点交换覆盖信息去决定自身的工作状态,然后通过包含目标和汇聚节点的最小生成树去激活转发节点,从而形成和汇聚节点连通的覆盖集合。最后,通过仿真实验表明,这两种算法都能完成目标的连通覆盖,且DCH算法比GCH算法更有效的延长了网络的生存时间。
考虑到一般的定位方案不适用于低成本、低功耗要求的传感器网络的定位,但是解决覆盖问题的很多算法都基于一个所有的传感器节点都精确的知道自身的位置的假设。提出了一个汇聚节点辅助的定位算法。吸取了DV-Hop和RSSI算法的优点,能量高效并且有一定精度的完成节点位置信息的获取。通过使用得到的位置信息,实现了一个对移动目标的覆盖监测协议。仿真的结果表明,此覆盖协议能可靠的覆盖移动的目标,获取目标的位置,并且有效的延长网络的生存时间,对于没有定位手段而又需要监测移动目标的网络具有一定的实际意义。
最后,针对当前覆盖算法都需要精确的目标位置信息这一在现实网络应用中很难实现的问题,提出了一个分布式、位置无关的传感器网络节点覆盖调度算法。论文证明了采用随机部署的传感器网络是一个泊松点过程,分析了网络覆盖强度和节点部署密度之间的关系。得出了结论:随着传感器节点部署密度的增加,传感器节点休眠率可随之增加,即网络的生存时间增加了;同时,如果增大传感器节点的感知半径,也能增加传感器节点的休眠率,延长网络生存时间。该算法不依赖节点的位置信息,每个节点使用很少的通信开销和邻居节点交换信息去决定是否进入休眠模式。通过仿真试验表明,算法能在保持一定的网络覆盖强度的情况下最大限度的减少工作节点的数量,从而延长网络的生存时间。
With the development of sensor technology, computer networks, Micro Electro Mechanical System (MEMS) and singal processing technology, wireless sensor networks (WSN) become a major concern in research field. Generally, WSN consist of a large number of tiny sensors nodes with limited power supply which are randomly deployed in monitored area. The sensor nodes are capable of data gathering, data processing, wireless communication and self-organization, and finish complex monitor task by collaboration. The acquired data will send to sink node by multi-hop relay. The sink node has ability to process amount of data and send the data to futher region, so romote user can get the data. The features of WSN show that WSN can be deployed at severe environment and the place where people can not arrive.
Coverage is the crucial and fundamental issue in the research of WSN, and has great influence on the performance and quality of services (QoS) of the networks. The thesis focuses on energy-efficient target coverage in WSN.
Firstly, the thesis presents 0-1 sensing model and probabilistic sensing model, and give a viewpoint that energy of node can be saved by changing sensing radius. Baesd on probabilistic sensing model, an improved simulated annealing algorithm and an elastic net algorithm are proposed to find a sensing radius table of all sensor nodes under the expected coverage ratio. The experiments show that both of them can find sensing radius scheduling scheme and prolong the lifetime of the networks.
Secondly, the thesis presents basic notion about connected coverage problem, and defines the problem of connected maximum lifetime set cover and the problem of connected maximum lifetime single target set cover. A GCH algorithm and a DCH algorithm are proposed to slove the two problem. GCH finds key sensor nodes to build a target set cvoer and set up connectivity by using DFS or BFS, while DCH builds connected set cover by finding sensing nodes and forwarding node. The simulations show that the two algorithms are feasible and effective.
The general location scheme is not suitable for low-power and low-cost WSN, but most of coverage schemes are based on exact location. The thesis proposes a sink assisted location algorithm by absorbing the merit of DV-Hop and RSSI, which can obtain sensor nodes location information. Then, based on the location information, a coverage algorithm that covers a moving target are presented. The experiments show that algorithm is practicability for the WSN without location equipments that monitors moving target.
Finally, aim at the problem that most of coverage algorithm relies on exact location information which is hard to obtain in real application of the network. The thesis presents a distributed and location-free sensor node coverage scheduling algorithm and proves that the randomly deployed WSN is a Possion point process, and draw conclusions that with the increase of density of sensor nodes and the increase of sensing range of sensor nodes, the lifetime of network can be prolonged. The algorithm does not rely on the location information of sensor nodes, and use a few messages of neighborhood to decide work status. The simulations show that the algorithm can decrease the quantity of working nodes under expected coverage intensity and can prolong the lifetime of network.
覆盖是无线传感器网络研究的关键问题,直接影响传感器网络的服务质量和使用性能。按照监测对象的不同,覆盖分为区域覆盖、目标覆盖和障碍覆盖。本文主要针对无线传感器网络能量高效的目标覆盖问题进入了深入的讨论研究。
首先,介绍了传感器0-1感知模型和概率感知模型,提出了一种在高密度的传感器网络中达到要求的网络覆盖率的情况下,通过实时改变每个传感器节点的感知阈值去节省传感器节点的能量消耗的方法。论文基于概率感知模型分别提出了贪婪、改进模拟退火和弹性网络算法的传感器网络概率覆盖算法,根据要求的覆盖概率,经过运算得到每个传感器节点的感知阈值调整调度表。通过仿真试验,对比了三种算法的性能和效率。仿真结果表明,贪婪算法求得的解最差,改进模拟退火的解最好,弹性网络的解略逊于改进模拟退火,但其执行速度最快,适合在处理能力不高的传感器节点中执行。
其次,介绍了和连通覆盖相关的基本概念,定义了连接的最大生存时间的目标覆盖问题(CMLSC)和连接的最大生存时间的单目标覆盖问题(CMLSTSC)。针对这两个问题首先提出了一个基于贪婪的启发集中式算法—GCH算法,算法通过在当前传感器集合中搜寻关键传感器节点建立一个目标覆盖集合,并且使用DFS或者BFS建立和汇聚节点的连通。然后又提出分布式启发算法—DCH,算法分两步实现了网络的连通覆盖:首先通过和邻居节点交换覆盖信息去决定自身的工作状态,然后通过包含目标和汇聚节点的最小生成树去激活转发节点,从而形成和汇聚节点连通的覆盖集合。最后,通过仿真实验表明,这两种算法都能完成目标的连通覆盖,且DCH算法比GCH算法更有效的延长了网络的生存时间。
考虑到一般的定位方案不适用于低成本、低功耗要求的传感器网络的定位,但是解决覆盖问题的很多算法都基于一个所有的传感器节点都精确的知道自身的位置的假设。提出了一个汇聚节点辅助的定位算法。吸取了DV-Hop和RSSI算法的优点,能量高效并且有一定精度的完成节点位置信息的获取。通过使用得到的位置信息,实现了一个对移动目标的覆盖监测协议。仿真的结果表明,此覆盖协议能可靠的覆盖移动的目标,获取目标的位置,并且有效的延长网络的生存时间,对于没有定位手段而又需要监测移动目标的网络具有一定的实际意义。
最后,针对当前覆盖算法都需要精确的目标位置信息这一在现实网络应用中很难实现的问题,提出了一个分布式、位置无关的传感器网络节点覆盖调度算法。论文证明了采用随机部署的传感器网络是一个泊松点过程,分析了网络覆盖强度和节点部署密度之间的关系。得出了结论:随着传感器节点部署密度的增加,传感器节点休眠率可随之增加,即网络的生存时间增加了;同时,如果增大传感器节点的感知半径,也能增加传感器节点的休眠率,延长网络生存时间。该算法不依赖节点的位置信息,每个节点使用很少的通信开销和邻居节点交换信息去决定是否进入休眠模式。通过仿真试验表明,算法能在保持一定的网络覆盖强度的情况下最大限度的减少工作节点的数量,从而延长网络的生存时间。
With the development of sensor technology, computer networks, Micro Electro Mechanical System (MEMS) and singal processing technology, wireless sensor networks (WSN) become a major concern in research field. Generally, WSN consist of a large number of tiny sensors nodes with limited power supply which are randomly deployed in monitored area. The sensor nodes are capable of data gathering, data processing, wireless communication and self-organization, and finish complex monitor task by collaboration. The acquired data will send to sink node by multi-hop relay. The sink node has ability to process amount of data and send the data to futher region, so romote user can get the data. The features of WSN show that WSN can be deployed at severe environment and the place where people can not arrive.
Coverage is the crucial and fundamental issue in the research of WSN, and has great influence on the performance and quality of services (QoS) of the networks. The thesis focuses on energy-efficient target coverage in WSN.
Firstly, the thesis presents 0-1 sensing model and probabilistic sensing model, and give a viewpoint that energy of node can be saved by changing sensing radius. Baesd on probabilistic sensing model, an improved simulated annealing algorithm and an elastic net algorithm are proposed to find a sensing radius table of all sensor nodes under the expected coverage ratio. The experiments show that both of them can find sensing radius scheduling scheme and prolong the lifetime of the networks.
Secondly, the thesis presents basic notion about connected coverage problem, and defines the problem of connected maximum lifetime set cover and the problem of connected maximum lifetime single target set cover. A GCH algorithm and a DCH algorithm are proposed to slove the two problem. GCH finds key sensor nodes to build a target set cvoer and set up connectivity by using DFS or BFS, while DCH builds connected set cover by finding sensing nodes and forwarding node. The simulations show that the two algorithms are feasible and effective.
The general location scheme is not suitable for low-power and low-cost WSN, but most of coverage schemes are based on exact location. The thesis proposes a sink assisted location algorithm by absorbing the merit of DV-Hop and RSSI, which can obtain sensor nodes location information. Then, based on the location information, a coverage algorithm that covers a moving target are presented. The experiments show that algorithm is practicability for the WSN without location equipments that monitors moving target.
Finally, aim at the problem that most of coverage algorithm relies on exact location information which is hard to obtain in real application of the network. The thesis presents a distributed and location-free sensor node coverage scheduling algorithm and proves that the randomly deployed WSN is a Possion point process, and draw conclusions that with the increase of density of sensor nodes and the increase of sensing range of sensor nodes, the lifetime of network can be prolonged. The algorithm does not rely on the location information of sensor nodes, and use a few messages of neighborhood to decide work status. The simulations show that the algorithm can decrease the quantity of working nodes under expected coverage intensity and can prolong the lifetime of network.
引文
[1]Akyildiz.I.F,Su.W,Sankarasubrama.Y,et al.A Survey on SensorNetworks.IEEE Communications Magazine,2002,40(8):102-114
[2]Edgar.H.Callaway.Wierless Sensor Netwokrs:Acrhitectures and Protocols.Boca Roton,USA:CRC Press,2003
[3]孙利民,李建中,陈渝,等.无线传感器网络.北京:清华大学出版社,2005
[4]Raghunathan.V,Schurgers.C,Park.S,et al.Energy-Aware Wireless Microsensor Networks.IEEE Signal Processing Magazine,2002,19(3):40-50
[5]黄武陵,艾云峰,无线传感器网络在智能交通系统中的应用,电子产品世界,2008(6):56-59
[6]吴成东,郑君刚,刘大任,等.基于无线传感器网络的智能家居网络技术研究,沈阳建筑大学学报,2005(6):78-92
[7]赵泽,崔莉,一种基于无线传感器网络的远程医疗监护系统,信息与控制,2006(2):35-38
[8]Eschenauer.L,Gligor.V.A key-management scheme fo distributed sensor networks.In:The 9th ACM Conference on Computer and Communication Security,Washington,USA:ACM Press,2002.41-47
[9]Chan.H,Perrig.A,Song.D.Random key predistribution schemes for sensor networks,In:IEEE Symposium on Research in Security and Privacy,Los Alamitos,USA:IEEE Press,2003.197-213
[10]Perrig.A,Szewczyk.R,Wen V,et al.SPINS:Security protocols for sensor networks,Wireless Networks,2002,8(5):521-534
[11]Xu Wenyuan,Wade Trappe,Zhang Yanyong.Channel surfing:Defending wireless sensor networks from interference,In:International Conference on Information Processing in Sensor Networks(IPSN2007),Massachusetts,USA:ACM Press, 2007.499-508
[12] Li Mingyan, Koutsopoulos Iordanis, Poovendran Radha. Optimal jamming attacks and network defense policies in wireless sensor networks, In: IEEE International Conference on Computer Communication(INFOCOM 2007), Alaska, USA: IEEE Press, 2007.1307-1315
[13] Traynor Patrick, Heesook Choi, Cao Guohong, et al. Establishing pair-wise keys in heterogeneous sensor networks, In: IEEE International Conference on Computer Communication(INFOCOM 2006), Barcelona, Spain: IEEE Press, 2006.78-85
[14] Yu Zhen, Guan Yong. A dynamic en-route scheme for filtering false data injectiong in wireless sensor networks. In: IEEE International Conference on Computer Communication(INFOCOM 2006), Barcelona, Spain, IEEE Press, 2006.1-12
[15] Wei Yawen, Yu Zhen, Guan Yong. Location verification algorithms for wireless sensor networks. In: International Conference on Distributed Computing Systems(ICDCS), Toronto, Canada: IEEE Press, 2007,70-70
[16] Ye Fan, Yang Hao, Liu Zhen. Cathing "Moles" in sensor networks. In: International Conference on Distributed Computing Systems(ICDCS), Toronto, Canada: IEEE Press, 2007.69-69
[17] Liu Fang, Cheng Xiuzhen, Chen Dechang. Inside attacker detection in wireless sensor networks. In: IEEE International Conference on Computer Communication (INFOCOM 2007), Alaska, USA: IEEE Press, 2007.1937-1945
[18] Vanam. T, Langendoen. K. An adaptive energy-efficient MAC protocol for wireless sensor networks. In: The 1st International Conference on Embedded Networks Sensor Systems, California, USA: ACM Press, 2003.171-180
[19] Rajendran. V, Obraczka. K, Garcia J.J. Energy-efficient, Collision-free medium access control for wireless sensor networks. In: The 1st International Conference on Embedded Networks Sensor Systems, California, USA: ACM Press, 2003.181-192
[20] Degesys Julius, Rose Ian , Batel Ankit, et al. DESYNC: Self-organizing desynchronization and TDMA on wireless sensor networks. In: International Conference on Information Processing in Sensor Networks(IPSN2007),Massachusetts, USA: ACM Press, 2007.11-20
[21] Bruck Jehoshua, Gao Jie, Jiang Anxiao. MAP : Medial axis based geometric routing in sensor networks. In: IEEE International Conference on Mobile Computing and Networking(MOBICOM2005), Cologne, Germany: IEEE Press, 2005.88-102
[22] Chiranjeeb Buragohain, Divyakant Agrawal, Subhash Suri. Power aware routing for sensor databases. In: IEEE International Conference on Computer Communications (INFOCOM2005), New York, USA: IEEE Press, 2005.1747-1757
[23] Szymon Chachulski, Michael Jennings, Sachin Katti, et al. Trading structure for randombess in wireless opportunistic routing. In: Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications, kyoto, Japan: ACM Press, 2007.169-180
[24] Zeng Bin, Wei Jun, Hu Tao. An energy-efficient data fusion protocol for wireless sensor network.In: The 10th International Conference on Information Fusion,Quebec, Canada: IEEE Press, 2007.1-7
[25] Lamborn Peter, Williams Pamela. A Data Fusion Algorithm for Large Heterogeneous Sensor Networks. In: Proceedings of the International Conference on Wireless Algorithms, Systems and Applications, Orlando, USA: IEEE Press,2007.225-232
[26] Sichitiu. ML, Chanchai Veerarittiphan. Simple accurate time synchronization for wireless sensor networks. In: IEEE Wireless Communication and Networking Conference(WCNC2003), New Orleans, USA: IEEE Press, 2003.1266-1273
[27] Hu Answol, Sergio. D. Servetto. Asymptotically optimal time synchronization in dense sensor networks. In: Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications, San Diego, USA: ACM Press,2003.1-10
[28]Maroti.M,Kusy.B,Simon.G,et al.Flodding time synchronization in wireless sensor networks.In:ACM Conference on Embedded Networks Sensor Systems (SENSYS2004),Maryland,USA:ACM Press,2004.39-49
[29]Gao.Jie,Leonidas Guibas,Nikola Milosavljevic,et al.Sparse data aggregation in sensor networks.In:Proceedings of the 6th international conference on Information processing in sensor networks,Massachusetts,USA:ACM Press,2007:430-439
[30]Yang Xiaoyan,Hock Beng Lim,Tamer.M.In-network execution of monitoring queries in sensor networks.In:Proceedings of the 2007 ACM SIGMOD international conference on Management of data,Beijing,China:ACM Press,2007:521-532
[31]Guo Longjiang,Li Yingshu,Li Jizhong.Event Query Processing Based on Data-Centric Storage in Wireless Sensor Networks.In:The 49th IEEE Globecom Technical Conference,San Francisco,USA:IEEE Press,2006:1-6
[32]Nicolescu.D,Nath.B.Ad hoc positioning system using AoA.In:IEEE International Conference on Computer Communications(INFOCOM2003),San Francisco,USA:IEEE Press,2003.1734-1743
[33]He.T,Huang.C,Blum.B.M,et al.Range-free localization schemes for lager scale sensor networks.In:Proceedings of the 9th Annual International Conference on Mobile Computing and Networking,San Diego,USA:ACM Press,2003.81-95
[34]Masoomeh Rudafshani,Suprakash Datta.Localization in wireless sensor networks.In:International Conference on Information Processing in Sensor Networks (IPSN2007),Massachusetts,USA:ACM Press,2007.51-60
[35]史永彬,叶湘滨,刘培亮.无线传感器网络技术研究现状.国外电子测量技术,2005(11):10-23
[36]杜晓明,陈岩.无线传感器网络研究现状与应用.北京工商大学学报,2008(1):41-44
[37]Warneke.B,Last.M,Liebowitz.B,et al.Smart dust:Communicating with a cubicmillimeter computer. IEEE Computer Magazine, 2001,34(1):44-51
[38] Slijepcevic. S, Potkonjak. M. Power Efficient Organization of Wireless Sensor Networks. In: IEEE International Conference on Communications, Helsinki,Finland: IEEE Press, 2001.472-476
[39] Berman. P, Calinescu. G, Shah. C, et al. Power Efficient Monitoring Management in Sensor Networks. In: Proceedings of IEEE Wireless Communication and Networking Conference(WCNC04), Atlanta, USA: IEEE Press, 2004.2329-2334
[40] Tian. D, Georganas N.D. A coverage-preserving node scheduling scheme for large wireless sensor networks. In: Proceedings of First International Workshop on Wireless Sensor Networks and Applications(WSNA02), Atlanta, USA: IEEE Press,2002.32-41.
[41] Heinzelman. W,Chandrakasan. A, Balakrishnan. H. Energy-Efficient communication protocol for wireless sensor networks. In: Proceedings of the 33rd Hawaii Int'l Conf.System Sciences.Washington:IEEE Press, 2000:300-304.
[42] Cardei. M, MacCallum. D, Cheng. X, et al. Wireless Sensor Networks with Energy Efficient Organization. Journal of Interconnection Networks, 2002(3):213-229
[43] Abrams. Z, Goel. A, Plotkin. S. Set k-cover algorithms for energy efficient monitoring in wireless sensor networks. In: Proceedings of Information Processing in Sensor Networks(IPSN2004), California, USA: ACM Press, 2003.424-432
[44] Ye. F, Zhong. G, Lu. S, et al. PEAS: A Robust Energy Conserving Protocol for Longlived Sensor Networks. In: Proceedings of 10th IEEE International Conference on Network Protocols(ICNP02), California, USA: ACM Press, 2002.200-201
[45] Ye. F, Zhong. G, Lu. S, et al. PEAS: A Robust Energy Conserving Protocol for Longlived Sensor Networks, In: Proceedings of 23rd IEEE International Conference on Distributed Systems(ICDCS03), California, USA: IEEE Press,2003.28-28
[46] Yan. T, He. T, Stankovic. J. Differentiated Surveillance Service for Sensor Networks, In: Proceedings of the 1st International Conference on Embedded Networks Sensor Systems, California, USA: ACM Press, 2003.51-62
[47] Tian. D, Georganas. N.D. A Node Scheduling Scheme for Energy Conservation in Large Wireless Sensor Networks. Journal of Wireless Communication and Mobile Computing, 2003(5):271-290
[48] Tian. D, Georganas. N.D. Connectivity Maintenance and Coverage Preservation in Wireless Sensor Networks, Ad Hoc Networks, 2005(3):744-761
[49] Zhang. M, Du. X, Nygard. K. Improving coverage performance in sensor networks by using mobile sensors. In: Proceedings of the Military Communications Conference (MILCOM2005), Atlantic, USA: 2005.3335-3341
[50] Wang. W, Srinivasan. V, Chua. K.C. Trade-offs between mobility and density for coverage in wireless sensor networks. In: Proceedings of the 13th Annual International Conference on Mobile Computing and Networking(Mobicom2007),Montreal, Canada: ACM Press, 2007.39-50
[51] Caicedon. C, Zefran. M. Energy cost of coordination algorithms for wireless mobile sensor networks. In: Proceedings of the 2005 IEEE International Conference on Networking, Sensing and Control, Tucson, USA: IEEE Press, 2005.419-424
[52] Liu. B, Brass. P, Dousse. O, et al. Mobility improves coverage of sensor networks.In: Proceedings of the 6th ACM International Symposium on Mobile Ad Hoc Networking and Computing(MobiHoc2005), Urbana-Champaign, USA: ACM Press, 2005.300-308
[53] Poduri. S, Sukhatme. G.S. Constrained coverage in mobile sensor networks. In:Proceedings of IEEE International Conference on Robotics and Automation ( ICRA2004), New Orleans, USA: IEEE Press, 2004.40-50
[54] Ghosh. A. Estimating coverage holes and enhancing coverage in mixed sensor networks. In: Proceedings of the 29th Annual IEEE Conference on Local Computer Networks(LCN2004), Tampa, USA: IEEE Press, 2004.68-76
[55] Hsin. C, Liu. M. Network Coverage Using Low Duty-Cycled Sensors: Random and Coordinated Sleep Algoruthms. In: Proceeding of the 3rd International Symposium Workshop on Information Processing in Sensor Networks(IPSN2004), California,USA: ACM Press, 2004.433-442
[56] Zhang. H, Hou. J. On Deriving the Upper Bound of Alpha-Lifetime for Large Sensor Networks. In: The 5th ACM International Symposium on Mobile Ad Hoc Networking and Computing(MobiHoc2004), Tokyo, Japan: ACM Press,2004.121-132
[57] Lu. J, Suda. K. Coverage-aware Self-scheduing in Sensor Networks. In: Proceedings of the 18th IEEE Annual Workshop on Computer Communication (CCW03), Dana Point, USA: IEEE Press, 2003.117-123
[58] Xing. G, Lu. C, Pless. R, et al. Co-grid: An Efficient Coverage Maintenance Protocol for Distributed Sensor Networks. In: Proceeding of the 3rd International Symposium Workshop on Information Processing in Sensor Networks(IPSN04),California, USA: ACM Press, 2004.414-423
[59] Chen. H, Wu. H, Tzeng. N. Grid-based Approach for Working Node Selection in Wireless Sensor Networks. In: Proceedings of IEEE International Conference on Communation(ICC04), Pairs, France: IEEE Press, 2004.3673-3678
[60] Liu. C, Wu. K, King. V. Randomized Coverage-Preserving Scheduing Schemes for Wireless Sensor Networks. In: Proceeding of IFIP International Conference on Networking, Waterloo Ontario, Canada: Springerlink Press, 2005.132-137
[61] Carbunar. B, Grama. A, Vitek. J, et al. Coverage Presevring Redundancy Elimination in Sensor Networks, In: Poreeedings of the 1st IEEE Communications Society Conference On Sensor and Ad Hoc Communications and Networks (SECON04), Santa Clara, USA: IEEE Press, 2004.377-386
[62] Boukerche. A, Fei. X, Regina. B. An energy aware coverage-preserving scheme for wireless sensors network. In: Proceedings of the 2nd ACM International Workshop(PEWASUN05), Montreal, Canada: ACM Press, 2004.205-213
[63] Carle. J, Simplot. D. Energy Efficient Area Monitoring by Sensor Networks. IEEE Computer Magazine, 2004,37(2): 40-46
[64] Carle. J, Gallais. A, Simplot. D. Preserving Area Coverage in wireless sensor networks by using surface coverage relay dominating sets. In: Proceedings of the 10th IEEE Symposium on Computers and Communications(ISCC05), Cartagena,Spain: IEEE Press, 2005.347-352
[65] Hafeeda. M, Bagheri. M. Randomized k-coverage algorithms for dense sensor networks. In: IEEE International Conference on Computer Communication (INFOCOM 2007), Alaska, USA: IEEE Press, 2007.2376-2380.
[66] Liu. Y, Liang. W. Approximate coverage in wireless sensor networks. In:Proceedings of the IEEE Conference on Local Computer Networks 30th Anniversary (LCN2005), Sydney, Australia: IEEE Press, 2005.68-75
[67] Zhang. H, Hou. J.C. Maintaining Sensing Coverage and Connectivity in Large Sensor Networks. International Journal of the Wireless Ad Hoc and Sensor Networks, 2005,1(1)89-124
[68] Wu. J, Yang. S. Coverage issue in sensor Networks with adjustable ranges. In:Proceedings of 2004 International Workshop on Mobile and Wireless Networking (WMN04), Montreal, Canada: ACM Press, 2004.61-68
[69] Wang. X, Xing. G, Zhang. Y, et al. Integrated Coverage and Connectivity Configuration in Wireless Sensor Networks. In: 1 st ACM Conference on Embedded Networked Sensor Systems, Los Angles, USA: ACM Press, 2003.28-39
[70] Liu. C, Wu. K, Xiao. Y, et al. Random coverage with guaranteed connectivity: joint scheduling for wireless sensor networks, IEEE Transactions on Parallel and Distributed Systems, 2006,17(6): 562-574.
[71] Huang. C.F, Tseng. Y.C, Wu. H.L. Distributed protocols for ensuring both coverage and connectivity of a wireless sensor network, ACM Transactions on Sensor Networks, 2007,3 (1):1-24
[72] Zhou. Z, Das. S, Gupta. H. Connected K-Coverage Problem in Sensor Networks. In:Proceedings. 13th International Conference on Computer Communications and Networks(ICCCN2004), Chiago, USA: ACM Press, 2004.373-378
[73] Gupta. H, Zhou. Z, Das. S.R, et al. Connected sensor cover: Selforganization of sensor networks for efficient query execution. IEEE Transactions on Networking,2006,14(1):55-67
[74] Zou. Y, Chakrabarty. K. A distributed coverage and connectivity-centric technique for selecting active nodes in wireless sensor networks. IEEE Transactions on Computers, 2005(54):978-991
[75] Ammari. H.M, Das. S.K. Integrated coverage and connectivity in wireless sensor networks: A two-dimensional percolation problem, IEEE Transactions on Computers, 2008,57(10): 1423-1434
[76] Funke. S, Kesselman. A, Kuhn. F, et al. Improved approximation algorithms for connected sensor cover. Wireless Networks, 2007,13 (2): 153-164
[77] Zhou. Z, Das. S. Gupta. H. Variable radii Connected Sensor Cover in Sensor Networks. In: Poreeedings of the 1st IEEE Communications Society Conference On Sensor and Ad Hoc Communications and Networks (SECON2004), Santa Clara,USA: IEEE Press, 2004.387-396
[78] Ghosh. A, Das. S.K. Distributed connected sensor cover algorithms for lattice and random deployment of nodes in dense sensor networks. In:Proceedings of the 1st IEEE/ACM International Conference on stributed Computing in Sensor Systems( DCOSS2005), Merina del Rey, Canada: IEEE Press, 2005.231-238
[79] Miorandi. D, Altaian. E. Coverage and connectivity of ad hoc networks in presence of channel randomness. In: IEEE International Conference on Computer Communications (INFOCOM2005), New York, USA: IEEE Press, 2005.491-502
[80] Alam. N, Haas. Z.J. Coverage and connectivity in three-dimensional networks. In: Proceedings of the 12th Annual International Conference on Mobile Computing and Networking(MobiCom2006), New York, USA: ACM Press, 2006.346-357
[81] Huang. C.F, Tseng. Y.C, Lo. L.C. The coverage problem in three-dimensional wireless sensor networks. In: Proceedings of the IEEE Global Telecommunications Conference, Dallas, USA: IEEE Press, 2004.3182-3186
[82] Ghosh. A, Wang. Y, Krishnamachari. B. Efficient distributed topology control in 3-dimensional wireless networks. In: Proceedings of the 3rd IEEE International Conference on Sensor and Ad hoc Communications and Networks(SECON2004),San Diego, Canada: IEEE Press, 2007.91-100
[83] Wang. B, Wang. W, Srinivasan. V, et al. Information coverage for wireless sensor networks. Communications Letters, 2005,9(11):967-969
[84] Onur. E, Ersoy. C, Delic. H, et al. Coverage in sensor networks when obstacles are present. In: Proceedings of the IEEE International Conference on Communications (ICC2006), Istanbul, Turkey: IEEE Press, 2006.4077-4082
[85] Dhillon. S, Chakrabarty. K. Sensor Placement for Effective Coverage and Surveillance in Distributed Sensor Networks. In: IEEE Wireless Communication and Networking Conference(WCNC2003), New Orleans, USA: IEEE Press,2003.1609-1614
[86] Wang. J, Zhong. N. Efficient point coverage in wireless sensor networks. Journal of Combinatorial Optimization, 2006 (11):291-304
[87] Cardei. M, Thai. M.T, Li. Y, et al. Energy-Efficient Target Coverage in Wireless Sensor Networks. In: Proceedings of the 24th conference of the IEEE Communications Society (INFOCOM2005), New York, USA: IEEE Press,2005.1976-1984
[88] Cardei. M, Du. D.Z. Improving Wireless Sensor Network Lifetime through Power Aware Organization, Wireless Networks, 2005,11(3):333-340
[89] Lu. M, Wu. J, Cardei. M. Energy-efficient connected coverage of discrete targets in wireless sensor networks. In: International Conference on Computer Networks and Mobile Computing (ICCNMC2005), Zhangjiajie, China: Springerlink Press,2005.43-52
[90] Cardei. M, Wu. J, Lu M. Maximum network lifetime in wireless sensor networks with adjustable sensing ranges. In: Proceedings of IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob2005), Montreal, Canada: IEEE Press, 2005.438-445
[91] Yang S, Dai. F, Cardei. M, et al. On connected multiple point coverage in wireless sensor networks. International Journal of Wireless Information Networks,2006.289-301.
[92] Liu. H, Wan. P, Yi. CW, et al. Maximal lifetime scheduling in sensor surveillance networks. In: Proceedings of the 24th conference of the IEEE Communications Society (INFOCOM2005), New York, USA: IEEE Press, 2005.2482-2491
[93] Liu. H, Wan P, Jia X. Maximal lifetime scheduling for k to 1 sensor target surveillance networks, Computer Networks, 2006,50(15):2839-2854.
[94] Meguerdichian. S, Koushanfar. F, Potkonjak. M. Coverage Problem in Wirelss Ad-Hoc Sensor Networks. In: Proceedings of 20th Annual Joint Conference of IEEE Computer and Communications Societies(INFOCOM2001), Anchorage, USA:IEEE Press, 2001.1380-1387
[95] Cheng. M.X, Ruan. L, Wu. W. Achieving Minimum Coverage Breach under Bandwidth Constraints in Wireless Sensor Networks. In: Proceedings of the 24th conference of the IEEE Communications Society (INFOCOM2005), New York,USA: IEEE Press, 2005.2638-2645
[96] Veltri. G, Huang. Q, Qu. G, et al. Minimal and maximal exposure path algorithms for wireless embedded sensor networks. In: Proceedings of the 1st International Conference on Embedded Networked Sensor Systems(SENSYS2003), Los Angeles,USA: ACM Press, 2003.40-50
[97]Basu Roy.S,Das.G,Das.S.K.Computing best coverage path in the presence of obstacles in a sensor field.In:Proceedings of Workshop on Algorithms and Data Structures(WADS2007),Halifax,Canada:ACM Press,2007.577-588.
[98]Kumar.S,Lai.T.H,Arora.A.Barrier coverage with wireless sensors.In:Proceedings of the 11th Annual International Conference on Mobile Computing and Networking(MobiCom2005).,New York,USA:ACM Press,2005.284-298
[99]Chen.A.,Kumar.S,Lai.T.H.Designing localized algorithms for barrier coverage.In:Proceedings of the 13th Annual International Conference on Mobile Computing and Networking(Mobicom2007),Montreal,Canada:ACM Press,2007.63-74
[100]Megerian.S,Koushanfar.F,Potkonjak.M.Worst and best-case coverage in sensor networks.IEEE Transactions on Mobile Computing,2005(4):120-128
[101]向阳,龚新高.推广模拟退火方法及其应用.物理学进展,2000,25(20):41-56
[102]Durbin.R,Willshaw.D.An analogue approach to the traveling salesman problem using an elastic net method.Nature,1987,326:689-691
[103]Durbin.R,Szeliski.R,Yuille.A.An analysis of the elastic net approach to the travelings alesmanp roblem.Neural Computation,1989,1:348-358
[104]Stone J V.The optimal elastic net:Finding solution for the traveling salesman.In:Proceedings of International Conferenceon Artificial Neural Networks.Brighton,England:ACM Press,1992.170-174
[105]http://www.ti.com/lit/gpn/cc2420.pdf
[106]蒋杰.无线传感器网络覆盖控制研究:[博士学位论文].长沙:国防科技大学.2005.
[2]Edgar.H.Callaway.Wierless Sensor Netwokrs:Acrhitectures and Protocols.Boca Roton,USA:CRC Press,2003
[3]孙利民,李建中,陈渝,等.无线传感器网络.北京:清华大学出版社,2005
[4]Raghunathan.V,Schurgers.C,Park.S,et al.Energy-Aware Wireless Microsensor Networks.IEEE Signal Processing Magazine,2002,19(3):40-50
[5]黄武陵,艾云峰,无线传感器网络在智能交通系统中的应用,电子产品世界,2008(6):56-59
[6]吴成东,郑君刚,刘大任,等.基于无线传感器网络的智能家居网络技术研究,沈阳建筑大学学报,2005(6):78-92
[7]赵泽,崔莉,一种基于无线传感器网络的远程医疗监护系统,信息与控制,2006(2):35-38
[8]Eschenauer.L,Gligor.V.A key-management scheme fo distributed sensor networks.In:The 9th ACM Conference on Computer and Communication Security,Washington,USA:ACM Press,2002.41-47
[9]Chan.H,Perrig.A,Song.D.Random key predistribution schemes for sensor networks,In:IEEE Symposium on Research in Security and Privacy,Los Alamitos,USA:IEEE Press,2003.197-213
[10]Perrig.A,Szewczyk.R,Wen V,et al.SPINS:Security protocols for sensor networks,Wireless Networks,2002,8(5):521-534
[11]Xu Wenyuan,Wade Trappe,Zhang Yanyong.Channel surfing:Defending wireless sensor networks from interference,In:International Conference on Information Processing in Sensor Networks(IPSN2007),Massachusetts,USA:ACM Press, 2007.499-508
[12] Li Mingyan, Koutsopoulos Iordanis, Poovendran Radha. Optimal jamming attacks and network defense policies in wireless sensor networks, In: IEEE International Conference on Computer Communication(INFOCOM 2007), Alaska, USA: IEEE Press, 2007.1307-1315
[13] Traynor Patrick, Heesook Choi, Cao Guohong, et al. Establishing pair-wise keys in heterogeneous sensor networks, In: IEEE International Conference on Computer Communication(INFOCOM 2006), Barcelona, Spain: IEEE Press, 2006.78-85
[14] Yu Zhen, Guan Yong. A dynamic en-route scheme for filtering false data injectiong in wireless sensor networks. In: IEEE International Conference on Computer Communication(INFOCOM 2006), Barcelona, Spain, IEEE Press, 2006.1-12
[15] Wei Yawen, Yu Zhen, Guan Yong. Location verification algorithms for wireless sensor networks. In: International Conference on Distributed Computing Systems(ICDCS), Toronto, Canada: IEEE Press, 2007,70-70
[16] Ye Fan, Yang Hao, Liu Zhen. Cathing "Moles" in sensor networks. In: International Conference on Distributed Computing Systems(ICDCS), Toronto, Canada: IEEE Press, 2007.69-69
[17] Liu Fang, Cheng Xiuzhen, Chen Dechang. Inside attacker detection in wireless sensor networks. In: IEEE International Conference on Computer Communication (INFOCOM 2007), Alaska, USA: IEEE Press, 2007.1937-1945
[18] Vanam. T, Langendoen. K. An adaptive energy-efficient MAC protocol for wireless sensor networks. In: The 1st International Conference on Embedded Networks Sensor Systems, California, USA: ACM Press, 2003.171-180
[19] Rajendran. V, Obraczka. K, Garcia J.J. Energy-efficient, Collision-free medium access control for wireless sensor networks. In: The 1st International Conference on Embedded Networks Sensor Systems, California, USA: ACM Press, 2003.181-192
[20] Degesys Julius, Rose Ian , Batel Ankit, et al. DESYNC: Self-organizing desynchronization and TDMA on wireless sensor networks. In: International Conference on Information Processing in Sensor Networks(IPSN2007),Massachusetts, USA: ACM Press, 2007.11-20
[21] Bruck Jehoshua, Gao Jie, Jiang Anxiao. MAP : Medial axis based geometric routing in sensor networks. In: IEEE International Conference on Mobile Computing and Networking(MOBICOM2005), Cologne, Germany: IEEE Press, 2005.88-102
[22] Chiranjeeb Buragohain, Divyakant Agrawal, Subhash Suri. Power aware routing for sensor databases. In: IEEE International Conference on Computer Communications (INFOCOM2005), New York, USA: IEEE Press, 2005.1747-1757
[23] Szymon Chachulski, Michael Jennings, Sachin Katti, et al. Trading structure for randombess in wireless opportunistic routing. In: Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications, kyoto, Japan: ACM Press, 2007.169-180
[24] Zeng Bin, Wei Jun, Hu Tao. An energy-efficient data fusion protocol for wireless sensor network.In: The 10th International Conference on Information Fusion,Quebec, Canada: IEEE Press, 2007.1-7
[25] Lamborn Peter, Williams Pamela. A Data Fusion Algorithm for Large Heterogeneous Sensor Networks. In: Proceedings of the International Conference on Wireless Algorithms, Systems and Applications, Orlando, USA: IEEE Press,2007.225-232
[26] Sichitiu. ML, Chanchai Veerarittiphan. Simple accurate time synchronization for wireless sensor networks. In: IEEE Wireless Communication and Networking Conference(WCNC2003), New Orleans, USA: IEEE Press, 2003.1266-1273
[27] Hu Answol, Sergio. D. Servetto. Asymptotically optimal time synchronization in dense sensor networks. In: Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications, San Diego, USA: ACM Press,2003.1-10
[28]Maroti.M,Kusy.B,Simon.G,et al.Flodding time synchronization in wireless sensor networks.In:ACM Conference on Embedded Networks Sensor Systems (SENSYS2004),Maryland,USA:ACM Press,2004.39-49
[29]Gao.Jie,Leonidas Guibas,Nikola Milosavljevic,et al.Sparse data aggregation in sensor networks.In:Proceedings of the 6th international conference on Information processing in sensor networks,Massachusetts,USA:ACM Press,2007:430-439
[30]Yang Xiaoyan,Hock Beng Lim,Tamer.M.In-network execution of monitoring queries in sensor networks.In:Proceedings of the 2007 ACM SIGMOD international conference on Management of data,Beijing,China:ACM Press,2007:521-532
[31]Guo Longjiang,Li Yingshu,Li Jizhong.Event Query Processing Based on Data-Centric Storage in Wireless Sensor Networks.In:The 49th IEEE Globecom Technical Conference,San Francisco,USA:IEEE Press,2006:1-6
[32]Nicolescu.D,Nath.B.Ad hoc positioning system using AoA.In:IEEE International Conference on Computer Communications(INFOCOM2003),San Francisco,USA:IEEE Press,2003.1734-1743
[33]He.T,Huang.C,Blum.B.M,et al.Range-free localization schemes for lager scale sensor networks.In:Proceedings of the 9th Annual International Conference on Mobile Computing and Networking,San Diego,USA:ACM Press,2003.81-95
[34]Masoomeh Rudafshani,Suprakash Datta.Localization in wireless sensor networks.In:International Conference on Information Processing in Sensor Networks (IPSN2007),Massachusetts,USA:ACM Press,2007.51-60
[35]史永彬,叶湘滨,刘培亮.无线传感器网络技术研究现状.国外电子测量技术,2005(11):10-23
[36]杜晓明,陈岩.无线传感器网络研究现状与应用.北京工商大学学报,2008(1):41-44
[37]Warneke.B,Last.M,Liebowitz.B,et al.Smart dust:Communicating with a cubicmillimeter computer. IEEE Computer Magazine, 2001,34(1):44-51
[38] Slijepcevic. S, Potkonjak. M. Power Efficient Organization of Wireless Sensor Networks. In: IEEE International Conference on Communications, Helsinki,Finland: IEEE Press, 2001.472-476
[39] Berman. P, Calinescu. G, Shah. C, et al. Power Efficient Monitoring Management in Sensor Networks. In: Proceedings of IEEE Wireless Communication and Networking Conference(WCNC04), Atlanta, USA: IEEE Press, 2004.2329-2334
[40] Tian. D, Georganas N.D. A coverage-preserving node scheduling scheme for large wireless sensor networks. In: Proceedings of First International Workshop on Wireless Sensor Networks and Applications(WSNA02), Atlanta, USA: IEEE Press,2002.32-41.
[41] Heinzelman. W,Chandrakasan. A, Balakrishnan. H. Energy-Efficient communication protocol for wireless sensor networks. In: Proceedings of the 33rd Hawaii Int'l Conf.System Sciences.Washington:IEEE Press, 2000:300-304.
[42] Cardei. M, MacCallum. D, Cheng. X, et al. Wireless Sensor Networks with Energy Efficient Organization. Journal of Interconnection Networks, 2002(3):213-229
[43] Abrams. Z, Goel. A, Plotkin. S. Set k-cover algorithms for energy efficient monitoring in wireless sensor networks. In: Proceedings of Information Processing in Sensor Networks(IPSN2004), California, USA: ACM Press, 2003.424-432
[44] Ye. F, Zhong. G, Lu. S, et al. PEAS: A Robust Energy Conserving Protocol for Longlived Sensor Networks. In: Proceedings of 10th IEEE International Conference on Network Protocols(ICNP02), California, USA: ACM Press, 2002.200-201
[45] Ye. F, Zhong. G, Lu. S, et al. PEAS: A Robust Energy Conserving Protocol for Longlived Sensor Networks, In: Proceedings of 23rd IEEE International Conference on Distributed Systems(ICDCS03), California, USA: IEEE Press,2003.28-28
[46] Yan. T, He. T, Stankovic. J. Differentiated Surveillance Service for Sensor Networks, In: Proceedings of the 1st International Conference on Embedded Networks Sensor Systems, California, USA: ACM Press, 2003.51-62
[47] Tian. D, Georganas. N.D. A Node Scheduling Scheme for Energy Conservation in Large Wireless Sensor Networks. Journal of Wireless Communication and Mobile Computing, 2003(5):271-290
[48] Tian. D, Georganas. N.D. Connectivity Maintenance and Coverage Preservation in Wireless Sensor Networks, Ad Hoc Networks, 2005(3):744-761
[49] Zhang. M, Du. X, Nygard. K. Improving coverage performance in sensor networks by using mobile sensors. In: Proceedings of the Military Communications Conference (MILCOM2005), Atlantic, USA: 2005.3335-3341
[50] Wang. W, Srinivasan. V, Chua. K.C. Trade-offs between mobility and density for coverage in wireless sensor networks. In: Proceedings of the 13th Annual International Conference on Mobile Computing and Networking(Mobicom2007),Montreal, Canada: ACM Press, 2007.39-50
[51] Caicedon. C, Zefran. M. Energy cost of coordination algorithms for wireless mobile sensor networks. In: Proceedings of the 2005 IEEE International Conference on Networking, Sensing and Control, Tucson, USA: IEEE Press, 2005.419-424
[52] Liu. B, Brass. P, Dousse. O, et al. Mobility improves coverage of sensor networks.In: Proceedings of the 6th ACM International Symposium on Mobile Ad Hoc Networking and Computing(MobiHoc2005), Urbana-Champaign, USA: ACM Press, 2005.300-308
[53] Poduri. S, Sukhatme. G.S. Constrained coverage in mobile sensor networks. In:Proceedings of IEEE International Conference on Robotics and Automation ( ICRA2004), New Orleans, USA: IEEE Press, 2004.40-50
[54] Ghosh. A. Estimating coverage holes and enhancing coverage in mixed sensor networks. In: Proceedings of the 29th Annual IEEE Conference on Local Computer Networks(LCN2004), Tampa, USA: IEEE Press, 2004.68-76
[55] Hsin. C, Liu. M. Network Coverage Using Low Duty-Cycled Sensors: Random and Coordinated Sleep Algoruthms. In: Proceeding of the 3rd International Symposium Workshop on Information Processing in Sensor Networks(IPSN2004), California,USA: ACM Press, 2004.433-442
[56] Zhang. H, Hou. J. On Deriving the Upper Bound of Alpha-Lifetime for Large Sensor Networks. In: The 5th ACM International Symposium on Mobile Ad Hoc Networking and Computing(MobiHoc2004), Tokyo, Japan: ACM Press,2004.121-132
[57] Lu. J, Suda. K. Coverage-aware Self-scheduing in Sensor Networks. In: Proceedings of the 18th IEEE Annual Workshop on Computer Communication (CCW03), Dana Point, USA: IEEE Press, 2003.117-123
[58] Xing. G, Lu. C, Pless. R, et al. Co-grid: An Efficient Coverage Maintenance Protocol for Distributed Sensor Networks. In: Proceeding of the 3rd International Symposium Workshop on Information Processing in Sensor Networks(IPSN04),California, USA: ACM Press, 2004.414-423
[59] Chen. H, Wu. H, Tzeng. N. Grid-based Approach for Working Node Selection in Wireless Sensor Networks. In: Proceedings of IEEE International Conference on Communation(ICC04), Pairs, France: IEEE Press, 2004.3673-3678
[60] Liu. C, Wu. K, King. V. Randomized Coverage-Preserving Scheduing Schemes for Wireless Sensor Networks. In: Proceeding of IFIP International Conference on Networking, Waterloo Ontario, Canada: Springerlink Press, 2005.132-137
[61] Carbunar. B, Grama. A, Vitek. J, et al. Coverage Presevring Redundancy Elimination in Sensor Networks, In: Poreeedings of the 1st IEEE Communications Society Conference On Sensor and Ad Hoc Communications and Networks (SECON04), Santa Clara, USA: IEEE Press, 2004.377-386
[62] Boukerche. A, Fei. X, Regina. B. An energy aware coverage-preserving scheme for wireless sensors network. In: Proceedings of the 2nd ACM International Workshop(PEWASUN05), Montreal, Canada: ACM Press, 2004.205-213
[63] Carle. J, Simplot. D. Energy Efficient Area Monitoring by Sensor Networks. IEEE Computer Magazine, 2004,37(2): 40-46
[64] Carle. J, Gallais. A, Simplot. D. Preserving Area Coverage in wireless sensor networks by using surface coverage relay dominating sets. In: Proceedings of the 10th IEEE Symposium on Computers and Communications(ISCC05), Cartagena,Spain: IEEE Press, 2005.347-352
[65] Hafeeda. M, Bagheri. M. Randomized k-coverage algorithms for dense sensor networks. In: IEEE International Conference on Computer Communication (INFOCOM 2007), Alaska, USA: IEEE Press, 2007.2376-2380.
[66] Liu. Y, Liang. W. Approximate coverage in wireless sensor networks. In:Proceedings of the IEEE Conference on Local Computer Networks 30th Anniversary (LCN2005), Sydney, Australia: IEEE Press, 2005.68-75
[67] Zhang. H, Hou. J.C. Maintaining Sensing Coverage and Connectivity in Large Sensor Networks. International Journal of the Wireless Ad Hoc and Sensor Networks, 2005,1(1)89-124
[68] Wu. J, Yang. S. Coverage issue in sensor Networks with adjustable ranges. In:Proceedings of 2004 International Workshop on Mobile and Wireless Networking (WMN04), Montreal, Canada: ACM Press, 2004.61-68
[69] Wang. X, Xing. G, Zhang. Y, et al. Integrated Coverage and Connectivity Configuration in Wireless Sensor Networks. In: 1 st ACM Conference on Embedded Networked Sensor Systems, Los Angles, USA: ACM Press, 2003.28-39
[70] Liu. C, Wu. K, Xiao. Y, et al. Random coverage with guaranteed connectivity: joint scheduling for wireless sensor networks, IEEE Transactions on Parallel and Distributed Systems, 2006,17(6): 562-574.
[71] Huang. C.F, Tseng. Y.C, Wu. H.L. Distributed protocols for ensuring both coverage and connectivity of a wireless sensor network, ACM Transactions on Sensor Networks, 2007,3 (1):1-24
[72] Zhou. Z, Das. S, Gupta. H. Connected K-Coverage Problem in Sensor Networks. In:Proceedings. 13th International Conference on Computer Communications and Networks(ICCCN2004), Chiago, USA: ACM Press, 2004.373-378
[73] Gupta. H, Zhou. Z, Das. S.R, et al. Connected sensor cover: Selforganization of sensor networks for efficient query execution. IEEE Transactions on Networking,2006,14(1):55-67
[74] Zou. Y, Chakrabarty. K. A distributed coverage and connectivity-centric technique for selecting active nodes in wireless sensor networks. IEEE Transactions on Computers, 2005(54):978-991
[75] Ammari. H.M, Das. S.K. Integrated coverage and connectivity in wireless sensor networks: A two-dimensional percolation problem, IEEE Transactions on Computers, 2008,57(10): 1423-1434
[76] Funke. S, Kesselman. A, Kuhn. F, et al. Improved approximation algorithms for connected sensor cover. Wireless Networks, 2007,13 (2): 153-164
[77] Zhou. Z, Das. S. Gupta. H. Variable radii Connected Sensor Cover in Sensor Networks. In: Poreeedings of the 1st IEEE Communications Society Conference On Sensor and Ad Hoc Communications and Networks (SECON2004), Santa Clara,USA: IEEE Press, 2004.387-396
[78] Ghosh. A, Das. S.K. Distributed connected sensor cover algorithms for lattice and random deployment of nodes in dense sensor networks. In:Proceedings of the 1st IEEE/ACM International Conference on stributed Computing in Sensor Systems( DCOSS2005), Merina del Rey, Canada: IEEE Press, 2005.231-238
[79] Miorandi. D, Altaian. E. Coverage and connectivity of ad hoc networks in presence of channel randomness. In: IEEE International Conference on Computer Communications (INFOCOM2005), New York, USA: IEEE Press, 2005.491-502
[80] Alam. N, Haas. Z.J. Coverage and connectivity in three-dimensional networks. In: Proceedings of the 12th Annual International Conference on Mobile Computing and Networking(MobiCom2006), New York, USA: ACM Press, 2006.346-357
[81] Huang. C.F, Tseng. Y.C, Lo. L.C. The coverage problem in three-dimensional wireless sensor networks. In: Proceedings of the IEEE Global Telecommunications Conference, Dallas, USA: IEEE Press, 2004.3182-3186
[82] Ghosh. A, Wang. Y, Krishnamachari. B. Efficient distributed topology control in 3-dimensional wireless networks. In: Proceedings of the 3rd IEEE International Conference on Sensor and Ad hoc Communications and Networks(SECON2004),San Diego, Canada: IEEE Press, 2007.91-100
[83] Wang. B, Wang. W, Srinivasan. V, et al. Information coverage for wireless sensor networks. Communications Letters, 2005,9(11):967-969
[84] Onur. E, Ersoy. C, Delic. H, et al. Coverage in sensor networks when obstacles are present. In: Proceedings of the IEEE International Conference on Communications (ICC2006), Istanbul, Turkey: IEEE Press, 2006.4077-4082
[85] Dhillon. S, Chakrabarty. K. Sensor Placement for Effective Coverage and Surveillance in Distributed Sensor Networks. In: IEEE Wireless Communication and Networking Conference(WCNC2003), New Orleans, USA: IEEE Press,2003.1609-1614
[86] Wang. J, Zhong. N. Efficient point coverage in wireless sensor networks. Journal of Combinatorial Optimization, 2006 (11):291-304
[87] Cardei. M, Thai. M.T, Li. Y, et al. Energy-Efficient Target Coverage in Wireless Sensor Networks. In: Proceedings of the 24th conference of the IEEE Communications Society (INFOCOM2005), New York, USA: IEEE Press,2005.1976-1984
[88] Cardei. M, Du. D.Z. Improving Wireless Sensor Network Lifetime through Power Aware Organization, Wireless Networks, 2005,11(3):333-340
[89] Lu. M, Wu. J, Cardei. M. Energy-efficient connected coverage of discrete targets in wireless sensor networks. In: International Conference on Computer Networks and Mobile Computing (ICCNMC2005), Zhangjiajie, China: Springerlink Press,2005.43-52
[90] Cardei. M, Wu. J, Lu M. Maximum network lifetime in wireless sensor networks with adjustable sensing ranges. In: Proceedings of IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob2005), Montreal, Canada: IEEE Press, 2005.438-445
[91] Yang S, Dai. F, Cardei. M, et al. On connected multiple point coverage in wireless sensor networks. International Journal of Wireless Information Networks,2006.289-301.
[92] Liu. H, Wan. P, Yi. CW, et al. Maximal lifetime scheduling in sensor surveillance networks. In: Proceedings of the 24th conference of the IEEE Communications Society (INFOCOM2005), New York, USA: IEEE Press, 2005.2482-2491
[93] Liu. H, Wan P, Jia X. Maximal lifetime scheduling for k to 1 sensor target surveillance networks, Computer Networks, 2006,50(15):2839-2854.
[94] Meguerdichian. S, Koushanfar. F, Potkonjak. M. Coverage Problem in Wirelss Ad-Hoc Sensor Networks. In: Proceedings of 20th Annual Joint Conference of IEEE Computer and Communications Societies(INFOCOM2001), Anchorage, USA:IEEE Press, 2001.1380-1387
[95] Cheng. M.X, Ruan. L, Wu. W. Achieving Minimum Coverage Breach under Bandwidth Constraints in Wireless Sensor Networks. In: Proceedings of the 24th conference of the IEEE Communications Society (INFOCOM2005), New York,USA: IEEE Press, 2005.2638-2645
[96] Veltri. G, Huang. Q, Qu. G, et al. Minimal and maximal exposure path algorithms for wireless embedded sensor networks. In: Proceedings of the 1st International Conference on Embedded Networked Sensor Systems(SENSYS2003), Los Angeles,USA: ACM Press, 2003.40-50
[97]Basu Roy.S,Das.G,Das.S.K.Computing best coverage path in the presence of obstacles in a sensor field.In:Proceedings of Workshop on Algorithms and Data Structures(WADS2007),Halifax,Canada:ACM Press,2007.577-588.
[98]Kumar.S,Lai.T.H,Arora.A.Barrier coverage with wireless sensors.In:Proceedings of the 11th Annual International Conference on Mobile Computing and Networking(MobiCom2005).,New York,USA:ACM Press,2005.284-298
[99]Chen.A.,Kumar.S,Lai.T.H.Designing localized algorithms for barrier coverage.In:Proceedings of the 13th Annual International Conference on Mobile Computing and Networking(Mobicom2007),Montreal,Canada:ACM Press,2007.63-74
[100]Megerian.S,Koushanfar.F,Potkonjak.M.Worst and best-case coverage in sensor networks.IEEE Transactions on Mobile Computing,2005(4):120-128
[101]向阳,龚新高.推广模拟退火方法及其应用.物理学进展,2000,25(20):41-56
[102]Durbin.R,Willshaw.D.An analogue approach to the traveling salesman problem using an elastic net method.Nature,1987,326:689-691
[103]Durbin.R,Szeliski.R,Yuille.A.An analysis of the elastic net approach to the travelings alesmanp roblem.Neural Computation,1989,1:348-358
[104]Stone J V.The optimal elastic net:Finding solution for the traveling salesman.In:Proceedings of International Conferenceon Artificial Neural Networks.Brighton,England:ACM Press,1992.170-174
[105]http://www.ti.com/lit/gpn/cc2420.pdf
[106]蒋杰.无线传感器网络覆盖控制研究:[博士学位论文].长沙:国防科技大学.2005.
© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号 地址：北京市海淀区学院路29号 邮编：100083 电话：办公室：(+86 10)66554848；文献借阅、咨询服务、科技查新：66554700 |