Unweighted Voting Method to Detect Sinkhole Attack in RPL-Based Internet of Things Networks

The Internet of Things(IoT)consists of interconnected smart devices communicating and collecting data.The Routing Protocol for Low-Power and Lossy Networks(RPL)is the standard protocol for Internet Protocol Version 6(IPv6)in the IoT.However,RPL is vulnerable to various attacks,including the sinkhole attack,which disrupts the network by manipulating routing information.This paper proposes the Unweighted Voting Method(UVM)for sinkhole node identification,utilizing three key behavioral indicators:DODAG Information Object(DIO)Transaction Frequency,Rank Harmony,and Power Consumption.These indicators have been carefully selected based on their contribution to sinkhole attack detection and other relevant features used in previous research.The UVM method employs an unweighted voting mechanism,where each voter or rule holds equal weight in detecting the presence of a sinkhole attack based on the proposed indicators.The effectiveness of the UVM method is evaluated using the COOJA simulator and compared with existing approaches.Notably,the proposed approach fulfills power consumption requirements for constrained nodes without increasing consumption due to the deployment design.In terms of detection accuracy,simulation results demonstrate a high detection rate ranging from 90%to 100%,with a low false-positive rate of 0%to 0.2%.Consequently,the proposed approach surpasses Ensemble Learning Intrusion Detection Systems by leveraging three indicators and three supporting rules.

LLN中基于环路避免的高效路由修复算法

针对低功耗有损网络(low power and lossy networks,LLN)中现有路由修复算法存在控制开销冗余、修复时延较大和路由环路等问题,提出一种LLN中基于环路避免的高效路由修复算法(highly-efficient loop-free based repair routing protocol for LLN,HLR-RPL)。该算法提出了3个优化思路:首先,采用一种修正后的面向目的地的有向无循环图(destination oriented directed acyclic graph,DODAG)信息请求消息(DODAG information solicitation amend,DIS-A),使得链路中断通告过程和寻路过程同时进行;其次,提出一种减少控制消息回复机制,避免所有接收到DIS-A消息的节点均回复DODAG信息对象消息;最后,提出一种链路中断节点的子节点切换机制,从而优化了网络拓扑。仿真结果表明,HLR-RPL算法在控制开销和路由修复时延等性能方面优于现有的路由修复算法,且能够彻底避免路由环路的产生。

一种高能效低时延的LLN路由修复算法

由于低功耗有损网络(LLN)中无线链路的不稳定性和有损性,外部环境的干扰极易导致网络出现故障,从而严重影响网络性能,而LLN网络中现有路由修复算法存在控制开销冗余和修复时延较大等问题。为此,提出了一种高能效低时延的LLN路由修复算法(EELDR-RPL)。该算法通过采用"零额外控制开销通告链路故障及邻居节点信息"机制,使得链路故障节点的子节点能够及时获知链路故障以及链路故障节点的邻居情况;通过采用"自适应调整节点网络深度值"机制,使得链路故障节点能够快速地重新接入网络;通过采用"链路故障节点子节点自适应切换"机制,能够达到优化网络拓扑的目的。仿真结果表明,与现有路由修复算法相比,EELDR-RPL算法能够有效地降低路由修复时延和减少控制开销。

基于负载均衡的高能效LLN路由协议

由于低功耗有损网络LLN (low power and lossy networks)呈树形结构且节点的能量受限,一旦网络中出现能量瓶颈节点而未及时处理,将会严重影响网络各方面性能。因此提出一种基于负载均衡的高能效LLN路由协议。当检测出能量瓶颈节点后,对溪流计时器重置策略进行改进,及时将能量瓶颈节点能量不足的状态通告给其子节点。提出一种能量瓶颈节点子节点的切换机制,旨在降低能量瓶颈节点的能耗速率,实现节点高能效。仿真结果表明,该方法在网络生存时间和节点死亡率等性能方面优于现有路由算法,其中网络平均生存时间延长了10.53%,节点死亡率降低了18.59%。

LLN中基于负载均衡的单路径路由协议

由于低功耗有损网络(low power and lossy networks,LLN)中的单路径路由协议在网络拓扑的构建过程中存在不能较好地均衡节点能耗速率和延长网络寿命等问题,提出一种基于负载均衡的单路径LLN路由协议(load balance-based single path routing protocol for LLN,LB-RPL)。在选择备选父节点的过程中对无线链路质量、节点剩余能量和节点缓存占用率依次进行考量;在计算路由度量的过程中综合考虑多种路由判据,避免单一路由判据对网络性能造成的影响;依据整条路径上的数据传输代价选择节点的最优父节点。理论分析和仿真结果表明,相对于现有单路径LLN路由协议,LB-RPL能够有效均衡节点能耗、延长网络寿命并提高路由可靠性。

多汇聚LLN中基于双向父节点选择的高效RPL路由协议

针对当前多汇聚LLN中RPL路由协议存在的雷鸣效应、待入网节点唯一决定父节点选择以及数据传输利用网络资源不够合理等问题,提出BPSM-ERPL——一种基于双向父节点选择的高效RPL改进路由协议。改进M-DAO消息使其携带数据传输速率信息,采用双向父节点选择新机制,防止大量待入网节点选择同一父节点,通过边界路由节点使数据在多个RPL实例中合理分配。理论分析和仿真实验结果表明,所提协议的网络吞吐量、数据分组传送成功率和网络生存时间优于现有相关协议。

高负载场景下基于负载均衡的LLN路由协议

针对低功耗有损网络(Low-power and Lossy Network,LLN)中由于无线链路的有损特性导致在高负载场景下无法较好地实现负载均衡的问题,提出一种高负载场景下基于负载均衡的LLN路由协议(HSLB-RPL)。在该协议中,为了避免期望传输次数较大的备选父节点被选作为最优父节点,综合考虑当前节点和其备选父节点的期望传输次数;当检测到节点负载较重时,为了降低其被邻居节点选作为最优父节点的概率,对其DIO控制消息的发送时间间隔进行调整;当节点发生网络拥塞时,设计一种网络拥塞通告消息(NCN),及时地对当前网络拥塞状态进行通告。仿真结果表明,相对于已有协议,HSLB-RPL协议能够有效地实现负载均衡,其中网络平均寿命延长了23.57%,根节点平均吞吐量提高了14.52%,归一化控制开销较低了12.87%。

流量自适应分配的多汇聚节点LLN路由协议

针对低功耗有损网络(low power and lossy network,LLN)中负载不均衡以及高控制开销的问题,提出一种基于流量自适应分配的多汇聚节点LLN路由协议(traffic adaptive assignment based multi-sink routing protocol for LLN,TAAM-RPL)。介于多个汇聚节点之间的节点可同时加入到多个RPL实例中;在不增加额外控制开销的前提下,多重身份节点便可获知其到达各个汇聚节点整条路径的负载状态;多重身份节点可根据其到达各个汇聚节点整条路径的负载状态进行数据流量自适应分配。仿真结果表明,该协议可行有效,能够提升网络各方面性能。

LLN中基于混合式的网络拥塞控制路由算法

由于低功耗有损网络(Low Power and Lossy Networks,LLN)中现有网络拥塞控制路由算法无法高效地对当前网络拥塞进行缓解,因此提出一种基于混合式的网络拥塞控制路由算法(Hybrid-based Network Congestion Control Routing Algorithm,HNCCRA)。该算法主要包含3个创新点。首先,为了有效地降低网络拥塞的发生概率,在组网过程中,每个节点依据其备选父节点的负载状态进行父节点的选择;其次,为了避免网络拥塞节点的子节点在更换数据传输路径时选择处于重负载状态的备选父节点作为新的父节点,在网络拓扑维护过程中每个节点实时通告自身负载状态;最后,为了能够高效地缓解当前的网络拥塞,结合数据分流思想和更换数据传输路径的方式进行网络拥塞控制。仿真结果表明,与LLN中现有网络拥塞控制路由算法相比,HNCCRA算法能够有效地提升网络各方面的性能,其中网络拥塞的发生概率降低了19.89%,汇聚节点的平均吞吐量增加了11.35%,网络的平均寿命延长了9.75%。

LOA-RPL:Novel Energy-Efficient Routing Protocol for the Internet of Things Using Lion Optimization Algorithm to Maximize Network Lifetime

Energy conservation is a significant task in the Internet of Things(IoT)because IoT involves highly resource-constrained devices.Clustering is an effective technique for saving energy by reducing duplicate data.In a clustering protocol,the selection of a cluster head(CH)plays a key role in prolonging the lifetime of a network.However,most cluster-based protocols,including routing protocols for low-power and lossy networks(RPLs),have used fuzzy logic and probabilistic approaches to select the CH node.Consequently,early battery depletion is produced near the sink.To overcome this issue,a lion optimization algorithm(LOA)for selecting CH in RPL is proposed in this study.LOA-RPL comprises three processes:cluster formation,CH selection,and route establishment.A cluster is formed using the Euclidean distance.CH selection is performed using LOA.Route establishment is implemented using residual energy information.An extensive simulation is conducted in the network simulator ns-3 on various parameters,such as network lifetime,power consumption,packet delivery ratio(PDR),and throughput.The performance of LOA-RPL is also compared with those of RPL,fuzzy rule-based energyefficient clustering and immune-inspired routing(FEEC-IIR),and the routing scheme for IoT that uses shuffled frog-leaping optimization algorithm(RISARPL).The performance evaluation metrics used in this study are network lifetime,power consumption,PDR,and throughput.The proposed LOARPL increases network lifetime by 20%and PDR by 5%–10%compared with RPL,FEEC-IIR,and RISA-RPL.LOA-RPL is also highly energy-efficient compared with other similar routing protocols.

BE-RPL:Balanced-load and Energy-efficient RPL

Internet of Things(IoT)empowers imaginative applications and permits new services when mobile nodes are included.For IoT-enabled low-power and lossy networks(LLN),the Routing Protocol for Low-power and Lossy Networks(RPL)has become an established standard routing protocol.Mobility under standard RPL remains a difficult issue as it causes continuous path disturbance,energy loss,and increases the end-to-end delay in the network.In this unique circumstance,a Balanced-load and Energy-efficient RPL(BE-RPL)is proposed.It is a routing technique that is both energy-efficient and mobility-aware.It responds quicker to link breakage through received signal strength-based mobility monitoring and selecting a new preferred parent reactively.The proposed system also implements load balancing among stationary nodes for leaf node allocation.Static nodes with more leaf nodes are restricted from participating in the election for a new preferred parent.The performance of BE-RPL is assessed using the COOJA simulator.It improves the energy use,network control overhead,frame acknowledgment ratio,and packet delivery ratio of the network.

基于簇父集协作通信的低功耗有损网络路由算法优化

针对当前低功耗有损网络(LLN)中基于簇父集协作通信的路由算法(CRPL)没有考虑节点剩余能量,存在不能有效地均衡节点能耗和最大化延长网络寿命的问题,提出一种高效的基于簇父集协作通信的低功耗有损网络路由(RPL)算法(HE-CRPL)。所提算法采取了三个优化思路:一是同时考虑节点间无线链路质量和节点剩余能量进行簇父节点的选择;二是在簇父节点优先级判定和最优簇父集的选择过程中把节点间的无线链路质量和簇父节点的期望寿命(ELT)相结合;三是在网络拓扑初始化的过程中通过利用目的地通告对象(DAO)消息携带簇父节点优先级列表告知最优簇父集中簇父节点的优先级顺序。仿真结果表明,与CRPL算法相比,HE-CRPL算法在延长网络生存时间、提高数据包投递成功率和减少数据包重传次数等方面的性能得到了提升,其中网络生存时间提高了18.7%,数据包重传次数降低了15.9%。

基于期望寿命的能量均衡RPL研究

目前基于能量均衡的低功耗有损网络路由协议RPL(Routing Protocol for Lowpower and lossy networks)在网络拓扑构建的过程中由于未考虑备选父节点上一跳节点的期望寿命,从而导致所构建的网络不能较好地实现能量均衡的问题。对此提出一种基于期望寿命的能量均衡RPL(Expected Life Time-based Energy Balance RPL,ELT-EB-RPL)。构造一种复合路由判据,包括传输跳数、期望传输次数和节点期望寿命,同时,节点在选择最优父节点时需综合考虑其备选父节点及备选父节点上一跳节点的期望寿命。在不增加额外控制开销的前提下,提出一种“节点间期望寿命信息通告”策略,以便节点作出正确的路由选择。通过仿真实验对该方案的性能进行了对比分析。结果表明,在不同发包速率下该方案能够有效实现能量均衡和延长网络寿命。

一种高效低时延的RPL跨层优化机制

低功耗有损网络路由协议RPL中的路由度量存在一定局限性,从而导致网络拓扑不均衡以及数据传输路径非最优等问题。提出一种高效低时延的RPL跨层优化机制CL-ORPL。综合考虑网络深度、链路队列利用率以及期望传输次数等多种度量,以完善最优父节点选择机制。目的地通告对象确认消息(DAO-ACK)携带上一跳节点信息,通过跨层旁听DAO-ACK消息建立两跳横向路由。仿真结果表明,CL-ORPL机制的数据传输平均端到端时延、数据传输成功率以及网络生存时间等性能优于RPL和QU-RPL协议。

一种基于博弈论的物联网路由策略研究

物联网的普及,对物联网的信息安全提出了更高的要求。低功耗有损网络(Routing Protocol for LLN,RPL)是主流的物联网通信协议,RPL根据中继节点的通信距离构建有向无环图(Destination Oriented Directed Acyclic Graph,DODAG),以规划数据路由的路径。RPL协议无法应对主流的安全攻击,针对RPL设计一种低成本高可靠性的路由策略是目前物联网信息安全研究的一个主要方向。本文基于非合作博弈理论,设计了一种可以根据RPL协议中的节点上下文信息,发现并避让不良节点的路由策略。该方法的特点在于能够以较低的功耗开支提供与主流的加密策略相近的安全防护能力。仿真结果表明,所提方法在节点密度较高情况下性能良好。

低功耗有损网络安全路由协议研究综述

随着物联网不断飞速发展,低功耗有损网络(LLN)的研究与应用成为一种发展趋势。首先,介绍了6LoWPAN与低功耗有损网络路由协议(RPL)的基本原理和结构;其次,总结了LLN中RPL所面对的主要安全威胁以及应对方法,根据协议所采用的不同策略进行归纳、分类和比较;然后,对国内外已有安全RPL研究情况进行了介绍和分析,同时对现有安全威胁和解决方案进行了总结;最后,提出了在大规模、移动性、自组织、低功耗的RPL中需要进一步研究的安全问题和发展趋势。

能量均衡的低功耗有损网络路由协议

针对目前低功耗有损网络路由协议(RPL)中存在节点能耗不均衡、网络生存时间短以及网络后期父节点状态信息更新不及时的问题,提出一种带有电量估算策略的能量均衡RPL(EB-RPL)。首先,构造了一种复合期望传输次数和节点剩余能量的路由度量,通过机制设计使节点在不同时期能自适应地调整网络拓扑;然后,设计了一种基于能量消耗速率的父节点电量估算策略,在不增加额外控制包开销的同时,子节点可以计算父节点电量,作出正确的路由决策;最后,通过实验对比分析了EB-RPL的性能。仿真结果显示,与RPL相比,EB-RPL显著降低了同级节点间功率标准差,并且在不同发包频率和网络规模中,分别平均延长了29.4%和39.4%的平均网络生存时间。EB-RPL能够有效实现能量均衡、显著延长网络生存时间。

面向低功耗有损网络的RPL协议性能评价

RPL协议被认为是主流的物联网路由协议,其性能与目标函数有着密切关系。本文将详细分析不同目标函数对RPL在网络组建时间、能耗、包投递率、包时延和路由控制开销等性能方面的影响。实验数据显示,目标函数对RPL包时延影响较小;在可靠性方面,采用MRHOF的RPL要优于采用OF0的RPL,但前者要付出较高的代价,如较高的路由控制开销与能耗等。最后给出了目标函数研究建议。

A novel context-aware RPL algorithm based on a triangle module operator

For the use in low-power and lossy networks(LLNs)under complex and harsh communication conditions,the routing protocol for LLNs(RPL)standardized by the Internet Engineering Task Force is specially designed.To improve the performance of LLNs,we propose a novel context-aware RPL algorithm based on a triangle module operator(CAR-TMO).A novel composite context-aware routing metric(CA-RM)is designed,which synchronously evaluates the residual energy index,buffer occupancy ratio of a node,expected transmission count(ETX),delay,and hop count from a candidate parent to the root.CA-RM considers the residual energy index and buffer occupancy ratio of the candidate parent and its preferred parent in a recursive manner to reduce the effect of upstream parents,since farther paths are considered.CA-RM comprehensively uses the sum,mean,and standard deviation values of ETX and delay of links in a path to ensure a better performance.Moreover,in CAR-TMO,the membership function of each routing metric is designed.Then,a comprehensive membership function is constructed based on a triangle module operator,the membership function of each routing metric,and a comprehensive context-aware objective function.A novel mechanism for calculating the node rank and the mechanisms for preferred parent selection are proposed.Finally,theoretical analysis and simulation results show that CAR-TMO outperforms several state-of-the-art RPL algorithms in terms of the packet delivery ratio and energy efficiency.