Brian Neil Levine

Brian Neil Levine

Auto-generated profile, based on publicly available information

Brian Neil Levine

University of Massachusetts

Research Focus & Metrics

Academic Career Length

25Years (2002-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
27 August 2007
Verified
Conference Paper
Open access
PDF file
ABAruna Balasubramanian
Aruna Balasubramanian
BLBrian Levine
Brian Levine
AVArun Venkataramani
Arun Venkataramani

1 October 2006
Verified
Conference Paper
Closed access
WZWenrui Zhao
Wenrui Zhao
YCYang Chen
Yang Chen
MAMostafa Ammar
Mostafa Ammar
MCMark Corner
Mark Corner
BLBrian Levine
Brian Levine
EZEllen Zegura
Ellen Zegura
Disruption tolerant networks (DTNs) are designed to overcome limitations in connectivity due to conditions such as mobility, poor infrastructure, and short range radios. DTNs rely on the inherent mobility in the network to deliver packets around frequent and extended network partitions using a store-carry-and-forward paradigm. However, missed contact opportunities decrease throughput and increase delay in the network. We propose the use of throwboxes in mobile DTNs to create a greater number of contact opportunities, consequently improving the performance of the network. Throwboxes are wireless nodes that act as relays, creating additional contact opportunities in the DTN. We propose algorithms to deploy stationary throwboxes in the network that simultaneously consider routing as well as placement. We also present placement algorithms that use more limited knowledge about the network structure. We perform an extensive evaluation of our algorithms by varying both the underlying routing and mobility models. Our results suggest several findings to guide the design and operation of throwbox-augmented DTNs

1 August 2006
Verified
Conference Paper
Closed access
CPChris Piro
Chris Piro
CSClay Shields
Clay Shields
BLBrian Neil Levine
Brian Neil Levine
Mobility is often a problem for providing security services in ad hoc networks. In this paper, we show that mobility can be used to enhance security. Specifically, we show that nodes that passively monitor traffic in the network can detect a Sybil attacker that uses a number of network identities simultaneously. We show through simulation that this detection can be done by a single node, or that multiple trusted nodes can join to improve the accuracy of detection. We then show that although the detection mechanism will falsely identify groups of nodes traveling together as a Sybil attacker, we can extend the protocol to monitor collisions at the MAC level to differentiate between a single attacker spoofing many addresses and a group of nodes traveling in close proximity

24 May 2007 in Ad Hoc Networks
Verified
Journal Article
Closed access
BBBrendan Burns
Brendan Burns
OBOliver Brock
Oliver Brock
BLBrian Neil Levine
Brian Neil Levine

1 July 2002 in Journal of Computer Security
Verified
Journal Article
Closed access
PDF file
BLBrian Neil Levine
Brian Neil Levine
CSClay Shields
Clay Shields
This study was supported in part by grants ANI-0087482, ANI-0296194, and EIA-0080119 from the National Science Foundation, and 2000-DT-CX-K001 from the US Department of Justice, Office of Justice Programs. Its contents are solely the responsibility o

1 February 2016 in Child Abuse & Neglect
Verified
Journal Article
Closed access
GBGeorge Bissias
George Bissias
BLBrian Levine
Brian Levine
MLMarc Liberatore
Marc Liberatore
BLBrian Lynn
Brian Lynn
JMJuston Moore
Juston Moore
JWJanis Wolak
Janis Wolak