@article{ding04:_peer_to_peer_file_sharin,
title={Peer-to-peer file-sharing over mobile ad hoc networks},
author={Ding, G. and Bharat Bhargava},
journal={Pervasive Computing and Communications Workshops,
                  2004. Proceedings of the Second IEEE Annual
                  Conference on},
year={14-17 March 2004},
pages={ 104-108},
doi={10.1109/PERCOMW.2004.1276914},
annote = {A peer-to-peer file system designed to take advantage of
                  properties of ad hoc mobile networks. Claims that
                  there is significant overhead needed to maintain
                  links. Orion solves this by using the network's
                  routing messages to deliver queries as well as
                  discover the topology of the network.}
}

@ARTICLE{ding04:_peer_to_peer_file_sharin,
title={Peer-to-peer file-sharing over mobile ad hoc networks},
author={Ding, G. and Bharat Bhargava},
journal={Pervasive Computing and Communications Workshops,
                  2004. Proceedings of the Second IEEE Annual
                  Conference on},
year={14-17 March 2004},
pages={ 104-108},
keywords={ ad hoc networks, communication complexity, file organisation, mobile computing, routing protocols, wireless LAN cross-layer protocols, mobile ad hoc networks, multihop wireless communications, peer-to-peer file-sharing, routing protocol},
doi={10.1109/PERCOMW.2004.1276914},
annote = {Builds on the Orion paper, using a DHT for routing as well as content search}
}

@inproceedings{hu03:_exploit_syner_between_peer_to,
 author = {Y. Charlie Hu and Saumitra M. Das and Himabindu Pucha},
 title = {Exploiting the synergy between peer-to-peer and mobile ad
                  hoc networks},
 booktitle = {HOTOS'03: Proceedings of the 9th conference on Hot
                  Topics in Operating Systems},
 year = 2003,
 pages = {7--7},
 location = {Lihue, Hawaii},
 publisher = {USENIX Association},
 address = {Berkeley, CA, USA},
 annote = {DPSR (Dynamic P2P Source Routing). Cross layer DHT used
                  both for on-demand routing and content distribution
                  limits the number of routes a node needs to discover
                  to O(log N).}
}


@article{papadopouli00:_seven_degrees_of_separ_in,
title={Seven degrees of separation in mobile ad hoc networks},
author={Papadopouli, M. and Schulzrinne, H.},
journal={Global Telecommunications Conference, 2000. GLOBECOM '00. IEEE},
year=2000,
volume=3,
pages={1707-1711 vol.3},
doi={10.1109/GLOCOM.2000.891928},
annote = {7DS. An architecture for sharing data among peers that are
                  intermittently connected to wireless. Implemented on
                  laptops.}
}

@ARTICLE{klemm03:_special_purpos_peer_to_peer,
title={A special-purpose peer-to-peer file sharing system for mobile ad hoc networks},
author={Klemm, A. and Lindemann, C. and Waldhorst, O.P.},
journal={Vehicular Technology Conference, 2003. VTC 2003-Fall. 2003 IEEE 58th},
year={6-9 Oct. 2003},
volume=4,
pages={ 2758-2763 Vol.4},
doi={10.1109/VETECF.2003.1286080},
ISSN={1090-3038 },
annote = {Orion. A on-demand routing protocol designed for
                  peer-to-peer file sharing on a MANet. Messages for
                  the peer-to-peer system are piggy-backed on routing
                  messages. Peers in the ad hoc network are discovered
                  in the process of searching for content.}
}

@misc{squid,
title={Squid: Optimizing Web Delivery},
author={http://www.squid-cache.org/}
}