Results 1 - 10
of
23
Maintaining network connectivity and performance in robot teams
- J. Field Robotics
, 2008
"... This paper is posted at ScholarlyCommons. ..."
(Show Context)
REAct: Resource-Efficient Accountability for Node Misbehavior in Ad Hoc Networks based on Random Audits
- In WiSec
, 2009
"... Wireless ad hoc networks rely on multi-hop routes to trans-port data from source to destination. The routing function is implemented in a collaborative manner, with each node re-sponsible for relaying traffic to the destination. However, an increasingly sophisticated pool of users with easy access t ..."
Abstract
-
Cited by 15 (3 self)
- Add to MetaCart
(Show Context)
Wireless ad hoc networks rely on multi-hop routes to trans-port data from source to destination. The routing function is implemented in a collaborative manner, with each node re-sponsible for relaying traffic to the destination. However, an increasingly sophisticated pool of users with easy access to commercial wireless devices, combined with the poor phys-ical and software security of the devices, can lead to node misconfiguration or misbehavior. A misbehaving node may refuse to forward packets in order to conserve its energy (selfishness), or simply degrade network performance (mali-ciousness). In this paper, we investigate the problem of uniquely iden-tifying the set of misbehaving nodes who refuse to forward packets. We propose a novel misbehavior identification sche-me called REAct that provides resource-efficient account-ability for node misbehavior. REAct identifies misbehaving nodes based on a series of random audits triggered upon a performance drop. We show that a source-destination pair using REAct can identify any number of independently misbehaving nodes based on behavioral proofs provided by nodes. Proofs are constructed using Bloom filters which are storage-efficient membership structures, thus significantly reducing the communication overhead for misbehavior de-tection.
Mitigating Routing Misbehavior in Disruption Tolerant Networks
"... Abstract—In disruption tolerant networks (DTNs), selfish or malicious nodes may drop received packets. Such routing misbehavior reduces the packet delivery ratio and wastes system resources such as power and bandwidth. Although techniques have been proposed to mitigate routing misbehavior in mobile ..."
Abstract
-
Cited by 12 (5 self)
- Add to MetaCart
(Show Context)
Abstract—In disruption tolerant networks (DTNs), selfish or malicious nodes may drop received packets. Such routing misbehavior reduces the packet delivery ratio and wastes system resources such as power and bandwidth. Although techniques have been proposed to mitigate routing misbehavior in mobile ad hoc networks, they cannot be directly applied to DTNs because of the intermittent connectivity between nodes. To address the problem, we propose a distributed scheme to detect packet dropping in DTNs. In our scheme, a node is required to keep a few signed contact records of its previous contacts, based on which the next contacted node can detect if the node has dropped any packet. Since misbehaving nodes may misreport their contact records to avoid being detected, a small part of each contact record is disseminated to a certain number of witness nodes, which can collect appropriate contact records and detect the misbehaving nodes. We also propose a scheme to mitigate routing misbehavior by limiting the number of packets forwarded to the misbehaving nodes. Trace-driven simulations show that our solutions are efficient and can effectively mitigate routing misbehavior. Index Terms—Detection, disruption tolerant networks, mitigation, routing misbehavior, security. I.
Outlier detection in ad hoc networks using dempster-shafer theory
- in Proceedings of the Tenth International Conference on Mobile Data Management: Systems, Services and Middleware, 2009. MDM ’09
, 2009
"... Mobile Ad-hoc NETworks (MANETs) are known to be vulnerable to a variety of attacks due to lack of central authority or fixed network infrastructure. Many security schemes have been proposed to identify misbehaving nodes. Most of these security schemes rely on either a predefined threshold, or a set ..."
Abstract
-
Cited by 8 (2 self)
- Add to MetaCart
(Show Context)
Mobile Ad-hoc NETworks (MANETs) are known to be vulnerable to a variety of attacks due to lack of central authority or fixed network infrastructure. Many security schemes have been proposed to identify misbehaving nodes. Most of these security schemes rely on either a predefined threshold, or a set of well-defined training data to build up the detection mechanism before effectively identifying the malicious peers. However, it is generally difficult to set appropriate thresholds, and collecting training datasets representative of an attack ahead of time is also problematic. We observe that the malicious peers generally demonstrate behavioral patterns different from all the other normal peers, and argue that outlier detection techniques can be used to detect malicious peers in ad hoc networks. A problem with this approach is combining evidence from potentially untrustworthy peers to detect the outliers. In this paper, an outlier detection algorithm is proposed that applies the Dempster-Shafer theory to combine observation results from multiple nodes because it can appropriately reflect uncertainty as well as unreliability of the observations. The simulation results show that the proposed scheme is highly resilient to attackers and it can converge stably to a common outlier view amongst distributed nodes with a limited communication overhead.
Security through collaboration in manets
- in Proceedings of 4th International Conference on Collaborative Computing: Networking, Applications and Worksharing, CollaborateCom 2008
, 2008
"... Abstract. It is well understood that Mobile Ad Hoc Networks (MANETs) are extremely susceptible to a variety of attacks, and traditional security mechanisms do not work well. Many security schemes have been proposed that depend on cooperation amongst the nodes in a MANET for identifying nodes that ar ..."
Abstract
-
Cited by 5 (3 self)
- Add to MetaCart
(Show Context)
Abstract. It is well understood that Mobile Ad Hoc Networks (MANETs) are extremely susceptible to a variety of attacks, and traditional security mechanisms do not work well. Many security schemes have been proposed that depend on cooperation amongst the nodes in a MANET for identifying nodes that are exhibiting malicious behavior such as packet dropping, packet modification, and packet misrouting. We argue that in general, this problem can be viewed as an instance of detecting nodes whose behavior is an outlier when compared to others. In this paper, we propose a collaborative outlier detection algorithm for MANETs that factors in a nodes reputation. The algorithm leads to a common outlier view amongst distributed nodes with a limited communication overhead. Simulation results demonstrate that the proposed algorithm is efficient and accurate.
A lightweight intrusiontolerant overlay network
- In Proc. IEEE ISORC
, 2006
"... The Internet routing layer is at times too slow at recov-ering from faults and makes a sub-optimal use of redun-dancy available at the IP layer. Overlay networks can over-come these deciencies to provide communication infras-tructures with greater availability and exibility. The ma-jority of current ..."
Abstract
-
Cited by 3 (1 self)
- Add to MetaCart
(Show Context)
The Internet routing layer is at times too slow at recov-ering from faults and makes a sub-optimal use of redun-dancy available at the IP layer. Overlay networks can over-come these deciencies to provide communication infras-tructures with greater availability and exibility. The ma-jority of current experiences, however, are able to tolerate only simple (crash) failures of the underlying network. In this paper we present LITON, an overlay network architec-ture that aims at providing highly available communication in spite of faults and intrusions in the network. We also present a graph-theoretic model that allows the degree of fault and intrusion tolerance of a given overlay to be deter-mined, as well as simulation results that validate this model and demonstrate that LITON accomplishes its goal even in worst-case scenarios. 1.
Evaluation of QoS Metrics in Ad Hoc Networks with the use of Secure Routing Protocols
"... An Ad Hoc network is formed by mobile computers (nodes) with wireless interfaces that communicate amongst themselves without the help of any infrastructure. Due to their characteristics, the Ad Hoc networks are prone to the presence of malicious nodes that can degrade your performance. This fact mot ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
An Ad Hoc network is formed by mobile computers (nodes) with wireless interfaces that communicate amongst themselves without the help of any infrastructure. Due to their characteristics, the Ad Hoc networks are prone to the presence of malicious nodes that can degrade your performance. This fact motivated the appearance of security protocols that implement mechanisms to avoid attacks like DoS. In this article is accomplished a verification the impact caused in the performance of the Ad Hoc networks with the use of security protocols (SEAD and Ariadne) in relation to the use of protocols that don't have security mechanisms (DSDV and DSR). Firstly an Ad Hoc network is simulated using these routing protocols and soon afterwards a comparative study is accomplished through graphs of the values obtained for each basic QoS
A REVIEW PAPER ON AD HOC NETWORK SECURITY
"... In this article we present a survey of secure ad hoc routing protocols for wireless networks. Ad hoc network is a collection of nodes that is connected through a wireless medium forming rapidly changing topologies. Attacks on ad hoc network routing protocols disrupt network performance and reliabili ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
(Show Context)
In this article we present a survey of secure ad hoc routing protocols for wireless networks. Ad hoc network is a collection of nodes that is connected through a wireless medium forming rapidly changing topologies. Attacks on ad hoc network routing protocols disrupt network performance and reliability with there solution. We briefly present the most popular protocols that follow the table-driven and the source-initiated on-demand approaches. The comparison between the proposed solutions and parameters of ad hoc network shows the performance according to secure protocols. We discuss in this paper routing protocol and challenges and also discuss authentication in ad hoc network.
Policy-based Malicious Peer Detection in Ad Hoc Networks
"... various node misbehaviors due to their unique features, such as highly dynamic network topology, rigorous power constraints and error-prone transmission media. Significant research efforts have been made to address the problem of misbehavior detection. However, little research work has been done to ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
(Show Context)
various node misbehaviors due to their unique features, such as highly dynamic network topology, rigorous power constraints and error-prone transmission media. Significant research efforts have been made to address the problem of misbehavior detection. However, little research work has been done to distinguish truly malicious behaviors from the faulty behaviors. Both the malicious behaviors and the faulty behaviors are generally equally treated as misbehaviors without any further investigation by most of the traditional misbehavior detection mechanisms. In this paper, we propose and develop a policy-based malicious peer detection mechanism, in which context information, such as communication channel status, buffer status, and transmission power level, is collected and then used to determine whether the misbehavior is likely a result of malicious activity or not. Simulation results illustrate that the policy-based malicious peer detection mechanism is able to distinguish malicious peers from faulty peers with high confidence. Moreover, the mechanism converges to a consistent view of malicious nodes amongst all the nodes with a limited communication overhead. A I.
MOTION CONTROL STRATEGIES FOR NETWORKED ROBOT TEAMS IN ENVIRONMENTS WITH OBSTACLES
, 2007
"... To my mother. iii Acknowledgements First and foremost, I would like to express my most sincere gratitude and admiration to my advisor Vijay Kumar. Without his encouragement, support, and guidance, I would never have made the decision to come to GRASP and would have never completed this work. My deep ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
(Show Context)
To my mother. iii Acknowledgements First and foremost, I would like to express my most sincere gratitude and admiration to my advisor Vijay Kumar. Without his encouragement, support, and guidance, I would never have made the decision to come to GRASP and would have never completed this work. My deepest thanks to the remainder of my dissertation committee, Professors C.J. Taylor, Ali Jadbabaie, and Claire Tomlin for their comments and suggestions. I especially want to express my gratitude to C.J. Taylor and George Pappas for supporting me in my various endeavors throughout my time at GRASP. Special thanks to Luiz Chaimowicz, Adam Halasz, and Savvas Loizou for the numerous discussions, including topics that go beyond the scope of this work. Thanks to Jonathan Fink and Nathan Michael for all their help with the indoor experiments. Also, I would like to acknowledge everyone involved in the MARS2020 program and the Penn Athletics Department for making Chapter 3 possible. Additionally, I would like to thank all GRASPees whom I have had the privelege to know and work with the last five years, especially Nora Ayanian, Dave Cappelleri, Jim Killer, Babak Shirmohammadi, and Peng Song. My most sincere gratitute and appreciation to my family, especially my brother and mother, for whom all my accomplishments belong to. Last, but always first in my heart, my deepest thanks to Anthony, for not only iv being my most ardent supporter, but also my most honest critic. I can’t wait to see where this journey takes us next.
