2011 IEEE International Conference on Communications (ICC) 2011
DOI: 10.1109/icc.2011.5963364
|View full text |Cite
|
Sign up to set email alerts
|

Surface Based Anchor-Free Localization Algorithm for Underwater Sensor Networks

Abstract: Localization in underwater environments has been constrained by the dependencies on the line of sight (LOS) due to the challenging variability's of the environment. This dependency hinders node discovery and ad-hoc formation in underwater networks and limits the performance of routing protocols. Most proposed algorithms in the literature rely on anchor nodes that are at fixed positions to serve as reference points, which is not practical in many applications. This paper introduces a novel approach to the local… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
18
0

Year Published

2012
2012
2024
2024

Publication Types

Select...
5
1

Relationship

2
4

Authors

Journals

citations
Cited by 16 publications
(18 citation statements)
references
References 13 publications
0
18
0
Order By: Relevance
“…We refer to the inclusion of reflection points in the localized Delaunay triangulation as the LDel ୖ (V) planar graph. Recall from Figure 1 the LOS links may be blocked due to an obstacle or an unknown node, to account for this the node ܵ building the LDel ୖ (V) graph will determine which LOS links are blocked from the information obtained from network-discovery (stage 1) and calculate reflection points to the water surface and bottom to be used as temporary reference vertices in the LDel ୖ (V) graph by applying the SBR-AL technique [8]. After creating the planar graph, each routing node ܴ will apply (15) to select the next-hop that maximizes the network throughput.…”
Section: ‫ܪܶ‬ =mentioning
confidence: 99%
See 2 more Smart Citations
“…We refer to the inclusion of reflection points in the localized Delaunay triangulation as the LDel ୖ (V) planar graph. Recall from Figure 1 the LOS links may be blocked due to an obstacle or an unknown node, to account for this the node ܵ building the LDel ୖ (V) graph will determine which LOS links are blocked from the information obtained from network-discovery (stage 1) and calculate reflection points to the water surface and bottom to be used as temporary reference vertices in the LDel ୖ (V) graph by applying the SBR-AL technique [8]. After creating the planar graph, each routing node ܴ will apply (15) to select the next-hop that maximizes the network throughput.…”
Section: ‫ܪܶ‬ =mentioning
confidence: 99%
“…In stage 1, the source node performs a k-hop node discovery to obtain the positions and movement information of all k-hops neighbors. This is done by incorporating a surface based reflected anchor-free localization (SBR-AL) scheme [8]. After obtaining the position information, the node will then determine the geocast region R (cubic boundary) centered on the destination node D j , based on the node degree and movement information (speed and direction) of the destination.…”
Section: ‫ܪܶ‬ =mentioning
confidence: 99%
See 1 more Smart Citation
“…To overcome the limitations of present systems, this article presents a surface-based reflection (SBR) scheme [Emokpae and Younis 2011] that uses a switch-beamed acoustic directional antenna for communication. SBR is designed to operate in shallow water regions (with depths down to 200m) and uses the reflections from the water surface (or bottom) to enable non-line-of-sight (NLOS) communication links.…”
Section: Introductionmentioning
confidence: 99%
“…The second scheme does not require an exchange of SBR range measurements between neighbors and opts to only consider one neighbor at a time, which we refer to as surface-based reflected directed anchor-free localization (SBR-DAL). A preliminary version of the SBR-DAL algorithm can be found in Emokpae and Younis [2011]. The third variant, which we call surface-based reflected enhanced anchor-free localization (SBR-EAL), aims at enhancing the directed localization scheme.…”
Section: Introductionmentioning
confidence: 99%