scholarly journals Asymptotically optimal geometric mobile ad-hoc routing

Author(s):  
Fabian Kuhn ◽  
Roger Wattenhofer ◽  
Aaron Zollinger
Author(s):  
Chi-Kin Chau ◽  
Jon Crowcroft ◽  
Kang-Won Lee ◽  
Starsky H.Y. Wong

Because of the increasing number of diverse routing protocols proposed to deal with the network dynamics in mobile ad hoc networks (MANETs), the heterogeneity of MANETs has increased dramatically. While many of these extant proposals only concern enhancing routing in a single domain, little attention has been given to the interoperations among heterogeneous MANETs. Moreover, the existing inter-domain routing protocols (i.e., BGP) that have been designed for the Internet cannot cope with the new challenges derived from the MANETs, such as (1) the rapid dynamic changes of network topology due to mobility, and (2) the larger diversity in intra-domain ad hoc routing protocols. In this chapter, the authors address some of the major challenges and identify new directions to the development of seamless inter-domain routing for enabling end-to-end communications over heterogeneous MANET domains.


2009 ◽  
pp. 2996-3011
Author(s):  
S. Shanmugavel ◽  
C. Gomathy

As mobile computing gains popularity, the need for ad hoc routing also continues to grow. In mobile ad hoc networks, the mobility of nodes and error prone nature of the wireless medium pose many challenges, including frequent route changes and packet losses. Such problems increase the packet delays and decrease the throughput. To meet with the dynamic queuing behaviour of Ad hoc networks, to provide QoS and hence to improve the performance, a scheduler can be used. This chapter presents a novel fuzzy based priority scheduler for mobile ad-hoc networks, to determine the priority of the packets. The performance of this scheduler is studied using GloMoSim and evaluated in terms of quantitative metrics such as packet delivery ratio, average end-to-end delay and throughput.


2008 ◽  
Vol 10 (4) ◽  
pp. 78-93 ◽  
Author(s):  
Loay Abusalah ◽  
Ashfaq Khokhar ◽  
Mohsen Guizani

Author(s):  
Prashant Rewagad ◽  
Nisha A. Lodha

Mobile Ad hoc Network is a collection of mobile nodes in which the wireless links are frequently broken down due to mobility and dynamic infrastructure. Routing is a significant issue and challenge in ad hoc networks. In Mobile ad hoc network, due to mobility of nodes network topology change frequently and thus, routing become challenging task to transfer the data from source to destination. A variety of routing protocols with varying network conditions are analyzed to find an optimized route from a source to some destination. This paper is based on performance comparison of two popular mobile ad-hoc network routing protocols using simulator i.e. DSR, ADOV. On the network simulation platform, a systematically simulation and research has been carried out on the performance of two routing protocols, and how the network environments impact on the performance of routing protocol.


2010 ◽  
Vol 20 (1) ◽  
pp. 9-16 ◽  
Author(s):  
Nenad Kojic ◽  
Marija Zajeganovic-Ivancic ◽  
Irini Reljin ◽  
Branimir Reljin

Mobile ad-hoc networks (MANET) are one of wireless networks implementation. MANET is very popular technology initially based on military purposes. Specific modifications of MANET created a possibility to implement several new wireless networks. One of them is a wireless mesh network (WMN). Over the last ten years, WMNs have gained more and more attention and are now considered as a convincing solution for providing better Internet access services for end users. WMN is an emerging technology that offers a cost-effective and scalable method to connect wireless devices. The main problem in WMNs is a routing protocol, especially because it has to enable the access to network for both mesh and conventional clients. Most of the existing ad hoc routing protocols use minimum hop-count as a metric for identifying the best packet routes. This paper presents neural network based approach to routing protocol for WMN. Neural networks are capable to analyze very complex network environments and solve routing problems on optimal (or almost optimal) way.


Sign in / Sign up

Export Citation Format

Share Document