MANET Protocols Performance in Group-based Networks

  • Jaime Lloret
  • Miguel García
  • Fernando Boronat
  • Jesus Tomás
Part of the IFIP International Federation for Information Processing book series (IFIPAICT, volume 284)

Many routing protocols for ad-hoc and sensor networks have been designed, but none of them are based on groups. It is known that grouping nodes gives better performance to the group and to the whole system, thereby avoiding unnecessary message forwarding and additional overhead. In this paper we show the efficiency of the MANET routing protocols when the nodes are arranged in groups. In order to do it, first, we study the advantages of grouping nodes in each individual protocol for both fixed and mobile networks (nodes with random mobile behaviour). Then, the routing protocols will be compared to analyse which one has the best performance when it is used in a group-based network. This paper shows that group-based systems applied to ad-hoc networks provides better performance than when they are not arranged in groups.


Mobile Networking Dynamic Source Route Route Protocol Cluster Head Node Fixed Topology 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    M. Frodigh, P. Johansson, P. Larsson. "Wireless ad hoc networking. The art of networking without a network". Ericsson Review, No. 4, 2000.Google Scholar
  2. 2.
    I. F. Akyildiz, W. Su, Y. Sankarasubramaniam and E. Cayirci. “A survey on sensor networks”. Communications Magazine, IEEE. Volume 40, Issue 8. Pp. 102-114. Aug 2002.CrossRefGoogle Scholar
  3. 3.
    S. Kumar, V. S. Raghavan, J. Deng. "Medium Access Control protocols for ad hoc wireless networks: A survey". Ad Hoc Networks. Volume 4, Issue 3, Pp. 326-358. May 2006.CrossRefGoogle Scholar
  4. 4.
    E. M. Royer and C.-K. Toh, "A Review of Current Routing Protocols for Ad Hoc Mobile Wireless Networks," IEEE Personal Communications, April 1999, pp. 46-55.Google Scholar
  5. 5.
    R. Rajaraman, “Topology control and routing in ad hoc networks: a survey”. ACM SIGACT News. Volume 33, Issue 2, Pp. 60-73. June 2002.CrossRefGoogle Scholar
  6. 6.
    C. Perkins, E. Belding-Royer and S. Das, "Ad Hoc On-Demand Distance Vector (AODV) Routing". RFC 3561. July, 2003.Google Scholar
  7. 7.
    D. Johnson, Y. Hu, D. Maltz. "The Dynamic Source Routing Protocol (DSR) for Mobile Adhoc Networks for IPv4". RFC 4728. February, 2007.Google Scholar
  8. 8.
    T. Clausen and P. Jacquet. "Optimized Link State Routing Protocol". RFC 3626. Oct. 2003.Google Scholar
  9. 9.
    Josh Broch, David A. Maltz, David B. Johnson, Yih-Chun Hu, Jorjeta Jetcheva, "A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols". Proc. of the 4th ACM/IEEE int. conf. on Mobile computing and networking. Pp. 85-97. 1998.Google Scholar
  10. 10.
    P. Johansson, T. Larsson, N. Hedman, B. Mielczarek, and M. Degermark, “Scenario-Based Performance Analysis of Routing Protocols for Mobile Ad Hoc Networks”. Proc. of the 5th ACM/IEEE int. conf. on Mobile computing and networking. Pp. 195-206. 1999.Google Scholar
  11. 11.
    C. E. Perkins, E. M. Royer, S. R. Das, M. K. Marina, Performance Comparison of Two OnDemand Routing Protocols for Ad Hoc Networks, IEEE Personal Com. Pp. 16-28. Feb. 2001.Google Scholar
  12. 12.
    X. Hong, K. Xu, M. Gerla. "Scalable routing protocols for mobile ad hoc networks". IEEE Network. Volume 16, Issue 4, Pp. 11-21. Jul/Aug 2002.CrossRefGoogle Scholar
  13. 13.
  14. 14.
    Wierzbicki, A., Strzelecki, R., Swierczewski, D. and Znojek, M. Rhubarb: a Tool for Developing Scalable and Secure Peer-to-Peer Applications. Second IEEE International Conference on Peer-to-Peer Computing (P2P2002), Linöping, Sweden, 2002.Google Scholar
  15. 15.
    Xiang, Z., Zhang, Q., Zhu, W., Zhang, Z. and Zhang, Y. Peer-to-Peer Based Multimedia Distribution Service, IEEE Transactions on Multimedia 6 (2) (2004).Google Scholar
  16. 16.
    L. Hongjun, L. P. Luo, Z. Zhifeng. A structured hierarchical P2P model based on a rigorous binary tree code algorithm, Future Generation Computer Systems 23 (2). 2007. Pp. 201-208.CrossRefGoogle Scholar
  17. 17.
    B. Thallner, H. Moser. Topology control for fault-tolerant communication in highly dynamic wireless networks. 3rd Wrk. on Intelligent Solutions in Embedded Systems. May 2005.Google Scholar
  18. 18.
    M. Jiang, J. Li, Y.C. Tay. “Cluster Based Routing Protocol (CBRP)”. Internet-draf, draft-ietfmanet-cbrp-spec-01.txt, National University of Singapore, 14 August 1999.Google Scholar
  19. 19.
    Chiang, C.C., Wu, H.K., Liu, W., Gerla, M., "Routing in Clustered Multihop, Mobile Wireless Networks with Fading Channel", IEEE SICON, Kent Ridge (Singapore). April 1997.Google Scholar

Copyright information

© International Federation for Information Processing 2008

Authors and Affiliations

  • Jaime Lloret
    • 1
  • Miguel García
    • 1
  • Fernando Boronat
    • 1
  • Jesus Tomás
    • 1
  1. 1.Department of CommunicationsPolytechnic University of ValenciaValenciaSpain

Personalised recommendations