scholarly journals A Routing Algorithm for Mobile Multiple Sinks in Large-Scale Wireless Sensor Networks

2007 ◽  
Author(s):  
Mujdat Soyturk ◽  
Turgay Altilar
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Large Scale ◽  
Routing Algorithm ◽  
Wireless Sensor ◽  
Multiple Sinks

scholarly journals Energy Aware Simple Ant Routing Algorithm for Wireless Sensor Networks

2015 ◽  
Vol 2015 ◽  
pp. 1-11
Author(s):  
Sohail Jabbar ◽  
Rabia Iram ◽  
Muhammad Imran ◽  
Awais Ahmad ◽  
Anand Paul ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Large Scale ◽  
Routing Algorithm ◽  
Wireless Sensor ◽  
Route Discovery ◽  
Route Selection ◽  
Energy Aware ◽  
Forwarding Node

Network lifetime is one of the most prominent barriers in deploying wireless sensor networks for large-scale applications because these networks employ sensors with nonrenewable scarce energy resources. Sensor nodes dissipate most of their energy in complex routing mechanisms. To cope with limited energy problem, we present EASARA, an energy aware simple ant routing algorithm based on ant colony optimization. Unlike most algorithms, EASARA strives to avoid low energy routes and optimizes the routing process through selection of least hop count path with more energy. It consists of three phases, that is, route discovery, forwarding node, and route selection. We have improved the route discovery procedure and mainly concentrate on energy efficient forwarding node and route selection, so that the network lifetime can be prolonged. The four possible cases of forwarding node and route selection are presented. The performance of EASARA is validated through simulation. Simulation results demonstrate the performance supremacy of EASARA over contemporary scheme in terms of various metrics.

scholarly journals Network Structure-Aware Ant-Based Routing in Large-Scale Wireless Sensor Networks

2015 ◽  
Vol 2015 ◽  
pp. 1-16 ◽  
Author(s):  
Kyungdoh Kim ◽  
Chunghun Ha ◽  
Changsoo Ok
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Sensor Network ◽  
Network Structure ◽  
Large Scale ◽  
Routing Algorithm ◽  
Routing Algorithms ◽  
Wireless Sensor ◽  
Node Degree ◽  
Ant System

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.

scholarly journals Design of Trusted Security Routing in Wireless Sensor Networks Based on Quantum Ant Colony Algorithm

2017 ◽  
Vol 13 (07) ◽  
pp. 4
Author(s):  
Xiaobin Shu ◽  
Caihong Liu ◽  
Chunxia Jiao ◽  
Qin Wang ◽  
Hongfeng Yin
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Wireless Sensor Network ◽  
Sensor Networks ◽  
Large Scale ◽  
Ant Colony Algorithm ◽  
Routing Algorithm ◽  
Ant Colony ◽  
Wireless Sensor ◽  
Font Size

<span style="font-family: 'Times New Roman',serif; font-size: 10.5pt; mso-ansi-language: EN-US; mso-fareast-font-family: 宋体; mso-fareast-language: ZH-CN; mso-bidi-language: AR-SA;" lang="EN-US">To d</span><span style="font-family: 'Times New Roman',serif; font-size: 10.5pt; mso-ansi-language: EN-US; mso-fareast-font-family: 宋体; mso-fareast-language: DE; mso-bidi-language: AR-SA;" lang="EN-US">esign an effective secure routing of trusted nodes in wireless sensor networks</span><span style="font-family: 'Times New Roman',serif; font-size: 10.5pt; mso-ansi-language: EN-US; mso-fareast-font-family: 宋体; mso-fareast-language: ZH-CN; mso-bidi-language: AR-SA;" lang="EN-US">, </span><span style="font-family: 'Times New Roman',serif; font-size: 10.5pt; mso-ansi-language: EN-US; mso-fareast-font-family: 宋体; mso-fareast-language: DE; mso-bidi-language: AR-SA;" lang="EN-US">quantum ant colony algorithm is applied to the design of large-scale wireless sensor network routing. The trustworthy network is used as the pheromone distribution strategy.</span><span style="font-family: 'Times New Roman',serif; font-size: 10.5pt; mso-ansi-language: EN-US; mso-fareast-font-family: 宋体; mso-fareast-language: DE; mso-bidi-language: AR-SA;" lang="EN-US">Then</span><span style="font-family: 'Times New Roman',serif; font-size: 10.5pt; mso-ansi-language: EN-US; mso-fareast-font-family: 宋体; mso-fareast-language: ZH-CN; mso-bidi-language: AR-SA;" lang="EN-US">,</span><span style="font-family: 'Times New Roman',serif; font-size: 10.5pt; mso-ansi-language: EN-US; mso-fareast-font-family: 宋体; mso-fareast-language: DE; mso-bidi-language: AR-SA;" lang="EN-US"> the pheromone is encoded by the quantum bit</span><span style="font-family: 'Times New Roman',serif; font-size: 10.5pt; mso-ansi-language: EN-US; mso-fareast-font-family: 宋体; mso-fareast-language: ZH-CN; mso-bidi-language: AR-SA;" lang="EN-US">. The pheromone is updated by the quantum revolving door, and the energy consumption prediction is carried out to select the path. Finally, the trusted security routing algorithm of the wireless sensor network based on the global energy balance is realized. </span><span style="font-family: 'Times New Roman',serif; font-size: 10.5pt; mso-ansi-language: EN-US; mso-fareast-font-family: 宋体; mso-fareast-language: DE; mso-bidi-language: AR-SA;" lang="EN-US">The quantum ant colony algorithm is superior to the traditional ant colony algorithm in algorithm convergence speed and global optimization. It can balance the energy consumption of the network node and can effectively resist the attacks such as Wormholes.</span><span style="font-family: 'Times New Roman',serif; font-size: 10.5pt; mso-ansi-language: EN-US; mso-fareast-font-family: 宋体; mso-fareast-language: DE; mso-bidi-language: AR-SA;" lang="EN-US">It is very promising to apply the quantum ant colony algorithm to the routing algorithm of large scale wireless sensor networks.</span>

Sign in / Sign up

Export Citation Format

Share Document