An Efficient Bypassing Void Routing Protocol Based on Virtual Coordinate for WSNs

Zhang, Dejing; Dong, Enqing

doi:10.1109/lcomm.2015.2403837

Cited by 21 publications

(14 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Separating the surrounding region of void into 3 different regions is the most important functionalities of the void region dividing phase, where separate routings strategy was used [9]. On the bases of the positions of void and destination node location of any packets, surroundings regions are dividing into 3 forms that is departing region, approaching regions and free regions has showing in the The 2 tangent lines of area of the circle of virtual mapping, receive the departing region, is called as the approaching area of the outside 2 tangent lines defined in free region of circle of Virtual mapping shown in the fig.6 C region.…”

Section: Breaking Phases In Void Regionsmentioning

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

Section: Breaking Phases In Void Regionsmentioning

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

show abstract

“…The sensors in each cluster forward the relevant information or data to CHs after an event or periodically. Subsequently, CHs directly transmit the information to a BS directly [18,19]. In fact, clustering technique includes certain advantages and some of them are (i) clustering could maintain communication bandwidth and can avoid redundancy of transmitting data, (ii) clustering could stabilize network topology at the sensor level and can minimize the communication overhead as well.…”

Section: Introductionmentioning

confidence: 99%

“…In cluster-based routing, CH [19,20] takes the complete responsibility for data transmission; thereby network prolonging is highly possible via balancing the energy consumption which, is to be noted for the precise or optimal selection of cluster head [21,22]. The number of works has been progressed with cluster-based routing strategy through the utilization of recent metaheuristic and machine learning algorithms [23][24][25][26][27].…”

Section: Introductionmentioning

confidence: 99%

Hybrid optimization algorithm for security aware cluster head selection process to aid hierarchical routing in wireless sensor network

2021

View full text Add to dashboard Cite

In wireless sensor networks, clustering is said to be the most noteworthy technique for increasing the lifetime of network that directly leads a better routing mechanism. This approach involves grouping of sensor nodes to clusters and choosing the appropriate cluster heads for each cluster. In fact, cluster heads gathers data from corresponding nodes in cluster and transmits those aggregated data to base station. However, the major issue in this is the selection of the appropriate cluster head. Till now, many research works have been carried out for solving this issue by considering different constraints. This paper introduces a new cluster-based routing model by selecting the optimal cluster head. Moreover, a novel algorithm known as grey wolf updated whale optimization algorithm is introduced. Here, a new multi-objective function is defined with respect to different constraints like distance, delay, security and energy, respectively. Finally, the performance of security aware clustering with grey wolf updated whale optimization algorithm is evaluated and validated over other conventional works with respect to alive node analysis, throughput and normalized network energy, respectively.This is an open access article under the terms of the Creative Commons Attribution License, which permits use, distribution and reproduction in any medium, provided the original work is properly cited.

show abstract

“…In [11], a right-hand based method to anticipate voids and a routing protocol are proposed to bypass them. In [5], a method based on the locations of the transmitter node is presented to determine the left or right side of the network to route messages by avoiding voids.…”

Section: Introduction and Related Workmentioning

confidence: 99%

Detecting gaps and voids in WSNs and IoT networks

Bezoui

Bounceur

Lagadec

et al. 2018

Proceedings of the 2nd International Conference on Future Networks and Distributed Systems

View full text Add to dashboard Cite

A random deployment of Wireless Sensor Networks (WSNs) is often the basic structure used in the context of re forest detection, military applications or any situation where the zone-of-interest is not accessible by humans. The main problematic in this kind of deployment is the formation of gaps or voids, which represent a zone which is not covered in the network. This reduces signicantly its Quality of Service and can lead to serious problems, like a nondetected starting re, the presence of unexpected persons or attacks, etc. Therefore, detecting zones that are not covered by the WSN is of great importance. In this paper, we present a new method allowing to detect gaps and voids in WSNs or in IoT networks by using some characteristics of the angles of the polygon formed by the boundary as determined by the D-LPCN algorithm. These angles can be interior or exterior. Characterizing the angles of the polygon formed by these boundary nodes allows to specify whether this boundary is a gap or a void, in case where the obtained polygon is interior. Since D-LPCN is fault-tolerant, the simulation results show that it is possible to use it for the detection of faulty nodes and intrusions. 1

show abstract

An Efficient Bypassing Void Routing Protocol Based on Virtual Coordinate for WSNs

Cited by 21 publications

References 8 publications

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

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

Hybrid optimization algorithm for security aware cluster head selection process to aid hierarchical routing in wireless sensor network

Detecting gaps and voids in WSNs and IoT networks

Contact Info

Product

Resources

About