메뉴 건너뛰기




Volumn 14, Issue 3, 2006, Pages 415-439

Clustering in WSN with latency and energy consumption constraints

Author keywords

Clustering; Dominating set (DS); Gateway placement; Quality of service (QoS); Wireless sensor network

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; POLYNOMIAL APPROXIMATION; QUALITY OF SERVICE; QUERY LANGUAGES; SET THEORY; TELECOMMUNICATION TRAFFIC;

EID: 33747686426     PISSN: 10647570     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10922-006-9039-4     Document Type: Article
Times cited : (33)

References (28)
  • 1
    • 85116610435 scopus 로고    scopus 로고
    • Next century challenges: Mobile networking for smart dust
    • Seattle
    • J. M. Kahn, R. H. Katz, and K. S. J. Pister, Next Century Challenges: Mobile Networking for Smart Dust, Proceedings MOBICOM, Seattle, 1999.
    • (1999) Proceedings MOBICOM
    • Kahn, J.M.1    Katz, R.H.2    Pister, K.S.J.3
  • 3
    • 0004059758 scopus 로고    scopus 로고
    • PicoRadio: Adhoc wireless networking of ubiquitous low-energy sensor/monitor nodes
    • Orlando, FL
    • J. Rabaey, J. Ammer, J. L. da Silva and D. Patel, PicoRadio: Adhoc Wireless Networking of Ubiquitous Low-Energy Sensor/Monitor Nodes, IEEE Computer Society Workshop on VLSI, Orlando, FL, pp. 9-12, 2000.
    • (2000) IEEE Computer Society Workshop on VLSI , pp. 9-12
    • Rabaey, J.1    Ammer, J.2    Da Silva, J.L.3    Patel, D.4
  • 4
    • 33747728463 scopus 로고    scopus 로고
    • Reliable wireless networks for industrial systems
    • Published by Ember Corp.
    • Ember Corp., Reliable Wireless Networks for Industrial Systems, Technical White Paper, Published by Ember Corp.
    • Technical White Paper
  • 6
    • 33747675119 scopus 로고    scopus 로고
    • ALERT Systems, http://www.alertsystems.org.
  • 10
    • 85074375621 scopus 로고    scopus 로고
    • Next century challenges: Scalable coordination in sensor networks
    • D. Estrin, R. Govindan, J. Heidemann, and S. Kumar, Next Century Challenges: Scalable Coordination in Sensor Networks, MOBICOM, 1999.
    • (1999) MOBICOM
    • Estrin, D.1    Govindan, R.2    Heidemann, J.3    Kumar, S.4
  • 12
    • 84937441113 scopus 로고    scopus 로고
    • Approximation algorithms for facility location problems
    • D. Shmoys, Approximation Algorithms for Facility Location Problems, APPROX 2000, pp. 27-32, 2000.v.
    • (2000) APPROX 2000 , pp. 27-32
    • Shmoys, D.1
  • 13
    • 0000369468 scopus 로고
    • A heuristic program for locating warehouses
    • A. Kuehn and M. J. Hamburger, A Heuristic Program for Locating Warehouses, Management Sci., Vol. 9, pp. 643-666, 1963.
    • (1963) Management Sci. , vol.9 , pp. 643-666
    • Kuehn, A.1    Hamburger, M.J.2
  • 14
    • 0031643577 scopus 로고    scopus 로고
    • Approximation schemes for euclidean k-medians and related problems
    • S. Arora, P. Raghavan, and S. Rao, Approximation Schemes for Euclidean k-Medians and Related Problems, ACM Symposium on Theory of Computing, pp. 106-113, 1998.
    • (1998) ACM Symposium on Theory of Computing , pp. 106-113
    • Arora, S.1    Raghavan, P.2    Rao, S.3
  • 19
    • 1542358975 scopus 로고    scopus 로고
    • Topology control for wireless sensor networks
    • J. Pan, Y. Hou, L. Cai, Y. Shi, and S. Shen, Topology Control for Wireless Sensor Networks, MobiCom, 2003.
    • (2003) MobiCom
    • Pan, J.1    Hou, Y.2    Cai, L.3    Shi, Y.4    Shen, S.5
  • 20
    • 0041472588 scopus 로고    scopus 로고
    • An energy efficient hierarchical clustering algorithm for wireless sensor networks
    • S. Bandyopadhyay and E. Coyle, An Energy Efficient Hierarchical Clustering Algorithm for Wireless Sensor Networks, Proceedings of IEEE INFOCOM, 2003.
    • (2003) Proceedings of IEEE INFOCOM
    • Bandyopadhyay, S.1    Coyle, E.2
  • 22
    • 0035009259 scopus 로고    scopus 로고
    • A clustering scheme for hierarchical control in multi-hop wireless networks
    • S. Banerjee and S. Khuller, A Clustering Scheme for Hierarchical Control in Multi-hop Wireless Networks, INFOCOM, 2001.
    • (2001) INFOCOM
    • Banerjee, S.1    Khuller, S.2
  • 23
  • 25
    • 11844278271 scopus 로고    scopus 로고
    • Efficient integration of multihop wireless and wired networks with QoS constraints
    • Y. Bejerano, Efficient Integration of Multihop Wireless and Wired Networks with QoS Constraints, IEEE/ACM Transactions on Networking, 2004.
    • (2004) IEEE/ACM Transactions on Networking
    • Bejerano, Y.1
  • 26
    • 0000301097 scopus 로고
    • A greedy heuristic for the set-covering problem
    • V. Chvatal, A Greedy Heuristic for the Set-Covering Problem, Mathematics of Operation Research, Vol. 4, No. 3, pp. 233-235, 1979.
    • (1979) Mathematics of Operation Research , vol.4 , Issue.3 , pp. 233-235
    • Chvatal, V.1
  • 27
    • 0029276335 scopus 로고
    • A randomized linear-time algorithm to find minimum spanning trees
    • D. Karger, P. Klein, and R. Tarjan, A Randomized Linear-Time Algorithm to Find Minimum Spanning Trees, J. ACM, Vol. 42, pp. 321-328, 1995.
    • (1995) J. ACM , vol.42 , pp. 321-328
    • Karger, D.1    Klein, P.2    Tarjan, R.3
  • 28
    • 4143145711 scopus 로고    scopus 로고
    • Design guidelines for wireless sensor networks: Communication, clustering and aggregation
    • V. Mhatre and C. Rosenberg, Design Guidelines for Wireless Sensor Networks: Communication, Clustering and Aggregation, Ad Hoc Networks, 2004
    • (2004) Ad Hoc Networks
    • Mhatre, V.1    Rosenberg, C.2


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