2014 IEEE Global Communications Conference 2014
DOI: 10.1109/glocom.2014.7037579
|View full text |Cite
|
Sign up to set email alerts
|

Distributed on-demand MAC scheduling for underwater acoustic networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
9
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 10 publications
(9 citation statements)
references
References 9 publications
0
9
0
Order By: Relevance
“…Furthermore, we obtain the receiving time of a node as t ri , given by formula. Furthermore, the sending time of this child node is t si , as calculated in formula (16).…”
Section: Mod T: ð12þmentioning
confidence: 99%
See 1 more Smart Citation
“…Furthermore, we obtain the receiving time of a node as t ri , given by formula. Furthermore, the sending time of this child node is t si , as calculated in formula (16).…”
Section: Mod T: ð12þmentioning
confidence: 99%
“…Although this method reduces the probability of collision, it consumes a significant amount of energy. While all the contention-based MAC protocols are expected to improve the performance of a network, several works have shown that long propagation delay, narrow bandwidth, and high bit error rate in underwater environments make the contention-based MAC protocol difficult to approximate the optimal performance [16,17]. In contrast, contention-free MAC protocols are more efficient.…”
Section: Introductionmentioning
confidence: 99%
“…The network density can determine the total number of colors used in the scheduling phase. Each inner node obtains its specific color by receiving the coloring packet, p c , from the CH and it then broadcasts another packet called updating packet, p up , containing its ID, color, neighbors' IDs, and neighbors' colors, to the outer neighboring nodes, those are located outside of the internal cube, but still inside the external cube (lines [16][17][18][19][20][21][22][23]. By receiving p up , the outer nodes are updated about the colors of the neighboring inner nodes.…”
Section: ) Inner Nodes Coloringmentioning
confidence: 99%
“…The optimal solution is compared to a simpler heuristic where the node whose transmission would be completed last is scheduled first. DOS [27] further extends ST-MAC with an on-demand mechanism to update transmission schedules over a hierarchical topology. The approach is shown to outperform ST-MAC when the latter is re-designed to improve fairness.…”
Section: State-of-the-artmentioning
confidence: 99%