期刊文献+

无线Ad Hoc网络中异构链表支配集算法

Heterogeneous Chain Dominating Set Algorithm in Wireless Ad Hoc Networks
在线阅读 下载PDF
导出
摘要 首先给出无线Ad Hoc网络的异构圆盘图模型HDG,并分析HDG模型的不同形态;然后设计出一种新的节点双向链表结构,在此基础上,提出一种基于链表结构的异构连通支配集算法C-LDS。该算法通过双向链表结构管理支配集,并通过节点引用的方式来提高支配集节点增加、删除及修改的时间效率,从而得到优化的连通支配集。将CLDS算法与其他支配集算法进行对比测试,结果表明:在均匀分布以及随机分布的网络场景中,C-LDS所生成的支配集尺寸是最小的;在随机移动的网络场景中,C-LDS的分组投递率是最高的,展现出了较好的异构连通性并且提高了支配集节点的生成效率。 Firstly,the heterogeneous disk model HDG of Ad Hoc network was presented,and different forms of HDG model were analyzed.Secondly,a new two-way chain table structure was designed.Based on the chain structure,a connected dominating set algorithm C-LDS was proposed,which manages dominating set through two-way chain table structure,and improves the time efficiency of inserting,deleting and modify the dominating node through the node refe-rence way.Thus,the connected dominating set of Ad Hoc network is optimized.Finally,the C-LDS algorithm was compared with other dominating set algorithms.The simulation results show that C-LDS algorithm generates minimal CDS size in both uniform and random scenarios,and can achieve highest packet delivery ratio in mobile network scenarios,which shows good heterogeneous connectivity and improves the efficiency yeneration of dominating set node.
作者 韩冰青 陈一飞 HAN Bing-qing;CHEN Yi-fei(School of Technology,Nanjing Audit University,Nanjing 211815,China)
出处 《计算机科学》 CSCD 北大核心 2018年第9期135-140,共6页 Computer Science
基金 国家自然科学基金项目(61402231) 江苏省自然科学基金项目(BK2011692)资助
关键词 连通支配集 双向链表 异构圆盘 无线自组网 Connected dominating set Two-way chain table Heterogeneous disk Ad Hoc network
作者简介 (通信作者)韩冰青(1979-),男,博士,副教授,主要研究方向为Ad Hoc网络、网络协议、智能计算,E-mail:hbqsky@163.com;陈一飞(1977-),女,博士,副教授,主要研究方向为数据挖掘、文本挖掘等。
  • 相关文献

参考文献2

二级参考文献11

  • 1SONG Y, XIE J. A distributed broadcast protocol in multi-hop cogni- tive radio Ad hoc networks without a common control channel [ C ]// Proc of INFOCOM. [ S. 1. ] :IEEE Press, 2012: 2273-2281.
  • 2KONDAREDDY Y R, AGRAWAL P. Selective broadcasting in multi- hop cognitive radio networks[ C ]//Proc of IEEE Sarnoff Symposium. 2008, 1-5.
  • 3ERTUGRUL O, BUZLUCA F. An efficient broadcasting scheme for cognitive radio Ad hoc networks [ C ]//Proc of the 4th International Conference on Cognitive Radio and Advanced Spectrum Management. New York: ACM Press, 2011 : 5-13.
  • 4ARACHCHIGE C J L, VENKATESAN S, CHANDRASEKARAN R, et al. Minimal time broadcasting in cognitive radio networks [ C ]// LNCS, rot 6522. Berlin: Springer, 2011: 364-375.
  • 5ABRAMSON J, PITMAN J. Concave majorants of random walks and related Poisson processes [ J]. Combinatorics, Probability & Com- puting, 2011, 20(5) : 651-682.
  • 6LOTKER Z, PELEG D. Structure and algorithms in the SINR wire- less model [J]. ACM SIGACT News, 2010, 41 (2) : 74-84.
  • 7HUANG S C H, WAN P J, DENG J, et al. Broadcast scheduling in interference environment[J]. IEEE Trans on Mobile Computing, 2008, 7(11) : 1338-1348.
  • 8STROTHER C M, BENDER F, DEUERLING-ZHENG Y, et al. Para-metric color coding of digital subtraction angiography [ J ]. A- merican Journal of Neuroradiology, 2010, 31 (5) : 919-924.
  • 9吴启晖,丁国如,王金龙,李小强,黄育侦.认知无线网络中基于共识理论的分布式聚类合作频谱感知研究[J].科学通报,2012,57(9):776-783. 被引量:4
  • 10鲜永菊,杨春龙,徐昌彪,郑湘渝.认知无线网络中动态频谱接入性能分析[J].计算机应用研究,2012,29(6):2297-2300. 被引量:4

共引文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部