基于簇结构的无线传感器网络路由研究综述

介绍了典型分簇无线传感器网络路由协议的分类,总结了分簇路由协议的研究进展。针对无线传感器网络从同构型网络向异构型网络发展的趋势和特点,指出了路由协议向节点间相互协作的发展方向,并且在设计路由协作算法时可采用与无线传感器网络极为相似的多Agent系统模型。     

An energy aware event-driven routing protocol for cognitive radio sensor networks

Cognitive radio sensor network (CRSN) is an intelligent and reasonable combination of cognitive radio technology and wireless sensor networks. It poses significant challenges to the design of topology maintenance techniques due to dynamic primary-user activities, which in turn decreases the data delivery performance of the network as well as it’s lifetime. This paper aims to provide a solution to the CRSN clustering and routing problem using an energy aware event-driven routing protocol (ERP) for CRSN. Upon detection of an event, the ERP determines eligible nodes for clustering according to local positions of CRSN nodes between the event and the sink and their residual energy levels. Cluster-heads are selected from the eligible nodes according to their residual energy values, available channels, neighbors and distance to the sink. In ERP, cluster formation is based on relative spectrum awareness such that channels with lower primary user appearance probability are selected as common data channels for clusters. For data routing, ERP employs hop-by-hop data forwarding approach through the CHs and primary/secondary gateways towards the sink. Through extensive simulations, we demonstrate that the proposed ERP provides with better network performances compared to those of the state-of-the-art protocols under a dynamic spectrum-aware data transmission environment.     

Efficient flooding with passive clustering-an overhead-free selective forward mechanism for ad hoc/sensor networks

High capacity real-time data communications in sensor networks usually require multihop routing and ad hoc routing protocols. Unfortunately, ad hoc routing protocols usually do not scale well and cannot handle dense situations efficiently. These two issues-scalability and density-are the major limitations when we apply ad hoc routing schemes to sensor networks. Passive clustering (PC) classifies ad hoc/sensor nodes into critical and noncritical nodes without any extra transmission. By 2-b piggybacking and monitoring user traffic (e.g., data polling requests from a sink), PC deploys the clustering structure "for free". Moreover, PC makes even the first flooding as efficient as all subsequent floodings (i.e., no initialization overhead). PC introduces many benefits, including efficient flooding and density adaptation. As a result, PC reduces control overhead of ad hoc routing protocols significantly and, as a consequence, enables ad hoc routing in large, dense sensor networks. The resulting structure can be utilized in cluster-based ad hoc network/sensor networking as well as for active node selection.     

一种适合于认知无线传感网络的路由算法

路由设计是认知无线传感网络（CRSNs）中目前受到较少关注却很重要的一个领域。在CRSN中,由于主用户（PUs）对可用信道资源的随机占用行为,路由算法的设计不仅需要考虑如何延长网络寿命,还要考虑网络内数据传输的可靠性。本文研究了具有频谱可感知特性,且对能量消耗敏感的 CRSN路由问题,揭示了 CRSN路由问题的独特性,并将这类问题表述为在能量约束和变化的网络拓扑环境下的网络寿命优化问题。在回顾传感器网络的典型算法之后,提出一种新的路由度量来克服 CRSN的路由设计挑战,即认知能量度量（CE）。在此基础上,提出一种分布式路由算法以延长网络寿命,同时提高数据传输的可靠性。仿真结果表明,所提路由算法能很好地适应 CRSN中可用信道资源及网络拓扑的随机变化。     

A Review on Hierarchical Routing Protocols for Wireless Sensor Networks

The routing protocol for Wireless Sensor Networks (WSNs) is defined as the manner of data dissemination from the network field (source) to the base station (destination). Based on the network topology, there are two types of routing protocols in WSNs, they are namely flat routing protocols and hierarchical routing protocols. Hierarchical routing protocols (HRPs) are more energy efficient and scalable compared to flat routing protocols. This paper discusses how topology management and network application influence the performance of cluster-based and chain-based hierarchical networks. It reviews the basic features of sensor connectivity issues such as power control in topology set-up, sleep/idle pairing and data transmission control that are used in five common HRPs, and it also examines their impact on the protocol performance. A good picture of their respective performances give an indication how network applications, i.e whether reactive or proactive, and topology management i.e. whether centralized or distributed would determine the network performance. Finally, from the ensuring discussion, it is shown that the chain-based HRPs guarantee a longer network lifetime compared to cluster-based HRPs by three to five times.     

ECRP: an energy-aware cluster-based routing protocol for wireless sensor networks

Energy conservation is the main issue in wireless sensor networks. Many existing clustering protocols have been proposed to balance the energy consumption and maximize the battery lifetime of sensor nodes. However, these protocols suffer from the excessive overhead due to repetitive clustering resulting in high-energy consumption. In this paper, we propose energy-aware cluster-based routing protocol (ECRP) in which not only the cluster head (CH) role rotates based on energy around all cluster members until the end of network functioning to avoid frequent re-clustering, but also it can adapt the network topology change. Further, ECRP introduces a multi-hop routing algorithm so that the energy consumption is minimized and balanced. As well, a fault-tolerant mechanism is proposed to cope up with the failure of CHs and relay nodes. We perform extensive simulations on the proposed protocol using different network scenarios. The simulation results demonstrate the superiority of ECRP compared with recent and relevant existing protocols in terms of main performance metrics.

     

A boolean spider monkey optimization based energy efficient clustering approach for WSNs

Wireless sensor network (WSN) consists of densely distributed nodes that are deployed to observe and react to events within the sensor field. In WSNs, energy management and network lifetime optimization are major issues in the designing of cluster-based routing protocols. Clustering is an efficient data gathering technique that effectively reduces the energy consumption by organizing nodes into groups. However, in clustering protocols, cluster heads (CHs) bear additional load for coordinating various activities within the cluster. Improper selection of CHs causes increased energy consumption and also degrades the performance of WSN. Therefore, proper CH selection and their load balancing using efficient routing protocol is a critical aspect for long run operation of WSN. Clustering a network with proper load balancing is an NP-hard problem. To solve such problems having vast search area, optimization algorithm is the preeminent possible solution. Spider monkey optimization (SMO) is a relatively new nature inspired evolutionary algorithm based on the foraging behaviour of spider monkeys. It has proved its worth for benchmark functions optimization and antenna design problems. In this paper, SMO based threshold-sensitive energy-efficient clustering protocol is proposed to prolong network lifetime with an intend to extend the stability period of the network. Dual-hop communication between CHs and BS is utilized to achieve load balancing of distant CHs and energy minimization. The results demonstrate that the proposed protocol significantly outperforms existing protocols in terms of energy consumption, system lifetime and stability period.     

A Performance Comparison of Flat and Cluster Based Routings in Mobile Ad Hoc Networks

The objective of this paper is to study the performance comparison between flat and cluster-based routings in MANETs. Previous study shows that an earlier proposed cluster-based routing, Cluster based Routing Protocol (CBRP), has poorer performance due to its inefficient clustering algorithms based on Least Clusterhead Change (LCC) and Lowest ID (LID). Thus, in this paper, we first propose a new cluster-based routing, namely efficient cluster based routing protocol (ECBRP), which is based on a more efficient and stable clustering scheme. In addition, a new information table update mechanism utilizing routing events and data forwarding events is introduced in ECBRP to enhance the clustering and routing performance. The performance comparison in terms of packet delivery ratio and normalized routing overhead between flat and cluster based routings are studied extensively. Two flat routings (Dynamic Source Routing (DSR) and Ad Hoc On-demand Distance Vector (AODV)) and two cluster-based routing (CBRP and ECBRP) under various scenarios such as traffic load, mobility, network size and network area are considered in our study. By evaluating the performance of ECBRP and CBRP, we can study how the performance of a CBRP is affected by its underlying cluster structure. Simulation results show that ECBRP can achieve satisfying routing performance and outperform other routing schemes, DSR, AODV and CBRP, under the same simulated scenarios.     

MANET中路由算法对通信流自相似特性的影响

着重分析无线多跳移动网络中,不同路由算法对多媒体通信流自相似特性的影响.通过NS2仿真产生基于不同路由算法的通信流数据,运用V-T法和R/S图法分别分析其突发性参数.结果表明,基于表驱动的DSDV自相似参数最大,而分簇路由算法CBRP自相似参数最小,更有利于实时流媒体的传输.研究对提高无线网络路由协议的性能和多媒体服务的质量具有重要意义.     

Delay-sensitive and multimedia communication in cognitive radio sensor networks

Multimedia and delay-sensitive data applications in cognitive radio sensor networks (CRSN) require efficient real-time communication and dynamic spectrum access (DSA) capabilities. This requirement poses emerging problems to be addressed in inherently resource-constrained sensor networks, and needs investigation of CRSN challenges with real-time communication requirements. In this paper, the main design challenges and principles for multimedia and delay-sensitive data transport in CRSN are introduced. The existing transport protocols and algorithms devised for cognitive radio ad hoc networks and wireless sensor networks (WSN) are explored from the perspective of CRSN paradigm. Specifically, the challenges for real-time transport in CRSN are investigated in different spectrum environments of smart grid, e.g., 500 kV substation, main power room and underground network transformer vaults. Open research issues for the realization of energy-efficient and real-time transport in CRSN are also presented. Overall, the performance evaluations provide valuable insights about real-time transport in CRSN and guide design decisions and trade-offs for CRSN applications in smart electric power grid.     

无线传感器网络LEACH协议的研究

在无线传感器网络中,与平面路由协议相比,分簇路由协议具有一定的优势.它具有拓扑管理方便、能量利用高效.数据融合简单等优点,成为当前路由协议研究的重点.本文以低能量自适应聚类(LEACH)为例,对分簇路由协议进行了分析.在此基础上,提出改进了的LEACH ED_LEACH(Base on Energy and Di Stance factors-Low-Energy Adaptive Clustering Hierarchy),通过使用MATLAB进行了仿真,仿真结果表明ED_LEACH算法能更有效地延长网络寿命.     

Performance optimisation through EPT-WBC in mobile ad hoc networks

Mobile ad hoc networks are self-organised, infrastructure-less networks in which each mobile host works as a router to provide connectivity within the network. Nodes out of reach to each other can communicate with the help of intermediate routers (nodes). Routing protocols are the rules which determine the way in which these routing activities are to be performed. In cluster-based architecture, some selected nodes (clusterheads) are identified to bear the extra burden of network activities like routing. Selection of clusterheads is a critical issue which significantly affects the performance of the network. This paper proposes an enhanced performance and trusted weight-based clustering approach in which a number of performance factors such as trust, load balancing, energy consumption, mobility and battery power are considered for the selection of clusterheads. Moreover, the performance of the proposed scheme is compared with other existing approaches to demonstrate the effectiveness of the work.     

IBLEACH: intra-balanced LEACH protocol for wireless sensor networks

Wireless sensor networks (WSNs) are composed of many low cost, low power devices with sensing, local processing and wireless communication capabilities. Recent advances in wireless networks have led to many new protocols specifically designed for WSNs where energy awareness is an essential consideration. Most of the attention, however, has been given to the routing protocols since they might differ depending on the application and network architecture. Minimizing energy dissipation and maximizing network lifetime are important issues in the design of routing protocols for WSNs. In this paper, the low-energy adaptive clustering hierarchy (LEACH) routing protocol is considered and improved. We propose a clustering routing protocol named intra-balanced LEACH (IBLEACH), which extends LEACH protocol by balancing the energy consumption in the network. The simulation results show that IBLEACH outperforms LEACH and the existing improvements of LEACH in terms of network lifetime and energy consumption minimization.     

Cluster-based location service schemes in VANETs: current state,challenges and future directions

Vehicular Ad hoc Networks (VANETs) have drawn incredible interest in both academic and industrial sectors due to their potential applications and services. Vehicles’ position plays a significant role in many location-based applications and services such as public emergency, vehicles tracking, resource discovery, traffic monitoring and position-based routing. A location service is used to keep up-to-date records of current positions of vehicles. However, locating vehicles’ positions and maintaining an accurate view of the entire network are quite challenging tasks due to the high number of nodes, and high and fast nodes mobility which results in rapid topological changes and sudden network disconnections. In the past literature, various location-based services have been proposed to solve the above mentioned issues. Moreover, the cluster-based location service schemes have gained a growing interest due to their advantages over non-cluster-based schemes. The cluster-based schemes improve the network scalability, reduce the communications overhead and resolve the mobility issues within the clusters preventing them from propagating in the whole network. Therefore, this paper presents the taxonomy of the existing location service schemes, inspects the cluster-based location service by highlighting their strengths and limitations, and provides a comparison between location-based clustering and application specific clustering such as the one used in routing, information dissemination, channel access management and security. In addition, the existing clustering schemes, challenges and future directions for efficient cluster-based location service are also discussed.

     

Passive cluster-based multipath routing protocol for wireless sensor networks

Energy efficiency and quality of service (QoS) are both essential issues in the applications of wireless sensor networks (WSNs) all along, which are mainly reflected in the development of routing and MAC protocols. However, there is little design for achieving the dual performances simultaneously. In this paper, we develop a practical passive cluster-based node-disjoint many to one multipath routing protocol to satisfy the requirements of energy efficiency and QoS in practical WSNs. Passive clustering approach is put to use in the first round, while active clustering technique is taken in the other rounds. Implementation of smart delay strategy makes the cluster distribute uniformly, as well as lessen the number of nodes that have taken part in routing. Among cluster heads, a node-disjoint many to one multipath routing discovery algorithm, which is composed of the optimal path searching process and multipath expansion process, is implemented to find multiple paths at the minimum cost. The simulation results show the proposed protocol achieved very good performance both in energy efficiency and QoS.     

Multi-factor and Distributed Clustering Routing Protocol in Wireless Sensor Networks

One of important issues in wireless sensor networks is how to effectively use the limited node energy to prolong the lifetime of the networks. Clustering is a promising approach in wireless sensor networks, which can increase the network lifetime and scalability. However, in existing clustering algorithms, too heavy burden of cluster heads may lead to rapid death of the sensor nodes. The location of function nodes and the number of the neighbor nodes are also not carefully considered during clustering. In this paper, a multi-factor and distributed clustering routing protocol MFDCRP based on communication nodes is proposed by combining cluster-based routing protocol and multi-hop transmission. Communication nodes are introduced to relay the multi-hop transmission and elect cluster heads in order to ease the overload of cluster heads. The protocol optimizes the election of cluster nodes by combining various factors such as the residual energy of nodes, the distance between cluster heads and the base station, and the number of the neighbor nodes. The local optimal path construction algorithm for multi-hop transmission is also improved. Simulation results show that MFDCRP can effectively save the energy of sensor nodes, balance the network energy distribution, and greatly prolong the network lifetime, compared with the existing protocols.     

Multi-objective fractional artificial bee colony algorithm to energy aware routing protocol in wireless sensor network

Due to the promising application of collecting information from remote or inaccessible location, wireless sensor networks pose big challenge for data routing to maximize the communication with more energy efficient. Literature presents different cluster-based energy aware routing protocol for maximizing the life time of sensor nodes. Accordingly, an energy efficient clustering mechanism, based on artificial bee colony algorithm and factional calculus is proposed in this paper to maximize the network energy and life time of nodes by optimally selecting cluster-head. The hybrid optimization algorithm called, multi-objective fractional artificial bee colony is developed to control the convergence rate of ABC with the newly designed fitness function which considered three objectives like, energy consumption, distance travelled and delays to minimize the overall objective. The performance of the proposed FABC-based cluster head selection is compared with LEACH, PSO and ABC-based routing using life time, and energy. The results proved that the proposed FABC maximizes the energy as well as life time of nodes as compared with existing protocols.     

Optimistic Selection of Cluster Heads Based on Facility Location Problem in Cluster-Based Routing Protocols

Cluster-based routing protocols are one of the most favorable approaches for energy management in wireless sensor networks. The selection of the best cluster heads (CHs), as well as the formation of optimal clusters, is an NP-hard problem. The present study proposes an optimal solution for CHs selection to generate a network topology with optimized network performance. The problem is formulated as facility location problem and a linear programming model is used to solve the optimization problem. Results of analysis o the network simulator (NS2) indicate that applying this method in cluster-based routing protocols prolongs 16 % of the network lifetime, increases 15.5 % of data transmission and improves 5.5 % of throughput, as compared to the results of current heuristic methods such as LEACH, DEEC and EDFCM protocols.     

高能效无线传感器网络分簇数据收集协议

提出了一种基于簇结构的数据收集协议ECDGP(Energy-efficient Cluster-based Data Gathering Protocol).ECDGP使用了一种基于置信度的分簇算法进行簇头竞选,并根据网路覆盖要求选择活动节点,通过控制分簇中活动节点数目,ECDGP减少了能耗和延长了网络生命期.仿真结果表明在能耗和网络寿命上,ECDGP大幅度优于传统的分簇路由算法.     

WSN中基于分簇路由的多维度数据压缩算法研究

 本文在不减少基站获取传感信息量的前提下,以最大程度减少传输数据量为目的,提出一种在分簇路由协议支持下的时间、空间多维度的数据压缩算法.结合基于空间维度的数据压缩方式设计了一种改进的分簇路由.通过实例验证与仿真评测,该数据压缩算法以及配合该算法设计的路由协议可以显著的减少整个无线传感器网络中数据发送量,延长网络的生存周期.