Paper Info
Title
Physical-traffic attentive vigorous routing (P-TAVR) and hot-spot detection to reduce the bottleneck in WSN
Abstract
Minimizing the duration of data transmission is one of the major challenges in the wireless sensor communication. The sensor nodes in the networks take certain duration for observing the nearby sensor devices. Prominent factors such as broadcast storms, low bandwidth, multicasting, artificial congestion, etc can cause the bottleneck, results in data loss. In order to reduce the bottleneck in the sensor networks, physical traffic attentive vigorous routing protocol (P-TAVR) is proposed. This protocol will reduce the bottleneck effect by detecting the hot-spots thus reducing the network traffic. The proposed method is presented with three different phases such as Run-up, Set-up, Routing and detection phases. With the use of physical knowledge in this protocol, the location as well as the energy of every other sensor node is known by all the sensor nodes in the stream. In addition, an efficient modified routing algorithm is presented to select the cluster head nearer to the sink next hop. So that, in case of the bottleneck, the nodes are capable of determining the best possible routes with higher energy nodes for data transmission. Since the protocols utilized by the WSNs are application oriented; three classes such as data-centric, hierarchical and location-based classes are investigated. The simulation tool used here is Network Simulator 2 and the comparison has been made with AODV, MintRoute and TADR. The parameters such as End to End Delay, Throughput, Energy Consumption and Packet delivery ratio have been investigated for two cases such as increasing simulation time and increasing density. The results show that P-TAVR provides higher efficiency and throughput among the existing methods.
Year
DOI
Venue
2019
10.1007/s10586-018-1763-5
Cluster Computing
Keywords
Field
DocType
Bottleneck effect, CH selection, Hot-spot detection, Traffic attentive vigorous routing, Self-physical data
Sensor node,Bottleneck,End-to-end delay,Ad hoc On-Demand Distance Vector Routing,Computer science,Network packet,Real-time computing,Throughput,Wireless sensor network,Routing protocol
Journal
Volume
Issue
ISSN
22
SP2.0
1573-7543
Citations 
PageRank 
References 
0
0.34
10
Authors
2
Name
Order
Citations
PageRank
K. Praghash132.76
R. Ravi210.69