AVRM: adaptive void recovery mechanism to reduce void nodes in wireless sensor networks

Nowadays, routing in three-dimensional environments is necessary since sensor nodes are organized in those kinds of areas. In this routing mechanism, data packets are routed using geographic routing by constructing a forwarding area. It is assumed that nodes in the network are homogeneous which cont...

Full description

Saved in:
Bibliographic Details
Published inPeer-to-peer networking and applications Vol. 13; no. 3; pp. 987 - 1001
Main Authors Ayyasamy, A., Julie, E. Golden, Robinson, Y. Harold, Balaji, S., Kumar, Raghvendra, Son, Le Hoang, Thong, Pham Huy, Priyadarshini, Ishaani
Format Journal Article
LanguageEnglish
Published New York Springer US 01.05.2020
Springer Nature B.V
Subjects
Communications Engineering
Computer Communication Networks
Energy consumption
Energy levels
Engineering
Information Systems and Communication Service
Management
Network latency
Networks
Nodes
Packets (communication)
Position sensing
Recovery
Residual energy
Sensors
Signal,Image and Speech Processing
Wireless networks
Wireless sensor networks
WSN
GRP
Cluster head
Void recovery
Data packet
End-to-end delay
Online AccessGet full text

Cover

More Information
Summary:Nowadays, routing in three-dimensional environments is necessary since sensor nodes are organized in those kinds of areas. In this routing mechanism, data packets are routed using geographic routing by constructing a forwarding area. It is assumed that nodes in the network are homogeneous which contain the same energy level and sensing parameter. In this paper, we propose a new method to reduce the void node problem called Adaptive Void Recovery Mechanism, which is implemented by two folds namely position management and forwarding management concepts. Position management is implemented by sensing the surroundings using the base station and location management. Forwarding management is implemented using the assured factor value and cumulative value from the gathered data. The sensor nodes are elected with a minimized congestion packet latency value. Cluster-based routing technique is implemented to improve the network lifetime and network throughput. The proposed method is evaluated by simulation against the related methods like CREEP, EECS, FABC-MACRD in terms of End to End Delay, Residual Energy, Energy Consumption, Routing Overhead, Network Lifetime, and Network Throughput.
ISSN:1936-6442
1936-6450
DOI:10.1007/s12083-019-00865-6