带有能量补给的异构无线传感器网络拓扑控制算法

针对当前算法主要对拓扑构建或拓扑维护单独研究的问题,提出了一种将两个过程组合的拓扑控制算法,可以适应于通信和能量异构的网络。拓扑构建以较少的通信开销构建连通支配集,而拓扑维护由sink节点基于时间、能量或故障机制执行局部或全局修复策略以节约能量。理论分析和仿真实验证实,算法能以较少的时间和通信开销构建拓扑并延长网络生命时间。     

无线传感器网络拓扑控制策略研究

节能设计是无线传感器网络的首要设计目标,拓扑控制是实现该目标的重要技术之一,其主要目标是在保证网络连通和覆盖的前提下剔除不必要的通信链路,降低节点能耗和减少通信干扰,为MAC协议和路由协议的顺利执行提供基础。文中对传感器网络拓扑控制策略进行了的分析。最后针对目前传感器节点成本仍然很高这一特点,通过仿真得出了在节点随机配置的情况下,保证网络连通和覆盖所需的至少节点数目。并通过仿真分析证明了方案的可行性。     

IMECN：一种新的无线传感器网络拓扑控制算法

 拓扑控制策略对减小无线传感器网络中节点的能量消耗,延长网络的生命期具有重要意义. 在已有的拓扑控制算法中,有代表性的是SMECN.本文在分析SMECN拓扑控制算法的缺点的基 础上,提出了一种新的拓扑控制算法—IMECN.IMECN利用极坐标中的极角,巧妙地将区域覆盖问题转化为角度叠加问题,通过判断多个圆心角的叠加和是否等于2π传输范围是否覆盖其直接传输区域.最后,我们理论分析了IMECN的计算复杂度,仿真分析了IMECN的节能特性.     

无线传感器网络拓扑控制分析

无线传感器网络的拓扑控制对网络的性能有很大影响。拓扑控制的目标是用最小的能量维持网络拓扑。目前,对拓扑控制算法的研究主要分为集中式和分布式两种。文章简要介绍了无线传感器网络中拓扑控制研究的意义,总结了无线传感器网络的拓扑结构及现有的一些拓扑控制算法,最后探讨了存在的问题和今后的发展方向。     

一种主动均衡节点能耗的无线传感器网络拓扑控制算法

无线传感器网络中网络拓扑的动态调整对于提高路由协议和MAC协议的效率,延长网络的生存期,提高网络通信效率等方面具有重要的作用.本文在分析了一些拓扑控制算法的基础上,提出了一种新的层次型拓扑生成算法,该算法引入了时间门限值和节点剩余能量两个参数,在解决能耗不均衡问题上采取相对主动的方法.能够有效地均衡网络节点的能耗并延长网络的生存周期.     

带休眠算法的无线传感器网络MAC协议

由于无线传感器网络中每个传感器节点的能量有限,所以需要有效的MAC协议来保持能量的高效利用。在MAC协议中引入休眠算法是其中一种重要的节能方式。现有的带休眠算法的无线传感器网络MAC协议已有很多种,主要分为2大类:一类是以S-MAC协议为代表的基于休眠/监听排程方案来达到节能目的的MAC协议;另一类是以WiseMAC为代表的基于低功率信道检测方案的MAC协议。对现有的主要几种有代表性的带休眠算法的无线传感器网络MAC协议进行了描述,分析了它们各自的优缺点,并进行了对比和总结。     

一种基于博弈论的无线传感器网络拓扑控制算法

无线传感器网络对节能有着很高的要求,拓扑控制能够优化网络拓扑,提高无线信道的空间复用率,是提高无线传感器网络能量效率的有效方法.文中提出了-种基于博弈论的无线传感器网络拓扑控制算法,设计了-个与节点度和发射功率有关的收益函数,使拓扑控制博弈存在纳什均衡,网络总收益函数最大,网络的能量效率最高.     

无线传感器网络SoC休眠唤醒机制的设计实现

在网络节点SoC中常用的低功耗策略是提供休眠唤醒支持.首先分析了电路功耗产生机理的基础上,采用关闭时钟和关闭电源的两种不同的休眠工作模式及为实现它们的双电源供应结构,讨论了其中的支持休眠唤醒机制的供电模块设计、数据保持和隔离设计和MAC时钟恢复问题,最后利用可配置的协处理器和双振荡器设计以实现缩短唤醒时间.     

无线传感器网络拓扑结构研究

随着处理技术、存储技术以及无线传输技术的不断发展,由体积小、重量轻、价格低的无线传感器节点所组成的传感器网络已经充分具备了感知客观事物及自然现象,随时随地为用户提供精确信息的能力。通过对于星状网、网状网和混合网等几种常用传感器网络拓扑结构的比较,以及针对这些拓扑结构所形成的网络寿命的仿真,说明了对于常用的基站距离远、节点密度大的传感器网络,分层式的拓扑结构能够大大的节省网络能量,延长网络寿命,改善网络性能。     

无线传感器网络中终端节点的休眠算法

针对无线传感器网络中节点能量有限等特点,提高能量利用效率和延长网络寿命是无线传感器网络设计的目标。由于终端节点只负责数据采集,不需要转发其它节点的数据,因此可以减少终端节点的空闲侦听时间,从而进入休眠状态。仿真结果验证了所提方案的能量消耗低于传统非休眠方案的能量消耗,该休眠算法能有效延长网络的生存时间。     

A Cooperative Nearest Neighbours Topology Control Algorithm for Wireless Ad Hoc Networks

In this article, we introduce a simple distributed algorithm that assigns appropriate individual transmission powers to devices in a wireless ad hoc network. In contrast to many other proposed algorithms, it does without special hardware. It requires only local neighbourhood information and therefore avoids flooding information throughout the network. Finally, the cooperative nature of the algorithm avoids that devices cause excessive interference by using unnecessarily high transmission powers. By means of simulation, we show that the topologies created by this algorithm without any global knowledge are as effective as topologies resulting from a good choice of a common transmission power (which would require global knowledge) in terms of the achievable throughput. This work was supported in part by the German Federal Ministry of Education and Research (BMBF) as part of the IPonAir project.     

基于局域世界的WSN拓扑加权演化模型

 无标度加权网络模型,反映了现实网络的存在形式和动力学特征,是无线传感网络建模和拓扑演化的有效研究工具.本文基于局域世界理论提出一种不均匀成簇的无线传感网络拓扑动态加权演化模型,考虑节点能量,通信流量和距离等因素,对边权重和节点强度进行了定义,同时研究了拓扑生长对边权重分布的影响.实验证明演化所得网络节点度,强度和边权重均服从幂律分布,结合已有理论成果可知,该拓扑不仅继承了无权网络较高的鲁棒性和抗毁性,同时降低了节点发生相继故障的几率,增强了无线传感网络的同步能力.     

基于无线传感器网络的跨层拥塞控制协议

无线传感器网络(WSN)中由拥塞引起的大量分组重传以及重传多次失败后的分组丢弃会导致较长的时延、较高的分组丢失率和较多的能量消耗.为了准确探测和控制网络拥塞,提出了一种基于跨层设计的拥塞控制协议,即上行拥塞控制(UCC)协议.该协议利用节点在媒质接人控制(MAC)层中未占用的缓冲器区间大小和所预测的通信流量作为该节点的...     

Fault-Tolerant and 3-Dimensional Distributed Topology Control Algorithms in Wireless Multi-hop Networks

The topology of a multi-hop wireless network can be controlled by varying the transmission power at each node. The life-time of such networks depends on battery power at each node. This paper presents a distributed fault-tolerant topology control algorithm for minimum energy consumption in multi-hop wireless networks. This algorithm is an extension of cone-based topology control algorithm [19, 12]. The main advantage of this algorithm is that each node decides on its power based on local information about the relative angle of its neighbors and as a result of these local decisions, a fault-tolerant connected network is formed on the nodes. It is done by preserving the connectivity of a network upon failing of, at most, k nodes (k is a constant) and simultaneously minimize the transmission power at each node to some extent. In addition, simulations are studied to support the effectiveness of this algorithm. Finally, it is shown how to extend this algorithm to 3-dimensions. An extended abstract version of this paper appeared in the 11th IEEE International Conference on Computer Communications and Networks(ICCCN02). Mohsen Bahramgiri born in 1979, recieved the Bachelor's degree in Mathematical Sciences from Sharif University of Technology, Tehran, Iran in 2000. He is now a PhD candidate in Mathematics Department at Massachusetts Institute of Technology. His research interests include Symplectic Hodge Theory on Higher dimentional Geometry, Kahler Geometry, Mathematical Physics and Geometric Analysis on one hand, and algorithmic Graph Theory and Combinatorics on the other hand. MohammadTaghi Hajiaghayi received the Bachelor's degree in computer engineering from Sharif University of Technology in 2000. He received the Master's degree in Computer Science from the University of Waterloo in 2001. Since 2001, he is a Ph.D. candidate in Computer Science and Artificial Intelligence Laboratory at the Massachusetts Institute of Technology. During his Ph.D. studies, he also worked at the IBM T.J. Watson Research Center (Department of Mathematical Sciences) and at the Microsoft Research (Theory group). His research interests are algorithmic graph theory, combinatorial optimizations, distributed and mobile computing, computational geometry and embeddings, game theory and combinatorial auctions, and random structures and algorithms. Vahab S. Mirrokni received the Bachelor's degree in computer engineering from Sharif University of Technology, Tehran, Iran in 2001. Since 2001, he is a Ph.D. candidate in Computer Science and Artificial Intelligence Laboratory at the Massachusetts Institute of Technology. During his Ph.D. studies, he also worked at the Bell-Laboratories (Networking Center and Department of Fundamental Mathematics). His research interests include approximation algorithms, combinatorial optimization, computational game theory, mobile computing, network mannagement, and algorithmic graph theory.     

无线传感器网络突发感知的拥塞控制协议(英文)

In monitoring Wireless Sensor Networks(WSNs),the traffic usually has bursty characteristics when an event occurs.Transient congestion would increase delay and packet loss rate severely,which greatly reduces network performance.To solve this problem,we propose a Burstiness-aware Congestion Control Protocol(BCCP) for wireless sensor networks.In BCCP,the backoff delay is adopted as a congestion indication.Normally,sensor nodes work on contention-based MAC protocol(such as CSMA/CA).However,when congestion occur...     

Experimental Evaluation of Topology Control and Synchronization for In-Building Sensor Network Applications

While multi-hop networks consisting of 100s or 1000s of inexpensive embedded sensors are emerging as a means of mining data from the environment, inadequate network lifetime remains a major impediment to real-world deployment. This paper describes several applications deployed throughout our building that monitor conference room occupancy and environmental statistics and provide access to room reservation status. Because it is often infeasible to locate sensors and display devices near power outlets, we designed two protocols that allow energy conservation in a large class of sensor network applications. The first protocol, Relay Organization (ReOrg), is a topology control protocol which systematically shifts the network’s routing burden to energy-rich nodes, exploiting heterogeneity. The second protocol, Relay Synchronization (ReSync), is a MAC protocol that extends network lifetime by allowing nodes to sleep most of the time, yet wake to receive packets. When combined, ReOrg and ReSync lower the duty cycle of the nodes, extending network lifetime. To our knowledge, this research provides the first experimental testbed evaluation of energy-aware topology control integrated with energy-saving synchronization. Using a 54-node testbed, we demonstrate an 82–92% reduction in energy consumption, depending on traffic load. By rotating the burden of routing, our protocols can extend network lifetime by 5–10 times. Finally, we demonstrate that a small number of wall-powered nodes can significantly improve the lifetime of a battery-powered network. W. Steven Conner is a Wireless Network Architect in the Communications Technology Lab, Intel Research and Development. He currently leads a team developing self-configuring wireless mesh networking technology and is an active participant in IEEE 802.11 standards development. His current research interests include wireless mesh networking, sensor networks, and network self-configuration protocols. He received B.S. and M.S. degrees from the University of Arizona. Jasmeet Chhabra received B.E. (1996) and M.S. (1999) degrees from University of Delhi and University of Maryland, College Park, respectively. Since 1999 he has been a researcher in the Communications Technology Lab, Intel Research and Development. His current research interests include sensor networks, ubiquitous computing, mesh networks and security. Mark Yarvis received B.S. (1991), M.S. (1998), and Ph.D. (2001) degrees in computer science from the University of California, Los Angeles. Since 2001, he has been a Senior Researcher in the Communications Technology Lab, Intel Research and Development. He is currently the principle investigator of the Intel Research Heterogeneous Sensor Networking project. His research interests include heterogeneous systems, sensor networks, and pervasive and mobile computing. He is a member of IEEE and ACM. WWW: Lakshman Krishnamurthy manages the radio networks initiative in the Intel Corporate Technology Group and is also the principal investigator of the EcoSense wireless sensor network Strategic Research Project. He leads research efforts into new wireless mesh protocols and techniques to provide ease of use and improve performance of wireless networks. As part of the EcoSense project, Lakshman is driving wireless sensing into Intel fabs by piloting a preventative maintenance application. Currently, he also serves on the program committees of the ACM SenSyS and IEEE SECOM conferences. Lakshman received a Ph.D in computer science from the University of Kentucky and a BE in instrumentation technology from the University of Mysore, India.This revised version was published online in August 2005 with a corrected cover date.