Virtual Convex Polygon Based Hole Boundary Detection and Time Delay Based Hole Detour Scheme in WSNs

Shin, Inyoung; Pham, Ngoc Duy; Choo, Hyunseung

doi:10.1007/978-3-642-02556-3_70

Cited by 5 publications

(3 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In an improved approach [8], [9] that addresses the above issues, the information about this hole approximate area is disseminated to the nodes surrounding. When a packet received at a surrounding node which has this approximate area info (shape and size), this current node can compute a route which efficiently bypasses this approximate area, i.e.…”

Section: Introductionmentioning

confidence: 99%

“…Figure 7 illustrates our protocol. In this figure, 1 2 ... 8 is the convex hull of the hole ( (0) ), 1 2 ... 4 5 7 8 and 1 2 3 5 7 8 are (1) and (2) respectively (As (3) , (4) , ... can be computed similarly, we do not show its in this figure). The red line represents the 1 -covering polygon of (1) and the blue line represents the 2 -covering polygon of (2) .…”

mentioning

confidence: 95%

“…← vertex number of ( ) 3: ← vertex number of 4: if = 1 then 5: Drop the HBI message 6: else 7: if +1 ≥ ≥ then 8:…”

mentioning

confidence: 99%

See 2 more Smart Citations

Hole Approximation-Dissemination Scheme for Bounded-Stretch Routing in Sensor Networks

Nguyen

2014

2014 IEEE International Conference on Distributed Computing in Sensor Systems

View full text Add to dashboard Cite

The routing stretch in a sensor network with a large hole can be controlled if the network nodes have certain information about the hole location and shape, possibly by using some mechanism for hole boundary approximation and information dissemination. Here, the nodes on the hole boundary cooperate to approximately compute the hole shape, and then a compact description info can be created and disseminated to the surrounding area. However, a finer approximation (for smaller stretch) leads to a higher cost of dissemination, which could unlikely be affordable for the sensors. We provide an insightful analysis to this fundamental trade-off of the hole approximation problem, using a geometric model. Based on this we discuss an efficient approximation-dissemination scheme using a natural, heuristic approximation technique. For reasonable conditions (network is dense enough apart from the hole), we assure that the routing stretch is under a predefined threshold > 1 while the dissemination cost is also under tight control. Our initial experiment results also confirm that our approach is significantly more efficient and economical, compared to existing proposals.

show abstract

Section: Introductionmentioning

confidence: 99%