메뉴 건너뛰기




Volumn , Issue , 2008, Pages 421-428

Opportunity-based topology control in wireless sensor networks

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED ALGORITHMS; DISTRIBUTED COMPUTING SYSTEMS; ENERGY-EFFICIENT; GUARANTEED PERFORMANCE; INTERNATIONAL CONFERENCES; LOSSY LINK; LOSSY LINKS; NODE DEGREE; NP-HARD; PROTOTYPE SYSTEMS; REAL ENVIRONMENTS; RUNNING TIME; TOPOLOGY CONTROL; TOPOLOGY CONTROL ALGORITHMS; WIRELESS LINKS;

EID: 51849164047     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDCS.2008.91     Document Type: Conference Paper
Times cited : (17)

References (26)
  • 1
    • 0021430087 scopus 로고
    • A survey of network reliability and domination theory
    • A. Agrawal and R. Barlow. A survey of network reliability and domination theory. Operations Research, 32:298-323, 1984.
    • (1984) Operations Research , vol.32 , pp. 298-323
    • Agrawal, A.1    Barlow, R.2
  • 2
    • 35148896115 scopus 로고    scopus 로고
    • Opportunistic routing in multi-hop wireless networks
    • S. Biswas and R. Morris. Opportunistic routing in multi-hop wireless networks. In Proc. of SIGCOMM, 2005.
    • (2005) Proc. of SIGCOMM
    • Biswas, S.1    Morris, R.2
  • 4
    • 33745931811 scopus 로고    scopus 로고
    • Temporal properties of low power wireless links: Modeling and implications on multi-hop routing
    • A. Cerpa, J. L. Wong, M. Potkonjak, and D. Estrin. Temporal properties of low power wireless links: Modeling and implications on multi-hop routing. In Proc. of MobiHoc, 2005.
    • (2005) Proc. of MobiHoc
    • Cerpa, A.1    Wong, J.L.2    Potkonjak, M.3    Estrin, D.4
  • 6
    • 84892717978 scopus 로고    scopus 로고
    • Approximation algorithms for minimum-cost k-vertex connectd subgraphs
    • J. Cheriyan, S. Vempala, and A. Vetta. Approximation algorithms for minimum-cost k-vertex connectd subgraphs. In Proc. of STOC, 2002.
    • (2002) Proc. of STOC
    • Cheriyan, J.1    Vempala, S.2    Vetta, A.3
  • 9
    • 0000301097 scopus 로고
    • A greedy heuristic for the set-covering problem
    • V. Chvatal. A greedy heuristic for the set-covering problem. Mathematics of operation Research, 4:410-421, 1979.
    • (1979) Mathematics of operation Research , vol.4 , pp. 410-421
    • Chvatal, V.1
  • 11
    • 51849119848 scopus 로고    scopus 로고
    • Global connectivity from local geometric constraints for sensor networks with various wireless footprints
    • R. D'Souza, D. Randall, C. Moore, and D. Galvin. Global connectivity from local geometric constraints for sensor networks with various wireless footprints. In Proc. of IPSN, 2006.
    • (2006) Proc. of IPSN
    • D'Souza, R.1    Randall, D.2    Moore, C.3    Galvin, D.4
  • 12
    • 1542358972 scopus 로고    scopus 로고
    • Power optimization in fault-tolerant topology control algorithms for wireless multi-hop networks
    • M. Hajiaghayi, N. Immorlica, and V. Mirrokni. Power optimization in fault-tolerant topology control algorithms for wireless multi-hop networks. In Proc. of MobiCom, 2003.
    • (2003) Proc. of MobiCom
    • Hajiaghayi, M.1    Immorlica, N.2    Mirrokni, V.3
  • 13
    • 45849099977 scopus 로고    scopus 로고
    • Network connectivity under probabilistic communication models in wireless sensor networks
    • M. Hefeeda and H. Ahmadi. Network connectivity under probabilistic communication models in wireless sensor networks. In Proc. of IEEE MASS, 2007.
    • (2007) Proc. of IEEE MASS
    • Hefeeda, M.1    Ahmadi, H.2
  • 14
    • 20344393082 scopus 로고    scopus 로고
    • The dynamic behavior of a data dissemination protocol for network programming at scale
    • J. W. Hui and D. E. Culler. The dynamic behavior of a data dissemination protocol for network programming at scale. In Proc. of ACM SenSys, 2004.
    • (2004) Proc. of ACM SenSys
    • Hui, J.W.1    Culler, D.E.2
  • 15
    • 34848862157 scopus 로고    scopus 로고
    • Iso-map: Energy-efficient contour mapping in wireless sensor networks
    • M. Li and Y. Liu. Iso-map: Energy-efficient contour mapping in wireless sensor networks. In ICDCS, 2007.
    • (2007) ICDCS
    • Li, M.1    Liu, Y.2
  • 16
    • 37749028750 scopus 로고    scopus 로고
    • Rendered path: Range-free localization in anisotropic sensor networks with holes
    • M. Li and Y. Liu. Rendered path: Range-free localization in anisotropic sensor networks with holes. In MobiCom, 2007.
    • (2007) MobiCom
    • Li, M.1    Liu, Y.2
  • 17
    • 18844404710 scopus 로고    scopus 로고
    • Design and analysis of a mstbased distributed topology control algorithm for wireless adhoc networks
    • N. Li, J. C. Hou, and L. Sha. Design and analysis of a mstbased distributed topology control algorithm for wireless adhoc networks. IEEE Trans. on Wireless Communications, 4:1195-1207, 2005.
    • (2005) IEEE Trans. on Wireless Communications , vol.4 , pp. 1195-1207
    • Li, N.1    Hou, J.C.2    Sha, L.3
  • 20
    • 32144460154 scopus 로고    scopus 로고
    • Challenges: A radically new architecture for next generation mobile ad-hoc networks
    • R. Ramanathan. Challenges: A radically new architecture for next generation mobile ad-hoc networks. In Proc. of MobiCom, 2005.
    • (2005) Proc. of MobiCom
    • Ramanathan, R.1
  • 21
    • 27344446387 scopus 로고    scopus 로고
    • Topology control in wireless ad hoc and sensor networks
    • P. Santi. Topology control in wireless ad hoc and sensor networks. ACM Computing Surveys, 37:164-194, 2005.
    • (2005) ACM Computing Surveys , vol.37 , pp. 164-194
    • Santi, P.1
  • 22
    • 37749041990 scopus 로고    scopus 로고
    • Experimental study of concurrent transmission in wireless sensor networks
    • Boulder, Colorado, USA
    • D. Son, B. Krishnamachari, and J. Heidemann. Experimental study of concurrent transmission in wireless sensor networks. In Proc. of ACM SenSys, Boulder, Colorado, USA, 2006.
    • (2006) Proc. of ACM SenSys
    • Son, D.1    Krishnamachari, B.2    Heidemann, J.3
  • 23
    • 0000142982 scopus 로고
    • The complexity of enumeration and reliability problems
    • L. G. Valiant. The complexity of enumeration and reliability problems. SLAM Journal on Computing, pages 410-421, 1979.
    • (1979) SLAM Journal on Computing , pp. 410-421
    • Valiant, L.G.1
  • 24
    • 51849128923 scopus 로고    scopus 로고
    • Analysis of a cone-based distributed topology control algorithms for wireless multi-hop networks
    • R. Wattenhofer, L. Li, P. Bahl, and Y.-M. Wang. Analysis of a cone-based distributed topology control algorithms for wireless multi-hop networks. In Proc. of PODC, 2001.
    • (2001) Proc. of PODC
    • Wattenhofer, R.1    Li, L.2    Bahl, P.3    Wang, Y.-M.4
  • 25
    • 33746104832 scopus 로고    scopus 로고
    • Extended dominating set and its applications in ad-hoc networks using cooperative communication
    • J. Wu, M. Cardei, F. Dai, and S. Yang. Extended dominating set and its applications in ad-hoc networks using cooperative communication. IEEE TPDS, 17(8):851-864, 2006.
    • (2006) IEEE TPDS , vol.17 , Issue.8 , pp. 851-864
    • Wu, J.1    Cardei, M.2    Dai, F.3    Yang, S.4
  • 26
    • 20344378689 scopus 로고    scopus 로고
    • Analyzing the transitional region in low power wireless links
    • M. Zuniga and B. Krishnamachari. Analyzing the transitional region in low power wireless links. In Proc. of SECON, 2004.
    • (2004) Proc. of SECON
    • Zuniga, M.1    Krishnamachari, B.2


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