检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:任智[1] 赵英杰 梁建 阳路杰 REN Zhi;ZHAO Yingjie;LIANG Jian;YANG Lujie(School of Communication and Information Engineering,Chongqing University of Posts and Telecommunications,Chongqing 400065,China)
机构地区:[1]重庆邮电大学通信与信息工程学院,重庆400065
出 处:《小型微型计算机系统》2024年第5期1235-1240,共6页Journal of Chinese Computer Systems
基 金:国家自然科学基金项目(61971080)资助。
摘 要:针对网络中节点在争用访问时期发送消息碰撞、时隙分配机制低效和空闲时隙浪费等问题,提出了一种高效低碰撞的太赫兹无线定向MAC协议.文中提出了3种新机制,分别是基于缓存权重的分组机制、复用竞争机制以及时隙分配机制.首先,在微网控制器(Piconet Coordinator,PNC)中生成缓存映射表记录节点的缓存情况;然后,根据缓存映射表为节点分组,节点在分组对应的时隙中进行时隙请求,PNC根据节点缓存为节点分配时隙;最后,未申请到时隙的节点利用剩余时隙进行复用竞争操作.仿真结果表明,所提出的方案有效地提高了网络的吞吐量,减少了消息碰撞率并降低了平均时延.In order to solve the problems of message collision,inefficient slot allocation mechanism and waste of idle slots in the network when nodes are competing for access,an efficient and low collision terahertz wireless directional MAC protocol is proposed.In this paper,three new mechanisms are proposed,which are packet mechanism based on cache weight,multiplexing competition mechanism and slot allocation mechanism.First,a mapping cache table is designed in the Piconet Coordinator(PNC)to record the cache conditions of nodes;Then,the nodes are grouped according to the cache mapping table,and the nodes request timeslots in the packet timeslot.PNC allocates timeslots for nodes according to the node cache;Finally,nodes that have not applied for time slots use the remaining time slots to perform multiplexing competition operations.The simulation results show that the proposed scheme effectively improves the network throughput,reduces the message collision rate and reduces the average completion delay.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.38