Design an Efficient Community-based Message Forwarding Method in Mobile Social Networks
Authors
Abstract:
Mobile social networks (MSNs) are a special type of Delay tolerant networks (DTNs) in which mobile devices communicate opportunistically to each other. One of the most challenging issues in Mobile Social Networks (MSNs) is to design an efficient message forwarding scheme that has a high performance in terms of delivery ratio, latency and communication cost. There are two different approaches for message forwarding: the single copy and the multi copy. In the single copy schemes, only one copy of a message exists in the network, which is carried by a custodian relay. On the other hand, in multi copy schemes more than one copy of the message exist. Although the multi copy schemes generally have superior performance in terms of delivery ratio and latency, they incur high congestion in the network, which consequently degrades the network performance and increases message forwarding cost. Therefore, we present a scheme for managing the number of replica and selecting appropriate relays in order to increase the performance and decrease the forwarding cost. In this paper, we present a novel message forwarding scheme, named Multi Copy Community Aware Forwarding (MCCAF), for managing the number of message replicas and selecting appropriate relays in order to increase the performance and decrease the forwarding cost. MCCAF only forwards one replica of message to each community that the destination node belongs to it. In order to find communities and nodes’ future communities, MCCAF exploits a hidden semi-Markov model (HSMM). In the proposed method, hidden states represent communities and environmental chronological information such as location, visited nodes and access points are modeled as observation in HSMM. To have a more precise community prediction, the semi-Markov model is extended to compute the likelihoods of a node being in a particular community after N transitions. After that, appropriate relays are selected to forward a message with taking into account the message expiration time, future communities of relays and the number of message replica. Evaluation results on real traces demonstrate that the MCCAF has superior performance over rival schemes in terms of delivery ratio, latency, and forwarding cost. Specifically, MCCAF yields on average about 8% better delivery ratio and about 23% less delivery delay than the nearest rival method.
similar resources
A social overlay-based forwarding scheme for mobile social networks
In mobile social networks, forwarding is a challenging problem since there may be no end-to-end paths. Existing schemes using overlays are not applicable to pure mobile social networks since they use environments different from the mobile social networks. To resolve this problem, we propose a novel forwarding scheme that considers the common neighbor similarity and contact probability. In the p...
full textAn Energy Efficient Clustering Method using Bat Algorithm and Mobile Sink in Wireless Sensor Networks
Wireless sensor networks (WSNs) consist of sensor nodes with limited energy. Energy efficiency is an important issue in WSNs as the sensor nodes are deployed in rugged and non-care areas and consume a lot of energy to send data to the central station or sink if they want to communicate directly with the sink. Recently, the IEEE 802.15.4 protocol is employed as a low-power, low-cost, and low rat...
full textPervasive forwarding mechanism for mobile social networks
In recent years, we have witnessed an increase in the popularity of mobile wireless devices and networks, with greater attention devoted to feasibility of opportunistic computing, sensing, and communication. In Mobile Social Networks (MSNs), communication is provided by spatial proximity and social links between peers, where personal devices carried by users communicate directly in a device-to-...
full textAn Efficient Multipath Forwarding Method
We motivate and formally define dynamic multipath routing and present the problem of packet forwarding in the multipath routing context. We demonstrate that for multipath sets that are suffis matched, forwarding can be efficiently implemented with (1) a per packet overhead of a small, fixed-length path identifier, and (2) router space overhead linear in K , the number of alternate paths between...
full textOverlapping Community Detection in Social Networks Based on Stochastic Simulation
Community detection is a task of fundamental importance in social network analysis. Community structures enable us to discover the hidden interactions among the network entities and summarize the network information that can be applied in many applied domains such as bioinformatics, finance, e-commerce and forensic science. There exist a variety of methods for community detection based on diffe...
full textLogic for Multi-path Message Forwarding Networks for Mobile Agents
We discuss how mobile agents, moving in the Internet from node to node, can communicate with each other by forwarding messages in a robust way. As a solution, we present the general idea of a class of communication networks called the multi-path message forwarding networks (MMFNs), which can transmit the messages to mobile agents at the current location in a robust way based on multiple paths b...
full textMy Resources
Journal title
volume 19 issue 3
pages 1- 18
publication date 2022-12
By following a journal you will be notified via email when a new issue of this journal is published.
No Keywords
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023