Multipath Disjoint Routing Algorithm for Ad Hoc Wireless Sensor Networks

2005 ◽  
Author(s):  
Xiuli Ren ◽  
Haibin Yu
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Ad Hoc ◽  
Routing Algorithm ◽  
Wireless Sensor

scholarly journals DISTANCE AND HOPS-BASED ENERGY ESTIMATION IN WIRELESS SENSOR NETWORKS

2017 ◽  
Vol 10 (13) ◽  
pp. 85 ◽  
Author(s):  
Pradeep Kumar Ts ◽  
Sayali Chitnis
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Power Consumption ◽  
Ad Hoc ◽  
Routing Algorithm ◽  
Wireless Sensor ◽  
Transmission Power ◽  
Energy Estimation ◽  
Wide Range ◽  
Implementation Level

The world of internet of things (IoT) and automation has been catching a robust pace to impact wide range of commercial and domestic applications for some time now. The IoT holds ad-hoc or wireless sensor networks (WSNs) at its very primary implementation level, the hardware level. The increasing requirement of these networks demands a renewed and better design of the network that improves the already existing setbacks of WSNs, which is mainly the power consumption and optimization. Routing highly affects the power consumed in the nodes in WSNs, hence having a modified routing algorithm which is specific to the application and meets its needs, particularly it is a good approach instead of having a generalized existent routing approach. Currently, for WSN having adequate number of nodes, routing involves maximum number of nodes and hops so as to reduce power consumption. However, for restricted areas and limited nodes, this scenario concludes with using up more number of nodes simultaneously resulting in reducing several batteries simultaneously. A routing algorithm is proposed in this paper for such applications that have a bounded region with limited resources. The work proposed in this paper is motivated from the routing algorithm positional attribute based next-hop determination approach (PANDA-TP) which proposes the increase in number of hops to reduce the requirement of transmission power. The aim of the proposed work is to compute the distance between the sending and receiving node and to measure the transmission power that would be required for a direct(path with minimum possible hops) and a multi-hop path. If the node is within the thresh-hold distance of the source, the packet is undoubtedly transferred directly; if the node is out of the thresh-hold distance, then the extra distance is calculated. Based on this, the power boosting factor for the source node, and if necessary, then the extra number of nodes that would be required to transmit is determined. An extra decision-making step is added to this approach which makes it convenient to utilize in varied situations. This routing approach suits the current level of robustness that the WSNs demand. 

scholarly journals Swarm-Intelligence-Centric Routing Algorithm for Wireless Sensor Networks

Sensors ◽  
2020 ◽  
Vol 20 (18) ◽  
pp. 5164
Author(s):  
Changsun Shin ◽  
Meonghun Lee
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Swarm Intelligence ◽  
Network Performance ◽  
Ad Hoc ◽  
Routing Algorithm ◽  
Optimal Solution ◽  
Link Quality ◽  
Wireless Sensor ◽  
Control Message

The swarm intelligence (SI)-based bio-inspired algorithm demonstrates features of heterogeneous individual agents, such as stability, scalability, and adaptability, in distributed and autonomous environments. The said algorithm will be applied to the communication network environment to overcome the limitations of wireless sensor networks (WSNs). Herein, the swarm-intelligence-centric routing algorithm (SICROA) is presented for use in WSNs that aim to leverage the advantages of the ant colony optimization (ACO) algorithm. The proposed routing protocol addresses the problems of the ad hoc on-demand distance vector (AODV) and improves routing performance via collision avoidance, link-quality prediction, and maintenance methods. The proposed method was found to improve network performance by replacing the periodic “Hello” message with an interrupt that facilitates the prediction and detection of link disconnections. Consequently, the overall network performance can be further improved by prescribing appropriate procedures for processing each control message. Therefore, it is inferred that the proposed SI-based approach provides an optimal solution to problems encountered in a complex environment, while operating in a distributed manner and adhering to simple rules of behavior.

scholarly journals A survey on MANET protocols in wireless sensor networks

2018 ◽  
Vol 7 (2.31) ◽  
pp. 1
Author(s):  
C Cynthia, Prudhvi Krishna Saguturu ◽  
Komali Bandi ◽  
Srikanth Magulluri ◽  
T Anusha
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Ad Hoc ◽  
Routing Algorithm ◽  
Wireless Sensor ◽  
On Demand ◽  
Dynamic Source ◽  
Distance Vector ◽  
Demand Routing ◽  
Hoc Networks

In Wireless sensor networks and ad hoc networks nodes have a freedom to move from one place to another, they are self-configuring this type of the structure fulfil the requirements of several application. A survey on the different MANET protocols will be done in this paper. Mainly this paper will focus on the Quality of Service on the different parameters like Throughput and Delay between different protocols like AODV (Ad Hoc on Demand Distance Vector), DSDV (Destination-Sequenced Distance-Vector Routing), DSR (Dynamic Source Routing), and TORA (Temporary Ordered Routing Algorithm). DSDV is called as proactive protocol because they know everything about the nodes in the network before the communication start. DSR, AODV, TORA protocols are called reactive protocol because nodes in this network do not know anything about network. They are also called ON-DEMAND routing protocols. After this analysis you will come to know which MANET protocol is best for different application. 

Sign in / Sign up

Export Citation Format

Share Document