首页 | 本学科首页   官方微博 | 高级检索  
     检索      

基于节点位置信息的Ad Hoc空间覆盖广播算法
引用本文:白乐强,田野.基于节点位置信息的Ad Hoc空间覆盖广播算法[J].沈阳大学学报,2014(2):134-138.
作者姓名:白乐强  田野
作者单位:沈阳建筑大学信息与控制工程学院,辽宁沈阳110168
基金项目:国家自然科学基金资助项目(60973022/F020202).
摘    要:为减少冗余转发节点和降低传输延时,提出一种基于节点位置信息的空间覆盖算法,通过节点位置信息指定转发节点,优化转发节点的空间分布,在保证送达率的同时有效地降低了转发节点数目和转发次数.由于没有使用预定义的接收次数来决定是否转发,当节点收到数据包后,无需等待判断,降低了传输时延.仿真结果表明,该算法在不同节点数目下能够有效地减少冗余转发节点,提高效率,降低传输时延.

关 键 词:Ad  Hoc  广播算法  位置信息  理想位置

Node Location Based Space-Covered Broadcast Algorithm in Ad Hoc Networks
Bai Leqiang,Tian Ye.Node Location Based Space-Covered Broadcast Algorithm in Ad Hoc Networks[J].Journal of Shenyang University,2014(2):134-138.
Authors:Bai Leqiang  Tian Ye
Institution:(School of Information and Control Engineering, Shenyang Jianzhu University, Shenyang 110168, China)
Abstract:In odrer to reduce the redundant nodes and transmission delay, a space-covered broadcast algorithm based on node location is proposed. The algorithm specifies forwarding nodes and optimizes the forwarding nodes space distribution through the node location information, thereby the algorithm reduces the number of forwarding nodes and times while providing high deliverability. Because of no predefined receiving times to decide whether to forward, nodes do not need to wait for judgment after receiving the broadcast packets, so it reduces the transmission delay. Simulation results show that the algorithm could reduce the redundant forwarding node, increase efficiency and reduce transmission delay effectively for different node number.
Keywords:Ad Hoc  broadcasting algorithm  location information  ideal location
本文献已被 CNKI 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号