[go: up one dir, main page]
Skip to main content
SpringerLink
Log in

Node connectivity analysis in cloud-assisted IoT environments

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

Internet of Things (IoT) have gained much attention recently. However, the transmission behavior of nodes in such a cloud-assisted IoT environment is not well studied. In this work, we mainly address the problem of node connectivity analysis based on percolation theory. First, we investigate when it is possible for two nodes to communicate with each other. Based on the results from bond percolation in a two-dimensional lattice, as long as the probability is close less than 0.5 and each sub-square contains at least four nodes, percolation occurs. Then, the conditions for full connectivity in a network graph are established. How two adjacent sub-squares are connected differentiates this work from others. The full connectivity occurs almost surely if each sub-square contains at least one node and the probability of having an open sub-edge is no less than 0.3822. The proposed conditions for percolation and full connectivity are validated by simulations.

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
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10

Similar content being viewed by others

Notes

  1. Hereafter, “almost surely” and “a.s.” will be used interchangeably.

  2. A path and a communicating path are used interchangeably in this work.

References

  1. Atzori L, Iera A, Morabito G (2010) The Internet of things: a survey. Elseiver Computer Netw 54(15):2787–2805

    Article  MATH  Google Scholar 

  2. Botta A, de Donato W, Persico V, Pescape A (2016) Integration of cloud computing and internet of things: a survey. Future Gener Computer Syst 56:684–700

    Article  Google Scholar 

  3. Kortuem G, Kawsar F, Fitton D, Sundramoorthy V (2010) Smart objects as building blocks for the internet of things. IEEE Internet Comput 14(1):44–51

    Article  Google Scholar 

  4. Xu LD, He W, Li S (2014) Internet of things in industries: a survey. IEEE Trans Ind Inf 10(4):2233–2243

    Article  Google Scholar 

  5. Miorandi D, Sicari S, Pellegrini FD, Chlamtac I (2012) Internet of things: vision, applications and research challenges. Ad Hoc Netw 10(7):1497–1516

    Article  Google Scholar 

  6. Diaz M, Martin C, Rubio B (2016) State-of-the-art, challenges, and open issues in the integration of internet of things and cloud computing. J Netw Computer Appl 67:99–117

    Article  Google Scholar 

  7. Abolfazli S, Sanaei Z, Ahmed E, Gani A, Rajkuma B (2014) Cloud-based augmentation for mobile devices: motivation, taxonomies, and open challenges. IEEE Commun Surv Tutor 16(1):337–368

    Article  Google Scholar 

  8. Fernando N, Loke S, Rahayu W (2013) Mobile cloud computing: a survey. Future Gener Computer Syst 29(1):84–106

    Article  Google Scholar 

  9. Hoang DT, Lee C, Niyato D, Wang P (2013) A survey of mobile cloud computing: architecture, applications, and approaches. Wirel Commun Mob Comput 13(18):1587–1611

    Article  Google Scholar 

  10. Khan A, Othman M, Madani S, Khan S (2014) A survey of mobile cloud computing application models. IEEE Commun Surv Tutor 16(1):393–413

    Article  Google Scholar 

  11. Merlino G, Arkoulis S, Distefano S, Papagianni C, Puliafito A, Papavassiliou S (2016) Mobile crowdsensing as a service: a platform for applications on top of sensing clouds. Future Gener Computer Syst 56:623–639

    Article  Google Scholar 

  12. Abdullah W, Yaakob N, Elobaid M, Warip M, Yah S (2016) Energy-efficient remote healthcare monitoring using IoT: a review of trends and challenges. In: Proceedings of the international conference on internet of things and cloud computing

  13. Ao WC, Cheng SM, Chen KC (2012) Connectivity of multiple cooperative cognitive radio ad hoc networks. IEEE J Sel Areas Commun 30(2):263–270

    Article  Google Scholar 

  14. Franceschetti M, Dousse O, Tse D, Thiran P (2007) Closing the gap in the capacity of wireless networks via percolation theory. IEEE Trans Inf Theory 53(3):1009–1018

    Article  MathSciNet  MATH  Google Scholar 

  15. Gilbert EN (1961) Random plane networks. Soc Ind Appl Math 9(4):533–543

    Article  MathSciNet  MATH  Google Scholar 

  16. Haenggi M, Andrews JG, Baccelli F, Dousse O, Franceschetti M (2009) Stochastic geometry and random graphs for the analysis and design of wireless networks. IEEE J Sel Areas Commun 27(7):1029–1046

    Article  Google Scholar 

  17. Kong Z, Yeh EM (2008) Connectivity and latency in large-scale wireless networks with unreliable links. In: Proceedings of IEEE INFOCOM 2008

  18. Meester R, Roy R (1996) Continuum percolation. Cambridge University Press, Cambridge

    Book  MATH  Google Scholar 

  19. Khanjary M, Sabaei M, Meybodi M (2014) Critical density for coverage and connectivity in two-dimensional aligned-orientation directional sensor networks using continuum percolation. IEEE Sensors J 14(8):2856–2863

    Article  Google Scholar 

  20. Liu L, Zhang X, Ma H (2013) Percolation theory-based exposure-path prevention for wireless sensor networks coverage in internet of things. IEEE Sensors J 13(10):3625–3636

    Article  Google Scholar 

  21. Wang P, Akyildiz IF, Al-Dhelaan AM (2011) Percolation theory based connectivity and latency analysis of cognitive radio ad hoc networks. Wirel Netw 17(3):659–669

    Article  Google Scholar 

  22. Dousse O, Thiran P, Hasler M (2002) Connectivity in ad-hoc and hybrid networks. In: Proceedings of IEEE INFOCOM 2002

  23. Dousse O, Thiran P, Hasler M (2005) Impact of interferences on connectivity in ad hoc networks. IEEE/ACM Trans Netw 13(2):425–436

    Article  Google Scholar 

  24. Dousse O, Baccelli F, Thiran P (2006) Percolation in the signal to interference ratio graph. J Appl Probab 43(2):552–562

    Article  MathSciNet  MATH  Google Scholar 

  25. Grimmett G (1999) Percolation. Wiley, New York

    Book  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical Engineering, Graduate Institute of Communication Engineering, National Chung Hsing University, 250, Kuo-Kuang Road, South District, Taichung, Taiwan

    Min-Kuan Chang & Hsiao-Ping Tsai

  2. Department of Computer Science and Information Management, College of Computing and Informatics, Providence University, 200, Sec. 7, Taiwan Boulevard, Shalu Dist., Taichung, Taiwan

    Yu-Wei Chan

  3. Department of Electrical Engineering, National Chung Hsing University, Taiwan, 250, Kuo-Kuang Road, South District, Taichung, Taiwan

    Ting-Chen Chen & Min-Han Chuang

Authors
  1. Min-Kuan Chang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yu-Wei Chan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hsiao-Ping Tsai
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Ting-Chen Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Min-Han Chuang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yu-Wei Chan.

Appendix

Appendix

1.1 Derivations of (1)

  1. 1.

    For each vertex in the corner, the probability of having its two un-directional links facing toward the isolated island is equal to \(\frac{1}{C^4_2}=1/6\). There are \(m_1\) vertexes in the corner.

  2. 2.

    For a vertex in the perimeter of the isolated island other than the vertexes in the corner, the probability of having its two un-directional links facing toward the isolated island is upper bounded by to \(\frac{C^3_1}{C^4_2}=1/2\). There are \(m-m_1\) such vertexes.

  3. 3.

    For a vertex right adjacent to the vertexes in the perimeter of the isolated island, the probability of not having its two un-directional links facing toward the isolated island is upper bounded by \(\frac{C^3_1}{C^4_2}=1/2\). There are \(m+m_1\) such vertexes surrounding this island.

Therefore, the probability of having such an isolated island is bounded by (1).

1.2 Derivations of (2)

The upper bound given in (2) is derived when all the vertexes in the perimeter of an isolated island and all the vertexes surrounding this isolated island are those sub-square having only one un-directional link connecting one of its four adjacent sub-squares. In this case,

  1. 1.

    For each vertex in the corner, the probability of having its only one un-directional link facing toward the isolated island is equal to \(\frac{C^2_1}{C^4_3}=1/2\). There are \(m_1\) vertexes in the corner.

  2. 2.

    For a vertex in the perimeter of the isolated island other than the vertexes in the corner, the probability of having its only one un-directional link facing toward the isolated island is upper bounded by to \(\frac{C^3_1}{C^4_3}=3/4\). There are \(m-m_1\) such vertexes.

  3. 3.

    For a vertex right adjacent to the vertexes in the perimeter of the isolated island, the probability of not having its only one un-directional links facing toward the isolated island is upper bounded by \(\frac{C^3_1}{C^4_3}=3/4\). There are \(m+m_1\) such vertexes surrounding this island.

Also, the probability of having all these \(2(m-m_1)+m_1+2m+1=2m+m_1\) are those sub-square with only one un-directional link is \((1/2)^{2m+m_1}\). Based on these discussion, the probability of having an isolated island in this scenario is upper bounded by (2).

1.3 Derivations of (3)

The upper bound given in (3) is derived when all the vertexes in the isolated line and all the vertexes surrounding this isolated line are those sub-square having only one un-directional link connecting one of its four adjacent sub-squares. In this case,

  1. 1.

    For each vertex of two vertexes in the end of this isolated line, the probability of having its only one un-directional link facing toward the isolated line is equal to \(\frac{1}{C^4_3}=1/4\). There are \(m_1\) vertexes in the corner.

  2. 2.

    For each vertex other than two vertexes in the end of the isolated line, the probability of having its only one un-directional link facing toward the isolated line is upper bounded by to \(\frac{C^2_1}{C^4_3}=1/2\). There are \(m-2\) such vertexes.

  3. 3.

    For a vertex right adjacent to the vertexes in the perimeter of the isolated island, the probability of not having its only one un-directional links facing toward the isolated island is upper bounded by \(\frac{C^3_1}{C^4_3}=3/4\). There are \(2(m-2)+2\times 3=2m+2\) such vertexes surrounding this line.

Also, the probability of having all these \(m+2\times (m-2) + 6=3m+2\) are those sub-square with only one un-directional link is \((1/2)^{3m+2}\). Based on these discussion, the probability of having an isolated line in this scenario is upper-bounded by (3).

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Chang, MK., Chan, YW., Tsai, HP. et al. Node connectivity analysis in cloud-assisted IoT environments. J Supercomput 73, 2966–2986 (2017). https://doi.org/10.1007/s11227-016-1771-2

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-016-1771-2

Keywords

Search

Navigation