Quality, Reliability, Security and Robustness in Heterogeneous Systems. 13th International Conference, QShine 2017, Dalian, China, December 16 -17, 2017, Proceedings

Research Article

A Classified Slot Re-allocation Algorithm for Synchronous Directional Ad Hoc Networks

  • @INPROCEEDINGS{10.1007/978-3-319-78078-8_20,
        author={Zhicheng Bai and Bo Li and Zhongjiang Yan and Mao Yang and Xiaofei Jiang and Hang Zhang},
        title={A Classified Slot Re-allocation Algorithm for Synchronous Directional Ad Hoc Networks},
        proceedings={Quality, Reliability, Security and Robustness in Heterogeneous Systems. 13th International Conference, QShine 2017, Dalian, China, December 16 -17, 2017, Proceedings},
        proceedings_a={QSHINE},
        year={2018},
        month={4},
        keywords={Directional ad hoc networks Classified slot Re-allocation Medium access control},
        doi={10.1007/978-3-319-78078-8_20}
    }
    
  • Zhicheng Bai
    Bo Li
    Zhongjiang Yan
    Mao Yang
    Xiaofei Jiang
    Hang Zhang
    Year: 2018
    A Classified Slot Re-allocation Algorithm for Synchronous Directional Ad Hoc Networks
    QSHINE
    Springer
    DOI: 10.1007/978-3-319-78078-8_20
Zhicheng Bai,*, Bo Li1,*, Zhongjiang Yan1,*, Mao Yang1,*, Xiaofei Jiang2, Hang Zhang
  • 1: Northwestern Polytechnical University
  • 2: Science and Technology on Communication Networks Laboratory
*Contact email: baizhicheng@mail.nwpu.edu.cn, libo@nwpu.edu.cn, zhjyan@nwpu.edu.cn, yangmao@nwpu.edu.cn

Abstract

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.