Finding Multiple Length-Bounded Disjoint Paths in Wireless Sensor Networks
暂无分享,去创建一个
[1] Samir Khuller,et al. Efficient parallel algorithms for testing connectivity and finding disjoint s-t paths in graphs , 1989, 30th Annual Symposium on Foundations of Computer Science.
[2] Deborah Estrin,et al. Highly-resilient, energy-efficient multipath routing in wireless sensor networks , 2001, MOCO.
[3] Matt Welsh,et al. Simulating the power consumption of large-scale sensor network applications , 2004, SenSys '04.
[4] B. R. Badrinath,et al. ReInForM: reliable information forwarding using multiple paths in sensor networks , 2003, 28th Annual IEEE International Conference on Local Computer Networks, 2003. LCN '03. Proceedings..
[5] J. Edmonds. Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.
[6] Eytan Modiano,et al. Minimum energy disjoint path routing in wireless ad-hoc networks , 2003, MobiCom '03.
[7] Yehoshua Perl,et al. Heuristics for finding a maximum number of disjoint bounded paths , 1984, Networks.
[8] Kazuo Iwama,et al. A Faster Parallel Algorithm for k-Connectivity , 1997, Inf. Process. Lett..
[9] Dae-Wha Seo,et al. An Energy-Efficient k -Disjoint-Path Routing Algorithm for Reliable Wireless Sensor Networks , 2007, SEUS.
[10] Tohru Kikuno,et al. A routing protocol for finding two node-disjoint paths in computer networks , 1995, Proceedings of International Conference on Network Protocols.
[11] Deepinder P. Sidhu,et al. Finding disjoint paths in networks , 1991, SIGCOMM '91.
[12] Panganamala Ramana Kumar,et al. RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .
[13] Li Jianzhong,et al. A Disjoint Multi-Path Routing Algorithm in Wireless Sensor Network , 2009 .
[14] Ramesh Bhandari,et al. Optimal physical diversity algorithms and survivable networks , 1997, Proceedings Second IEEE Symposium on Computer and Communications.
[15] Andreas Bley,et al. On the complexity of vertex-disjoint length-restricted path problems , 2004, computational complexity.
[16] Nachum Shacham,et al. Distributed algorithms for computing shortest pairs of disjoint paths , 1993, IEEE Trans. Inf. Theory.
[17] Alon Itai,et al. The complexity of finding maximum disjoint paths with length constraints , 1982, Networks.
[18] Shanping Li,et al. Node-disjoint parallel multi-path routing in wireless sensor networks , 2005, Second International Conference on Embedded Software and Systems (ICESS'05).
[19] Chen Gui-hai. AMR:A Multipath Routing Algorithm Based on Maximum Flow in Ad-Hoc Networks , 2004 .
[20] J. W. Suuballe,et al. Disjoint Paths in a Network , 2022 .