Society Dissemination Based Propagation For Data Spreading In Mobiles Social Networks

In mobile ad hoc networks, nodes are dynamically changing their locations. MOBILE ad hoc networks (MANETs) consist of a collection of mobile nodes which can move freely. These nodes can be dynamically self-organized into arbitrary topology networks without a fixed infrastructure. A mobile ad hoc network consists of wireless hosts that may move often. Movement of hosts results in a change in routes, requiring some mechanism for determining new routes. Several routing protocols have already been proposed for ad hoc networks. MSNets can be viewed as a kind of socially aware Delay/ Disruption Tolerant Networks (DTNs). Thanks to the popularization of smart phones (e.g., iPhone, Nokia N95,and Blackberry), MSNets have begun to attract more attention. However, intermittent and uncertain network connectivity make data dissemination in MSNets a challenging problem. Broadcasting is the operation of sending data from a source user to all other users in the network. Most of the envisioned services (ranging from safety applications to traffic management) rely on broadcasting data to the users inside a certain area of interest. For example, location-based services (product prices, tourist points of interest, etc.) can be advertised from salesmen to near-by users. In this paper The objective is to broadcast data from a superuser to other users in the network. There are two main challenges under this paradigm, namely 1) how to represent and characterize user mobility in realistic MSNets; 2) given the knowledge of regular users' movements, how to design an efficient superuser route to broadcast data actively. We first explore several realistic data sets to reveal both geographic and social regularities of human mobility, and further propose the concepts of geocommunity and geocentrality into MSNet analysis

Routing in Mobile Ad-Hoc Networks using Social Tie Strengths and Mobility Plans

We consider the problem of routing in a mobile ad-hoc network (MANET) for which the planned mobilities of the nodes are partially known a priori and the nodes travel in groups. This situation arises commonly in military and emergency response scenarios. Optimal routes are computed using the most reliable path principle in which the negative logarithm of a node pair's adjacency probability is used as a link weight metric. This probability is estimated using the mobility plan as well as dynamic information captured by table exchanges, including a measure of the social tie strength between nodes. The latter information is useful when nodes deviate from their plans or when the plans are inaccurate. We compare the proposed routing algorithm with the commonly-used optimized link state routing (OLSR) protocol in ns-3 simulations. As the OLSR protocol does not exploit the mobility plans, it relies on link state determination which suffers with increasing mobility. Our simulations show considerably better throughput performance with the proposed approach as compared with OLSR at the expense of increased overhead. However, in the high-throughput regime, the proposed approach outperforms OLSR in terms of both throughput and overhead

Time-Varying Graphs and Dynamic Networks

The past few years have seen intensive research efforts carried out in some apparently unrelated areas of dynamic systems -- delay-tolerant networks, opportunistic-mobility networks, social networks -- obtaining closely related insights. Indeed, the concepts discovered in these investigations can be viewed as parts of the same conceptual universe; and the formal models proposed so far to express some specific concepts are components of a larger formal description of this universe. The main contribution of this paper is to integrate the vast collection of concepts, formalisms, and results found in the literature into a unified framework, which we call TVG (for time-varying graphs). Using this framework, it is possible to express directly in the same formalism not only the concepts common to all those different areas, but also those specific to each. Based on this definitional work, employing both existing results and original observations, we present a hierarchical classification of TVGs; each class corresponds to a significant property examined in the distributed computing literature. We then examine how TVGs can be used to study the evolution of network properties, and propose different techniques, depending on whether the indicators for these properties are a-temporal (as in the majority of existing studies) or temporal. Finally, we briefly discuss the introduction of randomness in TVGs.Comment: A short version appeared in ADHOC-NOW'11. This version is to be published in Internation Journal of Parallel, Emergent and Distributed System

HYMAD: Hybrid DTN-MANET Routing for Dense and Highly Dynamic Wireless Networks

In this paper we propose HYMAD, a Hybrid DTN-MANET routing protocol which uses DTN between disjoint groups of nodes while using MANET routing within these groups. HYMAD is fully decentralized and only makes use of topological information exchanges between the nodes. We evaluate the scheme in simulation by replaying real life traces which exhibit this highly dynamic connectivity. The results show that HYMAD outperforms the multi-copy Spray-and-Wait DTN routing protocol it extends, both in terms of delivery ratio and delay, for any number of message copies. Our conclusion is that such a Hybrid DTN-MANET approach offers a promising venue for the delivery of elastic data in mobile ad-hoc networks as it retains the resilience of a pure DTN protocol while significantly improving performance.Comment: 7 pages, 6 figure

Mobile Social Networking aided content dissemination in heterogeneous networks

Since more and more mobile applications are based on the proliferation of social information, the study of Mobile Social Net-works (MSNs) combines social sciences and wireless communications. Operating wireless networks more efficiently by exploiting social relationships between MSN users is an appealing but challenging option for network operators. An MSN-aided content dissemination technique is presented as a potential ex-tension of conventional cellular wireless net-works in order to satisfy growing data traffic. By allowing the MSN users to create a self-organized ad hoc network for spontaneously disseminating contents, the network operator may be able to reduce the operational costs and simultaneously achieve an improved network performance. In this paper, we first summarize the basic features of the MSN architecture, followed by a survey of the factors which may affect MSN-aided content dissemination. Using a case study, we demonstrate that one can save resources of the Base Station (BS) while substantially lowering content dissemination delay. Finally, other potential applications of MSN-aided content dissemination are introduced, and a range of future challenges are summarized