TY - GEN
T1 - A classified slot re-allocation algorithm for synchronous directional Ad Hoc networks
AU - Bai, Zhicheng
AU - Li, Bo
AU - Yan, Zhongjiang
AU - Yang, Mao
AU - Jiang, Xiaofei
AU - Zhang, Hang
N1 - Publisher Copyright:
© ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 2018.
PY - 2018
Y1 - 2018
N2 - Several typical synchronous directional media access control (DMAC) protocols are proposed for directional ad hoc networks (DAHN), e.g., directional transmission and reception algorithms (DTRA) [4]. One of the slot allocation problems of these DMACs is the unfairness between links, or link starvation, which is caused by the distributed feature of DAHN. That is the earlier discovered link reserve much more slots which results in the later discovered links have few slots to reserve. To address the unfairness problem, in this paper a classified slot re-allocation algorithm (CSRA) is proposed. The basic idea is to classify the data slots into four types according to their status in the data transmission phase, and then when the unfairness problem is found different types of slots are re-allocated. The re-allocation order of these four types of these slots are free slots, sending slots, neighbour transmitting slots, and receiving slot. Extensive simulation are carried out to evaluate the performance of the proposed CSRA. The simulation results show that the Jain’s fairness index is improved with little loss of the network throughput.
AB - Several typical synchronous directional media access control (DMAC) protocols are proposed for directional ad hoc networks (DAHN), e.g., directional transmission and reception algorithms (DTRA) [4]. One of the slot allocation problems of these DMACs is the unfairness between links, or link starvation, which is caused by the distributed feature of DAHN. That is the earlier discovered link reserve much more slots which results in the later discovered links have few slots to reserve. To address the unfairness problem, in this paper a classified slot re-allocation algorithm (CSRA) is proposed. The basic idea is to classify the data slots into four types according to their status in the data transmission phase, and then when the unfairness problem is found different types of slots are re-allocated. The re-allocation order of these four types of these slots are free slots, sending slots, neighbour transmitting slots, and receiving slot. Extensive simulation are carried out to evaluate the performance of the proposed CSRA. The simulation results show that the Jain’s fairness index is improved with little loss of the network throughput.
KW - Classified slot
KW - Directional ad hoc networks
KW - Medium access control
KW - Re-allocation
UR - http://www.scopus.com/inward/record.url?scp=85045207399&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-78078-8_20
DO - 10.1007/978-3-319-78078-8_20
M3 - 会议稿件
AN - SCOPUS:85045207399
SN - 9783319780771
T3 - Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST
SP - 194
EP - 204
BT - Quality, Reliability, Security and Robustness in Heterogeneous Systems - 13th International Conference, QShine 2017, Proceedings
A2 - Wang, Lei
A2 - Qiu, Tie
A2 - Zhao, Wenbing
PB - Springer Verlag
T2 - 13th International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness, QShine 2017
Y2 - 16 December 2017 through 17 December 2017
ER -