期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

中心计算的无线传感器网络2-不相交路径路由算法 被引量：2

Centralized-Calculating-Based 2-Disjoint Multipath Routing Algorithm for Wireless Sensor Networks
在线阅读 下载PDF
导出
摘要 在多路径路由(multipath routing,MPR)算法中,不相交多路径路由(disjoint multipath routing,DMPR)算法具有更高的可靠性和容错性.DMPR算法面临的主要挑战有2点:不相交路径的选优问题和数据包在不相交路径上的传输问题.针对某些工业应用(例如矿井环境监测)中网络拓扑比较稳定,sink节点运算和存储能力较强等特点,提出了一种中心计算的2-不相交路径路由算法——CCDMPR算法.算法利用全网信息计算出从源节点到sink节点的近似最优2-节点(链路)不相交路径,然后生成仅包含<主父交节点,辅父节点>对和路径比特序列的微路由表并下传到每个节点;针对中心计算方式对链路状态变化的反应迟缓问题,采用了一种中心调度的自适应机制提高路径维护的灵活性.实验结果证明,CCDMPR算法能够显著减小平均路径长度,节省网络整体能量,并能提高数据传输的可靠性. In the multipath routing （MPR） algorithms for wireless sensor networks （WSNs）, disjoint multipath routing （DMPR） approaches perform better in reliability and fault tolerance. However, DMPR poses significant challenges in terms of the optimization of the disjoint paths and the data transmission along the disjoint paths. Considering certain industrial monitoring applications （for example, mine safety monitoring） which have relatively stable network topologies, we propose a centralized-calculating-based 2-disjoint multipath routing algorithm for WSNs （CCDMPR）. Based on the global information, the algorithm firstly calculates near to optimize 2-node （link） disjoint paths from a source to the destination using the number of hops and the path quality as metrics, and generates a tiny routing table which is merely composed of the （master parent node, secondary parent node〉 couple and the path bit series. Then the tiny routing tables are disseminated to each sensor node along the generated paths. In order to improve the resilience of route maintenance, the algorithm designs a centralized adaptive path maintenance mechanism. In the data routing phase, packets are transmitted according to the path bit series carried in their heads, without any control overhead. The experimental results show that CCDMPR algorithm can shorten the average path length, reduce the total energy consumption and improve the transmission reliability compared with existing approaches.
作者 于磊磊 陈冬岩 刘月美 黄旭
机构地区 山东大学控制科学与工程学院 山东大学网络与信息中心
出处 《计算机研究与发展》 EI CSCD 北大核心 2013年第3期517-523,共7页 Journal of Computer Research and Development
基金 山东大学高校院所自主创新计划基金项目(201004004 201102006)
关键词 无线传感器网络 中心计算 多路径路由 不相交多路径路由 可靠性 wireless sensor networks centralized calculating multipath routing disjoint multipathrouting reliability
分类号 TP393.02 [自动化与计算机技术—计算机应用技术]
  • 相关文献

参考文献15

  • 1Teo Jenn Yue, Ha Yajun, Tham Chen Khong. Interference-minimized multipath routing with congestion control in wireless sensor networks for high-rate streaming [J]. IEEE Trans on Mobile Computing, 2008, 7(9): 1124-1137.
  • 2Huang Xiaoxia, Fang Yuguang. Multiconstrained QoS multipath routing in wireless sensor networks [J]. Wireless Networks, 2008, 14(4): 465-478.
  • 3Newsome J, Song D. Graph embedding for routing and datacentric storage in sensor networks without geographic information [C]//Proc of ACM SenSys 2003. New York: ACM, 2003, 76-88.
  • 4Thulasiraman P, Ramasubramanian S, Krunz M. Disjoint multipath routing in dual homing networks using colored trees [C] //Proc of IEEE GLOBECOM'06. New York: IEEE Communications Society, 2006:1-5.
  • 5方效林,石胜飞,李建中.无线传感器网络一种不相交路径路由算法[J].计算机研究与发展,2009,46(12):2053-2061. 被引量：11
  • 6Li Shanping, Wu Zhendong. Node-disjoint parallel multipath routing in wireless sensor networks [C]//Proc of ICESS 2005. Piscataway, NJ: IEEE, 2005: 432-437.
  • 7Oh Hyun Woo, Jang Jong Hyun, et al. An explicit disjoint multipath algorithm for cost efficiency in wireless sensor networks [C]//Proc of IEEE PIMRC 2010. Piscataway, NJ: IEEE, 2010: 1899-1904.
  • 8Lou Wenjing. An efficient n-to-1 multipath routing protocol in wireless sensor networks [C] //Proc of MASS 2005. Washington, DC: IEEE Communications Society, 2005: 665-672.
  • 9Zaman M S, Murthy G R. Clustered and leveled disjoint multipath routing algorithm for wireless sensor networks [C] //Proc of AH-ICI 2009. Los Alamitos, CA: IEEE Computer Society, 2009:1-5.
  • 10Srinivas A, Modiano E. Minimum energy disjoint path routing in wireless ad-hoc networks [C]//Proc of MOBICOM 2003. New York: ACM, 2003: 122-133.

二级参考文献21

  • 1Ishida K, Kakuda Y, Kikuno T. A routing protocol for finding two node-disjoint paths in computer networks [C] // Int Conf on Network Protocols. Washington DC: IEEE, 1992:340-347.
  • 2Suurhalle J W, Disjoint paths in a network [J]. Networks, 1974, 4:125-145.
  • 3Suurhalle J W, Tarjan R E. A quick method for finding shortest pairs of disjoint paths [J]. Networks, 1984, 14(2) : 325-336.
  • 4Bhandari R. Optimal physical diversity algorithms and survivable networks [C] //Proc of the 2nd IEEE Symp on Computers and Communications 1997. Washington: IEEE, 1997:433-441.
  • 5Lee S J, Gerla M. Split multipath routing with maximally disjoint paths in ad hoe networks [C] //Proc of IEEE ICC 2001. Washington: IEEE, 2001:3201-3205.
  • 6Nasipuri A, Das S R. mobile ad hoc networks Washington: IEEE, 199 On-demand multi-path routing for [C] //Proc of IEEE ICCCN 1999. 9: 64-70.
  • 7Vutukury S, Garcia-Luna-Aceves J J. MDVA.. A distancevector multipath routing protocol [C] //Proc of IEEE INFOCOM 2001. Washington: IEEE, 2001:557-564.
  • 8Richard G Ogier, Nachum Shacham. A distributed algorithm for finding shortest pairs of disjoint paths [C]//Proc of IEEE INFOCOM 1989. Washington: IEEE, 1989:173-182.
  • 9Sidhu D, Nair R, Abdallah S. Finding disjoint paths in networks [C] //Proc of ACM SIGCOMM 1991. New York: ACM, 1991:43-51.
  • 10Ogler R G, Rutenburg V, Shacham N. Distributed algorithms for computing shortest pairs of disioint paths [J]. IEEE Trans on Information Theory, 1993, 39(2): 443-455.

共引文献10

同被引文献40

引证文献2

二级引证文献54

计算机研究与发展
2013年 第3期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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