Skip to main content
SpringerLink
Log in

Proactive data dissemination to mission sites

  • Published:
Wireless Networks Aims and scope Submit manuscript

Abstract

In many situations and domains it is important to deliver information to personnel as they work in the field. We consider a specialized content distribution application in wireless mesh networks. When a new mission arrives—for example, when a fire alarm sounds—data is pushed to storage nodes at the mission site where it may be retrieved locally by responding personnel (e.g., police, firefighters, paramedics, government officials, and the media). It is important that information is available at low latency, when requested or pulled by the personnel. The total latency experienced will be a combination of the push delay (if the personnel arrive at the mission site before all the data can be pushed), and the pull delay. Each delay component will in turn be a function of (1) the hop distance traveled by the data when pushed or pulled and (2) any congestion on the links. In this paper, we define algorithms and protocols that trade-off the push and pull latencies depending on the type of application. Our goal is to choose a storage node assignment minimizing the total latency-based cost. We start with a simple model in which cost is a function of distance, and then extend the model, explicitly taking congestion into account. Since the problem is NP-hard even to approximate, our focus is on developing efficient algorithms and distributed protocols that can be easily deployed in wireless mesh networks. In NS2 simulations, we find that our heuristic algorithms achieve, on average, a cost within at most 15% of the optimum.

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
Fig. 9

Similar content being viewed by others

References

  1. Alzoubi, H. A., Lee, S., & Rabinovich, M., Spatscheck, O., van der Merwe, J. E. (2008). Anycast CDNS revisited. In: Proceedings of WWW 2008.

  2. Baev, I., Rajaraman, R., & Swamy, C. (2008). Approximation algorithms for data placement problems. SIAM Journal on Computing, 38(4), 1411–1429.

    Article  MathSciNet  MATH  Google Scholar 

  3. Bateni, M. H., & Hajiaghayi, M. (2009). Assignment problem in content distribution networks: Unsplittable hard-capacitated facility location. In: Proceedings of SODA 09.

  4. Bose, P., Morin, P., Stojmenović, I., & Urrutia, J. (2001). Routing with guaranteed delivery in Ad Hoc wireless networks. Wireless Networks, 7(6), 609–616.

    Article  MATH  Google Scholar 

  5. Cohen, R., Katzir, L., & Raz, D. (2006). An efficient approximation for the generalized assignment problem. Information Processing Letters, 100(4), 162–166.

    Article  MathSciNet  MATH  Google Scholar 

  6. De, S., Caruso, A., Chaira, T., & Chessa, S. (2006). Bounds on hop distance in greedy routing approach in wireless Ad Hoc networks. International Journal of Wireless and Mobile Computing, 1(2), 131–140.

    Article  Google Scholar 

  7. Deering, S., & Cheriton, D. (1990). Multicast routing in datagram internetworks and extended LANs. ACM Transactions on Computer Systems, 8(2), 85–110.

    Article  Google Scholar 

  8. Fleischer, L., Goemans, M. X., Mirrokni, V. S., & Sviridenko, M. (2006). Tight approximation algorithms for maximum general assignment problems. In: Proceedings of SODA (pp. 611–620).

  9. Goel, A., & Munagala, K. (2002). Extending greedy multicast routing to delay sensitive applications. Algorithmica, 33(3), 335–352.

    Article  MathSciNet  MATH  Google Scholar 

  10. Goel, A., Ramakrishnan, K., Kataria, D., & Logothetis, D. (2001). Efficient computation of delay-sensitive routes from one source to all destinations. In: INFOCOM.

  11. Guha, S., & Munagala, K. (2002). Improved algorithms for the data placement problem. In: Proceedings of SODA (pp. 106–107).

  12. Hosseini, M., Ahmed, D., Shirmohammadi, S., & Georganas, N. (2007). A survey of application-layer multicast protocols. IEEE Communications Surveys & Tutorials, 9(3), 58–74.

    Article  Google Scholar 

  13. Intanagonwiwat, C., Govindan, R., Estrin, D., Heidemann, J., & Silva, F. (2003). Directed diffusion for wireless sensor networking. Networking. IEEE/ACM Transactions on, 11(1), 2–16.

    Article  Google Scholar 

  14. Karp, B., & Kung, H. (2000). GPSR: greedy perimeter stateless routing for wireless networks. In: Proceedings of ACM/IEEE MOBICOM, pp. 243–254.

  15. Krishnamurthy, B., Wills, C., & Zhang, Y. (2001). On the use and performance of content distribution networks. Proceedings of the 1st ACM SIGCOMM workshop on internet measurement (pp. 169–182).

  16. Lehmann, B., Lehmann, D. J., & Nisan, N. (2001). Combinatorial auctions with decreasing marginal utilities. In: Proceedings of ACM Conference on Electronic Commerce (pp. 18–28).

  17. Lenstra, J. K., Shmoys, D. B., & va Tardos (1990). Approximation algorithms for scheduling unrelated parallel machines. Mathematical Programming, 46.

  18. Meyerson, A., Munagala, K., & Plotkin, S.A. (2001). Web caching using access statistics. In: Proceedings of SODA (pp. 354–363).

  19. Qiu, L., Padmanabhan, V., & Voelker, G. (2001). On the placement of web server replicas. In: IEEE INFOCOM 2001 Proceedings (Vol. 3).

  20. Ratnasamy, S., Karp, B., Shenker, S., Estrin, D., Govindan, R., Yin, L., et al. (2003). Data-centric storage in sensornets with ght, a geographic hash table. Mobile networks and applications, 8(4), 427–442.

    Article  Google Scholar 

  21. Rodolakis, G., Siachalou, S., & Georgiadis, L. (2006). Replicated server placement with QoS constraints. IEEE Transactions on Parallel and Distributed Systems, 1151–1162.

  22. Ross, G. T., & Soland, R. M. (1975). A branch and bound algorithm for the generalized assignment problem. Mathematical Programming, 8–1.

  23. Shmoys, D. B., & va Tardos (1993). An approximation algorithm for the generalized assignment problem. Mathematical Programming, 62.

  24. Tang, X., & Xu, J. (2005). QoS-aware replica placement for content distribution. IEEE Transactions on Parallel and Distributed Systems, 16(10), 921–932.

    Article  Google Scholar 

  25. Wang, H., Liu, P., & Wu, J. (2006). A QoS-aware heuristic algorithm for replica placement. In: 7th IEEE/ACM international conference on grid computing.

Download references

Acknowledgments

This research was sponsored by US Army Research laboratory and the UK Ministry of Defence and was accomplished under Agreement Number W911NF-06-3-0001. 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 US Army Research Laboratory, the US Government, the UK Ministry of Defence, or the UK Government. The US and UK Governments are authorized to reproduce and distribute reprints for Government purposes notwithstanding any copyright notation hereon.

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, The Pennsylvania State University, University Park, PA, USA

    Fangfei Chen & Thomas F. La Porta

  2. Department of Computer Science, The City University of New York, New York, NY, USA

    Amotz Bar-Noy

  3. Computer Science Department, University of Southern California, Los Angeles, CA, USA

    Matthew P. Johnson

Authors
  1. Fangfei Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Matthew P. Johnson
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Amotz Bar-Noy
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Thomas F. La Porta
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Fangfei Chen.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chen, F., Johnson, M.P., Bar-Noy, A. et al. Proactive data dissemination to mission sites. Wireless Netw 18, 749–762 (2012). https://doi.org/10.1007/s11276-012-0430-7

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11276-012-0430-7

Keywords

Search

Navigation