Robustness Situations in Cases of Node Failure and Packet Collision Enabled by TCNet: Trellis Coded Network - A New Algorithm and Routing Protocol

2018 ◽  
pp. 100-110
Author(s):  
Diogo F. Lima Filho ◽  
José R. Amazonas
Keyword(s):  
Routing Protocol ◽  
Node Failure ◽  
Packet Collision ◽  
Trellis Coded

An Energy Balance Routing Protocol Based on AODV

2014 ◽  
Vol 926-930 ◽  
pp. 2442-2445
Author(s):  
Hong Pan ◽  
Yong Zhang
Keyword(s):  
Energy Balance ◽  
Routing Protocol ◽  
Average Energy ◽  
Threshold Value ◽  
Residual Energy ◽  
Node Failure ◽  
End To End Delay ◽  
Aodv Protocol ◽  
Simulation Results ◽  
Minimal Residual

The best is to read these instructions and follow the outline of this text. AODV protocol is usually used to establish path in MANET while not consider energy controlling, this will lead to some nodes become invalid quickly. This paper presents an routing protocol called EAODV base on AODV, it selects the path where the average energy is the maximal and the minimal residual energy of node is higher than the threshold value to transmit data, it also can prolong the network lifetime. the simulation results show that EAODV can efficiently reduce node failure rate and the average end-to-end delay.

scholarly journals Detection of Node Failure Localization in Communication Networks

2018 ◽  
Vol 7 (3.12) ◽  
pp. 1149
Author(s):  
Nidhi Shekhawat ◽  
Shanil Panchamia ◽  
Ushasukhanya S
Keyword(s):  
Communication Networks ◽  
Polynomial Time ◽  
Network Topology ◽  
Routing Protocol ◽  
Node Failure ◽  
End To End ◽  
Failure Localization ◽  
Node Failures

We explore the capability of localizing node failures in communication networks from binary states (normal/failed) of end-to-end paths. Certain a set of nodes of importance, individually localizing failures inside this set necessitates that dissimilar noticeable path states connect with dissimilar node malfunction events. However, this circumstance is easier said than done to test on huge networks due to the requirement to itemise all promising node failures. Our first donation is a set of satisfactory/compulsory conditions for classifying a restricted numeral of failures within an uninformed node set that can be experienced in polynomial time. In adding up to network topology and positions of monitors, our circumstances also include restrictions forced by the penetrating mechanism used. We are here considering three probing mechanisms basically which differ according as to whether dimension paths are: (i) arbitrarily controllable; (ii) controllable but cycle-free; or (iii) uncontrollable (which are dogged by the evasion routing protocol). Our second donation is to calculate the potential of malfunction localization from beginning to end: 1) the utmost number of failures (wherever in the network) such that malfunctions inside a given node set can be exceptionally localized and 2) the major node set inside which failures can be exclusively localized underneath a given vault on the total amount of failures. Here both the methods in 1) and 2) can be transformed into the functions of a per-node property, which can be computed resourcefully based on the above satisfactory/compulsory conditions. We reveal how process 1) and 2) projected for enumerating malfunction localization capability can be used to calculate the collision of various parameters which includes topology, number of monitors, and probing mechanisms.  

scholarly journals Side Trip Multipath Routing Protocol for Spatial Node Failure in Data-Gathering WSNs

2016 ◽  
Vol 12 (4) ◽  
pp. 9161625
Author(s):  
Keisuke Fujita ◽  
Yumi Takaki ◽  
Chikara Ohta ◽  
Hisashi Tamaki
Keyword(s):  
Routing Protocol ◽  
Multipath Routing ◽  
Data Gathering ◽  
Node Failure
Sign in / Sign up

Export Citation Format

Share Document