An efficient geographic algorithm for routing in the proximity of a large hole in wireless sensor networks

Vu, Huy; Nguyễn, Tiến Dũng; Nguyen, Chi Q.; Nguyen, Van Khanh

doi:10.1145/3011077.3011101

Cited by 2 publications

(4 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [8], a procedure is proposed to avoid creating hotspots around the hole boundary. However, the routing algorithm may compute the unnecessarily high route stretch.…”

Section: Routing In Close Proximity To a Holementioning

confidence: 99%

“…As k o , k a and k i are smaller than k max o , k max a and k max i , respectively, from (6), 7, (8) and 16, we have:…”

Section: Routing Stretchmentioning

confidence: 99%

“…It worth emphasizing that greedy geographic routing algorithms [2][3][4][5][6][7] do not work well in the presence of holes. Recently, the problem of ''routing in a cavern'' has been tackled in [8] and [9]. However, these schemes [8,9] could not achieve a small route stretch and suffer from possible congestion in hotspots.…”

Section: Introductionmentioning

confidence: 99%

“…Recently, the problem of ''routing in a cavern'' has been tackled in [8] and [9]. However, these schemes [8,9] could not achieve a small route stretch and suffer from possible congestion in hotspots.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Energy-efficient routing in the proximity of a complicated hole in wireless sensor networks

Nguyen

et al. 2021

Wireless Netw

View full text Add to dashboard Cite

A quest for geographic routing schemes of wireless sensor networks when sensor nodes are deployed in areas with obstacles has resulted in numerous ingenious proposals and techniques. However, there is a lack of solutions for complicated cases wherein the source or the sink nodes are located close to a specific hole, especially in cavern-like regions of large complex-shaped holes. In this paper, we propose a geographic routing scheme to deal with the existence of complicated-shape holes in an effective manner. Our proposed routing scheme achieves routes around holes with the (1+$$\epsilon$$ ϵ )-stretch. Experimental results show that our routing scheme yields the highest load balancing and the most extended network lifetime compared to other well-known routing algorithms as well.

show abstract

“…In [8], a procedure is proposed to avoid creating hotspots around the hole boundary. However, the routing algorithm may compute the unnecessarily high route stretch.…”

Section: Routing In Close Proximity To a Holementioning

confidence: 99%

“…As k o , k a and k i are smaller than k max o , k max a and k max i , respectively, from (6), 7, (8) and 16, we have:…”

Section: Routing Stretchmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Energy-efficient routing in the proximity of a complicated hole in wireless sensor networks

Nguyen

et al. 2021

Wireless Netw

View full text Add to dashboard Cite

show abstract

Stable low-stretch routing scheme for wireless sensor networks with a large hole of complicated shape

Nhan

Nguyen

2018

2018 5th NAFOSTED Conference on Information and Computer Science (NICS)

View full text Add to dashboard Cite

An efficient geographic algorithm for routing in the proximity of a large hole in wireless sensor networks

Cited by 2 publications

References 13 publications

Energy-efficient routing in the proximity of a complicated hole in wireless sensor networks

Energy-efficient routing in the proximity of a complicated hole in wireless sensor networks

Stable low-stretch routing scheme for wireless sensor networks with a large hole of complicated shape

Contact Info

Product

Resources

About