An energy‐efficient utility‐based distributed data routing scheme for heterogenous sensor networks

A utility‐based distributed data routing algorithm is proposed and evaluated for heterogeneous wireless sensor networks. It is energy efficient and is based on a game‐theoretic heuristic load‐balancing approach. It runs on a hierarchical graph arranged as a tree with parents and children. Sensor nodes are considered heterogeneous in terms of their generated traffic, residual energy and data transmission rate and the bandwidth they provide to their children for communication. The proposed method generates a data routing tree in which child nodes are joined to parent nodes in an energy‐efficient way. The principles of the Stackelberg game, in which parents as leaders and children as followers, are used to support the distributive nature of sensor networks. In this context, parents behave cooperatively and help other parents to adjust their loads, while children act selfishly. Simulation results indicate the proposed method can produce on average more load‐balanced trees, resulting in over 30% longer network lifetime compared with the cumulative algorithm proposed in the literature. Copyright © 2014 John Wiley & Sons, Ltd.     

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.     

Up-Down Links Dualpath Greedy Routing Protocol for Wireless Sensor Networks

Greedy geographic routing is attractive in wireless sensor networks because of its efficiency and scalability. This paper presents an up-down links dualpath greedy routing (UDLDGR) protocol for wireless sensor networks. The routing protocol not only reserves the features of greedy forwarding algorithm, which is simple, efficient, but also uses different relay nodes to serve as routing nodes for up and down routing paths, makes the energy consumption more balanced. The greatest advantage of UDLDGR is it trades off only small cost for the source node to obtain two different transmission paths information. The multipath strengthens the network reliability, such as load balancing and robustness to failures. Our simulation results show that UDLDGR can improve system lifetime by 20–100% compared to single path approaches.     

基于等概率路由模型的传感器网络负载均衡研究

无线传感器网络的能耗效率与流量负载分布密切相关。论文从微观角度研究了无线传感器网络的负载均衡问题。基于等概率路由模型,分析了拓扑传输结构对于感知数据流量的分流作用。根据分析结果,提出了多对一传输模式下任意节点负载密度的定义和算法。分析了节点的负载密度与传感器网络生命期的关系,进一步论证了在多对一的多跳传感器网络中不能实现完全的负载均衡,但是通过设计合理的拓扑结构可以实现准负载均衡。仿真结果说明,从微观角度得到的节点负载密度可以准确描述无线传感器网络的流量负载分布,由此得到的准负载均衡条件也能实现绝大多数节点的负载均衡。     

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.     

Greedy construction of load‐balanced virtual backbones in wireless sensor networks

Inspired by the backbone concept in wired networks, a virtual backbone is expected to bring substantial benefits to routing in wireless sensor networks (WSNs). A connected dominating set (CDS) is used as a virtual backbone for efficient routing and broadcasting in WSNs. Most existing works focus on constructing a minimum CDS, a k‐connect m‐dominating CDS, a minimum routing cost CDS, or a bounded‐diameter CDS. However, the load‐balance factor is not considered for CDSs in WSNs. In this paper, a greedy‐based approximation algorithm is proposed to construct load‐balanced CDS in a WSN. More importantly, we propose a new problem: the Load‐balanced Allocate Dominatee problem. Consequently, we propose an optimal centralized algorithm and an efficient probability‐based distributed algorithm to solve the Load‐balanced Allocate Dominatee problem. For a given CDS, the upper and lower bounds of the performance ratio of the distributed algorithm are analyzed in the paper. Through extensive simulations, we demonstrate that our proposed methods extend network lifetime by up to 80% compared with the most recently published CDS construction algorithm. Copyright © 2012 John Wiley & Sons, Ltd.     

A distributed,multi‐hop,adaptive, tree‐based energy‐balanced routing approach

To accomplish the primary objective of data sensing and collection of wireless sensor networks (WSN), the design of an energy efficient routing algorithm is very important. However, the energy constrained sensing nodes along with the intrinsic properties of the (WSN) environment makes the routing a challenging task. To overcome this routing dilemma, an improved distributed, multi‐hop, adaptive, tree‐based energy‐balanced (DMATEB) routing scheme is proposed in this paper. In this scheme, a relay node is selected in view of minimum distance and high energy from a current sensing node. Further, the parent node is chosen among the selected relay nodes on the basis of high residual energy and less power consumption with due consideration of its associated child nodes. As each sensing node itself selects its parent among the available alternatives, the proposed scheme offers a distributive and adaptive approach. Moreover, the proposed system does not overload any selected parent of a particular branch as it starts acting as a child whenever its energy lowers among the other available relay nodes. This leads to uniform energy utilization of nodes that offers a better energy balance mechanism and improves the network lifespan by 20% to 30% as compared with its predecessors.     

Joint load balanced stable routing and communication segment assignment in mobile cognitive radio ad‐hoc networks

The fundamental issues in mobile cognitive radio ad‐hoc networks are the selection of the optimal stable paths between nodes and proper assignment of the frequency channels/time slots (communication segments) to the links. In this paper, a joint load balanced stable routing and communication segment assignment algorithm is proposed that considers jointly the mobility prediction, mitigating the co‐channel interference and energy consumption. The novelty of the proposed algorithm lies in the increasing of the path stability, which benefits from the maximum link lifetime parameter and introduced weighting function to keep routes away from the PU's region. This avoids the negative impacts on the PUs' operations and decreases the conflict of the cognitive nodes. In the proposed algorithm, the concept of load balancing is considered that yields in the balancing energy consumption in the network, improving the network performance and distributing traffic loads on all available channels. The effectiveness of the proposed algorithm is verified by evaluating the aggregate interference energy, average end‐to‐end delay, goodput, and the energy usage per packet under 6 scenarios. The results show that the performance of the proposed algorithm is significantly better than the recently proposed joint stable routing and channel assignment protocol.     

基于博弈理论的无线传感器网络分布式节能路由算法

为了有效解决无线传感器网络路由节能问题,该文提出适合无线传感器网络的节能路由算法。在引入博弈理论概念建立网络模型的基础上,通过对于以往传感器网络簇首选择方法的研究,设计了一种基于博弈论的,兼顾节点剩余能量及簇首分布的节能路由DEER(DistributedEnergy-EconomicalRouting),大大节省了分布式决策网络协议的能量损耗。仿真证明了该方法在无线传感器网络中,能够有效地平衡网络负载,节省节点能量,延长网络寿命。     

Energy-efficient routing for correlated data in wireless sensor networks

In this paper, we investigate the reduction in the total energy consumption of wireless sensor networks using multi-hop data aggregation by constructing energy-efficient data aggregation trees. We propose an adaptive and distributed routing algorithm for correlated data gathering and exploit the data correlation between nodes using a game theoretic framework. Routes are chosen to minimize the total energy expended by the network using best response dynamics to local data. The cost function that is used for the proposed routing algorithm takes into account energy, interference and in-network data aggregation. The iterative algorithm is shown to converge in a finite number of steps. Simulations results show that multi-hop data aggregation can significantly reduce the total energy consumption in the network.     

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.     

An energy‐efficient localized topology control algorithm for wireless ad hoc and sensor networks

Topology control plays an important role in the design of wireless ad hoc and sensor networks and has demonstrated its high capability in constructing networks with desirable characteristics such as sparser connectivity, lower transmission power, and smaller node degree. However, the enforcement of a topology control algorithm in a network may degrade the energy‐draining balancing capability of the network and thus reduce the network operational lifetime. For this reason, it is important to take into account energy efficiency in the design of a topology control algorithm in order to achieve prolonged network lifetime. In this paper, we propose a localized energy‐efficient topology control algorithm for wireless ad hoc and sensor networks with power control capability in network nodes. To achieve prolonged network lifetime, we introduce a concept called energy criticality avoidance and propose an energy criticality avoidance strategy in topology control and energy‐efficient routing. Through theoretical analysis and simulation results, we prove that the proposed topology control algorithm can maintain the global network connectivity with low complexity and can significantly prolong the lifetime of a multi‐hop wireless network as compared with existing topology control algorithms with little additional protocol overhead. Copyright © 2008 John Wiley & Sons, Ltd.     

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

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.     

Load-balanced Multicast Tree Routing in Multi Channel Multi Radio Wireless Mesh Networks Using a New Cost Function

Wireless Mesh Network (WMN) is new emerging technology that offers low-cost high-bandwidth community wireless services. This type of network requires carefully assignment of resources and load balancing in order to provide the quality guarantees to traffic flows. Load balancing avoids the creation of bottleneck nodes, and increases the network efficiency. This paper addresses the problem of multicast load balancing in Multi-Channel Multi-Radio WMNs (MCMR-WMNs). In this regard, we introduce a novel load-aware dynamic cost function to weight the links of the network. Proposed cost function considers both the benefits of Wireless Broadcast Advantage (WBA) as well as the problem of load balancing. Also, we propose a Load-balanced Multicast Tree Routing (LMTR) algorithm which provides balanced multicast trees using the defined cost function. The proposed on-demand routing scheme not only minimizes the number of transmissions, but also tries to distribute the traffic among the nodes fairly and consequently decreases the interference in the network. We also demonstrate how proposed scheme can control the trade-off between load balancing and delay. Our extensive simulations in various networks with grid and random topologies show the efficiency of LMTR in load balancing. As you will see, LMTR significantly avoids the creation of bottleneck nodes and reduces the standard deviation of traffic load on mesh routers.     

Flower pollination algorithm‐based energy‐efficient stable clustering approach for WSNs

The advances in the size, cost of deployment, and user‐friendly interface of wireless sensor devices have given rise to many wireless sensor network (WSN) applications. WSNs need to use protocols for transmitting data samples from event regions to sink through minimum cost links. Clustering is a commonly used method of data aggregation in which nodes are organized into groups to reduce energy consumption. Nonetheless, cluster head (CH) has to bear an additional load in clustering protocols to organize different activities within the cluster. Proper CH selection and load balancing using efficient routing protocol is therefore a critical aspect for WSN's long‐term operation. In this paper, a threshold‐sensitive energy‐efficient cluster‐based routing protocol based on flower pollination algorithm (FPA) is proposed to extend the network's stability period. Using FPA, multihop communication between CHs and base station is used to achieve optimal link costs for load balancing distant CHs and energy minimization. Analysis and simulation results show that the proposed algorithm significantly outperforms competitive clustering algorithms in terms of energy consumption, stability period, and system lifetime.     

DUCR: Distributed unequal cluster‐based routing algorithm for heterogeneous wireless sensor networks

Designing energy efficient communication protocols for wireless sensor networks (WSNs) to conserve the sensors' energy is one of the prime concerns. Clustering in WSNs significantly reduces the energy consumption in which the nodes are organized in clusters, each having a cluster head (CH). The CHs collect data from their cluster members and transmit it to the base station via a single or multihop communication. The main issue in such mechanism is how to associate the nodes to CHs and how to route the data of CHs so that the overall load on CHs are balanced. Since the sensor nodes operate autonomously, the methods designed for WSNs should be of distributed nature, i.e., each node should run it using its local information only. Considering these issues, we propose a distributed multiobjective‐based clustering method to assign a sensor node to appropriate CH so that the load is balanced. We also propose an energy‐efficient routing algorithm to balance the relay load among the CHs. In case any CH dies, we propose a recovery strategy for its cluster members. All our proposed methods are completely distributed in nature. Simulation results demonstrate the efficiency of the proposed algorithm in terms of energy consumption and hence prolonging the network lifetime. We compare the performance of the proposed algorithm with some existing algorithms in terms of number of alive nodes, network lifetime, energy efficiency, and energy population.     

Clustering with Load Balancing-Based Routing Protocol for Wireless Sensor Networks

In this paper we propose a routing protocol based on clustering (IGP-C Protocol) to extend the lifetime in the context of wireless sensor networks while optimizing other resources (memory and processor). Firstly, a clustering algorithm and a load balancing technique are used together in order to reap the benefits of both approaches. The proposed clustering algorithm with load balancing (CALB Algorithm) is a fully distributed algorithm performed by each sensor and requires only communication with its immediate neighbors. Secondly, an Improved Gossiping Protocol (IGP) is proposed to extend the CALB algorithm to the data routing. The simulation results demonstrate the better and promising performances of the IGP-C protocol compared with the other protocols proposed in the literature. The IGP-C protocol allows a better distribution of energy, memory and processing capabilities of cluster-heads and reduces the number of clusters consisting of a single sensor along with the number of iterations. This demonstrates the effectiveness of the cluster-heads election process which improves the load balancing in the wireless sensors network in terms of cluster-heads load and clusters size. Furthermore, the proposed routing strategy builds around the clustering algorithm, is effective since it reduces the data transmission delay and prolongs the network lifetime.     

Coverage based inter cluster communication for load balancing in heterogeneous wireless sensor networks

Effective energy management in heterogeneous wireless sensor networks is more challenging issue compared to homogeneous wireless sensor networks. Much of the existing research focuses on homogeneous wireless sensor networks. The energy conservation schemes for the homogeneous wireless sensor networks do not perform efficiently when applied to heterogeneous wireless sensor networks. The proposed algorithm in this paper exploits the redundancy properties of the wireless sensor networks and also changes the inter cluster communication pattern depending on the energy condition of the high energy nodes during the life cycle of the heterogeneous wireless sensor networks. Performance studies indicate that the proposed algorithm effectively solves the problem of load balancing across the network and is more energy efficient compared to multi hop versions of the standard low energy adaptive clustering hierarchy protocol.     

A Tabu search based routing algorithm for wireless sensor networks

In this paper, a Tabu search based routing algorithm is proposed to efficiently determine an optimal path from a source to a destination in wireless sensor networks (WSNs). There have been several methods proposed for routing algorithms in wireless sensor networks. In this paper, the Tabu search method is exploited for routing in WSNs from a new point of view. In this algorithm (TSRA), a new move and neighborhood search method is designed to integrate energy consumption and hop counts into routing choice. The proposed algorithm is compared with some of the ant colony optimization based routing algorithms, such as traditional ant colony algorithm, ant colony optimization-based location-aware routing for wireless sensor networks, and energy and path aware ant colony algorithm for routing of wireless sensor networks, in term of routing cost, energy consumption and network lifetime. Simulation results, for various random generated networks, demonstrate that the TSRA, obtains more balanced transmission among the node, reduces the energy consumption and cost of the routing, and extends the network lifetime.     

Implementation of depth‐based routing and its enhancement in AquaSim–Next Generation for underwater wireless sensor networks

In the last decade, underwater wireless sensor networks have been widely studied because of their peculiar aspects that distinguish them from common terrestrial wireless networks. Their applications range from environmental monitoring to military defense. The definition of efficient routing protocols in underwater sensor networks is a challenging topic of research because of the intrinsic characteristics of these networks, such as the need of handling the node mobility and the difficulty in balancing the energy consumed by the nodes. Depth‐based routing protocol is an opportunistic routing protocol for underwater sensor networks, which provides good performance both under high and low node mobility scenarios. The main contribution of our work is presenting a novel simulator for studying depth‐based routing protocol and its variants as well as novel routing protocols. Our simulator is based on AquaSim–Next Generation, which is a specialized tool for studying underwater networks. With our work, we improve the state of the art of underwater routing protocol simulators by implementing, among other features, a detailed cross‐layer communication and an accurate model of the operational modes of acoustic modem and their energy consumption. The simulator is open source and freely downloadable. Moreover, we propose a novel and completely distributed routing protocol, named residual energy–depth‐based routing. It takes into account the residual energy at the nodes' batteries to select the forwarder nodes and improve the network lifetime by providing a more uniform energy consumption among them. We compare its performance with that of depth‐based routing protocol and a receiver‐based routing protocol implementing a probabilistic opportunistic forwarding scheme.