Results 1 - 10
of
15
A survey of social-based routing in delay tolerant networks: positive and negative social effects
- Communications Surveys & Tutorials, IEEE 15.1
, 2013
"... Abstract—Delay tolerant networks (DTNs) may lack continuous network connectivity. Routing in DTNs is thus challenging since it must handle network partitioning, long delays, and dynamic topology in such networks. In recent years, social-based ap-proaches, which attempt to exploit social behaviors of ..."
Abstract
-
Cited by 26 (7 self)
- Add to MetaCart
(Show Context)
Abstract—Delay tolerant networks (DTNs) may lack continuous network connectivity. Routing in DTNs is thus challenging since it must handle network partitioning, long delays, and dynamic topology in such networks. In recent years, social-based ap-proaches, which attempt to exploit social behaviors of DTN nodes to make better routing decision, have drawn tremendous interests in DTN routing design. In this article, we summarize the social properties in DTNs, and provide a survey of recent social-based DTN routing approaches. To improve routing performance, these methods either take advantages of positive social characteristics such as community and friendship to assist packet forwarding or consider negative social characteristics such as selfishness. We conclude by discussing some open issues and challenges in social-based approaches regarding the design of DTN routing protocols. Index Terms—DTN routing; Social-based approaches; Social graphs; Social network analysis; Delay tolerant networks.
To Offload or Not to Offload? The Bandwidth and Energy Costs of Mobile Cloud Computing
- in Proc. of IEEE Infocom, 2013. 0018-9340 (c) 2015 IEEE. Personal
"... Abstract—The cloud seems to be an excellent companion of mobile systems, to alleviate battery consumption on smartphones and to backup user’s data on-the-fly. Indeed, many recent works focus on frameworks that enable mobile computation offloading to software clones of smartphones on the cloud and on ..."
Abstract
-
Cited by 16 (3 self)
- Add to MetaCart
(Show Context)
Abstract—The cloud seems to be an excellent companion of mobile systems, to alleviate battery consumption on smartphones and to backup user’s data on-the-fly. Indeed, many recent works focus on frameworks that enable mobile computation offloading to software clones of smartphones on the cloud and on designing cloud-based backup systems for the data stored in our devices. Both mobile computation offloading and data backup involve communication between the real devices and the cloud. This communication does certainly not come for free. It costs in terms of bandwidth (the traffic overhead to communicate with the cloud) and in terms of energy (computation and use of network interfaces on the device). In this work we study the feasibility of both mobile compu-tation offloading and mobile software/data backups in real-life scenarios. In our study we assume an architecture where each real device is associated to a software clone on the cloud. We consider two types of clones: The off-clone, whose purpose is to support computation offloading, and the back-clone, which comes to use when a restore of user’s data and apps is needed. We give a precise evaluation of the feasibility and costs of both off-clones and back-clones in terms of bandwidth and energy consumption on the real device. We achieve this through measurements done on a real testbed of 11 Android smartphones and an equal number of software clones running on the Amazon EC2 public cloud. The smartphones have been used as the primary mobile by the participants for the whole experiment duration. I.
Analysis of a Hypercube-based Social Feature Multi-Path Routing in Delay Tolerant Networks
"... Abstract—Social behavior plays a more and more important role in delay tolerant networks (DTNs). In this paper, we present an analytical model for a hypercube-based social feature multi-path routing protocol in DTNs. In this routing protocol, we use the internal social features of each node (individ ..."
Abstract
-
Cited by 4 (1 self)
- Add to MetaCart
(Show Context)
Abstract—Social behavior plays a more and more important role in delay tolerant networks (DTNs). In this paper, we present an analytical model for a hypercube-based social feature multi-path routing protocol in DTNs. In this routing protocol, we use the internal social features of each node (individual) in the network for routing guidance. This approach is motivated from several real social contact networks, which show that people contact each other more when they have more social features in common. This routing scheme converts a routing problem in a highly mobile and unstructured contact space (M-space) to a static and structured feature space (F-space). The multi-path routing process is a hypercube-based feature matching process where the social feature differences are resolved step-by-step. A feature matching shortcut algorithm for fast searching is presented where more than one feature difference is resolved at one time. The multiple paths for the routing process are node-disjoint. We formally analyze the delivery rate and latency by using hypercube-based routing. The solutions for the expected values of latency and delivery rate are given under different path conditions: single-/multi-path and feature difference resolutions with/without shortcuts. Extensive simulations on both real and synthetic traces are conducted in comparison to several existing state-of-the-art DTN routing protocols. Index Terms—Delay tolerant networks, delivery rate, hypercubes, latency, multi-path routing, node-disjoint paths, social features.
Hero: A home based routing in pocket switched networks
- In Wireless Algorithms, Systems, and Applications (WASA
, 2012
"... Abstract. Pocket switched networks (PSNs) take advantage of human mobility to distribute data. Investigations on real-world trace data indi-cate that human mobility follows a simple reproducible pattern: a hu-man being usually visits a few places at high frequencies. These most frequently visited pl ..."
Abstract
-
Cited by 2 (1 self)
- Add to MetaCart
(Show Context)
Abstract. Pocket switched networks (PSNs) take advantage of human mobility to distribute data. Investigations on real-world trace data indi-cate that human mobility follows a simple reproducible pattern: a hu-man being usually visits a few places at high frequencies. These most frequently visited places form the home of a node, which is exploited in this paper to design two HomE based ROuting (HERO) algorithms. In the basic HERO, the first encountered relay whose home contains the place where the destination resides is selected to deliver the data. The enhanced HERO, on the other hand, continuously selects a better relay that visits the destination place at a higher frequency. In both al-gorithms, each node only needs to maintain and exchange its relatively stable home information and/or the corresponding visiting frequencies; therefore no global networking information and no frequent informa-tion update are needed, resulting in a low burden on the network due to its low communication and storage overheads. Moreover, HERO in-volves only simple arithmetic operations, thus causing little computation overhead at the mobile nodes. The simulation results indicate that both HERO algorithms outperform the state-of-the art.
Category-Based Routing in Social Networks: Membership Dimension and the Small-World Phenomenon
, 2011
"... A classic experiment by Milgram shows that individuals can route messages along short paths in social networks, given only simple categorical information about recipients (such as “he is a prominent lawyer in Boston ” or “she is a Freshman sociology major at Harvard”). That is, these networks have v ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
(Show Context)
A classic experiment by Milgram shows that individuals can route messages along short paths in social networks, given only simple categorical information about recipients (such as “he is a prominent lawyer in Boston ” or “she is a Freshman sociology major at Harvard”). That is, these networks have very short paths between pairs of nodes (the so-called small-world phenomenon); moreover, participants are able to route messages along these paths even though each person is only aware of a small part of the network topology. Some sociologists conjecture that participants in such scenarios use a greedy routing strategy in which they forward messages to acquaintances that have more categories in common with the recipient than they do, and similar strategies have recently been proposed for routing messages in dynamic ad-hoc networks of mobile devices. In this paper, we introduce a network property called membership dimension, which characterizes the cognitive load required to maintain relationships between participants and categories in a social network. We show that any connected network has a system of categories that will support greedy routing, but that these categories can be made to have small membership dimension if and only if the underlying network exhibits the small-world phenomenon.
Social-Aware Forwarding Improves Routing Performance in Pocket Switched Networks ⋆
"... Abstract. We study and characterize social-aware forwarding protocols in opportunistic networks and we derive bounds on the expected message delivery time for two different routing protocols, which are representatives of social-oblivious and social-aware forwarding. In particular, we consider a rece ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
(Show Context)
Abstract. We study and characterize social-aware forwarding protocols in opportunistic networks and we derive bounds on the expected message delivery time for two different routing protocols, which are representatives of social-oblivious and social-aware forwarding. In particular, we consider a recently introduced stateless, social-aware forwarding protocol using interest similarity between individuals, and the well-known BinarySW protocol, which is optimal within a certain class of stateless, social-oblivious forwarding protocols. We compare both from the theoretical and experimental point of view the asymptotic performance of Interest-Based (IB) forwarding and BinarySW under two mobility scenarios, modeling situations in which pairwise meeting rates between nodes are either independent of or correlated to the similarity of their interests. 1
Social feature enhanced group-based routing for wireless delay tolerant networks
- in Proceedings of the 8th International Conference on Mobile Ad-hoc and Sensor Networks (MSN
, 2012
"... Abstract—Mobile devices in delay tolerant networks (DTNs) are used and carried by people, whose behaviors could be described by social models. Understanding social behaviors and characteristics of mobile users can greatly help the routing decision in DTN routing protocols. However, to obtain the sta ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
(Show Context)
Abstract—Mobile devices in delay tolerant networks (DTNs) are used and carried by people, whose behaviors could be described by social models. Understanding social behaviors and characteristics of mobile users can greatly help the routing decision in DTN routing protocols. However, to obtain the stable and accurate social characteristics in dynamic DTNs is very challenging. To achieve efficient delivery of messages at low costs, in this paper, we propose a novel enhanced social group-based routing protocol in which the relay node is selected based on multi-level cross-community social group information. We apply a simple group formation method with both historical encounters (social relationships in physical world) and social features of mobile users (social relationships in social world) and build multi-level cross-community social groups, which summarize the wide range of social relationships among all mobile participants. Our simulations over a real-life data set demonstrate the efficiency and effectiveness of the proposed method by comparing it with several existing DTN routing schemes. Index Terms—routing, relay selection, social features, multi-level, delay tolerant networks I.
An Implementation of Secure Two-Party Computation for Smartphones with Application to Privacy-Preserving Interest-Cast
"... Abstract—In this paper, we present an implementation of the FairPlay framework for secure two-party function computation on Android smartphones, which we call MobileFairPlay. Mobile-FairPlay allows high-level programming of several secure two-party protocols, including protocols for the Millionaire ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
(Show Context)
Abstract—In this paper, we present an implementation of the FairPlay framework for secure two-party function computation on Android smartphones, which we call MobileFairPlay. Mobile-FairPlay allows high-level programming of several secure two-party protocols, including protocols for the Millionaire problem, set intersection, computation of Jaccard similarity coefficient, etc. All these functions are useful in the context of mobile social networks and opportunistic networks, where parties are often requested to exchange sensitive information (list of contacts, interest profiles, etc.) to optimize network operation. To demonstrate the feasibility of MobileFairPlay, we present an application to privacy-preserving interest-casting in opportunistic networks, implementing a recently proposed protocol. We tested running times of the implemented protocol on several Android phones, obtaining very reasonable (up to 5sec) running times. These results clearly promote MobileFairPlay as a feasible security framework for mobile environments. I.
JANNE KULMALA DEVELOPING LOCAL SOCIAL APPLICATIONS ON MOBILE DEVICES
, 2013
"... Recently online social services have began to utilize the location of a mobile device to find more relevant information for the user. Mobile devices have had capacity for inexpensive wireless communication between neighbor devices, but the technology has not been popular among users due to technical ..."
Abstract
- Add to MetaCart
(Show Context)
Recently online social services have began to utilize the location of a mobile device to find more relevant information for the user. Mobile devices have had capacity for inexpensive wireless communication between neighbor devices, but the technology has not been popular among users due to technical problems and missing applica-tions. This thesis studies possibilities of using direct communication for local social networking. First, the requirements and use cases are derived for local social appliocations, and an application design is presented which fulfills the requirements. Secondly, a simulation model is described for testing applications that utilize direct communication. The simulation models the movement of a large population in an urban area. The design was evaluated in a user trial with 250 participants, and the trial par-ticipants named local conversations as the most important feature. The simulation model was compared to the user trial and it was found to match the behaviour of the people. II TIIVISTELMÄ
1 Hypercube-based Multi-path Social Feature Routing in Human Contact Networks
"... Abstract—Most routing protocols for delay tolerant networks resort to the sufficient state information, including trajectory and contact information, to ensure routing efficiency. However, state information tends to be dynamic and hard to obtain without a global and/or long-term collection process. ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract—Most routing protocols for delay tolerant networks resort to the sufficient state information, including trajectory and contact information, to ensure routing efficiency. However, state information tends to be dynamic and hard to obtain without a global and/or long-term collection process. In this paper, we use the internal social features of each node in the network to perform the routing process. In this way, feature-based routing converts a routing problem in a highly mobile and unstructured contact space to a static and structured feature space. This approach is motivated from several human contact networks, such as the Infocom 2006 trace and MIT reality mining data, where people contact each other more frequently if they have more social features in common. Our approach includes two unique processes: social feature extraction and multi-path routing. In social feature extraction, we use entropy to extract the m most informative social features to create a feature space (F-space): (F1,F2,...,Fm), where Fi corresponds to a feature. The routing method then becomes a hypercube-based feature matching process, where the routing process is a step-by-step feature difference resolving process. We offer two special multi-path routing schemes: node-disjoint-based routing and delegationbased routing. Extensive simulations on both real and synthetic traces are conducted in comparison with several existing approaches, including spray-and-wait routing, spray-and-focus routing, and social-aware routing based on betweenness centrality and similarity. In addition, the effectiveness of multi-path routing is evaluated and compared to that of single-path routing. Index Terms—Closeness, delay tolerant networks, entropy, human contact networks, hypercubes, multi-path routing, social features. 1