A Requirements-Oriented MAC Protocol in Directional Ad Hoc Networks Using Collision-Free Dynamic Time Slot Assignment Algorithm

2019 IEEE 5th International Conference on Computer and Communications (ICCC) Pub Date : 2019-12-01 DOI:10.1109/ICCC47050.2019.9064396

Lingjun Liu, Laixian Peng, Renhui Xu, Wendong Zhao, Haiqin Shi

{"title":"A Requirements-Oriented MAC Protocol in Directional Ad Hoc Networks Using Collision-Free Dynamic Time Slot Assignment Algorithm","authors":"Lingjun Liu, Laixian Peng, Renhui Xu, Wendong Zhao, Haiqin Shi","doi":"10.1109/ICCC47050.2019.9064396","DOIUrl":null,"url":null,"abstract":"To satisfy the special demand of key information such as allegation information which cannot tolerate packet loss, this paper studies a novel requirements-oriented time slot assignment MAC protocol based on TDMA scheduling mechanism in Ad Hoc network using directional antenna, and a conflict-free dynamic time slot assignment algorithm based on requirement exchange is proposed. One scheduling process is divided into a requirement exchange stage and a data transmission stage. In the requirement exchange stage, each node runs a consistent pairing switching algorithm. After the requirement exchange stage is completed, each node can be guaranteed to obtain the transmission requirements of neighboring nodes. In the data transmission stage, according to the transmission requirements of the whole network, this paper proposes a maximizing concurrent transmission links (MCTL) time slot assignment algorithm. The MCTL algorithm is based on collision-free links group to achieve as many concurrent transmission links as possible in each scheduling process. Lastly, simulation results by OPNET 14.5 are given to evaluate the average delay and throughput of proposed algorithm.","PeriodicalId":6739,"journal":{"name":"2019 IEEE 5th International Conference on Computer and Communications (ICCC)","volume":"64 1","pages":"1154-1158"},"PeriodicalIF":0.0000,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE 5th International Conference on Computer and Communications (ICCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCC47050.2019.9064396","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 3

Abstract

To satisfy the special demand of key information such as allegation information which cannot tolerate packet loss, this paper studies a novel requirements-oriented time slot assignment MAC protocol based on TDMA scheduling mechanism in Ad Hoc network using directional antenna, and a conflict-free dynamic time slot assignment algorithm based on requirement exchange is proposed. One scheduling process is divided into a requirement exchange stage and a data transmission stage. In the requirement exchange stage, each node runs a consistent pairing switching algorithm. After the requirement exchange stage is completed, each node can be guaranteed to obtain the transmission requirements of neighboring nodes. In the data transmission stage, according to the transmission requirements of the whole network, this paper proposes a maximizing concurrent transmission links (MCTL) time slot assignment algorithm. The MCTL algorithm is based on collision-free links group to achieve as many concurrent transmission links as possible in each scheduling process. Lastly, simulation results by OPNET 14.5 are given to evaluate the average delay and throughput of proposed algorithm.

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

基于无冲突动态时隙分配算法的定向Ad Hoc网络中面向需求的MAC协议

为满足指控信息等关键信息不能容忍丢包的特殊需求，研究了一种基于定向天线的Ad Hoc网络中基于TDMA调度机制的面向需求时隙分配MAC协议，提出了一种基于需求交换的无冲突动态时隙分配算法。一个调度过程分为需求交换阶段和数据传输阶段。在需求交换阶段，每个节点运行一致的配对交换算法。需求交换阶段完成后，可以保证每个节点获得相邻节点的传输需求。在数据传输阶段，根据整个网络的传输需求，本文提出了一种最大并发传输链路(MCTL)时隙分配算法。MCTL算法基于无冲突链路组，在每个调度过程中实现尽可能多的并发传输链路。最后，利用OPNET 14.5进行了仿真，对算法的平均时延和吞吐量进行了评价。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文去求助

来源期刊

2019 IEEE 5th International Conference on Computer and Communications (ICCC)

自引率

0.00%

发文量