Results 1 - 10
of
414
Location-aided routing (LAR) in mobile ad hoc networks, in:
- Proc. of MOBICOM
, 1998
"... A mobile ad hoc network consists of wireless hosts that may move often. Movement of hosts results in a change in routes, requiring some mechanism for determining new routes. Several routing protocols have already been proposed for ad hoc networks. This paper suggests an approach to utilize location ..."
Abstract
-
Cited by 901 (10 self)
- Add to MetaCart
(Show Context)
A mobile ad hoc network consists of wireless hosts that may move often. Movement of hosts results in a change in routes, requiring some mechanism for determining new routes. Several routing protocols have already been proposed for ad hoc networks. This paper suggests an approach to utilize location information (for instance, obtained using the global positioning system) to improve performance of routing protocols for ad hoc networks. By using location information, the proposed Location-Aided Routing (LAR) protocols limit the search for a new route to a smaller "request zone" of the ad hoc network. This results in a significant reduction in the number of routing messages. We present two algorithms to determine the request zone, and also suggest potential optimizations to our algorithms.
Mobile ad hoc networking: imperatives and challenges
, 2003
"... Mobile ad hoc networks (MANETs) represent complex distributed systems that comprise wireless mobile nodes that can freely and dynamically self-organize into arbitrary and temporary, "ad-hoc" network topologies, allowing people and devices to seamlessly internetwork in areas with no pre-exi ..."
Abstract
-
Cited by 317 (8 self)
- Add to MetaCart
Mobile ad hoc networks (MANETs) represent complex distributed systems that comprise wireless mobile nodes that can freely and dynamically self-organize into arbitrary and temporary, "ad-hoc" network topologies, allowing people and devices to seamlessly internetwork in areas with no pre-existing communication infrastructure, e.g., disaster recovery environments. Ad hoc networking concept is not a new one, having been around in various forms for over 20 years. Traditionally, tactical networks have been the only communication networking application that followed the ad hoc paradigm. Recently, the introduction of new technologies such as the Bluetooth, IEEE 802.11 and Hyperlan are helping enable eventual commercial MANET deployments outside the military domain. These recent evolutions have been generating a renewed and growing interest in the research and development of MANET. This paper attempts to provide a comprehensive overview of this dynamic field. It first explains the important role that mobile ad hoc networks play in the evolution of future wireless technologies. Then, it reviews the latest research activities in these areas, including a summary of MANET's characteristics, capabilities, applications, and design constraints. The paper concludes by presenting a set of challenges and problems requiring further research in the future.
Social Network Analysis for Routing in Disconnected Delay-tolerant MANETs
, 2007
"... Message delivery in sparse Mobile Ad hoc Networks (MANETs) is difficult due to the fact that the network graph is rarely (if ever) connected. A key challenge is to find a route that can provide good delivery performance and low end-to-end delay in a disconnected network graph where nodes may move fr ..."
Abstract
-
Cited by 276 (1 self)
- Add to MetaCart
Message delivery in sparse Mobile Ad hoc Networks (MANETs) is difficult due to the fact that the network graph is rarely (if ever) connected. A key challenge is to find a route that can provide good delivery performance and low end-to-end delay in a disconnected network graph where nodes may move freely. This paper presents a multidisciplinary solution based on the consideration of the socalled small world dynamics which have been proposed for economy and social studies and have recently revealed to be a successful approach to be exploited for characterising information propagation in wireless networks. To this purpose, some bridge nodes are identified based on their centrality characteristics, i.e., on their capability to broker information exchange among otherwise disconnected nodes. Due to the complexity of the centrality metrics in populated networks the concept of ego networks is exploited where nodes are not required to exchange information about the entire network topology, but only locally available information is considered. Then SimBet Routing is proposed which exploits the exchange of pre-estimated ‘betweenness’ centrality metrics and locally determined social ‘similarity’ to the destination node. We present simulations using real trace data to demonstrate that SimBet Routing results in delivery performance close to Epidemic Routing but with significantly reduced overhead. Additionally, we show that Sim-Bet Routing outperforms PRoPHET Routing, particularly when the sending and receiving nodes have low connectivity.
A Performance Comparison Study of Ad Hoc Wireless Multicast Protocols
, 2000
"... In this paper we investigate the performance of multicast routing protocols in wireless mobile ad hoc networks. An ad hoc network is composed of mobile nodes without the presence of a wired support infrastructure. In this environment, routing/multicasting protocols are faced with the challenge of pr ..."
Abstract
-
Cited by 197 (16 self)
- Add to MetaCart
(Show Context)
In this paper we investigate the performance of multicast routing protocols in wireless mobile ad hoc networks. An ad hoc network is composed of mobile nodes without the presence of a wired support infrastructure. In this environment, routing/multicasting protocols are faced with the challenge of producing multihop routes under host mobility and bandwidth constraints. In recent years, a number of new multicast protocols of different styles have been proposed for ad hoc networks. However, systematic performance evaluations and comparative analysis of these protocols in a common realistic environment has not yet been performed. In this study, we simulate a set of representative wireless ad hoc multicast protocols and evaluate them in various network scenarios. The relative strengths, weaknesses, and applicability of each multicast protocol to diverse situations are studied and discussed.
On-Demand Multicast Routing Protocol in Multihop Wireless Mobile Networks
, 2001
"... This paper presents the On-Demand Multicast Routing Protocol (ODMRP) for wireless mobile ad ..."
Abstract
-
Cited by 189 (13 self)
- Add to MetaCart
(Show Context)
This paper presents the On-Demand Multicast Routing Protocol (ODMRP) for wireless mobile ad
Geocasting in Mobile Ad Hoc Networks: Location-Based Multicast Algorithms
, 1998
"... This paper addresses the problem of geocasting in mobile ad hoc network (MANET) environments. Geocasting is a variant of the conventional multicasting problem. For multicasting, conventional protocols define a multicast group as a collection of hosts which register to a multicast group address. Howe ..."
Abstract
-
Cited by 179 (3 self)
- Add to MetaCart
(Show Context)
This paper addresses the problem of geocasting in mobile ad hoc network (MANET) environments. Geocasting is a variant of the conventional multicasting problem. For multicasting, conventional protocols define a multicast group as a collection of hosts which register to a multicast group address. However, for geocasting, the group consists of the set of all nodes within a specified geographical region. Hosts within the specified region at a given time form the geocast group at that time. We present two different algorithms for delivering packets to such a group, and present simulation results. 1 Introduction When an application must send the same information to more than one destination, multicasting is often used, because it is much more advantageous than multiple unicasts in terms of the communication costs. Cost considerations are all the more important for a mobile ad hoc network (MANET) consisting of mobile hosts that communicate with each other over wireless links, in the absence ...
INSIGNIA: An IP-Based Quality of Service Framework for Mobile ad Hoc Networks
- Journal of Parallel and Distributed Computing
, 2000
"... this paper, we present the design, implementation, and evaluation of the INSIGNIA QOS Framework that supports the delivery of adaptive services in mobile ad hoc networks. A key component of our QOS framework is the INSIGNIA signaling system, an in-band signaling system that supports fast reservation ..."
Abstract
-
Cited by 150 (6 self)
- Add to MetaCart
(Show Context)
this paper, we present the design, implementation, and evaluation of the INSIGNIA QOS Framework that supports the delivery of adaptive services in mobile ad hoc networks. A key component of our QOS framework is the INSIGNIA signaling system, an in-band signaling system that supports fast reservation, restoration, and adaptation algorithms that are specifically designed to deliver adaptive service. The signaling system is designed to be lightweight and highly responsive to changes in network topology, node connectivity, and end-to-end quality of service conditions. The structure of the paper is as follows. We discuss our framework in the context of the related work and present the main design considerations that have influenced our thinking in Sections 2 and 3, respectively. Section 4 presents an overview of the INSIGNIA QOS framework. The detailed design of the INSIGNIA signaling system is given in Section 5. We evaluate our QOS framework in Section 6, paying particular attention to the performance of the signaling system under a variety of network conditions. Our simulation results show the benefit of the INSIGNIA QOS framework under diverse mobility, traffic, and channel conditions in support of fast reservation, restoration, and adaptation. Finally, we present our conclusion in Section 7
Adaptive approaches to relieving broadcast storms in a wireless multihop mobile ad hoc network
- IEEE Transactions on Computers
, 2003
"... Abstract—In a multihop mobile ad hoc network, broadcasting is an elementary operation to support many applications. In [15], it is shown that naively broadcasting by flooding may cause serious redundancy, contention, and collision in the network, which we refer to as the broadcast storm problem. Sev ..."
Abstract
-
Cited by 147 (2 self)
- Add to MetaCart
(Show Context)
Abstract—In a multihop mobile ad hoc network, broadcasting is an elementary operation to support many applications. In [15], it is shown that naively broadcasting by flooding may cause serious redundancy, contention, and collision in the network, which we refer to as the broadcast storm problem. Several threshold-based schemes are shown to perform better than flooding in that work. However, how to choose thresholds also poses a dilemma between reachability and efficiency under different host densities. In this paper, we propose several adaptive schemes, which can dynamically adjust thresholds based on local connectivity information. Simulation results show that these adaptive schemes can offer better reachability as well as efficiency as compared to the results in [15]. Index Terms—Broadcast, broadcast storm, communication, mobile ad hoc network (MANET), mobile computing, wireless network. æ 1
DTN Routing in a Mobility Pattern Space
, 2005
"... Routing in delay tolerant networks (DTNs) benefits considerably if one can take advantage of knowledge concerning node mobility. The main contribution of this paper is the definition of a generic routing scheme for DTNs using a high-dimensional Euclidean space constructed upon nodes' mobility p ..."
Abstract
-
Cited by 118 (4 self)
- Add to MetaCart
Routing in delay tolerant networks (DTNs) benefits considerably if one can take advantage of knowledge concerning node mobility. The main contribution of this paper is the definition of a generic routing scheme for DTNs using a high-dimensional Euclidean space constructed upon nodes' mobility patterns. We call this the MobySpace. One way of representing nodes in this space is to give them coordinates that correspond to their probability of being found in each possible location. We present simulation results indicating that such a scheme can be beneficial in a scenario inspired by studies done on real mobility traces. This work should open the way to further use of the virtual space formalism in DTN routing.
Evaluating mobility pattern space routing for DTNs
, 2005
"... Because a delay tolerant network (DTN) can often be partitioned, the problem of routing is very challenging. However, routing benefits considerably if one can take advantage of knowledge concerning node mobility. This paper addresses this problem with a generic algorithm based on the use of a high-d ..."
Abstract
-
Cited by 110 (11 self)
- Add to MetaCart
(Show Context)
Because a delay tolerant network (DTN) can often be partitioned, the problem of routing is very challenging. However, routing benefits considerably if one can take advantage of knowledge concerning node mobility. This paper addresses this problem with a generic algorithm based on the use of a high-dimensional Euclidean space, that we call MobySpace, constructed upon nodes ’ mobility patterns. We provide here an analysis and the large scale evaluation of this routing scheme in the context of ambient networking by replaying real mobility traces. The specific MobySpace evaluated is based on the frequency of visit of nodes for each possible location. We show that the MobySpace can achieve good performance compared to that of the other algorithms we implemented, especially when we perform routing on the nodes that have a high connection time. We determine that the degree of homogeneity of mobility patterns of nodes has a high impact on routing. And finally, we study the ability of nodes to learn their own mobility patterns.
