Skip to main content
SpringerLink
Log in

Efficient Multi-hop Broadcasting in Wireless Networks Using k-Shortest Path Pruning

  • Conference paper
Distributed Computing and Networking (ICDCN 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5935))

Included in the following conference series:

Abstract

In this paper, we proposed a multi-hop wireless broadcast method called k-Shortest Path Pruning (k-SPP). It is based on the Dominant Pruning method of Lim and Kim, and improves upon it in the context of certain routing protocols, such as Zone Routing Protocol. In our approach, every node must know about its k-hop neighborhood, for some constant k ≥ 3. Experimental results demonstrate that our technique requires fewer transmissions than Dominant Pruning broadcasting.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Amis, A.D., Prakash, R., Vuong, T.H.P., Huynh, D.T.: Max-Min D-Cluster Formation in Wireless Ad Hoc Networks. In: Proc. IEEE Conf. Computer Comm. (INFOCOM), vol. 1, pp. 32–41 (2000)

    Google Scholar 

  2. Chiang, T.-C., Wu, P.-Y., Huang, Y.-M.: A Limited Flooding Scheme for Mobile Ad Hoc Networks. In: IEEE Int. Conf. Wireless and Mobile Computing, Networking and Communications (WiMob), vol. 3, pp. 473–478 (2005)

    Google Scholar 

  3. Dhar, S., Rieck, M.Q., Pai, S., Kim, E.-J.: Distributed Routing Schemes for Ad Hoc Networks Using d-SPR Sets. Microprocessors and Microsystems 28(8), 427–437 (2004)

    Article  Google Scholar 

  4. Dai, F., Wu, J.: On Constructing k-Connected k-Dominating Set in Wireless Network. In: IEEE 19th Int. Conf. Parallel and Distributed Processing (2005)

    Google Scholar 

  5. Guha, S., Khuller, S.: Approximation Algorithms for Connected Dominating Sets. Algorithmica 20(4), 374–387 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  6. Haas, Z.J.: A New Routing Protocol for the Reconfigurable Wireless Networks. In: IEEE 6th Int. Conf. Universal Personal Communications, vol. 2, pp. 562–566 (1997)

    Google Scholar 

  7. Haas, Z.J., Pearlman, M.R.: The Performance of a New Routing Protocol for the Recongurable Wireless Networks. In: IEEE Int. Conf. Communication (ICC 1998), vol. 1, pp. 156–160 (1998)

    Google Scholar 

  8. Hoque, M.E., Rahman, F., Kundu, S.K., Rahman, A.: Enhanced Partial Dominant Pruning (EPDP) Based Broadcasting in Ad Hoc Wireless Networks. In: Int. Symp. Performance Evaluation of Computer and Telecommunication Systems, SPECTS, pp. 143–150 (2008)

    Google Scholar 

  9. Mai, K.T., Shin, D., Choo, H.: Connectivity-based Clustering with Stretching Technique in MANETs. In: Proc. 3rd Int. Conf. Ubiquitous Information Management and Communication (ICUIMC), pp. 200–206 (2009)

    Google Scholar 

  10. Mosko, M., Garcia-Luna-Aceves, J.J., Perkins, C.E.: Distribution of Route Requests using Dominating-set Neighbor Elimination in an On-demand Routing Protocol. In: Proc. IEEE Global Telecommunications Conference (GLOBECOM), vol. 2, pp. 1018–1022 (2003)

    Google Scholar 

  11. Koyama, A., Honma, Y., Arai, J., Barolli, L.: An Enhanced Zone-based Routing Protocol for Mobile Ad-hoc Networks Based on Route Reliability. In: 20th Int. Conf. Advanced Information Networking and Applications, vol. 1, pp. 18–20 (2006)

    Google Scholar 

  12. Liang, B., Haas, Z.J.: Virtual Backbone Generation and Maintenance in Ad hoc Network Mobility Management. In: Proc. 19th Ann. Joint Conf. IEEE Computer and Comm. Soc (INFOCOM), pp. 1293–1302 (2000)

    Google Scholar 

  13. Lim, H., Kim, C.: Flooding in Wireless Ad Hoc Networks. Computer Communications Journal 24(3-4), 353–363 (2001)

    Article  Google Scholar 

  14. Pearlman, M.R., Haas, Z.J.: Determining the Optimal Configuration for the Zone Routing Protocol. IEEE J. Selected Areas in Communications 17(8), 1395–1414 (1999)

    Article  Google Scholar 

  15. Spohn, M.A., Garcia-Luna-Aceves, J.J.: Enhanced Dominant Pruning Applied to the Route Discovery Process of On-demand Routing Protocols. In: Proc. 12th IEEE Int. Conf. Computer Communications and Networks, pp. 497–502 (2003)

    Google Scholar 

  16. Rieck, M.Q., Dhar, S.: Hierarchical Routing in Sensor Networks using k-dominating Sets. In: Proc. 7th Int. Wksp. Distributed Computing (IWDC), pp. 306–317 (2005)

    Google Scholar 

  17. Rieck, M.Q., Pai, S., Dhar, S.: Distributed Routing Algorithms for Multi-hop Ad Hoc Networks Using d-hop Connected d-Dominating Sets. Computer Networks 47(6), 785–799 (2005)

    Article  MATH  Google Scholar 

  18. Wu, Y., Li, Y.: Construction Algorithms for k-Connected m-Dominating Sets in Wireless Sensor Networks. In: Proc. 9th ACM Int. Symp. Mobile Ad Hoc Networking and Computing (MobiHoc), pp. 83–90 (2008)

    Google Scholar 

  19. Yang, C.-C., Tseng, L.-P.: Fisheye Zone Routing Protocol for Mobile Ad hoc Networks. In: 2nd IEEE Consumer Communications and Networking Conf. (CCNC), pp. 1–6 (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Drake University,  

    Michael Q. Rieck

  2. San José State University,  

    Subhankar Dhar

Authors
  1. Michael Q. Rieck
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Subhankar Dhar
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. National Science Foundation, 4201 Wilson Blvd, Arlington, 22130, VA, USA

    Krishna Kant

  2. Department of Computer Science, The University of Iowa, 52242-1419, Iowa City, IA, USA

    Sriram V. Pemmaraju

  3. Department of Computer Science and Engineering, Madras, Indian Institute of Technology (IIT), 600036, Chennai, India

    Krishna M. Sivalingam

  4. Department of Computer and Information Science, Temple University, 119122, Philadelphia, PA, USA

    Jie Wu

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rieck, M.Q., Dhar, S. (2010). Efficient Multi-hop Broadcasting in Wireless Networks Using k-Shortest Path Pruning. In: Kant, K., Pemmaraju, S.V., Sivalingam, K.M., Wu, J. (eds) Distributed Computing and Networking. ICDCN 2010. Lecture Notes in Computer Science, vol 5935. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11322-2_30

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-11322-2_30

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-11321-5

  • Online ISBN: 978-3-642-11322-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation