Results 1 - 10
of
26
Routing with multi-level social groups in mobile opportunistic networks
- in Proc. of IEEE Globecom
, 2012
"... mittently connected networks, such as pocket switched networks formed by human-carried mobile devices. Routing in MONs is very challenging as it must handle network partitioning, long delays, and dynamic topology. Flooding is a possible solution but with high costs. Most existing routing methods for ..."
Abstract
-
Cited by 5 (5 self)
- Add to MetaCart
(Show Context)
mittently connected networks, such as pocket switched networks formed by human-carried mobile devices. Routing in MONs is very challenging as it must handle network partitioning, long delays, and dynamic topology. Flooding is a possible solution but with high costs. Most existing routing methods for MONs avoid the costly flooding by selecting one or multiple relays to deliver data during each encounter. How to pick the “good ” relay from all encounters is a non-trivial task. To achieve efficient delivery of messages at low costs, in this paper, we propose a new group-based routing protocol in which the relay node is selected based on social group information obtained from historical encounters. We apply a simple formation method to build multi-level social groups, which summarizes the wide range of social relationships among all mobile participants. Our simulations demonstrate the efficiency and effectiveness of the proposed method by comparing it with several existing MON routing schemes. I.
From technological networks to social networks
- IEEE J. SEL. AREAS COMMUN
, 2013
"... Social networks overlaid on technological networks account for a significant fraction of Internet use. Through graph theoretic and functionality models, this paper examines social network analysis and potential implications for the design of technological networks, and vice versa. Such interplay be ..."
Abstract
-
Cited by 5 (0 self)
- Add to MetaCart
(Show Context)
Social networks overlaid on technological networks account for a significant fraction of Internet use. Through graph theoretic and functionality models, this paper examines social network analysis and potential implications for the design of technological networks, and vice versa. Such interplay between social networks and technological networks suggests new directions for future research in networking.
Nokia mobile data challenge: Predicting semantic place and next place via mobile data
- in Proc. of Nokia Mobile Data Challenge Workshop
, 2012
"... The appearance of smartphones equipped with various sen-sors enables pervasive monitoring of mobile users ’ behaviors and mobility. The Nokia Mobile Data Challenge (MDC) [10] gives us a great opportunity to study the users ’ mobility models and location profiles from a rich mobile dataset. The reali ..."
Abstract
-
Cited by 2 (1 self)
- Add to MetaCart
(Show Context)
The appearance of smartphones equipped with various sen-sors enables pervasive monitoring of mobile users ’ behaviors and mobility. The Nokia Mobile Data Challenge (MDC) [10] gives us a great opportunity to study the users ’ mobility models and location profiles from a rich mobile dataset. The realistic data analysis may benefit a wide range of fields from technology innovation to policy making. In this paper, we describe our proposed methods to predict the semantic meaning of the “important places ” (Task 1) and the users’ next destination (Task 2) based on released MDC data. For Task 1, we explore several features from the sequence of vis-ited places and accelerometer samples, and proposed two types of prediction methods: rule based and machine learn-ing based. For Task 2, we adopt a simple but effective ma-chine learning method to accomplish the prediction assign-ment via both temporal and spacial features. Our prelim-inary experimental results over released MDC data (Set A dataset) show that rule based methods produce good predic-tions for home and work locations in Task1, while machine learning methods are more scalable for different types of pre-diction tasks. But the prediction accuracy of machine learn-ing approaches heavily depends on the number of instances in the training data. 1.
Seeker-Assisted Information Search in Mobile Clouds
"... The increase in the size of mobile cloud as well as the volume of information necessitates efficient search mechanisms for finding the searched information or the target node. In this paper, we focus on search mechanisms to retrieve information from within amobilecloudinwhichnodeshaveintermittentcon ..."
Abstract
-
Cited by 2 (2 self)
- Add to MetaCart
(Show Context)
The increase in the size of mobile cloud as well as the volume of information necessitates efficient search mechanisms for finding the searched information or the target node. In this paper, we focus on search mechanisms to retrieve information from within amobilecloudinwhichnodeshaveintermittentconnectivityand hence operate on a store-carry-forward manner. We design an opportunistic search scheme in which the searching node spreads alimitednumberofreplicasofthequerytothenodesitmeets and these nodes, so called seekers, performthesearchonbehalf of the searching node. We assume that nodes are grouped into communities based on their interest profiles, and seekers use this community information to forward the data and the query to the right community — the community that is more likely to store the searched content. Since people store and search for similar information in the scope of their interest, the nodes in the same community as the searching node have higher probability to store the searched content. We model this seeker-assisted search scheme as acontinuoustimeMarkovprocessandanalyzeitsperformanceunder various inter-community/intra-community meeting rate, number of replicas, and network population. Our analysis shows that seeker-assisted search achieves a good balance between the search response time and search cost compared to the two extremes of epidemic search and direct delivery search.
Trust management in delay tolerant networks utilizing erasure coding
- in IEEE ICC 2015 - Ad-hoc and Sensor Networking Symposium (ICC’15 (09) AHSN
, 2015
"... Abstract—There is a need for robust networks in all envi-ronments including austere ones. The prime example is Delay Tolerant Networks (DTN) that are subject to a growing body of research. These networks support applications used by the military and first responders, especially in emergency situatio ..."
Abstract
-
Cited by 2 (2 self)
- Add to MetaCart
(Show Context)
Abstract—There is a need for robust networks in all envi-ronments including austere ones. The prime example is Delay Tolerant Networks (DTN) that are subject to a growing body of research. These networks support applications used by the military and first responders, especially in emergency situations. Securing a DTN is not a trivial undertaking due to node mobility and the ADHOC method in which nodes communicate. Here, we propose a distributed trust management scheme to secure this class of networks with many of the underlying principles appli-cable to the larger class of Mobile ADHOC Networks (MANET). The scheme employs erasure coding not only to increase delivery rate in a DTN but also to infer the trustworthiness of the nodes along all paths that deliver a message segments to the destination. The proposed approach enables us to decide when the destination node should stop waiting for additional segments and instead request message retransmission. Moreover, even after the message is recreated successfully, additional segments received enable the destination to collect precious trust information about the nodes involved in delivery of these segments. We show how distributing this trust information identifies compromised nodes. I.
Searching a Needle in (Linear) Opportunistic Networks
"... Searching content in mobile opportunistic networks is a diffi-cult problem due to the dynamically changing topology and intermittent connections. Moreover, due to the lack of global view of the network, it is arduous to determine whether the best response is discovered or search should be spread to ..."
Abstract
-
Cited by 2 (1 self)
- Add to MetaCart
(Show Context)
Searching content in mobile opportunistic networks is a diffi-cult problem due to the dynamically changing topology and intermittent connections. Moreover, due to the lack of global view of the network, it is arduous to determine whether the best response is discovered or search should be spread to other nodes. A node that has received a search query has to take two decisions: (i) whether to continue the search further or stop it at the current node (current search depth) and, independently of that, (ii) whether to send a response back or not. As each transmission and extra hop costs in terms of energy, bandwidth and time, a balance between the expected value of the response and the costs incurred must be sought. In order to better understand this inherent trade-off, we assume a simplified setting where both the query and response follow the same path. We formulate the problem of optimal search for the following two cases: a node holds (i) exactly matching content with some probability, and (ii) some content partially matching the query. We design static search in which the search depth is set at query initiation, dynamic search in which search depth is determined locally during query forwarding, and learning dynamic search which leverages the observations to estimate suitability of content for the query. Additionally, we show how unreliable response paths affect the optimal search depth and the correspond-ing search performance. Finally, we investigate the principal factors affecting the optimal search strategy.
SEBAR: Social Energy BAsed Routing Scheme for Mobile Social Delay Tolerant Networks
"... connected networks, such as mobile social networks formed by human-carried mobile devices. Routing in such mobile social DTNs is very challenging as it must handle network partition-ing, long delays, and dynamic topology. Recently, social-based approaches, which attempt to exploit social behaviors o ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
(Show Context)
connected networks, such as mobile social networks formed by human-carried mobile devices. Routing in such mobile social DTNs is very challenging as it must handle network partition-ing, long delays, and dynamic topology. Recently, social-based approaches, which attempt to exploit social behaviors of DTN nodes to make better routing decision, have drawn tremendous interests in DTN routing design. In this paper, we propose a novel social-based routing approach for mobile social DTNs, where a new metric social energy is introduced to quantify the ability of a node to forward packets to others, inspired by general laws in particle physics. Social energy is generated via node encounters and shared by the communities of encountering nodes. Similar to the radiation of energy in physics, the social energy of any node decays over time. Our proposed Social Energy BAsed Routing (SEBAR) protocol considers social energy of encountering nodes and is in favor of the node with a higher social energy in its or the destination’s social community. Our simulations with real-life wireless traces demonstrate the efficiency and effectiveness of SEBAR method by comparing it with several existing DTN routing schemes. I.
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.
Detecting Overlapping Temporal Community Structure in Time-Evolving Networks
"... Abstract—We present a principled approach for detecting overlapping temporal community structure in dynamic networks. Our method is based on the following framework: find the overlapping temporal community structure that maximizes a quality function associated with each snapshot of the network subje ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
(Show Context)
Abstract—We present a principled approach for detecting overlapping temporal community structure in dynamic networks. Our method is based on the following framework: find the overlapping temporal community structure that maximizes a quality function associated with each snapshot of the network subject to a temporal smoothness constraint. A novel quality function and a smoothness constraint are proposed to handle overlaps, and a new convex relaxation is used to solve the result-ing combinatorial optimization problem. We provide theoretical guarantees as well as experimental results that reveal community structure in real and synthetic networks. Our main insight is that certain structures can be identified only when temporal correlation is considered and when communities are allowed to overlap. In general, discovering such overlapping temporal community structure can enhance our understanding of real-world complex networks by revealing the underlying stability behind their seemingly chaotic evolution. I.
Routing and Inter-Session Network Coding in Delay Tolerant Mobile Social Networks
, 2015
"... We consider Delay Tolerant Mobile Social Networks (DTMSN), made of wireless nodes with intermittent connections and clustered into social communities. This thesis deals with the analysis and design of information transfer strategies in DTMSN. It is mostly dedicated to investigate the use of Inter-Se ..."
Abstract
- Add to MetaCart
We consider Delay Tolerant Mobile Social Networks (DTMSN), made of wireless nodes with intermittent connections and clustered into social communities. This thesis deals with the analysis and design of information transfer strategies in DTMSN. It is mostly dedicated to investigate the use of Inter-Session Network Coding (ISNC) towards this goal. Network coding is a generalization of routing and ISNC is known as a difficult optimization problem in general, specifically because it can easily get detrimental, compared to no coding, if not designed carefully. To leverage the diversity of the strengths of social ties, a number of utility-based routing policies have been proposed in the literature. In the first part of this thesis, we first address the-oretically the optimization problem of the routing policy in DTMSN, under a multi-community network model, and we prove that the optimal policies have a per-community threshold struc-ture, thereby generalizing the existing works for homogeneous mobility DTN. We also compare the online utility-based policies of the literature to these optimal policies. The second part of the thesis focuses on modeling ISNC-based routing in DTMSN. In partic-
