Results 1 - 10
of
1,311
Energy-Efficient Computing for Wildlife Tracking: Design Tradeoffs and Early Experiences with ZebraNet
, 2002
"... Over the past decade, mobile computing and wireless communication have become increasingly important drivers of many new computing applications. The eld of wireless sensor networks particularly focuses on applications involving autonomous use of compute, sensing, and wireless communication devices ..."
Abstract
-
Cited by 719 (8 self)
- Add to MetaCart
(Show Context)
Over the past decade, mobile computing and wireless communication have become increasingly important drivers of many new computing applications. The eld of wireless sensor networks particularly focuses on applications involving autonomous use of compute, sensing, and wireless communication devices for both scienti c and commercial purposes. This paper examines the research decisions and design tradeos that arise when applying wireless peer-to-peer networking techniques in a mobile sensor network designed to support wildlife tracking for biology research.
Pervasive Computing: Vision and Challenges
- IEEE Personal Communications
, 2001
"... This paper discusses the challenges in computer systems research posed by the emerging field of pervasive computing. It first examines the relationship of this new field to its predecessors: distributed systems and mobile computing. It then identifies four new research thrusts: effective use of smar ..."
Abstract
-
Cited by 686 (22 self)
- Add to MetaCart
(Show Context)
This paper discusses the challenges in computer systems research posed by the emerging field of pervasive computing. It first examines the relationship of this new field to its predecessors: distributed systems and mobile computing. It then identifies four new research thrusts: effective use of smart spaces, invisibility, localized scalability, and masking uneven conditioning. Next, it sketches a couple of hypothetical pervasive computing scenarios, and uses them to identify key capabilities missing from today's systems. The paper closes with a discussion of the research necessary to develop these capabilities.
A Secure Routing Protocol for Ad Hoc Networks
, 2002
"... Most recent ad hoc network research has focused on providing routing services without considering security. In this paper, we detail security threats against ad hoc routing protocols, specifically examining AODV and DSR. In light of these threats, we identify three different environments with distin ..."
Abstract
-
Cited by 508 (0 self)
- Add to MetaCart
(Show Context)
Most recent ad hoc network research has focused on providing routing services without considering security. In this paper, we detail security threats against ad hoc routing protocols, specifically examining AODV and DSR. In light of these threats, we identify three different environments with distinct security requirements. We propose a solution to one, the managed-open scenario where no network infrastructure is pre-deployed, but a small amount of prior security coordination is expected. Our protocol, ARAN, is based on certificates and successfully defeats all identified attacks.
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.
Energy Aware Routing for Low Energy Ad Hoc Sensor Networks
, 2002
"... The recent interest in sensor networks has led to a number of routing schemes that use the limited resources available at sensor nodes more efficiently. These schemes typically try to find the minimum energy path to optimize energy usage at a node. In this paper we take the view that always using lo ..."
Abstract
-
Cited by 428 (5 self)
- Add to MetaCart
(Show Context)
The recent interest in sensor networks has led to a number of routing schemes that use the limited resources available at sensor nodes more efficiently. These schemes typically try to find the minimum energy path to optimize energy usage at a node. In this paper we take the view that always using lowest energy paths may not be optimal from the point of view of network lifetime and long-term connectivity. To optimize these measures, we propose a new scheme called energy aware routing that uses sub-optimal paths occasionally to provide substantial gains. Simulation results are also presented that show increase in network lifetimes of up to 40% over comparable schemes like directed diffusion routing. Nodes also burn energy in a more equitable way across the network ensuring a more graceful degradation of service with time.
Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks
, 2001
"... Most ad hoc mobile devices today operate on batteries. Hence, power consumption becomes an important issue. To maximize the lifetime of ad hoc mobile networks, the power consumption rate of each node must be evenly distributed, and the overall transmission power for each connection request mus ..."
Abstract
-
Cited by 338 (0 self)
- Add to MetaCart
Most ad hoc mobile devices today operate on batteries. Hence, power consumption becomes an important issue. To maximize the lifetime of ad hoc mobile networks, the power consumption rate of each node must be evenly distributed, and the overall transmission power for each connection request must be minimized. These two objectives cannot be satisfied simultaneously by employing routing algorithms proposed in previous work. In this article we present a new power-aware routing protocol to satisfy these two constraints simultaneously; we also compare the performance of different types of power-related routing algorithms via simulation. Simulation results confirm the need to strike a balance in attaining service availability performance of the whole network vs. the lifetime of ad hoc mobile devices.
Power-Aware Localized Routing in Wireless Networks
, 2000
"... Recently, a cost aware metric for wireless networks based on remaining battery power at nodes was proposed for shortest-cost routing algorithms, assuming constant transmission power. Power aware metrics where transmission power depends on distance between nodes, and corresponding shortest-power algo ..."
Abstract
-
Cited by 298 (33 self)
- Add to MetaCart
(Show Context)
Recently, a cost aware metric for wireless networks based on remaining battery power at nodes was proposed for shortest-cost routing algorithms, assuming constant transmission power. Power aware metrics where transmission power depends on distance between nodes, and corresponding shortest-power algorithms were also recently proposed. We define a new power-cost metric based on the combination of both node's lifetime and distance based power metrics. We investigate some properties of power adjusted transmissions, and show that, if additional nodes can be placed at desired locations between two nodes at distance d, the transmission power can be made linear in d as opposed to d a dependence for a2. This provides basis for power, cost, and power-cost localized routing algorithms, where nodes make routing decisions solely on the basis of location of their neighbors and destination. Power aware routing algorithm attempts to minimize the total power needed to route a message between a source...
Capacity Regions for Wireless Ad Hoc Networks
- IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS
, 2003
"... We define and study capacity regions for wireless ad hoc networks with an arbitrary number of nodes and topology. These regions describe the set of achievable rate combinations between all source-destination pairs in the network under various transmission strategies, such as variable-rate transmissi ..."
Abstract
-
Cited by 283 (16 self)
- Add to MetaCart
(Show Context)
We define and study capacity regions for wireless ad hoc networks with an arbitrary number of nodes and topology. These regions describe the set of achievable rate combinations between all source-destination pairs in the network under various transmission strategies, such as variable-rate transmission, single-hop or multihop routing, power control, and successive interference cancellation (SIC). Multihop cellular networks and networks with energy constraints are studied as special cases. With slight modifications, the developed formulation can handle node mobility and time-varying flat-fading channels. Numerical results indicate that multihop routing, the ability for concurrent transmissions, and SIC significantly increase the capacity of ad hoc and multihop cellular networks. On the other hand, gains from power control are significant only when variable-rate transmission is not used. Also, time-varying flat-fading and node mobility actually improve the capacity. Finally, multihop routing greatly improves the performance of energy-constraint networks.
VADD: Vehicle-assisted data delivery in vehicular ad hoc networks
- DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING, THE PENNSYLVANIA STATE UNIVERSITY, UNIVERSITY
, 2008
"... Multihop data delivery through vehicular ad hoc networks is complicated by the fact that vehicular networks are highly mobile and frequently disconnected. To address this issue, we adopt the idea of carry and forward, where a moving vehicle carries a packet until a new vehicle moves into its vicinit ..."
Abstract
-
Cited by 210 (15 self)
- Add to MetaCart
(Show Context)
Multihop data delivery through vehicular ad hoc networks is complicated by the fact that vehicular networks are highly mobile and frequently disconnected. To address this issue, we adopt the idea of carry and forward, where a moving vehicle carries a packet until a new vehicle moves into its vicinity and forwards the packet. Being different from existing carry and forward solutions, we make use of predictable vehicle mobility, which is limited by traffic pattern and road layout. Based on the existing traffic pattern, a vehicle can find the next road to forward the packet to reduce the delay. We propose several vehicle-assisted data delivery (VADD) protocols to forward the packet to the best road with the lowest data-delivery delay. Experimental results show that the proposed VADD protocols outperform existing solutions in terms of packet-delivery ratio, data packet delay, and protocol overhead. Among the proposed VADD protocols, the Hybrid Probe (H-VADD) protocol has a much better performance.
Geometric Spanner for Routing in Mobile Networks
, 2001
"... Abstract—We propose a new routing graph, the restricted Delaunay graph (RDG), for mobile ad hoc networks. Combined with a node clustering algorithm, the RDG can be used as an underlying graph for geographic routing protocols. This graph has the following attractive properties: 1) it is planar; 2) be ..."
Abstract
-
Cited by 183 (18 self)
- Add to MetaCart
(Show Context)
Abstract—We propose a new routing graph, the restricted Delaunay graph (RDG), for mobile ad hoc networks. Combined with a node clustering algorithm, the RDG can be used as an underlying graph for geographic routing protocols. This graph has the following attractive properties: 1) it is planar; 2) between any two graph nodes there exists a path whose length, whether measured in terms of topological or Euclidean distance, is only a constant times the minimum length possible; and 3) the graph can be maintained efficiently in a distributed manner when the nodes move around. Furthermore, each node only needs constant time to make routing decisions. We show by simulation that the RDG outperforms previously proposed routing graphs in the context of the Greedy perimeter stateless routing (GPSR) protocol. Finally, we investigate theoretical bounds on the quality of paths discovered using GPSR. Index Terms—Geographical routing, spanners, wireless ad hoc networks. I.
