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

doi:10.3969/j.issn.0372-2112.2015.07.031

电子学报 ›› 2015, Vol. 43 ›› Issue (7): 1449-1456.DOI: 10.3969/j.issn.0372-2112.2015.07.031

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

戴勇谦^1,4, 张明武², 祝胜林³, 朱同林⁴, 周权⁵, 戴勇新⁶

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

收稿日期:2013-11-06 修回日期:2014-07-16 出版日期:2015-07-25
- 作者简介:
- 戴勇谦 男,1975年生于江西临川,硕士,实验师,研究领域为无线网络、人工智能. E-mail:daiyq@scau.edu.cn;张明武 男,1971年生于湖北荆州,博士,教授,研究领域为网络与信息安全.
- 基金资助:
- 国家自然科学基金 (No.61370224); 高等学校博士学科点专项科研基金联合资助课题 (No.20124404110018); 广东省自然科学基金 (No.101510642010000428,No.S2012040007370); 广东省科技计划项目 (No.2011B020031301)

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

DAI Yong-qian^1,4, ZHANG Ming-wu², ZHU Sheng-lin³, ZHU Tong-lin⁴, ZHOU Quan⁵, DAI Yong-xin⁶

1. Center of Experimental Teaching for Common Basic Courses, South China Agricultural University, Guangzhou, Guangdong 510642, China;
2. School of Computer Sciences Hubei University of Technology, Wuhan, Hubei 430068, China;
3. School of Information, South China Agricultural University, Guangzhou, Guangdong 510642, China;
4. Agricultural Multimedia Technology Institute, South China Agricultural University, Guangzhou, Guangdong 510642, China;
5. School of Mathematics and Information Science, Guangzhou University, Guangzhou, Guangdong 510006, China;
6. Jiangxi Vocational College of Mechanical & Electrical Technology, Nanchang, Jiangxi 330013, China

Received:2013-11-06 Revised:2014-07-16 Online:2015-07-25 Published:2015-07-25

摘要/Abstract

摘要：

为无线单播模式设计的RTS/CTS信道握手机制不适用于多播模式,导致Ad hoc多播树节点易与隐藏终端发生冲突.通过提出m阶冲突域、节点在冲突域中的分布指标,结合无线网多播数据通信机制分析树节点所在m阶冲突域的冲突概率,进而得到节点自分布最优树的概念,并将它融入多播树的适应函数的设计中,淘汰不良树,优化树节点在m阶冲突域中的分布,在网络层形成一种预防机制,可降低隐藏终端冲突概率;应用于MAODV协议中,提高了MAODV的端到端数据分组平均投递率,这也能够为基于网的和混合式的其他类型MANETs多播路由协议的路由节点分布优化提供有价值的参考.

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

Abstract:

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 show that 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.

Key words: Ad hoc, hidden terminal, m-rank collision domain, nodes-self-distribution optimal tree, multicast routing optimization, carrier sense multiple access(CSMA)

中图分类号:

TP393

戴勇谦, 张明武, 祝胜林, 朱同林, 周权, 戴勇新. 一种节点自分布最优Ad Hoc多播树及其应用[J]. 电子学报, 2015, 43(7): 1449-1456.

DAI Yong-qian, ZHANG Ming-wu, ZHU Sheng-lin, ZHU Tong-lin, ZHOU Quan, DAI Yong-xin. A Node-Self-Distribution Optimal Ad Hoc Multicast Tree and Its Application[J]. Acta Electronica Sinica, 2015, 43(7): 1449-1456.

参考文献

[1] Wang N C,Lee C Y.A multi-path QoS multicast routing protocol with slot assignment for mobile ad hoc networks[J].Information Sciences,2012,208(11):1-13.
[2] Kim J,Jung J,Lim J.A Reliable Multicast MAC Protocol Based on Spread Spectrum Technique in Wireless Ad Hoc Networks[M].Grid and Distributed Computing.Springer Berlin Heidelberg,2011.202-212.
[3] Mendes L D P,JPC Rodrigues J.A survey on cross-layer solutions for wireless sensor networks[J].Journal of Network and Computer Applications,2011,34(2):523-534.
[4] Wei Liang,Haibin Yu,Chang Che.An adaptive probability access mechanism for wireless sensor network[A].Eighth ACIS International Conference on Software Engineering,Artificial Intelligence,Networking,and Parallel/Distributed Computing[C].Washington DC :IEEE Computer Soc,2007.1040-1045.
[5] Zhen hua Wu,Yu Hen Hu.How many wireless resources are needed to resolve the hidden terminal problem?[J].Computer Networks,2013,57(18):3987-3996.
[6] PM Ruiz,AF Gomez-Skarmeta.Approximating optimal multicast trees in wireless multihop networks[A].The 10th IEEE Symposium on Computers and Communications[C].Washington DC :IEEE Computer Soc,2005.686-691.
[7] Uyen Trang Nguyen.On multicast routing in wireless mesh networks[J].Computer Communications,2008,31(7):1385-1399.
[8] Uyen Trang Nguyen,Jin Xu.Multicast routing in wireless mesh networks:Minimum cost trees or shortest path trees?[J].IEEE Communications Magazine,2007,45(11):72-77.
[9] Hui Cheng,Sheng xiangYang.Genetic algorithms with immigrants schemes for dynamic multicast problems in mobile ad hoc networks[J].Engineering Applications of Artificial Intelligence,2010,23(5):806-819.
[10] Avid Avokh,Ghasem Mirjalily.Load-balanced multicast tree routing in multi channel multi radio wireless mesh networks using a new cost function[J].Wireless Pers Commun,2013,69(1):75-106.
[11] Jenn-Wei Lin,Jian-Yan Zhuang.A delay-constrained and priority-aware channel assignment algorithm for efficient multicast in wireless mesh networks[J].The Journal of Systems and Software,2013,86(3):789-800.
[12] Giuseppe Bianchi.Performance analysis of the IEEE 802.11 distributed coordination function[J].IEEE Journal on Selected Areas in Communications,2000,18(3):535-547.
[13] Jang B,Sichitiu M L.IEEE 802.11 saturation throughput analysis in the presence of hidden terminals[J].IEEE/ACM Transactions on Networking (TON),2012,20(2):557-570.
[14] Tsertou A,Laurenson D I.Revisiting the hidden terminal problem in a csma/ca wireless network[J].IEEE Transactions on Mobile Computing,2008,7(7):817-831.
[15] Ekici O,Yongacoglu A.IEEE 802.11a throughput performance with hidden nodes[J].IEEE Communications Letters,2008,12(6):465-467.
[16] Ng P C,Liew S C.Throughput analysis of IEEE 802.11 multi-hop ad hoc networks[J].IEEE/ACM Transactions on Networking (TON),2007,15(2):309-322.
[17] Wen Jin,Shuiping Chen,Hai Jiang.Finding the k shortest paths in a time-schedule network with constraints on arcs[J].Computers & Operations Research,2013,40(12):2975-2982.
[18] 汪鹏君,李辉,吴文晋,等.量子遗传算法在多输出Reed-Muller逻辑电路最佳极性搜索中的应用[J].电子学报,2010,38(5):1058-1063. Wang Peng-jun,Li Hui,et al.Application of quantum genetic algorithm in searching for best polarity of multi-output Reed-Muller logic circuits[J].Acta Electronica Sinica,2010,38(5):1058-1063.(in Chinese)
[19] Yufang Zhu,Thomas Kunz.MAODV implementation for ns-2.26[R].Systems and Computing Engineering,Carleton Uni- versity,2004.
[20] Valerio D,Vacirca F,De Cicco L,et al.Optimizing carrier sensing in 802.11 multihop wireless networks[A].Proc of Med-Hoc-Net 2006[C].Lipari,Italy:University of Catania,2006.98-100.

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

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

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 15

编辑推荐

Metrics

[1]	陈丹, 刘卜华, 闫茂德, 李建东, 李长乐. MIMO Ad Hoc网络中基于正交阵列的拓扑未知多址接入协议[J]. 电子学报, 2016, 44(2): 308-318.
[2]	何林波, 蒋定德, 仲维佳. 一种基于能效与频效的路由优化算法[J]. 电子学报, 2016, 44(10): 2314-2322.
[3]	徐宁, 张沪寅, 王晶, 徐方, 汪志勇. 认知Ad Hoc网络中基于信道相似度的分簇算法研究[J]. 电子学报, 2016, 44(10): 2323-2329.
[4]	郭萍, 周未, 成亚萍. 基于信任度计算的三阈值控制Ad Hoc网络节点撤销机制[J]. 电子学报, 2015, 43(8): 1589-1597.
[5]	孙晓惠, 尹长川. 基于双变量泊松点过程的无线Ad Hoc网络的保密广播传输容量分析[J]. 电子学报, 2014, 42(9): 1847-1851.
[6]	孙君;朱洪波. Ad Hoc网络中基于距离的机会频谱接入方案[J]. 电子学报, 2011, 39(7): 1679-1682.
[7]	李元振;廖建新;李彤红;朱晓民;张磊. 城市场景车载Ad Hoc网络竞争转发关键参数分析[J]. 电子学报, 2011, 39(5): 1154-1158.
[8]	刘干;朱光喜. 可任意阶扩展的认知无线Ad Hoc 网络频谱共享模型[J]. 电子学报, 2011, 39(12): 2784-2789.
[9]	陈怡;胡瑞敏;高戈. 面向动态Ad Hoc网络异构多播业务流最优资源控制策略[J]. 电子学报, 2011, 39(11): 2583-2588.
[10]	于尧;郭磊;王兴伟;李平平. 一种适合于分级Ad Hoc网络的实时风险评估安全策略[J]. 电子学报, 2011, 39(1): 108-113.
[11]	张琰;盛敏;李建东;田野;姚俊良;唐迪. 一种适用于多跳Ad Hoc网络的增强型协作多址接入协议[J]. 电子学报, 2011, 39(1): 224-232.
[12]	马柯;俞能海;杨福荣. EASA：一种分簇Ad Hoc网络高效自适应TDMA时隙分配算法[J]. 电子学报, 2010, 38(7): 1678-1682.
[13]	韩小博;罗涛. Ad Hoc认知无线电网络中基于博弈论的公共信道建立算法[J]. 电子学报, 2010, 38(7): 1699-1704.
[14]	吴克军;于全;田艳霞. 一种位置信息辅助的Ad Hoc网络按需距离矢量路由协议[J]. 电子学报, 2010, 38(4): 983-0988.
[15]	朱颖;武穆清. 基于802.11e的无线多跳自适应合作式QoS算法[J]. 电子学报, 2010, 38(10): 2350-2357.