메뉴 건너뛰기




Volumn , Issue , 2007, Pages 643-651

Disjoint multipath routing to two distinct drains in a multi-drain sensor network

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA RECORDING; DATA REDUCTION; NETWORK ROUTING; PACKET NETWORKS; TELECOMMUNICATION LINKS;

EID: 34548337322     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2007.81     Document Type: Conference Paper
Times cited : (51)

References (22)
  • 2
    • 84962233848 scopus 로고
    • Finding disjoint paths in networks
    • September
    • D. Sidhu, R. Nair, and S. Abdallah, "Finding disjoint paths in networks," in Proceedings of SIGCOM, September 1991, pp. 43-51.
    • (1991) Proceedings of SIGCOM , pp. 43-51
    • Sidhu, D.1    Nair, R.2    Abdallah, S.3
  • 3
    • 0029734750 scopus 로고    scopus 로고
    • Congestion-oriented shortest multipath routing
    • March
    • S. Murthy and J. J. Garcia-Luna-Aceves, "Congestion-oriented shortest multipath routing," in Proceedings of IEEE INFOCOM, March 1996, vol. 3, pp. 1028-1036.
    • (1996) Proceedings of IEEE INFOCOM , vol.3 , pp. 1028-1036
    • Murthy, S.1    Garcia-Luna-Aceves, J.J.2
  • 4
    • 34547267603 scopus 로고    scopus 로고
    • Distributed linear time construction of colored trees for disjoint multipath routing
    • to appear in, May
    • S. Ramasubramanian, M. Harkara, and M. Krunz, "Distributed linear time construction of colored trees for disjoint multipath routing," to appear in Proceedings of IFIP Networking, May 2006.
    • (2006) Proceedings of IFIP Networking
    • Ramasubramanian, S.1    Harkara, M.2    Krunz, M.3
  • 5
    • 0034844688 scopus 로고    scopus 로고
    • Split multipath routing with maximally disjoint paths in ad hoc networks
    • S.J. Lee and M. Gerla, "Split multipath routing with maximally disjoint paths in ad hoc networks," in Proceedings of IEEE ICC, 2001, pp. 3201-3205.
    • (2001) Proceedings of IEEE ICC , pp. 3201-3205
    • Lee, S.J.1    Gerla, M.2
  • 6
    • 84944881532 scopus 로고    scopus 로고
    • On-demand multipath routing for mobile ad hoc networks
    • October
    • A. Nasipuri and S. R. Das, "On-demand multipath routing for mobile ad hoc networks," in Proceedings of IEEE ICCCN, October 1999, pp. 64-70.
    • (1999) Proceedings of IEEE ICCCN , pp. 64-70
    • Nasipuri, A.1    Das, S.R.2
  • 8
    • 0035703920 scopus 로고    scopus 로고
    • On-demand multipath distance vector routing in ad hoc networks
    • M.K. Marina and S.R. Das, "On-demand multipath distance vector routing in ad hoc networks," in Proceedings of IEEE ICNP, 2001, pp. 14-23.
    • (2001) Proceedings of IEEE ICNP , pp. 14-23
    • Marina, M.K.1    Das, S.R.2
  • 9
    • 0031353437 scopus 로고    scopus 로고
    • A highly adaptive distributed routing algorithm for mobile wireless networks
    • April
    • V.D. Park and M.S. Corson, "A highly adaptive distributed routing algorithm for mobile wireless networks," in Proceedings of IEEE INFOCOM, April 1997, pp. 1405-1413.
    • (1997) Proceedings of IEEE INFOCOM , pp. 1405-1413
    • Park, V.D.1    Corson, M.S.2
  • 10
    • 84976221388 scopus 로고    scopus 로고
    • A new approach to on demand loop free multipath routing
    • October
    • J. Raju and J.J. Garcia-Lunas Aceves, "A new approach to on demand loop free multipath routing," in Proceedings of IEEE ICCCN, October 1999, pp. 522-527.
    • (1999) Proceedings of IEEE ICCCN , pp. 522-527
    • Raju, J.1    Garcia-Lunas Aceves, J.J.2
  • 11
    • 0042976102 scopus 로고    scopus 로고
    • Cooperative packet caching and shortest multipath in mobile adhoc networks
    • March-April
    • A. Valera, W.K.G. Seah, and S.V. Rao, "Cooperative packet caching and shortest multipath in mobile adhoc networks," in Proceedings of IEEE INFOCOM, March-April 2003, pp. 260-269.
    • (2003) Proceedings of IEEE INFOCOM , pp. 260-269
    • Valera, A.1    Seah, W.K.G.2    Rao, S.V.3
  • 12
    • 0034590189 scopus 로고    scopus 로고
    • Aodv-br: Backup routing in ad hoc networks
    • September
    • S.J. Lee and M. Geria, "Aodv-br: Backup routing in ad hoc networks," in Proceedings of IEEE WCNC, September 2000, pp. 1311-1316.
    • (2000) Proceedings of IEEE WCNC , pp. 1311-1316
    • Lee, S.J.1    Geria, M.2
  • 13
    • 33745923542 scopus 로고    scopus 로고
    • Disjoint multipath routing using colored trees
    • Technical report, University of Arizona
    • S. Ramasubramanian, H. Krishnamoorthy, and M. Krunz, "Disjoint multipath routing using colored trees," Technical report, University of Arizona, 2005, http://www.ece.arizona.edu/~srini/Publications.html.
    • (2005)
    • Ramasubramanian, S.1    Krishnamoorthy, H.2    Krunz, M.3
  • 15
    • 26444462927 scopus 로고    scopus 로고
    • Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge-redundant graphs
    • M. Medard, S.G. Finn, R.A. Barry, and R.G. Gallagher, "Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge-redundant graphs," IEEE/ACM Transactions on Networking, vol. 7, no. 5, pp. 641-652, 1999.
    • (1999) IEEE/ACM Transactions on Networking , vol.7 , Issue.5 , pp. 641-652
    • Medard, M.1    Finn, S.G.2    Barry, R.A.3    Gallagher, R.G.4
  • 16
    • 0141917670 scopus 로고    scopus 로고
    • Quality of service and quality of protection issues in preplanned recovery schemes using redundant trees
    • G. Xue, L. Chen, and K. Thulasiraman, "Quality of service and quality of protection issues in preplanned recovery schemes using redundant trees," in IEEE Journal on Selected Areas in Communications, 2003, vol. 21, pp. 1332-1345.
    • (2003) IEEE Journal on Selected Areas in Communications , vol.21 , pp. 1332-1345
    • Xue, G.1    Chen, L.2    Thulasiraman, K.3
  • 17
    • 25644442522 scopus 로고    scopus 로고
    • Linear time construction of redundant trees for recovery schemes enhancing qop and qos
    • March
    • W. Zhang, G. Xue, J. Tang, and K. Thulasiraman, "Linear time construction of redundant trees for recovery schemes enhancing qop and qos," in Proceedings of IEEE INFOCOM, March 2005, pp. 2702-2710.
    • (2005) Proceedings of IEEE INFOCOM , pp. 2702-2710
    • Zhang, W.1    Xue, G.2    Tang, J.3    Thulasiraman, K.4
  • 19
    • 30344445246 scopus 로고    scopus 로고
    • Enhancing base station security in wireless sensor networks
    • Technical report, University of Colorado
    • Jing Deng, Richard Han, and Shivakant Mishra, "Enhancing base station security in wireless sensor networks," Technical report, University of Colorado, 2003.
    • (2003)
    • Deng, J.1    Han, R.2    Mishra, S.3
  • 21


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.