The security problems of wireless sensor networks (WSN) have attracted people’s wide attention. In this paper, after we have summarized the existing security problems and solutions in WSN, we find that the insider at...The security problems of wireless sensor networks (WSN) have attracted people’s wide attention. In this paper, after we have summarized the existing security problems and solutions in WSN, we find that the insider attack to WSN is hard to solve. Insider attack is different from outsider attack, because it can’t be solved by the traditional encryption and message authentication. Therefore, a reliable secure routing protocol should be proposed in order to defense the insider attack. In this paper, we focus on insider selective forwarding attack. The existing detection mechanisms, such as watchdog, multipath retreat, neighbor-based monitoring and so on, have both advantages and disadvantages. According to their characteristics, we proposed a secure routing protocol based on monitor node and trust mechanism. The reputation value is made up with packet forwarding rate and node’s residual energy. So this detection and routing mechanism is universal because it can take account of both the safety and lifetime of network. Finally, we use OPNET simulation to verify the performance of our algorithm.展开更多
Extending the lifetime of the wireless sensor networks (WSNs), where recharging sensors is not always possible, has been a major concern for researchers for the past decade. In this paper, we study the cooperation bet...Extending the lifetime of the wireless sensor networks (WSNs), where recharging sensors is not always possible, has been a major concern for researchers for the past decade. In this paper, we study the cooperation between nodes in wireless sensor networks in forwarding packets to others, and we propose a new collaboration technique which stimulates intermediate nodes to forward packets toward their destination. Some nodes show selfish behavior by denying the forwarding packets to other nodes in commercial networks in an effort to preserve their own energy. This paper applies a technique which is used to prolong the network lifetime, based on a node’s energy and trust value, and additionally incorporates fuzzy logic, which stimulates nodes to forward packets by rewarding cooperation. According to simulation results, the proposed approach surpasses the Nuglets (virtual currency) approach and the Reputation approach in network energy and thus prolongs the network lifetime. Additionally, our proposed approach demonstrates better results in the number of dropped packets, PDR and forwarded packets to neighboring nodes.展开更多
Overlapping community detection in a network is a challenging issue which attracts lots of attention in recent years.A notion of hesitant node（HN） is proposed. An HN contacts with multiple communities while the comm...Overlapping community detection in a network is a challenging issue which attracts lots of attention in recent years.A notion of hesitant node（HN） is proposed. An HN contacts with multiple communities while the communications are not strong or even accidental, thus the HN holds an implicit community structure.However, HNs are not rare in the real world network. It is important to identify them because they can be efficient hubs which form the overlapping portions of communities or simple attached nodes to some communities. Current approaches have difficulties in identifying and clustering HNs. A density-based rough set model（DBRSM） is proposed by combining the virtue of densitybased algorithms and rough set models. It incorporates the macro perspective of the community structure of the whole network and the micro perspective of the local information held by HNs, which would facilitate the further ＂growth＂ of HNs in community. We offer a theoretical support for this model from the point of strength of the trust path. The experiments on the real-world and synthetic datasets show the practical significance of analyzing and clustering the HNs based on DBRSM. Besides, the clustering based on DBRSM promotes the modularity optimization.展开更多
The traditional cryptographic security techniques are not sufficient for secure routing of message from source to destination in Wireless Sensor Networks (WSNs), because it requires sophisticated software, hardware, l...The traditional cryptographic security techniques are not sufficient for secure routing of message from source to destination in Wireless Sensor Networks (WSNs), because it requires sophisticated software, hardware, large memory, high processing speed and communication bandwidth. It is not economic and feasible because, depending on the application, WSN nodes are high-volume in number (hence, limited resources at each node), deployment area may be hazardous, unattended and/or hostile and sometimes dangerous. As WSNs are characterized by severely constrained resources and requirement to operate in an ad-hoc manner, security functionality implementation to protect nodes from adversary forces and secure routing of message from source node to base station has become a challenging task. In this paper, we present a direct trust dependent link state routing using route trusts which protects WSNs against routing attacks by eliminating the un-trusted nodes before making routes and finding best trustworthy route among them. We compare our work with the most prevalent routing protocols and show its benefits over them.展开更多
针对区块链边缘节点的部署环境开放、安全措施薄弱、易受到安全攻击,以及计算和网络资源不足等问题,提出一种基于可信执行环境(TEE)的区块链安全架构P-Dledger。该架构通过构建两阶段的信任链,在满足软件便捷迭代的基础上,确保加载部件...针对区块链边缘节点的部署环境开放、安全措施薄弱、易受到安全攻击,以及计算和网络资源不足等问题,提出一种基于可信执行环境(TEE)的区块链安全架构P-Dledger。该架构通过构建两阶段的信任链,在满足软件便捷迭代的基础上,确保加载部件的可信;通过实现智能合约可信执行框架以及基于串行外设接口或非门存储器(SPI NOR Flash)的数据可信存储,保证智能合约的可信计算与数据的可信存储;同时,为共识提案赋予单调递增的唯一标识,限制拜占庭节点的行为。实验与分析结果表明:所提架构确保了加载主体、账本数据与执行过程的安全可信;当网络延时大于60 ms或节点数大于8时,P-Dledger比采用拜占庭容错(PBFT)算法的区块链系统的吞吐量更高,且随着网络延时与节点数的增加,P-Dledger性能表现更稳定。展开更多
文摘The security problems of wireless sensor networks (WSN) have attracted people’s wide attention. In this paper, after we have summarized the existing security problems and solutions in WSN, we find that the insider attack to WSN is hard to solve. Insider attack is different from outsider attack, because it can’t be solved by the traditional encryption and message authentication. Therefore, a reliable secure routing protocol should be proposed in order to defense the insider attack. In this paper, we focus on insider selective forwarding attack. The existing detection mechanisms, such as watchdog, multipath retreat, neighbor-based monitoring and so on, have both advantages and disadvantages. According to their characteristics, we proposed a secure routing protocol based on monitor node and trust mechanism. The reputation value is made up with packet forwarding rate and node’s residual energy. So this detection and routing mechanism is universal because it can take account of both the safety and lifetime of network. Finally, we use OPNET simulation to verify the performance of our algorithm.
文摘Extending the lifetime of the wireless sensor networks (WSNs), where recharging sensors is not always possible, has been a major concern for researchers for the past decade. In this paper, we study the cooperation between nodes in wireless sensor networks in forwarding packets to others, and we propose a new collaboration technique which stimulates intermediate nodes to forward packets toward their destination. Some nodes show selfish behavior by denying the forwarding packets to other nodes in commercial networks in an effort to preserve their own energy. This paper applies a technique which is used to prolong the network lifetime, based on a node’s energy and trust value, and additionally incorporates fuzzy logic, which stimulates nodes to forward packets by rewarding cooperation. According to simulation results, the proposed approach surpasses the Nuglets (virtual currency) approach and the Reputation approach in network energy and thus prolongs the network lifetime. Additionally, our proposed approach demonstrates better results in the number of dropped packets, PDR and forwarded packets to neighboring nodes.
基金supported by the National Natural Science Foundation of China(71271018)
文摘Overlapping community detection in a network is a challenging issue which attracts lots of attention in recent years.A notion of hesitant node（HN） is proposed. An HN contacts with multiple communities while the communications are not strong or even accidental, thus the HN holds an implicit community structure.However, HNs are not rare in the real world network. It is important to identify them because they can be efficient hubs which form the overlapping portions of communities or simple attached nodes to some communities. Current approaches have difficulties in identifying and clustering HNs. A density-based rough set model（DBRSM） is proposed by combining the virtue of densitybased algorithms and rough set models. It incorporates the macro perspective of the community structure of the whole network and the micro perspective of the local information held by HNs, which would facilitate the further ＂growth＂ of HNs in community. We offer a theoretical support for this model from the point of strength of the trust path. The experiments on the real-world and synthetic datasets show the practical significance of analyzing and clustering the HNs based on DBRSM. Besides, the clustering based on DBRSM promotes the modularity optimization.
文摘The traditional cryptographic security techniques are not sufficient for secure routing of message from source to destination in Wireless Sensor Networks (WSNs), because it requires sophisticated software, hardware, large memory, high processing speed and communication bandwidth. It is not economic and feasible because, depending on the application, WSN nodes are high-volume in number (hence, limited resources at each node), deployment area may be hazardous, unattended and/or hostile and sometimes dangerous. As WSNs are characterized by severely constrained resources and requirement to operate in an ad-hoc manner, security functionality implementation to protect nodes from adversary forces and secure routing of message from source node to base station has become a challenging task. In this paper, we present a direct trust dependent link state routing using route trusts which protects WSNs against routing attacks by eliminating the un-trusted nodes before making routes and finding best trustworthy route among them. We compare our work with the most prevalent routing protocols and show its benefits over them.
文摘针对区块链边缘节点的部署环境开放、安全措施薄弱、易受到安全攻击,以及计算和网络资源不足等问题,提出一种基于可信执行环境(TEE)的区块链安全架构P-Dledger。该架构通过构建两阶段的信任链,在满足软件便捷迭代的基础上,确保加载部件的可信;通过实现智能合约可信执行框架以及基于串行外设接口或非门存储器(SPI NOR Flash)的数据可信存储,保证智能合约的可信计算与数据的可信存储;同时,为共识提案赋予单调递增的唯一标识,限制拜占庭节点的行为。实验与分析结果表明:所提架构确保了加载主体、账本数据与执行过程的安全可信;当网络延时大于60 ms或节点数大于8时,P-Dledger比采用拜占庭容错(PBFT)算法的区块链系统的吞吐量更高,且随着网络延时与节点数的增加,P-Dledger性能表现更稳定。
