An Improved Routing Strategy for Dynamic ZigBee Network

2011 ◽  
Vol 403-408 ◽  
pp. 2556-2559
Author(s):  
Yi Zhang ◽  
Li Jia Chen ◽  
Hui Ying Wei
Keyword(s):  
Large Scale ◽  
Ad Hoc ◽  
Wireless Sensor ◽  
Route Discovery ◽  
Sink Node ◽  
Radio Interference ◽  
Data Packets ◽  
On Demand ◽  
Routing Strategy ◽  
Distance Vector

The unstable areas caused by radio interference or rapidly change of nodes' location always emerge inevitably and unpredictably in the WSN (Wireless Sensor Network) of large scale. They may seriously hinder the route discovery procedures in the network. An improved routing strategy named AONDVjr (Ad hoc On-demand Navigated Distance Vector Junior) which keeps monitoring and exploiting unstable areas in ZigBee networks is proposed in this paper. This scheme selects navigation nodes at the borders of unstable areas by comparing and analyzing the parameters including area stability and node’s depth. The navigation nodes will provide source nodes with latest and short routes through unstable areas and forward data packets to sink node.

scholarly journals Co-operative Detection for Malicious Nodes in Under-Attack WSN

2018 ◽  
Vol 7 (2.24) ◽  
pp. 489
Author(s):  
Shweta Ranjan Vikas ◽  
B Priyalakshmi ◽  
Nikita Gautam ◽  
Sairam Potti
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Node ◽  
Ad Hoc ◽  
Wireless Sensor ◽  
Malicious Nodes ◽  
On Demand ◽  
End To End Delay ◽  
Cluster Environment ◽  
Distance Vector ◽  
End To End

The network security must be taken into consideration in wireless sensor networks. In our project, we take sensor node data falsification (SNDF) attack using malicious nodes and co-operative detection is used. Fusioncentre collects information from the nodes created in a cluster environment and makes a global decision. The protocol used here is Ad-hoc-on demand distance vector[5] (AODV) and the performance analysis is done using parameters such as throughput and End-to-end delay. The stimulation is done in NS2 using network animator and graphical results are taken.The throughput will be increased compared to the existing system whereas End-to-End delay will be decreased.  

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. 

scholarly journals Enhanced Route Discovery Mechanism of Ad-Hoc On Demand Distance Vector for MANET

2016 ◽  
Vol 3 (6) ◽  
pp. 1
Author(s):  
May Sayed A. Nouh ◽  
Salwa H. El-ramly ◽  
M. Zaki ◽  
Husein A. A. Elsayed
Keyword(s):  
Ad Hoc ◽  
Route Discovery ◽  
On Demand ◽  
Distance Vector

scholarly journals A novel routing protocol considering the boundary effects for ad hoc networks

2020 ◽  
Vol 16 (1) ◽  
pp. 155014772090363
Author(s):  
Qingwen Wang ◽  
Haitao Yu
Keyword(s):  
Ad Hoc Networks ◽  
Routing Protocol ◽  
Ad Hoc ◽  
Boundary Effects ◽  
Node Degree ◽  
Route Discovery ◽  
Discovery Process ◽  
On Demand ◽  
Distance Vector ◽  
Hoc Networks

To alleviate the broadcast storm problem in the route discovery process, this article proposes a novel routing protocol considering the boundary effects for ad hoc networks, named NRP. The novelty of NRP lies in the following: first, NRP defines a forwarding area criterion considering the effects of the node transmission area boundary to reduce the broken links due to the mobility of nodes; second, NRP adopts the idea of a piecewise function to estimate the node degree when the nodes are in the center, borderline, and corner areas, respectively, which considers the effects of both network boundaries and node communication boundaries without broadcasting Hello messages periodically; third, NRP applies the static game forwarding strategy to calculate the forwarding probability during the route discovery process. NRP reduces the redundant retransmissions and collision probability among neighboring nodes, thus improving the forwarding efficiency. The extensive simulation results by NS-2 simulator have shown that NRP performs better than AODV + FDG, AODV + Hello, ad hoc on-demand distance vector, ad hoc on-demand multipath distance vector, and energy-efficient ant-based routing in terms of packet delivery ratio, routing overhead, normalized medium access control load, throughput, and network lifetime.

Sign in / Sign up

Export Citation Format

Share Document