مشخصات مقاله:
عنوان فارسی مقاله:
طرح مسیریابی توزیع شده هوشمندانه بر اساس شباهت اجتماعی برای شبکه های اجتماعی تلفن همراه
عنوان انگلیسی مقاله:
Intelligent distributed routing scheme based on social similarity for mobile social networks
کلمات کلیدی مقاله:
شبکه اجتماعی موبایل، شباهت اجتماعی، مدل پیش بینی، مسیریابی، زمینه اجتماعی
مناسب برای رشته های دانشگاهی زیر:
مهندسی فناوری اطلاعات – مهندسی کامپیوتر
مناسب برای گرایش های دانشگاهی زیر:
سامانه های شبکه ای – شبکه های کامپیوتری – الگوریتم و محاسبات – هوش مصنوعی
وضعیت مقاله انگلیسی و ترجمه:
مقاله انگلیسی را میتوانید به صورت رایگان با فرمت PDF با کلیک بر روی دکمه آبی، دانلود نمایید. برای ثبت سفارش ترجمه نیز روی دکلمه قرمز رنگ کلیک نمایید. سفارش ترجمه نیازمند زمان بوده و ترجمه این مقاله آماده نمیباشد و پس از اتمام ترجمه، فایل ورد تایپ شده قابل دانلود خواهد بود.
فهرست مطالب:
Outline
Highlights
Abstract
Keywords
۱٫ Introduction
۲٫ Related work
۳٫ System model
۴٫ Routing algorithm
۵٫ Performance evaluation
۶٫ Conclusion
Acknowledgments
References
قسمتی از مقاله انگلیسی:
Abstract
In mobile social networks (MSNs), the social attributes of nodes are important factors driving the mobility of nodes. By studying the mobility of the daily activities of node carriers, an intelligent distributed routing algorithm based on social context information prediction was proposed. First, we study the data forwarding problem of mobile social networks from two aspects, the daily behavior of mobile nodes and the similarity of social attributes respectively. Then, our algorithm uses BP neural network to predict the encounter regularity of mobile nodes in terms of time and space dimensions. This information can provide a basis for routing decisions. Finally, a routing algorithm with predictive capability is designed in combination with synchronous delivery and asynchronous delivery. Simulation analysis and experimental results show that the proposed routing algorithm can effectively improve the message delivery ratio and reduce the network overhead.
1. Introduction
Mobile social networks (MSNs) are one of the important development directions of mobile ad hoc networks. In the real world, there are a lot of phenomena such as node movement, frequent link interruption and network partition in MSNs. Therefore, there is often no end-to-end path between two nodes when they need to communicate. Especially the distributed MSNs systems, where no centralized infrastructure is available, can greatly benefit from efficient opportunistic networking [1]. The emergence of opportunistic routing is precisely to solve this problem [2]. It allows nodes deliver messages as the way of storing, carrying and forwarding. When there is no forwarding path to the destination node, the relay node stores the information in its own cache, and then waits for the opportunity to contact other nodes in order to send the message towards the destination node. Based on this forwarding mechanism, in the past few years, researchers have put a lot of effort into optimizing routing protocols and forwarding strategies [3-5].