1.9 A home on the Internet — Ludovic Courtès — Mobile Computing, Ad Hoc Networks and Their Applications
  • A Quantitative Analysis of Power Consumption for Location-Aware Applications on Smart Phones [anand07:power]
    Arjun Anand, Constantine Manikopoulos, Quentin Jones, Cristian Borcea (New Jersey's Science and Technology University), Proceedings of the IEEE International Symposium on Industrial Electronics, 2007

    To appear. Characterizes overall smart phone consumption, including Bluetooth, Wi-Fi, GSM, and CPU consumption resulting from location computation. Most of the ``measurements'' seem to be based on instantaneous measures provided by the WinCE GUI tools... Not very reliable I guess.

  • Ubiquitous Networks with a Secure Provision of Services, Access, and Content Delivery [ubisec05:ubisec]
    The UbiSec Project, 2005

    Features Java (L)GPL implementations of various service discovery (SD) mechanisms for mobile and ad hoc networks (MANET).

  • Efficient Resource Discovery in Wireless Ad Hoc Networks: Contacts Do Help [helmy04:efficient]
    Ahmed Helmy (Department of Electrical Engineering University of Southern California, USA), Resource Management in Wireless Networking, May 2004

    This chapter is a complete summary of existing resource discovery protocols for wireless infrastructure-less networks as well as an evaluation of TRANSFER, a contact-based resource discovery protocol. Solutions range from flooding-based approached where discovery requests are broadcasted to the network (with various techniques to avoid unnecessary re-transmissions, such as setting a hop limit, message counting, probabilistic re-transmission based on estimates of the network coverage gain), to caching techniques as in on-demand ad hoc routing (which makes me think of how CFS caches responses along the request path), hierarchical approaches (similar to Liedtke's clans & chiefs) and hybrid approaches (such as zone routing protocols, where border-casting is performed inter-zone, while link-state is used intra-zone). Finally, in contact-based approaches (like CARD) each node keeps track of other nodes available within r hops, and uses contacts (nodes within R hops of a border node) as short-cuts.

  • Mesh Networking in OLPC [olpc07:mesh]
    One Laptop Per Child Project, 2007

    Details about the (hardware-level) mesh networking capabilities of OLPC's laptop.

  • RFC3561 -- Ad hoc On-Demand Distance Vector (AODV) Routing [perkins03:aodv-rfc]
    Charles E. Perkins, Elizabeth M. Belding-Royer, Samir R. Das (Internet Engineering Task Force), July 2003
  • Investigating the Energy Consumption of a Wireless Network Interface in an Ad Hoc Networking Environment [feeney01:investigating]
    Laura Marie Feeney, Martin Nilsson (Swedish Institute of Computer Science in Kista, Sweden), Proceedings of the 20th IEEE Conference on Computer Communications (IEEE InfoCom), April 2001

    A study similar in spirit but more recent and more detailed than stemm97:power. The authors measure the consumption of 802.11b wireless card (only 2 Mbps or 11 Mbps). Interesting conclusions include:

    • The "energy consumption of receiving and discarding traffic is both substantial and disproportional to the number of packets or bytes transmitted. This emphasizes the differences between broadcast and point-to-point traffic."
    • The "fixed overhead cost of sending or receiving a packet is relatively high, while the incremental cost of data is relatively low. This makes the mix of packet sizes associated with a protocol an important energy consumption behavior."
    • Transmission rate has little impact on energy costs (only the incremental cost is affected, and it is much lower than the fixed overhead).

  • Enforcing Service Availability in Mobile Ad-Hoc WANs [buttyan00:enforcing]
    Levente Butty?n, Jean-Pierre Hubaux (Swiss Federal Institute of Technology, EPFL-DSC-ICA, CH-1015 Lausanne, Switzerland), Proceedings of the First ACM International Symposium on Mobile Ad Hoc Networking & Computing, 2000

    The authors propose ``cooperation enforcement'' through the use of a so-called ``tamper-resistant security module''. For instance, security modules encrypt communication between them because "[they] cannot communicate directly but only through their hosting terminodes, which are under the control of (potentially malicious) users". This is another way to say "we protect users from what they want", and such techniques question device ownership (remote attestation also raises this threat). I believe cooperation cannot be enforced in real-life: it can only be promoted or made easier, beneficial, etc. Imposing a ``security module'' effectively yields a ``single-authority domain'', in which context cooperation can indeed be enforced, because users cannot decide otherwise.

  • Reducing Energy Consumption on Mobile Devices with WiFi Interfaces [zhang05:reducing]
    Tao Zhang, Sunil Madhani, Provin Gurung, Eric van den Berg (Telcordia Technologies, Piscataway, NJ, USA), Proceedings of the IEEE Global Telecommunications Conference (Globecom), December 2005

    The authors propose a prediction-based mechanism to reduce energy consumption of Wi-Fi interfaces, without changing upper layer protocols. The idea is to predict ``silence periods'' and to shut down the network interface during the predicted silence periods.

  • The Quest for Security in Mobile Ad Hoc Networks [hubaux01:quest]
    Jean-Pierre Hubaux, Levente Buttyan, Srdan Capkun (Institute for Computer Communications and Applications, Swiss Federal Institute of Technology, Lausanne, Switzerland), Proceedings of the 2nd ACM International Symposium on Mobile Ad Hoc Networking & Computing, October 2001

    This paper presents a way to establish identity certification (or authenticity) in an ad-hoc network, in a purely decentralized, peer-to-peer way. The idea is to rely on a PGP-like web of trust. However, instead of using a central certificate directory (as in the PGP case), each participant maintains its own certificate repository. The authors propose a subgraph selection algorithm, called Shortcut Hunter, such that the subgraph it produces maximizes the ability to reconstruct a path of the full web of trust by merging two such subgraphs from different users (see also granovetter73:strength for a sociological study of those ``shortcuts''). While the results look promising, the algorithm makes at least two undesirable assumptions:

    • it is assumed that all users run the same subgraph selection algorithm;
    • most importantly, the algorithm "requires that each user is notified whenever another user issues a certificate to her".
    The latter does not seem reasonable in the framework of an ad hoc network, or more generally, in a network where nodes have no prior trust relationship (one can rely on others good behavior). See also capkun02:sw-pgp for an analysis of the small-world properties found in the PGP web of trust. For more information, refer to the ``Key Management in Decentralized Wireless Networks'' project at EPFL.

  • The Bayou Architecture: Support for Data Sharing Among Mobile Users [demers94:bayou]
    Alan Demers, Karin Petersen, Mike Spreitzer, Douglas Terry, Marvin Theimer, Brent Welch (Xerox Palo Alto Research Center, CA, USA), Proceedings of the Workshop on Mobile Computing Systems and Applications, December 1994

    Bayou aims to provide a loosely connected read-write file system with (potentially) multiple writers. Unlike Coda which uses a client/server model, Bayou has a ``peer-to-peer'' approach to data storage: each client may store replicas of data items, and modify them locally without requiring coordination with other devices storing it. The mobile context led the authors to opt for a weak consistency model, with eventual replica reconciliation. In fact, the goals described match those of distributed revision control systems such as GNU Arch lord05:gnu-arch and Git hamano06:git.

  • Device discovery and power management in embedded systems [gibson03:discovery]
    David W. Gibson, Linux Symposium 2003 Proceedings, 2003
  • Practical Robust Localization over Large-Scale 802.11 Wireless Networks [haeberlen04:localization]
    Andreas Haeberlen and Eliot Flannery and Andrew M. Ladd and Algis Rudys and Dan S. Wallach and Lydia E. Kavraki, Proceedings of the Tenth ACM International Conference on Mobile Computing and Networking (MOBICOM), Sep 2002

    to appear

  • Dependable and Secure Distributed Storage System for Ad Hoc Networks [ball07:dependable]
    Rudi Ball, James Grant, Jonathan So, Victoria Spurrett, Rog?rio de Lemos (University of Kent, UK), Proceedings of the International Conference on Ad-Hoc, Mobile, and Wireless Networks (ADHOC-NOW), September 2007

    Simulation results of different fragmentation-redundancy-scattering (FRS) techniques for mobile distributed storage deswarte91:intrusion. One proposed replication strategy is based on replication ants, which are agents that travel around the set of nodes to help scatter replicas.

  • A Replicated File System for Resource Constrained Mobile Devices [barreto04:replicated]
    Jo?o Barreto, Paulo Ferreira, Proceedings of the IADIS International Conference on Applied Computing, March 2004

    The document presents Haddock-FS, a replicated file system geared towards cooperative applications such as cooperative document editing in a meeting. In such situations, the goal is to offer relatively strong consistency guarantees, unlike in systems like Bayou demers94:bayou. The overall architecture is ``server-less'' (or ``peer-to-peer''). It addresses conflicts resulting from concurrent update through reconciliation. A primary replica acts as a ``master'' and is responsible for selecting new ``stable updates'' based on the available ``tentative updates'': in other words, the primary replica commits updates that are to be replayed at the secondary replicas. Thus, the approach is not fully peer-to-peer as a consensus must be reached and the decision process leading to the consensus is made by a single node. Haddock-FS uses content-based indexing and content-based chopping manber94:finding as in LBFS muthitacharoen01:lbfs and others. Haddock-FS is quite similar to AdHocFS boulkenafed03:adhocfs, but also looks simpler: it does not assign a special role to some ``home server'' and does not rely on group membership.

  • Service Discovery and Name Resolution Architectures for On-Demand MANETs [engelstad03:discovery]
    Paal Engelstad, Yan Zheng, Tore J?nvik, Do Van Thanh (University of Oslo, Norway), Proceedings of the International Conference on Distributed Computing Systems Workshops, May 2003

    Some sort of a DNS-SD for on-demand routed MANETs.

  • Fundamental Challenges in Mobile Computing [satyanarayanan96:challenges]
    M. Satyanarayanan (Carnegie Mellon University, USA), Proceedings of the Fifteenth ACM Symposium on Principles of Distributed Computing, May 1996

    Good background paper with a focus on distributed file systems, by a member of the Coda and Odyssey teams at CMU.

  • ANSI/IEEE Std 802.11---Part 11: Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications [ieee99:802.11]
    IEEE-SA Standards Board, 1999
  • CORTEX: Towards Supporting Autonomous and Cooperating Sentient Entities [verissimo02:cortex]
    Ver P. and Cahill, V. and Casimiro, A. and Cheverst, K. and Friday, A. and Kaiser, J., Proceedings of European Wireless 2002, Feb 2002
  • MultiNet: Connecting to Multiple IEEE 802.11 Networks Using a Single Wireless Card [chandra04:multinet]
    Ranveer Chandra, Paramvir Bahl, Pradeep Bahl (Cornell University, NY, USA), Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies, March 2004

    The authors propose a mechanism to virtualize a Wi-Fi networking interface through some adaptation of the driver, thereby allowing the connection to several networks with a single Wi-Fi card. The thing, now calle VirtualWifi, is distributed by Microsoft Research under the Shared Source licence (MR-SSLA).

  • Architecture and Evaluation of an Unplanned 802.11b Mesh Network [bicket05:roofnet]
    John Bicket, Daniel Aguayo, Sanjit Biswas, Robert Morris (MIT Computer Science and Artificial Intelligence Laboratory, MA, USA), Proceedings of the International Conference on Mobile Computing and Networking (MobiCom), 2005

    About MIT's wireless community network, Roofnet.

  • SyD: A Middleware Testbed for Collaborative Applications over Small Heterogeneous Devices and Data Stores [prasad04:syd]
    Suskil K. Prasad et al. (Georgia State University, Georgia Institute of Technology, USA), Proceedings of the International Middleware Conference, October 2004

    This paper seemed appealing at first. Right after reading the abstract, I took my web browser and jumped to the URL they mention where one can get "middleware and demo application codes" according to the paper. Once I had fixed up their hyperlinks (they used backslashes instead of slashes...), I managed to get two zip files, presumably containing the source code for these interesting things. Well, I was disappointed when I discovered they only contained Java bytecode. (To be continued)

  • Protocol for Peer-to-Peer Networking in Mobile Environments [schollmeier03:mpp]
    R?diger Schollmeier, Ingo Gruber, Florian Niethammer (Technische Universit?t M?nchen, Germany; Definion GmbH, Germany), Proceedings of the Twelfth International Conference on Computer Communications and Networks, October 2003

    Describes the Mobile Peer-to-Peer Protocol (MPP).

  • Efficient Content Location in Wireless Ad Hoc Networks [tchakarov04:efficient]
    Jivodar B. Tchakarov, Nitin H. Vaidya (University of Illinois at Urbana-Champaign, USA), Proceedings of the IEEE International Conference on Mobile Data Management (MDM`04), January 2004
  • RFC 3927 -- Dynamic Configuration of IPv4 Link-Local Addresses [ietf05:ipv4-link-local]
    S. Cheshire, B. Adoba, E. Guttman (Internet Engineering Task Force (IETF)), May 2005

    On automatic configuration of link-local IPv4 addresses in the 169.254/16 prefix. Useful for IEEE 802.11 ad hoc networks.

  • Seven Degrees of Separation in Mobile Ad Hoc Networks [papdopouli00:7ds]
    Maria Papadopouli, Henning Schulzrinne (Columbia University, USA), IEEE Conference on Global Communications (GLOBECOM), November 2000

    Kept for backward compatibility. See papadopouli00:7ds instead.

  • A Special-Purpose Peer-to-Peer File Sharing System for Mobile Ad Hoc Networks [klemm03:p2p-file-sharing]
    Alexander Klemm, Christoph Lindemann, Oliver P. Waldhorst (University of Dortmund, Germany), Proceedings of the 58th Vehicular Technology Conference, October 2003

    Describes ORION.

  • The Hybrid Chord Protocol: A Peer-to-Peer Lookup Service for Context-Aware Mobile Applications [zols05:hcp]
    Stefan Z?ls, R?diger Schollmeier, Wolfgang Kellerer, Anthony Tarlano (Technical University of Munich, Germany; DoCoMo Communications Laboratories Europe, Germany), Proceedings of the International Conference on Networking, 2005
  • Energy-Efficiency and Storage Flexibility in the Blue File System [nightingale04:energy]
    Edmund B. Nightingale, Jason Flinn (Department of Electrical Engineering and Computer Science, University of Michigan, USA), Proceedings of the Sixth Symposium on Operating Systems Design and Implementation (OSDI`04), December 2004

    BlueFS is a read/write distributed file system that uses a so-called read from any, write to many data access model. However, BlueFS nodes are really clients caching data obtained from a file server, and where "Client and portable storage devices store second-class replicas that are used only to improve performance and reduce energy usage". Inconsistencies among replicas are handled, as usual through automatic or manual reconciliation. Selection of nodes to read from and to write to is made based on the expected performance and energy cost. This peer selection process is not unlike that of Flashback loo03:backup-pan and that of OmniStore karypidis05:exploiting.

  • The Avahi DNS-SD/mDNS Free Implementation [poettering06:avahi]
    Lennart Poettering, 2006

    The Avahi DNS-SD/mDNS free implementation.

  • Exploiting Weak Connectivity for Mobile File Access [mummert95:exploiting]
    Lily B. Mummert, Maria R. Ebling, Mahadev Satyanarayanan (Carnegie Mellon University, USA), Proceedings of the Fifteenth ACM Symposium on Operating Systems Principles, 1995
  • Reducing Power Consumption of Network Interfaces in Hand-Held Devices [stemm97:power]
    Mark Stemm, Paul Gauthier, Daishi Harada, Randy H. Katz (University of California at Berkeley, Berkeley, CA, USA), appeared in IEEE Transactions on Communications, August 1997

    Measurements on pre-IEEE 802.11 wireless cards showing ``that the power drained by the network interface constitutes a large fraction of the total power used by the PDA.''

  • Optimized Link State Routing Protocol (RFC 3626) [clausen03:olsr-rfc]
    Thomas Heide Clausen, Philippe Jacquet (INRIA Rocquencourt, France), October 2003
  • Simple Service Discovery Protocol/1.0 Operating without an Arbiter [goland99:ssdp]
    Yaron Y. Goland, Ting Cai, Paul Leach, Ye Gu, Shivaun Albright (Internet Engineering Task Force (IETF)), October 1999

    The service discovery protocol that is used in UPnP. This is draft that never made it as a standard.

  • FEW: File Management for Portable Devices [preguica05:few]
    Nuno Preguica, Carlos Baquero, J. Legatheaux Martins, Marc Shapiro, Paulo S?rgio Almeida, Henrique Domingos, Victor Fonte, S?rgio Duarte, Proceedings of the International Workshop on Software Support for Portable Storage, March 2005

    FEW stands for ``Files EveryWhere''. As the name implies, the goal is to provide ubiquitous data access by using optimistic replication among portable communicating storage devices. Although the authors do not explicitly state it, replication is to be made among trusted devices, e.g., devices all belonging to the same person, or devices belonging to people in the same working group. The idea is to have users create file containers grouping inter-dependent files (e.g., C source and header files of a given program), or to have FEW itself populate containers based on file access patterns (i.e., FEW would guess which files are closely related based on how/when they are accessed). Such containers would then be replicated on neighboring devices. When access to a container is requested, the container can be lazily fetched if it is not already available locally. The authors intend to monitor file system access by using a stackable file system like FiST. Besides, the paper focuses mostly on update propagation and replica reconciliation. They propose to keep track of the "causal history of update events that have been incorporated in a replica state", which is not unlike GNU Arch's patch logs and similar mechanisms. This would allow the implementation of operation-based update propagation: each replica only replays the required operations listed in a log. They propose the use of type-specific diff algorithms, like regular line-oriented diff for text files and structured diff ? la XyDiff cobena02:xydiff for XML documents. Finally, they propose the use of three-way merging to implement replica reconciliation. All these ideas are actually pretty familiar in the area of distributed revision control systems.

  • Wireless Community Networks [jain03:community]
    Saurabh Jain, Dharma P. Agrawal (University of Cincinnati, USA), appeared in IEEE Computer, August 2003
  • Operation-based Update Propagation in a Mobile File System [lee99:update]
    Yui-Wah Lee, Kwong-Sak Leung, Mahadev Satyanarayanan (The Chinese University of Hong Kong, China; Carnegie Mellon University, USA), Proceedings of the USENIX Annual Technical Conference, June 1999
  • A Peer-to-Peer File Sharing System for Wireless Ad-Hoc Networks [sozer04:peer-to-peer]
    Hasan S?zer, Metin Tekkalmaz, Ibrahim K?rpeoglu (Bilkent University, Ankara, Turkey), Proceedings of the Third Annual Mediterranean Ad Hoc Networking Workshop (MedHoc), June 2004

    Adapts peer-to-peer routing and data storage/replication techniques to the mobile environment.

  • Anonymous Secure Communication in Wireless Mobile Ad-hoc Networks [rahman06:anonymous]
    Sk. Md. Mizanur Rahman, Atsuo Inomata, Takeshi Okamoto, Masahiro Mambo, Eiji Okamoto, Proceedings of the First International Conference on Ubiquitous Convergence Technology, December 2006

    An anonymous on-demand routing protocol for MANETs.

  • Self-Organized Public-Key Management for Mobile Ad Hoc Networks [capkun03:self-organized]
    Srdjan Capkun, Levente Butty?n, Jean-Pierre Hubaux, appeared in IEEE Transactions on Mobile Computing, January 2003

    A followup to hubaux01:quest.

  • Energy-Aware Demand Paging on NAND Flash-Based Embedded Storages [park04:energy-aware]
    Chanik Park, Jeong-Uk Kang, Seon-Yeong Park, Jin-Soo Kim (Memory Division, Samsung Electronics Co., Korea), Proceedings of the International Symposium on Low Power Electronics and Design, 2004

    The author use a simple CPU and memory energy consumption model, based on consumption figures available in data sheets. They use Valgrind's Cachegrind tool to measure the number of memory and cache references of various applications. Based on their memory consumption model, they can estimate the memory consumption of these applications on a given platform.

  • Towards Middleware Services for Mobile Ad-hoc Network Applications [plagemann03:towards]
    Thomas Plagemann, Vera Goebel, Carsten Griwodz, P?l Halvorsen (University of Oslo, Department of Informatics, Norway), Proceedings of the 9th IEEE Workshop on Future Trends of Distributed Computing Systems (FTDCS), May 2003

    This short paper is a position paper regarding the InfoWare project. The project's goal is to build middleware services for information access and sharing in ad hoc networks. Specific requirements of mobile applications are clearly identified: information access/sharing, integration of three classes of information sources (mobile and stationary nodes, gateways), as well as cooperation. The paper contains a concise yet complete review of available solutions for service/resource lookup, data dissemination in a peer-to-peer fashion, data location (DHTs and the likes). It also includes a performance evaluation of existing CORBA implementations on an iPaq.

  • Automatic generation of compact programs and virtual machines for Scheme [latendresse00:vm]
    Mario Latendresse (Department of Computer Science, Rice University, USA), Proceedings of the Workshop on Scheme and Functional Programming, September 2000

    On the use of Scheme-specific virtual machines (? la STklos) as a means to reduce code size and memory footprint of compiled Scheme programs for use in embedded systems.

  • Seven Degrees of Separation in Mobile Ad Hoc Networks [papadopouli00:7ds]
    Maria Papadopouli, Henning Schulzrinne (Columbia University, USA), IEEE Conference on Global Communications (GLOBECOM), November 2000

    The 7DS data sharing system for mobile devices. See papadopouli01:7ds for a detailed discussion and evaluation of the system. 7DS aims at improving data availability for mobile hosts with intermittent Internet connectivity. Mobile nodes act as caches for information available on the Internet. Nodes cache information as they access it through the Internet and then spread cached information on-demand in the ad hoc domain, effectively creating a cooperative cache. In practice, data requests are sent to a multicast address, giving the opportunity for cache contributors to reply. The paper focuses on "how user mobility patterns affect the spread of information".

  • Diensteverwaltung in Ad-Hoc-Netzwerken (Diplomarbeit) [poettering07:diploma]
    Lennart Poettering (Fakult?t f?r Mathematik, Informatik und Naturwissenschaften, Universit?t Hamburg, Germany), April 2007

    The ``diploma thesis'' of Lennart Poettering, the author of Avahi. Describes (in German) its extension of DNS-SD to mesh networks, called Mesh-DNS, and which may be eventually used in OLPC.

  • Exploiting Co-Location History for Efficient Service Selection in Ubiquitous Computing Systems [karypidis05:exploiting]
    Alexandros Karypidis, Spyros Lalis (University of Thessaly, Hellas, Greece), Proceedings of the International Conference on Mobile and Ubiquitous Systems (MobiQuitous), July 2005

    Describes the strategy used by OmniStore karypidis06:omnistore to select peers for cooperation or service provision based on co-location history, i.e., based on how long the peer has been available close to the requester. The authors name this co-location-aware service discovery. The idea is in fact quite similar in spirit to the one used by Flashback loo03:backup-pan.

  • Data Staging on Untrusted Surrogates [flinn03:staging]
    Jason Flinn, Shafeeq Sinnamohideen, Niraj Tolia, Mahadev Satyanarayanan (Carnegie Mellon University, USA), Proceedings of the USENIX Conference on File and Storage Technologies (FAST), March 2003

    This paper describes the implementation of a distributed data caching mechanisms for mobile devices. The idea is that caches local to mobile devices are too small and cannot hold enough data. The authors assume that surrogates, i.e., neighboring mobile devices, available through a single hop, are available and have large storage capacities (why?). Thus, clients are expected to direct caching to those surrogates by contacting a desktop machine called the data pump. Since surrogates are untrusted, the data pump provides client with enough information to eventually decipher data from surrogates and check their integrity. I am a bit skeptical about the availability of such a complicated scenario.

  • Developing Mobile Devices based on Linux [riker03:mobile]
    Tim Riker, Linux Symposium 2003 Proceedings, 2003

    This paper gives an overview of the available more-or-less dedicated software for (GNU/)Linux on PDAs and the likes: uClibc vs. the GNU C library, Busybox, Qtopia and Opie, GPE, and so forth. Nothing very exciting in fact.

  • An Architectural Framework and a Middleware for Cooperating Smart Components [casimiro04:smart]
    Casimiro, A. and Kaiser, J. and Ver P., Proceedings of the First Conference on Computing Frontiers, April 2004
  • JFFS: The Journalling Flash File System [woodhouse01:jffs2]
    David Woodhouse (Red Hat, Inc.), Ottawa Linux Symposium, 2001
  • Supporting Cooperative Caching in Ad Hoc Networks [yin06:cooperative]
    Liangzhong Yin, Guohong Cao (Pennsylvania State University, PA, USA), appeared in IEEE Transactions on Mobile Computing, January 2006
  • A Distributed Data Caching Framework for Mobile Ad Hoc Networks [wang06:distributed]
    Ying-Hong Wang, Chih-Feng Chao, Shih-Wei Lin, Wei-Ting Chen (Tamkang University, Taiwan), Proceeding of the 2006 International Conference on Communications and Mobile Computing, 2006
  • Statistically Unique and Cryptographically Verifiable (SUCV) Identifiers and Addresses [montenegro02:sucv]
    Gabriel Montenegro, Claude Castelluccia, Proceedings of the Network and Distributed System Security Symposium (NDSS), 2002

    SUCVs for use in Mobile IPv6. This is apparently being standardized by the IETF.

  • MoCA: A Middleware for Developing Collaborative Applications for Mobile Users [sacramento04:moca]
    Vagner Sacramento, Markus Endler, Hana K. Rubinsztejn, Luciana S. Lima, Kleder Gon?alves, Fernando N. Nascimento, Giulliano A. Bueno (Departamento de Inform?tica, Pontif?cia Universidade Cat?lica do Rio de Janeiro), appeared in IEEE Distributed Systems Online, October 2004

    MoCA -- the Mobile Collaboration Architecture -- is a middleware for developing and deploying context-aware collaborative applications for mobile users. It comprises client and server APIs, core services for monitoring and inferring the mobile devices' context, and an object-oriented framework for instantiating customized application proxies.
    Proxies in MoCA are a way to decouple functional aspects of collaborative services from non-functional aspects (e.g. minimizing energy consumption, compressing or delaying data that is to be sent to a peer whose wireless connectivity has fallen below a certain threshold).

  • RFC 2608 -- Service Location Protocol, Version 2 [guttman99:rfc2608-slp]
    Erik Guttman, Charles Perkins, John Veizades, Michael Day (Internet Engineering Task Force (IETF)), June 1999

    A service discovery protocol for LANs, competitor of DNS-SD and similar.

  • The Penumbra Broadcast-Based Wireless Network [green07:penumbra]
    Andy Green, January 2007

    A nice project seeking to allow file sharing among neighboring Wi-Fi nodes (e.g., Wi-Fi routers). The idea is to modify the driver so that Penumbra traffic can be broadcast unencrypted alongside regular Wi-Fi traffic. From a technical viewpoint, this bears some similarity with MultiNet chandra04:multinet.

  • Will IEEE 802.15.4 Make Ubiquitous Networking a Reality? A Discussion on a Potential Low Power, Low Bit Rate Standard [zheng04:802.15.4]
    Jianliang Zheng, Myung J. Lee (City College of CUNY, NY, USA), appeared in IEEE Communications Magazine, June 2004

    Overview and advocacy of IEEE 802.11.4 (aka. "ZigBee", although the term "ZigBee" actually refers to IEEE 8020.11.4 plus additional network-layer protocols). 802.15.4 provides low data rates of at most 250 kbps. The maximum output power is typically 1 mW.

  • Service Discovery in Wireless Mesh Networks: a Survey on Candidate Solutions [fernandes07:sd-survey]
    Pedro Fernandes, Rui Rocha (Instituto de Telecomunica??es, Lisboa, Portugal), Proceedings of the International Conference on Telecommunications, May 2007

    Studies the suitability of popular SD protocols such as DNS-SD/mDNS in the context of large-scale mobile ad hoc networks. Concludes (roughly) about their unsuitability ``by design'' to such networks. It does not actually evaluate them, though, so this should be taken with a grain of salt (e.g., see campo06:dns-sd)

  • AdHocFS: Sharing Files in WLANs [boulkenafed03:adhocfs]
    Malika Boulkenafed, Val?rie Issarny, Proceedings of the 2nd International Symposium on Network Computing and Applications, April 2003

    AdHocFS is a distributed file system where mobiles nodes essentially act as a cache for data available at the user's home server. Mobiles nodes are assumed to regularly synchronize with the home server; update conflicts may need reconciliation. AdHocFS also supports collaborative file sharing within ad hoc groups. To that end, a leader is elected among mobile devices that is responsible for merging directory hierarchies and choosing a common one. Other devices then cache that hierarchy. Within a group, write operations are made exclusive through a locking scheme, thereby guaranteeing strong consistency. Still, the authors mention that diverging copies of a file in a group have to be reconciled, which is achieved by tracking ancestor revisions (in particular common reference revisions, i.e., revision fetched from the home server), a technique common in distributed revision control hamano06:git. The authors of Haddock-FS barreto04:replicated note that AdHocFS is still too dependent on the network infrastructure because the home server is where ``stable copies'' are stored. Still, both systems look very similar.

  • DNS-Based Service Discovery [cheshire06:dns-sd-draft]
    Stuart Cheshire, Marc Krochmal (Apple Computer, Inc.), August 2006

    Apple's DNS-based Service Discovery Protocol (DNS-SD), also known as ``Bonjour''. A nice libre LGPL'd implementation is Avahi, which is becoming widely used on GNU/Linux.

  • Wireless Extensions for Linux [tourrilhes97:howto]
    Jean Tourrilhes (Hewlett Packard Laboratories), January 1997
  • Service Discovery using Volunteer Nodes for Pervasive Environments [kim05:vsd]
    Mijeom J. Kim, Mohan Kumar, Behrooz A. Shirazi (University of Texas at Arlington, TX, USA), Proceedings of the International Conference on Pervasive Services (ICPS), July 2005

    Describes VSD, a service discovery for mobile devices using multi-hop wireless ad hoc networks.

  • When Peer-to-Peer comes Face-to-Face: Collaborative Peer-to-Peer Computing in Mobile Ad-hoc Networks [kortuem01:peer-to-peer]
    Gerd Kortuem, Jay Schneider, Dustin Preuitt, Thaddeus G. Cowan Thompson, Stephen Fickas, Zary Segall (Wearable Computing Group, Department of Computer and Information Science, University of Oregon, Eugene, USA), Proceedings of the International Conference on Peer-to-Peer Computing (P2P2001), August 2001

    This paper introduces Proem, "a mobile peer-to-peer platform for collaborative applications", in Java. The design tries to learn as much as possible from "regular" p2p applications by identifying the key differences "regular" p2p networks and p2p systems on ad hoc networks. The authors argue that while "Internet use [...] can result in higher level of depression on loneliness", impromptu peer-to-peer interactions of wearable mobile devices may "promote social relationships among co-located persons". Section 2 describes a number of hilarious scenarios (in my opinion) for impromptu collaboration such as MP3 file sharing (with or without DRM, digital restrictions management) and task trading (buying a book of stamps for your neighbor, etc.). The paper describes technical challenges in mobile p2p systems not present in internet p2p systems that arise from the fact that the latter were designed for a world where "network access is universal, bandwidth is plentiful, processor cycles are inexpensive". The authors state that regular p2p systems heavily rely on IP as the underlying protocol which is wrong as emphasized by ferreira03:transport and that decentralization is an option for regular p2p network -- which does not account for the fact that anonymous networks do need it. The paper then briefly describes the Proem protocols and the Java framework for collaborative mobile applications (similar to JXTA). Proem basically defines a low-level asynchronous message protocol that is used to implement various services such as a presence service; the job of Proem's core (the peerlet engine) is to reify events to each peerlet it is running.

  • Integrating Portable and Distributed Storage [tolia04:integrating]
    Niraj Tolia, Jan Harkes, Mahadev Satyanarayanan (Carnegie Mellon University, USA), Proceedings of the USENIX Conference on File and Storage Technologies, March 2004

    The paper presents lookaside caching, a technique that "allows users to treat devices they carry as merely performance and availability assists for distant file servers". The basic idea is to augment the information provided by stat(2) with the file SHA-1 hash. Thus, mobile devices only need to cache meta-data returned by stat; they can then fetch file contents from neighboring devices opportunistically in a way similar to that found in tolia03:opportunistic. The author still assume a client/server model, where mobile devices are loosely connected clients of some file server, and where a coherency protocol tracks differences between clients and the server.

  • Multicast DNS [cheshire06:mdns-draft]
    Stuart Cheshire, Marc Krochmal (Apple Computer, Inc.), August 2006

    The draft specification of multicast DNS (mDNS).

  • Scalable Service Discovery for MANET [sailhan05:discovery]
    Fran?oise Sailhan, Val?rie Issarny (INRIA Rocquencourt, France), Proceedings of the IEEE International Conference on Pervasive Computing and Communication, March 2005

    Describes the Ariadne mobile ad hoc service discovery protocol, with an LGPL'd Java implementation available. This is part of the UbiSec Project.

  • Using Avahi in Guile Scheme Programs [courtes07:guile-avahi]
    Ludovic Court?s, June 2007

    Guile bindings for Avahi poettering06:avahi.

  • DNS-Based Service Discovery in Ad Hoc Networks: Evaluation and Improvements [campo06:dns-sd]
    Celeste Campo, Carlos Garc?a-Rubio (Universidad Carlos III de Madrid, Spain), Proceedings of the International Conference on Personal Wireless Communications, September 2006

    Compares mDNS cheshire06:mdns-draft and LLMNR (another distributed DNS, started by Microsoft) and evaluates them in the context of ad hoc networks. The authors note that LLMNR is purely reactive, i.e., there's no caching of resource records, so it's much less complex, more accurate (responses are always up-to-date), but also much more bandwidth-consuming than mDNS. The paper concludes that "the one that better fits the requirements of these kinds on environments is Multicast DNS", and proposes four "simple improvements" to improve its efficiency, mostly based on cooperation enhancements.

  • Packet Coding for Strong Anonymity in Ad Hoc Networks [aad06:packet-coding]
    Imad Aad, Claude Castelluccia, Jean-Pierre Hubaux (DoCoMo Euro Labs, Germany), Proceedings of the nternational Conference on Security and Privacy in Communication Networks (Securecomm), August 2006
  • OmniStore: A System for Ubiquitous Personal Storage Management [karypidis06:omnistore]
    Alexandros Karypidis, Spyros Lalis (University of Thessaly, Hellas, Greece), Proceedings of the Annual IEEE International Conference on Pervasive Computing and Communications (PerCom), March 2006

    Proposes a unified data access framework for mobile devices, along with a cooperative backup mechanism. In particular, OmniStore aims to provide transparent data access among devices within a PAN. Modified data is eventually sent to the ``repository'', a stationary machine. The repository keeps all versions of all files and does not address reconciliation via 3-way merge and the likes.

  • Energy Consumption and Conservation in Mobile Peer-to-Peer Systems [gurun06:energy]
    Selim Gurun, Priya Nagpurkar, Ben Y. Zhao ( UC Santa Barbara, CA, USA), Proceedings of the 1st International Workshop on Decentralized Resource Sharing in Mobile Computing and Networking, 2006

    Evaluates the power consumption of a handheld (iPAQ-like) running an overlay network protocol (Chimera). The mobile device is running in 802.11 ad hoc mode (probably with a static IP), with Chimera running over IP on top of it. This setup is questionable in a mobile context, since there appears to be little value in running an overlay network on top of a (multi-hop) ad hoc network. They then compare it with a simple chat client (i.e., application that does not need to maintain an overlay network) and conclude that there is in fact little energy cost involved with the maintenance of the overlay.

(made with skribilo)