메뉴 건너뛰기




Volumn , Issue , 2000, Pages 25-32

Load-balancing clusters in wireless ad hoc networks

Author keywords

Ad hoc networks; Ambient intelligence; Batteries; Computer science; Intelligent networks; Mobile communication; Routing; Spine; Stability; Time division multiple access

Indexed keywords

AD HOC NETWORKS; APPLICATION PROGRAMS; BUDGET CONTROL; COMPUTER SCIENCE; CONVERGENCE OF NUMERICAL METHODS; INTELLIGENT NETWORKS; MOBILE AD HOC NETWORKS; NETWORK MANAGEMENT; SOFTWARE ENGINEERING; SOLAR CELLS; TELECOMMUNICATION NETWORKS; TIME DIVISION MULTIPLE ACCESS;

EID: 84951851779     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ASSET.2000.888028     Document Type: Conference Paper
Times cited : (184)

References (13)
  • 1
    • 0019633305 scopus 로고
    • The Architectural Organization of a Mobile Radio Network via a Distributed Algorithm
    • November
    • D. J. Baker and A. Ephremides. The Architectural Organization of a Mobile Radio Network via a Distributed Algorithm. IEEE Transactions on Communications, COM-29(11):1694-1701, November 1981.
    • (1981) IEEE Transactions on Communications , vol.COM-29 , Issue.11 , pp. 1694-1701
    • Baker, D.J.1    Ephremides, A.2
  • 3
    • 0030689578 scopus 로고    scopus 로고
    • Routing in Ad-Hoc Networks Using Minimum Connected Dominating Sets
    • B. Das and V. Bharghavan. Routing in Ad-Hoc Networks Using Minimum Connected Dominating Sets. In Proceedings of ICC, 1997.
    • (1997) Proceedings of ICC
    • Das, B.1    Bharghavan, V.2
  • 4
    • 0023092944 scopus 로고
    • A Design Concept for Reliable Mobile Radio Networks with Frequency Hopping Signaling
    • A. Ephremides, J. E. Wieselthier, and D. J. Baker. A Design Concept for Reliable Mobile Radio Networks with Frequency Hopping Signaling. Proceedings of IEEE, 75(1):56-73, 1987.
    • (1987) Proceedings of IEEE , vol.75 , Issue.1 , pp. 56-73
    • Ephremides, A.1    Wieselthier, J.E.2    Baker, D.J.3
  • 5
    • 0019516256 scopus 로고
    • Distributed Algorithms for Generating Loop-free Routes in Networks with Frequently Changing Topology
    • January
    • E. Gafni and D. Bertsekas. Distributed Algorithms for Generating Loop-free Routes in Networks with Frequently Changing Topology. IEEE Transactions on Communications, pages 11-18, January 1981.
    • (1981) IEEE Transactions on Communications , pp. 11-18
    • Gafni, E.1    Bertsekas, D.2
  • 7
    • 0023139975 scopus 로고
    • Spatial Reuse in Multihop Packet Radio Networks
    • January
    • L. Kleinrock and J. Silvester. Spatial Reuse in Multihop Packet Radio Networks. Proceedings of the IEEE, 75(1):156-167, January 1987.
    • (1987) Proceedings of the IEEE , vol.75 , Issue.1 , pp. 156-167
    • Kleinrock, L.1    Silvester, J.2
  • 8
    • 0003316425 scopus 로고
    • Selecting Routers in Ad-Hoc Wireless Networks
    • Abhay K. Parekh. Selecting Routers in Ad-Hoc Wireless Networks. In ITS, 1994.
    • (1994) ITS
    • Parekh, A.K.1
  • 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.
    • (1997) Proceedings of IEEE INFOCOM
    • Park, V.D.1    Corson, M.S.2
  • 11
    • 0021470560 scopus 로고
    • An Upper and Lower Bound for Clock Synchronization
    • Jennifer Lundelius and Nancy Lynch. An Upper and Lower Bound for Clock Synchronization. Information and Control, Vol. 62 1984.
    • (1984) Information and Control , vol.62
    • Lundelius, J.1    Lynch, N.2
  • 13
    • 84858869183 scopus 로고    scopus 로고
    • Prentice Hall, Upper Saddle River, N.J.
    • rd Edition). Prentice Hall, Upper Saddle River, N.J., 1996.
    • (1996) rd Edition)
    • Tanenbaum, A.1


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