Technical Reports

Permanent URI for this collection


Recent Submissions

Now showing 1 - 5 of 23
  • Item
    Distributed Anonymous Computation of Social Distance
    (IEEE, 2016-01-10) Biagioni, Edoardo
    In a distributed social network, no single system holds information about all the individuals in the network, and no single system is trusted by all the individuals in the network. It is nonetheless desirable to reliably compute the social distance among individuals. This must be done anonymously, without giving away any identifying information about individuals in the social network, and reliably, without allowing anyone to pretend to be socially closer to someone else than they actually are. The Social Network Connectivity Algorithm, or SoNCA, ac- complishes these goals in a distributed manner. This paper describes both the high-level algorithm and a concrete design that is intended for future use with a network, AllNet, designed to provide secure interpersonal communication utilizing all avail- able means, including Internet, cellular communications, ad-hoc networking and delay-tolerant networking.
  • Item
    AllNet: using Social Connections to Inform Traffic Prioritization and Resource Allocation
    (, 2012-10) Biagioni, Edoardo
    AllNet is a new networking protocol designed to provide communication utilizing all available means, including Internet and cellular communications, but when these are not available, also ad-hoc networking and delay-tolerant networking. These latter mechanisms are best for low-bandwidth commu- nications. Effective support of low-bandwidth networking needs message prioritization, which can benefit by knowing whether messages are being sent on behalf of someone to whom the owner of the mobile device is socially connected. By keeping track of the social network of each of the friends of the owner of the mobile device, the device can devote its resources to supporting better quality communication among people its owner cares about, and fewer resources to communication among people its owner doesn’t know. AllNet generalizes this notion by anonymously keeping track of friends, friends of friends, friends of friends of friends, and so on. Doing this while using only limited communication and storage is the challenge addressed by the AllNet social network connectivity algorithm described and evaluated in this paper.
  • Item
    Ubiquitous Interpersonal Communication over Ad-Hoc Networks and the Internet
    (, 2013) Biagioni, Edoardo
    The hardware and low-level software in many mobile de- vices are capable of mobile-to-mobile communication, in- cluding ad-hoc mode for 802.11, Bluetooth, and cognitive radios. We have started to leverage this capability to provide in- terpersonal communication both over infrastructure networks (the Internet), and over ad-hoc and delay-tolerant networks composed of the mobile devices themselves. This network is fully decentralized so it can function with- out any infrastructure, but takes advantage of Internet con- nections when available. Devices may communicate when- ever they are able to exchange packets. All interpersonal communication is encrypted and authenticated so packets may be carried by devices belonging to untrusted others. One challenge in a fully decentralized network is rout- ing. Our design uses Rendezvous Points (RPs) and Dis- tributed Hash Tables (DHTs) for delivery over the Internet, and hop-limited broadcast and Delay Tolerant Networking (DTN) within the ad-hoc network. Each device has a policy that determines how many pack- ets may be forwarded, and a packet prioritization mecha- nism that favors packets likely to consume fewer network resources. A goal of this design and implementation is to provide useful interpersonal communications using at most 1% of any given resource on mobile devices.
  • Item
    Mobility and Address Freedom in AllNet
    (, 2014-06-06) Biagioni, Edoardo
    Mobile devices can be addressed through a variety of means. We propose that each device select its own addresses, we motivate this choice, and we describe mechanisms for deliv- ering data using these addresses. Hierarchical point-of-attachment addresses are not effec- tive with mobile devices. The network has to maintain a global mapping between addresses and locations whether or not the address is topological. Since this mapping is needed anyway, there is not much point in having the structure of the address encode device location. Instead, we have designed a network protocol, AllNet, to support self-selected address- ing. When data is transmitted over the Internet, a Distributed Hash Table (DHT) provides a connection between senders and and receivers. The advantages of self-selected addresses include the abil- ity of devices to join and form a network without any need for prior agreement, and the ability to choose a personal, memorable address. When multiple devices choose the same address another mechanism, such as signed and encrypted messages, provides the necessary disambiguation.
  • Item
    Hackystat-SQI: First Progress Report
    ( 2005-07-01) Kagawa, A.
    This report presents the initial analysis that are available for Hackystat-SQI and future directions.