基于机会网络中节点上下文信息的AD-AC机会路由算法

IF 2 3区计算机科学 Q3 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS

Computer Supported Cooperative Work-The Journal of Collaborative Computing Pub Date : 2023-05-24 DOI:10.1109/CSCWD57460.2023.10152610

Yuqi Wang, Gaofeng Zhang, Yanhe Fu, Gang Xu, Fengqi Wei, Kun Yan

{"title":"基于机会网络中节点上下文信息的AD-AC机会路由算法","authors":"Yuqi Wang, Gaofeng Zhang, Yanhe Fu, Gang Xu, Fengqi Wei, Kun Yan","doi":"10.1109/CSCWD57460.2023.10152610","DOIUrl":null,"url":null,"abstract":"Opportunistic networks are mobile self-organizing networks that use the encounter opportunities brought by node movement to achieve communication. However, existing opportunistic routing algorithms rarely consider node context information and cache management at the same time, which leads to network congestion and high energy consumption problems in opportunistic networks. To solve the above problems, this paper defines the node historical activity degree and encounter duration based on the context information of nodes, and designs the AD-AC (historical Activity degree and encounter Duration of nodes-Acknowledgment deletion mechanism) opportunistic routing algorithm based on the context information of nodes by incorporating ACK (Acknowledgment) deletion mechanism. The simulation results indicate that AD-AC can substantially improve the message delivery rate while reducing the network overhead as well as the average hop count of messages.","PeriodicalId":51008,"journal":{"name":"Computer Supported Cooperative Work-The Journal of Collaborative Computing","volume":"140 1","pages":"831-836"},"PeriodicalIF":2.0000,"publicationDate":"2023-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"AD-AC Opportunistic Routing Algorithm Based on Context Information of Nodes in Opportunistic Networks\",\"authors\":\"Yuqi Wang, Gaofeng Zhang, Yanhe Fu, Gang Xu, Fengqi Wei, Kun Yan\",\"doi\":\"10.1109/CSCWD57460.2023.10152610\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Opportunistic networks are mobile self-organizing networks that use the encounter opportunities brought by node movement to achieve communication. However, existing opportunistic routing algorithms rarely consider node context information and cache management at the same time, which leads to network congestion and high energy consumption problems in opportunistic networks. To solve the above problems, this paper defines the node historical activity degree and encounter duration based on the context information of nodes, and designs the AD-AC (historical Activity degree and encounter Duration of nodes-Acknowledgment deletion mechanism) opportunistic routing algorithm based on the context information of nodes by incorporating ACK (Acknowledgment) deletion mechanism. The simulation results indicate that AD-AC can substantially improve the message delivery rate while reducing the network overhead as well as the average hop count of messages.\",\"PeriodicalId\":51008,\"journal\":{\"name\":\"Computer Supported Cooperative Work-The Journal of Collaborative Computing\",\"volume\":\"140 1\",\"pages\":\"831-836\"},\"PeriodicalIF\":2.0000,\"publicationDate\":\"2023-05-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computer Supported Cooperative Work-The Journal of Collaborative Computing\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1109/CSCWD57460.2023.10152610\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Supported Cooperative Work-The Journal of Collaborative Computing","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1109/CSCWD57460.2023.10152610","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}

引用次数: 0

摘要

机会网络是利用节点运动带来的相遇机会实现交流的移动自组织网络。然而，现有的机会路由算法很少同时考虑节点上下文信息和缓存管理，从而导致机会网络中的网络拥塞和高能耗问题。针对上述问题，本文根据节点的上下文信息定义节点的历史活动度和相遇持续时间，并结合ACK(确认)删除机制，设计基于节点的上下文信息的AD-AC(节点的历史活动度和相遇持续时间)机会路由算法。仿真结果表明，在降低网络开销和消息平均跳数的同时，AD-AC可以显著提高消息的投递率。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

AD-AC Opportunistic Routing Algorithm Based on Context Information of Nodes in Opportunistic Networks

Opportunistic networks are mobile self-organizing networks that use the encounter opportunities brought by node movement to achieve communication. However, existing opportunistic routing algorithms rarely consider node context information and cache management at the same time, which leads to network congestion and high energy consumption problems in opportunistic networks. To solve the above problems, this paper defines the node historical activity degree and encounter duration based on the context information of nodes, and designs the AD-AC (historical Activity degree and encounter Duration of nodes-Acknowledgment deletion mechanism) opportunistic routing algorithm based on the context information of nodes by incorporating ACK (Acknowledgment) deletion mechanism. The simulation results indicate that AD-AC can substantially improve the message delivery rate while reducing the network overhead as well as the average hop count of messages.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Computer Supported Cooperative Work-The Journal of Collaborative Computing COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS-

CiteScore

6.40

自引率

4.20%

发文量

审稿时长

>12 weeks

期刊介绍： Computer Supported Cooperative Work (CSCW): The Journal of Collaborative Computing and Work Practices is devoted to innovative research in computer-supported cooperative work (CSCW). It provides an interdisciplinary and international forum for the debate and exchange of ideas concerning theoretical, practical, technical, and social issues in CSCW. The CSCW Journal arose in response to the growing interest in the design, implementation and use of technical systems (including computing, information, and communications technologies) which support people working cooperatively, and its scope remains to encompass the multifarious aspects of research within CSCW and related areas. The CSCW Journal focuses on research oriented towards the development of collaborative computing technologies on the basis of studies of actual cooperative work practices (where ‘work’ is used in the wider sense). That is, it welcomes in particular submissions that (a) report on findings from ethnographic or similar kinds of in-depth fieldwork of work practices with a view to their technological implications, (b) report on empirical evaluations of the use of extant or novel technical solutions under real-world conditions, and/or (c) develop technical or conceptual frameworks for practice-oriented computing research based on previous fieldwork and evaluations.