Showing papers by "Mehran Abolhasan published in 2004"

A review of routing protocols for mobile ad hoc networks

Abstract: The 1990s have seen a rapid growth of research interests in mobile ad hoc networking. The infrastructureless and the dynamic nature of these networks demands new set of networking strategies to be implemented in order to provide efficient end-to-end communication. This, along with the diverse application of these networks in many different scenarios such as battlefield and disaster recovery, have seen MANETs being researched by many different organisations and institutes. MANETs employ the traditional TCP/IP structure to provide end-to-end communication between nodes. However, due to their mobility and the limited resource in wireless networks, each layer in the TCP/IP model require redefinition or modifications to function efficiently in MANETs. One interesting research area in MANET is routing. Routing in the MANETs is a challenging task and has received a tremendous amount of attention from researches. This has led to development of many different routing protocols for MANETs, and each author of each proposed protocol argues that the strategy proposed provides an improvement over a number of different strategies considered in the literature for a given network scenario. Therefore, it is quite difficult to determine which protocols may perform best under a number of different network scenarios, such as increasing node density and traffic. In this paper, we provide an overview of a wide range of routing protocols proposed in the literature. We also provide a performance comparison of all routing protocols and suggest which protocols may perform best in large networks.

A routing strategy for heterogeneous mobile ad hoc networks

Abstract: This paper presents a new routing strategy for heterogeneous mobile ad hoc networks. We refer to this strategy as on-demand utility-based routing protocol (OUBRP). This protocol introduces a utility-based route discovery strategy, which aims to minimise the number of control packets disseminated into the network during route discovery by efficiently using available resources at each node. Furthermore, we propose a new strategy to eliminate uni-directional links during the route discovery phase. We refer to this strategy as uni-directional link elimination (ULE). We performed a simulation study to compare the performance of OUBRP with a number of different routing protocols proposed for MANETs. Our results show that OUBRP compared to other routing strategies produces significantly fewer control packets and achieves higher levels of successful packet delivery with increasing number of nodes. Furthermore, we propose a number of alternative uni-directional link elimination strategies.

GPS-Based Route Discovery Algorithms for On-Demand Routing Protocols in MANETs

Abstract: This papers presents new Global Positioning System (GPS)-based route discovery algorithms for on-demand routing in MANETs, called Position-based Selective Flooding (PSF). We applied our route discovery algorithm to our previous routing protocol, which is called Location-based Point-to-point Adaptive routing (LPAR) protocol and investigated its performance by simulation. Simulation results show that our position based flooding algorithm produce fewer routing overheads than the pure flooding, expanding ring search (used in AODV), LAR1 and our existing LPAR strategy, as network traffic and density is increased. Furthermore, we propose a number of improvements and variations which can be used instead of, or to further improve the performance of PSF under different network conditions.

Load-Balanced Route Discovery for Mobile Ad hoc Networks

Abstract: This paper presents Flow-Aware Routing Protocol (FARP), a new routing strategy designed to improve load balancing and scalability in mobile ad hoc networks FARP is a hop-by-hop routing protocol, which introduces a flow-aware route discovery strategy to reduce the number of control overheads propagating through the network and distributes the flow of data through least congested nodes to balance the network traffic FARP was implemented in Glomosim and compared with AODV To investigate the load distribution capability of FARP new performance metrics were introduced to measure the data packet flow distribution capability of the each routing protocol The simulation results obtained illustrate that FARP achieves high levels of throughput, reduces the level of control overheads during route discovery and distributes the network load more evenly between nodes when compared to AODV This paper also describes a number of Alternative strategies and improvements for the FARP I INTRODUCTION