微信服务号

微信订阅号

2025年3月17日 19:37 星期一
首页 > 过刊浏览>2005年第16卷第8期 >1474-1483
PDF HTML阅读 XML下载 导出引用 引用提醒
移动自组网中基于分簇的数据复制算法
作者:
基金项目:

Supported by the National Natural Science Foundation of China under Grant No.90412011 (国家自然科学基金); the Foundation for the Author of National Excellent Doctoral Dissertation of PR China under Grant No.200141 (全国优秀博士学位论文作者专项资金)


A Clustering-Based Data Replication Algorithm in Mobile Ad Hoc Networks for Improving Data Availability
Author:
  • 摘要
    • | |
  • 访问统计
    • |
  • 参考文献 [11]
    • |
  • 相似文献 [20]
    • |
  • 引证文献
    • | |
  • 文章评论
    摘要:

    在移动自组网络中,网络分割现象可能频繁发生,从而降低了数据的可用性.提出了一种新的分布式分簇算法来组织移动节点,算法保证簇内任意两点间路径的可用概率都大于某个确定的界.在此基础上提出了基于稳定路径分簇的数据复制策略,以提高在出现链路断接甚至网络分割时的数据可用性.对算法进行了理论证明和实验分析,实验结果表明,由分簇算法构造的簇能够满足我们所要求的特性,并且基于分簇的数据复制算法在移动自组网环境中有效地提高了数据的可用性.

    Abstract:

    In Mobile Ad Hoc Networks (MANET), network partitioning can cause sudden and severe disruptions to ongoing data accesses, and consequently data availability is decreased. A new distributed clustering algorithm is presented in this paper for dynamically organizing mobile nodes into clusters in which the probability of path availability can be bounded. Based on this clustering algorithm, a data replication algorithm is proposed to improve data availability. Theoretic analysis indicates that the algorithm has a proper complexity. Simulation results show that the clusters created by the clustering algorithm have desirable properties and the data availability is improved effectively by the clustering-based data replication algorithm.

    参考文献
    [1]Virtanen SE, Nikander P. Local clustering for hierarchical ad hoc networks. In: Proc. of the WiOpt2004: Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks. California: IEEE Computer Society Press, 2004. 404-405.
    [2]Banerjee S, Khuller S. A clustering scheme for hierarchical control in muti-hop wireless networks. In: Proc. of the IEEE INFOCOM2001. California: IEEE Computer Society Press, 2001. 1028-1037.
    [3]Chen YP, Liestman AL. Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks. In:Proc. of the MOBIHOC2002. New York: ACM, 2002. 165-172.
    [4]Kawadia V, Kumar PR. Power control and clustering in ad hoc networks. In: Proc. of the IEEE INFOCOM. California: IEEE Computer Society Press, 2003.459-469.
    [5]Younis O, Fahmy S. Distributed clustering in ad-hoc sensor networks: A hybrid, energy-efficient approach. In: Proc. of the IEEE INFOCOM2004. California: IEEE Computer Society Press, 2004.
    [6]Wang K, Li B. Efficient and guaranteed service coverage in partitionable mobile ad-hoc networks. In: Proc. of the INFOCOM2002.California: IEEE Computer Society Press, 2002. 1089-1098.
    [7]Camp T, Boleng J, Davies V. A survey of mobility models for ad hoc network research. Wireless Communication & Mobile Computing (WCMC): Special Issue On Mobile Ad Hoc Networking: Reach, Tends and Applications, 2002,2(5):483-502.
    [8]Hare T. Effective replica allocation in Ad hoc networks for improving data accessibility. In: Proc. of the IEEE INFOCOM2001.California: IEEE Computer Society Press, 2001. 1568-1576.
    [9]McDonal AB, Znati T. A mobility based framework for adaptive clustering in wireless Ad-hoc networks. IEEE Journal on Selected Areas in Communication, 1999,17(8):1466-1487.
    [10]Bomze IM, Budinich M, Pardalos PM, Pelillo M. The maximum clique problem. Handbook of Combinatorial Optimization. Kluwer Academic Publishers, 1999. 27-39.
    [11]Zheng J, Wang Y J, Lu XC, Yang K. A dynamic adaptive replica allocation algorithm in mobile ad hoc networks. In: Proc. of the IEEE Int'l Conf. on Pervasive Computing and Communications (PerCom2004). California: IEEE Computer Society Press, 2004.65-70.
    网友评论
    网友评论
    分享到微博
    发 布
引用本文

郑静,卢锡城,王意洁.移动自组网中基于分簇的数据复制算法.软件学报,2005,16(8):1474-1483

复制
分享
文章指标
  • 点击次数:3538
  • 下载次数: 5139
  • HTML阅读次数: 0
  • 引用次数: 0
历史
  • 收稿日期:2004-05-28
  • 最后修改日期:2004-11-13
文章二维码
友情链接:中国科学院软件研究所中国计算机学会中国科学院国家自然科学基金委员会CCF数字图书馆Int'l J of Softw Info计算机系统应用
您是第19709641位访问者
版权所有：中国科学院软件研究所 京ICP备05046678号-3
地址：北京市海淀区中关村南四街4号,邮政编码：100190
电话：010-62562563 传真：010-62562533 Email：jos@iscas.ac.cn
技术支持：北京勤云科技发展有限公司

京公网安备 11040202500063号