Skip to main content

Energy Lesser Broadcasting Algorithms Using Adjustable Transmission Ranges in Mobile Ad Hoc Networks

  • Conference paper
Advances in Information Security and Assurance (ISA 2009)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 5576))

Included in the following conference series:

Abstract

This paper discussed 2 approaches to communication algorithms; 2-level clustering mesh approach and 1-level flat mesh approach, and proposes one of them which makes it appear that the total amount of expended energy becomes lesser. Wu and Dai [1] previously proposed 2 approaches; 2-level clustering approach and 1-level flat approach. This study [1] is based on the virtual backbone conception. Our 2 proposed approaches change the clustering performed in [1] into mesh so that energy consumption becomes smaller in a broadcasting. Total energy is required in not only the broadcasting process but also the construction process of a broadcasting tree. This is our approaches become disadvantageous. In [2], we gave the static properties of our approaches. This paper gives the advantageous bound of mobile movement for the 1 level flat mesh approach through our simulation study in realistic situations where a certain percentage of total mobiles move at random speeds.

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

Access this chapter

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. We, J., Dai, F.: A distributed formation of a virtual backbone in MANETs using adjustable transmission ranges. In: ICDS 2004, pp. 372–379 (2004)

    Google Scholar 

  2. Sasama, T., Abe, Y., Masuyama, H.: A broadcasting algorithm using adjustable transmission ranges in mobile ad hoc networks. In: WEBIST, pp. 123–128 (2008)

    Google Scholar 

  3. Tseng, Y.C., Ni, S.Y., Chen, Y.S., Sheu, J.P.: The broad-cast storm problem in a mobile as hoc network. Wireless Networks 8(2–3), 153–167 (2002)

    Article  MATH  Google Scholar 

  4. Ya-feng, W., Yin-long, X., Guo-liang, C., Kun, W.: On the construction of virtual multicast backbone for wireless ad hoc networks. In: Mobile Ad-hoc and Sensor systems, pp. 294–303 (2004)

    Google Scholar 

  5. Stojmenovic, I., Wu, J.: Broadcasting and activity -scheduling in ad hoc networks. In: Ad Hoc Networking, pp. 205–229 (2004)

    Google Scholar 

  6. Wu, J., Li, H.: On calculating connected dominating set for efficient routing in ad hoc wireless networks. In: DialM, pp. 7–14 (1999)

    Google Scholar 

  7. Dai, F., Wu, J.: Distributed dominant pruning in ad hoc wireless networks. In: IEEE ICC, vol. 1, pp. 353–357 (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sasama, T., Abe, Y., Masuyama, H. (2009). Energy Lesser Broadcasting Algorithms Using Adjustable Transmission Ranges in Mobile Ad Hoc Networks. In: Park, J.H., Chen, HH., Atiquzzaman, M., Lee, C., Kim, Th., Yeo, SS. (eds) Advances in Information Security and Assurance. ISA 2009. Lecture Notes in Computer Science, vol 5576. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02617-1_51

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02617-1_51

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-02616-4

  • Online ISBN: 978-3-642-02617-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics