[1]姚文强,杨哲,朱艳琴,等.Ad hoc网络消息传播过程的高阶描述模型[J].东南大学学报(自然科学版),2015,45(3):428-432.[doi:10.3969/j.issn.1001-0505.2015.03.003]
 Yao Wenqiang,Yang Zhe,Zhu Yanqin,et al.High-order description model of message propagation process in Ad hoc network[J].Journal of Southeast University (Natural Science Edition),2015,45(3):428-432.[doi:10.3969/j.issn.1001-0505.2015.03.003]
点击复制

Ad hoc网络消息传播过程的高阶描述模型()
分享到:

《东南大学学报(自然科学版)》[ISSN:1001-0505/CN:32-1178/N]

卷:
45
期数:
2015年第3期
页码:
428-432
栏目:
计算机科学与工程
出版日期:
2015-05-20

文章信息/Info

Title:
High-order description model of message propagation process in Ad hoc network
作者:
姚文强杨哲朱艳琴李领治
苏州大学计算机科学与技术学院, 苏州215006; 苏州大学江苏省计算机信息处理技术重点实验室, 苏州215006
Author(s):
Yao Wenqiang Yang Zhe Zhu Yanqin Li Lingzhi
School of Computer Science and Technology, Soochow University, Suzhou 215006, China
Provincial Key Laboratory for Computer Information Processing Technology, Soochow University, Suzhou 215006, China
关键词:
Ad hoc网络 消息传播过程 节点覆盖 高阶模型
Keywords:
Ad hoc network message propagation process node coverage high-order model
分类号:
TP393
DOI:
10.3969/j.issn.1001-0505.2015.03.003
摘要:
为避免采用随机抽样模型对Ad hoc网络消息传播过程进行定量分析时存在的高估消息覆盖节点数的问题,对现有模型进行修正,提出了一种高阶描述模型.该模型在转发消息时考虑了会对下一次消息转发到达新节点的概率产生影响的2个参数:节点被访问次数和节点度.节点被访问的次数越多,模型的阶数越高.在包含2 000个节点的随机图网络拓扑上的仿真试验结果表明,当消息覆盖的节点数超过1 800时,无论拓扑是否连通,一阶模型和二阶模型对Ad hoc网络消息传播过程的拟合度均优于随机抽样模型.当网络拓扑不连通时,一阶模型和二阶模型仍会高估消息覆盖的节点数;相反,当网络拓扑连通时,两者对仿真结果的拟合度较好,最终误差分别为-7%和-1%.
Abstract:
To avoid the overestimation problem of the number of nodes covered during the quantitative analysis of message propagation process in Ad hoc network by using the random sampling model, a high-order description model is proposed by modification. In the proposed model, when the message is transmitted, the visit times and the degrees of nodes which influence the probability of the next messages transmitted to new nodes are considered. The more the visit times, the higher the order of the description model. The simulation results on a random graph topology network with 2 000 nodes show that when the number of nodes covered is more than 1 800, the fitting abilities of both the 1-order model and the 2-order model for the message propagation process in Ad hoc network are better than that of the random sampling model whether the network topology is connected or not. When the network topology is disconnected, both the 1-order model and the 2-order model still overestimate the number nodes covered; on the contrary, when the network topology is connected, the fitting degrees of both the 1-order model and the 2-order model for the simulation results are satisfactory, and the final fitting errors are -7% and -1%, respectively.

参考文献/References:

[1] Sun Y, Zhang S K, Xu H L, et al. Cooperative communications for wireless ad hoc and sensor networks [J]. International Journal of Distributed Sensor Networks, 2013,2013:161268-1-161268-2.
[2] Zhang S K, Fan J X, Jia J C, et al. An efficient clustering algorithm in wireless sensor networks using cooperative communication [J]. International Journal of Distributed Sensor Networks, 2012, 2012: 274576-1-274576-11.
[3] Dolev S, Schiller E, Welch J. Random walk for self-stabilizing group communication in ad hoc networks [J]. IEEE Transactions on Mobile Computing, 2006, 5(7): 893-905.
[4] Bar-Yossef Z, Friedman R, Kliot G. RaWMS-random walk based lightweight membership service for wireless ad hoc networks [J]. ACM Transactions on Computer Systems, 2008, 26(2):5-1-5-66.
[5] Avin C, Krishnamachari B. The power of choice in random walks: an empirical study [J]. Computer Networks, 2008, 52(1): 44-60.
[6] Chang N B, Liu M. Optimal controlled flooding search in large wireless networks [C]//Proceedings of 3rd International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks. Trentino, Italy, 2005: 229-237.
[7] Jiang S, Guo L, Zhang X D, et al. Lightflood: minimizing redundant messages and maximizing scope of peer-to-peer search [J]. IEEE Transactions on Parallel and Distributed Systems, 2008, 19(5): 601-614.
[8] Elsässer R, Sauerwald T. Tight bounds for the cover time of multiple random walks [J]. Theoretical Computer Science, 2011, 412(24): 2623-2641.
[9] Beraldi R. Biased random walks in uniform wireless networks [J]. IEEE Transactions on Mobile Computing, 2009, 8(4): 500-513.
[10] Zuniga M, Avin C, Krishnamachari B. Using heterogeneity to enhance random walk-based queries [J]. Journal of Signal Processing Systems, 2009, 57(3): 401-414.
[11] Bisnik N, Abouzeid A A. Optimizing random walk search algorithms in P2P networks [J]. Computer Networks, 2007, 51(6): 1499-1514.
[12] Rodero-Merino L, Anta A F, López L, et al. Performance of random walks in one-hop replication networks [J]. Computer Networks, 2010, 54(5): 781-796.
[13] Kang C. Survey of search and optimization of P2P networks [J]. Peer-to-Peer Networking and Applications, 2011, 4(3): 211-218.
[14] Xie J, Lui K S. Modeling random walk search algorithms in unstructured P2P networks with social information [C]//Proceedings of 2009 IEEE International Conference on Communications. Dresden, Germany, 2009: 1-5.
[15] López Millán V M, Cholvi V, López L, et al. A model of self-avoiding random walks for searching complex networks [J]. Networks, 2012, 60(2): 71-85.
[16] Erdös P, Rényi A. On the evolution of random graphs [J]. Publication of the Mathematical Institute of the Hungarian Academy Sciences, 1960, 5: 17-61.

相似文献/References:

[1]陈晓曙,李霞.一种高效的Ad Hoc网络AODV改进路由协议[J].东南大学学报(自然科学版),2003,33(2):127.[doi:10.3969/j.issn.1001-0505.2003.02.002]
 Chen Xiaoshu,Li Xia.Improved high efficiency AODV routing protocol for Ad Hoc networks[J].Journal of Southeast University (Natural Science Edition),2003,33(3):127.[doi:10.3969/j.issn.1001-0505.2003.02.002]
[2]郭显,冯涛,袁占亭,等.用逻辑方法验证移动Ad Hoc网络协议[J].东南大学学报(自然科学版),2011,41(2):258.[doi:10.3969/j.issn.1001-0505.2011.02.009]
 Guo Xian,Feng Tao,Yuan Zhanting,et al.Formal modeling and analysis in a logic for mobile Ad Hoc networks[J].Journal of Southeast University (Natural Science Edition),2011,41(3):258.[doi:10.3969/j.issn.1001-0505.2011.02.009]
[3]李密,沈连丰,夏玮玮.Ad Hoc网络中多点对点视频传输系统设计与仿真[J].东南大学学报(自然科学版),2008,38(4):553.[doi:10.3969/j.issn.1001-0505.2008.04.002]
 Li Mi,Shen Lianfeng,Xia Weiwei.Design and simulation of multipoint-to-point video transmission system over Ad Hoc networks[J].Journal of Southeast University (Natural Science Edition),2008,38(3):553.[doi:10.3969/j.issn.1001-0505.2008.04.002]

备注/Memo

备注/Memo:
收稿日期: 2014-11-13.
作者简介: 姚文强(1992—),男,硕士生;杨哲(联系人),男,博士,副教授,yangzhe@suda.edu.cn.
基金项目: 国家自然科学基金资助项目(61373164)、江苏省产学研前瞻性研究计划资助项目(BY2013030-06)、苏州市科技计划资助项目(SYG201238, SZS0805).
引用本文: 姚文强,杨哲,朱艳琴,等.Ad hoc网络消息传播过程的高阶描述模型[J].东南大学学报:自然科学版,2015,45(3):428-432. [doi:10.3969/j.issn.1001-0505.2015.03.003]
更新日期/Last Update: 2015-05-20