Brian Neil Levine  
 
29 results where keywords includes wireless.
[All entries] This page as [Text] or [Bibtex]
  • @inproceedings{Yang:2013,
    Author = { Sookhyun Yang and Jim Kurose and Brian Neil Levine},
    Booktitle = {Proc. IEEE INFOCOM Mini-Conference},
    Keywords = {forensics; wireless; Synthesis project},
    Month = {April},
    Pages = {5},
    Sponsors = {CNS-0905349},
    Title = {{Disambiguation of Residential Wired and Wireless Access in a Forensic Setting}},
    Url = {http://forensics.umass.edu/pubs/yang.infocom-mini.2013.pdf},
    Year = {2013}}

    [link][PDF]
  • @inproceedings{Partan:2011,
    Author = { James W. Partan and Jim Kurose and Brian Neil Levine and James Preisig},
    Booktitle = {Proc. ACM International Workshop on UnderWater Networks (WUWNet)},
    Keywords = {MAC Protocols; wireless; underwater; Synthesis project},
    Month = {December},
    Sponsors = {CNS-0519881},
    Title = {{Low Spreading Loss in Underwater Acoustic Networks Reduces RTS/CTS Effectiveness}},
    Url = {http://forensics.umass.edu/pubs/partan.wuwnet.2011.pdf},
    Year = {2011}}

    [link][PDF]
  • @inproceedings{Soroush:2011a,
    Author = { Hamed Soroush and Peter Gilbert and Nilanjan Banerjee and Brian Neil Levine and Mark Corner and Landon Cox},
    Booktitle = {Proc.\ ACM International Conference on emerging Networking EXperiments and Technologies (CoNEXT)},
    Keywords = {DOME; wireless},
    Month = {December},
    Pages = {12},
    Sponsors = {CNS-0519881, CNS-0447877, CNS-0720717, CNS-1018112, CNS-1055061, CNS-1115728},
    Title = {{Concurrent Wi-Fi for Mobile Users: Analysis and Measurements}},
    Url = {http://forensics.umass.edu/pubs/soroush.conext.2011.pdf},
    Year = {2011}}

    [link][PDF]
  • @article{Soroush:2011b,
    Author = {Soroush, Hamed and Banerjee, Nilanjan and Corner, Mark and Levine, Brian and Lynn, Brian},
    Journal = {ACM SIGMOBILE Mobile Computing and Communications Review},
    Keywords = {DOME; wireless},
    Month = {October},
    Number = {4},
    Pages = {2--15},
    Title = {{A retrospective look at the UMass DOME mobile testbed} (invited)},
    Url = {http://forensics.umass.edu/pubs/soroush.mc2r.2011.pdf},
    Volume = {15},
    Year = {2011}}

    [link][PDF]
  • @inproceedings{Soroush:2011,
    Author = { Hamed Soroush and Peter Gilbert and Nilanjan Banerjee and Brian Neil Levine and Mark Corner and Landon Cox},
    Booktitle = {Proc.\ ACM SIGCOMM},
    Keywords = {DOME; wireless},
    Month = {August},
    Title = {{Spider: Improving Mobile Networking with Concurrent Wi-Fi Connections (Poster)}},
    Url = {http://forensics.umass.edu/pubs/soroush.sigcomm.2011.poster.pdf},
    Year = {2011}}

    [link][PDF]
  • @inproceedings{Bissias:2010,
    Author = { George Bissias and Brian Neil Levine and Ramesh Sitaraman},
    Booktitle = {Proc.\ ACM Conference on emerging Networking EXperiments and Technologies (CoNEXT)},
    Keywords = {security; wireless; routing},
    Month = {November},
    Slides_Url = {http://forensics.umass.edu/pubs/bissias.conext.2010.slides.pdf},
    Sponsor = {CNS-0519881 and CNS-0519894},
    Title = {{Assessing the Vulnerability of Replicated Network Services}},
    Url = {http://forensics.umass.edu/pubs/bissias.conext.2010.pdf},
    Year = {2010}}

    [link][PDF]
  • @techreport{Partan:2010,
    Author = { James W. Partan and Jim Kurose and Brian Neil Levine and James Preisig},
    Institution = {University of Massachusetts Amherst},
    Keywords = {MAC Protocols; wireless; underwater; Tech report; Synthesis project},
    Month = {July},
    Number = {UM-CS-2010-045},
    Title = {{Spatial Reuse in Underwater Acoustic Networks using RTS/CTS MAC Protocols}},
    Url = {http://forensics.umass.edu/pubs/Partan.UM-CS-2010-045.pdf},
    Year = {2010}}

    [link][PDF]
  • @article{Balasubramanian:2010,
    Author = { Aruna Balasubramanian and Brian Neil Levine and Arun Venkataramani},
    Journal = {IEEE/ACM Transactions on Networking},
    Keywords = {DTN; routing; Journal Paper; wireless; DOME},
    Month = {April},
    Number = {2},
    Pages = {596--609},
    Sponsors = {NSF-0133055 and CNS-0519881},
    Title = {{Replication Routing in DTNs: A Resource Allocation Approach}},
    Url = {http://forensics.umass.edu/pubs/Balasubramanian.ToN.2010.pdf},
    Volume = {18},
    Year = {2010}}

    [link][PDF]
  • @inproceedings{Soroush:2009,
    Author = { Hamed Soroush and Nilanjan Banerjee and Aruna Balasubramanian and Mark D. Corner and Brian Neil Levine and Brian Lynn},
    Booktitle = {Proc. ACM Intl. Workshop on Hot Topics of Planet-Scale Mobility Measurements (HotPlanet)},
    Keywords = {Wireless, DTN; DOME},
    Month = {June},
    Sponsors = {CNS-0519881, CNS-0447877},
    Techreport_Url = {https://web.cs.umass.edu/publication/docs/2009/UM-CS-2009-023.pdf},
    Title = {{DOME: A Diverse Outdoor Mobile Testbed}},
    Url = {http://forensics.umass.edu/pubs/soroush.hotplanet09.pdf},
    Year = {2009}}

    [link][PDF]
  • @inproceedings{Balasubramanian:2008b,
    Author = {Balasubramanian, Aruna and Levine, Brian Neil and Venkataramani, Arun},
    Booktitle = {Proc. ACM Mobicom},
    Keywords = {wireless; DTN; information retrieval; DOME},
    Month = {September},
    Pages = {70--80},
    Sponsors = {CNS-0519881 and W911NF-07-1-0281},
    Title = {{Enabling Interactive Web Applications in Hybrid Networks}},
    Url = {http://forensics.umass.edu/pubs/balasubramanian.mobicom.2008.pdf},
    Year = {2008}}

    [link][PDF]
  • @inproceedings{BanerjeeMobicom08,
    Address = {San Francisco, CA, USA},
    Author = {Banerjee, Nilanjan and Corner, Mark D. and Towsley, Don and Levine, Brian Neil},
    Booktitle = {Proc. ACM Mobicom},
    Keywords = {Wireless; DTN; DOME},
    Month = {September},
    Pages = {81--91},
    Sponsors = {CNS-0519881,NSF-0133055,CNS-0615075,CNS-0520729,CNS-0447877, W911NF-07-1-0281},
    Title = {{Relays, Base Stations, and Meshes: Enhancing Mobile Networks with Infrastructure}},
    Traces_Url = {brian.php/Network},
    Url = {http://forensics.umass.edu/pubs/balasubramanian.mobicom.2008.pdf},
    Year = {2008}}

    [link][PDF]
  • @inproceedings{Balasubramanian:2008a,
    Author = {Balasubramanian, Aruna and Mahajan, Ratul and Venkataramani, Arun and Levine, Brian Neil and Zahorjan, John},
    Booktitle = {Proc. ACM SIGCOMM},
    Keywords = {wireless; DTN; DOME},
    Month = {August},
    Pages = {427--438},
    Slides_Url = {http://forensics.umass.edu/pubs/slides/balasubramanian.sigcomm.2008.ppt},
    Sponsors = {CNS-0519881},
    Title = {{Interactive WiFi Connectivity for Moving Vehicles}},
    Traces_Url = {brian.php/Network},
    Url = {http://forensics.umass.edu/pubs/balasubramanian.sigcomm.2008.pdf},
    Year = {2008}}

    [link][PDF]
  • @article{Partan:2007,
    Author = {Partan, James W. and Kurose, Jim and Levine, Brian Neil},
    Journal = {Special Issue of ACM Mobile Computing Communications Review},
    Keywords = {DTN; underwater; wireless; DOME},
    Month = {October},
    Number = {4},
    Pages = {23--33},
    Sponsors = {CNS-0519881 and N00014-05-G-0106-0008},
    Title = {{A Survey of Practical Issues in Underwater Networks}},
    Url = {http://forensics.umass.edu/pubs/partan.mc2r07.pdf},
    Volume = {11},
    Year = {2007}}

    [link][PDF]
  • @inproceedings{Balasubramanian:2007b,
    Author = {Balasubramanian, Aruna and Zhou, Yun and Croft, W. Bruce and Levine, Brian Neil and Venkataramani, Arun},
    Booktitle = {Proc. ACM Workshop on Challenged Networks (CHANTS)},
    Keywords = {DTN; wireless; information retrieval; Synthesis project;DOME},
    Month = {September},
    Pages = {59--66},
    Pdf_Url = {http://forensics.umass.edu/pubs/balasubramanian.chants.2007.pdf},
    Slides_Url = http://forensics.umass.edu/pubs/slides/balasubramanian.chants.2007.ppt, Title = {{Web Search From a Bus}},
    Traces_Url = {brian.php/Network/Network},
    Year = {2007}}

    [link]
  • @inproceedings{Zhang:2007,
    Abstract = {In this paper, we study traces taken from UMass DieselNet, a sparse mobile wireless DTN network consisting of WiFi nodes attached to buses. As buses travel their routes, they encounter other buses and in some cases are able to establish pair-wise connections and transfer data between them. We analyze these traces to characterize inter-contact behavior among buses, and study the impact on DTN routing performance. We find that the all-bus-pairs aggregated inter-contact times show no discernible pattern. However, the inter-contact times aggregated at a route level exhibit periodic behavior. By analyzing the deterministic inter-meeting times for bus pairs on different route pairs, and then additionally considering variability in bus movement and random failures to establish connections when a pair of buses are in transmission range, we find that these inter-contact times aggregated at a route level can be modeled as mixtures of normal distributions. Based on this analysis, we construct generative models that capture the behavior described above, allowing one to generate synthetic traces of DTN inter-contact times. Using trace-driven simulations of epidemic DTN routing, we find that the epidemic performance predicted by traces generated with this finer-grained route-level model are much closer to the actual performance that would be realized in the operational system than traces generated using the coarse-grained all-bus-pairs aggregated model. This suggests that one must take care in choosing the right level of model granularity when modeling mobility-related measures such as inter-contact times in DTN networks. },
    Acm_Url = {http://doi.acm.org/10.1145/1287853.1287876},
    Author = {Zhang, Xiaolan and Kurose, Jim and Levine, Brian Neil and Towsley, Don and Zhang, Honggang},
    Booktitle = {Proc. ACM Intl. Conf. on Mobile Computing and Networking (Mobicom)},
    Keywords = {DTN; routing; wireless;DOME},
    Month = {September},
    Pages = {195--206},
    Slides_Url = {http://forensics.umass.edu/pubs/slides/zhang.mobicom.2007.ppt.pdf},
    Sponsors = {CNS-0519881, ANI-0325868, and W911NF-06-3-0001},
    Title = {{Study of a Bus-Based Disruption Tolerant Network: Mobility Modeling and Impact on Routing}},
    Traces_Url = {brian.php/Network},
    Url = {http://forensics.umass.edu/pubs/zhang.mobicom.2007.pdf},
    Year = {2007}}

    [link][PDF]
  • @inproceedings{Burgess:2007,
    Abstract = {Disruption-Tolerant Networks (DTNs) deliver data in network environments composed of intermittently connected nodes. Just as in traditional networks, malicious nodes within a DTN may attempt to delay or destroy data in transit to its destination. Such attacks include dropping data, flooding the network with extra messages, corrupting routing tables, and counterfeiting network acknowledgments. Many existing methods for securing routing protocols require authentication supported by mechanisms such as a public key infrastructure, which is difficult to deploy and operate in a DTN, where connectivity is sporadic. Furthermore, the complexity of such mechanisms may dissuade node participation so strongly that potential attacker impacts are dwarfed by the loss of contributing participants. In this paper, we use connectivity traces from our UMass DieselNet project and the Haggle project to quantify routing attack effectiveness on a DTN that lacks security. We introduce plausible attackers and attack modalities and provide complexity results for the strongest of attackers. We show that the same routing with packet replication used to provide robustness in the face of unpredictable mobility allows the network to gracefully survive attacks. In the case of the most effective attack, acknowledgment counterfeiting, we show a straightforward defense that uses cryptographic hashes but not a central authority. We conclude that disruption-tolerant networks are extremely robust to attack; in our trace-driven evaluations, an attacker that has compromised 30% of all nodes reduces delivery rates from 70% to 55%, and to 20% with knowledge of future events. By comparison, contemporaneously connected networks are significantly more fragile. },
    Address = {Montreal, Quebec, Canada},
    Author = {Burgess, John and Bissias, George and Corner, Mark D. and Levine, Brian Neil},
    Booktitle = {Proc. ACM International Symposium on Mobile Ad hoc Networking and Computing (MobiHoc)},
    Keywords = {DTN; wireless; security; routing; DOME},
    Month = {September},
    Pages = {61--70},
    Slides_Url = {http://forensics.umass.edu/pubs/mcorner/mobihoc07.ppt},
    Sponsors = {CNS-0133055, CNS-0519881, and CNS 0447877},
    Title = {{Surviving Attacks on Disruption-Tolerant Networks without Authentication}},
    Traces_Url = {http://traces.cs.umass.edu},
    Url = {http://forensics.umass.edu/pubs/burgess.mobihoc.2007.pdf},
    Year = {2007}}

    [link][PDF]
  • @inproceedings{Balasubramanian:2007a,
    Author = {Balasubramanian, Aruna and Levine, Brian Neil and Venkataramani, Arun},
    Booktitle = {Proc. ACM SIGCOMM},
    Keywords = {DTN; routing; wireless;DOME},
    Month = {August},
    Pages = {373--384},
    Slides_Url = {http://forensics.umass.edu/pubs/slides/balasubramanian.sigcomm.2007.ppt.pdf},
    Sponsors = {NSF-0133055 and CNS-0519881},
    Title = {{DTN Routing as a Resource Allocation Problem}},
    Traces_Url = {http://traces.cs.umass.edu},
    Url = {http://forensics.umass.edu/pubs/balasubramanian.sigcomm.2007.pdf},
    Year = {2007}}

    [link][PDF]
  • @inproceedings{Liberatore:2006aMaximizing,
    Abstract = {Devices in disruption tolerant networks (DTNs) must be able to communicate robustly in the face of short and infrequent connection opportunities. Unfortunately, one of the most inexpensive, energy-efficient and widely deployed peer-to-peer capable radios, Bluetooth, is not well-suited for use in a DTN. Bluetooth's half-duplex process of neighbor discovery can take tens of seconds to complete between two mutually undiscovered radios. This delay can be larger than the time that mobile nodes can be expected to remain in range, resulting in a missed opportunity and lower overall performance in a DTN. This paper proposes a simple, cost effective, and high performance modification to mobile nodes to dramatically reduce this delay: the addition of a second Bluetooth radio. We showed through analysis and simulation that this dual radio technique improves both connection frequency and duration. Moreover, despite powering two radios simultaneously, nodes using dual radios are more energy efficient, spending less energy on average per second of data transferred.},
    Author = {Liberatore, Marc and Levine, Brian Neil and Barakat, Chadi},
    Booktitle = {Proc. ACM Conference on Future Networking Technologies (CoNext)},
    Keywords = {DTN; wireless; MAC Protocols; DOME},
    Month = {December},
    Presentation_Url = {http://forensics.umass.edu/pubs/slides/chadi.conext.2006.pdf},
    Sponsors = {NSF-0519881 and NSF-0133055 and NSF-0325868 and W15P7T-05-C-P213},
    Title = {{Maximizing Transfer Opportunities in Bluetooth DTNs}},
    Url = {http://forensics.umass.edu/pubs/liberatore.conext.2006.pdf},
    Year = {2006}}

    [link][PDF]
  • @inproceedings{Zhao:2006,
    Abstract = {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.},
    Author = {Zhao, Wenrui and Chen, Yang and Ammar, Mostafa and Corner, Mark D. and Levine, Brian Neil and Zegura, Ellen},
    Booktitle = {Proceedings of IEEE International Conf on Mobile Ad hoc and Sensor Systems (MASS)},
    Keywords = {DTN; wireless; DOME},
    Month = {October},
    Pages = {31-40},
    Presentation_Url = {http://forensics.umass.edu/pubs/slides/chen.mass.2006.pdf},
    Sponsors = {NSF-0519784 and NSF-0519881 and W15P7T-05-C-P213},
    Title = {{Capacity Enhancement using Throwboxes in DTNs}},
    Url = {http://forensics.umass.edu/pubs/mcorner/mass06.pdf},
    Year = {2006}}

    [link][PDF]
  • @inproceedings{Partan:2006,
    Author = {Partan, James W. and Kurose, Jim and Levine, Brian Neil},
    Booktitle = {Proc. ACM International Workshop on UnderWater Networks (WUWNet)},
    Keywords = {DTN; underwater; wireless; DOME},
    Month = {September},
    Pages = {17--24},
    Presentation_Url = {http://forensics.umass.edu/pubs/slides/Partan_WUWNet_2006.pdf},
    Sponsors = {CNS-0519881 and N00014-05-G-0106-0008},
    Title = {{A Survey of Practical Issues in Underwater Networks}},
    Url = {http://forensics.umass.edu/pubs/partan.wuwnet2006.pdf},
    Year = {2006}}

    [link][PDF]
  • @inproceedings{Piro:2006,
    Abstract = {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.},
    Author = {Piro, Chris and Shields, Clay and Brian Neil Levine},
    Booktitle = {Proc. IEEE/ACM International Conference on Security and Privacy in Communication Networks (SecureComm)},
    Keywords = {security; Sybil attack; wireless},
    Month = {August},
    Pages = {1--11},
    Sponsors = {NSF-0133055 and NSF-0534618 and NSF-0087639},
    Title = {{Detecting the Sybil Attack in Ad hoc Networks}},
    Url = {http://forensics.umass.edu/pubs/piro.securecomm2006.pdf},
    Year = {2006}}

    [link][PDF]
  • @inproceedings{Burns:2006,
    Abstract = {Mobile robots have successfully solved many real world problems. In the following we present the use of mobile robots to address the novel and challenging problem of providing disruption tolerant network service. In disruption tolerant networks, all messages are transported by the physical motion of participants in the network. When these movements do not meet the service demands of the network, network performance can only be improved by adding robots that provide additional network service. The task of controlling such robots is a problem that is NP-Hard. To develop an approximate solution, we propose a nullspace-based algorithm for controlling the motion of the added robots. This controller simultaneously optimizes multiple network performance metrics. Experiments that simulate the addition of robots to a real-world disruption tolerant network show that the introduction of mobile robots running our control scheme can significantly improve the performance and service guarantees of a disruption tolerant network.},
    Author = {Burns, Brendan and Brock, Oliver and Levine, Brian Neil},
    Booktitle = {Proc. IEEE International Conference on Robotics and Automation},
    Keywords = {DTN; wireless; routing; DOME},
    Month = {May},
    Pages = {2105--2110},
    Sponsors = {NSF-0519881 and NSF-0080199},
    Title = {{Autonomous Enhancement of Disruption Tolerant Networks}},
    Url = {http://forensics.umass.edu/pubs/bburns.icra2006.pdf},
    Year = {2006}}

    [link][PDF]
  • @inproceedings{Burgess:2006,
    Annote = {Disruption-tolerant networks (DTNs) attempt to route network messages via intermittently connected nodes. Routing in such environments is difficult because peers have little information about the state of the partitioned network and transfer opportunities between peers are of limited duration. In this paper, we propose MaxProp, a protocol for effective routing of DTN messages. MaxProp is based on prioritizing both the schedule of packets transmitted to other peers and the schedule of packets to be dropped. These priorities are based on the path likelihoods to peers according to historical data and also on several complementary mechanisms, including acknowledgments, a head-start for new packets, and lists of previous intermediaries. Our evaluations show that MaxProp performs better than protocols that have access to an oracle that knows the schedule of meetings between peers. Our evaluations are based on 60 days of traces from a real DTN network we have deployed on 30 buses. Our network, called UMassDieselNet, serves a large geographic area between five colleges. We also evaluate MaxProp on simulated topologies and show it performs well in a wide variety of DTN environments. },
    Author = {Burgess, John and Gallagher, Brian and Jensen, David and Levine, Brian Neil},
    Booktitle = {Proc. IEEE INFOCOM},
    Keywords = {DTN; wireless; routing; Synthesis project; DOME},
    Month = {April},
    Sponsors = {C-36-B82-S1 and CNS-0519881 and NSF-0080199},
    Title = {{MaxProp: Routing for Vehicle-Based Disruption-Tolerant Networks}},
    Traces_Url = {http://traces.cs.umass.edu},
    Url = {http://forensics.umass.edu/pubs/burgess.infocom2006.pdf},
    Year = {2006}}

    [link][PDF]
  • @article{Sanzgiri:2005,
    Abstract = {Initial work in ad hoc routing has considered only the problem of providing efficient mechanisms for finding paths in very dynamic networks, without considering security. Because of this, there are a number of attacks that can be used to manipulate the routing in an ad hoc network. In this paper, we describe these threats, specifically showing their effects on AODV and DSR. Our protocol, named Authenticated Routing for Ad hoc Networks (ARAN), uses public-key cryptographic mechanisms to defeat all identified attacks. We detail 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 authorized to participate. Through both simulation and experimentation with our publicly-available implementation, we characterize and evaluate ARAN and show that it is able to effectively and efficiently discover secure routes within an ad hoc network.},
    Author = {Sanzgiri, Kimaya and Dahill, Bridget and LaFlamme, Daniel and Levine, Brian Neil and Shields, Clay and Belding-Royer, Elizabeth},
    Journal = {IEEE/ACM Journal of Selected Areas in Communications: Special issue on Wireless Ad hoc Networks (JSAC)},
    Keywords = {wireless; security; routing; Journal Paper},
    Month = {March},
    Number = {3},
    Pages = {598--610},
    Sponsors = {NSF-522564 and NSF-0080199 and 2000-DT-CX-K001},
    Title = {{Authenticated Routing for Ad hoc Networks}},
    Url = {http://forensics.umass.edu/pubs/aran_jsac05.pdf},
    Volume = {23},
    Year = {2005}}

    [link][PDF]
  • @inproceedings{Burns:2005,
    Abstract = {Disruption-Tolerant networks (DTNs) differ from other types of networks in that capacity is exclusively created by the movements of participants. This implies that understanding and influencing the participants' motions can have a significant impact on network performance. In this paper, we introduce the routing protocol MV, which learns structure in the movement patterns of network participants and uses it to enable informed message passing. We also propose the introduction of autonomous agents as additional participants in DTNs. These agents adapt their movements in response to variations in network capacity and demand. We use multi-objective control methods from robotics to generate motions capable of optimizing multiple network performance metrics simultaneously. We present experimental evidence that these strategies, individually and in conjunction, result in significant performance improvements in DTNs.},
    Author = {Burns, Brendan and Brock, Oliver and Levine, Brian Neil},
    Booktitle = {Proc. IEEE INFOCOM},
    Keywords = {routing; DTN;wireless; Synthesis project; DOME},
    Month = {March},
    Pages = {398--408},
    Sponsors = {NSF-0133055 and NSF-0080199},
    Title = {{\emph{MV} Routing and Capacity Building in Disruption Tolerant Networks}},
    Url = {http://forensics.umass.edu/pubs/bburns.infocom.2005.pdf},
    Year = {2005}}

    [link][PDF]
  • @article{Arnold:2004,
    Author = {Arnold, Jeffrey and Levine, Brian Neil and Manmatha, R. and Lee, F. and Shenoy, Prashant and Tsai, M.-C. and Ibrahim, T.K. and OBrien, D. and Walsh, D.A.},
    Journal = {Journal of Prehospital and Disaster Medicine},
    Keywords = {wireless; peer-to-peer; DTN; Journal Paper; DOME},
    Month = {July},
    Number = 3, Pages = {201--207},
    Title = {{Information Sharing in Out-of-Hospital Disaster Response: The Future Role of Information Technology}},
    Url = {https://www.ncbi.nlm.nih.gov/pubmed/15571195},
    Volume = {19},
    Year = {2004}}

    [link][PDF]
  • @inproceedings{Hanna:2003,
    Abstract = {We propose and evaluate a mobile, peer-to-peer Information Retrieval system. Such a system can, for example, support medical care in a disaster by allowing access to a large collections of medical literature. In our system, documents in a collection are replicated in an overlapping manner at mobile peers. This provides resilience in the face of node failures, malicious attacks, and network partitions. We show that our design manages the randomness of node mobility. Although nodes contact only direct neighbors (who change frequently) and do not use any ad hoc routing, the system maintains good IR performance. This makes our design applicable to mobility situations where routing partitions are common. Our evaluation shows that our scheme provides significant savings in network costs, and increased access to information over ad-hoc routing-based approaches; nodes in our system require only a modest amount of additional storage on average.},
    Author = {Hanna, Katrina M. and Levine, Brian Neil and Manmatha, R.},
    Booktitle = {Proc. IEEE Intl. Conference on Network Protocols (ICNP)},
    Keywords = {routing; DTN; wireless; Synthesis project; information retrieval; DOME},
    Month = {November},
    Pages = {38--47},
    Presentation_Url = {http://forensics.umass.edu/pubs/slides/hanna.p2pir.icnp_2003.pdf},
    Sponsors = {NSF-0133055 and NSF-9983215 and NSF-0080199},
    Title = {{Mobile Distributed Information Retrieval For Highly Partitioned Networks}},
    Url = {http://forensics.umass.edu/pubs/hanna.icnp03.pdf},
    Year = {2003}}

    [link][PDF]
  • @inproceedings{Sanzgiri:2002,
    Author = {Sanzgiri, Kimaya and Dahill, Bridget and Levine, Brian Neil and Shields, Clay and Belding-Royer, Elizabeth},
    Booktitle = {Proc. of IEEE International Conference on Network Protocols (ICNP)},
    Keywords = {security; wireless; routing},
    Month = {November},
    Pages = {78--89},
    Title = {{A Secure Routing Protocol for Ad hoc Networks}},
    Url = {http://forensics.umass.edu/pubs/aran.icnp02.pdf},
    Year = {2002}}

    [link][PDF]
  • @inproceedings{Davis:2001,
    Author = {Davis, James and Fagg, Andy and Levine, Brian Neil},
    Booktitle = {Proc.~IEEE Intl. Symp on Wearable Computers (ISWC)},
    Keywords = {wireless; DTN; routing; Synthesis project; DOME},
    Month = {October},
    Pages = {141--148},
    Title = {{Wearable Computers and Packet Transport Mechanisms in Highly Partitioned Ad hoc Networks}},
    Url = {http://forensics.umass.edu/pubs/iswc01_pednet.pdf},
    Year = {2001}}

    [link][PDF]
 

Keywords

  • Wireless
  • Security
  • Peer-to-Peer
  • Multicast

    • sub-keywords:
  • Forensics
  • Privacy/Anonymity
  • DTNs
  • Routing
  • Gaming
  • Underwater
  • Sybil attack
  • Synthesis [about]
    		•
  • 2013
  • 2012
  • 2011
  • 2010
  • 2009
  • 2008
  • 2007
  • 2006
  • 2005
  • 2004
  • 2003
  • 2002
  • 2001
  • 2000
  • 1999
  • 1998
  • 1997
  • 1996