International Journal of Advanced Networking and Applications

Open Access Open Access  Restricted Access Subscription Access

Packet Transfer Rate & Robust Throughput for Mobile Adhoc Network


Affiliations
1 Department of Computer Science, JSS University, Mysuru-06, India
2 Department of Computer Science, MSR University, Bangaluru, India
 

An ad-hoc wireless network is highly different considering dynamic stochastic process of its underlying links, leads to link breaks during data transaction. Hence, to provide free flow data transaction, many routing algorithms have the property of link recovery and maintenance procedures to minimize the loss of data during transmission. However these routing method do not guarantee reliable data transmission in some special application conditions with wide requirements on Packet delivery ratio and link quality of the network. Routing is a critical issue in MANET and hence the focus of this paper is the performance analysis of different routing protocols used in the wireless network. We evaluate the ability of a mobile ad hoc wireless network to distribute flows across robust routes by introducing the robust throughput measure as a performance metric. The utility gained by the delivery of flow messages is based on the level of interruption experienced by the underlying transaction. We describe the mathematical calculation of a network's robust throughput measure, as well as its robust throughput capacity. We introduce the robust flow admission and routing algorithm (RFAR) to provide for the timely and robust transport of flow transactions across mobile ad hoc wireless systems.

Keywords

MANET, AODV, DSR, RFAR, TORA.
User
Notifications
Font Size

  • Xiaoqin Chen, Haley M. Jones, A .D .S. Jayalath, "Congestion-Aware Routing Protocol for Mobile Ad Hoc Networks", in proceedings of 6th IEEE Conference on Vehicular Technology,30 September-3October, Baltimore, 2007, pp: 21- 25.

  • Ming Yu , Aniket Malvankar , Wei Su , Simon Y. Foo , "A link availability-based QoS-aware routing protocol for mobile ad hoc sensor networks",Journal on Computer Communications, vol. 30, no. 18, December 2007, pp: 3823- 3831.

  • Charles E. Perkins and Elizabeth M. Royer, "Ad-hoc On-Demand Distance Vector Routing", in proceedings of 2nd workshop on Mobile Computing Systems and Applications, 25-26 Feb., New Orleans, LA USA, 1999, pp: 90- 100.

  • Vincent D. Park and M. Scott Corson, "A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks", in Proc. Of IEEE INFOCOM'97, vol. 3, 7-12 April, Kobe, Japan, 1997, pp: 1405-1413.

  • David B. Johnson and David A. Maltz, "Dynamic Source Routing in AdHoc Wireless Networks", in proceedings of International Series in Engineering and Computer Science, vol. 353,1996, pp: 153- 181.

  • Kaixin Xu, Ken Tang, Rajive Bagrodia, Mario Gerla and Michael Bereschinsky, "Adaptive Bandwidth Management and QoS Provisioning in Large Scale Ad Hoc Networks", in proceedings of IEEE Conference on Military Communications, vol. 2, 13-16, 2003,pp: 1018- 1023.

  • Jangeun Jun and Mihail L. Sichitiu, "Fairness and QoS in Multihop Wireless Networks", in proceedings of 58th IEEE Conference on Vehicular Technology, vol. 5, 6-9 October 2003, pp: 2936- 2940.

  • C. E. Perkins, B. Royer and S.R. Das, "Ad hoc On Demand Distance Vector (AODV) Routing,”http://www.ietf.org/internet-draft s/draf t-ietfmanetaodv-13.txt, IETF Internet draft, Feb2003.

  • D. Johnson, D.A. Maltz and J. Broch, "The Dynamic Source Routing Protocol for Mobile adhoc Networks,”http://www.ietf.org/internetdra fts/draft-ietfmanetdsr-10.txt, IETF Internet draft, 19 July2004.

  • M. Jiang, J. Li, Y.C. Tay, "Cluster Based Routing Protocol," August 1999 IETF Draft.http://www.ietf.org/internet-drafts/dr aft-ie tfmanetcbrp-pec-01.txt.

  • . C. E. Perkins and P. Bhagwat, “ Highly Dynamic Destination- Sequenced Distance-Vector Routing (DSDV) for Mobile Computers,” in Proceedings of ACM SIGCOMM, pp. 234-244, 1994.

  • S. Murthy and J.JGarcia-Luna-Aceves, “An efficient routing protocol for wireless networks,” ACM Mobile Networks and Applications Journal, pp.183-197, 1996.

  • T..Chen and M. Gerla, “Global state routing: A new routing scheme for ad hoc wireless networks,” in Proceedings of IEEE ICC’98, Vol. 1, pp.171-175,7-11 June 1998.

  • A. Iwata, C.-C. Chiang, G. Pei, M. Gerla, and T.-W. Chen, "Scalable Routing Strategies for Ad Hoc Wireless Networks," IEEE Journal on Selected Areas in communications, Special Issue on Ad-Hoc Networks, pp.1369-79, Aug 1999.

  • Z.J.Haas, “The Zone Routing Protocol (ZRP) for ad hoc networks,” Internet Draft, Nov. 1997.

  • M. Joa-Ng and I-Tai Lu, “ A peer-to-peer zonebased two- level link state routing for mobile ad hoc net-works,” IEEE on Selected Areas in Communications, Vol.17,No.8,pp. 1415-1425,1999.

  • C.E. Perkins and P. Bhagwat, “Highly, Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers.” in Procedings of ACM SIGCOMM. pp.234-244,1994

  • C.E. Perkins, B. Royer and S.R. Das, “Ad hoc on Demand Distance Vector (AODV) Routing,”http://www.ietf.org/internet-drafts/draft-ietfmanetaodv-13.txt, IETF Internet draft, Feb 2003.


Abstract Views: 181

PDF Views: 4




  • Packet Transfer Rate & Robust Throughput for Mobile Adhoc Network

Abstract Views: 181  |  PDF Views: 4

Authors

G. Madhusudan
Department of Computer Science, JSS University, Mysuru-06, India
T. N. R. Kumar
Department of Computer Science, MSR University, Bangaluru, India

Abstract


An ad-hoc wireless network is highly different considering dynamic stochastic process of its underlying links, leads to link breaks during data transaction. Hence, to provide free flow data transaction, many routing algorithms have the property of link recovery and maintenance procedures to minimize the loss of data during transmission. However these routing method do not guarantee reliable data transmission in some special application conditions with wide requirements on Packet delivery ratio and link quality of the network. Routing is a critical issue in MANET and hence the focus of this paper is the performance analysis of different routing protocols used in the wireless network. We evaluate the ability of a mobile ad hoc wireless network to distribute flows across robust routes by introducing the robust throughput measure as a performance metric. The utility gained by the delivery of flow messages is based on the level of interruption experienced by the underlying transaction. We describe the mathematical calculation of a network's robust throughput measure, as well as its robust throughput capacity. We introduce the robust flow admission and routing algorithm (RFAR) to provide for the timely and robust transport of flow transactions across mobile ad hoc wireless systems.

Keywords


MANET, AODV, DSR, RFAR, TORA.

References