• 전자공학회논문지CI
• /
• 제42권4호
• /
• pp.17-24
• /
• 2005

기존의 수동적인 네트워크는 단순히 데이터의 저장과 전송기능만을 가지고 있다. 이와 달리 액티브 네트워크는 네트워크 전송로상에서 전달중인 패킷에 대한 연산작업이 가능한 네트워크 패러다임이 1990년대 소개되었다. 하지만, 이와 같은 네트워크 패킷에 대한 능동적인 처리가 가능하다는 특징은 보안에 관한 측면에서는 보다 많은 보안상의 위협가능성을 고려해야만 한다. 본 논문에서는 이와 같이 능동적인 처리가 가능한 액티브 네트워크 환경의 취약점을 보안하고자 패킷 분리 방식을 이용한 안전한 액티브 네트워크 구조를 제안한다. 제안하고자 하는 시스템은 액티브 노드의 관리와 서비스의 이용자에 대한 관리가 가능한 모델로 설계하며, 패킷의 암호화와 세션을 이용한 패킷 전송을 통해 보안성을 향상시키고자 한다.

• 한국통신학회논문지
• /
• 제34권3B호
• /
• pp.213-224
• /
• 2009

Most of existing routing methods in wireless sensor networks to counter the local eavesdropping-based packet-tracing deal with a single asset and suffer from the packet-delivery latency as they prefer to take a separate path of many hops for each packet being sent. Recently, the author proposed a routing method, GSLP-w(GPSR-based Source-Location Privacy with crew size w), that enhances location privacy of the packet-originating node(i.e., active source) in the presence of multiple assets, yet taking a path of not too long. In this paper, we present a refined routing(i.e., next-hop selection) procedure of it and empirically study privacy strength and delivery latency with varying the crew size w(i.e., the number of packets being sent per path). It turns out that GSLP-w offers the best privacy strength when the number of packets being sent per path is randomly chosen from the range [$1,h_{s-b}/4$] and that further improvements on the privacy are achieved by increasing the random walk length TTLrw or the probability prw that goes into random walk(where, $h_{s-b}$ is the number of hops of the shortest path between packet-originating node s and sink b).

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

Wireless sensor networks are usually characterized by dense deployment of energy constrained nodes. Due to the usage of a large number of sensor nodes in uncontrolled hostile or harsh environments, node failure is a common event in these systems. Another common reason for node failure is the exhaustion of their energy resources and node inactivation. Such failures can have adverse effects on the quality of the real-time services in Wireless Sensor Networks (WSNs). To avoid such degradations, it is necessary that the failures be recovered in a proper manner to sustain network operation. In this paper we present a dynamic Energy efficient Real-Time Job Allocation (ERTJA) algorithm for handling node failures in a cluster of sensor nodes with the consideration of communication energy and time overheads besides the nodes' characteristics. ERTJA relies on the computation power of cluster members for handling a node failure. It also tries to minimize the energy consumption of the cluster by minimum activation of the sleeping nodes. The resulting system can then guarantee the Quality of Service (QoS) of the cluster application. Further, when the number of sleeping nodes is limited, the proposed algorithm uses the idle times of the active nodes to engage a graceful QoS degradation in the cluster. Simulation results show significant performance improvements of ERTJA in terms of the energy conservation and the probability of meeting deadlines compared with the other studied algorithms.

• Journal of Communications and Networks
• /
• 제11권6호
• /
• pp.589-598
• /
• 2009

In wireless sensor networks, a node that reports information gathered from adjacent assets should relay packets appropriately so that its location context is kept private, and thereby helping ensure the security of the assets that are being monitored. Unfortunately, existing routing methods that counter the local eavesdropping-based tracing deal with a single asset, and most of them suffer from the packet-delivery latency as they prefer to take a separate path of many hops for each packet being sent. In this paper, we propose a routing method, greedy perimeter stateless routing-based source-location privacy with crew size w (GSLP-w), that enhances location privacy of the packet-originating node (i.e., active source) in the presence of multiple assets. GSLP-w is a hybrid method, in which the next-hop node is chosen in one of four modes, namely greedy, random, perimeter, and retreat modes. Random forwarding brings the path diversity, while greedy forwarding refrains from taking an excessively long path and leads to convergence to the destination. Perimeter routing makes detours that avoid the nodes near assets so that they cannot be located by an adversary tracing up the route path. We study the performance of GSLP-w with respect to crew size w (the number of packets being sent per path) and the number of sources. GSLP-w is compared with phantom routing-single path (PR-SP), which is a notable routing method for source-location privacy and our simulation results show that improvements from the point of the ratio of safety period and delivery latency become significant as the number of source nodes increases.

• 한국정보통신학회논문지
• /
• 제5권5호
• /
• pp.970-976
• /
• 2001

본 논문에서는 IDL 정의를 입력받아 파싱하는 컴파일러의 전반부를 위해 OMG IDL 컴파일러를 사용하였다. 또한 ORB를 위해 omniORB3[1]를 사용했다. OMG IDL CFE는 IDL 정의를 입력받아 어휘 및 구문 분석을 한 후 AST 트리를 생성하며, 생성된 각 노드는 우리가 새로 추가한 BE_* 클래스의 인스턴스로 구성된다. IDL 컴파일러의 후반부는 AST의 각 노드를 반복자인 UTL_ScopeActiveIterator 클래스를 사용하여 반복적으로 각 순회하면서 해당하는 출력을 덤프한다. 이때 두개의 출력 파일을 생성토록 했다. 모든 코드 생성은 BE_produce.cc에서 시작되며, idl_global->root() 노드를 시작으로 하여 각 클래스에 해당 코드를 생성하는 dump* 함수를 호출하여 생성했다. 본 논문은 IDL 정의를 C++언어로 맵핑만을 실험했으며, 이것은 omniORB3에서 제공하는 IDL 컴파일러와 동일한 결과를 생성했으며, omniORB3[1] 환경에서 동작하는 변환된 C++ 코드임을 실험했다. 향후 IDL 컴파일러를 통한 성능 향상을 위해 마샬링 코드의 최적화를 할 수 있도록 하는 코드를 생성하는 문제에 관심을 가지고 있다.

• 한국멀티미디어학회:학술대회논문집
• /
• 한국멀티미디어학회 2003년도 추계학술발표대회(상)
• /
• pp.470-473
• /
• 2003

군사분야에서 컴퓨터 시뮬레이션의 활용은 이미 수십 년 전부터 이루어지고 있다. 컴퓨터 시뮬레이션을 통해서 실제 전투자산을 가동하지 않고 실전과 같은 전투경험을 부여하고 있다. 이러한 시뮬레이션이 실제와 똑같은 환경을 구축하기 위해서는 현재 사용하는 워게임 모델을 운용하기 위한 데이터베이스가 잘 구축되어야 하고, 그 데이터베이스를 포함한 페더레이트(federate)간의 연동(federation)이 네트워크 상에서 잘 수행되어야 한다. 이에 본 논문에서는 전장 데이터(이하 액티브 패킷)의 신속한 전달을 필요로 하는 긴급한 실제상황과 유사한 전장공간을 구축할 수 있도록 액티브 네트워크 상에서 페더레이트(혹은 액티브 노드) 간의 효율적인 트래픽 처리가 가능한 가상 전장 환경을 구성하고, 이에 대한 유효성을 모의실험을 통하여 검증하였다.

• 로봇학회논문지
• /
• 제4권3호
• /
• pp.177-184
• /
• 2009

This paper presents an active assisted-living system in wireless sensor and actor network (WSAN) in which the mobile robot roles an actor. In order to provide assisted-living service to the elderly people, position recognition of the sensor node attached on the user and localization of the mobile robot should be performed at the same time. For the purpose, we use received signal strength indication (RSSI) to find the position of the person and ubiquitous sensor nodes including ultrasonic sensor which performs both transmission of sensor information and localization like global positioning system. Active services are moving to the elderly people by detecting activity sensor and visual tracking and voice chatting with remote monitoring system.

• 한국정보통신학회논문지
• /
• 제7권8호
• /
• pp.1831-1839
• /
• 2003

본 논문은 능동 네트워크를 동작하게 해주는 핵심 모듈인 Enode 노드 운영체제 구조 및 세부 기능들의 내용을 정의한다. 본 논문에서 제안하는 Enode 노드 운영체제는 능동 네트워크 환경에 적합하도록 설계하였다. 또한 "실행 환경"(Execution Environment : EE)에서 편리하게 사용할 수 있도록 인터페이스를 설계하였다. 본 논문에서 제안하는 Enode 노드 운영체제는 도메인을 중심으로 핵심적인 기능 설계에 주력하였다. Enode 운영체제는 Linux 운영체제 상에서 설계되었다. 또한 본 논문에서 제안하는 Enode 노드 운영체제의 인터페이스에 대한 실험을 수행하였다.

• Journal of Communications and Networks
• /
• 제13권5호
• /
• pp.463-471
• /
• 2011

Cooperative communications using relays in wireless networks have similar effects of multiple-input and multiple-output without the need of multiple antennas at each node. To implement cooperation into a system, efficient protocols are desired. In IEEE 802.11 families such as a/b/g, mobile stations can automatically adjust transmission rates according to channel conditions. However throughput performance degradation is observed by low-rate stations in multi-rate circumstances resulting in so-called performance anomaly. In this paper, we propose active relay-based cooperative medium access control (AR-CMAC) protocol, in which active relays desiring to transmit their own data for cooperation participate in relaying, and it is designed to increase throughput as a solution to performance anomaly. We have analyzed the performance of the simplified AR-CMAC using an embedded Markov chain model to demonstrate the gain of AR-CMAC and to verify it with our simulations. Simulations in an infrastructure network with an IEEE 802.11b/g access point show noticeable improvement than the legacy schemes.

• Journal of Power Electronics
• /
• 제12권5호
• /
• pp.830-841
• /
• 2012

Active power filters (APF) can be employed for harmonic compensation in power systems. In this paper, a fuzzy based method is proposed for identification of probable APF nodes of a radial distribution system. The modified adaptive particle swarm optimization (MAPSO) technique is used for final selection of the APFs size. A combination of Fuzzy-MAPSO method is implemented to determine the optimal allocation and size of APFs. New fuzzy membership functions are formulated where the harmonic current membership is an exponential function of the nodal injecting harmonic current. Harmonic voltage membership has been formulated as a function of the node harmonic voltage. The product operator shows better performance than the AND operator because all harmonics are considered in computing membership function. For evaluating the proposed method, it has been applied to the 5-bus and 18-bus test systems, respectively, which the results appear satisfactorily. The proposed membership functions are new at the APF placement problem so that weighting factors can be changed proportional to objective function.