Earticle

이동 노드로만 구성된 MANET은 응급 상황에서 신속하게 네트워크를 구축할 수 있는 장점 때문에 다양한 환경에적용되고 있다. 그러나 노드들의 이동으로 인한 동적 토폴로지와 링크 실패는 많은 라우팅 취약점을 노출하고 있으며, 네트워크 성능을 크게 떨어뜨릴 수 있는 요인이 된다. 본 논문에서는 신뢰 모델을 기반으로 한 안전한 라우팅 프로토콜기법을 제안하였다. 제안한 기법에서는 노드들에 대한 효율적인 신뢰 평가 및 관리를 위해 영역 기반 네트워크 구조를이용하였다. 노드들의 신뢰 평가는 노드들의 제어 패킷과 데이터 패킷의 폐기 비율 측정을 통해 이루어졌으며, 라우팅의 효율을 높이기 위하여 트래픽 검사를 실시하고 과도한 트래픽을 발생시키는 경로에 존재하는 노드들에 대한 DSN 검사하여 비정상행위 노드를 탐지하였다. 제안한 기법을 통해 경로상에 공격이 존재하더라도 안전하게 데이터 전송이이루어짐을 실험을 통하여 확인하였다.

MANET composed of only mobile node is applied to various environments because of its advantage which can construct network quickly in emergency situation. However, many routing vulnerabilities are exposed due to the dynamic topology and link failures by the movement of nodes. It can significantly degrade network performance. In this paper, we propose a secure routing protocol based on trust model. The domain-based network structure is used for efficient trust evaluation and management of nodes in the proposed technique. The reliability evaluation of nodes was performed by the discard ratio of control packet and data packet of the nodes. The abnormal nodes are detected by performing traffic check and inspecting of nodes on a path that generates excessive traffic in order to increase the efficiency of routing. It is confirmed through experiments of the proposed technique that data transmission is performed securely even if an attack exists on the path.

MANET은 빠르게 네트워크를 구축할 수 있다는 특징 때문에 많은 분야에서 활용되고 있다. 그러나 무선 네트워크의 특성과 노드들의 이동으로 인해 많은 보안 위협에 노출되어 있다. 특히 그중에서도 라우팅 프로토콜의 취약점을 이용한 공격이 증가하고 있으며 그 피해 또한 매우 증가하고 있는 설정이다. 본 논문에서는 안전한 라우팅 프로토콜 제공을 위한 two-level 인증 구조를 제안하였다. 제안한 기법에서는 네트워크에 참여하는 노드들에 대하여 신뢰도를 기반으로 한 인증 평가를 실시하여 인증서를 발급해주며, 인증서를 발급받은 노드만이 데이터 전송을 수행하게 된다. 그리고인증서를 발급받은 노드가 데이터 전송시 제어 패킷의 정보와 자신이 관리하는 PIT 정보를 비교 및 분석하여 악의적인노드들에 대한 탐지를 수행하게 된다. Ns-2 시뮬레이터를 이용하여 본 논문에서 제안한 기법의 성능을 평가하였으며,실험을 통하여 우수한 성능을 확인하였다.

Wireless Ad hoc Network is threatened from many types of attacks because of its open structure, dynamictopology and the absence of infrastructure. Attacks by malicious nodes inside the network destroy communicationpath and discard packet. The damage is quite large and detecting attacks are difficult. In this paper, we proposedattack detection technique using secure authentication infrastructure for efficient detection and prevention of internalattack nodes. Cluster structure is used in the proposed method so that each nodes act as a certificate authority andthe public key is issued in cluster head through trust evaluation of nodes. Symmetric Key is shared for integrity ofdata between the nodes and the structure which adds authentication message to the RREQ packet is used. ns-2simulator is used to evaluate performance of proposed method and excellent performance can be performed throughthe experiment.

Wireless sensor networks are susceptible to a variety of network attacks. Due to the limited energy of nodes and selfish nodes in the network, the packet delivery rate is lower. To address these issues, we innovatively propose an energy-harvesting Q-learning secure routing algorithm with authenticated-encryption. The algorithm uses physical unclonable functions and optimized Q-learning to ensure that the transmission path is reliable. Meanwhile, we combine the LSTM-based prediction model to predict the energy value that the nodes replenish. In addition, simulations are performed to compare the performances of the proposed algorithm with other algorithms under different attacks. The proposed algorithm has greater improvements in the packet delivery rate, filtering selfish nodes, and reducing node energy consumption.

As the most fundamental infrastructure in the current Internet, the Border Gateway Protocol (BGP) supports the inter-connectivity of different Autonomous Systems (ASs) and then the reachability can be achieved from any network in the Internet. However, due to the lack of security consideration during its original design, the BGP suffers from multiple security threats. Another challenge is that it cannot support the future sophisticated applications with deterministic routing. In this article, we propose a novel BGP management architecture, namely BGPChain, which is based on the blockchain in order to establish a secure, smart, and agile routing infrastructure for the future Internet.

이동 노드로만 구성된 MANET은 모든 노드들이 라우터 역할을 수행한다. 하지만 노드들의 빈번한 이동으로 인한 동적인 토폴로지는 라우팅 성능을 떨어뜨리고 많은 보안 취약점의 원인이기도 하다. 따라서 MANET의 성능을 좌우할 수 있는 라우 팅 기법에는 보안이 반드시 적용되어야 한다. 본 논문에서는 영역-키 기반 보안 라우팅 기법 적용을 통해 다양한 라우팅 공격 에 효율적으로 대응하고, 안전한 데이터 전송을 위한 기법을 제안하였다. 제안한 기법에서는 영역 기반 네트워크 구조를 이용 하였으며, 각 영역내 멤버 노드들을 관리하는 관리 노드를 이용하였다. 또한 각 노드들에 키를 발급하여 이를 이용한 라우팅 기법을 적용함으로써 공격 노드로 부터의 피해를 최소화하였다. 영역 관리 노드는 라우팅 정보를 암호화하기 위한 키 발급과 발급 정보를 관리한다. 데이터 전송을 원하는 멤버 노드는 영역 관리 노드로부터 발급받은 키를 이용하여 라우팅 정보를 암호 화한 후, 이를 이용하여 경로 발견을 수행하게 된다. 제안한 기법의 향상된 성능은 CBSR, ARNA 기법과 비교 실험을 통하여 확인하였으며, 실험을 통해 우수한 성능을 확인할 수 있었다.

In MANET consisting of only mobile nodes, all nodes serve as routes. However, the dynamic topology due to frequent movement of nodes degrades routing performance and is also cause of many security vulnerabilities. Therefore, security m ust be applied to routing techniques that can influence the performance of MANET. In this paper, we propose a technique for efficiently responding to various routing attacks and safe data transmission through application of zone-key based secu rity routing techniques. A zone-based network structure was used, and a management node that manages member nodes i n each zone was used in the proposed technique. In addition, the damage from the attacking node was minimized by issui ng a key to each node and applying this to a routing technique. The zone management node issues a key for encryption r outing information and manages the issuance information. A member node that wants to transmit data encrypts routing in formation using a key issued from the zone management node, and then performs path discovery using this. The improve d performance of the proposed technique was confirmed through a comparative experiment with the CBSR and ARNA tec hnique, excellent performance was confirmed through experiments.

무선 센서 네트워크은 폭넓은 다양한 응용에서 경제적으로 성공할 수 있는 모니터링 솔루션이다. 그러나 악의적이거나 감시하는 사람이 없는 환경에서 침입을 인식하고 방지하며 안전하고 에너지 효율적인 것을 보장하는 네트워크를 통한 정보의 안전한 전송은 주된 도전이다. 이에 따라, 이 논문은 집적된 데이터의 무결성, 인증성과 비밀성을 보장하기위하여 안전한 무선 센서 네트워크에 필수적인 보호를 포함하는 분산 클러스터링 프로세스를 제안한다. 안전한 키 관리스킴을 위하여 대칭형과 비대칭형 키의 전단계 분산의 개념을 사용하고, 클러스터 내에 있는 각 센서 노드가 배치되기전에 암호화를 위한 전단계 분산 매개변수를 사용하는 센서 네트워크 토폴로지에 기초한 계층적 클러스터에 대한 상세한 스킴에 대하여 기술한다. 마지막으로 무선 센서 네트워크에서 제안된 스킴의 성능 시험 결과를 보인다.

The wireless sensor networks have become an economically viable monitoring solution for a wide variety ofcivilian and military applications. The main challenge in wireless sensor networks is the secure transmission ofinformation through the network, which ensures that the network is secure, energy-efficient and able to identifyand prevent intrusions in a hostile or unattended environment. In that correspondence, this paper proposes adistributed clustering process that integrates the necessary measures for secure wireless sensors to ensureintegrity, authenticity and confidentiality of the aggregated data. We use the notion of pre-distribution ofsymmetric and asymmetric keys for a secured key management scheme, and then describe the detailed schemewhich each sensor node within its cluster makes use of the pre-distribution of cryptographic parameters beforedeployment. Finally, we present simulation results for the proposed scheme in wireless sensor network.

There are always VANETs malicious nodes attempt to disrupt the message during normal delivery in the routing protocol of VANETs (Vehicular Ad hoc Networks). At the same time due to the dynamic changes of the vehicle, so that the topology of VANETs changes rapidly, it is very easy to make the communication link of vehicles attacked, or there is no reliable disconnection phenomenon. Based on this, it presents a secure and stable cooperative with node VANETs routing protocols (RSVR). First regular intervals to detect signal strength, residual energy and interface queue length, and then check the data transmission, while the message load and transfer process certificate for authentication, and then set the collaborative monitoring message passing node in the routing protocol, for messages can not be delivered to the destination node, which will serve as the task of passing messages, and adjust the final routing allows data transmission can selectively defense, or selective forwarding data. Experimental results show that RSVR packet delivery rate increase 15%, to consider combining overhead and latency, etc., it come in a wide range of node RSVR intensive environment, that has better reliability and security.

Cooperation among nodes is important in ad hoc networks since in such networks nodes depend on each other for forwarding packets. However, cooperation in such operations consumes nodes energy and recourses. Therefore, it is necessary to design incentive mechanisms to enforce nodes to forward packets when the source and destination of the packet are other nodes in the network. We study routing in ad hoc and wireless networks from a game theoretic view point. Based on this view, the network consists of selfish and greedy nodes who accept payments for forwarding data for other nodes if the payments cover their individual costs incurred by forwarding data. Also, route falsification attacks are easy to launch by malicious nodes in ad hoc networks. These nodes falsify data and routes in the network. Thus, mitigating this attack is vital for the performance of the whole network. Previous routing protocols in ad hoc networks inspired by game theory just consider that network consists of selfish nodes. In this work, we consider that the network consists of malicious nodes too. Here we present a truthful and secure mechanism for routing in ad hoc networks that cope malicious and selfish nodes.

This paper will first sum up the typical attacks and countermeasures in the network layer of Wireless Sensor Network (WSN), then it will classify the existing secure routing protocols according to the core secure schemes used by them, and emphatically introduce and analyze the typical ones among them. Finally this paper will propose some problems on secure routing, which requires further studying.

The security issues are more complex and challenging in Mobile Ad hoc Networks (MANETs) than other conventional wireless networks due to peer to peer behavior of the participating nodes, absence of centralized routers and routing through intermediate nodes. For successful communication between a pair of source and destination it is vital that the intermediate nodes be trustworthy and don’t drop packets. Nodes in an ad hoc network may not be trustworthy either due to selfishness created by power loss or due to maliciousness relating to rogue intentions. A node that was earlier trust worthy may no longer be so at later stages due to loss of power making the continuous dynamic evaluation of trust a necessity. Also the security requirements may vary as per the conditions on the scenario. This paper proposes an intelligent protocol that takes care of both selfishness and maliciousness by evaluating the trust dynamically. The protocol is able to adjust the trust level requirement as per the demand of the situation and can work in various levels of insecure environments. With the help of exhaustive simulations, the performance of this protocol has been demonstrated and compared with the normal AODV protocol in standard lab environment.

Ad hoc networks are highly dynamic routing networks cooperated by a collection of wireless mobile hosts without any assistance of a centralized access point. Secure Efficient Ad hoc Distance Vector (SEAD) is a proactive routing protocol, based on the design of Destination Sequenced Distance Vector routing protocol (DSDV). SEAD provides a robust protocol against attackers trying to create incorrect routing state in the other node. However, it does not provide a way to prevent an attacker from tampering the next hop or the destination field in route update. In this paper, we propose an I-SEAD protocol to solve the problem. A series of simulation experiments are conducted to evaluate the performance.

Lifetime optimization and security are two important design issues for WSNs with non-replenishable energy resources. Routing protocols in wireless sensor networks (WSNs) are susceptible to a number of attacks depending on the nature of the protocol, its application, and the environment in which the protocol is intended to be used. Routing protocols that do not take the malicious attacks into account can not be easily temper proofed. The longevity of WSNs is a crucial concern that significantly influences their applicability in a specific context. In this paper, we present a Load Balancing Multi-path Secure Routing (LBMSR) protocol to address these two issues concurrently through balanced energy consumption and one-way hash key chain and symmetric key cryptography. LBMSR is designed with two configurable parameters, load balance control and security level. Load balance is used to avoid the problem of energy consuming imbalance and the formation of energy holes. Security level is designed to determine the probabilistic distribution of the random walking that provides routing security. Simulation results and security analyses show that the proposed algorithm can provide excellent balance between routing efficiency and energy consumption while preventing routing attacks.

In recent years, the security in Wireless sensor networks becomes a good topic for researchers; it is a challenge task due to inheritance limitations of sensors. Besides, security becomes extremely crucial factor when sensor networks are randomly deployed in a hostile environment. Routing in WSNs is the vital functionality that allows the flow of information generated by sensor nodes to the base station, while considering the severe energy constraint and the limitations of computational and storage resources. However, security of these routing protocols has fallen beyond the scope so far. As sensor nodes may be easily captured and compromised, the classical cryptographic solutions become insufficient to provide optimal routing security, especially, for hierarchical WSNs, where cluster heads can be still among the compromised nodes. In this work, we focus at secure hierarchical routing protocols in wireless sensor networks and represent selected approaches which focusing at this matter. The purpose of this paper is to create a simulation of these protocols using NS2. Then, we analyze to what extend they have been applied to the clustering structure and compare them in terms of security, security issues for WSNs and their solutions are also discussed.

Mobile ad-hoc networks (MANETs) face a number of challenges, in particular due to its dynamic network topology. A self organizing framework can overcome the problems associated with changing topology and dynamic behavior of mobile nodes thus routing has become a great challenge to these types of networks. Such a framework can be created by using connected dominating set (CDS). But the choice of misbehaving node as CDS will inversely affect the network performance. A misbehaving node may disturb the network by denying packet forwarding. In this paper we propose a new reputation based routing protocol using CDS (Connected Dominating Set). The proposed weight heuristic is applied to each node in network for selecting CDS based on uses the reputation value in order to selective forwarders detection. Reputation refers to the opinion of one node about another node. Hence only well behaving and good quality nodes are selected as a dominant node for CDS construction. Through simulation results proves that the proposed method performs well compared to MPR selection approach in OLSR.

본 논문에서는 VANET 상에서 안전한 라우팅을 위한 웜홀 공격 탐지 및 제거 기법 설계를 제안한 다. 제안된 기법에서는 AODV의 RREP와 라우팅 테이블에 이웃노드목록을 추가하고, 메시지 전송 경 로 설정 응답 메시지인 Route_ACK를 설계하였다. 그리고 메시지 전송 경로 생성 시에 이웃노드목록, 홉(hop) 수를 이용하여 웜홀 공격 여부를 판단하고, Route_ACK를 이용하여 웜홀 노드를 검출하도록 설계하였다. 그 결과 웜홀 노드를 제외시킨 데이터 전송 경로를 선정하여 데이터를 전송함으로써 AODV보다 데이터 전송량이 평균적으로 36% 증가하였다. 따라서 본 논문에서는 제안하는 기법을 이 용하여 안전하고 신뢰성이 높은 VANET을 구축하였다.

This paper proposes “A Design of an efficient Wormhole Attack Detection and Removal Scheme for Secure Routing on VANET”. The proposed scheme appends the list of neighboring nodes to the RREP and Routing table of AODV and designs Route_ACK which is a response message about message transmission route setting. Whenever it generates the message transmission route, it designs to judge a wormhole attack by using the list of neighboring nodes and hop counts and to detect a wormhole node by using the Route_ACK. Therefore, it’s data delivery quantity is improved by about 36 % than AODV because it transmits data through the data transmission route which excluded the wormhole nodes. Because of the proposed scheme, the paper can make the VANET more safe and reliable.

본 논문에서는 모바일 애드 혹 네트워크에서 RREQ/RREP 메시지의 무결성 검증으로 패킷 인젝션 공격을 탐지하는 GSK(Group Secret Key) 기반 SAODV(Secure AODV)를 설계를 제안한다. SAODV는 첫째, 모바일 애드 혹 네트워크를 관리하는 베이스 스테이션에 GSK(Group Secret Key)를 배포하는 기능을 부여하고, 둘째, 패킷 인젝션 공격을 탐지하기 위하여 RREQ/RREP 메시지에 Authentication value 필드를 추가하여 RREQ/RREP 메시지 무결성을 검증한다. 셋째, 데이터의 전송경로를 왜곡하는 패킷 인젝션 공격을 탐지하기 위하여 라우팅 테이블에 Neighbor node list 필드와 Malicious node list 필드를 추가하였다. 그 결과, SAODV는 인젝션 공격 탐지뿐만 아니라 노드들의 불필요한 메시지 전달을 방지함으로써 에너지 효율을 향상시킬 수 있다.

This paper proposes a design of the SAODV(Secure AODV) based on GSK(Group Secret Key) detecting a Packet Injection Attack by the integrity verification of an RREQ/RREP message on the MANET. The SAODV has the following functions. First, it provides the function to distribute GSK to a Base Station which manages the MANET. Second, it verifies the integrity of an RREQ/RREP message by adding an Authentication Value field to the RREQ/RREP message to prevent Packet Injection attack, Third, a Neighbor Node List field and Malicious Node List field are added to a Routing Table to detect a Packet Injection Attack which distorts the transmission route of data. Consequently, the SAODV improves energy efficiency not only by detecting a Packet Injection Attack but also by preventing unnecessary message transmission.

A trust-aware secure routing protocol (TSRP) for wireless sensor networks is proposed in this paper to defend against varieties of attacks. First, each node calculates the comprehensive trust values of its neighbors based on direct trust value, indirect trust value, volatilization factor, and residual energy to defend against black hole, selective forwarding, wormhole, hello flood, and sinkhole attacks. Second, any source node that needs to send data forwards a routing request packet to its neighbors in multi-path mode, and this continues until the sink at the end is reached. Finally, the sink finds the optimal path based on the path's comprehensive trust values, transmission distance, and hop count by analyzing the received packets. Simulation results show that TSRP has lower network latency, smaller packet loss rate, and lower average network energy consumption than ad hoc on-demand distance vector routing and trust based secure routing protocol.

Advances in wireless sensor network (WSN) technology have enabled small and low-cost sensors with the capability of sensing various types of physical and environmental conditions, data processing, and wireless communication. In the WSN, the sensor nodes have a limited transmission range and their processing and storage capabilities as well as their energy resources are limited. A triple umpiring system has already been proved for its better performance in WSNs. The clustering technique is effective in prolonging the lifetime of the WSN. In this study, we have modified the ad-hoc on demand distance vector routing by incorporating signal-to-noise ratio (SNR) based dynamic clustering. The proposed scheme, which is an efficient and secure routing protocol for wireless sensor networks through SNR-based dynamic clustering (ESRPSDC) mechanisms, can partition the nodes into clusters and select the cluster head (CH) among the nodes based on the energy, and non CH nodes join with a specific CH based on the SNR values. Error recovery has been implemented during the inter-cluster routing in order to avoid end-to-end error recovery. Security has been achieved by isolating the malicious nodes using sink-based routing pattern analysis. Extensive investigation studies using a global mobile simulator have shown that this hybrid ESRP significantly improves the energy efficiency and packet reception rate as compared with the SNR unaware routing algorithms such as the low energy aware adaptive clustering hierarchy and power efficient gathering in sensor information systems.

The interconnection of mobile devices in urban environments can open up a lot of vistas for collaboration and content-based services. This will require setting up of a network in an urban environment which not only provides the necessary services to the user but also ensures that the network is secure and energy efficient. In this paper, we propose a secure, energy efficient dynamic routing protocol for heterogeneous wireless sensor networks in urban environments. A decision is made by every node based on various parameters like longevity, distance, battery power which measure the node and link quality to decide the next hop in the route. This ensures that the total load is distributed evenly while conserving the energy of battery-constrained nodes. The protocol also maintains a trusted population for each node through Dynamic Trust Factor (DTF) which ensures secure communication in the environment by gradually isolating the malicious nodes. The results obtained show that the proposed protocol when compared with another energy efficient protocol (MMBCR) and a widely accepted protocol (DSR) gives far better results in terms of energy efficiency. Similarly, it also outdoes a secure protocol (QDV) when it comes to detecting malicious nodes in the network.