Nothing Special   »   [go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

The dissemination distance of mobile opportunistic networks

  • Original Article
  • Published:
Personal and Ubiquitous Computing Aims and scope Submit manuscript

Abstract

Mobile opportunistic networks can realize self-organizing communications for complicated and dynamic scenarios, which makes them expected to support various applications. In this paper, we investigate how far the data can reach within time t (i.e., the dissemination distance), which reveals the tempo-spatial data dissemination properties of mobile opportunistic networks. Our investigations adopt the Brownian motion model and the Lévy mobility to characterize the movement patterns of nodes in the network. We select the Brownian motion model because it can be viewed as a limiting case of the random walk mobility model and the Markovian mobility model, and thus, our analytical results can be easily extended to these mobility models; We select the Lévy mobility since the movements of nodes are usually driven by human beings carrying the devices, and the Lévy mobility can closely mimic the walks of human beings, which makes our analysis more practical. In detail, we obtain the bounds of the distribution of the dissemination distance for the one-copy case and the multiple-copy case when nodes move with the Brownian motion and the Lévy mobility, respectively, which provide the potential of mobile opportunistic networks to support the services that may involve time and location sensitive data dissemination.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2

Similar content being viewed by others

Notes

  1. In the flooding delivery policy, \(\kappa =1\).

References

  1. Cheng X, Huang X, Li D, Wu W, Du D-Z (2003) A polynomial-time approximation scheme for minimum connected dominating set in ad hoc wireless networks. Networks 42(4):202–208

    Article  MathSciNet  MATH  Google Scholar 

  2. Cheng X, Du D-Z, Wang L, Xu B (2008) Relay sensor placement in wireless sensor networks. Wirel Netw 14(3):347–355

    Article  Google Scholar 

  3. Ding M, Chen D, Xing K, Cheng X (2005) Localized fault-tolerant event boundary detection in sensor networks. In: IEEE INFOCOM, vol 2, pp 902–913

  4. Boukerche A, Cheng X, Linus J (2003) Energy-aware data-centric routing in microsensor networks. In: ACM MSWiM 2003, pp 42–49

  5. Chen X, Proulx B, Gong X (2013) Social trust and social reciprocity based cooperative d2d communications. In: The ACM international symposium on mobile ad hoc networking and computing (MOBIHOC). ACM

  6. Wang S, Liu M, Cheng X, Li Z, Huang J, Chena B (2013) Opportunistic routing in intermittently connected mobile p2p networks. IEEE J Sel Areas Commun 31(9):369–378

    Article  Google Scholar 

  7. Wang S, Liu M, Cheng X, Song M (2012) Routing in pocket switched networks. IEEE Wirel Commun 19(2):67–73

    Article  Google Scholar 

  8. Liu G, Krishnamani J, Sunderraman R, Li Y (2013) Prediction-based routing with packet scheduling under temporal constraint in delay tolerant networkspan. In: submitted to IEEE IPCCC, 2013

  9. Jacquet P, Mans B, Rodolakis G (2010) Information propagation speed in mobile and delay tolerant networks. IEEE Trans Inf Theory 56(10):5001–5015

    Article  MathSciNet  Google Scholar 

  10. Jacquet P, Mans B, Mühlethaler P, Rodolakis G (2009) Opportunistic routing in wireless ad hoc networks: Upper bounds for the packet propagation speed. IEEE J Sel Areas Commun 27(7):1192–1202

    Article  Google Scholar 

  11. Kim Y, Lee K, Shroff NB, Rhee I (2013) Providing probabilistic guarantees on the time of information spread in opportunistic networks. In: The 32nd conference on computer communications (INFOCOM). IEEE

  12. Lee C-H, Eun DY (2013) On the forwarding performance under heterogeneous contact dynamics in mobile opportunistic networks. IEEE Trans Mob Comput 12(6):1107–1119

    Article  Google Scholar 

  13. Chaintreau A, Mtibaa A, Massoulie L, Diot C (2007) The diameter of opportunistic mobile networks. In: International conference on emerging networking experiments and technologies (CoNEXT). ACM

  14. Lee C-H, Kwak J, Eun DY (2013) Characterizing link connectivity for opportunistic mobile networking: does mobility suffice?. In: The 32nd conference on computer communications (INFOCOM). IEEE

  15. Lee K, Kim Y, Chong S, Rhee I, Yi Y (2011) Delay-capacity tradeoffs for mobile networks with lévy walks and lévy flight. In: The 30th conference on computer communications (INFOCOM). IEEE

  16. Wang S, Wang X, Cheng X, Huang J, Bie R (2014) The tempo-spatial information dissemination properties of mobile opportunistic networks with lévy mobility. In: The 34th international conference on distributed computing systems (ICDCS), Madrid, Spain

  17. Wang X, Wang S, Tian Z, Cheng X (2013) The potential of mobile opportunistic networks for information dissemination. In: IIKI 2013

  18. Port SC, Stone CJ (1978) Brownian motion and classical potential theory. Academic Press, Waltham

    MATH  Google Scholar 

  19. Barthélemy M, Barrat A, Pastor-Satorras R, Vespignani A (2004) Velocity and hierarchical spread of epidemic outbreaks in scale-free networks. Phys Rev Lett 92(17):178–701

    Article  Google Scholar 

  20. Seshadri V, West BJ (1982) Fractal dimensionality of lévy processes. Proc Natl Acad Sci USA 79(14):4501

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgments

This research is sponsored by National Natural Science Foundation of China (Nos. 61171014, 61272475, 61472044, 61472403, 61371185, 61401029, 11401016, 11401028) and the Fundamental Research Funds for the Central Universities (Nos. 2014KJJCB32, 2013NT57, 2012LYB46) and by SRF for ROCS, SEM.

Author information

Authors and Affiliations

  1. College of Applied Sciences, Beijing University of Technology, Beijing, China

    Xia Wang

  2. College of Information Science and Technology, Beijing Normal University, Beijing, China

    Shengling Wang, Wenshuang Liang & Rongfang Bie

  3. College of Information and Communication, Guilin University of Electronic Technology, Guilin, Guangxi, China

    Feng Zhao

Authors
  1. Xia Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shengling Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Wenshuang Liang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Rongfang Bie
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Feng Zhao
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Shengling Wang.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Wang, X., Wang, S., Liang, W. et al. The dissemination distance of mobile opportunistic networks. Pers Ubiquit Comput 19, 1011–1019 (2015). https://doi.org/10.1007/s00779-015-0884-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00779-015-0884-6

Keywords

Search

Navigation