基于不均等分层分簇的无线传感器网络协议

针对不均等分簇协议中节点竞选半径和簇头的选取机制存在缺陷问题,提出了不均等分层分簇协议,将网络覆盖区域进行分层处理,降低了簇头簇内负担,提高了能量使用效率,并采用Matlab软件进行了仿真实验。仿真结果表明,UHC协议有效降低了簇内节点密度,且延长了网络使用寿命。     

一种基于分簇的无线传感器网络MAC协议

本文提出了一种基于分簇结构的无线传感器网络MAC协议.在基于层次式路由协议的分簇网络结构中,通过综合基于竞争和基于时分复用协议的优缺点,将时间划分为交替的随机访问和调度访问两个阶段,在随机访问阶段簇内节点采用CSMA/CA实现无线信道共享.在调度访问阶段,节点根据簇首分配的时隙实现数据无冲突通信.在簇与簇之间采用FDMA避免信道干扰实现网络的扩展.分析和仿真结果表明本协议在能量效率、时间同步和网络扩展上都有所改进.     

基于网格分簇的无线传感器网络节能算法

无线传感器网络中,能量消耗问题一直最受人们关注.为了节省网络能量,针对现有算法存在的冗余节点过多以及能量利用率较低等问题,在以往算法的基础上,提出了一种基于网格分簇的节能算法,即基于网格分簇的无线传感器网络节能算法EABGC(Energy-saving Algorithm Based on Grid Clustering).该算法采用虚拟网格和贪婪算法等来节约网络能量.通过仿真实验,该算法与LEACH协议相比,能减少网络的能量消耗,从而达到节能的目的.EABGC算法,能有效地降低网络消耗,实现节能效果.     

分簇型无线传感器网络时间同步机制的研究

提出了一种基于分簇型网络结构的时间同步算法。算法的主要思想是通过在簇建立阶段利用LEACH优化算法优化网络拓扑结构,降低网络的跳数,从而降低了时间同步精度由于跳数增加而导致的误差积累,为时间同步算法提供一个良好的网络结构。在LEACH优化算法中,簇首选取机制融入簇首节点的剩余能量和密度因子,并且提出了助理簇首节点用以均衡簇首节点的能量消耗。同时在时间同步阶段,采用双向时间同步机制和单向广播时间机制。实验仿真证明,提出的时间同步算法降低了网路的跳数,提高了时间同步精度,降低了节点的能量消耗,提高了网路的运行时间,具有一定的实用价值。     

基于权值的无线传感器网络分簇算法

综述了无线传感器网络路由算法的主要成果,但重点分析更具有能量有效性的分簇路由算法,对各种算法的主要思想进行了性能评价,提出了一种新的算法.     

一种改进的无线传感器网络分簇路由协议

针对无线传感器网络中节点能量受限的特征,提出了ILEACH(improved-LEACH)分簇路由协议,达到延长网络生存时间的目的,该分簇路由协议在簇头选取时,充分考虑了节点的剩余能量;簇形成时利用了距离阈值的约束来优化分簇方案;数据收集阶段,根据节点的权值在簇头节点之间建立到基站的路由树,利用NS2仿真软件对LEACH和ILEACH协议进行仿真、比较,结果显示ILEACH具有良好的性能.     

基于博弈的大规模无线传感器网络分簇算法

合理的分簇方式能够有效延长大规模无线传感器网络(LS-WSN)的寿命,从而降低其部署使用成本。当前很多WSN分簇的研究均假设节点均匀分布,这与实际应用中的大规模WSN有所差距。该文针对节点非均匀分布的大规模WSN,提出了一种分簇算法。该算法在基于蜂窝结构虚拟网格的位置分簇之后,引入博弈理论设计分簇调整流程,使网络达到各簇中节点数尽量均匀的分簇状态。理论分析和仿真结果证明,通过该方法进行分簇,可以有效均衡各个簇中的节点数,从而延长网络有效寿命。     

无线传感器网络分簇路由协议研究

在无线传感器网络中,分簇型路由在路由协议中占据重要的地位,该协议方便拓扑结构管理,能源利用率高,数据融合简单。文章从簇头生成、簇形成和簇路由3个角度对典型的分簇路由算法LEACH,HEED,EEUC,PEGASIS进行了系统描述,从网络生命周期和节点存活数量等方面,对比了其优缺点,结合该领域的研究现状,指出了未来研究的方向。     

无线传感器网络路由分簇协议研究

无线传感器网络与传统网络的特点不同,且与人们日常生活应用息息相关。无线传感器网络不能利用传统的路由协议,网络层的路由技术在无线传感器网络体系结构中非常重要。数据融合简单、拓扑管理方便、能量利用高效是分簇路由具有的优点,是当前研究非常热门的路由技术。文章分析了无线传感器网络分簇路由概念,着重对无线传感网络路由分簇协议的分类和协议系统进行分析,为路由无线传感器网络路由分簇协议的进一步研究提供参考。     

无线传感器网络分簇算法研究

对无线传感器网络分簇算法中的簇头选择标准和算法执行过程进行总结和归纳。     

无线传感器网络的自组织成簇算法

异构传感器网络是一种能量有限且分布不均衡的网络,负载均衡和能量有效是此网络路由算法的一个挑战。现提出的自组织成簇算法能够有效增加传感器网络的稳定周期,算法基于传感器节点的剩余能量和通讯能耗选择适合的簇头节点。与经典的成簇算法LEACH和SET比较,本算法能够更好实现负载均衡,并极大地提高传感器网络的稳定周期。     

基于分簇的有效无线传感器网络密钥管理方案

针对现有无线传感器网络密钥管理中计算量过大、存储空间过多和网络安全问题,在分簇结构无线传感器网络基础上,提出一种新的密钥管理方案,它通过将已存储的密钥部分地转化为即使被攻击者截获也无影响的特殊信息,来获取更加良好的安全性,同时又不降低网络的连通性。通过仿真与其他算法进行性能对比,结果显示这种方案具有更好的性能。     

Energy-balanced unequal clustering protocol for wireless sensor networks

Clustering provides an effective way to prolong the lifetime of wireless sensor networks.One of the major issues of a clustering protocol is selecting an optimal group of sensor nodes as the cluster heads to divide the network.Another is the mode of inter-cluster communication.In this paper,an energy-balanced unequal clustering(EBUC)protocol is proposed and evaluated.By using the particle swarm optimization(PSO)algorithm,EBUC partitions all nodes into clusters of unequal size,in which the clusters closer to the base station have smaller size.The cluster heads of these clusters can preserve some more energy for the inter-cluster relay traffic and the 'hot-spots' problem can be avoided.For inter-cluster communication,EBUC adopts an energy-aware multihop routing to reduce the energy consumption of the cluster heads.Simulation results demonstrate that the protocol can efficiently decrease the dead speed of the nodes and prolong the network lifetime.     

Node correlation clustering algorithm for wireless multimedia sensor networks based on overlapped FoVs

In this paper, a clustering algorithm is proposed based on the high correlation among the overlapped field of views for the wireless multimedia sensor networks. Firstly, by calculating the area of the overlapped field of views （FoVs） based on the gird method, node correlations have been obtained. Then, the algorithm utilizes the node correlations to partition the network region in which there are high correlation multimedia sensor nodes. Meanwhile, in order to minimize the energy consumption for transmitting images, the strategy of the cluster heads election is proposed based on the cost estimation, which consists of signal strength and residual energy as well as the node correlation. Simulation results show that the proposed algorithm can balance the energy consumption and extend the network lifetime effectively.     

Pareto-optimal clustering scheme using data aggregation for wireless sensor networks

The presence of cluster heads (CHs) in a clustered wireless sensor network (WSN) leads to improved data aggregation and enhanced network lifetime. Thus, the selection of appropriate CHs in WSNs is a challenging task, which needs to be addressed. A multicriterion decision-making approach for the selection of CHs is presented using Pareto-optimal theory and technique for order preference by similarity to ideal solution (TOPSIS) methods. CHs are selected using three criteria including energy, cluster density and distance from the sink. The overall network lifetime in this method with 50% data aggregation after simulations is 81% higher than that of distributed hierarchical agglomerative clustering in similar environment and with same set of parameters. Optimum number of clusters is estimated using TOPSIS technique and found to be 9–11 for effective energy usage in WSNs.     

Optimal load balanced clustering in homogeneous wireless sensor networks

Balancing the load among sensor nodes is a major challenge for the long run operation of wireless sensor networks. When a sensor node becomes overloaded, the likelihood of higher latency, energy loss, and congestion becomes high. In this paper, we propose an optimal load balanced clustering for hierarchical cluster‐based wireless sensor networks. We formulate the network design problem as mixed‐integer linear programming. Our contribution is 3‐fold: First, we propose an energy aware cluster head selection model for optimal cluster head selection. Then we propose a delay and energy‐aware routing model for optimal inter‐cluster communication. Finally, we propose an equal traffic for energy efficient clustering for optimal load balanced clustering. We consider the worst case scenario, where all nodes have the same capability and where there are no ways to use mobile sinks or add some powerful nodes as gateways. Thus, our models perform load balancing and maximize network lifetime with no need for special node capabilities such as mobility or heterogeneity or pre‐deployment, which would greatly simplify the problem. We show that the proposed models not only increase network lifetime but also minimize latency between sensor nodes. Numerical results show that energy consumption can be effectively balanced among sensor nodes, and stability period can be greatly extended using our models.     

Controlled sink mobility for prolonging wireless sensor networks lifetime

This paper demonstrates the advantages of using controlled mobility in wireless sensor networks (WSNs) for increasing their lifetime, i.e., the period of time the network is able to provide its intended functionalities. More specifically, for WSNs that comprise a large number of statically placed sensor nodes transmitting data to a collection point (the sink), we show that by controlling the sink movements we can obtain remarkable lifetime improvements. In order to determine sink movements, we first define a Mixed Integer Linear Programming (MILP) analytical model whose solution determines those sink routes that maximize network lifetime. Our contribution expands further by defining the first heuristics for controlled sink movements that are fully distributed and localized. Our Greedy Maximum Residual Energy (GMRE) heuristic moves the sink from its current location to a new site as if drawn toward the area where nodes have the highest residual energy. We also introduce a simple distributed mobility scheme (Random Movement or RM) according to which the sink moves uncontrolled and randomly throughout the network. The different mobility schemes are compared through extensive ns2-based simulations in networks with different nodes deployment, data routing protocols, and constraints on the sink movements. In all considered scenarios, we observe that moving the sink always increases network lifetime. In particular, our experiments show that controlling the mobility of the sink leads to remarkable improvements, which are as high as sixfold compared to having the sink statically (and optimally) placed, and as high as twofold compared to uncontrolled mobility. Stefano Basagni holds a Ph.D. in electrical engineering from the University of Texas at Dallas (December 2001) and a Ph.D. in computer science from the University of Milano, Italy (May 1998). He received his B.Sc. degree in computer science from the University of Pisa, Italy, in 1991. Since Winter 2002 he is on faculty at the Department of Electrical and Computer Engineering at Northeastern University, in Boston, MA. From August 2000 to January 2002 he was professor of computer science at the Department of Computer Science of the Erik Jonsson School of Engineering and Computer Science, The University of Texas at Dallas. Dr. Basagni’s current research interests concern research and implementation aspects of mobile networks and wireless communications systems, Bluetooth and sensor networking, definition and performance evaluation of network protocols and theoretical and practical aspects of distributed algorithms. Dr. Basagni has published over four dozens of referred technical papers and book chapters. He is also co-editor of two books. Dr. Basagni served as a guest editor of the special issue of the Journal on Special Topics in Mobile Networking and Applications (MONET) on Multipoint Communication in Wireless Mobile Networks, of the special issue on mobile ad hoc networks of the Wiley’s Interscience’s Wireless Communications & Mobile Networks journal, and of the Elsevier’s journal Algorithmica on algorithmic aspects of mobile computing and communications. Dr. Basagni serves as a member of the editorial board and of the technical program committee of ACM and IEEE journals and international conferences. He is a senior member of the ACM (including the ACM SIGMOBILE), senior member of the IEEE (Computer and Communication societies), and member of ASEE (American Society for Engineering Education). Alessio Carosi received the M.S. degree “summa cum laude” in Computer Science in 2004 from Rome University “La Sapienza.” He is currently a Ph.D. candidate in Computer Science at Rome University “La Sapienza.” His research interests include protocols for ad hoc and sensor networks, underwater systems and delay tolerant networking. Emanuel Melachrinoudis received the Ph.D. degree in industrial engineering and operations research from the University of Massachusetts, Amherst, MA. He is currently the Director of Industrial Engineering and Associate Chairman of the Department of Mechanical and Industrial Engineering at Northeastern University, Boston, MA. His research interests are in the areas of network optimization and multiple criteria optimization with applications to telecommunication networks, distribution networks, location and routing. He is a member of the Editorial Board of the International Journal of Operational Research. He has published in journals such as Management Science, Transportation Science, Networks, European Journal of Operational Research, Naval Research Logistics and IIE Transactions. Chiara Petrioli received the Laurea degree “summa cum laude” in computer science in 1993, and the Ph.D. degree in computer engineering in 1998, both from Rome University “La Sapienza,” Italy. She is currently Associate Professor with the Computer Science Department at Rome University “La Sapienza.” Her current work focuses on ad hoc and sensor networks, Delay Tolerant Networks, Personal Area Networks, Energy-conserving protocols, QoS in IP networks and Content Delivery Networks where she contributed around sixty papers published in prominent international journals and conferences. Prior to Rome University she was research associate at Politecnico di Milano and was working with the Italian Space agency (ASI) and Alenia Spazio. Dr. Petrioli was guest editor of the special issue on “Energy-conserving protocols in wireless Networks” of the ACM/Kluwer Journal on Special Topics in Mobile Networking and Applications (ACM MONET) and is associate editor of IEEE Transactions on Vehicular Technology, the ACM/Kluwer Wireless Networks journal, the Wiley InterScience Wireless Communications & Mobile Computing journal and the Elsevier Ad Hoc Networks journal. She has served in the organizing committee and technical program committee of several leading conferences in the area of networking and mobile computing including ACM Mobicom, ACM Mobihoc, IEEE ICC,IEEE Globecom. She is member of the steering committee of ACM Sensys and of the international conference on Mobile and Ubiquitous Systems: Networking and Services (Mobiquitous) and serves as member of the ACM SIGMOBILE executive committee. Dr. Petrioli was a Fulbright scholar. She is a senior member of IEEE and a member of ACM. Z. Maria Wang received her Bachelor degree in Electrical Engineering with the highest honor from Beijing Institute of Light Industry in China, her M.S. degree in Industrial Engineering/Operations Research from Dalhousie University, Canada and her Ph.D. in Industrial Engineering/Operations Research from Northeastern University, Boston. She served as a R&D Analyst for General Dynamics. Currently MS. Wang serves as an Optimization Analyst with Nomis Solutions, Inc.     

Fuzzy-based unequal clustering protocol for underwater wireless sensor networks

Underwater wireless sensor network (UWSN) is a network made up of underwater sensor nodes, anchor nodes, surface sink nodes or surface stations, and the offshore sink node. Energy consumption, limited bandwidth, propagation delay, high bit error rate, stability, scalability, and network lifetime are the key challenges related to underwater wireless sensor networks. Clustering is used to mitigate these issues. In this work, fuzzy-based unequal clustering protocol (FBUCP) is proposed that does cluster head selection using fuzzy logic as it can deal with the uncertainties of the harsh atmosphere in the water. Cluster heads are selected using linguistic input variables like distance to the surface sink node, residual energy, and node density and linguistic output variables like cluster head advertisement radius and rank of underwater sensor nodes. Unequal clustering is used to have an unequal size of the cluster which deals with the problem of excess energy usage of the underwater sensor nodes near the surface sink node, called the hot spot problem. Data gathered by the cluster heads are transmitted to the surface sink node using neighboring cluster heads in the direction of the surface sink node. Dijkstra's shortest path algorithm is used for multi-hop and inter-cluster routing. The FBUCP is compared with the LEACH-UWSN, CDBR, and FBCA protocols for underwater wireless sensor networks. A comparative analysis shows that in first node dies, the FBUCP is up to 80% better, has 64.86% more network lifetime, has 91% more number of packets transmitted to the surface sink node, and is up to 58.81% more energy efficient than LEACH-UWSN, CDBR, and FBCA.     

基于无线地磁传感器的交通流检测系统协议设计

提出了一种基于无线地磁传感器的交通流检测系统协议设计,解决了现有智能交通中数据采集的可靠性问题。该系统在Mesh网络拓扑下,采用ZigBee技术作为无线通信方式,设计特有的帧结构,并在调试、常规和配置模式下分别设计出合理的传输协议,达到高可靠性传输的目的。