메뉴 건너뛰기




Volumn , Issue , 2008, Pages

An optimized relay self selection technique for opportunistic routing in mobile Ad Hoc networks

Author keywords

Geographic routing; Interference; Multiple access protocols simulation; Network design; Poisson point process; Routing protocols; Shortest path routing; Signal to interference ratio

Indexed keywords

AD HOC NETWORKS; CARRIER SENSE MULTIPLE ACCESS; MOBILE TELECOMMUNICATION SYSTEMS; MULTIPLE ACCESS INTERFERENCE; PHOTOELECTRIC RELAYS; POISSON DISTRIBUTION; POISSON EQUATION; ROUTING ALGORITHMS; SIGNAL INTERFERENCE; TELECOMMUNICATION LINKS; TELECOMMUNICATION NETWORKS; TRANSMITTERS; WIRELESS TELECOMMUNICATION SYSTEMS;

EID: 57949106115     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/EW.2008.4623843     Document Type: Conference Paper
Times cited : (7)

References (20)
  • 4
    • 51949098614 scopus 로고    scopus 로고
    • F. Baccelli, B. Blaszczyszyn, and P. Mühlethaler. On the performance of time-space opportunistic routing in multihop mobile ad hoc networks. WiOpt, 2008.
    • F. Baccelli, B. Blaszczyszyn, and P. Mühlethaler. On the performance of time-space opportunistic routing in multihop mobile ad hoc networks. WiOpt, 2008.
  • 6
    • 33745126405 scopus 로고    scopus 로고
    • Exor: Opportunistic multi-hop routing for wireless networks
    • New York. NY. USA. ACM Press
    • S. Biswas and R. Morris. Exor: opportunistic multi-hop routing for wireless networks. In S1GCOMM '05, pages 133-144, New York. NY. USA. ACM Press.
    • S1GCOMM '05 , pp. 133-144
    • Biswas, S.1    Morris, R.2
  • 7
    • 1942449823 scopus 로고    scopus 로고
    • IGF: A state-free robust communication protocol for wireless sensor networks
    • Technical Report CS-2003-11, Department of Computer Science, University of Virginia, USA
    • B. Blum, T. He. S. Son, and I. Stankovic. IGF: A state-free robust communication protocol for wireless sensor networks. Technical Report CS-2003-11, Department of Computer Science, University of Virginia, USA, 2003.
    • (2003)
    • Blum, B.1    Son, T.H.S.2    Stankovic, I.3
  • 8
    • 34147120474 scopus 로고
    • A note on two problems in connexion with graphs
    • E. W. Dijkstra. A note on two problems in connexion with graphs. Numerische Mathematik, 1:269-271, 1959.
    • (1959) Numerische Mathematik , vol.1 , pp. 269-271
    • Dijkstra, E.W.1
  • 10
    • 0003819815 scopus 로고
    • Routing and addressing problems in large metropolitan-scale internetworks
    • Technical Report ISI/RR-87-180, Information Sciences Institute, March
    • G. G. Finn. Routing and addressing problems in large metropolitan-scale internetworks. Technical Report ISI/RR-87-180, Information Sciences Institute, March 1987.
    • (1987)
    • Finn, G.G.1
  • 11
    • 62949243125 scopus 로고    scopus 로고
    • ETSI HIPERLAN functional specifications
    • ETS 300-654, June
    • ETSI HIPERLAN functional specifications, ETS 300-654, June 1996.
    • (1996)
  • 12
    • 0030842183 scopus 로고    scopus 로고
    • Priority and collision detection with active signalling: The channel access mechanism of hiperlan
    • January
    • P. Jacquet, P. Minet, P. Mühlethaler, and N. Rivierre. Priority and collision detection with active signalling: The channel access mechanism of hiperlan. In Wireless Personnal Communication., pages 1 1-25, January 1997.
    • (1997) Wireless Personnal Communication , vol.1-25 , pp. 1
    • Jacquet, P.1    Minet, P.2    Mühlethaler, P.3    Rivierre, N.4
  • 14
    • 0034547115 scopus 로고    scopus 로고
    • GPSR: Greedy perimeter stateless routing for wireless networks
    • ACM, IEEE, August
    • B. Karp and H. T. Kung. GPSR: Greedy perimeter stateless routing for wireless networks. In MobiCom 2000,Massachusetts, USA, pages 243-254. ACM / IEEE, August 2000.
    • (2000) MobiCom 2000,Massachusetts, USA , pp. 243-254
    • Karp, B.1    Kung, H.T.2
  • 15
    • 57949097779 scopus 로고    scopus 로고
    • P. Mühlethaler and A. Najid. Optimization of CSMA multihop adhoc network. RR 4928, INRIA, June 2003. Also published in European Wireless 2003.
    • P. Mühlethaler and A. Najid. Optimization of CSMA multihop adhoc network. RR 4928, INRIA, June 2003. Also published in European Wireless 2003.
  • 17
    • 18944407270 scopus 로고    scopus 로고
    • Loop-free hybrid single-path/flooding routing algorithms with guaranteed delivery for wireless networks
    • I. Stojmenovic and X. Lin. Loop-free hybrid single-path/flooding routing algorithms with guaranteed delivery for wireless networks. IEEE Transaction on Parallel and Distributed Systems, 12:1023-1032, 2001.
    • (2001) IEEE Transaction on Parallel and Distributed Systems , vol.12 , pp. 1023-1032
    • Stojmenovic, I.1    Lin, X.2
  • 19
    • 48049089504 scopus 로고    scopus 로고
    • Opportunistic routing in dynamic ad hoc networks: The OPRAH protocol
    • C. Westphal. Opportunistic routing in dynamic ad hoc networks: the OPRAH protocol. IEEE MASS'06, 2006.
    • (2006) IEEE MASS'06
    • Westphal, C.1


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