一种节点自分布最优Ad Hoc多播树及其应用  

A Node-Self-Distribution Optimal Ad Hoc Multicast Tree and Its Application

作　　者：戴勇谦[1,2] 张明武[3] 祝胜林[4] 朱同林[2] 周权[5] 戴勇新[6] 

机构地区：[1]华南农业大学公共基础课实验教学中心,广东广州510642 [2]华南农业大学农业多媒体技术研究所,广东广州510642 [3]湖北工业大学计算机学院,湖北武汉430068 [4]华南农业大学信息学院,广东广州510642 [5]广州大学数学与信息学院,广东广州510006 [6]江西机电职业技术学院,江西南昌330013

出　　处：《电子学报》2015年第7期1449-1456,共8页Acta Electronica Sinica

基　　金：国家自然科学基金(No.61370224);高等学校博士学科点专项科研基金联合资助课题(No.20124404110018);广东省自然科学基金(No.101510642010000428;No.S2012040007370);广东省科技计划项目(No.2011B020031301)

摘　　要：为无线单播模式设计的RTS/CTS信道握手机制不适用于多播模式,导致Ad hoc多播树节点易与隐藏终端发生冲突.通过提出m阶冲突域、节点在冲突域中的分布指标,结合无线网多播数据通信机制分析树节点所在m阶冲突域的冲突概率,进而得到节点自分布最优树的概念,并将它融入多播树的适应函数的设计中,淘汰不良树,优化树节点在m阶冲突域中的分布,在网络层形成一种预防机制,可降低隐藏终端冲突概率;应用于MAODV协议中,提高了MAODV的端到端数据分组平均投递率,这也能够为基于网的和混合式的其他类型MANETs多播路由协议的路由节点分布优化提供有价值的参考.RTS / CTS handshake mechanism is especially designed for Ad hoc unicast mode but not for multicast mode. This leads Multicast tree nodes prone to collide with hidden terminal（ HT）. The m-rank collision domain,the distribution of nodes in m-rank collision domain indicators and the concept of nodes-self-distribution optimal tree（ NSDOT） are proposed while the collision probability of tree node in the m-rank collision domain is analyzed considering the wireless network data multicast communication mechanism. They are integrated into the design of the multicast tree fitness function to eliminate bad trees and optimize the distribution of tree nodes in the collision domain of rank m. A preventive mechanism in advance is formed at the network layer,which reduces the collision probability of HT. As an application in MAODV,the simulation results on NS2 showthat NSDOT obviously and stably increases the average ratio of data packet delivery. These can also be a valuable reference for the routing node distribution optimization of the mesh-based,the hybrid and the other types MANETs routing protocols.

关 键 词：Ad HOC 隐藏终端 m阶冲突域 自分布最优树 多播优化 CSMA 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]