Skip to main content
SpringerLink
Log in

Sensor Network Topology Design and Analysis for Efficient Data Gathering by a Mobile Mule

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

In this paper, we study the problem of data gathering in ad-hoc sensor networks using a mobile entity called mule. The mule traverses the children of failed sensors, to prevent loss of data. Our objective is to define the optimal communication tree, and the mule’s placement such that the mule’s overall traveling distance is minimized. We explore this problem in several network topologies including: unit disc graph on a line (UDL), general unit disc graph (UDG), and a complete graph with failing probabilities on the nodes (CGFP). We provide an optimal solution for the UDL problem and three approximation algorithms for the UDG problem. For the CGFP problem we outline the two possible structures of an optimal solution and provide near optimal approximation algorithms.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Similar content being viewed by others

References

  1. Alzoubi, K.M., Wan, P.-J., Frieder, O.: Message-optimal connected dominating sets in mobile ad hoc networks. In: Proceedings of the 3rd ACM International Symposium on Mobile Ad hoc Networking and Computing, pp. 157–164 (2002)

  2. Anand, S., Zusseman, G., Modiano, E.: Construction and maintenance of wireless mobile backbone networks. IEEE/ACM Trans. Netw. 17(1), 239–252 (2009)

    Article  Google Scholar 

  3. Bose, P., Maheshwari, A., Morin, P.: Fast approximations for sums of distances clustering and the Fermat-Weber problem. Comput. Geom. 24(3), 135–146 (2003)

    Article  MathSciNet  Google Scholar 

  4. Citovsky, G., Gao, J., Mitchell, J.S., Zeng, J.: Exact and approximation algorithms for data mule scheduling in a sensor network. In: International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, pp. 57–70. Springer, Berlin (2015)

  5. Clark, B.N., Colbourn, C.J., Johnson, D.S.: Unit disk graphs. Ann. Discrete Math. 48, 165–177 (1991)

    Article  Google Scholar 

  6. Crowcroft, J., Levin, L., Segal, M.: Using data mules for sensor network data recovery. Ad Hoc Netw. 40, 26–36 (2016)

    Article  Google Scholar 

  7. Du, Y.L., Du, H.W.: A new bound on maximum independent set and minimum connected dominating set in unit disk graphs. J. Comb. Optim. 30(4), 1173–1179 (2015)

    Article  MathSciNet  Google Scholar 

  8. Durocher, S., Jampani, K.R., Lubiw, A., Narayanan, L.: Modelling gateway placement in wireless networks: geometric k-centres of unit disc graphs. In: Proceedings of the Fifth International Workshop on Foundations of Mobile Computing, pp. 79–86 (2008)

  9. Fodor, F.: The densest packing of 19 congruent circles in a circle. Geom. Dedic. 74(2), 139–145 (1999)

    Article  MathSciNet  Google Scholar 

  10. Francesco, M.D., Das, S.K., Giuseppe, A.: Data collection in wireless sensor networks with mobile elements: a survey. ACM Trans. Sens. Netw. (TOSN) 8(1), 7–38 (2011)

    Google Scholar 

  11. Kim, D., Abay, B.H., Uma, R., Wu, W., Wang, W., Tokuta, A.O.: Minimizing data collection latency in wireless sensor network with multiple mobile elements. In: INFOCOM, Proceedings IEEE, pp. 504–512. IEEE (2012)

  12. Levin, L., Efrat, A., Segal, M.: Collecting data in ad-hoc networks with reduced uncertainty. Ad Hoc Netw. 17, 71–81 (2014)

    Article  Google Scholar 

  13. Lichtenstein, D.: Planar formulae and their uses. SIAM J. Comput. 11(2), 329–343 (1982)

    Article  MathSciNet  Google Scholar 

  14. Rao, S.B., Smith, W.D.: Approximating geometrical graphs via “spanners” and “banyans” In: Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, pp. 540–550. ACM (1998)

  15. Rui, T., Li, H., Miura, R.: Dynamic recovery of wireless multi-hop infrastructure with the autonomous mobile base station. IEEE Access 4, 627–638 (2016)

    Article  Google Scholar 

  16. Shang, W., Yao, F., Wan, P., Hu, X.: On minimum m-connected k-dominating set problem in unit disc graphs. J. Comb. Optim. 16(2), 99–106 (2008)

    Article  MathSciNet  Google Scholar 

  17. Somasundara, A.A., Ramamoorthy, A., Srivastava, M.B.: Mobile element scheduling for efficient data collection in wireless sensor networks with dynamic deadlines. In: IEEE Real-Time Systems Symposium (2004)

  18. Tekdas, O., Isler, V., Lim, J.H., Terzis, A.: Using mobile robots to harvest data from sensor fields. IEEE Wirel. Commun. 16(1), 22 (2009)

    Article  Google Scholar 

Download references

Acknowledgements

The research was been supported by the following sources: (1) Israel Science Foundation (Grant No. 317/15). (2) IBM Corporation. (3) The Israeli Ministry of Economy and Industry. (4) The US Army Research Office under Grant No. W911NF-18-1-0399. The views and conclusions contained in this document are those of the authors and should not be interpreted as representing the official policies, either expressed or implied, of the Army Research Office or the U.S. Government. The U.S. Government is authorized to reproduce and distribute reprints for Government purposes notwithstanding any copyright notation herein.

Author information

Authors and Affiliations

  1. Ben-Gurion University of the Negev, Beer-Sheva, Israel

    Stav Ashur, Paz Carmi, Matthew J. Katz & Michael Segal

  2. National Institute of Science Education and Research, HBNI, Bhubaneswar, India

    Aritra Banik

  3. The University of Texas, Austin, USA

    Harel Yedidsion

Authors
  1. Harel Yedidsion
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Stav Ashur
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Aritra Banik
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Paz Carmi
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Matthew J. Katz
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Michael Segal
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Harel Yedidsion.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Yedidsion, H., Ashur, S., Banik, A. et al. Sensor Network Topology Design and Analysis for Efficient Data Gathering by a Mobile Mule. Algorithmica 82, 2784–2808 (2020). https://doi.org/10.1007/s00453-020-00704-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00453-020-00704-8

Search

Navigation