Distributed Information Forwarding Using Delay Function in Wireless Mobile Networks

  • Wonjong Noh
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5630)


In this work, we propose a new routing control related information forwarding scheme using delay functions. Each packet experiences some forwarding delay at every single node where the packet traverses. We first propose a conservative delay function from strict end-to-end delay bound and then relax it step by step. At the end, we consider a cross-layer delay function which is a even more realistic and practical. We show its performance by simulation in mesh networks. This scheme is useful in relatively dynamic networks.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Sasson, Y., Cavin, D., Schiper, A.: Probablistic broadcast for flooding in wireless mobile ad hoc networks. In: Proc. IEEE WCNC (2003)Google Scholar
  2. 2.
    Bani Yassein, M., Ould-Khaoua, M., Papanastasiou, S.: On the Performance of Probablistic Flooding in Mobile Ad Hoc Networks. In: ICPADS 2005 (2005)Google Scholar
  3. 3.
    Abdallah, A.E., Fevens, T., Opatrny, J.: Hybrid Position-Based 3D Routing Algorithms with Partial Flooding. In: IEEE CCECE/CCGEI (2006)Google Scholar
  4. 4.
    Ko, Y.B., Vaidya, N.H.: Location-Aided Routing (LAR) in mobile ad hoc networks’ ACM/Baltzer Wireless Networks  6(4), 307–321 (2000)Google Scholar
  5. 5.
    Basagni, S., Chlamatac, I., Syrotiuk, V., Woodward, B.: A distance routing effect algorithm for mobility. In: ACM/IEEE MobiCom 1998, Dallas, TX, USA, pp. 76–84 (1998)Google Scholar
  6. 6.
    Yen, W., Chen, C.-W., Yang, C.-h.: Single Gossiping with Directional Flooding Routing Protocol in Wireless Sensor Networks. In: IEEE ICIEA (2008)Google Scholar
  7. 7.
    Choudhury, R.R.: Brownian Gossip: Exploiting Node Mobility to Diffuse Information in Ad Hoc Networks. In: 2005 International Conference on Collaborative Computing: Networking, Applications and Worksharing (2005)Google Scholar
  8. 8.
    Boyd, S., Ghosh, A., Prabbakar, B., Shah, D.: Gossip algorithms: design, analysis and applications. In: IEEE INFOCOM 2005 (March 2005)Google Scholar
  9. 9.
    Boyd, S., Ghosh, A., Prabhakar, B., Shah, D.: Mixing Times for Random Walks on on Geometric Random Graphs. In: SIAM Workshop on Analytic Algorithmics & Combinatorics (January 2005)Google Scholar
  10. 10.
    Aoyama, D.M., Shah, D.: Computing Seperable Functions via Gossip, Gossip algorithms: design, analysis and applications. In: ACM symposium on Principles of distributed computing (2006)Google Scholar
  11. 11.
    Jung, K., Shah, D.: Fast Gossip via Non-reversible Random Walk. In: IEEE Information Theory Workshop (March 2006)Google Scholar
  12. 12.
    Shwartz, A., Weiss, A.: Large Deviations For Performance Analysis. Chapman & Hall, Boca Raton (1995)zbMATHGoogle Scholar
  13. 13.
    Goldsmith, A.: Wireless communications, Cambridge (2005)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Wonjong Noh
    • 1
  1. 1.Department of MathematicsUniversity of CaliforniaIrvineUSA

Personalised recommendations