56 research outputs found
Social-aware Forwarding in Opportunistic Wireless Networks: Content Awareness or Obliviousness?
With the current host-based Internet architecture, networking faces
limitations in dynamic scenarios, due mostly to host mobility. The ICN paradigm
mitigates such problems by releasing the need to have an end-to-end transport
session established during the life time of the data transfer. Moreover, the
ICN concept solves the mismatch between the Internet architecture and the way
users would like to use it: currently a user needs to know the topological
location of the hosts involved in the communication when he/she just wants to
get the data, independently of its location. Most of the research efforts aim
to come up with a stable ICN architecture in fixed networks, with few examples
in ad-hoc and vehicular networks. However, the Internet is becoming more
pervasive with powerful personal mobile devices that allow users to form
dynamic networks in which content may be exchanged at all times and with low
cost. Such pervasive wireless networks suffer with different levels of
disruption given user mobility, physical obstacles, lack of cooperation,
intermittent connectivity, among others. This paper discusses the combination
of content knowledge (e.g., type and interested parties) and social awareness
within opportunistic networking as to drive the deployment of ICN solutions in
disruptive networking scenarios. With this goal in mind, we go over few
examples of social-aware content-based opportunistic networking proposals that
consider social awareness to allow content dissemination independently of the
level of network disruption. To show how much content knowledge can improve
social-based solutions, we illustrate by means of simulation some
content-oblivious/oriented proposals in scenarios based on synthetic mobility
patterns and real human traces.Comment: 7 pages, 6 figure
Social-aware Opportunistic Routing Protocol based on User's Interactions and Interests
Nowadays, routing proposals must deal with a panoply of heterogeneous
devices, intermittent connectivity, and the users' constant need for
communication, even in rather challenging networking scenarios. Thus, we
propose a Social-aware Content-based Opportunistic Routing Protocol, SCORP,
that considers the users' social interaction and their interests to improve
data delivery in urban, dense scenarios. Through simulations, using synthetic
mobility and human traces scenarios, we compare the performance of our solution
against other two social-aware solutions, dLife and Bubble Rap, and the
social-oblivious Spray and Wait, in order to show that the combination of
social awareness and content knowledge can be beneficial when disseminating
data in challenging networks
Design and Performance Evaluation of Data Dissemination Systems for Opportunistic Networks Based on Cognitive Heuristics
It is often argued that the Future Internet will be a very large scale content-centric network. Scalability issues will stem even more from the amount of content nodes will gen- erate, share and consume. In order to let users become aware and retrieve the content they really need, these nodes will be required to swiftly react to stimuli and assert the rele- vance of discovered data under uncertainty and only partial information. The human brain performs the task of infor- mation ltering and selection using the so-called cognitive heuristics, i.e. simple, rapid, low-resource demanding, yet very eective schemes that can be modeled using a func- tional approach. In this paper we propose a solution based on one such heuristics, namely the recognition heuristic, for dealing with data dissemination in opportunistic networks. We show how to implement an algorithm that exploits the environmental information in order to implement an eec- tive dissemination of data based on the recognition heuristic, and provide a performance evaluation of such a solution via simulation
Content Dissemination in Mobile Social Networks
Mobile social networking(MSN) has emerged as an effective platform for social network users to pervasively disseminate the contents such as news, tips, book information, music, video and so on. In content dissemination, mobile social network users receive content or information from their friends, acquaintances or neighbors, and selectively forward the content or information to others. The content generators and receivers have different motivation and requirements to disseminate the contents according to the properties of the contents, which makes it a challenging and meaningful problem to effectively disseminate the content to the appropriate users.
In this dissertation, the typical content dissemination scenarios in MSNs are investigated. According to the content properties, the corresponding user requirements are analyzed. First, a Bayesian framework is formulated to model the factors that influence users behavior on streaming video dissemination. An effective dissemination path detection algorithm is derived to detect the reliable and efficient video transmission paths. Second, the authorized content is investigated. We analyze the characteristics of the authorized content, and model the dissemination problem as a new graph problem, namely, Maximum Weighted Connected subgraph with node Quota (MWCQ), and propose two effective algorithms to solve it. Third, the authorized content dissemination problem in Opportunistic Social Networks(OSNs) is studied, based on the prediction of social connection pattern. We then analyze the influence of social connections on the content acquirement, and propose a novel approach, User Set Selection(USS) algorithm, to help social users to achieve fast and accurate content acquirement through social connections
Exploiting user interest similarity and social links for micro-blog forwarding in mobile opportunistic networks
Micro-blogging services have recently been experiencing increasing success among Web users. Differ- ent to traditional online social applications, micro-blogs are lightweight, require small cognitive effort and help share real-time information about personal activities and interests. In this article we explore scalable pushing protocols that are particularly suited to the delivery of this type of service in a mobile pervasive environment. Here, micro-blog updates are generated and carried by mobile (smart-phone type) devices and are exchanged through opportunistic encounters. We enhance primitive push mechanisms using social information concerning the interests of network nodes as well as the frequency of encounters with them. This information is collected and shared dynamically, as nodes initially encounter each other and exchange their preferences, and directs the forwarding of micro-blog updates across the network. Also incorporated is the spatiotemporal scope of the updates, which is only partially considered in current Internet services. We introduce several new protocol variants that differentiate the forwarding strategy towards interest- similar and frequently encountered nodes, as well as the amount of updates forwarded upon each encounter. In all cases, the proposed scheme outperforms the basic flooding dissemination mechanism in delivering high numbers of micro-blog updates to the nodes interested in them. Our extensive evaluation highlights how use can be made of different amounts of social information to trade performance with complexity and computational effort. However, hard performance bounds appear to be set by the level of coincidence between interest-similar node communities and meeting groups emerging due to the mobility patterns of the nodes
Exploiting Mobile Social Networks from Temporal Perspective:A Survey
With the popularity of smart mobile devices, information exchange between users has become more and more frequent, and Mobile Social Networks (MSNs) have attracted significant attention in many research areas. Nowadays, discovering social relationships among people, as well as detecting the evolution of community have become hotly discussed topics in MSNs. One of the major features of MSNs is that the network topology changes over time. Therefore, it is not accurate to depict the social relationships of people based on a static network. In this paper, we present a survey of this emerging field from a temporal perspective. The state-of-the-art research of MSNs is reviewed with focus on four aspects: social property, time-varying graph, temporal social property, and temporal social properties-based applications. Some important open issues with respect to MSNs are discussed
MobiTrade: Trading Content in Disruption Tolerant Networks
International audienceThe rapid proliferation of advanced mobile devices has created a growing demand for data content. Existing approaches (e.g. relying on cellular infrastructures) cannot keep up with the large volume of content generated and requested, without the deployment of new expensive infrastructure. Exchanging content of interest opportunistically, when two nodes are in range, presents a low cost and high bandwidth alternative for popular, bulky content. Yet, efficiently collecting, storing, and sharing the content while preventing selfish users from impairing collaborative ones, poses major challenges. In this paper, we present MobiTrade, a collaborative content dissemination system on top of a delay tolerant network. It allows users to head out in the real world, express locally their interests, and wait to get notified whenever an encountered device has content(s) matching these interests. Even though interactions are done between neighboring wireless devices (locally), MobiTrade implements a trading scheme that motivates mobile devices to act as merchants and carry content across the network to satisfy each other's interests. Users continuously profile the type of content requested and the collaboration level of encountered devices. Based on this knowledge, an appropriate utility function is used to rank these requests and collect an optimal inventory of data that maximizes the expected value of stored content for future encounters. Using NS3 simulations based on synthetic and real mobility traces, we show that MobiTrade achieves up to 2 times higher query success rates compared to other content dissemination schemes. Furthermore, we show that MobiTrade successfully isolates selfish, non-collaborative devices. Finally, using a simple game theoretic framework we show that turning on our MobiTrade mechanism is an efficient Nash Equilibrium
- …