Results 1 - 10
of
89
DSR: The Dynamic Source Routing Protocol for Multi-Hop Wireless Ad Hoc Networks”, in Ad Hoc Networking, edited by Charles E.
- Perkins, Chapter
, 2001
"... Abstract The Dynamic Source Routing protocol (DSR) is a simple and efficient routing protocol designed specifically for use in multi-hop wireless ad hoc networks of mobile nodes. DSR allows the network to be completely self-organizing and self-configuring, without the need for any existing network ..."
Abstract
-
Cited by 764 (8 self)
- Add to MetaCart
Abstract The Dynamic Source Routing protocol (DSR) is a simple and efficient routing protocol designed specifically for use in multi-hop wireless ad hoc networks of mobile nodes. DSR allows the network to be completely self-organizing and self-configuring, without the need for any existing network infrastructure or administration. The protocol is composed of the two mechanisms of Route Discovery and Route Maintenance, which work together to allow nodes to discover and maintain source routes to arbitrary destinations in the ad hoc network. The use of source routing allows packet routing to be trivially loop-free, avoids the need for up-to-date routing information in the intermediate nodes through which packets are forwarded, and allows nodes forwarding or overhearing packets to cache the routing information in them for their own future use. All aspects of the protocol operate entirely on-demand, allowing the routing packet overhead of DSR to scale automatically to only that needed to react to changes in the routes currently in use. We have evaluated the operation of DSR through detailed simulation on a variety of movement and communication patterns, and through implementation and significant experimentation in a physical outdoor ad hoc networking testbed we have constructed in Pittsburgh, and have demonstrated the excellent performance of the protocol. In this chapter, we describe the design of DSR and provide a summary of some of our simulation and testbed implementation results for the protocol.
The dynamic source routing protocol (DSR) for mobile ad hoc networks for IPv4.” Vol
, 2007
"... This memo defines an Experimental Protocol for the Internet community. It does not specify an Internet standard of any kind. Discussion and suggestions for improvement are requested. Distribution of this memo is unlimited. Copyright Notice ..."
Abstract
-
Cited by 215 (1 self)
- Add to MetaCart
This memo defines an Experimental Protocol for the Internet community. It does not specify an Internet standard of any kind. Discussion and suggestions for improvement are requested. Distribution of this memo is unlimited. Copyright Notice
Signal Stability based Adaptive Routing (SSA) for Ad-Hoc Mobile Networks
- IEEE Personal Communications
, 1997
"... Unlike static networks, ad-hoc networks have no spatial hierarchy and suffer from frequent link failures which prevent mobile hosts from using traditional routing schemes. Under these conditions, mobile hosts must find routes to destinations without the use of designated routers and also must dynami ..."
Abstract
-
Cited by 165 (0 self)
- Add to MetaCart
(Show Context)
Unlike static networks, ad-hoc networks have no spatial hierarchy and suffer from frequent link failures which prevent mobile hosts from using traditional routing schemes. Under these conditions, mobile hosts must find routes to destinations without the use of designated routers and also must dynamically adapt the routes to the current link conditions. This paper proposes a distributed adaptive routing protocol for finding and maintaining stable routes based on signal strength and location stability in an ad-hoc network and presents an architecture for its implementation. 1 Introduction Mobility is becoming increasingly important for users of computing systems. Technology has made possible wireless devices and smaller, less expensive, and more powerful computers. As a result users gain flexibility and the ability to maintain connectivity to their primary computer while roaming through a large area. The number of users with portable laptops and personal communications devices is increa...
High-Performance Communication Networks
"... Contents 1 Wireless Networks 1 1.1 Introduction ...................................... 1 1.1.1 History of Wireless Networks ........................ 2 1.1.2 Wireless Data Vision ............................. 5 1.1.3 Technical Challenges ............................. 7 1.2 The Wireless Channel ...... ..."
Abstract
-
Cited by 163 (4 self)
- Add to MetaCart
Contents 1 Wireless Networks 1 1.1 Introduction ...................................... 1 1.1.1 History of Wireless Networks ........................ 2 1.1.2 Wireless Data Vision ............................. 5 1.1.3 Technical Challenges ............................. 7 1.2 The Wireless Channel ................................. 8 1.2.1 Path loss ................................... 9 1.2.2 Shadow Fading ................................ 10 1.2.3 Multipath Flat-fading and Intersymbol Interference ............. 11 1.2.4 Doppler Frequency Shift ........................... 12 1.2.5 Interference .................................. 13 1.2.6 Infrared versus Radio ............................ 13 1.2.7 Capacity Limits of Wireless Channels .................... 14 1.3 Link Level Design .................................. 15 1.3.1 Modulation Techniques ............................ 15 1.3.2 Channel Coding and Link Layer Retransmission .............. 16 1.3.3 Flat-Fading Countermeasures ..
Policy-Enabled Handoffs Across Heterogeneous Wireless Networks
, 1999
"... "Access is the killer app" [3] is the vision of the Daedalus project at U.C. Berkeley. Being able to be connected seamlessly anytime anywhere to the best network still remains an unfulfilled goal. Often, even determining the "best" network is a challenging task because of the wi ..."
Abstract
-
Cited by 156 (1 self)
- Add to MetaCart
(Show Context)
"Access is the killer app" [3] is the vision of the Daedalus project at U.C. Berkeley. Being able to be connected seamlessly anytime anywhere to the best network still remains an unfulfilled goal. Often, even determining the "best" network is a challenging task because of the widespread deployment of overlapping wireless networks. In this paper, we describe a policy-enabled handoff system that allows users to express policies on what is the "best" wireless system at any moment, and make tradeoffs among network characteristics and dynamics such as cost, performance and power consumption. We designed a performance reporting scheme estimating current network conditions, which serves as input to the policy specification. A primary goal of this work is to make it possible to balance the bandwidth load across networks with comparable performance. To avoid the problem of handoff instability, i.e., many mobile hosts making the same handoff decision at essentially the same time, we designed r...
MSOCKS: An Architecture for Transport Layer Mobility
, 1998
"... Mobile nodes of the future will be equiped with multiple network interfaces to take advantage of overlay networks, yet no current mobility systems provide full support for the simultaneous use of multiple interfaces. The need for such support arises when multiple connectivity options are available w ..."
Abstract
-
Cited by 147 (0 self)
- Add to MetaCart
(Show Context)
Mobile nodes of the future will be equiped with multiple network interfaces to take advantage of overlay networks, yet no current mobility systems provide full support for the simultaneous use of multiple interfaces. The need for such support arises when multiple connectivity options are available with different cost, coverage, latency and bandwidth characteristics, and applications want their data to flow over the interface that best matches the characteristics of the data. We present an architecture called Transport Layer Mobility that allows mobile nodes to not only change their point of attachment to the Internet, but also to control which network interfaces are used for the different kinds of data leaving from and arriving at the mobile node. We implement our transport layer mobility scheme using a split-connection proxy architecture and a new technique called TCP Splice that gives split-connection proxy systems the same end-to-end semantics as normal TCP connections.
Mobility Management in Next-Generation Wireless Systems
- PROCEEDINGS OF THE IEEE
, 1999
"... This paper describes current and proposed protocols for mobility management for public land mobile network (PLMN)-based networks, mobile Internet protocol (IP), wireless asynchronous transfer mode (ATM), and satellite networks. The integration of these networks will be discussed in the context of th ..."
Abstract
-
Cited by 127 (11 self)
- Add to MetaCart
This paper describes current and proposed protocols for mobility management for public land mobile network (PLMN)-based networks, mobile Internet protocol (IP), wireless asynchronous transfer mode (ATM), and satellite networks. The integration of these networks will be discussed in the context of the next evolutionary step of wireless communication networks. First, a review is provided of location management algorithms for personal communication systems (PCS) implemented over a PLMN network. The latest protocol changes for location registration and handoff are investigated for Mobile IP, followed by a discussion of proposed protocols for wireless ATM and satellite networks. Finally, an outline of open problems to be addressed by the next generation of wireless network service is discussed
Mobile Information Access
, 1996
"... The ability to access information on demand when mobile will be a critical capability in the 21st century. In this paper, we examine the fundamental forces at work in mobile computing systems and explain how they constrain the problem of mobile information access. From these constraints, we derive t ..."
Abstract
-
Cited by 122 (4 self)
- Add to MetaCart
(Show Context)
The ability to access information on demand when mobile will be a critical capability in the 21st century. In this paper, we examine the fundamental forces at work in mobile computing systems and explain how they constrain the problem of mobile information access. From these constraints, we derive the importance of adaptivity as a crucial requirement of mobile clients. We then develop a taxonomy of adaptation strategies, and summarize our research in application-transparent and application-aware adaptation in the Coda and Odyssey systems respectively.
Proakis,“Underwater acoustic networks
- IEEE Jou. of Ocea. Eng
, 2000
"... Abstract—With the advances in acoustic modem technology that enabled high-rate reliable communications, current research focuses on communication between various remote instruments within a network environment. Underwater acoustic (UWA) networks are generally formed by acoustically connected ocean-b ..."
Abstract
-
Cited by 119 (8 self)
- Add to MetaCart
(Show Context)
Abstract—With the advances in acoustic modem technology that enabled high-rate reliable communications, current research focuses on communication between various remote instruments within a network environment. Underwater acoustic (UWA) networks are generally formed by acoustically connected ocean-bottom sensors, autonomous underwater vehicles, and a surface station, which provides a link to an on-shore control center. While many applications require long-term monitoring of the deployment area, the battery-powered network nodes limit the lifetime of UWA networks. In addition, shallow-water acoustic channel characteristics, such as low available bandwidth, highly varying multipath, and large propagation delays, restrict the efficiency of UWA networks. Within such an environment, designing an UWA network that maximizes throughput and reliability while minimizing the power consumption becomes a very difficult task. The goal of this paper is to survey the existing network technology and its applicability to underwater acoustic channels. In addition, we present a shallow-water acoustic network example and outline some future research directions. Index Terms—Acoustic networks, telemetry, underwater communications. I.
Source-Tree Routing in Wireless Networks
, 1999
"... We present the source-tree adaptive routing (STAR) protocol and analyze its performance in wireless networks with broadcast radio links. Routers in STAR communicate to its neighbors their source routing trees either incrementally or in atomic updates. Source routing trees are specified by stating th ..."
Abstract
-
Cited by 110 (7 self)
- Add to MetaCart
(Show Context)
We present the source-tree adaptive routing (STAR) protocol and analyze its performance in wireless networks with broadcast radio links. Routers in STAR communicate to its neighbors their source routing trees either incrementally or in atomic updates. Source routing trees are specified by stating the link parameters of each link belonging to the paths used to reach every destination. Hence, a router disseminates link-state updates to its neighbors for only those links along paths used to reach destinations. Simulation results show that STAR is an order of magnitude more efficient than any topology-broadcast protocol, and four times more efficient than ALP, which was the most efficient table-driven routing protocol based on partial link-state information reported to date. The results also show that STAR is even more efficient than the Dynamic Source Routing (DSR) protocol, which has been shown to be one of the best performing on-demand routing protocols.
