针对采用分布式并行方法仿真WLAN(wireless local area network)场景时存在的随终端节点个数增加而效率降低的问题,提出了一种面向WLAN的分布式分层并行仿真方法。基于WLAN的星状网络拓扑结构,令仿真接入节点的进程为主进程,负责WLAN全...针对采用分布式并行方法仿真WLAN(wireless local area network)场景时存在的随终端节点个数增加而效率降低的问题,提出了一种面向WLAN的分布式分层并行仿真方法。基于WLAN的星状网络拓扑结构,令仿真接入节点的进程为主进程,负责WLAN全网中其他仿真节点的时间同步;将所有仿真终端节点的进程均匀分为若干组,由组长负责该组内进程的同步。在主进程广播仿真开始事件后,组长进程先收集本组组员终端节点推进结束消息,当收齐后再向主进程汇报。形成“主进程-组长进程-组员进程”的3层分层结构。在不同计算负荷下,仿真分析并得到了分层仿真方法的时间增益因子闭合表达式。仿真结果表明,与现有不分层的仿真方法相比,当平均计算负荷为1.2倍单位时长、节点个数为100时,所提分层仿真方法的增益可达50%。展开更多
在无中心节点网络中可能存在不同类型的业务,部分高优先级业务具有严格的时延等服务质量(quality of service,QoS)需求。但当网络负载较重时,冲突概率明显提高,使得这些业务的需求难以得到保障,如何设计高效的多址接入协议以保证不同种...在无中心节点网络中可能存在不同类型的业务,部分高优先级业务具有严格的时延等服务质量(quality of service,QoS)需求。但当网络负载较重时,冲突概率明显提高,使得这些业务的需求难以得到保障,如何设计高效的多址接入协议以保证不同种类业务的服务质量是重要的研究方向。信道预约机制是保证QoS的重要方法,但现有信道预约机制对多种业务服务时,通常没有根据服务质量需求和网络状况精细调整预约参数。因此针对以上问题提出了一种面向差异化业务保障的信道预约MAC协议(differentiated service guarantee adaptive reservation mechanism,DSGARM),协议核心思想是针对每种业务的容忍时延需求和网络状况精细提供差异化服务,协议中通过建立的数学模型设计自适应算法,定量计算出满足时延需求的预约参数,能够根据网络状况自适应调整合适的预约参数以保障每一类业务的时延需求。仿真结果说明了提出协议的优势,具有较大的实际意义。展开更多
In this paper,we propose a Multi-token Sector Antenna Neighbor Discovery(M-SAND)protocol to enhance the efficiency of neighbor discovery in asynchronous directional ad hoc networks.The central concept of our work invo...In this paper,we propose a Multi-token Sector Antenna Neighbor Discovery(M-SAND)protocol to enhance the efficiency of neighbor discovery in asynchronous directional ad hoc networks.The central concept of our work involves maintaining multiple tokens across the network.To prevent mutual interference among multi-token holders,we introduce the time and space non-interference theorems.Furthermore,we propose a master-slave strategy between tokens.When the master token holder(MTH)performs the neighbor discovery,it decides which 1-hop neighbor is the next MTH and which 2-hop neighbors can be the new slave token holders(STHs).Using this approach,the MTH and multiple STHs can simultaneously discover their neighbors without causing interference with each other.Building on this foundation,we provide a comprehensive procedure for the M-SAND protocol.We also conduct theoretical analyses on the maximum number of STHs and the lower bound of multi-token generation probability.Finally,simulation results demonstrate the time efficiency of the M-SAND protocol.When compared to the QSAND protocol,which uses only one token,the total neighbor discovery time is reduced by 28% when 6beams and 112 nodes are employed.展开更多
文摘针对采用分布式并行方法仿真WLAN(wireless local area network)场景时存在的随终端节点个数增加而效率降低的问题,提出了一种面向WLAN的分布式分层并行仿真方法。基于WLAN的星状网络拓扑结构,令仿真接入节点的进程为主进程,负责WLAN全网中其他仿真节点的时间同步;将所有仿真终端节点的进程均匀分为若干组,由组长负责该组内进程的同步。在主进程广播仿真开始事件后,组长进程先收集本组组员终端节点推进结束消息,当收齐后再向主进程汇报。形成“主进程-组长进程-组员进程”的3层分层结构。在不同计算负荷下,仿真分析并得到了分层仿真方法的时间增益因子闭合表达式。仿真结果表明,与现有不分层的仿真方法相比,当平均计算负荷为1.2倍单位时长、节点个数为100时,所提分层仿真方法的增益可达50%。
文摘在无中心节点网络中可能存在不同类型的业务,部分高优先级业务具有严格的时延等服务质量(quality of service,QoS)需求。但当网络负载较重时,冲突概率明显提高,使得这些业务的需求难以得到保障,如何设计高效的多址接入协议以保证不同种类业务的服务质量是重要的研究方向。信道预约机制是保证QoS的重要方法,但现有信道预约机制对多种业务服务时,通常没有根据服务质量需求和网络状况精细调整预约参数。因此针对以上问题提出了一种面向差异化业务保障的信道预约MAC协议(differentiated service guarantee adaptive reservation mechanism,DSGARM),协议核心思想是针对每种业务的容忍时延需求和网络状况精细提供差异化服务,协议中通过建立的数学模型设计自适应算法,定量计算出满足时延需求的预约参数,能够根据网络状况自适应调整合适的预约参数以保障每一类业务的时延需求。仿真结果说明了提出协议的优势,具有较大的实际意义。
基金supported in part by the National Natural Science Foundations of CHINA(Grant No.61771392,No.61771390,No.61871322 and No.61501373)Science and Technology on Avionics Integration Laboratory and the Aeronautical Science Foundation of China(Grant No.201955053002 and No.20185553035)。
文摘In this paper,we propose a Multi-token Sector Antenna Neighbor Discovery(M-SAND)protocol to enhance the efficiency of neighbor discovery in asynchronous directional ad hoc networks.The central concept of our work involves maintaining multiple tokens across the network.To prevent mutual interference among multi-token holders,we introduce the time and space non-interference theorems.Furthermore,we propose a master-slave strategy between tokens.When the master token holder(MTH)performs the neighbor discovery,it decides which 1-hop neighbor is the next MTH and which 2-hop neighbors can be the new slave token holders(STHs).Using this approach,the MTH and multiple STHs can simultaneously discover their neighbors without causing interference with each other.Building on this foundation,we provide a comprehensive procedure for the M-SAND protocol.We also conduct theoretical analyses on the maximum number of STHs and the lower bound of multi-token generation probability.Finally,simulation results demonstrate the time efficiency of the M-SAND protocol.When compared to the QSAND protocol,which uses only one token,the total neighbor discovery time is reduced by 28% when 6beams and 112 nodes are employed.
