无线传感网络拓扑控制若干问题研究
|
摘要
无线传感网络通常具有如下特点:大规模、自组织、传感器节点能量受限、部署环境恶劣等。这些特点决定了必须设计能量有效的协议来减少传感器节点的能耗以延长无线传感网络的寿命。拓扑控制问题作为无线传感网络中的核心问题之一,对于延长网络的生存时间、减小通信干扰、提高MAC协议和路由协议的效率以及促进数据融合、提高网络的可扩展性、可靠性、安全性等其他性能等具有重要意义。因此如何进行拓扑控制以优化拓扑结构并延长传感网络的寿命已经成为重要的研究方向。
本文主要研究能量有效的拓扑控制算法:(1)应用于静态密集部署传感网络的一种基于完全图的分簇算法(2)一种在上述分簇算法基础上加入移动节点担当网关的算法(3)应用于稀疏移动传感网络的传输功率控制算法(4)应用于大规模部署移动传感网络的分簇算法。
无线传感网络的某些应用,例如生态监护、军事侦察等,为了能够准确的对数据进行收集并保持覆盖性,通常会在监测区域部署大量冗余的静态节点。在这种情况下,为了能够延长传感网络的寿命,通常选取一定的节点保持活动,由它们构成数据传输的主干网,而其他节点在没有任务时可以进入睡眠状态,这正是层次分簇算法所应用的场合。针对分簇算法过程中的重新分簇所带来的高负载问题,本文提出了一种基于完全图的能量有效的分簇算法CGCA(Complete Graphbased Clustering Algorithm)。CGCA利用完全图中节点之间互相等价的性质,只在系统启动的时刻执行分簇算法,而在以后的重新分簇阶段,簇头只需要在每个簇的内部节点间进行轮换,而不像以前的分簇算法需要进行全局性的触发来选举新的簇头。因此CGCA从根本上消除了重新分簇所带来的“涟漪”效应。仿真试验表明:在节点密集部署的情况下,CGCA产生的消息交换个数远小于HEED(Hybrid Energy Efficient Distributed clustering)分簇算法。最后簇头均匀分布方面,CGCA也明显优于LEACH(Low-Energy Adaptive Clustering Hierarchy)分簇算法。
在一个分簇算法中,一个网关节点(gateway)除了要完成负责基本的感知数据之外,还要在相邻的簇之间承担起数据转发的任务。由于簇之间的数据流量相对较大,因此相对于普通节点来说,网关节点更容易耗尽自己的能量,因此这些网关节点容易成为系统的瓶颈(bottleneck),从而严重影响传感网络系统的性能表现。本文在CGCA分簇算法的基础上的加入了一些资源和配置丰富的移动节点来担当簇之间的网关,以把普通节点从转发簇间数据的繁重任务中解放出来,籍此达到延长传感网络寿命的目的。除此之外,由移动节点来担当网关可以显著的提高系统的稳定性和容错性,这是因为由配置丰富的移动节点代替能量受限的普通节点来担当网关可以减少系统出现故障的概率,从而可以进一步的提升系统的整体性能表现。实验表明,在密集部署传感器节点的网络中,本算法产生的消息交换个数只是传统的基于最小标号分簇算法LIC(Low Identifier Clustering)的20%左右。另外,本算法所取得的系统时间也是LEACH算法的两倍左右。
无线传感网络在军事和紧急搜救的应用促使了移动传感网络的兴起。由于这些被监控对象本身所具有的移动性,使得底层的拓扑在不断的发生变化,因此很难应用传统的拓扑控制算法或者简单的对它们改进使之适用于移动传感网络。本文提出了在给定移动网络模型VRMN(Vadant Rate Mobile Network)下的一种基于传输功率控制的拓扑控制算法,并分别给出了它的集中式和分布式版本。本算法首先求出每个节点的一跳邻居集合,然后利用类似于XTC的方法把可由较近邻居节点中继到达的最远邻居节点删除,这样在不损失连通性的前提下就可以减少节点的发射功率,从而达到节省节点能量以延长传感网络寿命的目的。理论证明,本算法是高效的,它具有O(n~3)的多项式复杂度时间。实验结果表明,本算法在减少节点传输功率和保持网络连通性方面也取得了较好的性能。
在一个大规模移动传感网络中,由于分簇算法能够形成一个层次结构以及能够较好的支持网络的可扩展性并在节点移动时能够较好的维护拓扑结构的稳定性,这就使得分簇算法比较适合于对这种大规模密集移动传感网络进行拓扑控制。本文分簇算法首先将部署区域划分成小的单元格,在每个单元格的中心位置事先指定一个节点担当簇头,其他的移动节点只需要监听簇头的"Hello"消息并通过比较消息的信号强弱就可以加入到相应的簇头中。在簇形成阶段,本文分簇算法的时间复杂度和消息复杂度均为O(N),从而较大的节省了节点的能耗并取得了较好的能量有效性。而在簇维护阶段,簇的维护是由事件触发并且异步进行,不会产生“涟漪”效应,因此本文算法能够取得一个较为稳定的簇结构以适应节点的移动和底层拓扑的变化。仿真实验表明,本文算法能够产生了较少的消息个数和较长的系统寿命。
本文的主要贡献和创新点如下:
1)针对重新分簇所带来的大量计算和通信负载以及“涟漪”效应,本文提出了一种基于完全图的分簇算法CGCA,使得重新分簇只是异步的局部触发,从而维持了簇结构的稳定性以延长系统生命期。
2)在上述分簇算法的基础上,通过加入资源丰富的移动节点来担当转发簇间数据的网关,从而使得普通节点能够集中到收集或者探测等任务上,这能够进一步的节省能量从而延长整个传感网络的工作寿命。
3)在一个给定的移动网络模型VRMN下,提出了一种多项式时间的基于功率控制的拓扑控制算法,本算法能够在保持网络连通性的前提下,减少了节点的发射功率,从而达到节省节点能量的目的。
4)在一个大规模移动传感网络中,提出了一种能量有效的分簇算法,它具有简单的簇形成和维护过程,使得节点移动可能对簇结构的影响局限在一个较小的范围内,从而形成了一个较为稳定的簇结构。
WSN(Wireless Sensor Networks) usually has the following features:large scale, self-organization,limited energy equipped sensor nodes and bad deployment environment etc,which determines that some energy efficient protocols must be designed to prolong the lifetime of WSN by reducing the energy consumption of sensor nodes.Topology control,as a core problem of WSN,has a fundamental impact on some important network parameters,such as prolonging the system lifetime of WSN, reducing signal interference,enhancing the energy efficiency of MAC and routing protocols,promoting data aggregation and enhancing the scalability,stability,and safety of WSN.As a result,how to perform topology control to optimize topology structure and prolong the WSN lifetime has been an important research topic recently.
This dissertation mainly focuses on investigating energy efficient topology control algorithms:(1) propose a complete graph-based clustering algorithm(CGCA) applied in static densely deployed sensor networks(2) introduce some resource and hardware rich mobile nodes acting as inter-cluster gateways so as to augment the aforementioned clustering algorithm(3) propose a power control based topology control algorithm used in sparse mobile sensor networks(4) propose a clustering algorithm used in large-scale deployed mobile sensor networks.
Some applications in WSN,such as ecosystem monitoring and military surveillance,often deploy large redundant sensor nodes on the monitored area to accurately perform data gathering and preserve coverage.In this situation to prolong the lifetime of WSN,some nodes keep active to form the backbone of forwarding data traffic,while other nodes can turn off their radios when having no tasks,and this is exactly where the hierarchical clustering algorithm handles.Aiming to solve the high overheads brought by re-clustering in a clustering algorithm,we propose an energy efficient complete graph-based algorithm(CGCA).By using the property that the nodes are of equivalence each other in a complete graph,CGCA is only executed at the system activation time and the cluster head role needs only to be rotated among the internal nodes in each cluster at the subsequent re-clustering phase,while the previous clustering algorithms need a global trigger to re-elect cluster heads,which incurs greatly reduced communication and computation overheads.Consequently our CGCA algorithm totally eliminates the ripple effect in re-clustering phase.The simulation experiments demonstrate that the number of exchanged message produced by CGCA is much less than that of HEED clustering algorithm in the densely deployed case.Finally, CGCA significantly outperforms LEACH algorithm in terms of evenly distributing cluster heads.
Besides performing the basic sensing data task,a gateway node is also being responsible for the forwarding the data traffic among adjacent clusters in a typical clustering algorithm.Compared with the ordinary node,a gateway is much prone to deplete its energy due to the large data traffic among inter-clusters,thus being the bottlenecks of the system and in turn degrading the senor network performance.This dissertation introduces some resource and configuration rich mobile nodes to act as inter-cluster gateways to for the purpose of liberating the ordinary nodes from the heavy forwarding inter-cluster data,thus achieving the aim of prolonging the lifetime of WSN.Furthermore,letting the mobile nodes act as gateways can significantly enhance the stability and fault-tolerance of the whole system,because substituing the configuration rich mobile nodes for the energy constrained ordinary nodes can reduce the probability of occurring system malfunction,thus further promoting the system overall performance.Extensive simulation experiments demonstrate that the number of exchanged messages produced by our algorithm is only about 20%that of the traditional identifier based clustering algorithm in a densely deployed case. Furthermore,our proposed achieves an improvement in system lifetime of factor 2 that of the LEACH in a dense sensor network.
The military and emergency rescuing applications of wireless sensor networks promote the proliferation of MSN(Mobile Sensor Networks).The changing underlying topology,due to the intrinsic mobility characteristic of monitored objects,makes it difficult to apply or adapt the traditional topology control algorithms to be applied in MSN.This dissertation proposes a power control based topology control algorithm under a given mobility model called VRMN(Variant Rate Mobile Network) and then presents its central and distributed versions respectively.In this algorithm each node first computes the one-hop neighbor set and then applies a XTC-like procedure to prune the furthest neighbor that can be reached by the relay of its closer neighbor,which incurs reducing transmitting power of each node and consequently saving power consumption to prolong the network lifetime on the basis of without impairing the network connectivity.Our algorithm obtains a polynomial time complexity of O(n~3) thus being efficient from the theoretic view and the experiments results show that our algorithm achieves comparatively better performance from the perspective of reducing node transmitting power and maintaining network connectivity.
In a large scale mobile sensor network,a clustering algorithm can form a hierarchical structure,which can better support the scalability of network and maintain the stability of topology in the presence of node movement,thus making it well suitable for the topology control problem in a large-scale densely deployed mobile sensor network environment.Our clustering algorithm first partitioned the deployment region into some small grids,for each of which a mobile node was dispatched to act as cluster head.Subsequently,all the other mobile nodes can join their corresponding cluster by monitoring and comparing the signal strength of the "Hello" messages sent from cluster heads.In the cluster formation phase,our algorithm achieves both O(N) time and message complexity.In the subsequent cluster maintenance phase,the maintenance of the cluster structure is unsynchronously event driven,thus elminiating the ripple effect.So our algorithm achives a comparatively stable cluster structure so as to be well adapt to the node's movement and underlying topology's change.Furthermore,the simulation results show that our algorithm can produce comparatively small number of messages and long system lifetime.
The contributions and novelties of this dissertation are as following:
1) Aiming to solve the large computation and communication overheads and "ripple" effect brought by re-clustering,this dissertation proposes a complete graph-based clustering algorithm,called CGCA,which makes re-clustering unsynchronized and locally triggered,for the purpose of maintaining a stable cluster structure and prolonging the system lifetime.
2) On the basis of the aforementioned algorithm,some resource rich mobile nodes are put into the sensor networks so as to act as gateways to relay the heavy inter-cluster data traffic,which can make the ordinary sensor nodes more devoted to the gathering or probing tasks and consequently further saving much energy to prolong the lifetime of the sensor networks.
3) Under a given mobility model called VRMN,this dissertation presents a power control based topology control algorithm with a polynomial time complexity,which can reduce transmitting power on a per-node basis,thus achieving the goal of saving energy,without impairing the network connectivity.
4) In a large scale mobile sensor networks,this dissertation presents a energy eifficent clustering algorithm,which has simple cluster formation and maintenance procedure.Our algorithm achieved a much stable cluster structure by limiting impact of the movement of nodes on the cluster into a local area.
本文主要研究能量有效的拓扑控制算法:(1)应用于静态密集部署传感网络的一种基于完全图的分簇算法(2)一种在上述分簇算法基础上加入移动节点担当网关的算法(3)应用于稀疏移动传感网络的传输功率控制算法(4)应用于大规模部署移动传感网络的分簇算法。
无线传感网络的某些应用,例如生态监护、军事侦察等,为了能够准确的对数据进行收集并保持覆盖性,通常会在监测区域部署大量冗余的静态节点。在这种情况下,为了能够延长传感网络的寿命,通常选取一定的节点保持活动,由它们构成数据传输的主干网,而其他节点在没有任务时可以进入睡眠状态,这正是层次分簇算法所应用的场合。针对分簇算法过程中的重新分簇所带来的高负载问题,本文提出了一种基于完全图的能量有效的分簇算法CGCA(Complete Graphbased Clustering Algorithm)。CGCA利用完全图中节点之间互相等价的性质,只在系统启动的时刻执行分簇算法,而在以后的重新分簇阶段,簇头只需要在每个簇的内部节点间进行轮换,而不像以前的分簇算法需要进行全局性的触发来选举新的簇头。因此CGCA从根本上消除了重新分簇所带来的“涟漪”效应。仿真试验表明:在节点密集部署的情况下,CGCA产生的消息交换个数远小于HEED(Hybrid Energy Efficient Distributed clustering)分簇算法。最后簇头均匀分布方面,CGCA也明显优于LEACH(Low-Energy Adaptive Clustering Hierarchy)分簇算法。
在一个分簇算法中,一个网关节点(gateway)除了要完成负责基本的感知数据之外,还要在相邻的簇之间承担起数据转发的任务。由于簇之间的数据流量相对较大,因此相对于普通节点来说,网关节点更容易耗尽自己的能量,因此这些网关节点容易成为系统的瓶颈(bottleneck),从而严重影响传感网络系统的性能表现。本文在CGCA分簇算法的基础上的加入了一些资源和配置丰富的移动节点来担当簇之间的网关,以把普通节点从转发簇间数据的繁重任务中解放出来,籍此达到延长传感网络寿命的目的。除此之外,由移动节点来担当网关可以显著的提高系统的稳定性和容错性,这是因为由配置丰富的移动节点代替能量受限的普通节点来担当网关可以减少系统出现故障的概率,从而可以进一步的提升系统的整体性能表现。实验表明,在密集部署传感器节点的网络中,本算法产生的消息交换个数只是传统的基于最小标号分簇算法LIC(Low Identifier Clustering)的20%左右。另外,本算法所取得的系统时间也是LEACH算法的两倍左右。
无线传感网络在军事和紧急搜救的应用促使了移动传感网络的兴起。由于这些被监控对象本身所具有的移动性,使得底层的拓扑在不断的发生变化,因此很难应用传统的拓扑控制算法或者简单的对它们改进使之适用于移动传感网络。本文提出了在给定移动网络模型VRMN(Vadant Rate Mobile Network)下的一种基于传输功率控制的拓扑控制算法,并分别给出了它的集中式和分布式版本。本算法首先求出每个节点的一跳邻居集合,然后利用类似于XTC的方法把可由较近邻居节点中继到达的最远邻居节点删除,这样在不损失连通性的前提下就可以减少节点的发射功率,从而达到节省节点能量以延长传感网络寿命的目的。理论证明,本算法是高效的,它具有O(n~3)的多项式复杂度时间。实验结果表明,本算法在减少节点传输功率和保持网络连通性方面也取得了较好的性能。
在一个大规模移动传感网络中,由于分簇算法能够形成一个层次结构以及能够较好的支持网络的可扩展性并在节点移动时能够较好的维护拓扑结构的稳定性,这就使得分簇算法比较适合于对这种大规模密集移动传感网络进行拓扑控制。本文分簇算法首先将部署区域划分成小的单元格,在每个单元格的中心位置事先指定一个节点担当簇头,其他的移动节点只需要监听簇头的"Hello"消息并通过比较消息的信号强弱就可以加入到相应的簇头中。在簇形成阶段,本文分簇算法的时间复杂度和消息复杂度均为O(N),从而较大的节省了节点的能耗并取得了较好的能量有效性。而在簇维护阶段,簇的维护是由事件触发并且异步进行,不会产生“涟漪”效应,因此本文算法能够取得一个较为稳定的簇结构以适应节点的移动和底层拓扑的变化。仿真实验表明,本文算法能够产生了较少的消息个数和较长的系统寿命。
本文的主要贡献和创新点如下:
1)针对重新分簇所带来的大量计算和通信负载以及“涟漪”效应,本文提出了一种基于完全图的分簇算法CGCA,使得重新分簇只是异步的局部触发,从而维持了簇结构的稳定性以延长系统生命期。
2)在上述分簇算法的基础上,通过加入资源丰富的移动节点来担当转发簇间数据的网关,从而使得普通节点能够集中到收集或者探测等任务上,这能够进一步的节省能量从而延长整个传感网络的工作寿命。
3)在一个给定的移动网络模型VRMN下,提出了一种多项式时间的基于功率控制的拓扑控制算法,本算法能够在保持网络连通性的前提下,减少了节点的发射功率,从而达到节省节点能量的目的。
4)在一个大规模移动传感网络中,提出了一种能量有效的分簇算法,它具有简单的簇形成和维护过程,使得节点移动可能对簇结构的影响局限在一个较小的范围内,从而形成了一个较为稳定的簇结构。
WSN(Wireless Sensor Networks) usually has the following features:large scale, self-organization,limited energy equipped sensor nodes and bad deployment environment etc,which determines that some energy efficient protocols must be designed to prolong the lifetime of WSN by reducing the energy consumption of sensor nodes.Topology control,as a core problem of WSN,has a fundamental impact on some important network parameters,such as prolonging the system lifetime of WSN, reducing signal interference,enhancing the energy efficiency of MAC and routing protocols,promoting data aggregation and enhancing the scalability,stability,and safety of WSN.As a result,how to perform topology control to optimize topology structure and prolong the WSN lifetime has been an important research topic recently.
This dissertation mainly focuses on investigating energy efficient topology control algorithms:(1) propose a complete graph-based clustering algorithm(CGCA) applied in static densely deployed sensor networks(2) introduce some resource and hardware rich mobile nodes acting as inter-cluster gateways so as to augment the aforementioned clustering algorithm(3) propose a power control based topology control algorithm used in sparse mobile sensor networks(4) propose a clustering algorithm used in large-scale deployed mobile sensor networks.
Some applications in WSN,such as ecosystem monitoring and military surveillance,often deploy large redundant sensor nodes on the monitored area to accurately perform data gathering and preserve coverage.In this situation to prolong the lifetime of WSN,some nodes keep active to form the backbone of forwarding data traffic,while other nodes can turn off their radios when having no tasks,and this is exactly where the hierarchical clustering algorithm handles.Aiming to solve the high overheads brought by re-clustering in a clustering algorithm,we propose an energy efficient complete graph-based algorithm(CGCA).By using the property that the nodes are of equivalence each other in a complete graph,CGCA is only executed at the system activation time and the cluster head role needs only to be rotated among the internal nodes in each cluster at the subsequent re-clustering phase,while the previous clustering algorithms need a global trigger to re-elect cluster heads,which incurs greatly reduced communication and computation overheads.Consequently our CGCA algorithm totally eliminates the ripple effect in re-clustering phase.The simulation experiments demonstrate that the number of exchanged message produced by CGCA is much less than that of HEED clustering algorithm in the densely deployed case.Finally, CGCA significantly outperforms LEACH algorithm in terms of evenly distributing cluster heads.
Besides performing the basic sensing data task,a gateway node is also being responsible for the forwarding the data traffic among adjacent clusters in a typical clustering algorithm.Compared with the ordinary node,a gateway is much prone to deplete its energy due to the large data traffic among inter-clusters,thus being the bottlenecks of the system and in turn degrading the senor network performance.This dissertation introduces some resource and configuration rich mobile nodes to act as inter-cluster gateways to for the purpose of liberating the ordinary nodes from the heavy forwarding inter-cluster data,thus achieving the aim of prolonging the lifetime of WSN.Furthermore,letting the mobile nodes act as gateways can significantly enhance the stability and fault-tolerance of the whole system,because substituing the configuration rich mobile nodes for the energy constrained ordinary nodes can reduce the probability of occurring system malfunction,thus further promoting the system overall performance.Extensive simulation experiments demonstrate that the number of exchanged messages produced by our algorithm is only about 20%that of the traditional identifier based clustering algorithm in a densely deployed case. Furthermore,our proposed achieves an improvement in system lifetime of factor 2 that of the LEACH in a dense sensor network.
The military and emergency rescuing applications of wireless sensor networks promote the proliferation of MSN(Mobile Sensor Networks).The changing underlying topology,due to the intrinsic mobility characteristic of monitored objects,makes it difficult to apply or adapt the traditional topology control algorithms to be applied in MSN.This dissertation proposes a power control based topology control algorithm under a given mobility model called VRMN(Variant Rate Mobile Network) and then presents its central and distributed versions respectively.In this algorithm each node first computes the one-hop neighbor set and then applies a XTC-like procedure to prune the furthest neighbor that can be reached by the relay of its closer neighbor,which incurs reducing transmitting power of each node and consequently saving power consumption to prolong the network lifetime on the basis of without impairing the network connectivity.Our algorithm obtains a polynomial time complexity of O(n~3) thus being efficient from the theoretic view and the experiments results show that our algorithm achieves comparatively better performance from the perspective of reducing node transmitting power and maintaining network connectivity.
In a large scale mobile sensor network,a clustering algorithm can form a hierarchical structure,which can better support the scalability of network and maintain the stability of topology in the presence of node movement,thus making it well suitable for the topology control problem in a large-scale densely deployed mobile sensor network environment.Our clustering algorithm first partitioned the deployment region into some small grids,for each of which a mobile node was dispatched to act as cluster head.Subsequently,all the other mobile nodes can join their corresponding cluster by monitoring and comparing the signal strength of the "Hello" messages sent from cluster heads.In the cluster formation phase,our algorithm achieves both O(N) time and message complexity.In the subsequent cluster maintenance phase,the maintenance of the cluster structure is unsynchronously event driven,thus elminiating the ripple effect.So our algorithm achives a comparatively stable cluster structure so as to be well adapt to the node's movement and underlying topology's change.Furthermore,the simulation results show that our algorithm can produce comparatively small number of messages and long system lifetime.
The contributions and novelties of this dissertation are as following:
1) Aiming to solve the large computation and communication overheads and "ripple" effect brought by re-clustering,this dissertation proposes a complete graph-based clustering algorithm,called CGCA,which makes re-clustering unsynchronized and locally triggered,for the purpose of maintaining a stable cluster structure and prolonging the system lifetime.
2) On the basis of the aforementioned algorithm,some resource rich mobile nodes are put into the sensor networks so as to act as gateways to relay the heavy inter-cluster data traffic,which can make the ordinary sensor nodes more devoted to the gathering or probing tasks and consequently further saving much energy to prolong the lifetime of the sensor networks.
3) Under a given mobility model called VRMN,this dissertation presents a power control based topology control algorithm with a polynomial time complexity,which can reduce transmitting power on a per-node basis,thus achieving the goal of saving energy,without impairing the network connectivity.
4) In a large scale mobile sensor networks,this dissertation presents a energy eifficent clustering algorithm,which has simple cluster formation and maintenance procedure.Our algorithm achieved a much stable cluster structure by limiting impact of the movement of nodes on the cluster into a local area.
引文
[1]Cullar D,Estrin D,Strvastava M.Overview of sensor network[J].Computer,2004,37(8):41-49.
[2]Pottie G and Kaiser W.Wireless integrated network sensors[J].Communications of ACM,2000-05,43(5).
[3]Kyildiz I,Su W,Sankasubramaniam Y,et al.Wireless Sensor networks:A Survey[J].Computer Networks,2002,(8):393-422.
[4]Chandrakasan A,Min R,Bhardwaj M,et al.Power Aware Wireless Microsensor Systems[C].In Proceedings of the ESSCIRC 2002,Florence,Italy,2002-09.
[5]Estrin D,Girod L,Pottie G,Srivastava M.Instrumenting the World with Wireless Sensor Networks[C]:ICASSP 2001:In Proceedings of the International Conference on Acoustics,Speech and Signal Processing,Salt Lake City,UT,2001-05.
[6]Hill J,Culler D.MICA:A Wireless Platform for Deeply Embedded Networks[J].IEEE Micro,2002,22(6):12-24.
[7]Pottie G J,Kaiser W J.Embedding the Internet:Wireless Integrated Network Sensors[J].Communications of the ACM,2000,43(5):51-58.
[8]Rabaey J M,Ammer M J,Silva L? et al.PicoRadio Supports Ad Hoc Ultra-Low Power Wireless Networking[J].IEEE Computer,2000,33(7):42-48.
[9]Steere D C,Baptista A,McNamee D,et al.Research Challenges in Environmental Observation and Forecasting Systems[C]:Mobicom 2000:In Proceedings of the 6th International Conference on Mobile Computing and Networking,Boston,MA,2000.
[10]Weiser M.Some Computer Science Issues in Ubiquitous Computing [J].Communications of ACM,1993,36:75-85
[11]Boriello G and Want R.Embedded Computation Meets the World Wide Web[J].Communications of theACM,2000,43(5):59-66.
[12]Burrell J,Brooke T,Beckwith R.Vineyard Computing:Sensor Networks in Agricultural Production[J].IEEE Pervasive Computing,2004,3(1):38-45.
[13]Estrin D,Govindan R,Heidemann J,et al.Next Century Challenges:Scalable Coordination in Sensor Networks[C].In Proceedings of the Fifth Annual International Conference on Mobile Computing and Networks,Seattle,Washington,DC,1999.
[14]Mainwaring A,Polastre J,Szewczyk R.Wireless Sensor Networks for Habitat Monitoring[C].In Proceedings of the 1st ACM Workshop on Wireless Sensor Networks and Applications,Atlanta,GA,2002-09.
[15]Szewczyk R,Osterweil E,Polastre J,et al.Habitat Monitoring with Sensor Networks[J].Communication of the ACM,2004,47(6):34-40.
[16]Levis P,Culler D.Mate:A Tiny Virtual Machine for Sensor Networks[C].In Proceedings of the 10~(th) International Conference on Architectural Support for Programming Languages and Operating Systems,San Jose,CA,2002-I0.
[17]Hill J,Szewczyk R,Woo A,et al.System Architecture Directions for Networked Sensors[C].In Proceedings of the 9th International Conference on Architectural Support for Programming Languages and Operating Systems,Cambridge,MA,2000:93-104.
[18]Intel StrongARM SA-1100 Microprocessor Brief Data Sheet[R].Intel product documentation,2000-08.
[19]于海斌,曾鹏,等.智能无线传感器网络系统[M].1版.北京:科学出版社,2006:6-7.
[20]孙利民,李建中,陈渝,等.无线传感器网络[M].1版.北京:清华大学出版社,2005:9-11.
[21]Green.H.Technical wave 2:the sensor revolution[EB/OL]:Business week online.[2003-8-25].http://www.businessweek.com/magazine/content/03_34/b3846622.ht ml
[22]Werff.T.J.Ten emerging technologies that will change the world[R].MIT's Technology review.[2003-2].http://www.princeton.edu/～chouweb/choubio_papers/MIT_review.pdf.
[23]李善仓,张克旺.无线传感器网络原理与应用[M].1版.北京:机械工业出版社,2008-3.
[24]Poduri S,Pattern S,Krishnamachari B,and et al.A unifying framework for tunable topology control in sensor networks[R].CRES-05-004,University of Southern California,2005:1-15.
[25]张学,陆桑璐,陈贵海,等.无线传感器网络的拓扑控制[J].软件学报,2007,18(4):943-954.
[26]KIROUSIS L,KRANAKIS E,KRIZANC D,and et al.Power consumption in packet radio networks[J].Theoret.Comput.Sci.243,2000:289-305.
[27]Rodoplu V,Meng T.Minimum energy mobile wireless networks[J].IEEE Journal on Selected Areas in Communications,1999,17:1333-1344.
[28]LI N,HOU J,SHA L.Design and analysis of an MST-based topology control algorithm[C].In Proceedings of the IEEE Infocom.2003:1702-1712.
[29]Cormen T,Leiserson C,Rivest R,et al.算法导论[M].2nd ed.潘金贵,顾铁成,李成法,等.译.北京:机械工业出版社,2006-9:350-352.
[30]Li L,Halpern J,Bahl P,et al.A cone-based distributed topology control algorithm for wireless multi-hop networks[J].IEEE/ACM Trans,on Networking,2005,13(1):147-159.
[31]Santi P.Topology control in wireless ad hoc and sensor networks[J].ACM Computing Surveys,2005-6,37(2):164-194.
[32]Li L,Halpern J,Bahl P,et al.Analysis of Cone-Based Distributed TopologyControl Algorithm for Wireless Multi-hop Networks[C].In Proceedings of the 20th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing,Newport,RI,2001-08.
[33]Wattenhofer R,Li L,Bahl P,et al.Distributed Topology Control for Power Efficient Operation in Multihop Wireless Ad Hoc Networks.In Proceedings of IEEE Infocom,Anchorage,AK,2001-04.
[34]BORBASH S,JENNINGS E.Distributed topology control algorithm for multihop wireless networks[C].In Proceedings of the IEEE International Joint Conference on Neural Networks,2002:355-360.
[35]XUE F,KUMAR P.The number of neighbors needed for connectivity of wireless networks[J].Wireless Networks.The Netherlands:Kluwer Academic Publishers,2004,(10):169-181.
[36]BLOUGH D.,LEONCINI M.,RESTA G,et al.The k-neighbors protocol for symmetric topology control in ad hoc networks[C].In Proceedings of the ACM MobiHoc'03,2003:141-152.
[37]Kubisch M,Karl H,Wolisz A,et al.Distributed algorithms for transmission power control in wireless sensor networks[C].IEEE WCNC 2003,New Orleans,Louisiana,2003-3-16-2003-3-20.
[38]Yu J and Chong P.A survey of clustering schemes for mobile ad hoc networks[J].IEEE Communications First Quarter 2005,7(1):32-48.
[39]Basagni I,Chlamtac,Farago A.A generalized clustering algorithm for peer-to-peer networks[C].In Proceedings of Workshop on Algorithmic Aspects of Communication (satellite workshop of ICALP),1997-07.
[40]Amis A,Prakash R,Vuong T,et al.MaxMin D-Cluster Formation in Wireless Ad Hoc Networks[C].In Proceedings of IEEE Conference on Computer Communications,1999-03.
[41]Wu J,Li H.On Calculating Connected Dominating Set for Efficient Routing in Ad Hoc Wireless Networks[C].In Proc.3rd Int'l.Wksp.Discrete Algorithms and Methods for Mobile Computing and Communication,1999:7-14.
[42]Chen Y,Liestman A.Approximating Minimum Size Weakly-Connected Dominating Sets for Clustering Mobile Ad Hoc Networks[C].In Proc 3rd ACM Int'l.Symp.Mobile Ad Hoc Net.& Comp.,2002-06:165-172.
[43]Chiang C,Wu H,Liu W,et al.Routing in Clustered Multihop,Mobile Wireless Networks with Fading Channel[C].In Proc IEEE SICON'97,1997-04:197-211.
[44]Baker D,Ephremides A.A distributed algorithm for organizing mobile radio telecommunication networks[C]In:Proceedings of the 2nd International Conference on Distributed Computer Systems,1981-04:476-483.
[45]Baker D,Ephremides A.The architectural organization of a mobile radio network via a distributed algorithm[J].IEEE Transactions on Communications.1981-11,29(11):1694-1701.
[46]Ephremides A,Wieselthier J,Baker D.A design concept for reliable mobile radio networks with frequency hopping signaling[C].In Proceedings of IEEE,1987,75(1):56-73
[47]Gerla M,Tsai J.Multicluster,mobile,multimedia radio network[J].Wireless Networks,1995,1(3):255-265.
[48]Lin C,Gerla M.A distributed control scheme in multi-hop packet radio networks for voice/data traffic support[C].In Proceedings of IEEE GLOBECOM,1995:1238-1242.
[49]Lin C,Gerla M.A distributed architecture for multimedia in dynamic wireless networks[C].In:Proceedings of IEEE GLOBECOM,1995:1468-1472.
[50]Yu J,Chong P.3hBAC (3-hop Between Adjacent Clusterheads):a Novel Non-overlapping Clustering Algorithm for Mobile Ad Hoc Networks[C].In Proc.IEEE Pacrim'03,2003-08,1:318-321.
[51]Yu J,Chang P.An efficient clustering scheme for large and dense mobile ad hoc networks(MANETs)[J].Computer Communications,2006,30:5-16.
[52]Basu P,Khan N,Little T.A Mobility Based Metric for Clustering in Mobile Ad Hoc Networks[C].In Proc IEEE ICDCSW' 01,2001-04:413-418.
[53]MaDonald A,Znati T.A Mobility-based Frame Work for Adaptive Clustering in Wireless Ad Hoc Networks[J].IEEE Journal on Selected Areas in Communications,1999-08,17(8):1466-1487.
[54]Heinzelman W,Chandrakasan A,Balakrishnan H.Energy-Efficient Communication Protocol for Wireless Microsensor Networks[C].In Proceedings of the 33rd Hawaii International Conference on System Sciences,Hawaii,HI,2000-01:174-185.
[55]Heinzelman W,Chandrakasan A,Balakrishnan H.An Application-Specific Protocol Architecture for Wireless Microsensor Networks[J].IEEE Transactions on Wireless Networking,2002,1(4):660-670.
[56]Amis A,Prakash R.Load-Balancing Clusters in Wireless Ad Hoc Networks[C].In Proc 3rd IEEE ASSET'00,2000-03:25-32.
[57]Chatterjee M,Das S,Turgut D.WCA:A Weighted Clustering Algorithm for Mobile Ad hoc Networks[J].Journal of Cluster Computing,2005,5:193-204.
[58]Ohta T,Inoue S,Kakuda Y.An Adaptive Multihop Clustering Scheme for Highly Mobile Ad Hoe Networks[C].In Proc.6th ISADS'03,2003-04:293-300.
[59]Younis O,Fahmy S.HEED:A Hybrid,Energy-Efficient,Distributed Clustering Approach for Ad-Hoc Sensor Networks[J].IEEE TRANSACTIONS ON MOBILE COMPUTING,2004,3(4):366-379.
[60]Moussaoui O,Ksentini A,Naimi M,et al.A novel clustering algorithm for efficient energy saving in wireless sensor networks[C].In Proc of 2006 International Symposium on Computer Networks,2006-07-31:66-72.
[61]Wattenhofer R,Zollinger A.XTC:A Practical Topology Control Algorithm for Ad-Hoc Networks[C].In Proc of 18th International Parallel and Distributed Processing Symposium,2004-04:216-223.
[62]刘林峰,刘业.一种无线传感器网络拓扑的启发式分簇控制算法[J].计算机研究与发展,2008,45(7):1099-1105.
[63]陈力军,毛莺池,陈道蓄,等.平均度约束的无线传感器网络拓扑控制[J].计算机学报,2007,30(9):1544-1550.
[64]王良民,马建峰,王超.无线传感器网络拓扑的容错度与入侵度[J].电子学报,2006,34(8):1446-1451.
[65]刘林峰,金杉.无线传感器网络的拓扑控制算法综述[J].计算机科学,2008,35(3):6-12.
[66]Brualdi R.组合数学[M].4版.冯舜玺,罗平,裴伟东,译.北京:机械工业出版社,2006-05:371-373.
[67]任彦,张思东,张宏科.无线传感器网络中覆盖控制理论与算法.软件学报[J],2006,17(3):422-433.
[68]Wang X,Xing G,Zhang Y,et al.Integrated coverage and connectivity configuration in wireless sensor networks.In Proceedings of the 1st international conference on Embedded networked sensor systems.New York:ACM Press,2003:28-39.
[69]Huang C,Tseng Y,Lo L.The coverage problem in three-dimensional wireless sensor networks.In:Shah R,ed.Proc.of the GLOBECOM.Dallas:IEEE Press,2004,5:3182-3186.
[70]Pottie G,Kaiser W.W'treless integrated network sensors[J].Communications of ACM,2000-05,43(5):51-58.
[71]Raghunathan V,Schurgers C,Sung P,et al.Energy-Aware Wireless Microsensor Networks[J].IEEE Signal Processing Magazine,2002-03,19(2):40-50.
[72]Tang J,Xue G,Zhang W.Interference-Aware Topology Control and QoS Routing in Multi-Channel Wireless Mesh Networks[C].MobiHoc'05,Illinois,USA,2005-5:68-77.
[73]He Y,Zeng Y.Interfrence-Aware Tology Control Problem in Wireless Sensor Networks[C].In proceedings of 6th Intermational Coference on ITS Teleconunuiiications,2006:969-972.
[74]Gupta P,Kumar P.The capacity of wireless networks[J].IEEE Transaction on Information Theory,2000,46(2):388-404.
[75]Lin E,Rabaey J,Wolisz A.Power-Efficient Rendez-vous Schemes for Dense Wireless Sensor Networks[C].In Proceedings of IEEE International Conference on Communications,Paris,France,2004-6,7:3769-3776.
[76]Schurgers C,Tsiatsis V,Ganeriwal S,et al.Optimizing Sensor Networks in the Energy-Latency-Density Design Space[J].IEEE Transactions on Mobile Computing,2002,1(1):70-80.
[77]Ye W,Heidemann J,Estrin D.An Energy-Efficient MAC Protocol for Wireless Sensor Networks[C].In Proceedings of INFOCOM 2002.New York:IEEE Press,2002-6,3:1567-1576.
[78]Polastre J,Hill J,Culler D.Versatile low power media access for wireless sensor networks[C].In Proceedings of 2nd international conference on Embedded Networked Sensor Systems,Baltimore,MD,2004-11:95-107.
[79]KaLrl H,Willig A.无线传感器网络协议与体系结构[M].邱天爽,唐洪,李婷,等译.北京:电子工业出版社,2007-1:18-19.
[80]Camp T,Boleng J,Davies V.A Survey of Mobility Models for Ad Hoc Network Research[J].Wireless Communication & Mobile Computing(WCMC):Special issue on Mobile Ad Hoe Networking:Research,Trends and Applications,2002,2(5):483-502.
[81]Johnson D,Maltz D.Dynamic source routing in ad hoe wireless networks[J].Mobile Computing.The Netherlands:Kluwer Academic Publishers,1996:153-181.
[82]Johansson P,Larsson T,Hedman N,et al.Routing protocols for mobile ad-hoc networksa comparative performance analysis[C].In Proceedings of the ACM/IEEE International Conference on Mobile Computing and Networking,1999:195-206.
[83]Bettstetter C,Wagner C.The Spatial Node Distribution of the Random Waypoint Model[C].Proc of 1st German Workshop on Mobile Ad-Hoc Networks(WMAN'02),2002:1-18.
[84]Broch J,Maltz D,Johnson D,et al.Multi-hop wireless ad hoc network routing protocols[C].In Proceedings of the ACM/IEEE International Conference on Mobile Computing and Networking,1998:85-97.
[85]Royer E,Smith P,Moser L.An analysis of the optimum node density for ad hoc mobile networks[C].In Proceedings of the IEEE International Conference on Communications (ICC),2001,3:857-861.
[86]V.Davies.Evaluating mobility models within an ad hoc network[D].Golden,Colorado,Colorado School of Mines,2000.
[87]Varge A.The OMNET++ discrete event simulation system[C].In Proceeding of the European Simulation Multiconference.Pargue,2001:319-324.
[88]NS2[EB/OL].http://www.isi.edu/nsnam/ns/,2009
[89]李建波,黄刘生,徐宏力,等.一种密集部署传感器网络的分簇算法[J].计算机研究与发展,2008,45(7):1106-1114.
[90]Xu Y,Heidemann J,Estrin D.Geography-Informed Energy Conservation for Ad Hoc Routing[C].In Proceedings of the 7th Annual International Conference on Mobile Computing and Networking,Rome,Italy,2001-7:70-84.
[91]安辉耀,卢锡城,彭伟,等.MANET中基于簇的多路径动态源路由(CMDSR)[J].计算机研究与发展,2006,43(3):381-388.
[92]Li Q,Rus D.Sending messages to mobile users in disconnected ad-hoc wireless networks[C].In Proceedings of 6th ACM Annual International Conference on Mobile Computing and Networking,Boston,MA,2000-8:44-55.
[93]Grossglauser M,Tse D.Mobility increases the capacity of ad-hoc wireless networks[J].IEEE/ACM Transactions on Networking,2002-8,10(4):477-486.
[94]Chatzigiannakis I,Nikoletseas S.An adaptive compulsory protocol for basic communications in highly changing ad-hoc mobile networks[C].In Proceedings of the International Parallel and Distributed Processing Symposium,Fort Lauderdale,FL,2002-4:193-202.
[95]Wang W,Srinivasan V,Chua K.Using mobile relays to prolong the lifetime of wireless sensor networks[C].In proceedings of Mobicom'05,2005-8:270-283.
[96]Gandham S,Dawande M,Prakash R,el al.Energy efficient schemes for wireless sensor networks with multiple mobile base stations[C].In Proceedings of IEEE Globecom 2003,San Francisco,CA,2003-12,1:377-381.
[97]Wang Z,Basagni S,Melachrinoudis E,et al.Exploiting sink mobility for maximizing sensor networks lifetime[C].In Proceedings of the 38th Hawaii International Conference on System Sciences (H1CSS),2005,9:287a-287a.
[98]Luo J,Hubaux J.Joint mobility and routing for lifetime elongation in wireless sensor networks[C].In Proceedings of the 24th IEEE INFOCOM,2005-03,3:1735-1746.
[99]Rahimi M,Shah H,Sukhatme G,et al.Energy harvesting in mobile sensor networks[C].In Proceedings of the IEEE International Conference on Robotics and Automation,Taipei,Taiwan,September 2003.
[100]Howard A,Mataric M,Sukhatme G Self-deployment algorithm for mobile sensor networks[J].Autonomous Robots Special Issue on Intelligent Embedded Systems,2002,13(2):113-126.
[101]Shah R,Roy S,Jain S,et al.Data MULEs:Modeling a three-tier architecture for sparse sensor networks[C].In Proceedings of the First IEEE International Workshop on Sensor Network Protocols and Applications,SNPA 2003,Anchorage,AK,2003-5-11:30-41.
[102]Li J,Huang L,Wang G A Novel Clustering Algorithm by Using Mobile Gateways in Densely Deployed Sensor Networks[C].In proceedings of International Conference on Information and Automation,Zhangjiajie,China,2008-06:1553-1559.
[103]Dantu K,Rahimi M,Shah H,et al.Robomote:Enabling Mobility In Sensor Networks[C].In Proceedings of IEEE IPSN'05,2005-04:404-409.
[104]Ling Qing and Tian Zhi.Impact of mobility on topology control of wireless sensor networks[C].In proceedings of Wireless Communications,Networking and Mobile Computing,2007:2483-2486.
[105]Wu J,Dai F.Mobility control and its applications in mobile ad hoc nerworks[J].IEEE Network,2004-07,18(4):30-35.
[106]Wu J,Dai F.Mobility-Sensitive Topology Control in Mobile Ad Hoc Networks[J].IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS,2006-06,17(6):522-535.
[107]Zhao L.Topology control for mobile ad hoc networks[D].Newark,Delaware:University of Delaware,2007:9-10.
[108]Bettstetter C,Resta G,Santi P:The node distribution of the random waypoint mobility model for wirelss ad hoc networks[J].IEEE Transactions on Mobile Computing.2003,2:257-269.
[109]Blough D,Resta G Santi P.A statical analysis of the long-run node spatial distribution in mobile ad hoc networks [J].Wireless Networks,2004,10:543-554.
[110]Navidi W,Camp T.Stationary distributions for the random waypoint mobility model[J].IEEE Transactions on Mobile Computing,2004,3:99-108.
[111]Santi P.The critical transmitting range for connectivity in mobile ad hoc networks [J].IEEE Transactions on Mobile Computing.2005,4:310-317
[112]Zhao L,Lloyd E.Distributed Topology Control for Stationary and Mobile Ad Hoc Networks[C].In Proc.of 3rd IEEE International Conference on Mobile Ad-hoc and Sensor Systems (MASS'06),2006-10:521-524.
[113]Wu J,Dai F.Mobility sensitive topology control in mobile ad hoc networks[J],IEEE Transactions on Parallel and Distributed Systems,2006-06,17(6):522-535.
[114]Siripongwutikorn P,Thipakorn B.Mobility-aware topology control in mobile ad hoc networks [J].Computer Communications,2008,31:3521-3532.
[115]Zhao L,Lloyd E,Ravi S.Topology Control for Constant Rate Mobile Networks[C].In Proceeding of IEEE GLOBECOM,2006-11:1-6.
[116]Ramanathan R,Rosales-Hain R.Topology control of multihop wireless networks using transmit power adjustment[C].In Proceedings of IEEE INFOCOM 2000,2000-03:404-413.
[117]Okabe,Atsuyuki,Miller,et al.Exact Computational Methods for Calculating Distances Between Objects in a Cartographic Database[J].Cartography and Geographic Information Science,1996-10,23(4):180-195.
[118]Robert G,Gallager.Distributed minimum hop algorithms[R].Technical Report LIDS-P-1175,Laborator for Information and Decision Systems,Massachusetts Institute of Technology,Cambridge,1982-01.
[119]Xu.K,Hong.X and Gerla M.An ad hoc network with mobile backbones[C].In proceedings of ICC'02,2002,5:3138-3143.
[120]Santi P.Topology control in wireless ad hoc and sensor networks [M].1st ed.United States:John Wiley&Sons,2005.
[121]Farag'o A.Scalable analysis and design of ad hoc networks via random graph theory[C].In Proceeding of ACM DIAL-M 02,Atlanta,GA,2002:43-50.
[122]Dousse O,Baccelli F,Thiran P.Impact of interferences on connectivity in ad hoc networks[C].In Proceeding of IEEE Infocom 2003,San Francisco,CA,2003:1724-1733.
[123]Narayanaswamy S,Kawadia V,Sreenivas R,et al.Power control in ad hoc networks:theory,architecture,algorithm and implementation of the compow protocol[C].In Proceeding of European Wireless 2002,Florence,2002:156-162.
[124]Burkhart M,Rickenbach V,Wattenhofer R,et al.Does topology control reduce interference?[C].In Proceeding of ACM MobiHoc '04,Lausanne,2004:9-19.
[125]MeyerAufDerHeide F,Schindelhauer C,Grunewald M.Congestion,dilation,and energy in radio networks[C].In Proceeding of ACM Symposium on Parallel Algorithms and Architectures (SPAA),Winnipeg,Manitoba,Canada,2002:10-13.
[2]Pottie G and Kaiser W.Wireless integrated network sensors[J].Communications of ACM,2000-05,43(5).
[3]Kyildiz I,Su W,Sankasubramaniam Y,et al.Wireless Sensor networks:A Survey[J].Computer Networks,2002,(8):393-422.
[4]Chandrakasan A,Min R,Bhardwaj M,et al.Power Aware Wireless Microsensor Systems[C].In Proceedings of the ESSCIRC 2002,Florence,Italy,2002-09.
[5]Estrin D,Girod L,Pottie G,Srivastava M.Instrumenting the World with Wireless Sensor Networks[C]:ICASSP 2001:In Proceedings of the International Conference on Acoustics,Speech and Signal Processing,Salt Lake City,UT,2001-05.
[6]Hill J,Culler D.MICA:A Wireless Platform for Deeply Embedded Networks[J].IEEE Micro,2002,22(6):12-24.
[7]Pottie G J,Kaiser W J.Embedding the Internet:Wireless Integrated Network Sensors[J].Communications of the ACM,2000,43(5):51-58.
[8]Rabaey J M,Ammer M J,Silva L? et al.PicoRadio Supports Ad Hoc Ultra-Low Power Wireless Networking[J].IEEE Computer,2000,33(7):42-48.
[9]Steere D C,Baptista A,McNamee D,et al.Research Challenges in Environmental Observation and Forecasting Systems[C]:Mobicom 2000:In Proceedings of the 6th International Conference on Mobile Computing and Networking,Boston,MA,2000.
[10]Weiser M.Some Computer Science Issues in Ubiquitous Computing [J].Communications of ACM,1993,36:75-85
[11]Boriello G and Want R.Embedded Computation Meets the World Wide Web[J].Communications of theACM,2000,43(5):59-66.
[12]Burrell J,Brooke T,Beckwith R.Vineyard Computing:Sensor Networks in Agricultural Production[J].IEEE Pervasive Computing,2004,3(1):38-45.
[13]Estrin D,Govindan R,Heidemann J,et al.Next Century Challenges:Scalable Coordination in Sensor Networks[C].In Proceedings of the Fifth Annual International Conference on Mobile Computing and Networks,Seattle,Washington,DC,1999.
[14]Mainwaring A,Polastre J,Szewczyk R.Wireless Sensor Networks for Habitat Monitoring[C].In Proceedings of the 1st ACM Workshop on Wireless Sensor Networks and Applications,Atlanta,GA,2002-09.
[15]Szewczyk R,Osterweil E,Polastre J,et al.Habitat Monitoring with Sensor Networks[J].Communication of the ACM,2004,47(6):34-40.
[16]Levis P,Culler D.Mate:A Tiny Virtual Machine for Sensor Networks[C].In Proceedings of the 10~(th) International Conference on Architectural Support for Programming Languages and Operating Systems,San Jose,CA,2002-I0.
[17]Hill J,Szewczyk R,Woo A,et al.System Architecture Directions for Networked Sensors[C].In Proceedings of the 9th International Conference on Architectural Support for Programming Languages and Operating Systems,Cambridge,MA,2000:93-104.
[18]Intel StrongARM SA-1100 Microprocessor Brief Data Sheet[R].Intel product documentation,2000-08.
[19]于海斌,曾鹏,等.智能无线传感器网络系统[M].1版.北京:科学出版社,2006:6-7.
[20]孙利民,李建中,陈渝,等.无线传感器网络[M].1版.北京:清华大学出版社,2005:9-11.
[21]Green.H.Technical wave 2:the sensor revolution[EB/OL]:Business week online.[2003-8-25].http://www.businessweek.com/magazine/content/03_34/b3846622.ht ml
[22]Werff.T.J.Ten emerging technologies that will change the world[R].MIT's Technology review.[2003-2].http://www.princeton.edu/～chouweb/choubio_papers/MIT_review.pdf.
[23]李善仓,张克旺.无线传感器网络原理与应用[M].1版.北京:机械工业出版社,2008-3.
[24]Poduri S,Pattern S,Krishnamachari B,and et al.A unifying framework for tunable topology control in sensor networks[R].CRES-05-004,University of Southern California,2005:1-15.
[25]张学,陆桑璐,陈贵海,等.无线传感器网络的拓扑控制[J].软件学报,2007,18(4):943-954.
[26]KIROUSIS L,KRANAKIS E,KRIZANC D,and et al.Power consumption in packet radio networks[J].Theoret.Comput.Sci.243,2000:289-305.
[27]Rodoplu V,Meng T.Minimum energy mobile wireless networks[J].IEEE Journal on Selected Areas in Communications,1999,17:1333-1344.
[28]LI N,HOU J,SHA L.Design and analysis of an MST-based topology control algorithm[C].In Proceedings of the IEEE Infocom.2003:1702-1712.
[29]Cormen T,Leiserson C,Rivest R,et al.算法导论[M].2nd ed.潘金贵,顾铁成,李成法,等.译.北京:机械工业出版社,2006-9:350-352.
[30]Li L,Halpern J,Bahl P,et al.A cone-based distributed topology control algorithm for wireless multi-hop networks[J].IEEE/ACM Trans,on Networking,2005,13(1):147-159.
[31]Santi P.Topology control in wireless ad hoc and sensor networks[J].ACM Computing Surveys,2005-6,37(2):164-194.
[32]Li L,Halpern J,Bahl P,et al.Analysis of Cone-Based Distributed TopologyControl Algorithm for Wireless Multi-hop Networks[C].In Proceedings of the 20th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing,Newport,RI,2001-08.
[33]Wattenhofer R,Li L,Bahl P,et al.Distributed Topology Control for Power Efficient Operation in Multihop Wireless Ad Hoc Networks.In Proceedings of IEEE Infocom,Anchorage,AK,2001-04.
[34]BORBASH S,JENNINGS E.Distributed topology control algorithm for multihop wireless networks[C].In Proceedings of the IEEE International Joint Conference on Neural Networks,2002:355-360.
[35]XUE F,KUMAR P.The number of neighbors needed for connectivity of wireless networks[J].Wireless Networks.The Netherlands:Kluwer Academic Publishers,2004,(10):169-181.
[36]BLOUGH D.,LEONCINI M.,RESTA G,et al.The k-neighbors protocol for symmetric topology control in ad hoc networks[C].In Proceedings of the ACM MobiHoc'03,2003:141-152.
[37]Kubisch M,Karl H,Wolisz A,et al.Distributed algorithms for transmission power control in wireless sensor networks[C].IEEE WCNC 2003,New Orleans,Louisiana,2003-3-16-2003-3-20.
[38]Yu J and Chong P.A survey of clustering schemes for mobile ad hoc networks[J].IEEE Communications First Quarter 2005,7(1):32-48.
[39]Basagni I,Chlamtac,Farago A.A generalized clustering algorithm for peer-to-peer networks[C].In Proceedings of Workshop on Algorithmic Aspects of Communication (satellite workshop of ICALP),1997-07.
[40]Amis A,Prakash R,Vuong T,et al.MaxMin D-Cluster Formation in Wireless Ad Hoc Networks[C].In Proceedings of IEEE Conference on Computer Communications,1999-03.
[41]Wu J,Li H.On Calculating Connected Dominating Set for Efficient Routing in Ad Hoc Wireless Networks[C].In Proc.3rd Int'l.Wksp.Discrete Algorithms and Methods for Mobile Computing and Communication,1999:7-14.
[42]Chen Y,Liestman A.Approximating Minimum Size Weakly-Connected Dominating Sets for Clustering Mobile Ad Hoc Networks[C].In Proc 3rd ACM Int'l.Symp.Mobile Ad Hoc Net.& Comp.,2002-06:165-172.
[43]Chiang C,Wu H,Liu W,et al.Routing in Clustered Multihop,Mobile Wireless Networks with Fading Channel[C].In Proc IEEE SICON'97,1997-04:197-211.
[44]Baker D,Ephremides A.A distributed algorithm for organizing mobile radio telecommunication networks[C]In:Proceedings of the 2nd International Conference on Distributed Computer Systems,1981-04:476-483.
[45]Baker D,Ephremides A.The architectural organization of a mobile radio network via a distributed algorithm[J].IEEE Transactions on Communications.1981-11,29(11):1694-1701.
[46]Ephremides A,Wieselthier J,Baker D.A design concept for reliable mobile radio networks with frequency hopping signaling[C].In Proceedings of IEEE,1987,75(1):56-73
[47]Gerla M,Tsai J.Multicluster,mobile,multimedia radio network[J].Wireless Networks,1995,1(3):255-265.
[48]Lin C,Gerla M.A distributed control scheme in multi-hop packet radio networks for voice/data traffic support[C].In Proceedings of IEEE GLOBECOM,1995:1238-1242.
[49]Lin C,Gerla M.A distributed architecture for multimedia in dynamic wireless networks[C].In:Proceedings of IEEE GLOBECOM,1995:1468-1472.
[50]Yu J,Chong P.3hBAC (3-hop Between Adjacent Clusterheads):a Novel Non-overlapping Clustering Algorithm for Mobile Ad Hoc Networks[C].In Proc.IEEE Pacrim'03,2003-08,1:318-321.
[51]Yu J,Chang P.An efficient clustering scheme for large and dense mobile ad hoc networks(MANETs)[J].Computer Communications,2006,30:5-16.
[52]Basu P,Khan N,Little T.A Mobility Based Metric for Clustering in Mobile Ad Hoc Networks[C].In Proc IEEE ICDCSW' 01,2001-04:413-418.
[53]MaDonald A,Znati T.A Mobility-based Frame Work for Adaptive Clustering in Wireless Ad Hoc Networks[J].IEEE Journal on Selected Areas in Communications,1999-08,17(8):1466-1487.
[54]Heinzelman W,Chandrakasan A,Balakrishnan H.Energy-Efficient Communication Protocol for Wireless Microsensor Networks[C].In Proceedings of the 33rd Hawaii International Conference on System Sciences,Hawaii,HI,2000-01:174-185.
[55]Heinzelman W,Chandrakasan A,Balakrishnan H.An Application-Specific Protocol Architecture for Wireless Microsensor Networks[J].IEEE Transactions on Wireless Networking,2002,1(4):660-670.
[56]Amis A,Prakash R.Load-Balancing Clusters in Wireless Ad Hoc Networks[C].In Proc 3rd IEEE ASSET'00,2000-03:25-32.
[57]Chatterjee M,Das S,Turgut D.WCA:A Weighted Clustering Algorithm for Mobile Ad hoc Networks[J].Journal of Cluster Computing,2005,5:193-204.
[58]Ohta T,Inoue S,Kakuda Y.An Adaptive Multihop Clustering Scheme for Highly Mobile Ad Hoe Networks[C].In Proc.6th ISADS'03,2003-04:293-300.
[59]Younis O,Fahmy S.HEED:A Hybrid,Energy-Efficient,Distributed Clustering Approach for Ad-Hoc Sensor Networks[J].IEEE TRANSACTIONS ON MOBILE COMPUTING,2004,3(4):366-379.
[60]Moussaoui O,Ksentini A,Naimi M,et al.A novel clustering algorithm for efficient energy saving in wireless sensor networks[C].In Proc of 2006 International Symposium on Computer Networks,2006-07-31:66-72.
[61]Wattenhofer R,Zollinger A.XTC:A Practical Topology Control Algorithm for Ad-Hoc Networks[C].In Proc of 18th International Parallel and Distributed Processing Symposium,2004-04:216-223.
[62]刘林峰,刘业.一种无线传感器网络拓扑的启发式分簇控制算法[J].计算机研究与发展,2008,45(7):1099-1105.
[63]陈力军,毛莺池,陈道蓄,等.平均度约束的无线传感器网络拓扑控制[J].计算机学报,2007,30(9):1544-1550.
[64]王良民,马建峰,王超.无线传感器网络拓扑的容错度与入侵度[J].电子学报,2006,34(8):1446-1451.
[65]刘林峰,金杉.无线传感器网络的拓扑控制算法综述[J].计算机科学,2008,35(3):6-12.
[66]Brualdi R.组合数学[M].4版.冯舜玺,罗平,裴伟东,译.北京:机械工业出版社,2006-05:371-373.
[67]任彦,张思东,张宏科.无线传感器网络中覆盖控制理论与算法.软件学报[J],2006,17(3):422-433.
[68]Wang X,Xing G,Zhang Y,et al.Integrated coverage and connectivity configuration in wireless sensor networks.In Proceedings of the 1st international conference on Embedded networked sensor systems.New York:ACM Press,2003:28-39.
[69]Huang C,Tseng Y,Lo L.The coverage problem in three-dimensional wireless sensor networks.In:Shah R,ed.Proc.of the GLOBECOM.Dallas:IEEE Press,2004,5:3182-3186.
[70]Pottie G,Kaiser W.W'treless integrated network sensors[J].Communications of ACM,2000-05,43(5):51-58.
[71]Raghunathan V,Schurgers C,Sung P,et al.Energy-Aware Wireless Microsensor Networks[J].IEEE Signal Processing Magazine,2002-03,19(2):40-50.
[72]Tang J,Xue G,Zhang W.Interference-Aware Topology Control and QoS Routing in Multi-Channel Wireless Mesh Networks[C].MobiHoc'05,Illinois,USA,2005-5:68-77.
[73]He Y,Zeng Y.Interfrence-Aware Tology Control Problem in Wireless Sensor Networks[C].In proceedings of 6th Intermational Coference on ITS Teleconunuiiications,2006:969-972.
[74]Gupta P,Kumar P.The capacity of wireless networks[J].IEEE Transaction on Information Theory,2000,46(2):388-404.
[75]Lin E,Rabaey J,Wolisz A.Power-Efficient Rendez-vous Schemes for Dense Wireless Sensor Networks[C].In Proceedings of IEEE International Conference on Communications,Paris,France,2004-6,7:3769-3776.
[76]Schurgers C,Tsiatsis V,Ganeriwal S,et al.Optimizing Sensor Networks in the Energy-Latency-Density Design Space[J].IEEE Transactions on Mobile Computing,2002,1(1):70-80.
[77]Ye W,Heidemann J,Estrin D.An Energy-Efficient MAC Protocol for Wireless Sensor Networks[C].In Proceedings of INFOCOM 2002.New York:IEEE Press,2002-6,3:1567-1576.
[78]Polastre J,Hill J,Culler D.Versatile low power media access for wireless sensor networks[C].In Proceedings of 2nd international conference on Embedded Networked Sensor Systems,Baltimore,MD,2004-11:95-107.
[79]KaLrl H,Willig A.无线传感器网络协议与体系结构[M].邱天爽,唐洪,李婷,等译.北京:电子工业出版社,2007-1:18-19.
[80]Camp T,Boleng J,Davies V.A Survey of Mobility Models for Ad Hoc Network Research[J].Wireless Communication & Mobile Computing(WCMC):Special issue on Mobile Ad Hoe Networking:Research,Trends and Applications,2002,2(5):483-502.
[81]Johnson D,Maltz D.Dynamic source routing in ad hoe wireless networks[J].Mobile Computing.The Netherlands:Kluwer Academic Publishers,1996:153-181.
[82]Johansson P,Larsson T,Hedman N,et al.Routing protocols for mobile ad-hoc networksa comparative performance analysis[C].In Proceedings of the ACM/IEEE International Conference on Mobile Computing and Networking,1999:195-206.
[83]Bettstetter C,Wagner C.The Spatial Node Distribution of the Random Waypoint Model[C].Proc of 1st German Workshop on Mobile Ad-Hoc Networks(WMAN'02),2002:1-18.
[84]Broch J,Maltz D,Johnson D,et al.Multi-hop wireless ad hoc network routing protocols[C].In Proceedings of the ACM/IEEE International Conference on Mobile Computing and Networking,1998:85-97.
[85]Royer E,Smith P,Moser L.An analysis of the optimum node density for ad hoc mobile networks[C].In Proceedings of the IEEE International Conference on Communications (ICC),2001,3:857-861.
[86]V.Davies.Evaluating mobility models within an ad hoc network[D].Golden,Colorado,Colorado School of Mines,2000.
[87]Varge A.The OMNET++ discrete event simulation system[C].In Proceeding of the European Simulation Multiconference.Pargue,2001:319-324.
[88]NS2[EB/OL].http://www.isi.edu/nsnam/ns/,2009
[89]李建波,黄刘生,徐宏力,等.一种密集部署传感器网络的分簇算法[J].计算机研究与发展,2008,45(7):1106-1114.
[90]Xu Y,Heidemann J,Estrin D.Geography-Informed Energy Conservation for Ad Hoc Routing[C].In Proceedings of the 7th Annual International Conference on Mobile Computing and Networking,Rome,Italy,2001-7:70-84.
[91]安辉耀,卢锡城,彭伟,等.MANET中基于簇的多路径动态源路由(CMDSR)[J].计算机研究与发展,2006,43(3):381-388.
[92]Li Q,Rus D.Sending messages to mobile users in disconnected ad-hoc wireless networks[C].In Proceedings of 6th ACM Annual International Conference on Mobile Computing and Networking,Boston,MA,2000-8:44-55.
[93]Grossglauser M,Tse D.Mobility increases the capacity of ad-hoc wireless networks[J].IEEE/ACM Transactions on Networking,2002-8,10(4):477-486.
[94]Chatzigiannakis I,Nikoletseas S.An adaptive compulsory protocol for basic communications in highly changing ad-hoc mobile networks[C].In Proceedings of the International Parallel and Distributed Processing Symposium,Fort Lauderdale,FL,2002-4:193-202.
[95]Wang W,Srinivasan V,Chua K.Using mobile relays to prolong the lifetime of wireless sensor networks[C].In proceedings of Mobicom'05,2005-8:270-283.
[96]Gandham S,Dawande M,Prakash R,el al.Energy efficient schemes for wireless sensor networks with multiple mobile base stations[C].In Proceedings of IEEE Globecom 2003,San Francisco,CA,2003-12,1:377-381.
[97]Wang Z,Basagni S,Melachrinoudis E,et al.Exploiting sink mobility for maximizing sensor networks lifetime[C].In Proceedings of the 38th Hawaii International Conference on System Sciences (H1CSS),2005,9:287a-287a.
[98]Luo J,Hubaux J.Joint mobility and routing for lifetime elongation in wireless sensor networks[C].In Proceedings of the 24th IEEE INFOCOM,2005-03,3:1735-1746.
[99]Rahimi M,Shah H,Sukhatme G,et al.Energy harvesting in mobile sensor networks[C].In Proceedings of the IEEE International Conference on Robotics and Automation,Taipei,Taiwan,September 2003.
[100]Howard A,Mataric M,Sukhatme G Self-deployment algorithm for mobile sensor networks[J].Autonomous Robots Special Issue on Intelligent Embedded Systems,2002,13(2):113-126.
[101]Shah R,Roy S,Jain S,et al.Data MULEs:Modeling a three-tier architecture for sparse sensor networks[C].In Proceedings of the First IEEE International Workshop on Sensor Network Protocols and Applications,SNPA 2003,Anchorage,AK,2003-5-11:30-41.
[102]Li J,Huang L,Wang G A Novel Clustering Algorithm by Using Mobile Gateways in Densely Deployed Sensor Networks[C].In proceedings of International Conference on Information and Automation,Zhangjiajie,China,2008-06:1553-1559.
[103]Dantu K,Rahimi M,Shah H,et al.Robomote:Enabling Mobility In Sensor Networks[C].In Proceedings of IEEE IPSN'05,2005-04:404-409.
[104]Ling Qing and Tian Zhi.Impact of mobility on topology control of wireless sensor networks[C].In proceedings of Wireless Communications,Networking and Mobile Computing,2007:2483-2486.
[105]Wu J,Dai F.Mobility control and its applications in mobile ad hoc nerworks[J].IEEE Network,2004-07,18(4):30-35.
[106]Wu J,Dai F.Mobility-Sensitive Topology Control in Mobile Ad Hoc Networks[J].IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS,2006-06,17(6):522-535.
[107]Zhao L.Topology control for mobile ad hoc networks[D].Newark,Delaware:University of Delaware,2007:9-10.
[108]Bettstetter C,Resta G,Santi P:The node distribution of the random waypoint mobility model for wirelss ad hoc networks[J].IEEE Transactions on Mobile Computing.2003,2:257-269.
[109]Blough D,Resta G Santi P.A statical analysis of the long-run node spatial distribution in mobile ad hoc networks [J].Wireless Networks,2004,10:543-554.
[110]Navidi W,Camp T.Stationary distributions for the random waypoint mobility model[J].IEEE Transactions on Mobile Computing,2004,3:99-108.
[111]Santi P.The critical transmitting range for connectivity in mobile ad hoc networks [J].IEEE Transactions on Mobile Computing.2005,4:310-317
[112]Zhao L,Lloyd E.Distributed Topology Control for Stationary and Mobile Ad Hoc Networks[C].In Proc.of 3rd IEEE International Conference on Mobile Ad-hoc and Sensor Systems (MASS'06),2006-10:521-524.
[113]Wu J,Dai F.Mobility sensitive topology control in mobile ad hoc networks[J],IEEE Transactions on Parallel and Distributed Systems,2006-06,17(6):522-535.
[114]Siripongwutikorn P,Thipakorn B.Mobility-aware topology control in mobile ad hoc networks [J].Computer Communications,2008,31:3521-3532.
[115]Zhao L,Lloyd E,Ravi S.Topology Control for Constant Rate Mobile Networks[C].In Proceeding of IEEE GLOBECOM,2006-11:1-6.
[116]Ramanathan R,Rosales-Hain R.Topology control of multihop wireless networks using transmit power adjustment[C].In Proceedings of IEEE INFOCOM 2000,2000-03:404-413.
[117]Okabe,Atsuyuki,Miller,et al.Exact Computational Methods for Calculating Distances Between Objects in a Cartographic Database[J].Cartography and Geographic Information Science,1996-10,23(4):180-195.
[118]Robert G,Gallager.Distributed minimum hop algorithms[R].Technical Report LIDS-P-1175,Laborator for Information and Decision Systems,Massachusetts Institute of Technology,Cambridge,1982-01.
[119]Xu.K,Hong.X and Gerla M.An ad hoc network with mobile backbones[C].In proceedings of ICC'02,2002,5:3138-3143.
[120]Santi P.Topology control in wireless ad hoc and sensor networks [M].1st ed.United States:John Wiley&Sons,2005.
[121]Farag'o A.Scalable analysis and design of ad hoc networks via random graph theory[C].In Proceeding of ACM DIAL-M 02,Atlanta,GA,2002:43-50.
[122]Dousse O,Baccelli F,Thiran P.Impact of interferences on connectivity in ad hoc networks[C].In Proceeding of IEEE Infocom 2003,San Francisco,CA,2003:1724-1733.
[123]Narayanaswamy S,Kawadia V,Sreenivas R,et al.Power control in ad hoc networks:theory,architecture,algorithm and implementation of the compow protocol[C].In Proceeding of European Wireless 2002,Florence,2002:156-162.
[124]Burkhart M,Rickenbach V,Wattenhofer R,et al.Does topology control reduce interference?[C].In Proceeding of ACM MobiHoc '04,Lausanne,2004:9-19.
[125]MeyerAufDerHeide F,Schindelhauer C,Grunewald M.Congestion,dilation,and energy in radio networks[C].In Proceeding of ACM Symposium on Parallel Algorithms and Architectures (SPAA),Winnipeg,Manitoba,Canada,2002:10-13.