A routing algorithm based on simulated annealing algorithm for maximising wireless sensor networks lifetime with a sink node

Wireless sensor networks (WSNs) are a group of wireless sensor nodes, those sensor nodes with sensing and monitoring of environmental information. Energy consumption is an important topic; the node's power is limited. Therefore, we proposed an Opportunistic Large Array Concentric Geographic Routing Algorithm (OLACGRA) to reduce the node’s energy consumption and analysis the characteristic of energy model. The sink position of our proposed OLACGRA is at the center of concentric topology architecture. The source node wants to transmit data that it needs to calculate the distance between source node and sink node. If this distance bigger than threshold value, we use the multi-hop manner. Otherwise, source node transmits data to sink node directly. Simulation results show that our proposed algorithm can effectively reduce the node’s energy consumption.

Download Full-text

A Restricted Multipath Routing Algorithm in Wireless Sensor Networks Using a Virtual Cylinder: Bypassing Black hole and Selective Forwarding Attacks

UHD Journal of Science and Technology ◽

10.21928/uhdjst.v3n2y2019.pp51-58 ◽

2019 ◽

Vol 3 (2) ◽

pp. 51

Author(s):

Elham Bahmani ◽

Aso Mohammad Darwesh Darwesh ◽

Mojtaba Jamshidi ◽

Somaieh Bali

Keyword(s):

Wireless Sensor Networks ◽

Energy Consumption ◽

Sensor Networks ◽

Routing Algorithm ◽

Source Node ◽

Wireless Sensor ◽

Sink Node ◽

Packet Delivery ◽

Selective Forwarding ◽

Routing Method

In this paper, a simple and novel routing algorithm is presented to improve the packet delivery in harsh conditions such as selective forwarding and blackhole attacks to the wireless sensor networks. The proposed algorithm is based on restricted multi-path broadcast based on a virtual cylinder from the source node to the sink node. In this algorithm, when a packet is broadcast by a source node, a virtual cylinder with radius w is created from the source node to a sink node. All the nodes located in this virtual cylinder are allowed to forwardthe packet to the sink. Thus, data is forwarded to sink via multiple paths, but in a restricted manner so that the nodes do not consume a high amount of energy. If there are some compromised nodes in this virtual cylinder, the packets may be forwarded to the sink via other nodes of the virtual cylinder. The proposed algorithm is simulated and evaluated in terms of packet delivery rate and energy consumption. The experiment results show that the proposed algorithm increases packet delivery rate 7 times compared to the single-path routing method and reduces energy consumption up to three times compared to flooding routing method.

Download Full-text

A Clustering Routing Algorithm Based on Improved Ant Colony Optimization Algorithms for Underwater Wireless Sensor Networks

Algorithms ◽

10.3390/a13100250 ◽

2020 ◽

Vol 13 (10) ◽

pp. 250

Author(s):

Xingxing Xiao ◽

Haining Huang

Keyword(s):

Wireless Sensor Networks ◽

Energy Consumption ◽

Sensor Networks ◽

Ant Colony Optimization ◽

Routing Algorithm ◽

Ant Colony ◽

Wireless Sensor ◽

Sink Node ◽

Underwater Wireless Sensor Networks ◽

Head Node

Because of the complicated underwater environment, the efficiency of data transmission from underwater sensor nodes to a sink node (SN) is faced with great challenges. Aiming at the problem of energy consumption in underwater wireless sensor networks (UWSNs), this paper proposes an energy-efficient clustering routing algorithm based on an improved ant colony optimization (ACO) algorithm. In clustering routing algorithms, the network is divided into many clusters, and each cluster consists of one cluster head node (CHN) and several cluster member nodes (CMNs). This paper optimizes the CHN selection based on the residual energy of nodes and the distance factor. The selected CHN gathers data sent by the CMNs and transmits them to the sink node by multiple hops. Optimal multi-hop paths from the CHNs to the SN are found by an improved ACO algorithm. This paper presents the ACO algorithm through the improvement of the heuristic information, the evaporation parameter for the pheromone update mechanism, and the ant searching scope. Simulation results indicate the high effectiveness and efficiency of the proposed algorithm in reducing the energy consumption, prolonging the network lifetime, and decreasing the packet loss ratio.

Download Full-text

Distributed Lifetime Optimized Routing Algorithm for Wireless Sensor Networks

Applied Mechanics and Materials ◽

10.4028/www.scientific.net/amm.40-41.448 ◽

2010 ◽

Vol 40-41 ◽

pp. 448-452 ◽

Cited By ~ 1

Author(s):

You Rong Chen ◽

Li Yu ◽

Qi Fen Dong ◽

Zhen Hong

Keyword(s):

Wireless Sensor Networks ◽

Sensor Networks ◽

Network Lifetime ◽

Routing Algorithm ◽

Cost Effective ◽

Residual Energy ◽

Wireless Sensor ◽

Sink Node ◽

Simulation Results ◽

Routing Tree

The network hub nodes consumed excessive energy and failed prematurely, thus it reduced the network lifetime. In order to solve the problem, distributed lifetime optimized routing algorithm (DLOR) for wireless sensor networks was proposed. Energy for transmitting data and neighbor node residual energy were considered comprehensively. Then new weight function was introduced and distributed asynchronous Bellman-Ford algorithm was also used to construct the shortest routing tree. Finally, data were gathered along the shortest routing tree to sink node. Simulation results show that DLOR algorithm can extend network lifetime and enable cost-effective energy consumption. Under certain conditions, DLOR algorithm outperforms PEDAP, GreedyDijkstra, LET, Ratio-w and Sum-w algorithms.

Download Full-text

A Routing Algorithm for Wireless Sensor Networks based on Vector Field Theory

International Journal of Online Engineering (iJOE) ◽

10.3991/ijoe.v12i03.5407 ◽

2016 ◽

Vol 12 (03) ◽

pp. 22

Author(s):

Li Ming ◽

Qian HuanYan

Keyword(s):

Field Theory ◽

Wireless Sensor Networks ◽

Vector Field ◽

Sensor Networks ◽

Routing Algorithm ◽

Wireless Sensor ◽

Sink Node ◽

Network Load ◽

Scenarios Simulation ◽

Simulation Results

To standardize network load and increase throughput, a new scheme is proposed to analyze the routing of wireless sensor networks (WSNs). First, the WSN model was established based on field theory with vectors and operators to analyze the transfer process of message packets given that the source node in such networks is characterized by source points while the sink node can be regarded as a gathering point. Second, a vector routing algorithm was developed for a WSN that was modeled according to field theory. Finally, the WSN routing algorithm was simulated in given two scenarios; simulation results show that throughput can be significantly increased by choosing routes such that traffic is spread as uniformly as possible throughout the network.

Download Full-text