• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권2호
• /
• pp.504-521
• /
• 2016

Recently, energy harvesting technology has been integrated into wireless sensor networks to ameliorate the nodes' energy limitation problem. In theory, the wireless sensor node equipped with an energy harvesting module can work permanently until hardware failures happen. However, due to the change of power supply, the traditional hierarchical network routing protocol can not be effectively adopted in energy harvesting wireless sensor networks. In this paper, we improve the Low-Energy Adaptive Clustering Hierarchy (LEACH) protocol to make it suitable for the energy harvesting wireless sensor networks. Specifically, the cluster heads are selected according to the estimation of nodes' harvested energy and consumed energy. Preference is given to the nodes with high harvested energy while taking the energy consumption rate into account. The utilization of harvested energy is mathematically formulated as a max-min optimization problem which maximizes the minimum energy conservation of each node. We have proved that maximizing the minimum energy conservation is an NP-hard problem theoretically. Thus, a polynomial time algorithm has been proposed to derive the near-optimal performance. Extensive simulation results show that our proposed routing scheme outperforms previous works in terms of energy conservation and balanced distribution.

• 전자통신동향분석
• /
• 제34권3호
• /
• pp.55-64
• /
• 2019

In drone-assisted wireless sensor networks, drones collect data from sensors in an energy-efficient manner and quickly distribute urgent information to sensor nodes. This article introduces recent communication and security schemes for drone-assisted wireless sensor networks. For the communication schemes, we introduce data collection optimization schemes, drone position and movement optimization schemes, and drone flight path optimization schemes. For the security schemes, we introduce authentication and key management schemes, cluster formation schemes, and cluster head election schemes. Then, we present some enhancement methodologies for these communication and security schemes. As a conclusion, we present some interesting future work items.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2005년도 춘계종합학술대회
• /
• pp.860-863
• /
• 2005

Ad-Hoc networks are a new generation of networks offering unrestricted mobility without any underlying infrastructure. Primary applications of Ad-Hoc networks are in military, tractical and other security sensitive operations, where the environment is hostile. Hence, security is a critical issue. In this paper, we ahve identified certain misbehaviors caused by mallicious node for reactive routing protocol. We also discuss the intrusion detection and intrusion prevention model to prevent several identified attacks in the networks

• 정보보호학회논문지
• /
• 제23권6호
• /
• pp.1191-1197
• /
• 2013

대규모의 센서 네트워크에서는 고정된 베이스 스테이션에서 데이터를 수집하고 네트워크를 관리하는 것은 센서노드들의 제한된 에너지를 빨리 소진시켜 네트워크의 수명을 단축시키게 되므로 바람직하지 않다. 다른 여러 가지 이유로도 모바일 싱크가 널리 활용되고 있으나, 이러한 모바일 싱크에 대한 안전한 쿼리 프로토콜에 대한 연구는 그다지 많지는 않다. 본 논문에서는 모바일 싱크가 인접 센서노드들과 안전하면서도 효율적인 쿼리 세션을 수행할 수 있는 키관리 및 인증 프로토콜을 제안하고 안전성 및 효율성을 분석한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제15권6호
• /
• pp.2148-2167
• /
• 2021

The proliferation of the Internet of Things (IoT) technologies and applications, especially the rapid rise in the use of mobile devices, from individuals to organizations, has led to the fundamental role of secure wireless networks in all aspects of services that presented with many opportunities and challenges. To ensure the CIA (confidentiality, integrity and accessibility) security model of the networks security and high efficiency of performance results in various resource-constrained applications and environments of the IoT platform, DDO-(data-driven operation) based constructions have been introduced as a primitive design that meet the demand of high speed encryption systems. Among of them, the TMN-family ciphers which were proposed by Tuan P.M., Do Thi B., etc., in 2016, are entirely suitable approaches for various communication applications of wireless mobile networks (WMNs) and advanced wireless sensor networks (WSNs) with high flexibility, applicability and mobility shown in two different algorithm selections, TMN64 and TMN128. The two ciphers provide strong security against known cryptanalysis, such as linear attacks and differential attacks. In this study, we demonstrate new probability results on the security of the two TMN construction versions - TMN64 and TMN128, by proposing efficient related-key recovery attacks. The high probability characteristics (DCs) are constructed under the related-key differential properties on a full number of function rounds of TMN64 and TMN128, as 10-rounds and 12-rounds, respectively. Hence, the amplified boomerang attacks can be applied to break these two ciphers with appropriate complexity of data and time consumptions. The work is expected to be extended and improved with the latest BCT technique for better cryptanalytic results in further research.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권12호
• /
• pp.5189-5208
• /
• 2015

To address the contradiction between data aggregation and data security in wireless sensor networks, a Recoverable Privacy-preserving Integrity-assured Data Aggregation (RPIDA) scheme is proposed based on privacy homomorphism and aggregate message authentication code. The proposed scheme provides both end-to-end privacy and data integrity for data aggregation in WSNs. In our scheme, the base station can recover each sensing data collected by all sensors even if these data have been aggregated by aggregators, thus can verify the integrity of all sensing data. Besides, with these individual sensing data, base station is able to perform any further operations on them, which means RPIDA is not limited in types of aggregation functions. The security analysis indicates that our proposal is resilient against typical security attacks; besides, it can detect and locate the malicious nodes in a certain range. The performance analysis shows that the proposed scheme has remarkable advantage over other asymmetric schemes in terms of computation and communication overhead. In order to evaluate the performance and the feasibility of our proposal, the prototype implementation is presented based on the TinyOS platform. The experiment results demonstrate that RPIDA is feasible and efficient for resource-constrained sensor nodes.

• 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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제7권8호
• /
• pp.2061-2080
• /
• 2013

Roaming authentication protocol is widely used in wireless network which can enable a seamless service for the mobile users. However, the classical approach requires the home server's participation during the authentication between the mobile user and the foreign server. So the more the roaming requests are performed the heavier burden will be on the home server. In this paper, we propose a new roaming authentication framework for wireless communication without the home server's participation. The new roaming authentication protocol in the new framework takes advantage of the ID-based cryptography and provides user anonymity. It has good performance compared with the roaming authentication protocols whose authentication do not need the home server's participation in terms of security and computation costs. Moreover, a new User-to-User authentication protocol in the new framework is also present. All the authentications proposed in this paper can be regarded as a common construction and can be applied to various kinds of wireless networks such as Cellular Networks, Wireless Mesh Networks and Vehicle Networks.

• 한국콘텐츠학회논문지
• /
• 제10권7호
• /
• pp.70-80
• /
• 2010

자원이 제한되어 있는 센서 노드에 보안 프로토콜 기능을 부여할 때에는 항상 어려움이 동반된다. 다양한 인증 기법들 중에서 NEKAP은 지역적 특성을 활용하는 비교적 효과적인 프로토콜이다. 반면, 이 기법은 룹홀 형성이 가능하여 리플레이 공격에 취약한 점이 있다. 본 논문에는 NEKAP의 약점을 보완하여 무선센서 네트워크가 리플레이 공격을 효과적으로 방어할 수 있도록 향상된 인증 기반 보안 프로토콜을 제안한다. 제안한 기법에서는 네 개의 보안 키를 각 노드에 부여하여 지역과 계층적 요구에 적합한 보안을 제공한다. 제안한 기법의 성능은 보안 인증, 공격 노드의 탐지, 리프레이 공격 방어 등의 측면에서 분석적 기법을 사용하여 평가하였으며 기존의 기법과 비교하였을 때 제안한 기법이 더 좋은 결과를 나타내었다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제14권6호
• /
• pp.2518-2533
• /
• 2020

In wireless sensor networks, adversaries may physically capture sensor nodes on the fields, and use them to launch false positive attacks (FPAs). FPAs could be conducted by injecting forged or old sensing reports, which would represent non-existent events on the fields, with the goal of disorientating the base stations and/or reducing the limited energy resources of sensor nodes on the fields. Researchers have proposed various mitigation methods against FPAs, including the statistical en-route filtering scheme (SEF). Most of these methods are based on key pre-distribution schemes and can efficiently filter injected false reports out at relay nodes through the verification of in-transit reports using the pre-distributed keys. However, their filtering power may decrease as time goes by since adversaries would attempt to capture additional nodes as many as possible. In this paper, we propose an adaptive key distribution method that could maintain the security power of SEF in WSNs under such circumstances. The proposed method makes, if necessary, BS update or re-distribute keys, which are used to endorse and verify reports, with the consideration of the filtering power and energy efficiency. Our experimental results show that the proposed method is more effective, compared to SEF, against FPAs in terms of security level and energy saving.