• Journal of information and communication convergence engineering
• /
• 제9권6호
• /
• pp.683-688
• /
• 2011

The wireless sensor network (WSN) is well known for an enabling technology for the ubiquitous environment such as real-time surveillance system, habitat monitoring, home automation and healthcare applications. However, the WSN featuring wireless communication through air, a resource constraints device and irregular network topology, is threatened by malicious nodes such as eavesdropping, forgery, illegal modification or denial of services. For this reason, security in the WSN is key factor for utilizing the sensor network into the commercial way. There is a series of symmetric cryptography proposed by laboratory or industry for a long time. Among of them, recently proposed HUMMINGBIRD algorithm, motivated by the design of the well-known Enigma machine, is much more suitable to resource constrained devices, including smart card, sensor node and RFID tags in terms of computational complexity and block size. It also provides resistance to the most common attacks such as linear and differential cryptanalysis. In this paper, we implements ultra-lightweight cryptography, HUMMINGBIRD algorithm into the resource constrained device, sensor node as a perfectly customized design of sensor node.

• Journal of Communications and Networks
• /
• 제17권1호
• /
• pp.40-46
• /
• 2015

In a mobile ad hoc network (MANET), communication between mobile nodes occurs without centralized control. In this environment the mobility of a node is unpredictable; this is considered as a characteristic of wireless networks. Because of faulty or malicious nodes, the network is vulnerable to routing misbehavior. The resource constrained characteristics of MANETs leads to increased query delay at the time of data access. In this paper, AntHocNet+ Security (ANTSEC) framework is proposed that includes an enhanced cooperative caching scheme embedded with artificial immune system. This framework improves security by injecting immunity into the data packets, improves the packet delivery ratio and reduces end-to-end delay using cross layer design. The issues of node failure and node malfunction are addressed in the cache management.

• 디지털산업정보학회논문지
• /
• 제9권1호
• /
• pp.87-93
• /
• 2013

MANET has the advantage of having the flexibility to build easily a network in a difficult situation that builds a wired network. But, data transmission errors by movement of nodes and eavesdropping by wireless communications have become a problem of security. Authentication service is the most essential in order to overcome these problems and operate network stably. In this paper, we propose 3-tiers authentication structure to exclude of malicious node and operate stable network through more systematic and thorough node authentication. After network is composed into a cluster, cluster head which play CA role is elected. Among these, the highest-CA is elected. The highest-CA receives certificates to cluster head and the cluster head evaluates trust value of their member nodes. Authentication technique which issues member node key is used. We compared PSS and experimented to evaluate performance of proposed scheme in this paper and efficiency of the proposed technique through experience was confirmed.

• International Journal of Internet, Broadcasting and Communication
• /
• 제13권1호
• /
• pp.238-242
• /
• 2021

Game theory has been regarded as a useful theoretical tool for modeling the interactions between distinct entities and thus it has been harnessed in various research field. In particular, research attention has been shown to how to apply game theory to modeling the interactions between malign and benign entities in the field of wireless networks. Although various game theoretic modeling work have been proposed in the field of wireless networks, our proposed work is disparate to the existing work in the sense that we focus on mobile malign node detection problem in static wireless sensor networks. More specifically, we propose a Bayesian game theoretic modeling for mobile malign node detection problem in static wireless sensor networks. In our modeling, we formulate a two-player static Bayesian game with imperfect information such that player 1 is aware of the type of player 2, but player 2 is not aware of the type of player 1. We use four strategies in our static Bayesian game. We obtain Bayesian Nash Equilibria with pure strategies under certain conditions.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2010년도 추계학술대회
• /
• pp.605-608
• /
• 2010

Ad-hoc 네트워크가 정상적으로 동작하기 위해서는 각 노드가 동등한 권한을 갖고 상호 협조할 때 원활한 통신이 가능하다. 신뢰성을 확보하기 위해 인증된 노드로만 네트워크가 구성이 가능하지만 인증만으로 악의적 행위를 하는 노드를 완전히 배제할 수 없으므로 이들의 행위가 네트워크 전체를 위험에 빠뜨릴 수 있다. 이를 탐지 및 배제해야만 더욱 안전하고 신뢰할 수 있는 네트워크를 유지할 수 있으나 이에 대한 연구는 상대적으로 미흡한 수준이다. 따라서 신뢰 관계에 있는 노드로 구성된 네트워크에서 이기적이거나 악의적인 노드를 탐지하고 배제시켜 결과적으로 네트워크의 안전성과 신뢰성를 유지하고 처리율을 향상시킬 수 있는 방법을 제안한다.

• Journal of Communications and Networks
• /
• 제9권1호
• /
• pp.56-66
• /
• 2007

Mobile ad-hoc networks (MANETs) have attracted great research interest in recent years. Among many issues, lack of motivation for participating nodes to collaborate forms a major obstacle to the adoption of MANETs. Many contemporary collaboration enforcement techniques employ reputation mechanisms for nodes to avoid and penalize malicious participants. Reputation information is propagated among participants and updated based on complicated trust relationships to thwart false accusation of benign nodes. The aforementioned strategy suffers from low scalability and is likely to be exploited by adversaries. In this paper, we propose a novel approach to address these problems. With the proposed technique, no reputation information is propagated in the network and malicious nodes cannot cause false penalty to benign hosts. Nodes classify their one-hop neighbors through direct observation and misbehaving nodes are penalized within their localities. Data packets are dynamically rerouted to circumvent selfish nodes. As a result, overall network performance is greatly enhanced. This approach significantly simplifies the collaboration enforcement process, incurs low overhead, and is robust against various malicious behaviors. Simulation results based on different system configurations indicate that the proposed technique can significantly improve network performance with very low communication cost.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제15권10호
• /
• pp.3793-3814
• /
• 2021

Most secure solutions like cryptography are software based and they are designed to mainly deal with the outside attacks for traditional networks, but such soft security is hard to be implemented in wireless sensor networks to counter the inside attacks from internal malicious nodes. To address this issue, reputation has been introduced to tackle the inside malicious nodes. Reputation is essentially a stimulating mechanism for nodes' cooperation and is employed to detect node misbehaviors and improve the trust-worthiness between individual nodes. Among the reputation models, binomial distribution based reputation has many advantages such as light weight and ease of implementation in resource-constraint sensor nodes, and accordingly researchers have proposed many insightful related methods. However, some of them either directly use the modelling results, apply the models through simple modifications, or only use the required components while ignoring the others as an integral part of the whole model, this topic still lacks a comprehensive and systematical review. Thus the motivation of this study is to provide a thorough survey concerning each detailed functional components of binomial distribution based reputation for wireless sensor networks. In addition, based on the survey results, we also argue some open research problems and suggest the directions that are worth future efforts. We believe that this study is helpful to better understanding the reputation modeling mechanism and its components for wireless sensor networks, and can further attract more related future studies.

• Journal of Information Processing Systems
• /
• 제6권3호
• /
• pp.269-294
• /
• 2010

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.

• 디지털산업정보학회논문지
• /
• 제10권1호
• /
• pp.105-112
• /
• 2014

The utilization of Wireless Ad Hoc Network which can build easily network using wireless device in difficult situation to build network is very good. However, it has security threat element because it transfers data by only forwarding of wireless devices. The measures against this should be prepared because damage by especially routing attack can affect the entire network. It is hard to distinguish malicious node and normal node among nodes composing network and it is not easy also to detect routing attack and respond to this. In this paper, we propose new method which detect routing attack and can respond to this. The amount of traffic in all nodes is measured periodically to judge the presence or absence of attack node on the path set. The technique that hides inspection packet to suspected node and transmits is used in order to detect accurately attack node in the path occurred attack. The experiment is performed by comparing SRAODA and SEAODV technique to evaluate performance of the proposed technique and the excellent performance can be confirmed.

• 한국멀티미디어학회논문지
• /
• 제12권11호
• /
• pp.1593-1608
• /
• 2009

다중 홉 무선 네트워크에서는 일부 중계 단말이 악의적인 목적으로 비협력적이거나 이기적인 행동을 하면 네트워크의 성능이 저하되는 문제점이 발생한다. 무선 단말간의 협력적인 동작을 가정한 기존의 애드혹 라우팅 기법에서는 악의적으로 행동하는 이기적인 무선 단말에 의해 발생되는 성능 감소 문제를 해결할 수 없다. 이에 본 논문에서는 다중 홉 무선 네트워크의 성능을 향상 시킬 수 있는 평판 기반의 협력적 애드혹 라우팅 프로토콜인 CARE (Cooperative Ad hoc routing protocol based REputation) 기법을 제안하였다. 제안한 CARE 기법은 홉 대 홉 기반의 패킷 포워딩 과정에서 악의적으로 행동하거나 무단으로 라우팅 경로에서 이탈하는 이기적인 무선 단말을 우회하도록 라우팅 경로를 설정하는 네트워크 계층간의 수평적 상호 작용을 제공한다. 그리고 CARE 기법은 수직적 상호 작용을 기반으로 하여 MAC 계층으로부터 획득한 무선 채널의 상황 정보를 반영하여 라우팅 경로의 품질 향상시키며, 네트리크 계층에서 획득한 무선 단말의 평판 정보를 전송 계통에 반영하여 TCP의 성능 향상을 제공한다. CARE로 기법의 성능을 평가한 결과, 단말의 빈번한 이동과 악의적인 단말이 존재하는 다중 홉 무선 네트워크 환경에서 패킷 전송의 낮은 실패율과 패킷의 평균 전송 시간의 향상을 제공함과 동시에 종단간 무선 단말의 향상된 TCP 성능을 확인하였다.