skip to main content
10.1145/2486159.2486171acmconferencesArticle/Chapter ViewAbstractPublication PagesspaaConference Proceedingsconference-collections
research-article

Expected sum and maximum of displacement of random sensors for coverage of a domain: extended abstract

Published: 23 July 2013 Publication History

Abstract

Assume that n sensors with identical range r = f(n)⁄2n, for some f(n) ≥ 1 for all n, are thrown randomly and independently with the uniform distribution in the unit interval [0, 1]. They are required to move to new positions so as to cover the entire unit interval in the sense that every point in the interval is within the range of a sensor. We obtain tradeoffs between the expected sum and maximum of displacements of the sensors and their range required to accomplish this task. In particular, when f(n) -- 1 the expected total displacement is shown to be Θ(√n). For senors with larger ranges we present two algorithms that prove the upper bound for the sum drops sharply as f(n) increases. The first of these holds for f(n) ≥ 6 and shows the total movement of the sensors is O(√ ln n/f(n)) while the second holds for 12 ≤ f(n) ≤ ln n -- 2 ln ln n and gives an upper bound of O(lnnf(n)ef(n)/2). Note that the second algorithm improves upon the first for f(n) > ln ln n -- ln ln ln n. Further we show a lower bound, for any 1 < f(n) < √n of Ω(εf(n)ε--(1+ε)f(n)), ε > 0.
For the case of the expected maximum displacement of a sensor when f(n) = 1 our bounds are Ω(n--1/2) and for any ε > 0, O(n--1/2+ε). For larger sensor ranges (up to (1 -- ε) ln n/n, ε > 0) the expected maximum displacement is shown to be Θ(ln n/n).
We also obtain similar sum and maximum displacement and range tradeoffs for area coverage for sensors thrown at random in a unit square. In this case, for the expected maximum displacement our bounds are tight and for the expected sum they are within a factor of √ln n. Finally, we investigate the related problem of the expected total and maximum displacement for perimeter coverage (whereby only the perimeter of the region need be covered) of a unit square. For example, when n sensors of radius > 2/n are thrown randomly and independently with the uniform distribution in the interior of a unit square, we can show the total expected displacement required to cover the perimeter is n/12 + o(n).

References

[1]
A. Abay. Extremes of interarrival times of a poisson process under conditioning. Applicationes Mathematicae, 23(1):73--82, 1995.
[2]
A. A. Abbasi, M. Younis, and K. Akkaya. Movement-assisted connectivity restoration in wireless sensor and actor networks. Parallel and Distributed Systems, IEEE Trans. on, 20(9):1366--1379, 2009.
[3]
B. C. Arnold, N. Balakrishnan, and H. N. Nagaraja. A first course in order statistics, volume 54. SIAM, 2008.
[4]
B. Bhattacharya, M. Burmester, Y. Hu, E. Kranakis, Q. Shi, and A. Wiese. Optimal movement of mobile sensors for barrier coverage of a planar region. TCS, 410(52):5515--5528, 2009.
[5]
J. A. Bondy and U. S. R. Murty. Graph theory with applications, volume 244. Springer, GTM, 2008.
[6]
D. Chen, Y. Gu, J. Li, and H. Wang. Algorithms on minimizing the maximum sensor movement for barrier coverage of a linear domain. Algorithm Theory - SWAT 2012, pages 177--188, 2012.
[7]
J. Czyzowicz, E. Kranakis, D. Krizanc, I. Lambadaris, L. Narayanan, J. Opatrny, L. Stacho, J. Urrutia, and M. Yazdani. On minimizing the maximum sensor movement for barrier coverage of a line segment. ADHONOW, pages 194--212, 2009.
[8]
J. Czyzowicz, E. Kranakis, D. Krizanc, I. Lambadaris, L. Narayanan, J. Opatrny, L. Stacho, J. Urrutia, and M. Yazdani. On minimizing the sum of sensor movements for barrier coverage of a line segment. ADHOCNOW, pages 29--42, 2010.
[9]
D. A. Darling. On a class of problems related to the random division of an interval. The Annals of Mathematical Statistics, pages 239--253, 1953.
[10]
W. J. Ewens and G. R. Grant. Statistical methods in bioinformatics: an introduction, volume 10. Springer, 2005.
[11]
W. Feller. An Introduction to Probability Theory and its Applications, volume 1. John Wiley, NY, 1968.
[12]
X. Han, X. Cao, E. L. Lloyd, and C. C. Shen. Fault-tolerant relay node placement in heterogeneous wireless sensor networks. In INFOCOM 2007, pages 1667--1675. IEEE, 2007.
[13]
J. Justicz, E. R. Scheinerman, and P. M. Winkler. Random intervals. American Mathematical Monthly, 97(10):881--889, 1990.
[14]
B. Kopochinski. The extreme gap in the multivariate poisson process. Zestos Mat., 21:137--141, 1991.
[15]
S. Kumar, T. H. Lai, and A. Arora. Barrier coverage with wireless sensors. In Proceedings of the 11th annual international conference on Mobile computing and networking, pages 284--298. ACM, 2005.
[16]
R. Motwani and P. Raghavan. Randomized algorithms. Cambridge University Press, 1995.
[17]
P. Ogren, E. Fiorelli, and N. E. Leonard. Cooperative control of mobile sensor networks: Adaptive gradient climbing in a distributed environment. Automatic Control, IEEE Trans. on, 49(8):1292--1302, 2004.
[18]
M. D. Penrose. The longest edge of the random minimal spanning tree. The annals of applied probability, 7(2):340--361, 1997.
[19]
R. Pyke. Spacings. J. of the Royal Statistical Society. Series B (Methodological), pages 395--449, 1965.
[20]
R. Pyke. Spacings revisited. In Proc. 6th Berkeley Symp. Math. Stat. Prob., volume 1, pages 417--427, 1972.
[21]
R. Pyke. The asymptotic behavior of spacings under Kakutani's model for interval subdivision. The Annals of Probability, 8(1):157--163, 1980.
[22]
A. Saipulla, C. Westphal, B. Liu, and J. Wang. Barrier coverage of line-based deployed wireless sensor networks. In INFOCOM, pages 127--135. IEEE, 2009.
[23]
E. R. Scheinerman. Random interval graphs. Combinatorica, 8(4):357--371, 1988.
[24]
M. Younis and K. Akkaya. Strategies and techniques for node placement in wireless sensor networks: A survey. Ad Hoc Networks, 6(4):621--655, 2008.

Cited By

View all
  • (2024)Mixed Strategy to Cover A Convex WSN2024 Asian Conference on Communication and Networks (ASIANComNet)10.1109/ASIANComNet63184.2024.10811022(1-6)Online publication date: 24-Oct-2024
  • (2021)Generalized moments of the distance between Poisson process eventsCommunications in Statistics - Theory and Methods10.1080/03610926.2021.196890151:8(2330-2342)Online publication date: 7-Oct-2021
  • (2020)On Binomial and Poisson Sums Arising from the Displacement of Randomly Placed SensorsTaiwanese Journal of Mathematics10.11650/tjm/20050324:6Online publication date: 1-Dec-2020
  • Show More Cited By

Index Terms

  1. Expected sum and maximum of displacement of random sensors for coverage of a domain: extended abstract

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    SPAA '13: Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
    July 2013
    348 pages
    ISBN:9781450315722
    DOI:10.1145/2486159
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 23 July 2013

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. barrier
    2. coverage
    3. displacement
    4. mobile
    5. random
    6. sensors

    Qualifiers

    • Research-article

    Conference

    SPAA '13

    Acceptance Rates

    SPAA '13 Paper Acceptance Rate 31 of 130 submissions, 24%;
    Overall Acceptance Rate 447 of 1,461 submissions, 31%

    Upcoming Conference

    SPAA '25
    37th ACM Symposium on Parallelism in Algorithms and Architectures
    July 28 - August 1, 2025
    Portland , OR , USA

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)1
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 05 Mar 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2024)Mixed Strategy to Cover A Convex WSN2024 Asian Conference on Communication and Networks (ASIANComNet)10.1109/ASIANComNet63184.2024.10811022(1-6)Online publication date: 24-Oct-2024
    • (2021)Generalized moments of the distance between Poisson process eventsCommunications in Statistics - Theory and Methods10.1080/03610926.2021.196890151:8(2330-2342)Online publication date: 7-Oct-2021
    • (2020)On Binomial and Poisson Sums Arising from the Displacement of Randomly Placed SensorsTaiwanese Journal of Mathematics10.11650/tjm/20050324:6Online publication date: 1-Dec-2020
    • (2019)Coverage Problem of sensor network in Continuous Region2019 International Conference on Ubiquitous and Emerging Concepts on Sensors and Transducers (UEMCOS)10.1109/UEMCOS46508.2019.9221510(1-8)Online publication date: Apr-2019
    • (2018)On the Maximum Movement of Random Sensors for Coverage and Interference on a LineProceedings of the 19th International Conference on Distributed Computing and Networking10.1145/3154273.3154330(1-10)Online publication date: 4-Jan-2018
    • (2018)Selection of Events under Fault Detection in Wireless Sensor Networks2018 International Conference on Sensor Networks and Signal Processing (SNSP)10.1109/SNSP.2018.00011(1-12)Online publication date: Oct-2018
    • (2018)Hypothesis testing and decision theoretic approach for fault detection in wireless sensor networksInternational Journal of Parallel, Emergent and Distributed Systems10.1080/17445760.2014.91051430:4(262-285)Online publication date: 17-Dec-2018
    • (2016)Sensor allocation problems on the real lineJournal of Applied Probability10.1017/jpr.2016.3353:3(667-687)Online publication date: 24-Oct-2016
    • (2016)On the displacement for covering a unit interval with randomly placed sensorsInformation Processing Letters10.1016/j.ipl.2016.06.004116:11(710-717)Online publication date: 1-Nov-2016
    • (2016)Optimization Problems in Infrastructure SecurityFoundations and Practice of Security10.1007/978-3-319-30303-1_1(3-13)Online publication date: 25-Feb-2016
    • Show More Cited By

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media