Adaptive Modeling of Routing Algorithms for Wireless Sensor Networks

Energy balance is an important performance index in the design of routing algorithm for wireless sensor networks. A swarm intelligence optimization based routing algorithm for wireless sensor networks is proposed, whose kernel idea is taking less hop numbers into consideration and choosing the nodes with less pheromone as next hop to avoid some nodespsila prematurely exhausting their energy because of too concentrated routes through the nodes. The experiments show that the algorithm proposed in this paper is better than the directed diffusion routing protocol both in end-to-end delay and global energy balance and can effectively balance the global energy consumption and prolong the network lifetime.

Wireless sensor networks area collection of a large number of unattended sensor nodes. The sensor nodes are dynamically deployed in the region. In wireless sensor networks, the unlicensed sensor nodes use their temporarily available vacant licensed channels or spectrum band in a telecommunication network. The many open challenges with issues such as adaptive in self-organisation, fault-tolerance and network scalability with cooperative spectrum sensing and sharing are identifying new challenges in wireless sensor networks. In this paper, we proposed the bio-inspired adaptive routing algorithm for cognitive radio wireless sensor networks. The utilisation of the foraging approach of ANTs and BEEs for making the decision of using the available spectrum sensing and sharing of channels over multi-hops communication, provides the method to utilise idle channel and decrease the delay for communication in wireless sensor network. In this paper, we design the algorithm to solve the issue of wireless sensor network and performance of classical routing protocol LEACH and cognitive radio sensor networks (CRSN) evaluates the parameters which proof the self-organisation routing algorithm.


 
 
 Cluditem is a routing algorithm for wireless sensor networks developed for applications of environmental monitoring with periodic measurement of variables. These applications tolerate a maximum phase shift of the clocks of nodes in the order of milliseconds. This paper proposes two centralized synchronization schemes that introduce a limited processing load. The objective of the work was to assess the impact on the energy consumption of the incorporation of synchronization techniques described. Simulations of the full communication protocol were conducted in the NS2 environment and a comparative study of results was performed. This study showed that the first proposed schema is more convenient with respect to energy consumption, when the area to monitor has reduced dimensions. On the other hand, the second scheme, although it permits to work in larger areas, introduces a decrease in the network lifetime in the order of 14%.
 
 

Popularity of Mobile Wireless Sensor Network (MWSN) has increased tremendously due to the ability to connect the physical world with the virtual world. In MWSN, Sensor nodes move freely in a target area without the need of any special infrastructure. MWSN has attracted many researchers as it has introduced unique challenges in aspects like resource management, coverage, routing protocols, security in many applications such as target tracking in military applications, detection of catastrophic events, environment monitoring, health applications etc. Due to mobility, routing process in MWSN has become more complicated as connections in the network can change dynamically. This paper proposes a Mobility-Aware Multi-Objective Hybrid Routing Algorithm (MMOHRA) for Wireless Sensor Network (WSN). MMOHRA selects the best route and forwards the data packets from source to sink using multiple metrics such as Average Energy consumption, Control Overhead, Reaction Time, LQI, and HOP Count. Performance of MMOHRA is compared with Simple Hybrid Routing Protocol (SHRP) and Dynamic Multi-objective Routing Algorithm (DyMORA) using metrics such as Average Energy Consumption, Packet Delivery Ratio, and Jitter. MMOHRA improves the Average Energy Consumption (AEC) by a factor of 14.1% as compared with SHRP and 8.13 % as compared to DyMORA. MMOHRA outperformed SHRP and DyMORA in terms of packet Delivery Ratio (PDR) by 10.17 % and 9.83 % respectively.

Recently, network localization systems that are based on inter-node ranges have received significant attention. Geographic routing has been considered an application which can utilize the location information from these localization systems. In this paper, we firstly recognize that sensor network localization algorithms generate positioning data with different error patterns compared to those networks where node positions are determined directly from GNSS measurements. Secondly, by simulating practical sensor network scenarios using data from our localization algorithm, we observe that existing geographic routing algorithms in wireless sensor networks (WSNs) adopt very simplistic methods in the treatment of position error, without due consideration of error distribution. Additionally, an insight is given into localization algorithms for WSNs with inhomogeneous error environments. Our observations represent an initial step toward a detailed understanding and design of efficient geographic routing algorithms in location aware WSNs.

Automatic localization is one of the major issues in Wireless Sensor Networks (WSN). DV-hop algorithm is a well-known localization algorithm in WSN but with limited localization accuracy. In this paper, an improved DV-hop localization algorithm in hybrid optical wireless sensor networks is proposed based on the optimization of the parameters in WSN. Various factors that affect the localization accuracy of the DV-hop algorithm in WSN are investigated, including the communication radius of the node, the number of beacon nodes and the number of the total nodes. As the DV-hop algorithm is applied into hybrid optical sensor and WSNs (O-WSN) with rectangular topology, different parameters have to be optimized accordingly. Simulation results show that the square topology outperforms the rectangle topology more than 45 % under the same network parameters using the improved DV-hop algorithm. Therefore another improved DV-hop called Sub-Square Weighted DV-hop (SSW DV-hop) is proposed for the rectangle topology. Both simulation and experiment results demonstrate that applying the SSW DV-hop algorithmin O-WSNs could significantly improve the localization accuracy.

This paper reports on a project to investigate, build upon and test a relatively new routing algorithm for wireless sensor networks. The algorithm is based on the behaviour of ants in nature. It attempts to address the need for an energy-efficient routing algorithm for wireless sensor networks. This journal article briefly discusses the algorithm’s design, including the algorithm outline and relevant data structures and formulae. The article proceeds to discuss the testing procedure and test results for the algorithm. Finally, a conclusion summarising findings and recommendations for future work is included.

The main goal of research concerning energy aware routing algorithm for wireless sensor network is to increase the lifetime and long-term connectivity of the wireless sensor networks. However, most of energy aware routing algorithms do not take into account the clustering mechanism efficiently. In this paper, we present an efficient energy aware routing algorithm for the wireless sensor networks. In our algorithm, the data aggregation technique and adaptive clustering mechanism are considered for reducing and compacting the cumulative size of packets on the wireless sensor networks. Simulation results show that the energy usage of EAR-ACM is significantly reduced compared with the previous clustering based routing algorithm for the sensor networks.KeywordsSensor NetworkSensor NodeWireless Sensor NetworkCluster HeadData PacketThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Routing algorithms for large-scale sensor networks should be capable of finding energy efficient paths to prolong the lifetime of the networks in a decentralized manner. With this respect, Ant System has several proper characteristics for routing algorithm in large-scale wireless sensor networks. First, its distributed mechanism enables routing algorithm to find a solution with only local information and be robust for uncertainties in wireless sensor networks. Second, the framework of the Ant System is proper to solve dynamic problems such as routing problem. Transition probability in Ant System can be used to estimate how good a given routing path is. Capturing these features, this work proposes two Ant Systems based routing algorithms, which are AS-RWSNs (Ant System for Routing in Wireless Sensor Networks) and SAAS-RWSN (Structure-Aware AS-RWSN). The AS-RWSN applies the original Ant System to routing algorithm for wireless sensor network and SAAS-RSN upgrades AS-RWSN with considering properties of network structure such as degree of node. In SAAS-RSN, sensors with high node degree have high data traffic since they have more routing paths. Consequently, SAAS-RSN achieves an energy balance over sensor network through this routing scheme. We demonstrate the effectiveness of the proposed algorithms by comparing three existing routing algorithms.

For the purpose of saving the resources of wireless sensor networks, it is necessary to fuse the existing data in wireless sensor networks. When using the current method to fuse data in wireless sensor networks, the fusing time is too long to remove the noise signal in wireless sensor networks effectively. In the process of fusing, data packet loss is easy to occur. There are some problems such as low fusion efficiency, poor denoising performance and high packet loss rate. A multi-path data hierarchical fusion method based on routing algorithm is proposed in this paper. The redundant node decision method based on mesh partitioning is combined with the grid algorithm and EECRS protocol to establish a routing protocol based on redundant node elimination, and the redundant data existing in the redundant nodes of the wireless sensor network is removed. Based on the statistical data of the data, the probability density function is deduced and analyzed, and the noise filtering matrix is constructed to optimize the measurement matrix and remove the noise existing in the wireless sensor network. The multi-path scheduling technology is used to synthesize the pheromone table and the data forwarding flow table, and the ant is used to actively monitor the link QOS real-time information in the path finding process to update the pheromone table and the flow table, and calculate the link idle rate according to the update result. According to the calculation result, the data transmission path is selected, and the multi-path data layer fusion is completed. The experimental results show that the proposed method has high fusion efficiency, good denoising performance and low packet loss rate.

A Wireless Sensor Network (WSN) is an emerging technology for a wide range of potential applications, including the environmental monitoring, medical, and target tracking systems. A WSN comprises a set of sensor nodes deployed in an area of interest. Sensor nodes are normally located in a dense and ad hoc manner, communicating each other in a multi-hop fashion in order to collect, process, and relay data. Most of WSNs are built on wireless, battery-powered sensor nodes. In such networks, it is hard to recharge or replace the energy-depleted nodes due to the desolate or harsh environment of the target area. Therefore, the efficient use of limited energy is a primary concern in designing protocols and usage strategies for WSNs. In this work an emergency scenario is considered and a WSN is used to monitoring the emergency area. To limit the power consumption, the WSN is activated only when the emergency occurs. Moreover an integrated protocol for routing and localization is developed to reduce communication, which is the most power-consuming operation in WSNs.

Wireless Sensor Networks (WSNs) are usually comprised of a large number of sensor nodes which have limited power resources and require energy efficient routing algorithms. We have presented an Adaptive Transmission Power - Geographical and Energy Aware Routing (ATP-GEAR) algorithm in this paper, which routes the packet towards the destination by calculating the cost of the neighbors of a node in terms of their location and current battery level and transmitting the packet to the lowest costing node with the minimum required transmission power. We analyze the performance of our algorithm based on total power consumption and end-to-end delay from source to destination. Simulation results show that ATP-GEAR yields almost 25% less power consumption and 17% less end-to-end delay when compared with traditional Cluster Based Routing (CBR).

In this study, the impact of route length on the performance of a routing protocol and flow admission control is analysed. First, the authors present an end‐to‐end available‐bandwidth‐based proactive routing protocol for ad‐hoc wireless sensor networks. The routing protocol maintains the best data forwarding path in terms of the end‐to‐end available bandwidth. Second, to determine the impact of route length on a routing protocol's performance, they modify the routing protocol. The modified available‐bandwidth‐based protocol trades‐off the end‐to‐end available bandwidth against the route length. Third, they integrate a state‐of‐the‐art flow admission control algorithm with the proposed protocols and a shortest hop‐count‐based protocol. Through simulations they evaluate the following: (i) performance of the proposed protocols and a state‐of‐the‐art available‐bandwidth‐based opportunistic protocol and (ii) the effectiveness of a state‐of‐the‐art flow admission control algorithm over proposed protocols and a shortest hop‐count‐based protocol. The simulation results demonstrate the following drawbacks of not considering the hop‐count metric: longer data forwarding paths, higher number of retransmissions, and reduced effectiveness of the admission control algorithm. The modified available‐bandwidth‐based proactive protocol provides the best overall performance. Therefore, using their results they conclude that route length impacts the performance of routing and flow admission control algorithms, but is not a singularly decisive factor.

One of the main emphases of the prevalent clustering and routing algorithms in wireless sensor networks is efficient energy utilization aimed towards enhanced network lifetime. In this paper we are proposing a clustering approach where the sensor nodes are clustered together based on a defined spatial correlation and the geographical location of each sensor nodes. The Cluster Head or Cluster Leader along with routing path is decided by our proposed algorithm based on the estimated chance-value during each rounds of data transfer. Thus in our scheme a multi-hop routing is effected wherein either two-level or three-level hops are dynamically chosen based on the spatial correlation existing between the nodes for the data transfer from the sensing node to the sink. It has been observed that our proposed algorithm outperforms the standard algorithms namely Low Energy Adaptive Clustering Hierarchy (LEACH), Stable Election Protocol (SEP) and Distributed Energy Efficient Clustering (DEEC) Protocol with regards to system throughput and Network Lifespan of WSN.

Due to the lack of accurate evaluation of the transmission characteristics of the wireless communication links, routing algorithms in wireless sensor networks may result in poor network performance. This paper presents a link quality-based reliable routing algorithm. According to the link qualities evaluated by RSSI, neighbor nodes can be partitioned into different regions. First, based on a realistic link model and test results, an asymmetric link region is indicated, where selecting a neighboring node in this region as the next hop node will greatly degrade the transmission reliability. Based on this, the neighboring area of a node is divided into four regions, that is, connected, transitional, asymmetric, and disconnected regions. Then, route selection ways for different regions are presented, and different priorities of the nodes in different regions to be selected as the next hop node are assigned. Finally, the performance of the RSRE is tested in a real-world test-bed consists of 40 nodes, and compared with the Min-hop routing algorithm and the ETX based routing algorithm. The results show that the RSRE has better data transmission reliability, and hop distribution.