Trusted network coding framework

H. Al-Najjar, Nadia Rousan
{"title":"Trusted network coding framework","authors":"H. Al-Najjar, Nadia Rousan","doi":"10.1109/ICON.2012.6506542","DOIUrl":null,"url":null,"abstract":"Previous works on the network coding focused on applying cryptographic theorems on wireless and wired network to protect the network from the malicious packets. In this paper a new framework to create a trust model between the sink node and the source node is proposed, in which the new framework used a logistic map chaotic model within the trust approach to increase the uncertainty in the generated values. The main idea of this model is to send the chaotic code within each packet, so the sink can validate if the packet is accepted or not depending on the received code. The proposed model is divided into two phases: startup phase to initial the connection between two ends and running phase to start trust sending and trust routing to the packets. For the trust routing, new model is suggested to route the packet to the sink node and to change the status of the coding nodes. Two theoretical models are suggested to describe the behaviour of the proposed framework as follow: the knowledge packets model and the energy consumption model. After evaluating and analyzing the proposed framework using different scenarios and cases, the proposed system shows that it can achieve low overhead, low traffic, and will maximize the lifetime of the system.","PeriodicalId":234594,"journal":{"name":"2012 18th IEEE International Conference on Networks (ICON)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 18th IEEE International Conference on Networks (ICON)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICON.2012.6506542","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Previous works on the network coding focused on applying cryptographic theorems on wireless and wired network to protect the network from the malicious packets. In this paper a new framework to create a trust model between the sink node and the source node is proposed, in which the new framework used a logistic map chaotic model within the trust approach to increase the uncertainty in the generated values. The main idea of this model is to send the chaotic code within each packet, so the sink can validate if the packet is accepted or not depending on the received code. The proposed model is divided into two phases: startup phase to initial the connection between two ends and running phase to start trust sending and trust routing to the packets. For the trust routing, new model is suggested to route the packet to the sink node and to change the status of the coding nodes. Two theoretical models are suggested to describe the behaviour of the proposed framework as follow: the knowledge packets model and the energy consumption model. After evaluating and analyzing the proposed framework using different scenarios and cases, the proposed system shows that it can achieve low overhead, low traffic, and will maximize the lifetime of the system.
可信网络编码框架
以往在网络编码方面的工作主要集中在无线和有线网络上应用加密定理来保护网络免受恶意数据包的攻击。本文提出了一种建立汇聚节点和源节点之间信任模型的新框架,该框架在信任方法中使用逻辑映射混沌模型来增加生成值的不确定性。该模型的主要思想是在每个数据包中发送混沌代码,因此接收器可以根据接收到的代码来验证数据包是否被接受。该模型分为两个阶段:启动阶段,用于初始化两端之间的连接;运行阶段,用于启动对数据包的信任发送和信任路由。对于信任路由,提出了将报文路由到汇聚节点并改变编码节点状态的新模型。提出了两个理论模型来描述所提出的框架的行为:知识包模型和能量消耗模型。在使用不同的场景和案例对所提出的框架进行评估和分析后,所提出的系统表明,它可以实现低开销,低流量,并将最大限度地提高系统的生命周期。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信