메뉴 건너뛰기




Volumn , Issue , 2007, Pages 1019-1027

On optimal geographic routing in wireless networks with holes and non-uniform traffic

Author keywords

[No Author keywords available]

Indexed keywords

CONGESTION CONTROL (COMMUNICATION); GEOGRAPHIC INFORMATION SYSTEMS; ROUTING ALGORITHMS;

EID: 34548335254     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2007.123     Document Type: Conference Paper
Times cited : (37)

References (28)
  • 1
    • 0032652681 scopus 로고    scopus 로고
    • A position based multizone routing protocol for wide area mobile ad-hoc networks
    • K. N. Amouris, S. Papavassiliou, and M. Li. A position based multizone routing protocol for wide area mobile ad-hoc networks. In Proc. of the 49th IEEE VTC, pages 1365-1369, 1999.
    • (1999) Proc. of the 49th IEEE VTC , pp. 1365-1369
    • Amouris, K.N.1    Papavassiliou, S.2    Li, M.3
  • 3
    • 0037351970 scopus 로고    scopus 로고
    • Dynamic cesaro-wardrop equilibration in networks
    • V. Borkar and P. R. Kumar. Dynamic cesaro-wardrop equilibration in networks. In IEEE Trans. on Auto. Control, 48(3):382-396, 2003.
    • (2003) IEEE Trans. on Auto. Control , vol.48 , Issue.3 , pp. 382-396
    • Borkar, V.1    Kumar, P.R.2
  • 4
    • 0035505507 scopus 로고    scopus 로고
    • Routing with guaranteed delivery in ad hoc wireless networks
    • P. Bose, P. Morin, I. Stojmenovic, and J. Urrutia. Routing with guaranteed delivery in ad hoc wireless networks. Wireless Networks, 7(6):609-616, 2001.
    • (2001) Wireless Networks , vol.7 , Issue.6 , pp. 609-616
    • Bose, P.1    Morin, P.2    Stojmenovic, I.3    Urrutia, J.4
  • 6
    • 8344224464 scopus 로고    scopus 로고
    • Locating and bypassing routing holes in sensor networks
    • March
    • Q. Fang, J. Gao, and L. Guibas. Locating and bypassing routing holes in sensor networks. In Proc. of IEEE Infocom, March, 2004.
    • (2004) Proc. of IEEE Infocom
    • Fang, Q.1    Gao, J.2    Guibas, L.3
  • 9
    • 33747142749 scopus 로고    scopus 로고
    • The capacity of wireless networks
    • March
    • P. Gupta and P. R. Kumar. The capacity of wireless networks. IEEE Trans. on Info. Theory, IT-46(2):388-404, March 2000.
    • (2000) IEEE Trans. on Info. Theory , vol.IT-46 , Issue.2 , pp. 388-404
    • Gupta, P.1    Kumar, P.R.2
  • 10
    • 0001341422 scopus 로고    scopus 로고
    • DSR: The dynamic source routing protocol for multi-hop wireless ad hoc networks
    • Addison-Wesley
    • D.B. Johnson, D.A. Maltz, and J. Broch. DSR: The dynamic source routing protocol for multi-hop wireless ad hoc networks. In Ad Hoc Networking, pages 139-172. Addison-Wesley, 2001.
    • (2001) Ad Hoc Networking , pp. 139-172
    • Johnson, D.B.1    Maltz, D.A.2    Broch, J.3
  • 12
    • 33745825184 scopus 로고    scopus 로고
    • On the pitfalls of geographic face routing
    • New York, NY, USA, ACM Press
    • Y.J Kim, R. Govindan, B. Karp, and S. Shenker. On the pitfalls of geographic face routing. In Proc. of DIALM-POMC, pages 34-43, New York, NY, USA, 2005. ACM Press.
    • (2005) Proc. of DIALM-POMC , pp. 34-43
    • Kim, Y.J.1    Govindan, R.2    Karp, B.3    Shenker, S.4
  • 14
    • 0242696173 scopus 로고    scopus 로고
    • Worst-case optimal and average-case efficient geometric ad-hoc routing
    • F. Kuhn, R. Wattenhofer, and A. Zollinger. Worst-case optimal and average-case efficient geometric ad-hoc routing. In Proc. of ACM MobiHoc, 2003.
    • (2003) Proc. of ACM MobiHoc
    • Kuhn, F.1    Wattenhofer, R.2    Zollinger, A.3
  • 15
    • 0024135198 scopus 로고
    • An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms
    • T. Leighton and S. Rao. An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms. In FOCS, 1988.
    • (1988) FOCS
    • Leighton, T.1    Rao, S.2
  • 16
  • 19
    • 20544449224 scopus 로고    scopus 로고
    • Capacity and delay tradeoffs for ad hoc mobile networks
    • June
    • M.J. Neely and E. Modiano. Capacity and delay tradeoffs for ad hoc mobile networks. In IEEE Trans Inf. Theory, June 2005.
    • (2005) IEEE Trans Inf. Theory
    • Neely, M.J.1    Modiano, E.2
  • 21
    • 85031307530 scopus 로고
    • Highly dynamic destination-sequenced distance-vector routing for mobile computers (DSDV)
    • London, UK, August
    • C. Perkins and P. Bhagwat. Highly dynamic destination-sequenced distance-vector routing for mobile computers (DSDV). In Proc. of ACM Sigcomm, London, UK, August 1994.
    • (1994) Proc. of ACM Sigcomm
    • Perkins, C.1    Bhagwat, P.2
  • 23
    • 33750336267 scopus 로고    scopus 로고
    • Robust network connectivity: When it's the big picture that matters
    • E. Peserico and L. Rudolph. Robust network connectivity: when it's the big picture that matters. SIGMETRICS Perform. Eval. Rev., 34(1):299-310, 2006.
    • (2006) SIGMETRICS Perform. Eval. Rev , vol.34 , Issue.1 , pp. 299-310
    • Peserico, E.1    Rudolph, L.2
  • 25
    • 39049148855 scopus 로고    scopus 로고
    • Delay-capacity tradeoffs in mobile ad-hoc networks: A global perspective
    • G. Sharma, R. Mazumdar, and N. Shroff. Delay-capacity tradeoffs in mobile ad-hoc networks: A global perspective. In Proc. of IEEE Infocom, 2006.
    • (2006) Proc. of IEEE Infocom
    • Sharma, G.1    Mazumdar, R.2    Shroff, N.3
  • 27
    • 84930890020 scopus 로고
    • Stability properties of constrained queueing systems and scheduling for maximum throughput in multihop radio networks
    • December
    • L. Tassiulas and A. Ephremides. Stability properties of constrained queueing systems and scheduling for maximum throughput in multihop radio networks. IEEE Trans. on Auto. Control, 37(12):1936-1949, December 1992.
    • (1992) IEEE Trans. on Auto. Control , vol.37 , Issue.12 , pp. 1936-1949
    • Tassiulas, L.1    Ephremides, A.2


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