• The Journal of the Korea institute of electronic communication sciences
• /
• v.9 no.12
• /
• pp.1353-1358
• /
• 2014

Tremendous amount of dummy packets are generally generated for faking over a wireless sensor network so as to keep the location privacy of nodes on the communication paths against the global eavesdropping. In this paper, a scoped-flooding protocol is designed for transferring data between each source and mobile sink(aka, basestation) where, the only nodes within the scope are allowed to issue dummy packets at every idle time so that the location privacy of the nodes on the paths is kept and the amount of dummy packets is reduced to the extend of the flooding scope. The size of the flooding diameter can be taken into consideration of the privacy level and the communication cost. We design a detailed specification of the protocol and verify several properties.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.11 no.9
• /
• pp.861-868
• /
• 2016

Dummy messages are usually generated for faking in preserving the location privacy of a sink or source against the global eavesdropping in wireless networks. In this paper, we propose a new method in which a certain number of nodes determined by considering the required privacy level are made to transit to the dormant state doing nothing so that the total number of dummy messages is reduced, while the paths from the sink to the sources are ensured. Through simulation we verify the success ratio of path establishments between the sink and a set of sources and the location privacy level of them.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.15 no.3
• /
• pp.433-438
• /
• 2020

Nodes on a data communication path in a wireless network emit electro-magnetic waves whenever they transmit packets; thus, the path can be exposed and identified with capturing and analyzing a sequence of the signals emitted there. One of countermeasures against a malicious eavesdropper is to let certain nodes mimic the nodes on the data path in sending dummy packets. In this paper we propose a packet transfer protocol which establishes the shortest path between source-destination pair a time and restricts heavy generation of dummy packets. We verify the location-privacy of a node on the communication paths through simulation.

• Proceedings of the Korean Information Science Society Conference
• /
• 2012.06c
• /
• pp.239-241
• /
• 2012

우리 군은 미래전을 대비하기 위해 각종 전술 응용정보체계의 막힘없는 전송과 통신망간 연동 요구를 충족시키고 미래 전장을 주도할 통신체계 구축을 목표로 전술정보통신체계(TICN) 개발을 추진 중이다. Ad-hoc 네트워크 기술을 사용하는 전술정보통신체계의 부체계인 전투무선체계는 전장 환경에서 운영되는 특수성으로 인해 기존의 전통적인 플랫한 Ad-hoc 네트워크와는 차별화된 계층형 Ad-hoc 네트워크 구조를 가진다. 또한 Ad-hoc 네트워크를 운용하는 환경이 보안성이 극도로 요구되는 전장 환경임을 고려할 때 군 작전의 성공적인 목표 달성을 위한 보안대책은 반드시 필요하다. 특히 전장상황 하에서 유통될 각종 민감 정보들에 대한 기밀성, 무결성 등을 보장하기 위해 정당한 권한을 가진 노드들만이 네트워크에 참여할 수 있는 보안 매커니즘이 적용되어야 하며, 이를 위해선 효율적인 키 관리 기법을 적용해야 한다. 본 논문에서는 비밀키, 노드위치, 해시인증 등의 정보를 이용한 3단계 인증절차 적용으로 Ad-hoc 네트워크 참여 노드의 인증을 강화하고, 통신환경에 따라 3가지 비밀키를 구분 사용하여 계층형 Ad-hoc 네트워크 구조에서 기밀성 보장을 강화하기 위한 키 관리 기법을 제안한다.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.8 no.3
• /
• pp.379-387
• /
• 2013

In large-scale wireless sensor networks, tremendous amount of dummy packets is usually accompanied by keeping location privacy of the communication source and destination against global eavesdropping. In our earlier work we designed a location privacy routing protocol, ELPR(End-node Location Privacy Routing) in which the generation of dummy packets at each idle time-slot while transferring data packets are restricted to only the nodes within certain areas of encompassing the source and destination, respectively. In this paper, it is given that ELPR provides various degrees of location privacy while PCM(Periodic Collection Method) allows the only fixed level. Simulation results show that as the number of nodes or data packets increases ELPR permits in terms of the number of generated packets more cost-effective location privacy than PCM.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.7
• /
• pp.1715-1722
• /
• 2010

In this paper we consider methods for selecting the next tracing node that take advantage of the history of traced positions during the packet-tracing. In the meantime, the proposed routing strategy that counters the tracing is to design the routing path is such a way that nodes on it are not close to the nodes whose location privacy is needed and zigzag or back-and-forth movements hardly take place. In simulations, the ratios of successful tracing were largely improved. It was shown that our routing scheme allows more data packets to be delivered to the destination while, enticing the tracer to move more long distances in the presence of multiple assets.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2010.11a
• /
• pp.1297-1299
• /
• 2010

무선 통신에서는 무선 통신의 브로드캐스트한 특성으로 데이터의 기밀성 유지를 위한 암호화가 매우 중요하다. 특히 무선 센서 네트워크(WSN - Wireless Sensor Network)의 경우 일반적인 PC와는 다르게 다양한 환경에 위치할 수 있어 공격자에게 더 쉽게 노출 될 수 있는 문제점을 가지고 있다. 이런 환경에서 미리 저장된 해쉬 함수나 비밀 값에 의존한 키 분배를 할 경우 저장된 값이 노출될 경우 심각한 문제를 초래하게 된다. 그리고 D-H 키 분배 알고리즘의 경우 키 값을 안전하게 도출을 할 수 있지만 키를 도출한 대상에 대한 인증의 부재와 멀티 홉 환경에서 중간자 공격에 취약한 문제점을 드러내고 있다. 본 논문에서는 이런 문제를 해결하기위해 기존 연구를 응용하여 멀티 홉 환경에서 무선 통신의 특성을 이용한 비밀값 공유와 제 3의 노드를 이용한 간단한 인증이 가능한 기법을 제안한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.07a
• /
• pp.175-177
• /
• 2005

여러 네트워크에서 사용자의 이동이나 인증 결과 처리를 최소하기 위한 서비스가 발전하고 있다 그러나 인증, 권한 검증, 과금을 지원하는 AAA 기반의 망에서는 매 등록이 발생할 때 마다 새로운 세션 키가 필요하며 이를 위해 홈 망까지 등록 절차가 수행되어야 한다. 이것은 이동 노드 재인증 절차와 방문 홈에서 홈 망까지의 통신으로 인한 지연이 발생할 수 있다. 이같은 지연을 방지하기 위해 본 논문에서는 홈망의 AAA 서버와 상관없이 이전의 할당된 세션 키를 이용하여 빠른 핸드오프 기법을 제안한다. 본 제안 방식은이전 방문 에이전트와 새로운 방문 에이전트간에 제 3자로 하여금 키를 공유하고 홈망까지의 통신이 필요없고 세션키의 기밀성과 무결성이 보장되도록 수행할 수 있다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.11B
• /
• pp.1413-1421
• /
• 2011

A next generation military communication system called Tactical Information Communication Network(TICN) is designed to advance into large capacity, high speed, and long distance wireless relay transmission. To support mobility in battlefield, the application of Ad-hoc networking technology to its wireless communication is being considered. In Ad-hoc network, the key management technique is very important to ensure the confidentiality, integrity, and authentication. In this paper, we propose a new hybrid key management scheme considering the hierarchical characteristics of the tactical ad-hoc such as TICN. For upper layer with sufficient energy and computation capability, we apply PKI based key management scheme. For lower layer with restricted resources, we propose a new key management scheme using the location-based authentication to ensure the energy efficiency.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.8B
• /
• pp.636-645
• /
• 2008

Most of routing schemes that protect the source's location from a malicious attacker usually make use of a path of a long length per message for the sake of lengthening the safety period. The biggest problem to such approaches is taking a very long latency in transferring messages to the destination. In this paper we show the problem to find the least-cost single path that is enough to keep the source-location always secure from the attacker, provided that it is used for the delivery of a set of messages given in priori, is NP-complete. Consequently we propose a routing protocol GSLP-w(GPSR-based Source-Location Privacy with crew size co) that is a trade-off between two extreme approaches. The advantage of GSLP-co lies in its enhanced safety period for the source and its lowered delivery latency in messaging. We consider NSP(Normalized Sefety Period) and NDL(Normalized Delivery Latency), measured in terms of the least number of hops to the destination, to achieve tangible interpretation of the results. We ran a simulation to confirm our claim by generating 100 topologies of 50,000 nodes with the average number of neighbors being 8. The results show that GSLP-$\omega$ provides more enhanced NSP compared to other protocols GSLP, an earlier version of GSLP-$\omega$, and PR-SP(Phantom Routing - Single Path), the most notable existing protocol for the source-location privacy, and less NDL than that of GSLP but more than that of PR-SP.