Energy Efficient Route Discovery for Mobile HCI in Ad-Hoc Networks

  • Kwonseung Shin
  • Kwangjin Park
  • Min Young Chung
  • Hyunseung Choo
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4558)


A mobile ad-hoc network [1] is a set of mobile nodes acting as routers in infrastructureless networking situations. In ad-hoc environments, to extend the lifetime of wireless mobile hosts, energy-efficient ad-hoc routing protocols must be designed. However, in conventional reactive ad-hoc routing, the route discovery operation is triggered whenever a source node has packets to send to a certain destination, but has no route information for the destination. Intermediate nodes, then, repeatedly broadcast the message until it is received by all nodes. This route discovery process could result in excessive drain of limited battery power and increase collisions in wireless transmission. In this paper, we propose an energy efficient route discovery scheme using the K-hop Pre Route Request (PRREQ) message which is only flooded within K hops from the source node. This reduces the number of nodes that participate in the route discovery process. Our empirical performance evaluation, which compares our proposed scheme to the conventional reactive adhoc routing schemes, demonstrates that proposed enhancement reduces energy consumed in the route discovery procedure by about 27% when each node initiates a new route at a rate of 0.05/sec.




Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Corson, S., Macker, J.: Mobile Ad hoc Networking (MANET): Routing Protocol Performance Issues and Evaluation Considerations. Network Working Group, Request for Comments: 2501 (1999),
  2. 2.
    Jones, C.E., Sivalingam, K.M., Agrawal, P., Chen, J.C.: A Survey of Energy Efficient Network Protocols for Wireless Networks. Wireless Networks 7(4), 343–358 (2001)zbMATHCrossRefGoogle Scholar
  3. 3.
    Wieselthier, J.E., Nguyen, G.D., Ephremides, A.: Energy-Efficient Broadcast and Multicast Trees in Wireless Networks. Mobile Networks and Applications 7(6), 481–492 (2002)CrossRefGoogle Scholar
  4. 4.
    Ogier, R., Templin, F., Lewis, M.: Topology broadcast based on reverse-path forwarding routing protocol (TBRF). Network Working Group, Request for Comments: 3684 (2004),
  5. 5.
    Chiang, C.-C.: Routing in clustered multihop mobile wireless networks with fading channel. In: Proceedings of IEEE SICON, pp. 197–211 (1997)Google Scholar
  6. 6.
    Clausen, E.T., Jacquet, E.P.: Optimised Link State Routing Protocol (OLSR). Network Working Group, Request for Comments: 3626 (2003),
  7. 7.
    Villasenor-Gonzalez, L., Ge, Y., Lamont, L.: HOLSR: a hierarchical proactive routing mechanism for mobile ad hoc networks. IEEE Communications Magazine 43(7), 118–125 (2005)CrossRefGoogle Scholar
  8. 8.
    Johnson, D.B., Maltz, D.A., Hu, Y.-C.: The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks (DSR). IETF MANET Working Group, INTERNET-DRAFT (2004),
  9. 9.
    Ko, Y.-B., Vaidya, N.H.: Location-aided routing (LAR) in mobile ad hoc networks. In: Proceedings of the Fourth Annual ACM/IEEE International Conference on Mobile Computing and Networking (Mobicom 1998) (1998)Google Scholar
  10. 10.
    Perkins, C., Belding-Royer, E., Das, S.: Ad hoc On-Demand Distance Vector (AODV) Routing. Network Working Group, Request for Comments: 3561 (2003),
  11. 11.
    Hu, Y.-C., Johnson, D.B.: Caching strategies in on-demand routing protocols for wireless ad hoc networks. MOBICOM 2000, pp. 231–242 (2000)Google Scholar
  12. 12.
    Waxman, B.M.: Routing of Multipoint Connections. IEEE JSAC 9, 1617–1622 (1993)Google Scholar
  13. 13.
    Doar, M.: A Better Mode for Generating Test Networks. In: IEEE Proc. GLOBECOM 1996, pp. 86–93 (1996)Google Scholar
  14. 14.
    Toh, C.-K.: Performance Evaluation of Crossover Switch Discovery Algorithms for Wireless ATM LANs. In: IEEE Proc. INFOCOM 1996, pp. 1380–1387 (1993)Google Scholar
  15. 15.
    Calvert, K.L., Doar, M., Doar, M.: Modelling Internet Topology. IEEE Communications Magazine 160–163 (June 1997)Google Scholar
  16. 16.
    Kumar, R., Raghavan, P., Rajagopalan, S., Sivakumar, D., Tomkins, A., Upfal, E.: Stochastic models for the Web graph. In: Proc. 41stGoogle Scholar
  17. 17.
    Rodionov, A.S., Hyunseung, C.: On Generating Random Network Structures: Connected Graphs. In: Kahng, H.-K., Goto, S. (eds.) ICOIN 2004. LNCS, vol. 3090, Springer, Heidelberg (2004)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Kwonseung Shin
    • 1
  • Kwangjin Park
    • 2
  • Min Young Chung
    • 1
  • Hyunseung Choo
    • 1
  1. 1.School of Information and Communication Engineering, Sungkyunkwan University, 440-746, SuwonKorea
  2. 2.Intelligent HCI Convergence Research Center, Sungkyunkwan University, 440-746, SuwonKorea

Personalised recommendations