• Journal of Digital Convergence
• /
• v.12 no.1
• /
• pp.333-338
• /
• 2014

Zigbee is a wireless communication technology optimized for WSN (Wireless Sensor Network) environment. A WSN gateway is used for node control and data transmission. However, a fixed-type gateway can restrict the flexibility of the WSN environment. A smartphone-mounted high-performance processor and Android OS can be easily used in a mobile WSN gateway. In this paper, we proposed a mobile WSN gateway based on Android smartphones. In the proposed system, a Zigbee sensor module is connected with a smartphone via USB (Universal Serial Bus) port. We also implemented an Android application for the mobile WSN gateway.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.14 no.6
• /
• pp.51-57
• /
• 2000

This paper proposes the new concept & design method and implementation of LonWorks network system for remote monitoring & lighting dimming control and telemetry using Web network. The Experimental LonWorks network system for telemetry & remote monitoring and control are designed and fabricated. As a result, it is verified that LonWorks is open, inteoperable, reliable network system from the experimental results, especially, it seamlessly links the data and control networks, allowing the IP(internet) network to be treated as an extension of the LonWorks networks, and vice versa.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.1
• /
• pp.55-62
• /
• 1996

MRNS network is a general algebraic structure of Hypercube network which has recently drawn considerable attention to supercomputing and message-passing communication. In this paper, we investigate the routing of a message in an n- dimensional MRNS network that is a key to the performance of this network. On the n-dimensional MRNS network we would like to transmit packets from a source node to a destination node simultaneously along a fixed number of paths, where the superscript packet will traverse along the superscript path. In order for all packets to arrive at the destination node quickly and securely, the ith path must be node-disjoint from all other paths. By investigating the conditions of node-disjoint paths, we will employ the special matrices called as the Hamiltonian Circuit Latin Square(HCLS) described in 〔1〕to construct a set of node-disjoint paths and suggest a linear-time parallel routing algorithm for the MRNS network.

• Journal of KIISE:Information Networking
• /
• v.28 no.1
• /
• pp.71-81
• /
• 2001

최근 병렬처리 시스템에 대한 연구는 마이크로 프로세서 제작 기술과 네트워크 기술이 발달함에 따라 고성능의 PC와 워크스테이션 여러대를 고속의 네트워크로 연결하여 구축하는 클러스터링 환경에 관심이 고조되고 있다. 그런데 이러한 클러스터링 시스템의 성능은 수행되는 애플리케이션 프로그램의 병렬성이나 xdhtls 빈도 등의 특성에 따라 달라진다. 그러므로 클러스터링 시스템의 성능을 향상시키기 위해서는 애플리케이션의 이러한 특성을 고려하여 최상의 효과를 얻기 위한 조정작업이 필요하며 그 방법중의 하나가 시스템 상에서 발생하는 통신들에 대하 스케줄링을 수행하는 것이다. 본 논문에서는 Myrinet 스위치를 사용하여 선형으로 구성한 클러스터링 시스테과 2차원 메쉬 형태로 구성한 클러스터링 시스템의 두 가지 모델을 가정하고 이들 모델 상에서 특성 시간에 주어지는 통신요청들에 대하여 순위차원 라우팅을 사용하여 메시지들을 최단시간에 전송할 수 있는 최적 통신스케줄링 알고리즘을 제안한다. 시스템 상에서 같은 방향으로 동시에 링크를 공유한는 통신들의 개수의 최대값을 $L_{MAX}$로 시스템에서 하나의 메시지가 전달되는데 걸리는 시간을 T로 정의하면 알고리즘에 의해 선형 네트워크에서의 통신 요청 집합에 대한 메시지 전송 완료 시간은 최대 $L_{MAX}{\cdot}T$, 메쉬 네트워크에서의 통신요청 집합에 대한 메시지 전송 완료시간은 최대 $frac{3}{2}{\cdot}T$임을 증명하였다.

• Journal of KIISE:Information Networking
• /
• v.29 no.5
• /
• pp.459-465
• /
• 2002

Ad-hoc networks have the dynamic topology characteristics and most of the applications on ad-hoc networks require the group communication capability. Previously proposed multicast mechanisms on mobile ad-hoc networks build multicast-infrastructures like the tree or mesh for the group communication and these infrastructures nay cause significant overhead especially in a highly dynamic mobile ad-hoc network environment. Therefore, in this paper, we propose a new multicast mechanism supporting multicast services based on only the underlying unicast routing tables, hence any multicast-related infrastructures like trees and meshes are not required to be constructed.

• The KIPS Transactions:PartC
• /
• v.13C no.2 s.105
• /
• pp.185-194
• /
• 2006

In this paper, we first propose a power-and-bandwidth efficient cooperative transmission protocol where a sensor node assists two others for their data transmission to a clusterhead in WSNs (Wireless Sensor Networks) using LEACH (Low-Energy Adaptive Clustering Hierarchy). Then we derive its closed-form BER expression which Is also a general BER one for the decode-and-forward protocol (DF) and Prove that the proposed protocol performs as same as the conventional DF but obtains higher spectral efficiency. A variety of numerical results reveal the cooperation can save the network power up to 11dB over direct transmission at BER of $10^{-3}$.

• The KIPS Transactions:PartA
• /
• v.18A no.4
• /
• pp.159-164
• /
• 2011

In this paper, we suggest the active multi-agent middleware for the sensor network application. For this, firstly we design and implement the active rule based mobile agent middleware. The mobile agent in the proposed system visits the destination sensor nodes according to the migration list offered by the meta table in the name space of the naming agent, acquires and transmits sensor data according to the purpose and needs through the active rules, and directly executes the actions corresponding to the optional events(changed sensor data and/or time etc.). And then, we show the potential applicability of the active rule based mobile agent middleware in various active sensor networks through the interaction with the rule base system and context database system.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.48 no.3
• /
• pp.1-5
• /
• 2011

In order to analyze the impedance properties of high integrated impedance network with multiple terminals, this paper introduces the concept of impedance relation matrix(IRM). The linear relation between the terminal voltages and currents is represented in the form of IRM and this matrix can be utilized to calculate the impedance between any two terminals. Furthermore, IRM representation for 2-port impedance network can be also defined. The whole impedance network is divided into the several 2-port sub-networks and each sub-network is analyzed in a form of the IRM representation. An illustrated example is given to show that the proposed method is simple and effective to analyze the impedance of a sensor array which has a very large number of impedance elements.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.6
• /
• pp.15-22
• /
• 1989

This paper presents a distributed routing scheme for allowing network control to be distributed through the switching elements of a multistage baseline network. The routing technique we use here is the destination tag scheme which uses the binary representation of a destination address as the reuting tag. With the topological properties of the network, we introduce a distributed algorithm which allows any connection from a source to arbitrary number of destinations. Also, the performance of the proposed method is evaluated by computer simulation, and the results of the method is compared to other schemes in terms of time complexity.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.12B
• /
• pp.847-854
• /
• 2005

Many of scheduling algorithms that provide a pre-defined bandwidth to a traffic flow fall into a category of Latency-rate (LR) server, the delay of whose network can be simply calculated by adding up individual 'latencies' of each LR servers. Deficit Round Robin (DRR) is one of such LR servers and the simplest one to implement, so that it is adopted in many real systems. In this research we suggest an improved version of DRR, the DRR with Instant Service (DRR-IS), and analyze it. We have proved that the DRR-IS is still an LR sewer and have obtained its latency. The DRR-IS, compared with DRR, turns out to have the same complexity while provide about $30\%$ better latency.