메뉴 건너뛰기




Volumn 2005, Issue , 2005, Pages

Link redundancy based connected topologies in ad-hoc networks

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; GRAPH THEORY; OPTIMIZATION; POWER TRANSMISSION; TELECOMMUNICATION LINKS;

EID: 33947157084     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (3)

References (18)
  • 2
    • 33947170166 scopus 로고    scopus 로고
    • proceedings of The 2nd Workshop on the Internet, Telecommunications and Signal Processing WITSP'03, Coolangatta, Gold Coast, Australia, Dec
    • Lipman J., Boustead P., Chicharo J., and Judge J., "Optimised flooding in ad hoc networks," in In proceedings of The 2nd Workshop on the Internet, Telecommunications and Signal Processing (WITSP'03), Coolangatta, Gold Coast, Australia, Dec. 2003.
    • (2003) Optimised flooding in ad hoc networks
    • Lipman, J.1    Boustead, P.2    Chicharo, J.3    Judge, J.4
  • 4
    • 33947180670 scopus 로고    scopus 로고
    • L. Klienrock and J. Silvester, Optimum transmission radii for packet radio networks or why six is a magic number, in Proceedings of the IEEE National Telecommunication Conference, 1978, pp. 4.3.1-4.3.5.
    • L. Klienrock and J. Silvester, "Optimum transmission radii for packet radio networks or why six is a magic number," in Proceedings of the IEEE National Telecommunication Conference, 1978, pp. 4.3.1-4.3.5.
  • 5
    • 33947139918 scopus 로고    scopus 로고
    • The number of neighbours needed for connectivity of wireless networks
    • Feng Xue and P.R. Kumar, "The number of neighbours needed for connectivity of wireless networks," in To appear in Wireless Networks.
    • To appear in Wireless Networks
    • Xue, F.1    Kumar, P.R.2
  • 8
    • 33947115564 scopus 로고    scopus 로고
    • proceedings of The 3nd Workshop on the Internet, Telecommunications and Signal Processing WITSP'04, Adelaide, Australia. IEEE, Dec
    • G. Srivastava, P. Boustead, and J. Chicharo, "Achieving a minimum node degree in ad-hoc networks," in In proceedings of The 3nd Workshop on the Internet, Telecommunications and Signal Processing (WITSP'04), Adelaide, Australia. IEEE, Dec. 2004.
    • (2004) Achieving a minimum node degree in ad-hoc networks
    • Srivastava, G.1    Boustead, P.2    Chicharo, J.3
  • 13
    • 0020783496 scopus 로고
    • The relative neighbourhood graph with application to minimum spanning trees
    • Kenneth J. Supowit, "The relative neighbourhood graph with application to minimum spanning trees," in Journal of the ACM,voI. 30, no. 3, pp 428-448, 1983.
    • (1983) Journal of the ACM,voI. 30, no. 3, pp 428-448
    • Supowit, K.J.1
  • 14
    • 0026924875 scopus 로고
    • The relative neighbourhood graphs and their relatives
    • Sept
    • Jerzy W. Jaromczyk and Godfried T. Toussaint, "The relative neighbourhood graphs and their relatives," in Proceedings of the IEEE, Vol. 80, No 9, Sept. 1992.
    • (1992) Proceedings of the IEEE , vol.80 , Issue.9
    • Jaromczyk, J.W.1    Toussaint, G.T.2
  • 16
    • 0033893765 scopus 로고    scopus 로고
    • Topology control of multihop wireless networks using transmit power adjustment
    • R. Ramanathan and R. Rosales-Hain, "Topology control of multihop wireless networks using transmit power adjustment," in Proceedings of IEEE INFOCOM, 2000.
    • (2000) Proceedings of IEEE INFOCOM
    • Ramanathan, R.1    Rosales-Hain, R.2
  • 18
    • 28244500915 scopus 로고    scopus 로고
    • Ad hoc On-Demand Distance Vector Routing Protocol for Mobile Ad Hoc Networks
    • June
    • C.E Perkins and E.M. Bending-Royer, "Ad hoc On-Demand Distance Vector Routing Protocol for Mobile Ad Hoc Networks," in draft-ietfmanet-aodv-11.txt., June 2002.
    • (2002) draft-ietfmanet-aodv-11.txt
    • Perkins, C.E.1    Bending-Royer, E.M.2


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