Smallest Number of Sensors for k-Covering

Tatiana Tabirca, Laurence T. Yang, Sabin Tabirca

Abstract


This paper presents some theoretical results on the smaller number Nk(a, b) of sensors to achieve k coverage for the rectangular area [0, a] × [0, b]. The first properties show the numbers Nk(a, b) are sub-additive and increasing on each variable. Based on these results, some lower and upper bounds for Nk(a, b) are introduced. The main result of the article proves that the minimal density of sensors to achieve k-coverage is (k) ≤ k/2 improving a previous result of Ammari and Das [2]. Finally, the numbers N1(a, b) are tabled for some small values of a, b.

Keywords


WSN Networks, Coverage, Range.

Full Text:

PDF

References


Adlakha, S., Srivastava M., Critical Density Threshold for Coverage in Wireless Sensor Networks, Proc. 2003 IEEE WCNC, 1615-1629, 2003.

Ammari, H.M., Das, S.K, Clustering-Based Minimum Energy Wireless m-Connected k- Covered Sensor Networks, Proc. of 2008 EWSN Sensor, LNCS 4913, 1-6, 2008.

Huang, C.F., Tseng, Y.C. The coverage problem in a wireless sensor network, Proc.of the 2nd ACM Int. Conf. WSNA, 115-121, 2003.

Kershner, R. The Number of Circles Covering a Set, American J. of Math., 61: 665-671, 1939.
http://dx.doi.org/10.2307/2371320

Fowler, R.J., Paterson, M.S., Tanimoto, S.L., Optimal Packing and Covering in the Plane are NP-Complete, Information Processing Letters, 12: 133-137, 1981.
http://dx.doi.org/10.1016/0020-0190(81)90111-3

Melisen, J.B.M., Shuur, P.C., Covering a Rectangle with 6 and 7 Circles, Discrete Applied Mathematics, 99: 146-156, 2000.

Milenkivic, V.J., Translational Polygon Containment and Minimal Enclosure Using Linear Programming Based Restriction, Proc. of the ACM Symposium on Theory of Computing, 109-118, 1996.

Nurmela, K.J., Ostergard, P.R.J., Covering a Square with up to 36 Equal Circles, Research Report HUT-TCS-A64, Laboratory of Theoretical Computer Science, Helsinky University of Technology, 2000.

Tarnai, T., Gasper, Z., Covering a Square by Equal Circles, Elementary Math., 167-170, 1995.

Verblunsky, S., On the Least Number of Unit Circles Which Can Cover a Square, Journal of London Math Society, 24: 164-170, 1949.
http://dx.doi.org/10.1112/jlms/s1-24.3.164




DOI: https://doi.org/10.15837/ijccc.2013.2.311



Copyright (c) 2017 Tatiana Tabirca, Laurence T. Yang, Sabin Tabirca

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.

CC-BY-NC  License for Website User

Articles published in IJCCC user license are protected by copyright.

Users can access, download, copy, translate the IJCCC articles for non-commercial purposes provided that users, but cannot redistribute, display or adapt:

  • Cite the article using an appropriate bibliographic citation: author(s), article title, journal, volume, issue, page numbers, year of publication, DOI, and the link to the definitive published version on IJCCC website;
  • Maintain the integrity of the IJCCC article;
  • Retain the copyright notices and links to these terms and conditions so it is clear to other users what can and what cannot be done with the  article;
  • Ensure that, for any content in the IJCCC article that is identified as belonging to a third party, any re-use complies with the copyright policies of that third party;
  • Any translations must prominently display the statement: "This is an unofficial translation of an article that appeared in IJCCC. Agora University  has not endorsed this translation."

This is a non commercial license where the use of published articles for commercial purposes is forbiden. 

Commercial purposes include: 

  • Copying or downloading IJCCC articles, or linking to such postings, for further redistribution, sale or licensing, for a fee;
  • Copying, downloading or posting by a site or service that incorporates advertising with such content;
  • The inclusion or incorporation of article content in other works or services (other than normal quotations with an appropriate citation) that is then available for sale or licensing, for a fee;
  • Use of IJCCC articles or article content (other than normal quotations with appropriate citation) by for-profit organizations for promotional purposes, whether for a fee or otherwise;
  • Use for the purposes of monetary reward by means of sale, resale, license, loan, transfer or other form of commercial exploitation;

    The licensor cannot revoke these freedoms as long as you follow the license terms.

[End of CC-BY-NC  License for Website User]


INTERNATIONAL JOURNAL OF COMPUTERS COMMUNICATIONS & CONTROL (IJCCC), With Emphasis on the Integration of Three Technologies (C & C & C),  ISSN 1841-9836.

IJCCC was founded in 2006,  at Agora University, by  Ioan DZITAC (Editor-in-Chief),  Florin Gheorghe FILIP (Editor-in-Chief), and  Misu-Jan MANOLESCU (Managing Editor).

Ethics: This journal is a member of, and subscribes to the principles of, the Committee on Publication Ethics (COPE).

Ioan  DZITAC (Editor-in-Chief) at COPE European Seminar, Bruxelles, 2015:

IJCCC is covered/indexed/abstracted in Science Citation Index Expanded (since vol.1(S),  2006); JCR2018: IF=1.585..

IJCCC is indexed in Scopus from 2008 (CiteScore2018 = 1.56):

Nomination by Elsevier for Journal Excellence Award Romania 2015 (SNIP2014 = 1.029): Elsevier/ Scopus

IJCCC was nominated by Elsevier for Journal Excellence Award - "Scopus Awards Romania 2015" (SNIP2014 = 1.029).

IJCCC is in Top 3 of 157 Romanian journals indexed by Scopus (in all fields) and No.1 in Computer Science field by Elsevier/ Scopus.

 

 Impact Factor in JCR2018 (Clarivate Analytics/SCI Expanded/ISI Web of Science): IF=1.585 (Q3). Scopus: CiteScore2018=1.56 (Q2);

SCImago Journal & Country Rank

Editors-in-Chief: Ioan DZITAC & Florin Gheorghe FILIP.