Abstract
In the big data environment, Socially Aware Networking (SAN) can obtain a large amount of status data and social contacts of network nodes. If the information is fully analyzed and utilized, it will effectively improve the energy efficiency and performance of SAN. To address this issue, Energy and Cache Aware Routing Algorithm (ECARA) is proposed that comprehensively utilizes node energy and cache information. First, a probability model of encounters is established by using the historical encounter information between nodes in the network. Then, the residual energy ratio of the node is introduced. They are used to predict the delivery probability of the current node. At the same time, a node cache utilization ratio model is also established. In the end, the algorithm comprehensively considers the prediction value of delivery probability and node cache utilization ratio. The optimal relay node is selected to forward the message. Through the forwarding of many relay nodes, the message is finally delivered to the destination node. Simulation results demonstrate that the ECARA exhibits a superior message delivery ratio compared to other classical algorithms. It also can effectively prevent network congestion and improve network throughput.
Similar content being viewed by others
Data Availability
Data available on request from the authors.
Code Availability
Code available on request from the authors.
References
Xiong, Z. G., Xiao, N., Xu, F., Zhang, X. M., Xu, Q., Zhang, K. B., & Ye, C. H. (2021). An equivalent exchange based data forwarding incentive scheme for socially aware networks. Journal of Signal Processing Systems, 93(1), 249–263.
Tsugawa, S. (2019). A survey of social network analysis techniques and their applications to socially aware networking. IEICE Transactions on Communications, 102(1), 17–39.
Tan, Q. Y., Liu, D. D., & Zhang, J. (2018). Research on adaptive congestion control mechanism in delay tolerance networks. Computer Engineering and Applications, 54(11), 109–115.
Zhao, H. T., Cheng, H. L., Ding, Y., Zhang, H., & Zhu, H. B. (2020). Research on traffic accident risk prediction algorithm for vehicle connected edge network based on deep learning. Journal of Electronics and Information Technology, 42(1), 50–57.
Musolesi, M., & Mascolo, C. (2008). Car: Context-aware adaptive routing for delay-tolerant mobile networks. IEEE Transactions on Mobile Computing, 8(2), 246–260.
Paolo, C., Saiful, A., Marco, Z., & Michele, Z. (2018). Underwater delay-tolerant routing via probabilistic spraying. IEEE Access, 6, 77767–77784.
Liu, G., & Li, Y. M. (2018). Research on spread routing protocol for delay tolerance networks. Measurement and Control Technology, 37(12), 62–65.
Pathak, S., Gondaliya, N., & Raja, N. (2017). A survey on prophet based routing protocol in delay tolerant network. In 2017 International Conference on Emerging Trends & Innovation in ICT (ICEI), pages 110–115. IEEE.
Balaji, S. B., Krishnan, M. N., Vajha, M., Ramkumar, V., Sasidharan, B., & Kumar, P. V. (2018). Erasure coding for distributed storage: An overview. Science China Information Sciences, 61, 1–45.
Jain, S., Shah, R. C., Brunette, W., Borriello, G., & Roy, S. (2006). Exploiting mobility for energy efficient data collection in wireless sensor networks. Mobile networks and Applications, 11, 327–339.
Abdelmoumen, M., Dhib, E., Frikha, M., & Chahed, T. (2010). How to improve the performance in delay tolerant networks under manhattan mobility model. In 21st Annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, pages 2008–2013. IEEE.
Grossglauser, M., & Tse, D. N. C. (2002). Mobility increases the capacity of ad hoc wireless networks. IEEE/ACM transactions on networking, 10(4), 477–486.
Kumar, S., Tripathy, P., Dwivedi, K., & Pandey, S. (2019). Improved prophet routing algorithm for opportunistic networks. In Advances in Data and Information Sciences: Proceedings of ICDIS 2017, Volume 2, pages 303–312. Springer.
Balaram, A., Sakthivel, T., & Chandan, R. R. (2023). A context-aware improved por protocol for delay tolerant networks. Automatika: časopis za automatiku, mjerenje, elektroniku, računarstvo i komunikacije, 64(1):22–33.
Zhou, C. Y., & Pang, D. (2021). Opportunistic network routing algorithm based on node attributes and cache management. Journal of BeijingJiaotong University, 45(2), 71–79.
Qiu, M. K., Guo, M. Y., Liu, M. Q., Xue, C. J., Yang, L. T., & Sha, E. H. M. (2009). Loop scheduling and bank type assignment for heterogeneous multi-bank memory. Journal of Parallel and Distributed Computing, 69(6), 546–558.
Huang, H., Chaturvedi, V., Quan, G., Fan, J., & Qiu, M. K. (2014). Throughput maximization for periodic real-time systems under the maximal temperature constraint. ACM Transactions on Embedded Computing Systems (TECS), 13(2), 1–22.
Song, Y., Li, Y. B., Jia, L., & Qiu, M. K. (2019). Retraining strategy-based domain adaption network for intelligent fault diagnosis. IEEE Transactions on Industrial Informatics, 16(9), 6163–6171.
Lindgren, A., Doria, A., & Schelén, O. (2003). Probabilistic routing in intermittently connected networks. ACM SIGMOBILE Mobile Computing and Communications Review, 7(3), 19–20.
Keränen, A., Ott, J., & Kärkkäinen, T. (2009). The one simulator for dtn protocol evaluation. In Proceedings of the 2nd International Conference on Simulation Tools and Techniques, pages 1–10.
Funding
This research was supported by the MOE (Ministry of Education of China) Project of Humanities and Social Sciences (23YJAZH169), the Hubei Provincial Department of Education Outstanding Youth Scientific Innovation Team Support Foundation (T2020017), the Natural Science Foundation of Xiaogan City (XGKJ2022010095).
Author information
Authors and Affiliations
Contributions
Min Deng: Supervision, Conceptualization, Methodology, Writing Review & Editing. Songhao Jiang: Software, Validation, Formal analysis, Writing - Original Draft, Visualization. Fang Xu: Project administration, Conceptualization, Corresponding. Chunmeng Yang: Methodology, algorithm implementation. Na Yang: Visualization. Yuanlin Lyu: algorithm implementation. Zenggang Xiong: Simulation, Formal analysis. Manzoor Ahmed: Methodology, Review & Editing.
Corresponding author
Ethics declarations
Ethical Approval
For this type of study formal consent was not required. This manuscript does not contain any studies with human participants or animals performed by any of the authors.
Competing Interests
The authors have no conflicts of interest to declare for this manuscript.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Deng, M., Jiang, S., Xu, F. et al. Energy and Cache Aware Routing for Socially Aware Networking in the Big Data Environment. J Sign Process Syst 96, 169–178 (2024). https://doi.org/10.1007/s11265-024-01914-x
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11265-024-01914-x