Energy-Aware Optimization Model in Chain-Based Routing

Sensor networks are deployed in numerous military and civil applications, such as remote target detection, weather monitoring, weather forecast, natural resource exploration and disaster management. Despite having many potential applications, wireless sensor networks still face a number of challenges due to their particular characteristics that other wireless networks, like cellular networks or mobile ad hoc networks do not have. The most difficult challenge of the design of wireless sensor networks is the limited energy resource of the battery of the sensors. This limited resource restricts the operational time that wireless sensor networks can function in their applications. Routing protocols play a major part in the energy efficiency of wireless sensor networks because data communication dissipates most of the energy resource of the networks. The above discussions imply a new family of protocols called chain-based protocols. In the protocols, all sensor nodes sense and gather data in an energy efficient manner by cooperating with their closest neighbors. The gathering process can be done until an elected node calculates the final data and sends the data to the base station. In our works, we have proposed two methods to optimize the lifetime of chain-based protocols using Integer Linear Programming (ILP) formulations. Also, a method to determine the bounds of the lifetime for any energy-efficient routing protocol is presented. Finally, simulation results verify the work in this chapter. Furthermore, previous researches assume that the base station position is randomly placed without optimization. In our works, a non convex optimization model has been developed for solving the base station location optimization problem.     

Reliable and energy aware query-driven routing protocol for wireless sensor networks

Wireless sensor networks become very attractive in the research community, due to their applications in diverse fields such as military tracking, civilian applications and medical research, and more generally in systems of systems. Routing is an important issue in wireless sensor networks due to the use of computationally and resource limited sensor nodes. Any routing protocol designed for use in wireless sensor networks should be energy efficient and should increase the network lifetime. In this paper, we propose an efficient and highly reliable query-driven routing protocol for wireless sensor networks. Our protocol provides the best theoretical energy aware routes to reach any node in the network and routes the request and reply packets with a lightweight overhead. We perform an overall evaluation of our protocol through simulations with comparison to other routing protocols. The results demonstrate the efficiency of our protocol in terms of energy consumption, load balancing of routes, and network lifetime.     

RETT-gen: A globally efficient routing protocol for wireless sensor networks by equalising sensor energy and avoiding energy holes

Wireless sensor networks are composed of a large number of sensor nodes with limited energy resources. Once deployed, the sensor nodes are usually inaccessible to the user, and thus replacement of the energy resource is not feasible. Hence, energy efficiency is a key design issue that needs to be enhanced in order to improve the life span of the entire network. Several routing protocols have been proposed to improve the effective lifetime of the network with limited energy supply. In this paper, we propose routing based on energy–temperature transformation, RETT-gen, a scalable energy-efficient clustering and routing protocol designed for wireless sensor networks. The main goal of RETT-gen is to evenly distribute the energy load among all the sensor nodes in the network so that there are no overly-utilized sensor nodes that will run out of energy before the others. To achieve this goal, RETT-gen uses heat conductivity as a metaphor and uses the heat dissipation difference equations. In RETT-gen, we transform the expected lifetime of each sensor node to an equivalent temperature, and then by using the heat dissipation equations, we find the hottest path for sending data to the base station, which will not always be the shortest path. We evaluate the performance of the RETT-gen protocol via simulations, and compare it to the performance of well-known routing protocols (i.e. LEACH [W. Heinzelman, A. Chandrakasan, H. Balakrishnan, Energy-efficient communication protocol for wireless microsensor networks, in: Proceedings of the 33rd Hawaii International Conference on System Sciences (HICSS’00), 2000.] and EEUC [C. Li, M. Ye, G. Chen, J. Wu, An energy-efficient unequal clustering mechanism for wireless sensor networks, in: Proceedings of the International IEEE Conference on Mobile Adhoc and Sensor Systems (MASS), 2005.]). Simulation results show that by equalizing the sensor nodes energy, RETT-gen insures that the lifetime of the entire sensor network is maximized, the connectivity in a sensor network is maintained for as long as possible, and that the residual energy of the entire network is of the same order.     

Energy Efficiency Routing with Node Compromised Resistance in Wireless Sensor Networks

For the energy limited wireless sensor networks, the critical problem is how to achieve the energy efficiency. Many attackers can consume the limited network energy, by the method of capturing some legal nodes then control them to start DoS and flooding attack, which is difficult to be detected by only the classic cryptography based techniques with common routing protocols in wireless sensor networks (WSNs). We argue that under the condition of attacking, existing routing schemes are low energy-efficient and vulnerable to inside attack due to their deterministic nature. To avoid the energy consumption caused by the inside attack initiated by the malicious nodes, this paper proposes a novel energy efficiency routing with node compromised resistance (EENC) based on Ant Colony Optimization. Under our design, each node computes the trust value of its 1-hop neighbors based on their multiple behavior attributes evaluation and builds a trust management by the trust value. By this way, sensor nodes act as router to achieve dynamic and adaptive routing, where the node can select much energy efficiency and faithful forwarding node from its neighbors according to their remaining energy and trust values in the next process of data collection. Simulation results indicate that the established routing can bypass most compromised nodes in the transmission path and EENC has high performance in energy efficiency, which can prolong the network lifetime.     

无线传感网络中基于蚁群的路由算法

In the wireless sensor networks, high efficient data routing for the limited energy resource networks is an important issue. By introducing Ant-colony algorithm, this paper proposes the wireless sensor network routing algorithm based on LEACH. During the construction of sensor network clusters, to avoid the node premature death because of the energy consumption, only the nodes whose residual energy is higher than the average energy can be chosen as the cluster heads. The method of repeated division is used to divide the clusters in sensor networks so that the numbers of the nodes in each cluster are balanced. The basic thought of ant-colony algorithm is adopted to realize the data routing between the cluster heads and sink nodes, and the maintenance of routing. The analysis and simulation showed that the proposed routing protocol not only can reduce the energy consumption, balance the energy consumption between nodes, but also prolong the network lifetime.     

An ant colony optimization based routing algorithm for extending network lifetime in wireless sensor networks

Reducing the energy consumption of network nodes is one of the most important problems for routing in wireless sensor networks because of the battery limitation in each sensor. This paper presents a new ant colony optimization based routing algorithm that uses special parameters in its competency function for reducing energy consumption of network nodes. In this new proposed algorithm called life time aware routing algorithm for wireless sensor networks (LTAWSN), a new pheromone update operator was designed to integrate energy consumption and hops into routing choice. Finally, with the results of the multiple simulations we were able to show that LTAWSN, in comparison with the previous ant colony based routing algorithm, energy aware ant colony routing algorithms for the routing of wireless sensor networks, ant colony optimization-based location-aware routing algorithm for wireless sensor networks and traditional ant colony algorithm, increase the efficiency of the system, obtains more balanced transmission among the nodes and reduce the energy consumption of the routing and extends the network lifetime.     

The Impact of Deployment Pattern and Routing Scheme on the Lifetime in Multi-Sink Wireless Sensor Network

Extensive use of sensor and actuator networks in many real-life applications introduced several new performance metrics at the node and network level. Since wireless sensor nodes have significant battery constraints, therefore, energy efficiency, as well as network lifetime, are among the most significant performance metrics to measure the effectiveness of given network architecture. This work investigates the performance of an event-based data delivery model using a multipath routing scheme for a wireless sensor network with multiple sink nodes. This routing algorithm follows a sink initiated route discovery process with the location information of the source nodes already known to the sink nodes. It also considers communication link costs before making decisions for packet forwarding. Carried out simulation compares the network performance of a wireless sensor network with a single sink, dual sink, and multi sink networking approaches. Based on a series of simulation experiments, the lifetime aware multipath routing approach is found appropriate for increasing the lifetime of sensor nodes significantly when compared to other similar routing schemes. However, energy-efficient packet forwarding is a major concern of this work; other network performance metrics like delay, average packet latency, and packet delivery ratio are also taken into the account.

     

A novel real-time scheme for (m,k)-firm streams in wireless sensor networks

The multimedia transmission based real-time applications have posed a big challenge to wireless sensor networks (WSNs) where both reliability and timeliness need to be guaranteed at the same time, to support an acceptable Quality of Service (QoS). The existing real-time routing protocols, however, are not able to meet the QoS requirements of realtime applications because of the inherent resource constraint of sensor nodes and instability of wireless communication. Therefore, we propose a real-time scheme in this paper, including a QoS-aware routing protocol and a set of fault recovery mechanisms, for (m,k)-firm based real-time applications over WSNs. A local status indicator which is specially devised for (m,k)-firm stream, is used for intermediate nodes to monitor and evaluate their local conditions. The proposed routing protocol takes into account of packet deadline, node condition and remaining energy of next hop, to make optimal forwarding decision. Additionally, according to the stream QoS and node condition, the proposed fault recovery mechanisms are utilized for nodes to handle the congestion, link failure and void problems occurred during transmission and remain the desired reliability and timeliness requirements. The proposed scheme has been well studied and verified through simulations. The results have proved the efficiency of the proposed scheme in terms of high successful transmission ratio, small end-to-end delay and long lifetime of network.     

Distributed fuzzy approach to unequal clustering and routing algorithm for wireless sensor networks

Due to inherent issue of energy limitation in sensor nodes, the energy conservation is the primary concern for large‐scale wireless sensor networks. Cluster‐based routing has been found to be an effective mechanism to reduce the energy consumption of sensor nodes. In clustered wireless sensor networks, the network is divided into a set of clusters; each cluster has a coordinator, called cluster head (CH). Each node of a cluster transmits its collected information to its CH that in turn aggregates the received information and sends it to the base station directly or via other CHs. In multihop communication, the CHs closer to the base station are burdened with high relay load; as a result, their energy depletes much faster as compared with other CHs. This problem is termed as the hot spot problem. In this paper, a distributed fuzzy logic‐based unequal clustering approach and routing algorithm (DFCR) is proposed to solve this problem. Based on the cluster design, a multihop routing algorithm is also proposed, which is both energy efficient and energy balancing. The simulation results reinforce the efficiency of the proposed DFCR algorithm over the state‐of‐the‐art algorithms, ie, energy‐aware fuzzy approach to unequal clustering, energy‐aware distributed clustering, and energy‐aware routing algorithm, in terms of different performance parameters like energy efficiency and network lifetime.     

无线传感器网络优化生存时间的动态路由算法

 节能和延长网络生存时间是无线传感器网络研究领域的热点问题.该文综合考虑网络中节点的剩余能量和节点间传输数据的能耗,基于最短路径树算法,通过构造两种不同的权值函数,提出了"比例权值路由算法"(Ratio-W)与"和权值路由算法"(Sum-W).仿真分析表明,所提出的算法可以延长网络生存时间,并使能耗经济有效,比一些已有知名算法更优.     

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.     

An optimized forwarding protocol for lifetime extension of wireless sensor networks

Optimized routing (from source to sink) in wireless sensor networks (WSN) constitutes one of the key design issues in prolonging the lifetime of battery‐limited sensor nodes. In this paper, we explore this optimization problem by considering different cost functions such as distance, remaining battery power, and link usage in selecting the next hop node among multiple candidates. Optimized selection is carried out through fuzzy inference system (FIS). Two differing algorithms are presented, namely optimized forwarding by fuzzy inference systems (OFFIS), and two‐layer OFFIS (2L‐OFFIS), that have been developed for flat and hierarchical networks, respectively. The proposed algorithms are compared with popular routing protocols that are considered as the closest counterparts such as minimum transmit energy (MTE) and low energy adaptive clustering hierarchy (LEACH). Simulation results demonstrate the superiority of the proposed algorithms in extending the WSN lifetime. Copyright © 2008 John Wiley & Sons, Ltd.     

能量采集型无线传感器网络的高能效路由算法

在能量采集型无线传感器网络中,虽然有能量吸收,但是因能量依然非常珍贵,如何优化路由协议,提高能量利用率,延长网络寿命仍然是值得研究的问题.为求解高能效的路由,提出了一种采用遗传算法的高能效路由算法,建立考虑节点的吸收能量、剩余能量、消耗能量和浪费能量的适应函数,用遗传算法寻找全局最优路径.将该适应函数与3种其他适应函数作对比,其他3种适应函数分别为只考虑路径能耗最小的适应函数,考虑路径能耗与路径上节点的吸收能量、剩余能量的适应函数以及考虑路径能耗与网络中所有节点的浪费能量的适应函数.采用遗传算法解出4种路由,通过仿真分析可知,所提出的路由算法能量利用效率最高.     

无线传感器网络中的分簇算法

分簇算法是无线传感器网络中实施分层路由所采用的重要方法,尤其是传感器节点受到能量和带宽的严重制约。如何合理、有效地利用分簇算法使得网络中节点的能量分布趋于一致,从而延长网络的生命周期,提高系统的整体性能指标,成为当前无线传感器网络研究领域内的热点问题之一。本文从能量有效性的角度出发,对最新的分簇算法进行研究与分析,指出如何根据无线传感器网络不同的分布区域、应用场景和多样的无线环境,生成性能优越的分簇算法。     

无线传感网络移动分簇路由策略

无线传感网络(WSN)路由协议中,分簇路由具有拓扑管理方便、能量高效和数据融合简单等优点,成为当前重点研究的路由技术。通过研究各种环境下的移动传感器网络,有效地降低能耗则是研究移动无线传感器网络的重要目的之一。针对无线传感网络中移动性问题,基于LEACH协议,利用移动传感器网络中节点距离、速度和剩余能量等因素提出了能量高效的移动分簇路由算法。实验结果表明此算法能够较好地支持节点移动,从而降低网络能耗,延长网络生存时间。     

A New Energy Efficient Hierarchical Routing Protocol for Wireless Sensor Networks

Wireless sensor networks consist of low cost sensor nodes which have limited power supplies, memory capacity, processing capability and transmission rate. Sensor nodes gather information from the environment and send the collected information to base station with help of a routing cooperation. Because of limited resources in Wireless Sensor Networks, fulfilling these routing operations is a major problem. Routing protocols are used to perform these operations. The most important thing by considering while these protocols are designed is energy efficiency. Because wireless sensor networks are widely used in intelligent systems, the energy efficiency of these networks is very important in IoT. Researchers have proposed several hierarchical routing protocols such as LEACH, PEGASIS, TEEN and APTEEN. In this study, an energy efficient routing protocol is developed which is more efficient than currently avaliable routing protocols. The developed protocol involves mapping of the network, sleep–wake/load balancing, data merge processes. The proposed protocol gives better results than other protocols in number of surviving nodes and amount of energy consumed criterias.     

一种无线传感器网络异构分簇模型的簇头调度方案

将无线传感器网络划分成簇会有效利用系统资源,近来提出的基于异构分簇模型的无线传感器网络,是指网络中存在多种不同能力的节点,能力强的节点自动成为簇头,这种网络避免了复杂的簇头选举过程并有效降低了普通节点的硬件复杂性和成本。但是,固定簇头的方法会削弱系统的负载均衡以及健壮性。为了解决这个问题,提出了一种基于自适应退避策略的簇头调度方案,该方案通过适当增加冗余度实现传感节点的k覆盖,增强了网络的健壮性。同时,依赖于地理信息和剩余电池能量信息,簇头节点通过自主周期性睡眠来保证系统负载的均衡分配,延长网络生存期。     

A centralized energy-efficient routing protocol for wireless sensor networks

Wireless sensor networks consist of small battery powered devices with limited energy resources. Once deployed, the small sensor nodes are usually inaccessible to the user, and thus replacement of the energy source is not feasible. Hence, energy efficiency is a key design issue that needs to be enhanced in order to improve the life span of the network. Several network layer protocols have been proposed to improve the effective lifetime of a network with a limited energy supply. In this article we propose a centralized routing protocol called base-station controlled dynamic clustering protocol (BCDCP), which distributes the energy dissipation evenly among all sensor nodes to improve network lifetime and average energy savings. The performance of BCDCP is then compared to clustering-based schemes such as low-energy adaptive clustering hierarchy (LEACH), LEACH-centralized (LEACH-C), and power-efficient gathering in sensor information systems (PEGASIS). Simulation results show that BCDCP reduces overall energy consumption and improves network lifetime over its comparatives.     

QoS provisioning in wireless video sensor networks: a dynamic power management framework

Recent technological advances in microelectronics and nano-systems technologies have made it feasible to equip wireless sensor nodes with small low-cost cameras to capture and transmit video. Wireless video sensor networks are gaining popularity due to numerous potential applications such as video surveillance, environmental and habitat monitoring, and so on. However, due to the limited battery available in wireless video sensor nodes, provisioning of QoS in such a network is a challenging task. We provide a survey on the major issues related to QoS provisioning in wireless video sensor networks and possible solution approaches. A dynamic power management framework is proposed for a wireless video sensor node to improve energy saving performance so that the lifetime of the sensor node can be increased. This framework considers the video traffic arrival process in the sensor node, the sleep and wakeup processes in the camera and wireless transceiver electronics, the queue status, and the wireless channel condition. Performance analysis results show that the proposed mechanism can achieve considerable energy saving in a sensor node while providing a target level of QoS performance.     

Balance energy-efficient and real-time with reliable communication protocol for wireless sensor network

In many wireless sensor network applications, it should be considered that how to trade off the inherent conflict between energy efficient communication and desired quality of service such as real-time and reliability of transportation. In this paper, a novel routing protocols named balance energy-efficient and real-time with reliable communication (BERR) for wireless sensor networks (WSNs) are proposed, which considers the joint performances of real-time, energy efficiency and reliability. In BERR, a node, which is preparing to transmit data packets to sink node, estimates the energy cost, hop count value to sink node and reliability using local information gained from neighbor nodes. BERR considers not only each sender’ energy level but also that of its neighbor nodes, so that the better energy conditions a node has, the more probability it will be to be chosen as the next relay node. To enhance real-time delivery, it will choose the node with smaller hop count value to sink node as the possible relay candidate. To improve reliability, it adopts retransmission mechanism. Simulation results show that BERR has better performances in term of energy consumption, network lifetime, reliability and small transmitting delay.