Share This Author
MaxProp: Routing for Vehicle-Based Disruption-Tolerant Networks
- J. Burgess, B. Gallagher, David D. Jensen, B. Levine
- Computer ScienceProceedings IEEE INFOCOM . 25TH IEEE…
- 23 April 2006
The evaluations show that MaxProp performs better than protocols that have access to an oracle that knows the schedule of meetings between peers, and performs well in a wide variety of DTN environments.
A secure routing protocol for ad hoc networks
- K. Sanzgiri, B. Dahill, B. Levine, C. Shields, E. Belding-Royer
- Computer Science10th IEEE International Conference on Network…
- 1 July 2002
This work details security threats against ad hoc routing protocols, specifically examining AODV and DSR, and proposes 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.
DTN routing as a resource allocation problem
RAPID is presented, an intentional DTN routing protocol that can optimize a specific routing metric such as worst-case delivery latency or the fraction of packets that are delivered within a deadline and significantly outperforms existing routing protocols for several metrics.
Deployment issues for the IP multicast service and architecture
This work examines the issues that have limited the commercial deployment of IP multicast from the viewpoint of carriers, and analyzes where the model fails and what it does not offer, and discusses requirements for successful deployment of multicast services.
Inferring the source of encrypted HTTP connections
This work examines the effectiveness of two traffic analysis techniques, based upon classification algorithms, for identifying encrypted HTTP streams, and gives evidence that these techniques will exhibit the scalability necessary to be effective on the Internet.
A survey of practical issues in underwater networks
This survey highlights a number of important practical issues that have not been emphasized in recent surveys of underwater networks, with an intended audience of researchers who are moving from radio-based terrestrial networks into underwater networks.
Authenticated routing for ad hoc networks
- K. Sanzgiri, D. LaFlamme, B. Dahill, B. Levine, C. Shields, E. Belding-Royer
- Computer ScienceIEEE Journal on Selected Areas in Communications
- 7 March 2005
This paper describes and evaluates ARAN and shows that it is able to effectively and efficiently discover secure routes within an ad hoc network, and details how ARAN can secure routing in environments where nodes are authorized to participate but untrusted to cooperate, as well as environments where participants do not need to be authorization to participate.
Study of a bus-based disruption-tolerant network: mobility modeling and impact on routing
- X. Zhang, J. Kurose, B. Levine, D. Towsley, Honggang Zhang
- Computer ScienceMobiCom '07
- 9 September 2007
The study of traces taken from UMass DieselNet, a Disruption-Tolerant Network consisting of WiFi nodes attached to buses, finds that the all-bus-pairs aggregated inter-contact times show no discernible pattern, and suggests the importance in choosing the right level of model granularity when modeling mobility-related measures such as inter- contact times in DTNs.
Replication Routing in DTNs: A Resource Allocation Approach
- A. Balasubramanian, B. Levine, A. Venkataramani
- Computer ScienceIEEE/ACM Transactions on Networking
- 1 April 2010
This paper presents rapid, an intentional DTN routing protocol that can optimize a specific routing metric such as the worst-case delivery delay or the fraction of packets that are delivered within a deadline, and significantly outperforms existing routing protocols for several metrics.
Capacity Enhancement using Throwboxes in DTNs
- Wenrui Zhao, Yang-Jie Chen, M. Ammar, M. Corner, B. Levine, E. Zegura
- Computer ScienceIEEE International Conference on Mobile Ad Hoc…
- 1 October 2006
This work proposes algorithms to deploy stationary throwboxes in the network that simultaneously consider routing as well as placement, and presents placement algorithms that use more limited knowledge about the network structure.