Results 1 - 10
of
191
SPINS: Security Protocols for Sensor Networks
- Wireless Networks
, 2001
"... As sensor networks edge closer towards wide-spread deployment, security issues become a central concern. So far, the main research focus has been on making sensor networks feasible and useful, and less emphasis was placed on security. We design a suite of security... ..."
Abstract
-
Cited by 575 (28 self)
- Add to MetaCart
As sensor networks edge closer towards wide-spread deployment, security issues become a central concern. So far, the main research focus has been on making sensor networks feasible and useful, and less emphasis was placed on security. We design a suite of security...
Location-Aided Routing (LAR) in mobile ad hoc networks
- in: International Conference on Mobile Computing and Networking (MobiCom’98
, 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 565 (9 self)
- Add to MetaCart
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. 1
Analysis of TCP Performance over Mobile Ad Hoc Networks Part I: Problem Discussion and Analysis of Results
, 1999
"... Mobile ad hoc networks have gained a lot of attention lately as a means of providing continuous network connectivity to mobile computing devices regardless of physical location. Recently, a large amount of research has focused on the routing protocols needed in such an environment. In this two-part ..."
Abstract
-
Cited by 367 (5 self)
- Add to MetaCart
Mobile ad hoc networks have gained a lot of attention lately as a means of providing continuous network connectivity to mobile computing devices regardless of physical location. Recently, a large amount of research has focused on the routing protocols needed in such an environment. In this two-part report, we investigate the effects that link breakage due to mobility has on TCP performance. Through simulation, we show that TCP throughput drops significantly when nodes move because of TCP's inability to recognize the difference between link failure and congestion. We also analyze specific examples, such as a situation where throughput is zero for a particular connection. We introduce a new metric, expected throughput, for the comparison of throughput in multi-hop networks, and then use this metric to show how the use of explicit link failure notification (ELFN) techniques can significantly improve TCP performance. In this paper (Part I of the report), we present the problem and an analysis of our simulation results. In Part II of this report, we present the simulation and results in detail.
Distributed Clustering in Ad-hoc Sensor Networks: A Hybrid, Energy-Efficient Approach
, 2004
"... Prolonged network lifetime, scalability, and load balancing are important requirements for many ad-hoc sensor network applications. Clustering sensor nodes is an effective technique for achieving these goals. In this work, we propose a new energy-efficient approach for clustering nodes in adhoc sens ..."
Abstract
-
Cited by 139 (11 self)
- Add to MetaCart
Prolonged network lifetime, scalability, and load balancing are important requirements for many ad-hoc sensor network applications. Clustering sensor nodes is an effective technique for achieving these goals. In this work, we propose a new energy-efficient approach for clustering nodes in adhoc sensor networks. Based on this approach, we present a protocol, HEED (Hybrid Energy-Efficient Distributed clustering), that periodically selects cluster heads according to a hybrid of their residual energy and a secondary parameter, such as node proximity to its neighbors or node degree. HEED does not make any assumptions about the distribution or density of nodes, or about node capabilities, e.g., location-awareness. The clustering process terminates in O(1) iterations, and does not depend on the network topology or size. The protocol incurs low overhead in terms of processing cycles and messages exchanged. It also achieves fairly uniform cluster head distribution across the network. A careful selection of the secondary clustering parameter can balance load among cluster heads. Our simulation results demonstrate that HEED outperforms weight-based clustering protocols in terms of several cluster characteristics. We also apply our approach to a simple application to demonstrate its effectiveness in prolonging the network lifetime and supporting data aggregation.
Comparative Performance Evaluation of Routing Protocols for Mobile, Ad hoc Networks
- Mobile Networks and Applications
, 1998
"... We evaluate several routing protocols for mobile, wireless, ad hoc networks via packet level simulations. The protocol suite includes routing protocols specifically designed for ad hoc routing, as well as more traditional protocols, such as link state and distance vector, used for dynamic networks. ..."
Abstract
-
Cited by 102 (9 self)
- Add to MetaCart
We evaluate several routing protocols for mobile, wireless, ad hoc networks via packet level simulations. The protocol suite includes routing protocols specifically designed for ad hoc routing, as well as more traditional protocols, such as link state and distance vector, used for dynamic networks. Performance is evaluated with respect to fraction of packets delivered, end-to-end delay and routing load for a given traffic and mobility model. It is observed that the new generation of on-demand routing protocols use much lower routing load. However, the traditional link state and distance vector protocols provide, in general, better packet delivery and delay performance. 1. Introduction A mobile, ad hoc network [4] is an autonomous system of mobile hosts connected by wireless links. There is no static infrastructure such as base stations. If two hosts are not within radio range, all message communication between them must pass through one or more intermediate hosts that double as router...
The Effects of On-Demand Behavior in Routing Protocols for Multi-Hop Wireless Ad Hoc Networks
- IEEE Journal on Selected Areas in Communications
, 1999
"... Abstract—A number of different routing protocols proposed for use in multi-hop wireless ad hoc networks are based in whole or in part on what can be described as on-demand behavior. By ondemand behavior, we mean approaches based only on reaction to the offered traffic being handled by the routing pr ..."
Abstract
-
Cited by 102 (8 self)
- Add to MetaCart
Abstract—A number of different routing protocols proposed for use in multi-hop wireless ad hoc networks are based in whole or in part on what can be described as on-demand behavior. By ondemand behavior, we mean approaches based only on reaction to the offered traffic being handled by the routing protocol. In this paper, we analyze the use of on-demand behavior in such protocols, focusing on its effect on the routing protocol’s forwarding latency, overhead cost, and route caching correctness, drawing examples from detailed simulation of the dynamic source routing (DSR) protocol. We study the protocol’s behavior and the changes introduced by variations on some of the mechanisms that make up the protocol, examining which mechanisms have the greatest impact and exploring the tradeoffs that exist between them. Index Terms—Communication system routing, computer network performance, dynamic source routing (DSR) protocol, wireless ad hoc networks. I.
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 101 (5 self)
- Add to MetaCart
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
Security-Aware Ad hoc Routing for Wireless Networks
, 2001
"... We propose a new routing technique called Security-Aware ad hoc Routing (SAR) that incorporates security attributes as parameters into ad hoc route discovery. SAR enables the use of security as a negotiable metric to improve the relevance of the routes discovered by ad hoc routing protocols. We deve ..."
Abstract
-
Cited by 97 (0 self)
- Add to MetaCart
We propose a new routing technique called Security-Aware ad hoc Routing (SAR) that incorporates security attributes as parameters into ad hoc route discovery. SAR enables the use of security as a negotiable metric to improve the relevance of the routes discovered by ad hoc routing protocols. We develop a two-tier classi cation of routing protocol security metrics, and propose a framework to measure and enforce security attributes on ad hoc routing paths. Our framework enables applications to adapt their behavior according to the level of protection available on communicating nodes in an ad hoc network.
Adaptive Approaches to Relieving Broadcast Storms in a Wireless Multihop Mobile Ad Hoc Network
- IEEE Transactions on Computers
, 2002
"... 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 ooding may cause serious redundancy, contention, and collision in the network, which we refer to as the broadcast storm problem. Several thr ..."
Abstract
-
Cited by 74 (2 self)
- Add to MetaCart
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 ooding 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 ooding in that work. However, how to choose thresholds also poses a dilemma between reachability and eciency under dierent host densities. In this paper, we propose several adaptive schemes, which can dynamically adjust thresholds based on local connectivity information.
Virtual ring routing: network routing inspired by DHTs
- In Proc. of ACM SIGCOMM
, 2006
"... This paper presents Virtual Ring Routing (VRR), a new network routing protocol that occupies a unique point in the design space. VRR is inspired by overlay routing algorithms in Distributed Hash Tables (DHTs) but it does not rely on an underlying network routing protocol. It is implemented directly ..."
Abstract
-
Cited by 69 (7 self)
- Add to MetaCart
This paper presents Virtual Ring Routing (VRR), a new network routing protocol that occupies a unique point in the design space. VRR is inspired by overlay routing algorithms in Distributed Hash Tables (DHTs) but it does not rely on an underlying network routing protocol. It is implemented directly on top of the link layer. VRR provides both traditional point-to-point network routing and DHT routing to the node responsible for a hash table key. VRR can be used with any link layer technology but this paper describes a design and several implementations of VRR that are tuned for wireless networks. We evaluate the performance of VRR using simulations and measurements from a sensor network and an 802.11a testbed. The experimental results show that VRR provides robust performance across a wide range of environments and workloads. It performs comparably to, or better than, the best wireless routing protocol in each experiment. VRR performs well because of its unique features: it does not require network flooding or translation between fixed identifiers and location-dependent addresses.

