• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.42 no.4 s.304
• /
• pp.17-24
• /
• 2005

The existing passive networks have the only data-storing and transmission functions. On the other hand, the active network which can do operation jobs on the transmitting packets was introduced at 1990's. However, the advantages of activating processing are obviously more complex than traditional networks and raise considerable security issues. In this paper, we propose the safer structure in Active Networks that is based on the discrete approach which resolves the weak point of the Active Network. The proposed system provides the node management and user management in the Active Networks, and improves the security of Packet transmission with packet cryptography and the session.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.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
• /
• v.6 no.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
• /
• v.11 no.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.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.5 no.5
• /
• pp.970-976
• /
• 2001

In this paper, OUIG IDL CFE, provided by Sunsoft, is used to take a IDL definitions as inputs and parse those. OmniORB3 is introduced to support functionality of the ORB. Suns CFE produce AST after parsing inputs. Actually, the node of AST Is instances of classes which are derived from CFE classes. As the compiler back end visit the node of the AST using iterator class, UTL_ScopeActiveIterator, it dumps codes of output. During processing, two files are generated. Routines of generating code are invoked by BE_produce.cc and codes are produced while visiting root of AST, idl_global->root(). The dump* functions which dump codes is called according to the type of node. In this paper, Mapping C++ of IDL definition is experimented and results In the same as that of omniidl which is provided by omniORB3. The code of results behavior correctly on omniORB3. In the future, we are interested in optimizing the performance of marshalling code via IDL compiler.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2003.11a
• /
• pp.470-473
• /
• 2003

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

• The Journal of Korea Robotics Society
• /
• v.4 no.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.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.8
• /
• pp.1831-1839
• /
• 2003

This paper suggests Enode Operating Systems that is core part of active network. It iscomposed of five parts: domain, channel, thread, memory and file module. The domain and channel module among five parts are the main function. The remaining parts that are the thread, memory, and file are the supporting module for the domain and channel. The domain module manages active network It creates and deletes domain data structure. The channel module has an inchan, outchan, and cutchan. We also test the Enode Operating Systems to verify suggesting concept of node Operating System.

• Journal of Communications and Networks
• /
• v.13 no.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
• /
• v.12 no.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.