Social characteristics-based routing algorithm for a mobile social network
- PDF / 628,320 Bytes
- 21 Pages / 439.37 x 666.142 pts Page_size
- 3 Downloads / 191 Views
Social characteristics-based routing algorithm for a mobile social network Milind R. Penurkar1
· Umesh A. Deshpande2
Received: 18 October 2019 / Accepted: 24 September 2020 © Springer-Verlag GmbH Austria, part of Springer Nature 2020
Abstract Utilization of social characteristics presents a modern approach in the design of routing protocols for Mobile Social Networks. In this paper, we present a novel routing algorithm called the Social Characteristics-based Distributed Routing Algorithm (SCDRA) for a Mobile Social Network. SCDRA explores community and friendship as social features to effectively route messages. In SCDRA, nodes develop their community in a distributed way based on the concept of a familiar set. Merging of communities of nodes is governed by certain rules. Friendship in SCDRA evolves based on various factors like inter-contact duration, frequency of encounters and successful delivery of messages forwarded in a few past time intervals between the nodes. Routing of messages is accomplished by utilizing community and friendship as social characteristics. Extensive simulation studies performed show that the proposed algorithm performs better when compared to existing algorithms such as Bubble rap, SMART and EpSoc for performance metrics like delivery ratio, overhead ratio and average delivery latency in various scenarios. Keywords DTN · Mobile social networks · Routing · Community · Friendship Mathematics Subject Classification 68M12 · 68M14 · 68W15
1 Introduction A Mobile Social Network (MSN) is a special kind of a Delay Tolerant Network (DTN), in which, the nodes are hand-held devices like smart phones, PDAs, Tablets, etc., [1,2].
B
Milind R. Penurkar [email protected] Umesh A. Deshpande [email protected]
1
Department of Computer Science and Engineering, IIIT, Nagpur, India
2
Department of Computer Science and Engineering, VNIT, Nagpur, India
123
M. R. Penurkar, U. A. Deshpande
The nodes (devices) in a MSN are mobile as they are carried by people. In recent times, MSNs have gained a lot of popularity because of their ability to share huge information (e.g. large size files, multimedia files, etc.) among people at a very low cost [1]. This has resulted in improved communication among people. Sharing of large size information would be feasible only if people meet each other for some purpose and they do have ample resources (e.g. storage space, battery, etc.) to exchange large size messages. Certain algorithms proposed for MSNs utilize various social characteristics to route messages from a source node to a destination node. Bubble rap [3] routing algorithm uses community and degree centrality as social characteristics to route messages. The node having the highest global ranking (highest number of active connections in the entire network) forwards a message through the network till the message reaches the node sharing the same community with the destination node. Thereafter, the node having the highest local ranking within the community (highest number of active connections
Data Loading...
