Dynamic Connectivity Analysis of ABF-based Ad-hoc Networks

  • Fei Liu
  • Geert Heijenk
Part of the IFIP International Federation for Information Processing book series (IFIPAICT, volume 284)

This paper evaluates the performance of a context discovery protocol using attenuated Bloom filters while nodes appear, disappear, and are temporary unreachable in ad-hoc networks through analytical analysis. Further we verified obtained results with simulation analysis. The analytical results are most accurate when node density is high. Further, we discover that adding a node generates less traffic than removing a node in our protocol. Some proposals are given to reduce the traffic generated by propagating updates due to removing a node.


Packet Loss Hash Function Mobile Networking Node Degree Communication Range 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    T. Albero, V. Sempere, J. Mataix, “A Study of Mobility and Research in Ad Hoc Networks Using Stochastic Activity Networks”, in Proc. of the 2 nd Conference on Next Generation Internet Design and Engineering, 2006, NGI '06, Valencia, Spain, April 2006.Google Scholar
  2. 2.
    C. Bettstetter, “On the Minimum node Degree and Connectivity of a Wireless Multihop Networks”, in Proc. of the 3 rd ACM International Symposium on Mobile Ad Hoc Networking and Computing, MOBIHOC’02, EPF Lausanne, Switzerland, June 2002.Google Scholar
  3. 3.
    B. H. Bloom, “Space/Time Trade-offs in Hash Coding with Allowable Errors”, Communications of the ACM 13(7): 422-426.Google Scholar
  4. 4.
    B. Clark, C. Colbourn, D. Johnson, “Unit Disk Graphs”, Discrete Metematics, vol. 86, no. 1-3, pp. 165-177, December 1990.MATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    P.T.H. Goering, G.J. Heijenk, B. Haverkort, R. Haarman, “Effect of Mobility on Local Service Discovery in Ad-Hoc”, in Proc. of Performance Engineering Workshop, 2007, Berlin, Germany, September, 2007.Google Scholar
  6. 6.
    R. Hekmat, P. Van Mieghem, “Degree Distribution and Hopcount in Wireless Ad-hoc Networks”, in Proc. of the 11 th IEEE ICON2003, Sydney, Austrilia, September 2003.Google Scholar
  7. 7.
    V. Lenders, J. Wagner, M. May, “Analyzing the impact of mobility in Ad Hoc Networks”, in Proc. of the 2nd international workshop on Multi-hop ad hoc networks: from theory to reality 2006, REALMAN2006, Florence, Italy, May, 2006.Google Scholar
  8. 8.
    F. Liu, G. Heijenk, “Context Discovery Using Attenuated Bloom filters in Ad-hoc Networks”, in Journal of Internet Engineering, 2007, Vol. 1, No. 1, pp. 49-58.Google Scholar
  9. 9.
    F. Liu, P. Goering, G. Heijenk, “Modeling Service Discovery in Ad-hoc Networks”, in Proc. of the 4th ACM International Workshop on Performance Evaluation of Wireless Ad Hoc, Sensor, and Ubiquitous Networks, PE-WASUN 2007 , Chania, Crete Island, October 2007.Google Scholar
  10. 10.
    M. Penrose, “Random Geometric Graphs”, Oxford University Press Inc., 2003.Google Scholar
  11. 11.
    D. Trajanov, S. Filiposka, M. Efnuseva, A. Grnarov, “Ad Hoc Networks Connection Availability Modeling”, in Proc. Of the 1st ACM international workshop on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks, PE WASUN’04,Venice, 2004.Google Scholar

Copyright information

© International Federation for Information Processing 2008

Authors and Affiliations

  • Fei Liu
    • 1
  • Geert Heijenk
    • 1
  1. 1.Communication NetworksUniversity of TwenteThe Netherlands

Personalised recommendations