• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.17 no.10 s.113
• /
• pp.985-992
• /
• 2006

The classic routing algorithms try to minimize the number of hops to reach a destination. In our DPC(Distributed Power Control) this hop-by-hop power level selection is also used to select the path guaranteeing low energy consumption. The main goal is to realize a dynamic protocol able to be aware of mobility and to automatically set security threshold in order to get the best performance in every situation. In conclusion, the simulation DPC has improved energy gain of the AMRIS routing algorithm at the narrow area, and ODMRP routing algorithm has improved energy gain at the wide area.

• International Journal of Computer Science & Network Security
• /
• v.21 no.7
• /
• pp.341-349
• /
• 2021

Many emerging mobile ad-hoc network application communications are group-oriented. Multicast supports group-oriented applications efficiently, particularly in a mobile environment that has a limited bandwidth and limited power. Energy effectiveness along with safety are 2 key problem in MANET design. Within this paper, MANET is presented with a stable, energy-efficient clustering technique. In this proposed work advanced clustering in the networks with ticket ID cluster manager (TID-CMGR) has formed in MANET. The proposed routing scheme makes secure networking the shortest route possible. In this article, we propose a Cluster manager approach based on TICKET-ID to address energy consumption issues and reduce CH workload. TID-CMGR includes two mechanism including ticket ID controller, ticketing pool, route planning and other components. The CA (cluster agent) shall control and supervise the functions of nodes and inform to TID-CMGR. The CH conducts and transfers packets to the network nodes. As the CH energy level is depleted, CA elects the corresponding node with elevated energy values, and all new and old operations are simultaneously stored by CA at this time. A simulation trial for 20 to 100 nodes was performed to show the proposed scheme performance. The suggested approach is used to do experimental work using the NS- simulator. TIDCMGR is compared with TID BRM and PSO to calculate the utility of the work proposed. The assessment shows that the proposed TICKET-ID scheme achieves 90 percent more than other current systems.

• Journal of Internet Computing and Services
• /
• v.11 no.6
• /
• pp.87-110
• /
• 2010

Recently competitive Korean companies are suffered from financial loss due to illegal exposure of their own proprietary know-how secrets, since it is difficult to watch hidden illegal channels to leak them due to their digitalization. Today the DRM-based system designed to protect such secrets is insufficient to prevent it, since DRM-based protection system cannot defend the intelligent robbery of secrets, in special, employee's robbery. The MSEC is much appropriate to secure secrets against employee's robbery. Our paper notes that IGMP, MSEC and SNMP can work easily together to realize secure system that satisfy strong security condition for prevention from leaking secrets. Since the previous research was on the architectural design for prevention of illegal exposure, this paper proposes the efficient protocol based on MSEC protocol. Our protocol satisfies the strong security conditions that the principles that the secret should be stored/distributed only in an encrypted shape, and should be separated physically from its encryption key, and should be carried in registered mobile storage separate from its processing device, and should be verified in terms of both user and device. Thus this paper proposes both the protocol for secret document distribution and its group key management.

• Journal of Internet Computing and Services
• /
• v.14 no.2
• /
• pp.61-71
• /
• 2013

Until now, there have been various studies against Internet worms. Most of intrusion detection and prevention systems against Internet worms use detection rules, but these systems cannot respond to new Internet worms. For this reason, a malicious process control system which uses the fact that Internet worms multicast malicious packets was proposed. However, the greater the number of servers to be protected increases the cost of the malicious process control system, and the probability of detecting Internet worms attacking only some predetermined IP addresses is low. This paper presents a security framework that can reduce the cost of the malicious process control system and increase the probability of detecting Internet worms attacking only some predetermined IP addresses. In the proposed security framework, virtual machines are used to reduce the cost of control servers and unused IP addresses are used to increase the probability of detecting Internet worms attacking only some predetermined IP addresses. Therefore the proposed security framework can effectively respond to a variety of new Internet worms at lower cost.

• Journal of Communications and Networks
• /
• v.8 no.4
• /
• pp.378-390
• /
• 2006

Many distributed applications build overlays on top of the Internet. Several unsolved issues at the network layer can explain this trend to implement network services such as multicast, mobility, and security at the application layer. On one hand, overlays creating basic topologies are usually limited in flexibility and scalability. On the other hand, overlays creating complex topologies require some form of application level addressing, routing, and naming mechanisms. Our aim is to design an efficient and robust addressing, routing, and naming infrastructure for these complex overlays. Our only assumption is that they are deployed over the Internet topology. Applications that use our middleware will be relieved from managing their own overlay topologies. Our infrastructure is based on the separation of the naming and the addressing planes and provides a convergence plane for the current heterogeneous Internet environment. To implement this property, we have designed a scalable distributed k-resilient name to address binding system. This paper describes the design of our overlay infrastructure and presents performance results concerning its routing scalability, its path inflation efficiency and its resilience to network dynamics.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2016.10a
• /
• pp.110-111
• /
• 2016

디바이스 간 저장콘텐츠에 대해 ASMD (Adaptive Source Multi Device) 무선 N-스크린 공유 서비스를 제공하기 위해서는 콘텐츠 보안성을 갖는 무선 USB 기반 N-스크린 MAC에서의 멀티캐스트 전송기법이 반드시 요구된다. 본 논문에서는 ASMD N-스크린 공유 서비스를 위한 무선 통신 MAC 구조로서, WiMedia Distributed-MAC 기반의 Wireless USB 프로토콜을 적용하고, ASMD N-스크린 통신을 위해, 무선 USB 기반 N-스크린 MAC에서의 멀티캐스트 전송 기술을 제안하였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.10e
• /
• pp.379-381
• /
• 2002

인터넷이 급속도로 발전함에 따라 현재 사용하고 있는 IPv4 주소는 인터넷 초기 시절 무분별한 클래스 단위의 할당으로 주소가 고갈되고 있는 상태이며 인터넷 라우팅 시스템은 과부하 상태에 있다. 이에 따라 IPv4의 여러 문제점들에 대한 해결책을 연구하고 있으며 기존의 TCP／IP 프로토콜에 대한 수정 보완 작업 및 IPv4를 대체하는 방안으로 mobile IP, QoS, Security, multicast 등의 많은 프로토콜들이 추가되고 주소 공간 문제 등을 해결할 수 있는 IPv6 가 이슈화되고 있다. 그러나 가까운 시일 내에 모든 시스템들이 IPv4로부터 IPv6로 전이되는 것은 불가능하기 때문에 전반적이 IPv6 시스템이 구성될 때 까지 IPv4와 IPv6가 동시에 존재하게 되며 이들간의 통신을 위해서 IPv4／IPv6 전이 메커니즘은 필수 사항이다 따라서 본 논문에서는 현재까지 제안된 IP6 전이 메커니즘들 중 NAT-PT와 6to4 전이 메커니즘의 성능을 비교 분석하였다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2002.11b
• /
• pp.1643-1646
• /
• 2002

Ad-Hoc 네트워크는 모바일 호스트를 위한 새로운 무선 네트워크 패러다임이다. 전형적인 모바일 네트워크와는 다르게 ad-Hoc 네트워크는 어떠한 인프라스트럭처에 의존하지 않는다. 대신에 호스트들은 연결 유지를 위해 서로간에 의존한다. 이러한 특성을 지닌 ad-Hoc 네트워크의 보안은 주요 이슈라고 할 수 있다. Ad-Hoc 네트워크에서는 네트워크 Topology가 자주 번하기 때문에 이러한 특성에 맞는 확장성 있는 분산 그룹 키 분배를 제안한다.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.27 no.1
• /
• pp.51-59
• /
• 2024

Uumanned aerial vehicle(UAV) systems have been used in various fields including industry and military. According to increasing the number of UAVs, the attention on interoperable UAV systems is increasing. In this paper, we propose the practical design of datalink in interoperable UAV systems. For practical design, we firstly review the operational scenarios in the interoperable UAV system. We then propose the system model of the datalink in interoperable UAV system. Consequently, the technical components such as the design of the network, the link management, the support of the multicast transmission, the support for autonomous mission and flight safety, and the datalink security are derived and reviewed for the practical design.

• The KIPS Transactions:PartB
• /
• v.9B no.5
• /
• pp.587-598
• /
• 2002

In multicast environment, the main objective of group key management is to provide security services to group communications by sharing a single group key among all the members of the group and subsequently encrypting and decrypting all the communication messages exchanged among the members of the group. Up to now, there has been no effort to develop group key management mechanism that considers the rate of users' join/leave operations. Hence, in this research, we propose group key management mechanisms that consider the rate of user's join/leave operations. We also define a new tree structure called variable tree which is much more flexible than full regular trees and show that variable trees are more efficient than full regular trees for group key management. Especially, we propose an algorithm that minimizes the necessary number of rekey messages according to the rate of join and leave operations. We also shows that if the rate of leave operation is greater than 50%, then the tree structure with degrees 2 or 3 are the optimal structures.