Abstract
In Mobile Social Networks (MSNs), people contact each other through mobile devices, such as smartphones and tablets, while they move freely. The communication takes place on-the-fly by the opportunistic contacts between mobile users via local wireless bandwidth, such as Bluetooth or WiFi without a network infrastructure. Social Multicast is an important routing service in MSNs where data transmission is addressed to a group of users according to their social features. The aim of this paper is to find and recommend mobile nodes that can efficiently relay and consume messages based on their social features. Efficiency in this context is to achieve high delivery ratio while reducing considering resources constraints and limitations such as power and space. The proposed algorithm, TESS, measures social similarity based on Time-based Encounter of Socially Similar nodes. We compare the proposed algorithm with the known social multicast algorithms: Multi-CSDO, EncoCent and Epidemic. Simulations results show that the proposed algorithm outperforms others in terms of delivery ratio and network overhead.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
