Results 1 - 10
of
325
GPSR: Greedy perimeter stateless routing for wireless networks
- MOBICOM
, 2000
"... We present Greedy Perimeter Stateless Routing (GPSR), a novel routing protocol for wireless datagram networks that uses the positions of touters and a packer's destination to make packet forwarding decisions. GPSR makes greedy forwarding decisions using only information about a router's i ..."
Abstract
-
Cited by 2290 (8 self)
- Add to MetaCart
(Show Context)
We present Greedy Perimeter Stateless Routing (GPSR), a novel routing protocol for wireless datagram networks that uses the positions of touters and a packer's destination to make packet forwarding decisions. GPSR makes greedy forwarding decisions using only information about a router's immediate neighbors in the network topology. When a packet reaches a region where greedy forwarding is impossible, the algorithm recovers by routing around the perimeter of the region. By keeping state only about the local topology, GPSR scales better in per-router state than shortest-path and ad-hoc routing protocols as the number of network destinations increases. Under mobility's frequent topology changes, GPSR can use local topology information to find correct new routes quickly. We describe the GPSR protocol, and use extensive simulation of mobile wireless networks to compare its performance with that of Dynamic Source Routing. Our simulations demonstrate GPSR's scalability on densely deployed wireless networks.
Next century challenges: Scalable coordination in sensor networks
, 1999
"... Networked sensors-those that coordinate amongst them-selves to achieve a larger sensing task-will revolutionize information gathering and processing both in urban environments and in inhospitable terrain. The sheer numbers of these sensors and the expected dynamics in these environments present uniq ..."
Abstract
-
Cited by 1116 (37 self)
- Add to MetaCart
(Show Context)
Networked sensors-those that coordinate amongst them-selves to achieve a larger sensing task-will revolutionize information gathering and processing both in urban environments and in inhospitable terrain. The sheer numbers of these sensors and the expected dynamics in these environments present unique challenges in the design of unattended autonomous sensor networks. These challenges lead us to hypothesize that sensor network coordination applications may need to be structured differently from traditional net-work applications. In particular, we believe that localized algorithms (in which simple local node behavior achieves a desired global objective) may be necessary for sensor net-work coordination. In this paper, we describe localized algorithms, and then discuss directed diffusion, a simple com-unication model for describing localized algorithms.
Securing ad hoc networks
"... Ad hoc networks are a new wireless networking paradigm for mobile hosts. Unlike traditional mobile wireless networks, ad hoc networks do not rely on any fixed infrastructure. Instead, hosts rely on each other to keep the network connected. The military tactical and other security-sensitive operation ..."
Abstract
-
Cited by 1064 (15 self)
- Add to MetaCart
(Show Context)
Ad hoc networks are a new wireless networking paradigm for mobile hosts. Unlike traditional mobile wireless networks, ad hoc networks do not rely on any fixed infrastructure. Instead, hosts rely on each other to keep the network connected. The military tactical and other security-sensitive operations are still the main applications of ad hoc networks, although there is a trend to adopt ad hoc networks for commercial uses due to their unique properties. One main challenge in design of these networks is their vulnerability to security attacks. In this paper, we study the threats an ad hoc network faces and the security goals to be achieved. We identify the new challenges and opportunities posed by this new networking environment and explore new approaches to secure its communication. In particular, we take advantage of the inherent redundancy in ad hoc networks — multiple routes between nodes — to defend routing against denial of service attacks. We also use replication and new cryptographic schemes, such as threshold cryptography, to build a highly secure and highly available key management service, which forms the core of our security framework.
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.
Secure Routing for Mobile Ad Hoc Networks
- MOBILE COMPUTING AND COMMUNICATIONS REVIEW
, 2002
"... For such self-organizing infrastructures as mobile ad hoc
networks , envisioned to operate in an open, collaborative,
and highly volatile environment, the importance of secu-
rity cannot be underrated. The provision of comprehen-
sive secure communication mandates that both route dis-
covery and dat ..."
Abstract
-
Cited by 599 (14 self)
- Add to MetaCart
For such self-organizing infrastructures as mobile ad hoc
networks , envisioned to operate in an open, collaborative,
and highly volatile environment, the importance of secu-
rity cannot be underrated. The provision of comprehen-
sive secure communication mandates that both route dis-
covery and data forwarding be safeguarded. The discussed
here Secure Routing Protocol (SRP) [1] counters malicious
behavior that targets the discovery of topological informa-
tion. The protection of the data transmission is a separate
problem: an intermittently misbehaving attacker could first
comply with the route discovery to make itself part of a
route, and then corrupt the in-transit data. Protection of
data transmission is addressed through our related Secure
Message Transmission Protocol (SMT), which provides a
flexible, end-to-end secure data forwarding scheme that
naturally complement SRP. Here we discuss the design of
SRP only, while SMT is the subject of another publication.
Performance comparison of two on-demand routing protocols for ad hoc networks
, 2000
"... Ad hoc networks are characterized by multihop wireless connectivity, frequently changing network topology and the need for efficient dynamic routing protocols. We compare the performance of two prominent ondemand routing protocols for mobile ad hoc networks — Dynamic Source Routing (DSR) and Ad Ho ..."
Abstract
-
Cited by 554 (21 self)
- Add to MetaCart
Ad hoc networks are characterized by multihop wireless connectivity, frequently changing network topology and the need for efficient dynamic routing protocols. We compare the performance of two prominent ondemand routing protocols for mobile ad hoc networks — Dynamic Source Routing (DSR) and Ad Hoc On-Demand Distance Vector Routing (AODV). A detailed simulation model with MAC and physical layer models is used to study interlayer interactions and their performance implications. We demonstrate that even though DSR and AODV share a similar on-demand behavior, the differences in the protocol mechanics can lead to significant performance differentials. The performance differentials are analyzed using varying network load, mobility and network size. Based on the observations, we make recommendations about how the performance of either protocol can be improved.
The zone routing protocol (ZRP) for ad hoc networks (Internet-draft), in: Mobile Ad-hoc Network (MANET) Working Group,
, 1998
"... ..."
A message ferrying approach for data delivery in sparse mobile ad hoc networks
- In Proc. of ACM Mobihoc
, 2004
"... Mobile Ad Hoc Networks (MANETs) provide rapidly deployable and self-configuring network capacity required in many critical applications, e.g., battlefields, disaster relief and wide area sensing. In this paper we study the problem of efficient data delivery in sparse MANETs where network partitions ..."
Abstract
-
Cited by 498 (14 self)
- Add to MetaCart
(Show Context)
Mobile Ad Hoc Networks (MANETs) provide rapidly deployable and self-configuring network capacity required in many critical applications, e.g., battlefields, disaster relief and wide area sensing. In this paper we study the problem of efficient data delivery in sparse MANETs where network partitions can last for a significant period. Previous approaches rely on the use of either long range communication which leads to rapid draining of nodes ’ limited batteries, or existing node mobility which results in low data delivery rates and large delays. In this paper, we describe a Message Ferrying (MF) approach to address the problem. MF is a mobility-assisted approach which utilizes a set of special mobile nodes called message ferries (or ferries for short) to provide communication service for nodes in the deployment area. The main idea behind the MF approach is to introduce non-randomness in the movement of nodes and exploit such non-randomness to help deliver data. We study two variations of MF, depending on whether ferries or nodes initiate proactive movement. The MF design exploits mobility to improve data delivery performance and reduce energy consumption in nodes. We evaluate the performance of MF via extensive ns simulations which confirm the MF approach is efficient in both data delivery and energy consumption under a variety of network conditions.
A Survey on Position-Based Routing in Mobile Ad-Hoc Networks
- IEEE Network
, 2001
"... We present an overview of ad-hoc routing protocols that make forwarding decisions based on the geographical position of a packet's destination. Other than the destination 's position, each node needs to know only its own position and the position of its one-hop neighbors in order to forwar ..."
Abstract
-
Cited by 496 (16 self)
- Add to MetaCart
(Show Context)
We present an overview of ad-hoc routing protocols that make forwarding decisions based on the geographical position of a packet's destination. Other than the destination 's position, each node needs to know only its own position and the position of its one-hop neighbors in order to forward packets. Since it is not necessary to maintain explicit routes, position-based routing does scale well even if the network is highly dynamic. This is a major advantage in a mobile ad-hoc network where the topology may change frequently. The main prerequisite for position-based routing is that a sender can obtain the current position of the destination. Therefore, recently proposed location services are discussed in addition to position-based packet forwarding strategies. We provide a qualitative comparison of the approaches in both areas and investigate opportunities for future research.
CEDAR: a Core-Extraction Distributed Ad hoc Routing Algorithm
- IEEE Journal on Selected Areas in Communications
, 1999
"... Absiract—CEDARis an algorithm for QoS routing in ad hoc network environments. It has three key components: (a) the establishment and main-tenance of a setf-organizing routing infrastructure catted the core for per-forming route computations, (b) the propagation of the link-state of stable high-bandw ..."
Abstract
-
Cited by 397 (10 self)
- Add to MetaCart
(Show Context)
Absiract—CEDARis an algorithm for QoS routing in ad hoc network environments. It has three key components: (a) the establishment and main-tenance of a setf-organizing routing infrastructure catted the core for per-forming route computations, (b) the propagation of the link-state of stable high-bandwidth links in the core through increase/decrease waves, and (c)a QoS ra,ute computation algorithm that is exeeuted at the core nodes using onty locally available state. Our preliminary performance evaluation shows that CEDAR is a robust and adaptive QoS routing algorithm that reacts effectively to the dynamics of the network white stitl approximating link-state performance for stable networks. Keywords—Ad hoc routing, QoS routing I.
