Delay tolerant networks can facilitate communication in the aftermath of disasters and emergency situations. However, the routing of messages between the nodes in such sparsely connected networks could be challenging. There have been many algorithms proposed to increase the delivery likelihood of messages while staying in the limitations of such challenged environments. In almost all of these studies, the routing problem has been considered between a source and destination pair. However, the communication between different source-destination pairs may be correlated and the delivery of one message may trigger another message routing process (e.g., a response back or separate message to another node). In this paper, we study such a cascaded delivery process in delay tolerant networks, in which there is a chain of source-destination pairs that are connected in terms of their message generation. We utilize a multi-copy based routing scheme and propose integrating in-network computing at relay nodes in order to achieve an efficient routing scheme with increased delivery ratio and reduced delay without increasing the number of message forwardings. Moreover, to address the potential privacy issues, we also utilize homomorphic encryption based computations. We evaluate the proposed scheme via simulations and show that it can improve the routing performance without releasing the content of intermediate messages to unintended destinations.
{"title":"Integrating In-Network Computing for Secure and Efficient Cascaded Delivery in DTNs","authors":"E. Bulut, M. Yuksel","doi":"10.1109/NMIC.2019.00009","DOIUrl":"https://doi.org/10.1109/NMIC.2019.00009","url":null,"abstract":"Delay tolerant networks can facilitate communication in the aftermath of disasters and emergency situations. However, the routing of messages between the nodes in such sparsely connected networks could be challenging. There have been many algorithms proposed to increase the delivery likelihood of messages while staying in the limitations of such challenged environments. In almost all of these studies, the routing problem has been considered between a source and destination pair. However, the communication between different source-destination pairs may be correlated and the delivery of one message may trigger another message routing process (e.g., a response back or separate message to another node). In this paper, we study such a cascaded delivery process in delay tolerant networks, in which there is a chain of source-destination pairs that are connected in terms of their message generation. We utilize a multi-copy based routing scheme and propose integrating in-network computing at relay nodes in order to achieve an efficient routing scheme with increased delivery ratio and reduced delay without increasing the number of message forwardings. Moreover, to address the potential privacy issues, we also utilize homomorphic encryption based computations. We evaluate the proposed scheme via simulations and show that it can improve the routing performance without releasing the content of intermediate messages to unintended destinations.","PeriodicalId":170708,"journal":{"name":"2019 IEEE First International Workshop on Network Meets Intelligent Computations (NMIC)","volume":"232 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114742930","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Xuefeng Ji, Wenquan Xu, Chuwen Zhang, Tong Yun, Gong Zhang, Xiaojun Wang, Yunsheng Wang, B. Liu
In Vehicular Ad Hoc NETworks (VANET), dynamic topology changes of network and inconstant bandwidth make it hard to maintain an end-to-end path to complete long-time stable data transmission. Facing this challenge, researchers have proposed the hybrid routing approach, which tries to combine both the advantages of recalculating route when topology changes and looking up routing table as long as the network topology is relatively stable. However, the existing hybrid routing algorithms can easily cause the blind path problem, meaning a route entry is kept in the routing table without expiration according to the timeout mechanism but it is actually invalid, because the next hop is already unavailable. To address this issue, we propose a Reinforcement learning based Hybrid Routing algorithm (RHR) that can online track the available paths with their status and use packet-carry-on information as real-time feedback to guide routing. RHR keeps the forwarding path always the freshest and thus improves the system performance. Simulation results show that RHR achieves better performance in packet delivery ratio (PDR), roundtrip time (RTT) and overhead than other peers under different scenarios of network scale, request frequency and vehicle velocity.
{"title":"Keep Forwarding Path Freshest in VANET via Applying Reinforcement Learning","authors":"Xuefeng Ji, Wenquan Xu, Chuwen Zhang, Tong Yun, Gong Zhang, Xiaojun Wang, Yunsheng Wang, B. Liu","doi":"10.1109/NMIC.2019.00008","DOIUrl":"https://doi.org/10.1109/NMIC.2019.00008","url":null,"abstract":"In Vehicular Ad Hoc NETworks (VANET), dynamic topology changes of network and inconstant bandwidth make it hard to maintain an end-to-end path to complete long-time stable data transmission. Facing this challenge, researchers have proposed the hybrid routing approach, which tries to combine both the advantages of recalculating route when topology changes and looking up routing table as long as the network topology is relatively stable. However, the existing hybrid routing algorithms can easily cause the blind path problem, meaning a route entry is kept in the routing table without expiration according to the timeout mechanism but it is actually invalid, because the next hop is already unavailable. To address this issue, we propose a Reinforcement learning based Hybrid Routing algorithm (RHR) that can online track the available paths with their status and use packet-carry-on information as real-time feedback to guide routing. RHR keeps the forwarding path always the freshest and thus improves the system performance. Simulation results show that RHR achieves better performance in packet delivery ratio (PDR), roundtrip time (RTT) and overhead than other peers under different scenarios of network scale, request frequency and vehicle velocity.","PeriodicalId":170708,"journal":{"name":"2019 IEEE First International Workshop on Network Meets Intelligent Computations (NMIC)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132386156","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Title Page i","authors":"","doi":"10.1109/nmic.2019.00001","DOIUrl":"https://doi.org/10.1109/nmic.2019.00001","url":null,"abstract":"","PeriodicalId":170708,"journal":{"name":"2019 IEEE First International Workshop on Network Meets Intelligent Computations (NMIC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129799332","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Publisher's Information","authors":"","doi":"10.1109/nmic.2019.00011","DOIUrl":"https://doi.org/10.1109/nmic.2019.00011","url":null,"abstract":"","PeriodicalId":170708,"journal":{"name":"2019 IEEE First International Workshop on Network Meets Intelligent Computations (NMIC)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116986121","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"[Title page iii]","authors":"","doi":"10.1109/nmic.2019.00002","DOIUrl":"https://doi.org/10.1109/nmic.2019.00002","url":null,"abstract":"","PeriodicalId":170708,"journal":{"name":"2019 IEEE First International Workshop on Network Meets Intelligent Computations (NMIC)","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123194625","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Interest Flooding Attack (IFA) is one of the main security threats for the Named Data Networking (NDN). Most of its existing countermeasures enable intermediate routers near the attackers to independently detect the attack and consider the typical attack scenario in which attackers directly send malicious Interests at a constant and relatively high rate. Moreover, they may also throttle legitimate Interests when enforcing the existing defence measures at intermediate routers as it is still difficult for them to distinguish the Interests issued by attackers from those issued by legitimate consumers. Instead, this work aims at a more sophisticated attack scenario in which attackers start the attack at a relatively lower rate but gradually speed up to keep the Pending Interest Tables (PITs) of the victims increasing to finally deplete the PIT resources for legitimate consumers. It is relatively difficult for intermediate routers to independently and timely detect such a sophisticated IFA. To solve this problem, we propose a mechanism to detect the sophisticated IFA from the network-wide view. A central controller monitors the network and makes a comprehensive and prompt decision on whether there is an ongoing IFA based on the overall state of the whole network collected from the abnormity information reports sent by the first-hop routers of attackers. Attack sources can be directly located after an IFA is determined and then the malicious Interests can be prevented from entering the network without throttling legitimate Interests. We conduct an experimental study to evaluate the performance of the proposed mechanism and explore the parameter settings of the attack detection algorithm at access routers. The experimental results validate that our mechanism can timely detect and mitigate the sophisticated IFA without throttling requests from legitimate consumers.
{"title":"Detecting and Mitigating A Sophisticated Interest Flooding Attack in NDN from the Network-Wide View","authors":"Guang Cheng, Lixia Zhao, Xiaoyan Hu, Shaoqi Zheng, Hua Wu, Ruidong Li, Chengyu Fan","doi":"10.1109/NMIC.2019.00007","DOIUrl":"https://doi.org/10.1109/NMIC.2019.00007","url":null,"abstract":"Interest Flooding Attack (IFA) is one of the main security threats for the Named Data Networking (NDN). Most of its existing countermeasures enable intermediate routers near the attackers to independently detect the attack and consider the typical attack scenario in which attackers directly send malicious Interests at a constant and relatively high rate. Moreover, they may also throttle legitimate Interests when enforcing the existing defence measures at intermediate routers as it is still difficult for them to distinguish the Interests issued by attackers from those issued by legitimate consumers. Instead, this work aims at a more sophisticated attack scenario in which attackers start the attack at a relatively lower rate but gradually speed up to keep the Pending Interest Tables (PITs) of the victims increasing to finally deplete the PIT resources for legitimate consumers. It is relatively difficult for intermediate routers to independently and timely detect such a sophisticated IFA. To solve this problem, we propose a mechanism to detect the sophisticated IFA from the network-wide view. A central controller monitors the network and makes a comprehensive and prompt decision on whether there is an ongoing IFA based on the overall state of the whole network collected from the abnormity information reports sent by the first-hop routers of attackers. Attack sources can be directly located after an IFA is determined and then the malicious Interests can be prevented from entering the network without throttling legitimate Interests. We conduct an experimental study to evaluate the performance of the proposed mechanism and explore the parameter settings of the attack detection algorithm at access routers. The experimental results validate that our mechanism can timely detect and mitigate the sophisticated IFA without throttling requests from legitimate consumers.","PeriodicalId":170708,"journal":{"name":"2019 IEEE First International Workshop on Network Meets Intelligent Computations (NMIC)","volume":"189 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128772093","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：