2015
DOI: 10.5815/ijisa.2015.06.06
|View full text |Cite
|
Sign up to set email alerts
|

Fault Tolerant Multi-Criteria Multi-Path Routing in Wireless Sensor Networks

Abstract: The Ad Hoc On-Demand Multi-Path Distance Vector (AOMDV) routing protocol allows the transport of data along one or more paths in wireless sensor networks (WSNs). The path chosen is based on a single shortest path hop count metric. The data on some WSNs is mission critical, for example, military and health care applications. Hence, fault tolerance in WSNs is becoming increasingly important. To improve the fault tolerance of WSNs in lossy environments, this work adds to the AOMDV routing protocol as it incorpora… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 10 publications
(6 citation statements)
references
References 36 publications
0
6
0
Order By: Relevance
“…Exact restoration of connections gave additional strength to the network and enhance the lifetime of network. Koffka Khan et al [8] [2015]implemented an improved AOMDV protocol which can be react to lossy environments and effective to fault tolerance. A packet loss percentage metric is added to node disjoint paths for calculate the amount of packet loss in that communication.…”
Section: Literature Surveymentioning
confidence: 99%
“…Exact restoration of connections gave additional strength to the network and enhance the lifetime of network. Koffka Khan et al [8] [2015]implemented an improved AOMDV protocol which can be react to lossy environments and effective to fault tolerance. A packet loss percentage metric is added to node disjoint paths for calculate the amount of packet loss in that communication.…”
Section: Literature Surveymentioning
confidence: 99%
“…In-order to prolong the network"s lifetime, it is necessary to maintain sufficient charge in all the nodes. Using a single node as a cluster head leads to faster power depletion in the node [9]. Hence it is important that to periodically alternate the component nodes as the cluster head.…”
Section: Cluster Head Monitoringmentioning
confidence: 99%
“…Initially, these algorithms were constructed CDS under specific conditions; later nodes in CDS formed clusters using neighbouring nodes. In 1998, Guha et al, proposed two centralized greedy heuristic algorithms [6] for dominating set problem. The first algorithm was a growing tree (T) based algorithm, starting from a maximum degree vertex as a root.…”
Section: Related Workmentioning
confidence: 99%
“…Due to high data processing overheads, premature death of CHs is a major issue in the design of clustering algorithms [6]. To overcome this, existing algorithms perform periodic re-clustering, but every attempt of reclustering generates more control messages.…”
Section: Introductionmentioning
confidence: 99%