Premium
Information‐centric routing in MSN based on community detection
Author(s) -
Shi Junling,
Wang Xingwei,
Huang Min,
Lv Jianhui,
Li Keqin,
Li Jie
Publication year - 2019
Publication title -
transactions on emerging telecommunications technologies
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.366
H-Index - 47
ISSN - 2161-3915
DOI - 10.1002/ett.3554
Subject(s) - computer science , mobile social network , computer network , network packet , routing (electronic design automation) , mobile ad hoc network , node (physics) , cache , overhead (engineering) , destination sequenced distance vector routing , dsrflow , policy based routing , triangular routing , routing protocol , geographic routing , delay tolerant networking , social network (sociolinguistics) , optimized link state routing protocol , link state routing protocol , world wide web , mobile computing , social media , structural engineering , engineering , operating system
Mobile social network (MSN) offers a new perspective on mobile ad hoc communication since its routing principle is based on the human social relations. Although social‐based routing can improve routing efficiency considerably, obtaining such social information is difficult to be achieved. In information‐centric networking (ICN), content names reveal useful social information among users. In addition, each node stores and caches the received content to satisfy the forthcoming content requests in ICN due to in‐network caching. In this work, the proposed MSN routing relies on named data networking, which is a well‐known ICN paradigm. By the communities, which are detected based on users' interest preferences, an interest packet is delivered to the content provider based on the interest similarities among mobile users. Then, by communities, which are detected based on the nodes' encounter regularities, a data packet is returned to the interest requester according to the social relationships among mobile users. The content is cached at nodes according to both social and interest communities. Experiments and performance evaluations show that the proposed scheme has better message delivery ratio and lower network overhead than the other existing ones.