VAGR — Void aware in geographic routing for wireless sensor networks

Revathi, A.; Malathy, N.

doi:10.1109/isco.2016.7727095

Cited by 7 publications

(5 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Traditional WMSN routing methods may not work as well in this network model as they do in random duty-cycle WMSNs. Some changes must be made first to meet the QoS requirements [8][9][10][11]. We keep doing study based on the TPGF, and our goal is to change the TPGF routing measure so that end-to-end latency is better.…”

Section: Figure 1 Fundamental Block Diagram Of Wireless Sensor Networ...mentioning

confidence: 99%

Efficient Geographic Routing for High-Speed Data in Wireless Multimedia Sensor Networks

Pandith,

Ramaswamy,

Srikantaswamy

et al. 2023

JESA

View full text Add to dashboard Cite

In recent eras, a large amount of data has been transferred through wireless networks in fifth-generation communication using a two-phase geography greedy forwarding (TPGF) routing algorithm with reconfigurable routing metrics represented by RrTPGF in random duty-cycled wireless multilevel multimedia sensor networks (WMSNs). The proposed method reduces the sleep delay in geographic routing networks. the systematically forwarded node in the geographic routing network to identify the significant neighboring nodes. The proposed algorithm is efficient in identifying the geographical distance of the neighboring node and identifying the sleeping delay of the nodes during the communication process. The proposed algorithm efficiently differentiates the worked node from the unworked node on the basis that it identifies the optimal single routing path with a low sleeping delay time at geographic routing. As per the simulation result, the performance of the proposed method shows better results as compared to the conventional methods when considering the scenario size of 750mm × 450mm and 250 nodes with respect to the average delay of the proposed method, which is reduced to 0.6%, and the average hop counts, which are reduced to 0.56% as compared to the conventional method.

show abstract

Section: Figure 1 Fundamental Block Diagram Of Wireless Sensor Networ...mentioning

confidence: 99%

Efficient Geographic Routing for High-Speed Data in Wireless Multimedia Sensor Networks

Pandith,

Ramaswamy,

Srikantaswamy

et al. 2023

JESA

View full text Add to dashboard Cite

show abstract

“…To fill communication voids, which can be formed by the random distribution of sensor nodes in the grid, the BVR-VCM (Bypassing Void Routing based on Virtual Coordinate Mapping) [ 34 ] algorithm is able to form a virtual circle from the coordinates of the edge nodes. The goal is to convert a random structure of nodes that form a possible hole into a regular structure by mapping the coordinates of the edge nodes to a virtual circle.…”

Section: Related Workmentioning

confidence: 99%

PAtCH: Proactive Approach to Circumvent Holes in Wireless Sensor Networks

Lima,

Sardinha,

Balico

et al. 2023

Sensors

View full text Add to dashboard Cite

The occurrence of hole regions in Wireless Sensor Networks is a significant challenge when applying a greedy technique in a geographic routing approach. The local minimum phenomenon is commonly attributed to physical obstacles, energy depletion of the nodes, failures in communication between neighbors, or even the incorrect deployment of the nodes in the sensing field. To address the problem of hole regions, most approaches choose to abandon the traditional greedy forwarding mechanism to temporarily adopt the well-known perimeter routing scheme applied to nearby nodes or along the edge of a region of a hole. However, this mechanism does not satisfy the network load balance requirement, because it imposes too much traffic to the nodes in the hole’s edge, making them overloaded when compared to other network nodes more distant from holes. In this work, we propose a novel location-free geographic routing technique called PAtCH (Proactive Approach to Circumvent Holes in Wireless Sensor Network) to avoid routing holes in WSNs. Our solution can circumvent hole regions and create routing paths toward the destination. We consider that our sink has a higher communication range, and the Received Signal Strength Indicator (RSSI) is used to assist the construction of the routing paths. Our results show the efficiency achieved by our proposed solution in scenarios with hole regions, also maintaining all the benefits of a classic greedy forwarding technique.

show abstract

“…Now neighboring node that too n2 is (n1, n2, n3) where the non of the node is very close to the destinations node d1, hence the routing void is encountered and fails the greedy forwarding. Similarly, at node n5 also routing void is encountered when it being try to send packet to destination node n2 [6] [11].…”

Section: A Routing Void In Geo-graphic Routing Protocolmentioning

confidence: 99%

“…Since the last ten years, Wireless Sensor Networks (WSNs) has been hugely used in Varity of forms where routing protocols is most important major key technology [6] [12]. Sensors nodes have been only depending paths thus exploits the all information off local neighboring node of Geographical routing nodes, routing protocols around the Geo-graphical information is much efficient.…”

mentioning

confidence: 99%

An Efficient Void Routing in Geo-Graphics Routing Networks Depend on Virtual Co-Ordinates in WSN

S*¹,

Bhutada²

2019

IJRTE

View full text Add to dashboard Cite

For overcoming the obstacle of void routing on Geo-graphical routing, maximum controlling overheads and transmissions delayed have been used over wireless sensors network. Impress with the structures of composing edges node is don’t void routing, an adequate bypassings routings void protocols depends upon the virtual coordination is proposed. The simple ideas over the protocols is to sends a randomly structures of void edge over the regular once using mapping by edges node coordination into a virtual cycle. By using the virtual cycle, we can avoid the greedy forwardings from fail, such that there will not be routings void in forwardings protocols from sources to destinations and we can reduce the controlling overheads. Further, we can reduce the common lengths of routings path and minimize the transmissions delaying by using the virtual circle. Simulation highlights the higher delivery ratios; shorten the paths lengths, low controlling packets overheading and very less energies consumptions.

show abstract

VAGR — Void aware in geographic routing for wireless sensor networks

Cited by 7 publications

References 19 publications

Efficient Geographic Routing for High-Speed Data in Wireless Multimedia Sensor Networks

Efficient Geographic Routing for High-Speed Data in Wireless Multimedia Sensor Networks

PAtCH: Proactive Approach to Circumvent Holes in Wireless Sensor Networks

An Efficient Void Routing in Geo-Graphics Routing Networks Depend on Virtual Co-Ordinates in WSN

Contact Info

Product

Resources

About