메뉴 건너뛰기




Volumn 11, Issue 6, 2007, Pages 495-497

Connectivity of ad hoc networks with link asymmetries induced by shadowing

Author keywords

Ad hoc networks; Connectivity; Log normal shadowing; Multi hop networks; Random graphs theory

Indexed keywords

COMPUTER SIMULATION; GRAPH THEORY; RANDOM PROCESSES; ROUTING PROTOCOLS; TELECOMMUNICATION LINKS; WIRELESS NETWORKS;

EID: 34548034892     PISSN: 10897798     EISSN: None     Source Type: Journal    
DOI: 10.1109/LCOMM.2007.062095     Document Type: Article
Times cited : (14)

References (13)
  • 1
    • 24144470055 scopus 로고    scopus 로고
    • Connectivity of wireless multihop networks in a shadow fading environment
    • Sept
    • C. Bettstetter and C. Hartmann, "Connectivity of wireless multihop networks in a shadow fading environment," Wireless Networks, vol. 11, no. 5, pp. 571-579, Sept. 2005.
    • (2005) Wireless Networks , vol.11 , Issue.5 , pp. 571-579
    • Bettstetter, C.1    Hartmann, C.2
  • 2
    • 33746898272 scopus 로고    scopus 로고
    • The k-neighbors approach to interference bounded and symmetric topology control in ad hoc networks
    • Sept
    • D. B. Blough, M. Leoncini, G. Resta, and P. Santi, "The k-neighbors approach to interference bounded and symmetric topology control in ad hoc networks," IEEE Trans. Mobile Computing, vol. 5, no. 9, pp. 1267-1282, Sept. 2006.
    • (2006) IEEE Trans. Mobile Computing , vol.5 , Issue.9 , pp. 1267-1282
    • Blough, D.B.1    Leoncini, M.2    Resta, G.3    Santi, P.4
  • 3
    • 11944253901 scopus 로고    scopus 로고
    • 2nd ed. Cambridge, UK: Cambridge University Press
    • B. Bollobás, Random Graph, 2nd ed. Cambridge, UK: Cambridge University Press, 2001.
    • (2001) Random Graph
    • Bollobás, B.1
  • 6
    • 0000657887 scopus 로고
    • Random plane networks
    • Dec
    • E. N. Gilbert, "Random plane networks," J. of SIAM, vol. 9, no. 4, pp. 533-543, Dec. 1961.
    • (1961) J. of SIAM , vol.9 , Issue.4 , pp. 533-543
    • Gilbert, E.N.1
  • 8
    • 0038377118 scopus 로고    scopus 로고
    • Probability distributions for the number of radio transceivers which can communicate with one another
    • Apr
    • J. Orriss and S. K. Barton, "Probability distributions for the number of radio transceivers which can communicate with one another," IEEE Trans. Commun., vol. 51, no. 4, pp. 676-681, Apr. 2003.
    • (2003) IEEE Trans. Commun , vol.51 , Issue.4 , pp. 676-681
    • Orriss, J.1    Barton, S.K.2
  • 9
    • 34548050039 scopus 로고
    • On the strong connectedness of directed random graphs
    • I. Palásti, "On the strong connectedness of directed random graphs," Studia Sci. Math. Hung., vol. 1, pp. 205-214, 1966.
    • (1966) Studia Sci. Math. Hung , vol.1 , pp. 205-214
    • Palásti, I.1
  • 10
    • 33748350705 scopus 로고    scopus 로고
    • Optimal transmit power in wireless sensor networks
    • Oct
    • S. Panichpapiboon, G. Ferrari, and O. K. Tonguz, "Optimal transmit power in wireless sensor networks," IEEE Trans. Mobile Computing, vol. 5, no. 10, pp. 1432-1447, Oct. 2006.
    • (2006) IEEE Trans. Mobile Computing , vol.5 , Issue.10 , pp. 1432-1447
    • Panichpapiboon, S.1    Ferrari, G.2    Tonguz, O.K.3
  • 11
    • 0036343705 scopus 로고    scopus 로고
    • Providing a bidirectional abstraction for unidirectional ad hoc networks
    • June
    • V. Ramasubramanian, R. Chandra, and D. Mosse, "Providing a bidirectional abstraction for unidirectional ad hoc networks," in Proc. INFOCOM'02, June 2002, pp. 1258-1267.
    • (2002) Proc. INFOCOM'02 , pp. 1258-1267
    • Ramasubramanian, V.1    Chandra, R.2    Mosse, D.3


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