Results 1 - 10
of
1,819
Directed diffusion: a scalable and robust communication paradigm for sensor networks.
- In Mobicom ’00: Proceedings of the 6th annual international conference on mobile computing and networking
, 2000
"... ..."
(Show Context)
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.
The broadcast storm problem in a mobile ad hoc network
- ACM Wireless Networks
, 2002
"... Broadcasting is a common operation in a network to resolve many issues. In a mobile ad hoc network (MANET) in par-ticular, 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 s ..."
Abstract
-
Cited by 1237 (15 self)
- Add to MetaCart
(Show Context)
Broadcasting is a common operation in a network to resolve many issues. In a mobile ad hoc network (MANET) in par-ticular, 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 broad-casting by flooding is usually very costly and will result in serious redundancy, contention, and collision, to which we refer as the broadcast storm problem. In this paper, we iden-tify this problem by showing how serious it is through anal-yses and simulations. We propose several schemes to reduce redundant rebroadcasts and differentiate timing of rebroad-casts to alleviate this problem. Simulation results are pre-sented, which show different levels of improvement over the basic flooding approach.
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.
A High-Throughput Path Metric for Multi-Hop Wireless Routing
, 2003
"... This paper presents the expected transmission count metric (ETX), which finds high-throughput paths on multi-hop wireless networks. ETX minimizes the expected total number of packet transmissions (including retransmissions) required to successfully deliver a packet to the ultimate destination. The E ..."
Abstract
-
Cited by 1108 (5 self)
- Add to MetaCart
(Show Context)
This paper presents the expected transmission count metric (ETX), which finds high-throughput paths on multi-hop wireless networks. ETX minimizes the expected total number of packet transmissions (including retransmissions) required to successfully deliver a packet to the ultimate destination. The ETX metric incorporates the effects of link loss ratios, asymmetry in the loss ratios between the two directions of each link, and interference among the successive links of a path. In contrast, the minimum hop-count metric chooses arbitrarily among the different paths of the same minimum length, regardless of the often large differences in throughput among those paths, and ignoring the possibility that a longer path might offer higher throughput. This
Mitigating routing misbehavior in mobile ad hoc networks
- Proc. ACM/IEEE MOBICOM
, 2000
"... This paper describes two techniques that improve through-put in an ad hoc network in the presence of nodes that agree to forward packets but fail to do so. To mitigate this prob-lem, we propose categorizing nodes based upon their dynam-ically measured behavior. We use a watchdog that identifies misb ..."
Abstract
-
Cited by 1090 (4 self)
- Add to MetaCart
(Show Context)
This paper describes two techniques that improve through-put in an ad hoc network in the presence of nodes that agree to forward packets but fail to do so. To mitigate this prob-lem, we propose categorizing nodes based upon their dynam-ically measured behavior. We use a watchdog that identifies misbehaving nodes and a patl~rater that helps routing pro-tocols avoid these nodes. Through simulation we evaluate watchdog and pathrater using packet throughput, percent-age of overhead (routing) transmissions, and the accuracy of misbehaving node detection. When used together in a net-work with moderate mobility, the two techniques increase throughput by 17 % in the presence of 40 % misbehaving nodes, while increasing the percentage ofoverhead transmis-sions from the standard routing protocol's 9 % to 17%. Dur-ing extreme mobility, watchdog and pathrater can increase network throughput by 27%, while increasing the overhead transmissions from the standard routing protocol's 12 % to 24%. 1.
Geography-informed Energy Conservation for Ad Hoc Routing
- ACM MOBICOM
, 2001
"... We introduce a geographical adaptive fidelity (GAF) algorithm that reduces energy consumption in ad hoc wireless networks. GAF conserves energy by identifying nodes that are equivalent from a routing perspective and then turning off unnecessary nodes, keeping a constant level of routing fidelity. GA ..."
Abstract
-
Cited by 1045 (21 self)
- Add to MetaCart
(Show Context)
We introduce a geographical adaptive fidelity (GAF) algorithm that reduces energy consumption in ad hoc wireless networks. GAF conserves energy by identifying nodes that are equivalent from a routing perspective and then turning off unnecessary nodes, keeping a constant level of routing fidelity. GAF moderates this policy using application- and system-level information; nodes that source or sink data remain on and intermediate nodes monitor and balance energy use. GAF is independent of the underlying ad hoc routing protocol; we simulate GAF over unmodified AODV and DSR. Analysis and simulation studies of GAF show that it can consume 40% to 60% less energy than an unmodified ad hoc routing protocol. Moreover, simulations of GAF suggest that network lifetime increases proportionally to node density; in one example, a four-fold increase in node density leads to network lifetime increase for 3 to 6 times (depending on the mobility pattern). More generally, GAF is an example of adaptive fidelity, a technique proposed for extending the lifetime of self-configuring systems by exploiting redundancy to conserve energy while maintaining application fidelity.
Span: An energy-efficient coordination algorithm for topology maintenance in ad hoc wireless networks
- ACM Wireless Networks Journal
, 2001
"... ..."
(Show Context)
Ariadne: a secure on-demand routing protocol for ad hoc networks," in
- Proc. 8th ACM International Conf. Mobile Computing Networking ,
, 2002
"... Abstract An ad hoc network is a group of wireless mobile computers (or nodes), in which individual nodes cooperate by forwarding packets for each other to allow nodes to communicate beyond direct wireless transmission range. Prior research in ad hoc networking has generally studied the routing prob ..."
Abstract
-
Cited by 925 (12 self)
- Add to MetaCart
Abstract An ad hoc network is a group of wireless mobile computers (or nodes), in which individual nodes cooperate by forwarding packets for each other to allow nodes to communicate beyond direct wireless transmission range. Prior research in ad hoc networking has generally studied the routing problem in a non-adversarial setting, assuming a trusted environment. In this paper, we present attacks against routing in ad hoc networks, and we present the design and performance evaluation of a new secure on-demand ad hoc network routing protocol, called Ariadne. Ariadne prevents attackers or compromised nodes from tampering with uncompromised routes consisting of uncompromised nodes, and also prevents many types of Denial-of-Service attacks. In addition, Ariadne is efficient, using only highly efficient symmetric cryptographic primitives.
