Loading [MathJax]/jax/output/SVG/jax.js
We use cookies to improve your experience with our site.

Indexed in:

SCIE, EI, Scopus, INSPEC, DBLP, CSCD, etc.

Submission System
(Author / Reviewer / Editor)
Advanced Search
Volume 21 Issue 4
July  2006
Turn off MathJax
Article Contents
Abstract
References
Liu-Sheng Huang, Hong-Li Xu, Yang Wang, Jun-Min Wu, Hong Li. Coverage and Exposure Paths in Wireless Sensor Networks[J]. Journal of Computer Science and Technology, 2006, 21(4): 490-495.
Citation: Liu-Sheng Huang, Hong-Li Xu, Yang Wang, Jun-Min Wu, Hong Li. Coverage and Exposure Paths in Wireless Sensor Networks[J]. Journal of Computer Science and Technology, 2006, 21(4): 490-495.
shu

Coverage and Exposure Paths in Wireless Sensor Networks

  • Department of Computer Science and Technology, University of Science \& Technology of China, Hefei230027, P.R. ChinaAnhui Province-Most Co-Key Laboratory of High Performance Computing and Its Application, Hefei 230027, P.R. China

More Information
  • Revised Date: May 14, 2006
  • Published Date: July 14, 2006
    Abstract
  • Wireless sensor networks have posed a number ofchallenging problems such as localization, deployment and tracking,etc. One of the interesting problems is the calculation of the coverageand exposure paths for the sensor networks. This paper presents a fullylocalized algorithm to solve the worst coverage problem firstintroduced by Meguerdichian et al. The nodes of the sensor networkcooperate to construct the worst coverage path only by the one-hopneighbor's information, thus avoiding the massive communication andconserving the energy. The correctness of the proposedalgorithm is proved formally under the sensing diminishing model. Moreover, thisalgorithm can be easily extended to solve the minimal exposure problemwith local information as well.
    • FullText(HTML)
    • References (12)
  • [1]
    Meguerdichain S, Koushanfar F, Potkonjak M -\it et al}. Coverage problems in wireless ad-hoc sensor networks. In -\it Proc. IEEE INFOCOM}, %20th Annual Joint Conference of IEEE Computer and Communications Societies} Alaska, Apr. 22--26, 2001, pp.1380--1387.
    [2]
    Li X Y, Wan P J, Frieder O. Coverage in wireless ad hoc sensor networks. -\it IEEE Trans. Computers}, Jun. 2003, 51(6): 753--763.
    [3]
    Meguerdichian S, Slijepcevic S, Karayan V -\it et al}. Localized algorithm in wireless ad hoc networks: Location discovery and sensor exposure. In -\it Proc. The 2nd ACM Int. Symp. Mobile Ad Hoc Networking and Computing (MobiHOC)}, Long Beach, CA, USA, Oct. 4--5, 2001, pp.106--116.
    [4]
    Meguerdichain S, Koushanfar F, Qu G -\it et al}. Exposure in wireless ad-hoc sensor network. In -\it Proc. The 7th Annual Int. Conf. Mobile Computing and Networking}, Jul. 16--21, 2001, Rome, Italy, pp.139--150.
    [5]
    Fortune S. Voronoi diagrams and Delaunay triangulations. Computing in Euclidean Geometry, F K Hwang, D Z Du (eds.), Singapore: World Scientific, 1992, pp.192--233.
    [6]
    Edesnrunner H. Algorithm in Combinatorial Geometry. Springer-Verlag, 1987.
    [7]
    Preparata F P, Shamos M I. Computational Geometry: An Introduction. Spring-Verlag, 1985.
    [8]
    Marengoni M, Draper B A, Hanson A -\it et al}. System to place observer on a polyhedral terrain in polynomial time. -\it Image and Vision Computing}, Dec. 1996, 18(6): 773--780.
    [9]
    Mehta D P, Lopez M A, Lin L. Optimal coverage paths in ad-hoc sensor networks. In -\it IEEE Int. Conf. Communications}, Anchroage, Alaska, May 11--15, 2003, pp.507--511.
    [10]
    Xu H L, Huang L S, Wan Y Y -\it et al}. Localized algorithm for coverage in wireless sensor networks. In -\it 6th Int. Conf. Parallel and Distributed Computing, Application and Technologies}, Dalian, China, Dec. 5--8, 2005, pp.750--754.
    [11]
    Veltri G, Huang Q, Qu G -\it et al}. Minimal and maximal exposure path algorithms for wireless embedded sensor networks. In -\it Proc. The 1st Int. Conf. Embedded Networked Sensor Systems (SenSys'03)}, Loc Angeles, USA. Nov. 5--7, 2003, pp.40--50.
    [12]
    Cormen T H, Leiserson C E, Rivest R L. Introduction to Algorithms. MIT Press and McGraw-Hill, 1990.
    • Relative Articles
  • Supplements (0)

Catalog

    Get Citation
    XML
    Article views (26) PDF downloads (1415) Cited by()
    Related

    Copyright ©2025 JCST, All Rights Reserved     京ICP备05002829号-1

    Institute of Computing Technology, Chinese Academy of Sciences
    P.O. Box 2704, Beijing 100190, P.R. China

    Tel.: 86-10-62610746 E-mail: jcst@ict.ac.cn

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return