scispace - formally typeset
Search or ask a question
Book

Routing and Mobility Strategies for Mobile Ad Hoc Networks

TL;DR: Three new routing approaches for mobile ad hoc networks within the context of the previously described situations are developed to study the behaviour of a routing protocol when only the "self-dependent" parameter exists for routing information.
Abstract: AbstTact Mobile Ad hoc NETworks (MANET) are envisioned to become key components in the architecture of the next generation network. In contrast to wired and cellular networks, a MANET is an infrastructureless network that does not depend on any established infrastructure or centralised administration such as a base station. It is an autonomous system of wireless mobile nodes that move freely, randomly and organise themselves arbitrarily. Therefore, the network topology of an ad hoc network is dynamic in nature and may change rapidly and in unpredicted manner. Hence, the intercommunications among nodes are changing continuously. Generally, communication between a source node and a destination node in MANETs are established through multiple intermediate nodes. As a result, any link breaks between any two directly communicating nodes of the established path will result in a break of the complete connection between the source and the destination nodes. In addition, the mobility of nodes results in route loss, poor longevity of established routes, asymmetric communications links, increase in the control traffic overhead and affects the performance of the routing protocol. Moreover, using a number of routing parameters for routing such as geographical location, speed, and signal strength requires a number of resources to provide these parameters. These resources are unlikely to be always available at the same time. The aim of this research is to develop three new routing approaches for mobile ad hoc networks within the context of the previously described situations. One objective of developing these approaches is to study the behaviour of a routing protocol when only the "self-dependent" parameter exists for routing information. Other information is absent in the network, such as location information, speed, etc. Another objective is to exploit the mobility of nodes to establish long-lived routes by using the heading direction information of mobile hosts. As third objective, the scope of route requests is to be limited in order to reduce the overhead in the network. The three new approaches
Citations
More filters
Journal Article
TL;DR: This paper presents and discusses some basic principles of routing and pays high attention to how these differ from conventional routing.
Abstract: AD HOC is characterized by simple organizing, low cost, strong survival ability, and adaptation to many applications and so on. The routing principles play an important role in the realization of the above target. This paper presents and discusses some basic principles of routing and pays high attention to how these differ from conventional routing.

232 citations

References
More filters
01 Jan 2002
TL;DR: A survey of mobility models that are used in the simulations of ad hoc networks and illustrates how the performance results of an ad hoc network protocol drastically change as a result of changing the mobility model simulated.

4,618 citations

Journal ArticleDOI
01 Aug 2002
TL;DR: In this paper, a survey of mobility models used in the simulations of ad hoc networks is presented, which illustrate the importance of choosing a mobility model in the simulation of an ad hoc network protocol.
Abstract: In the performance evaluation of a protocol for an ad hoc network, the protocol should be tested under realistic conditions including, but not limited to, a sensible transmission range, limited buffer space for the storage of messages, representative data traffic models, and realistic movements of the mobile users (i.e., a mobility model). This paper is a survey of mobility models that are used in the simulations of ad hoc networks. We describe several mobility models that represent mobile nodes whose movements are independent of each other (i.e., entity mobility models) and several mobility models that represent mobile nodes whose movements are dependent on each other (i.e., group mobility models). The goal of this paper is to present a number of mobility models in order to offer researchers more informed choices when they are deciding upon a mobility model to use in their performance evaluations. Lastly, we present simulation results that illustrate the importance of choosing a mobility model in the simulation of an ad hoc network protocol. Specifically, we illustrate how the performance results of an ad hoc network protocol drastically change as a result of changing the mobility model simulated.

4,391 citations

Proceedings ArticleDOI
01 Aug 1999
TL;DR: This paper proposes several schemes to reduce redundant rebroadcasts and differentiate timing of rebroadcast to alleviate the broadcast storm problem, which is identified by showing how serious it is through analyses and simulations.
Abstract: Broadcasting is a common operation in a network to resolve many issues. In a mobile ad hoc network (MANET) in particular, due to host mobility, such operations are expected to be executed more frequently (such as finding a route to a particular host, paging a particular host, and sending an alarm signal). Because radio signals are likely to overlap with others in a geographical area, a straightforward broadcasting by flooding is usually very costly and will result in serious redundancy, contention, and collision, to which we call the broadcast storm problem. In this paper, we identify this problem by showing how serious it is through analyses and simulations. We propose several schemes to reduce redundant rebroadcasts and differentiate timing of rebroadcasts to alleviate this problem. Simulation results are presented, which show different levels of improvement over the basic flooding approach.

3,819 citations

Journal ArticleDOI
TL;DR: This paper describes a self-organizing, multihop, mobile radio network which relies on a code-division access scheme for multimedia support that provides an efficient, stable infrastructure for the integration of different types of traffic in a dynamic radio network.
Abstract: This paper describes a self-organizing, multihop, mobile radio network which relies on a code-division access scheme for multimedia support. In the proposed network architecture, nodes are organized into nonoverlapping clusters. The clusters are independently controlled, and are dynamically reconfigured as the nodes move. This network architecture has three main advantages. First, it provides spatial reuse of the bandwidth due to node clustering. Second, bandwidth can be shared or reserved in a controlled fashion in each cluster. Finally, the cluster algorithm is robust in the face of topological changes caused by node motion, node failure, and node insertion/removal. Simulation shows that this architecture provides an efficient, stable infrastructure for the integration of different types of traffic in a dynamic radio network.

1,695 citations

Proceedings ArticleDOI
01 Aug 1999
TL;DR: It is shown that group motion occurs frequently in ad hoc networks, and a novel group mobility model Reference Point Group Mobility (RPGM) is introduced to represent the relationship among mobile hosts.
Abstract: In this paper, we present a survey of various mobility models in both cellular networks and multi-hop networks We show that group motion occurs frequently in ad hoc networks, and introduce a novel group mobility model Reference Point Group Mobility (RPGM) to represent the relationship among mobile hosts RPGM can be readily applied to many existing applications Moreover, by proper choice of parameters, RPGM can be used to model several mobility models which were previously proposed One of the main themes of this paper is to investigate the impact of the mobility model on the performance of a specific network protocol or application To this end, we have applied our RPGM model to two different network protocol scenarios, clustering and routing, and have evaluated network performance under different mobility patterns and for different protocol implementations As expected, the results indicate that different mobility patterns affect the various protocols in different ways In particular, the ranking of routing algorithms is influenced by the choice of mobility pattern

1,503 citations