메뉴 건너뛰기




Volumn 58, Issue 3, 2009, Pages 1429-1442

EECCR: An energy-efficient m-Coverage and n-Connectivity routing algorithm under border effects in heterogeneous sensor networks

Author keywords

Border effects; Connectivity; Coverage; Energy efficient; Routing; Wireless sensor networks (WSNs)

Indexed keywords

BORDER EFFECTS; CONNECTIVITY; COVERAGE; ENERGY EFFICIENT; ROUTING;

EID: 64049114926     PISSN: 00189545     EISSN: None     Source Type: Journal    
DOI: 10.1109/TVT.2008.926216     Document Type: Article
Times cited : (43)

References (26)
  • 3
    • 0034229951 scopus 로고    scopus 로고
    • Pico-Radio supports ad hoc ultra-low power wireless networking
    • Jul
    • J. M. Rabaey, M. J. Ammer, J. L. da Silva, D. Patel, and S. Roundy, "Pico-Radio supports ad hoc ultra-low power wireless networking," Computer, vol. 33, no. 7, pp. 42-48, Jul. 2000.
    • (2000) Computer , vol.33 , Issue.7 , pp. 42-48
    • Rabaey, J.M.1    Ammer, M.J.2    da Silva, J.L.3    Patel, D.4    Roundy, S.5
  • 5
    • 13944283393 scopus 로고    scopus 로고
    • A survey on routing protocols for wireless sensor networks
    • May
    • K. Akkaya and M. Younis, "A survey on routing protocols for wireless sensor networks," Ad Hoc Netw., vol. 3, no. 3, pp. 325-349, May 2005.
    • (2005) Ad Hoc Netw , vol.3 , Issue.3 , pp. 325-349
    • Akkaya, K.1    Younis, M.2
  • 7
    • 0001905225 scopus 로고    scopus 로고
    • Energy-efficient routing protocols for wireless microsensor networks
    • W. Heinzelman, A. Chandrakasan, and H. Balakrishnan, "Energy-efficient routing protocols for wireless microsensor networks," in Proc. 33rd HICSS, 2000, pp. 3005-3014.
    • (2000) Proc. 33rd HICSS , pp. 3005-3014
    • Heinzelman, W.1    Chandrakasan, A.2    Balakrishnan, H.3
  • 8
    • 10944266504 scopus 로고    scopus 로고
    • HEED: A hybrid, energy-efficient, distributed clustering approach for ad hoc sensor networks
    • Oct./Dec
    • O. Younis and S. Fahmy, "HEED: A hybrid, energy-efficient, distributed clustering approach for ad hoc sensor networks," IEEE Trans. Mobile Comput., vol. 3, no. 4, pp. 366-379, Oct./Dec. 2004.
    • (2004) IEEE Trans. Mobile Comput , vol.3 , Issue.4 , pp. 366-379
    • Younis, O.1    Fahmy, S.2
  • 9
    • 0242334164 scopus 로고    scopus 로고
    • Minimizing communication costs in hierarchically-clustered networks of wireless sensors
    • Jan
    • S. Bandyopadhyay and E. J. Coyle, "Minimizing communication costs in hierarchically-clustered networks of wireless sensors," Comput. Netw., vol. 44, no. 1, pp. 1-16, Jan. 2004.
    • (2004) Comput. Netw , vol.44 , Issue.1 , pp. 1-16
    • Bandyopadhyay, S.1    Coyle, E.J.2
  • 10
    • 38549179940 scopus 로고    scopus 로고
    • EEMC: An energy efficient multi-level clustering algorithm for large-scale wireless sensor networks
    • Feb
    • Y. Jin, L. Wang, Y. Kim, and X. Z. Yang, "EEMC: An energy efficient multi-level clustering algorithm for large-scale wireless sensor networks," Comput. Netw., vol. 52, no. 3, pp. 542-562, Feb. 2008.
    • (2008) Comput. Netw , vol.52 , Issue.3 , pp. 542-562
    • Jin, Y.1    Wang, L.2    Kim, Y.3    Yang, X.Z.4
  • 13
    • 0037630649 scopus 로고    scopus 로고
    • PEAS: A robust energy conserving protocol for long-lived sensor networks
    • F. Ye, G. Zhong, S. Lu, and L. Zhang, "PEAS: A robust energy conserving protocol for long-lived sensor networks," in Proc. 23rd ICDCS, 2003, pp. 28-37.
    • (2003) Proc. 23rd ICDCS , pp. 28-37
    • Ye, F.1    Zhong, G.2    Lu, S.3    Zhang, L.4
  • 14
    • 0036983403 scopus 로고    scopus 로고
    • A coverage-preserving node scheduling scheme for large wireless sensor networks
    • D. Tian and N. D. Georganas, "A coverage-preserving node scheduling scheme for large wireless sensor networks," in Proc. 1st ACM Int. Workshop WSNA, 2002, pp. 32-41.
    • (2002) Proc. 1st ACM Int. Workshop WSNA , pp. 32-41
    • Tian, D.1    Georganas, N.D.2
  • 15
    • 0034865562 scopus 로고    scopus 로고
    • Power efficient organization of wireless sensor networks
    • S. Slijepcevic and M. Potkonjak, "Power efficient organization of wireless sensor networks," in Proc. IEEE ICC, 2001, pp. 472-476.
    • (2001) Proc. IEEE ICC , pp. 472-476
    • Slijepcevic, S.1    Potkonjak, M.2
  • 16
    • 33144487909 scopus 로고    scopus 로고
    • Connected sensor cover: Self-organization of sensor networks for efficient query execution
    • Feb
    • H. Gupta, S. R. Das, and Q. Y. Gu, "Connected sensor cover: Self-organization of sensor networks for efficient query execution," IEEE/ACM Trans. Netw., vol. 14, no. 1, pp. 55-67, Feb. 2006.
    • (2006) IEEE/ACM Trans. Netw , vol.14 , Issue.1 , pp. 55-67
    • Gupta, H.1    Das, S.R.2    Gu, Q.Y.3
  • 17
    • 17444386366 scopus 로고    scopus 로고
    • Connected k-coverage problem in sensor networks
    • Z. Zhou, S. Das, and H. Gupta, "Connected k-coverage problem in sensor networks," in Proc. ICCCN, 2004, pp. 373-378.
    • (2004) Proc. ICCCN , pp. 373-378
    • Zhou, Z.1    Das, S.2    Gupta, H.3
  • 18
    • 85045636699 scopus 로고    scopus 로고
    • Maintaining sensing coverage and connectivity in large sensor networks
    • H. H. Zhang and J. C. Hou, "Maintaining sensing coverage and connectivity in large sensor networks," Int. J. Wireless Ad Hoc Sensor Netw., vol. 1, no. 1/2, pp. 89-124, 2005.
    • (2005) Int. J. Wireless Ad Hoc Sensor Netw , vol.1 , Issue.1-2 , pp. 89-124
    • Zhang, H.H.1    Hou, J.C.2
  • 20
    • 33646231501 scopus 로고    scopus 로고
    • Random coverage with guaranteed connectivity: Joint scheduling for wireless sensor networks
    • Jun
    • C. Liu, K. Wu, Y. Xiao, and B. Sun, "Random coverage with guaranteed connectivity: Joint scheduling for wireless sensor networks," IEEE Trans. Parallel Distrib. Syst., vol. 17, no. 6, pp. 562-574, Jun. 2006.
    • (2006) IEEE Trans. Parallel Distrib. Syst , vol.17 , Issue.6 , pp. 562-574
    • Liu, C.1    Wu, K.2    Xiao, Y.3    Sun, B.4
  • 21
    • 32644446747 scopus 로고    scopus 로고
    • Energy-efficient coverage problems in wireless ad-hoc sensor networks
    • M. Cardei and J. Wu, "Energy-efficient coverage problems in wireless ad-hoc sensor networks," Comput. Commun., vol. 29, no. 4, pp. 413-420, 2005.
    • (2005) Comput. Commun , vol.29 , Issue.4 , pp. 413-420
    • Cardei, M.1    Wu, J.2
  • 22
    • 84962783556 scopus 로고    scopus 로고
    • How to achieve a connected ad hoc network with homogeneous range assignment: An analytical study with consideration of border effects
    • C. Bettstetter and J. Zangl, "How to achieve a connected ad hoc network with homogeneous range assignment: An analytical study with consideration of border effects," in Proc. 4th Int. Workshop Mobile Wireless Commun. Netw., 2002, pp. 125-129.
    • (2002) Proc. 4th Int. Workshop Mobile Wireless Commun. Netw , pp. 125-129
    • Bettstetter, C.1    Zangl, J.2
  • 23
    • 34047170846 scopus 로고    scopus 로고
    • A new geographical multipath protocol for ad hoc networks to reduce the route coupling phenomenon
    • V. Loscri and S. Marano, "A new geographical multipath protocol for ad hoc networks to reduce the route coupling phenomenon," in Proc. IEEE Int. VTC, 2006, pp. 1102-1106.
    • (2006) Proc. IEEE Int. VTC , pp. 1102-1106
    • Loscri, V.1    Marano, S.2
  • 24
    • 64049111716 scopus 로고    scopus 로고
    • Available
    • [Online]. Available: http://mathworld.wolfram.com/ Circle-CircleIntersection. html
  • 25
    • 0033471867 scopus 로고    scopus 로고
    • On k-connectivity for a geometric random graph
    • Sep
    • M. D. Penrose, "On k-connectivity for a geometric random graph," Random Struct. Algorithms, vol. 15, no. 2, pp. 145-164, Sep. 1999.
    • (1999) Random Struct. Algorithms , vol.15 , Issue.2 , pp. 145-164
    • Penrose, M.D.1


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