Skip to main content
SpringerLink
Log in

Connectivity in finite ad-hoc networks

  • Published:
Science in China Series F: Information Sciences Aims and scope Submit manuscript

Abstract

Research on ad-hoc network connectivity has mainly focused on asymptotic results in the number of nodes in the network. For a one-dimensional ad-hoc network G 1, assuming all the nodes are independently uniform distributed in a closed interval [0, Z](z ∈ ℝ+), we derive a generic formula for the probability that the network is connected. The finite connected ad-hoc networks is analyzed. And we separately suggest necessary conditions to make the ad-hoc network to be connected in one and two dimensional cases, facing possible failed nodes (f-nodes). Based on the necessary condition and unit-disk assumption for the node transmission, we prove that the nodes of the connected two-dimensional ad-hoc networks (G 2) can be divided into at most five different groups. For an f-node n 0 in either of the five groups, we derive a close formula for the probability that there is at least one route between a pair of nodes in G 2 − {n 0}.

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

Similar content being viewed by others

References

  1. Philips T K, Pandwar S S, Tantawi A N. Connectivity properties of a packet radio network model, IEEE Trans Inf Theory, 1989, 35: 1044–1047

    Article  Google Scholar 

  2. Cheng Y C, Robertazzi T G. Critical connectivity phenomena in multihop radio models. IEEE Trans Commu, 1989, 37: 770–777

    Article  Google Scholar 

  3. Xue F, Kumar P R. The number of neighbors needed for connectivity of wireless networks. Wireless Networks, 2004, 10: 169–181

    Article  Google Scholar 

  4. Gupta P, Kumar P R. Critical power for asymptotic connectivity in wireless networks. In: McEneaney W M, Yin G, Zhang Q, eds. Stochastic Analysis, Control, Optimization and Applications: A Volume in Honor of W.H. Fleming. Birkhauser, 1998. 547–566

  5. Dousse O, Thiran P, Hasler M. Connectivity in ad-hoc and hybrid networks. IEEE INFOCOM, 2002, 2: 1079–1088

    Google Scholar 

  6. Dousse O, Baccelli F, Thiran P. Impact of interferences on connectivity in ad hoc networks. IEEE Trans Network, 2005, 13: 425–436

    Article  Google Scholar 

  7. Booth L, Bruck J, Franceschetti M, et al. Covering algorithms, continuum percolation and the geometry of wireless networks. Annal Appl Probabil, 2003, 13: 722–741

    Article  MATH  MathSciNet  Google Scholar 

  8. Santi P, Blough DM. The critical transmitting range for connectivity in sparse wireless ad hoc networks. IEEE Trans Mobile Comput, 2003, 2: 25–39

    Article  Google Scholar 

  9. Hekmat R, Mieghem P V. Degree distribution and hopcount in wireless ad-hoc networks. In: IEEE ICON’03, Sydney, Australia, 2003. 603–609

  10. Santi P, Blough D M, Vainstein F. A probabilistic analysis for the range assignment problem in ad hoc networks. ACM MobiHoc’02. Long Beach, 2001. 212–220

  11. Santi P. The critical transmitting range for connectivity in mobile ad hoc networks. IEEE Trans Mobile Comput, 2005, 4: 310–317

    Article  Google Scholar 

  12. Ferrari G, Tonguz O K. Minimum number of neighbors for fully connected uniform ad hoc wireless networks. IEEE ICC, Paris, France, 2004, 7: 4331–4335

    Google Scholar 

  13. Wei X H, Chen G L, Wan Y Y, et al. Longest lifetime path in mobile ad hoc networks. J Software, 2006, l(17): 498–508

    Article  Google Scholar 

  14. Desai M, Manjunath D. On the connectivity in finite ad hoc networks. IEEE Commun Lett, 2002, 6: 437–439

    Article  Google Scholar 

  15. Gore A D. On the connectivity in finite ad hoc networks. IEEE Commun Lett, 2006, 10: 88–90

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Statistics, Shanghai Lixin University of Commerce, Shanghai, 201620, China

    HanXing Wang

  2. Department of Mathematics, Shanghai University, Shanghai, 200444, China

    GuiLin Lu

  3. Department of Computer Science, City University of Hong Kong, Hong Kong, China

    WeiJia Jia

  4. School of Science at Rensselaer Polytechnic Institute, Rensselaer, USA

    Wei Zhao

Authors
  1. HanXing Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. GuiLin Lu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. WeiJia Jia
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Wei Zhao
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to HanXing Wang.

Additional information

Supported partially by the National Natural Science Foundation of China (Grant No. 60572066), the Key Scientific Research Project of Shanghai Municipal Education Commission (Grant No. 06ZZ84), and the City U, Hong Kong, Applied R & D Funding (ARD) (Grant No. 9668009)

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wang, H., Lu, G., Jia, W. et al. Connectivity in finite ad-hoc networks. Sci. China Ser. F-Inf. Sci. 51, 417–424 (2008). https://doi.org/10.1007/s11432-008-0011-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11432-008-0011-7

Keywords

Search

Navigation