迷宫路由:智能电网中具有信息隐私意识的物联网安全路由

Shiying Yao, Xuanyu Yang, Z. Song, Xiaolong Yang, Dengwei Duan, Haizhou Yang
{"title":"迷宫路由:智能电网中具有信息隐私意识的物联网安全路由","authors":"Shiying Yao, Xuanyu Yang, Z. Song, Xiaolong Yang, Dengwei Duan, Haizhou Yang","doi":"10.1109/CCISP55629.2022.9974237","DOIUrl":null,"url":null,"abstract":"To ensure the security and reliable transmission of private information in Internet of Things for Smart Grid (for short SG-IoT), we proposed a privacy-aware secure routing method (i.e., Maze Routing) based on a novel directional random routing paradigm, which consists of a direction-determined virtual global routing mode and a physical local routing mode. Firstly, for an in-transit packet at the current node, all k-hop nodes are defined as its k-hop wavefronts, and many x-hop wavefronts within k hops are further gathered as a hyper next-hop set. Then, under the direction-determined virtual global routing mode, the packet randomly selects one of elements from the next-hop set by a priority probability as its global next-hop node according to its privacy awareness and End-to-End Quality of Service (E2E QoS) requirement, so as to build a virtual global routing path with a definite direction determined by the destination of this packet. Moreover, under the physical local routing mode, a local pathlet for any two consecutive global next-hop nodes can be built in an ordinary shortest-first routing scheme, then such many pathlets are wired in sequence to constitute a path in whole from source node to destination. Under several loT application scenarios within smart grid, the simulations results show that the proposed maze routing outperforms the existing shortest-first routing method in terms of privacy protection, E2E QoS and communication overhead.","PeriodicalId":431851,"journal":{"name":"2022 7th International Conference on Communication, Image and Signal Processing (CCISP)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Maze Routing: An Information Privacy-aware Secure Routing in Internet of Things for Smart Grid\",\"authors\":\"Shiying Yao, Xuanyu Yang, Z. Song, Xiaolong Yang, Dengwei Duan, Haizhou Yang\",\"doi\":\"10.1109/CCISP55629.2022.9974237\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"To ensure the security and reliable transmission of private information in Internet of Things for Smart Grid (for short SG-IoT), we proposed a privacy-aware secure routing method (i.e., Maze Routing) based on a novel directional random routing paradigm, which consists of a direction-determined virtual global routing mode and a physical local routing mode. Firstly, for an in-transit packet at the current node, all k-hop nodes are defined as its k-hop wavefronts, and many x-hop wavefronts within k hops are further gathered as a hyper next-hop set. Then, under the direction-determined virtual global routing mode, the packet randomly selects one of elements from the next-hop set by a priority probability as its global next-hop node according to its privacy awareness and End-to-End Quality of Service (E2E QoS) requirement, so as to build a virtual global routing path with a definite direction determined by the destination of this packet. Moreover, under the physical local routing mode, a local pathlet for any two consecutive global next-hop nodes can be built in an ordinary shortest-first routing scheme, then such many pathlets are wired in sequence to constitute a path in whole from source node to destination. Under several loT application scenarios within smart grid, the simulations results show that the proposed maze routing outperforms the existing shortest-first routing method in terms of privacy protection, E2E QoS and communication overhead.\",\"PeriodicalId\":431851,\"journal\":{\"name\":\"2022 7th International Conference on Communication, Image and Signal Processing (CCISP)\",\"volume\":\"25 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 7th International Conference on Communication, Image and Signal Processing (CCISP)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CCISP55629.2022.9974237\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 7th International Conference on Communication, Image and Signal Processing (CCISP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCISP55629.2022.9974237","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

为了保证智能电网物联网(简称SG-IoT)中私有信息的安全可靠传输,我们提出了一种基于新型定向随机路由范式的隐私感知安全路由方法(即迷宫路由),该方法由方向确定的虚拟全局路由模式和物理本地路由模式组成。首先,对于当前节点的传输数据包,将所有k-hop节点定义为其k-hop波前,并将k跳内的许多x-hop波前进一步收集为超下一跳集。然后,在方向确定的虚拟全局路由模式下,数据包根据其隐私意识和端到端服务质量(End-to-End Quality of Service, E2E QoS)要求,从按优先级概率设置的下一跳元素中随机选择一个元素作为其全局下一跳节点,从而构建由数据包目的地决定方向明确的虚拟全局路由路径。此外,在物理本地路由模式下,普通的最短优先路由方案可以为任意两个连续的全局下一跳节点建立一个本地路径,然后将这些路径按顺序连接,构成从源节点到目的节点的一条完整路径。在智能电网的多个loT应用场景下,仿真结果表明,本文提出的迷宫路由在隐私保护、端到端QoS和通信开销方面优于现有的最短优先路由方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Maze Routing: An Information Privacy-aware Secure Routing in Internet of Things for Smart Grid
To ensure the security and reliable transmission of private information in Internet of Things for Smart Grid (for short SG-IoT), we proposed a privacy-aware secure routing method (i.e., Maze Routing) based on a novel directional random routing paradigm, which consists of a direction-determined virtual global routing mode and a physical local routing mode. Firstly, for an in-transit packet at the current node, all k-hop nodes are defined as its k-hop wavefronts, and many x-hop wavefronts within k hops are further gathered as a hyper next-hop set. Then, under the direction-determined virtual global routing mode, the packet randomly selects one of elements from the next-hop set by a priority probability as its global next-hop node according to its privacy awareness and End-to-End Quality of Service (E2E QoS) requirement, so as to build a virtual global routing path with a definite direction determined by the destination of this packet. Moreover, under the physical local routing mode, a local pathlet for any two consecutive global next-hop nodes can be built in an ordinary shortest-first routing scheme, then such many pathlets are wired in sequence to constitute a path in whole from source node to destination. Under several loT application scenarios within smart grid, the simulations results show that the proposed maze routing outperforms the existing shortest-first routing method in terms of privacy protection, E2E QoS and communication overhead.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A reliable intra-relay cooperative relay network coupling with spatial modulation for the dynamic V2V communication Research on PCEP Extension for VLAN-based Traffic Forwarding in cloud network integration Analysis of the effect of carbon emissions on meteorological factors in Yunnan province Small Sample Signal Modulation Recognition based on Higher-order Cumulants and CatBoost AFMTD: Anchor-free Frame for Multi-scale Target Detection
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1