2016 IEEE Third Underwater Communications and Networking Conference (UComms) 2016
DOI: 10.1109/ucomms.2016.7583430
|View full text |Cite
|
Sign up to set email alerts
|

Efficient link discovery for underwater networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
12
0

Year Published

2017
2017
2019
2019

Publication Types

Select...
4
1

Relationship

3
2

Authors

Journals

citations
Cited by 7 publications
(12 citation statements)
references
References 11 publications
0
12
0
Order By: Relevance
“…In our implementation, each probability value is represented by 1 byte. This calculation does not include the overhead needed for obtaining the one-hop neighbor lists and the list of near-far node pairs, which is out of the scope of this paper and can be addressed with a per-node overhead of log(N ) bits re-transmitted roughly N times by methods such as, e.g., [35].…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…In our implementation, each probability value is represented by 1 byte. This calculation does not include the overhead needed for obtaining the one-hop neighbor lists and the list of near-far node pairs, which is out of the scope of this paper and can be addressed with a per-node overhead of log(N ) bits re-transmitted roughly N times by methods such as, e.g., [35].…”
Section: Discussionmentioning
confidence: 99%
“…The nodes are assumed to only evaluate their one-hop neighbor list and share it with the sink node. An example of a process to obtain this information is presented in [35], where nodes transmit in a pre-determined manner during the network setup phase, such that by receiving packets, a node can build its own one-hop list. Given onehop information, the sink node evaluates the network topology and replies only with the schedule.…”
Section: A Problem Definitionmentioning
confidence: 99%
“…During the network initialization phase, the sink can leverage broadcast-based topology discovery protocols [17] (e.g., flooding protocol) to perform fundamental network operations, such as network topology construction, time synchronization, group formation, localization and so on. In order to deal with network communication environments and topological changes, the sink also sends routing reconstruction packets periodically during the operational stage of the network.…”
Section: Selection Of Relay Sensor Nodesmentioning
confidence: 99%
“…We assume that our underwater network is composed of a set N of multi-modal nodes, where |N | = N , and that the network topology has been already discovered (e.g., see [18]). We however do assume that the process can be subject to errors or inaccuracies due to slow topology changes over time.…”
Section: B Preliminary Considerations and Notationmentioning
confidence: 99%
“…To form the full topology information required by OMR-FF and the one-hop link information required by OMR-PF, we refer to the communication ranges in Table I. To calculate the route on the way to the sink (i.e., the sets Y i , ∀i), we carry out a preliminary route discovery phase, where the sink propagates a discovery packet through the network [18]. The discovered routes are maintained throughout each simulation run.…”
Section: B Simulation Setupmentioning
confidence: 99%