메뉴 건너뛰기




Volumn , Issue , 2008, Pages 422-427

A survey: Topology control for wireless sensor networks

Author keywords

[No Author keywords available]

Indexed keywords

ELECTRIC NETWORK TOPOLOGY; HYBRID SENSORS; NETWORK ARCHITECTURE; ROUTING PROTOCOLS; SENSOR NETWORKS; SENSORS; SIGNAL PROCESSING; TELECOMMUNICATION NETWORKS; TOPOLOGY; WIRELESS NETWORKS; WIRELESS TELECOMMUNICATION SYSTEMS;

EID: 48149108943     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICSCN.2008.4447231     Document Type: Conference Paper
Times cited : (30)

References (34)
  • 1
    • 4544253268 scopus 로고    scopus 로고
    • Dynamic clustering for acoustic target tracking in wireless sensor networks
    • Member-Wei-Peng Chen, Jennifer C. Hon, Fellow-Lui Sha. "Dynamic clustering for acoustic target tracking in wireless sensor networks," IEEE Transactions on Mobile Computing, 3(3):258-271, 2004.
    • (2004) IEEE Transactions on Mobile Computing , vol.3 , Issue.3 , pp. 258-271
    • Chen, M.-W.1    Hon, J.C.2    Sha, F.-L.3
  • 3
    • 33646589837 scopus 로고    scopus 로고
    • An application-specific protocol architecture for wireless microsensor networks
    • Octomber
    • H. W. B, C. A. P, and B. H. "An application-specific protocol architecture for wireless microsensor networks," IEEE Transactions on Wireless Communications, 1(4):660-670, Octomber 2002.
    • (2002) IEEE Transactions on Wireless Communications , vol.1 , Issue.4 , pp. 660-670
  • 4
    • 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," In INFOCOM, pages 1028-1037, 2001.
    • (2001) INFOCOM , pp. 1028-1037
    • Banerjee, S.1    Khuller, S.2
  • 5
    • 33750336231 scopus 로고    scopus 로고
    • Dominating connectivity and reliability of heterogeneous sensor networks
    • IEEE Computer Society
    • K. A. Berman, F. S. Annexstein, and A. Ranganathan. "Dominating connectivity and reliability of heterogeneous sensor networks," In PerCom Workshops, pages 91-95. IEEE Computer Society, 2006.
    • (2006) PerCom Workshops , pp. 91-95
    • Berman, K.A.1    Annexstein, F.S.2    Ranganathan, A.3
  • 6
    • 0013173620 scopus 로고    scopus 로고
    • Unit disk graph recognition is np-hard
    • H. Breu and D. G. Kirkpatrick. "Unit disk graph recognition is np-hard," Comput. Geom., 9(1-2):3-24, 1998.
    • (1998) Comput. Geom , vol.9 , Issue.1-2 , pp. 3-24
    • Breu, H.1    Kirkpatrick, D.G.2
  • 7
    • 0036739784 scopus 로고    scopus 로고
    • Span: An energy-efficient coordination algorithm for topology maintenance in ad hoc wireless networks
    • B. Chen, K. Jamieson, H. Balakrishnan, and R. Morris. "Span: An energy-efficient coordination algorithm for topology maintenance in ad hoc wireless networks," Wireless Networks. 8(5):481-494, 2002.
    • (2002) Wireless Networks , vol.8 , Issue.5 , pp. 481-494
    • Chen, B.1    Jamieson, K.2    Balakrishnan, H.3    Morris, R.4
  • 9
    • 33745179499 scopus 로고    scopus 로고
    • On the throughput scaling of wireless relay networks
    • O. Dousse, M. Franceschetti, and P. Thiran. "On the throughput scaling of wireless relay networks," IEEE/ACM Trans. Netw., 14(SI):2756-2761, 2006.
    • (2006) IEEE/ACM Trans. Netw , vol.14 , Issue.SI , pp. 2756-2761
    • Dousse, O.1    Franceschetti, M.2    Thiran, P.3
  • 10
    • 33745173440 scopus 로고    scopus 로고
    • Critical node lifetimes in random networks via the chen-stein method
    • M. Franceschetti and R. Meester. "Critical node lifetimes in random networks via the chen-stein method," IEEE/ACM "Trans. Netw., 14(SI):2831-2837, 2006.
    • (2006) IEEE/ACM Trans. Netw , vol.14 , Issue.SI , pp. 2831-2837
    • Franceschetti, M.1    Meester, R.2
  • 14
    • 14844318102 scopus 로고    scopus 로고
    • Unit disk graph approximation
    • S. Basagni and C. A. Phillips, editors, ACM
    • F. Kuhn, T. Moscibroda, and R. Wattenhofer. "Unit disk graph approximation," In S. Basagni and C. A. Phillips, editors. DIALM-POMC, pages 17-23, ACM, 2004.
    • (2004) DIALM-POMC , pp. 17-23
    • Kuhn, F.1    Moscibroda, T.2    Wattenhofer, R.3
  • 15
    • 0038228018 scopus 로고    scopus 로고
    • Constructing minimum energy mobile wireless networks
    • X.-Y. Li and P.-J. Wan. "Constructing minimum energy mobile wireless networks." SIGMOBILE Mob. Comput. Commun. Rev., 5(4):55-67, 2001.
    • (2001) SIGMOBILE Mob. Comput. Commun. Rev , vol.5 , Issue.4 , pp. 55-67
    • Li, X.-Y.1    Wan, P.-J.2
  • 19
    • 33847136218 scopus 로고    scopus 로고
    • Algorithmic models for sensor networks
    • IEEE
    • S. Schmid and R. Wattenhofer. "Algorithmic models for sensor networks," In IPDPS. IEEE, 2006.
    • (2006) IPDPS
    • Schmid, S.1    Wattenhofer, R.2
  • 20
    • 0019144223 scopus 로고
    • Properties of gabriel graphs relevant to geographic variation research and the clustering of points in the plane
    • R. Sokal and D. Matula. "Properties of gabriel graphs relevant to geographic variation research and the clustering of points in the plane," Geographical Analysis, 12:205 222, 1980.
    • (1980) Geographical Analysis , vol.12 , pp. 205-222
    • Sokal, R.1    Matula, D.2
  • 21
    • 0020783496 scopus 로고
    • The relative neighborhood graph, with an application to minimum spanning trees
    • K. J. Supowit. "The relative neighborhood graph, with an application to minimum spanning trees," J. ACM. 30(3):428 448, 1983.
    • (1983) J. ACM , vol.30 , Issue.3 , pp. 428-448
    • Supowit, K.J.1
  • 22
    • 0019213414 scopus 로고
    • The relative neighbourhood graph of a finite planar set
    • G. T. Toussaint. "The relative neighbourhood graph of a finite planar set," Pattern Recognition, 12(4):261-268, 1980.
    • (1980) Pattern Recognition , vol.12 , Issue.4 , pp. 261-268
    • Toussaint, G.T.1
  • 23
    • 84863240687 scopus 로고    scopus 로고
    • M. A. M. Vieira, L. F. M. Vieira, L. B. Ruiz, A. A. F. Loureiro, A. O. Fernandes, and J. M. S. Nogueira. Scheduling nodes in wireless sensor networks: A voronoi approach, In LCN, pages 423-429. IEEE Computer Society, 2003.
    • M. A. M. Vieira, L. F. M. Vieira, L. B. Ruiz, A. A. F. Loureiro, A. O. Fernandes, and J. M. S. Nogueira. "Scheduling nodes in wireless sensor networks: A voronoi approach," In LCN, pages 423-429. IEEE Computer Society, 2003.
  • 24
    • 32844458902 scopus 로고    scopus 로고
    • Exploring mesh and tree-based multicast routing protocols for manets
    • K. Viswanath, K. Obraczka, and G. Tsudik. "Exploring mesh and tree-based multicast routing protocols for manets," IEEE Trans. Mob. Comput., 5(1):28-42, 2006.
    • (2006) IEEE Trans. Mob. Comput , vol.5 , Issue.1 , pp. 28-42
    • Viswanath, K.1    Obraczka, K.2    Tsudik, G.3
  • 25
    • 0036346466 scopus 로고    scopus 로고
    • Distributed construction of connected dominating set in wireless ad hoc networks
    • P.-J. Wan, K. M. Alzoubi, and O. Frieder. "Distributed construction of connected dominating set in wireless ad hoc networks," In INFOCOM, 2002.
    • (2002) INFOCOM
    • Wan, P.-J.1    Alzoubi, K.M.2    Frieder, O.3
  • 26
    • 34047208114 scopus 로고    scopus 로고
    • A delaunay triangulation based method for wireless sensor network deployment
    • IEEE Computer Society
    • C.-H. Wu, K.-C. Lee, and Y.-C. Chung. "A delaunay triangulation based method for wireless sensor network deployment." In ICPADS (1), pages 253-260. IEEE Computer Society, 2006.
    • (2006) ICPADS (1) , pp. 253-260
    • Wu, C.-H.1    Lee, K.-C.2    Chung, Y.-C.3
  • 28
    • 32644448886 scopus 로고    scopus 로고
    • Minimum connected dominating sets and maximal independent sets in unit disk graphs
    • W. Wu, H. Du, X. Jia, Y. Li, and S. C.-H. Huang. "Minimum connected dominating sets and maximal independent sets in unit disk graphs," Theor. Comput. Sci., 352(1-3): 1-7, 2006.
    • (2006) Theor. Comput. Sci , vol.352 , Issue.1-3 , pp. 1-7
    • Wu, W.1    Du, H.2    Jia, X.3    Li, Y.4    Huang, S.C.-H.5
  • 31
    • 0001154535 scopus 로고
    • On constructing minimum spanning trees in k-dimensional spaces and related problems
    • A. C.-C. Yao. "On constructing minimum spanning trees in k-dimensional spaces and related problems," SIAM J. Comput., 11(4):721-736, 1982.
    • (1982) SIAM J. Comput , vol.11 , Issue.4 , pp. 721-736
    • Yao, A.C.-C.1
  • 32
    • 10944266504 scopus 로고    scopus 로고
    • Heed: A hybrid, energy-efficient, distributed clustering approach for ad hoc sensor networks
    • O. Younis and S. Fahmy. "Heed: A hybrid, energy-efficient, distributed clustering approach for ad hoc sensor networks," IEEE Trans. Mob. Comput., 3(4):366-379, 2004.
    • (2004) IEEE Trans. Mob. Comput , vol.3 , Issue.4 , pp. 366-379
    • Younis, O.1    Fahmy, S.2


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