Transmission Range Designation Broadcasting Methods for Wireless Ad Hoc Networks

  • Jian-Feng Huang
  • Sheng-Yan Chuang
  • Sheng-De Wang
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4159)


The broadcast operation in ad hoc wireless networks is essential, but expensive in terms of power consumption. In DP (dominant pruning) algorithms, the number of forward nodes is treated as a criterion to measure the consumed power. However, this principle is not suitable anymore if the power-adaptive characteristic is supported and each node can detect the strength of a received packet and tune its transmission power level. Thus, in this paper, we propose a modified version of the DP algorithm with the objective being to minimize the total power consumption of forward nodes. Comparing with original DP algorithms, the sender in our algorithm not only chooses its forward nodes, but also designates the transmission ranges of its forward nodes. As a result, the designated transmission ranges not only maintain the same coverage as DP algorithms, but also reduce the total power consumption. We propose a new forward nodes selection process where the weight of a node is dependent on the incremental transmission cost rather than the effective degree. Although the resultant number of forward nodes in the proposed approach is often greater than DP algorithms, the power consumption shown in simulations is less than DP algorithms.


Source Node Transmission Range Total Power Consumption Forward Node Transmission Power Level 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Lou, W., Wu, J.: On Reducing Broadcast Redundancy in Ad Hoc Wireless Networks. IEEE Trans. On Mobile Computing 1(2) (April-June 2002)Google Scholar
  2. 2.
    Chen, X., Faloutsos, M., Krishnamurthy, S.V.: Power adaptive broadcasting with local information in ad hoc networks. In: Proc. International Conference on Network Protocols (ICNP 2003) (2003)Google Scholar
  3. 3.
    Wieselthier, J.E., Nguyen, G.D., Ephremides, A.: On the construction of energy-efficient broadcast and multicast trees in wireless networks. In: Proc. nineteenth Annual Joint Conference of the IEEE Computer and Communication Societies (INFOCOM) (2000)Google Scholar
  4. 4.
    Cartigny, J., Simplot, D., Stojmenovic, I.: Localized minimum-energy broadcasting in ad-hoc networks. In: Proc. 22nd Annual Joint Conference of the IEEE Computer and Communication Societies (INFOCOM) (2003)Google Scholar
  5. 5.
    Rappaport, T.S.: Wireless Communications, Principles and Practices. Prentice-Hall, Englewood Cliffs (1996)Google Scholar
  6. 6.
    Toussaint, G.: The relative neighborhood graph of finite planar set. Pattern Recognition 12(4), 261–268 (1980)MATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Lim, H., Kim, C.: Muticast Tree Construction and Flooding in Wireless ad hoc networks. In: Proc. ACM International Workshop on Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWIM) (2000)Google Scholar
  8. 8.
    Linnartz, J.P.: Narrow Band Land-Mobile Radio Networks, Artech House (1993)Google Scholar
  9. 9.
    Peng, W., Lu, X.: Efficient broadcast in mobile ad hoc networks using connected dominating sets. Journal of software 12(4), 529–536 (2001)Google Scholar
  10. 10.
    Lou, W., Wu, J.: Localized broadcasting in mobile ad hoc networks using neighbor designation. In: Maghoub, I. (ed.) Handbook of Mobile Computing, CRC Press, Boca Raton (to appear, 2004) (accepted)Google Scholar
  11. 11.
    Lovasz, L.: On the ration of optimal integral and fractional covers. Discrete mathematics 13, 383–390 (1975)MATHCrossRefMathSciNetGoogle Scholar
  12. 12.
  13. 13.
    Ni, S., Tsereng, Y., Chen, Y., Sheu, J.: The broadcast storm problem in a mobile ad hoc network. In: Proc. IEEE/ACM International Conference on Mobile Computing and Networking (MOBICOM) (1999)Google Scholar
  14. 14.
    Perkins, C.E.: Ad Hoc Networking. Addison-Wesley, Reading (2000)Google Scholar
  15. 15.
    Stojmenovic, I., Seddigh, S., Zunic, J.: Dominating sets and neighbor elimination based broadcasting algorithms in wireless networks. IEEE Trans. Parallel and Distributed Systems 13(1), 14–25 (2002)CrossRefGoogle Scholar
  16. 16.
    Tanenbaum, A.S.: Computer Networks, 4th edn. Prentice-Hall, Englewood Cliffs (2003)Google Scholar
  17. 17.
    Royer, E.M., Toh, C.K.: A review of current routing protocols for ad hoc mobile wireless networks. IEEE Personal Communications 6(2), 46–55 (1999)CrossRefGoogle Scholar
  18. 18.
    Perkins, C., Royer, E.M.: Ad-hoc on-demand distance vector routing. In: Proc. 2nd IEEE Workshop on Mobile Computing Systems and Applications (WMCSA), pp. 90–100 (February 1999)Google Scholar
  19. 19.
    Johnson, D.B., Maltz, D.A.: Dynamic Source Routing in Ad-Hoc Wireless Networks. In: Imielinski, T., Korth, H. (eds.) Mobile computing, Kluwer Academic Publ., Dordrecht (1996)Google Scholar
  20. 20.
    Park, V.D., Corson, M.S.: A Highly Adaptive Distributed Routing Protocol for Mobile Wireless Networks. In: Proc. Annual Joint Conference of the IEEE Computer and Communication (INFOCOM) (1997)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Jian-Feng Huang
    • 1
  • Sheng-Yan Chuang
    • 1
  • Sheng-De Wang
    • 1
  1. 1.Department of Electrical EngineeringNational Taiwan UniversityTaipeiTaiwan

Personalised recommendations