Skip to main content

Distributed Node-Based Transmission Power Control for Wireless Ad Hoc Networks

  • Conference paper
Distributed Computing and Internet Technology (ICDCIT 2006)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 4317))

  • 493 Accesses

Abstract

Transmission power control at individual nodes is used in wireless ad hoc networks for reducing interference and energy consumption. In this paper, two new distributed node-based power control techniques have been proposed to cope up with two different situations, one for lifetime-critical networks with nodes having less mobility, and the other for networks with mobility-prone nodes. The first algorithm is based on the idea of minimum spanning tree (MST) computation. It takes O(n) rounds (n is the total number of nodes), and results better optimization in terms of node power levels. The lower transmission power of nodes makes it suitable for lifespan-critical networks. But O(n) time complexity limits its application to networks with nodes having high mobility causing frequent topology changes. However, it will be suitable for wireless sensor networks where, after the deployment, nodes become more or less static but lifetime remains to be a critical issue. The second one is based on neighbor pruning scheme that completes transmission power assignment in two rounds of message passing only. Though in terms of the node power levels, the first algorithm performs better, with less computational complexity the second one can easily adapt to the topology changes caused by the mobility of the nodes, and hence is suitable for mobile networks. Simulation studies have been done to compare the performances in terms of different performance metrics.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann Publishers, San Francisco

    Google Scholar 

  2. Kirousis, L.M., Kranakis, E., Krizanc, D., Pelc, A.: Power consumption in packet radio networks. Theoretical Computer Science 243, 289–305 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  3. Rappaport, T.S.: Wireless communications: principles and practice. Prentice Hall (1996)

    Google Scholar 

  4. Narayanaswamy, S., Kawadia, V., Sreenivas, R.S., Kumar, P.R.: Power control in ad-hoc networks: theory, architechture, algorithm and implementation of the COMPOW Protocol. In: Proc. of the European Wireless Conference, Italy, February 2002, pp. 156–162 (2002)

    Google Scholar 

  5. Rodoplu, V., Meng, T.H.: Minimum energy mobile wireless networks. IEEE J. Selected Areas in Communications 17(8), 1333–1344 (1999)

    Article  Google Scholar 

  6. Li, L., Halpern, J.Y.: Minimum energy mobile wireless networks revisited. In: Proc. of IEEE Int. Conf. on Communications, June 2001, pp. 278–283 (2001)

    Google Scholar 

  7. Bambos, N.: Toward power-sensitive network architectures in wireless communications: concepts, issues, and design aspects. In: IEEE Personal Communications Magazine, June 1998, pp. 50–59 (1998)

    Google Scholar 

  8. Broch, J., Maltz, D.A., Johnson, D.B., Hu, Y.C., Jetcheva, J.: A performance comparison of multi-hop wireless ad-hoc network routing protocols. In: Proc. of the ACM/IEEE MOBICOM, October 1998, pp. 85–97 (1998)

    Google Scholar 

  9. Corson, M.S., Ephremides, A.: A distributed routing algorithm for mobile wireless networks. Wireless Networks 1, 61–81 (1995)

    Article  Google Scholar 

  10. Gallager, R.G., Humblet, P.A., Spira, P.M.: A distributed algorithm for minimum-weight spanning trees. ACM Trans. on Programming Languages and Systems 5(1), 66–77 (1983)

    Article  MATH  Google Scholar 

  11. Garay, J., Kutten, S., Peleg, D.: A sub-linear time distributed algorithm for minimum-weight spanning trees. SIAM Journal of Computing 27(1), 302–316 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  12. Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to algorithms. MIT Press and McGraw-Hill (1998)

    Google Scholar 

  13. Hu, L.: Topology control for multihop packet radio networks. IEEE Trans. on Communications 41(10), 1474–1481 (1993)

    Article  MATH  Google Scholar 

  14. Ramanathan, R., Rosales-Hain, R.: Topology control of multihop wireless networks using transmit power adjustment. In: Proc. of IEEE INFOCOM 2000, March 2000, pp. 404–413 (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bhattacharjee, S., Das, N. (2006). Distributed Node-Based Transmission Power Control for Wireless Ad Hoc Networks. In: Madria, S.K., Claypool, K.T., Kannan, R., Uppuluri, P., Gore, M.M. (eds) Distributed Computing and Internet Technology. ICDCIT 2006. Lecture Notes in Computer Science, vol 4317. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11951957_5

Download citation

  • DOI: https://doi.org/10.1007/11951957_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-68379-7

  • Online ISBN: 978-3-540-68380-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics