An Energy-Efficient Routing and Self-Organization Algorithm in Wireless Sensor Networks

1IntroductionAs the development of MEMStechnology,the microsensors whichintegrate manyfunctions such as sensing,signal processing and communication have been widelyused[1]. Wireless Sensor Network ( WSN) is construct-ed with hundreds to thousands of sensors and one ormore SINKs .Sensors can sense (monitor) many physi-cal signals such as sound,light ,electronics ,tempera-ture and humidity of the objects in a given region[2 ~3].Sensors transfer these signalsinto sensing data and sendsensin…     

Energy-Efficient Routing for Signal Detection in Wireless Sensor Networks

For many envisioned applications of wireless sensor networks (WSNs), the information processing involves dealing with distributed data in the context of accurate signal detection and energy-efficient routing, which have been active research topics for many years, respectively. In this paper, we relate these two aspects via joint optimization. Considering the scenario of using distributed radar-like sensors to detect the presence of an object through active sensing, we formulate the problem of energy- efficient routing for signal detection under the Neyman–Pearson criterion, apparently for the first time. The joint optimization of detection and routing is carried out in a fusion center which precomputes the routes as a function of the geographic location to be monitored. Accordingly, we propose three different routing metrics that aim at an appropriate tradeoff between the detection performance and the energy expenditure. In particular, each metric relates the detection performance explicitly in terms of probabilities of detection and false alarm, with the energy consumed in sensing and routing. The routing problems are formulated as combinatorial optimization programs, and we provide solutions drawing on operations research. We present extensive simulation results that demonstrate the energy and detection performance tradeoffs for each proposed routing metric.      

An Energy-Efficient Routing Algorithm Based on Relative Identification and Direction for Wireless Sensor Networks

In studies of wireless sensor networks (WSNs), routing protocols in network layer is an important topic. To date, many routing algorithms of WSNs have been developed such as relative direction-based sensor routing (RDSR). The WSNs in such algorithm are divided into many sectors for routing. RDSR could simply reduce the number of routes as compared to the convention routing algorithm, but it has routing loop problem. In this paper, a less complex, more efficient routing algorithm named as relative identification and direction-based sensor routing (RIDSR) algorithm is proposed. RIDSR makes sensor nodes establish more reliable and energy-efficient routing path for data transmission. This algorithm not only solves the routing loop problem within the RDSR algorithm but also facilitates the direct selection of a shorter distance for routing by the sensor node. Furthermore, it saves energy and extends the lifetime of the sensor nodes. We also propose a new energy-efficient algorithm named as enhanced relative identification and direction-based sensor routing (ERIDSR) algorithm. ERISDR combines triangle routing algorithm with RIDSR. Triangle routing algorithm exploits a simple triangle rule to determine a sensor node that can save more energy while relaying data between the transmitter and the receiver. This algorithm could effectively economize the use of energy in near-sensor nodes to further extend the lifetime of the sensor nodes. Simulation results show that ERIDSR get better performance than RDSR, and RIDSR algorithms. In addition, ERIDSR algorithm could save the total energy in near-sensor nodes more effectively.     

An Energy-Efficient Routing Protocol for Event-Driven Dense Wireless Sensor Networks

The routing energy efficiency of a wireless sensor network is a crucial issue for the network lifetime. In this article, we propose MICRO (MInimum Cost Routing with Optimized data fusion), an energy-efficient routing protocol for event-driven dense wireless sensor networks. The proposed routing protocol is an improvement over the formerly proposed LEACH and PEGASIS protocol, which is designed to be implemented mainly with node computations rather than mainly with node communications. Moreover, in the routing computation the proposed scheme exploits a new cost function for energy balancing among sensor nodes, and uses an iterative scheme with optimized data fusions to compute the minimum-cost route for each event-detecting sensor node. Compared to the PEGASIS routing protocol, MICRO substantially improves the energy-efficiency of each route, by optimizing the trade-off between minimization of the total energy consumption of each route and the balancing of the energy state of each sensor node. It is demonstrated that the proposed protocol is able to outperform the LEACH and the PEGASIS protocols with respect to network lifetime by 100–300% and 10–100%, respectively.     

Tree-Based Threshold-Sensitive Energy-Efficient Routing Approach For Wireless Sensor Networks

Wireless Personal Communications - The widespread use of wireless sensor devices and their advancements in terms of size, deployment cost and user friendly interface have given rise to many...     

Secure and Energy-Efficient Traffic-Aware Key Management Scheme for Wireless Sensor Network

In Wireless Sensor Network (WSN), a sensor node may communicate with a small set of neighbor sensor nodes. Existing key management schemes, did not consider this communication between these nodes. They establish shared keys for all pairs of neighbor sensor nodes. When the number of sensor nodes in WSN is augmented, large number of keys is to be loaded in each sensor node, which in turn causes supplementary energy consumption. If any two close sensor nodes are seldom in the active-state the assignment of shared keys may be gratuitous, since they may be hardly exploited.In this paper, based on this information, secure and Energy-Efficient Traffic Aware key Management (EETKM) is developed for WSN. This determines shared keys for active sensors which takes part in the direct communication. In order to broadcast keys without retransmission or acknowledgements, the proposed scheme gives an efficient Re-keying mechanism. The proposed scheme attains high connectivity which is shown through numerical results. The proposed scheme is applied for various routing protocols and the simulation results shows the stronger resilience, low energy consumption and increased delivery ratio.     

Energy-Efficient Routing for Frequency-Hop Wireless Networks

The use of adaptive-transmission protocols in wireless, store-and-forward, packet communication networks may result in large differences in the energy requirements of the alternative paths that are available to the routing protocol. Routing metrics can provide quantitative measures of the quality and energy efficiency of the paths from the source to the destination. Such measures are required if the routing protocol is to take advantage of the potential energy savings that are made possible by an adaptive-transmission protocol. An energy-efficient protocol suite for routing and adaptive transmission in frequency-hop wireless networks is described and evaluated, several routing metrics are compared, and tradeoffs among energy efficiency, delay, and packet success probability are investigated.     

Energy-Efficient Routing Algorithm Based on Unequal Clustering and Connected Graph in Wireless Sensor Networks

Clustering and multi-hop routing algorithms substantially prolong the lifetime of wireless sensor networks (WSNs). However, they also result in the energy hole and network partition problems. In order to balance the load between multiple cluster heads, save the energy consumption of the inter-cluster routing, in this paper, we propose an energy-efficient routing algorithm based on Unequal Clustering Theory and Connected Graph Theory for WSN. The new algorithm optimizes and innovates in two aspects: cluster head election and clusters routing. In cluster head election, we take into consideration the vote-based measure and the transmission power of sensor nodes when to sectionalize these nodes into different unequal clusters. Then we introduce the connected graph theory for inter-cluster data communication in clusters routing. Eventually, a connected graph is constituted by the based station and all cluster heads. Simulation results show that, this new algorithm balances the energy consumption among sensor nodes, relieves the influence of energy-hole problem, improve the link quality, achieves a substantial improvement on reliability and efficiency of data transmission, and significantly prolongs the network lifetime.     

Energy-Efficient Routing Mechanism for Mobile Sink in Wireless Sensor Networks Using Particle Swarm Optimization Algorithm

Wireless Personal Communications - One of the most effective approaches to increase the lifetime of wireless sensor networks (WSNs), is the use of a mobile sink to collect data from sensor. In...     

高能量有效性的无线传感器网络数据收集和路由协议

 提出了一种分布式高效节能的无线传感器网络数据收集和路由协议HEEDC.此协议中传感器节点根据自身状态(综合考虑剩余能量、节点密度等因素计算得出的代价因子)自主的竞争簇首,同时为减少簇首节点的能量开销,簇首之间通过多跳方式将各个簇内收集到的数据发送给特定簇首节点,并由此簇首节点将整个网络收集的数据发送给汇聚节点.仿真实验表明,HEEDC协议比起现有的几种重要路由协议(如LEACH、PEGASIS等),能提供更加有效的能量使用效率,延长无线传感器网络的生存周期.因此,使用HEEDC协议的无线传感器网络具有更好的使用性,其监测结果具有更高的可靠性.     

Energy-Efficient Scheduling for Wireless Sensor Networks

We consider the problem of minimizing the energy needed for data fusion in a sensor network by varying the transmission times assigned to different sensor nodes. The optimal scheduling protocol is derived, based on which we develop a low-complexity inverse-log scheduling (ILS) algorithm that achieves near-optimal energy efficiency. To eliminate the communication overhead required by centralized scheduling protocols, we further derive a distributed inverse-log protocol that is applicable to networks with a large number of nodes. Focusing on large-scale networks with high total data rates, we analyze the energy consumption of the ILS. Our analysis reveals how its energy gain over traditional time-division multiple access depends on the channel and the data-length variations among different nodes.     

无线传感器网络能量均衡路由算法

设计了一种能量均衡的路由算法.路由的建立分两个阶段,在簇头建立阶段,让候选节点在覆盖范围内以剩余能量的多少和所处位置为标准来竞选簇头,以使簇头分布均匀,平衡网络覆盖;在通信阶段,根据簇头节点的剩余能量大小和其距离基站的远近,采用多跳的簇间通信方式建立路由,以此来降低簇头节点的通信负载.仿真结果表明该算法能够有效降低网络能耗和延长网络生存时间.     

Energy-Efficient Routing Protocol Based on Adaptive Soft Thresholding for Wireless Sensor Networks

Wireless Personal Communications - In this paper, a low-energy adaptive clustering hierarchy (LEACH)-based routing protocol for wireless sensor networks (WSNs) is presented. The proposed...     

Energy-Efficient Hierarchical Routing for Wireless Sensor Networks: A Swarm Intelligence Approach

Wireless Personal Communications - Energy efficient routing in wireless sensor networks (WSNs) require non-conventional paradigm for design and development of power aware protocols. Swarm...     

一种基于路由信息能量有效的无线传感器网MAC协议

传感器节点沿树状多跳路径逐级向Sink转发数据是无线传感器网络的主要业务模式之一。针对此类业务,该文的EBRI-MAC(Energy-efficient MAC protocol Based on Routing Information)协议提出一种对应树状路由转发关系,由父节点与子节点构成虚拟群的思想;并设计了连锁邀请与CSMA/CA结合的信道接入机制以及基于虚拟群同步的周期休眠机制,以达到节能的目的。结合节点能耗因素,定义了能量有效性的性能参数,并对EBRI-MAC的能量有效性进行理论分析。通过ns-2仿真结果表明网络业务时间相关性较强时,EBRI-MAC的能量有效性优于IEEE802.11DCF和S-MAC。     

Energy-Efficient SINR-Based Routing for Multihop Wireless Networks

In this paper, we develop an energy-efficient routing scheme that takes into account the interference created by existing flows in the network. The routing scheme chooses a route such that the network expends the minimum energy satisfying with the minimum constraints of flows. Unlike previous works, we explicitly study the impact of routing a new flow on the energy consumption of the network. Under certain assumptions on how links are scheduled, we can show that our proposed algorithm is asymptotically (in time) optimal in terms of minimizing the average energy consumption. We also develop a distributed version of the algorithm. Our algorithm automatically detours around a congested area in the network, which helps mitigate network congestion and improve overall network performance. Using simulations, we show that the routes chosen by our algorithm (centralized and distributed) are more energy efficient than the state of the art.     

Energy-Efficient Routing Protocol for Wireless Sensor Networks with Static Clustering and Dynamic Structure

Data gathering is an essential operation in wireless sensor networks. For periodic data gathering applications, each sensor node has data that must be sent to a distant base station in a round of communication. Due to the limited battery power of sensor nodes, each sensor node transmitting its sensed data to the base station directly significantly consumes its energy. This work presents a hierarchical ring-based data gathering (HRDG) scheme for dense wireless sensor networks. A hierarchical grid structure is constructed, and only some sensor nodes are elected as grid heads for gathering data, subsequently reducing the total energy consumption per round. Grid heads are then organized into hierarchical rings to decrease the transmission delay of a round. The proposed HRDG scheme focuses on reducing the energy × delay cost in a round of data gathering. Moreover, the energy × delay cost of HRDG is analyzed. Simulation results indicate that the proposed HRDG scheme outperforms other data gathering schemes in terms of the number of rounds, the energy × delay cost and coverage ratio.     

基于MIMO的节能无线传感器网络

当今无线传感器网络主要是同构网络,即网络中传感器节点结构相同,该结构不适合基于组的传感器网络.本文通过使用多天线传感器节点作为无线传感器网络中的组长节点将MIMO和SIMO方式引入组间层和组内层组员与组长之间的通讯.文中介绍了该异构网络的基本通讯机制并对其实现进行了讨论,并提出了MIMO的传感器网络功耗和延迟模型.通过模拟实验验证了该模型优于同构网络.     

一种能量有效的无线传感器网络路由算法

无线传感器网络中传感器节点能量有限,为了提高能量利用率,针对现有算法随机选择簇首、簇结构不合理等缺陷提出了一种新的能量有效的分簇路由算法EERA.EERA采用新的簇首选举、成簇,以及构建簇间路由算法,基于节点剩余能量与节点的相对位置选择簇首、成簇,使剩余能量较多的节点优先成为簇首并且各簇首能较均匀的分布在网络区域内;构建簇间路由时将最小跳数路由算法与改进的MTE算法结合起来,在簇间形成最小跳数、最小能耗路径.仿真结果表明,EERA算法可以均衡全网能量消耗,延长网络的生命周期.