• Journal of the Institute of Convergence Signal Processing
• /
• v.9 no.1
• /
• pp.31-38
• /
• 2008

Ad-Hoc network is a network architecture which has no backbone network and is deployed temporarily and rapidly in emergency or war without fixed mobile infrastructures. All communications between network entities are carried in ad-hoc networks over the wireless medium. Due to the radio communications being extremely vulnerable to propagation impairments, connectivity between network nodes is not guaranteed. Therefore, many new algorithms have been studied recently. This study proposes the secondary header approach to the cluster based routing protocol (CBRP). The primary header becomes abnormal status so that the primary header can not participate in the communications between network entities, the secondary header immediately replaces the primary header without selecting process of the new primary header. This improves the routing interruption problem that occurs when a header is moving out from a cluster or in the abnormal status. The performances of proposed algorithm ACBRP(Advanced Cluster Based Routing Protocol) are compared with CBRP. The cost of the primary header reelection of ACBRP is simulated. And results are presented in order to show the effectiveness of the algorithm.

• Journal of Korea Spatial Information System Society
• /
• v.10 no.3
• /
• pp.79-91
• /
• 2008

Recently, with highly Interest In Location-Based Service(LBS) utilizing location data of moving objects, the GALIS(Gracefully Aging Location Information System) which is a cluster-based distributed computing architecture was proposed as a more efficient location management system of moving objects. In the SLDS(Short-term location Data Subsystem) which Is a subsystem of the GALIS, since the SDP(Short-term Data Processor) Master transmits current location data and queries to every SDP Worker, the SDP Master reassembles and sends query results produced by SDP Workers to the client. However, the services are suspended during the SDP Master under failure and the response time to the client is increased if the load is concentrated on the SDP Master. Therefore, in this paper, the extended SLDS was designed and implemented to solve these problems. Though one SDP Master is under failure, the other can provide the services continually, and so the extended SLDS can guarantee the high reliability of the SLDS. The extended SLDS also can reduce the response time to the client by enabling two SDP Masters to perform the distributed query processing. Finally, we proved high reliability and high availability of the extended SLDS by implementing the current location data storage, query processing, and failure takeover scenarios. We also verified that the extended SLDS is more efficient than the original SLDS through the query processing performance evaluation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.8B
• /
• pp.716-729
• /
• 2003

As the public Internet and private internet have grown from small networks into large infrastructures, the need to more systematically manage the large number of network components within these networks has grown more important as well. The rapid growth of network size has brought into question the salability of the existing centralized model, such as SNMP(Simple Network Management Protocol) and CMIP(Common Management Information Protocol). Thus, for efficient network management, researches about mobile agent have also been performed recently. This paper presents analytical models of centralized approach based on SNMP protocol, distributed approach based on mobile agent, and mixed mode to make up for shortcomings of SNMP and mobile agent. We compare the performance of these analytical models based on network management response time. Experiment results show that performance of mobile agent and the nixed mode is less sensitive to the delay in WAN network environment. However, SNMP is more efficient for the simple network environment like LAN. We also propose an adaptive network management algorithm in consideration of network t environment. delay, task, and the number of nodes based on the results of analytical models. The results show that the adaptive network management algorithm can reduce the network management response time by 10% compared with either mobile agent or mixed mode network management algorithm.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.5
• /
• pp.1-6
• /
• 2007

In wireless mesh networks (WMNs), the end-to-end throughput of a flow decreases drastically according to the traversed number of hops due to interference among different hops of the same flow in addition to interference between hops of different flows with different paths. This paper proposes a distributed multi-channel assignment scheme based on hops (DMASH) to improve the performance of a static WMN. The proposed DMASH is a novel distributed multi-channel assignment scheme based on hops to enhance the end-to-end throughput by reducing interference between channels when transmitting packets in the IEEE 802.11 based multi-interface environments. The DMASH assigns a channel group to each hop, which has no interference between adjacent hops from a gateway in channel assignment phase, then each node selects its channel randomly among the channel group. Since the DMASH is a distributed scheme with unmanaged and auto-configuration of channel assignment, it has a less overhead and implementation complexity in algorithm than centralized multi-channel assignment schemes. Simulation results using the NS-2 showed that the DMASH could improve remarkably the total network throughput in multi-hop environments, comparing with a random channel assignment scheme.

• KIPS Transactions on Computer and Communication Systems
• /
• v.2 no.5
• /
• pp.191-198
• /
• 2013

It is required to transmit data through shorter path between sensor and base node for real time intrusion detection in wireless sensor networks (WSN) with a mobile base node. Because minimum Wiener index spanning tree (MWST) based routing approach guarantees lower average hop count than that of minimum spanning tree (MST) based routing method in WSN, it is known that MWST based routing is appropriate for real time intrusion detection. However, the minimum Wiener index spanning tree problem which aims to find a spanning tree which has the minimum Wiener index from a given weighted graph was proved to be a NP-hard. And owing to its high dependency on certain nodes, minimum Wiener index tree based routing method has a shorter network lifetime than that of minimum spanning tree based routing method. In this paper, we propose a multi-objective ant colony optimization algorithm to tackle these problems, so that it can be used to detect intrusion in real time in wireless sensor networks with a mobile base node. And we compare the results of our proposed method with MST based routing and MWST based routing in respect to average hop count, network energy consumption and network lifetime by simulation.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.1
• /
• pp.141-150
• /
• 2012

This paper suggests a critical path search algorithm that can easily draw PERT/GANTT chart which manages and plans a project schedule. In order to evaluate a critical path that determines the project schedule, Critical Path Method (CPM) is generally utilized. However, CPM undergoes 5 stages to calculate the critical path for a network diagram that is previously designed according to correlative relationship and execution period of project execution activities. And it may not correctly evaluate $T_E$ (The Earliest Time), since it does not suggest the way how to determine the sequence of the nodes activities that calculate the $T_E$. Also, the sequence of the network diagram activities obtained from CPM cannot be visually represented, and hence Lucko suggested an algorithm which undergoes 9 stages. On the other hand, the suggested algorithm, first of all, decides the sequence in advance, by reallocating the nodes into levels after Breadth-First Search of the network diagram that is previously designed. Next, it randomly chooses nodes of each level and immediately determines the critical path only after calculation of $T_E$. Finally, it enables the representation of the execution sequence of the project activity to be seen precisely visual by means of a small movement of $T_E$ of the nodes that are not belonging to the critical path, on basis of the $T_E$ of the nodes which belong to the critical path. The suggested algorithm has been proved its applicability to 10 real project data. It is able to get the critical path from all the projects, and precisely and visually represented the execution sequence of the activities. Also, this has advantages of, firstly, reducing 5 stages of CPM into 1, simplifying Lucko's 9 stages into 2 stages that are used to clearly express the execution sequence of the activities, and directly converting the representation into PERT/GANTT chart.

• 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 Korea Society of Digital Industry and Information Management
• /
• v.6 no.1
• /
• pp.83-90
• /
• 2010

DTNs (Delay Tolerant Networks) refer to the networks that can support data transmission in the extreme networking situations such as continuous delay and no connectivity between ends. DTMNs (Delay Tolerant Networks) are a specific range of DTNs, and its chief considerations in the process of message delivery in the routing protocol are the transmission delay, improvement of reliability, and reduction of network loading. This article proposes a new LCN (Largest Common Neighbor) routing algorism to improve Spray and Wait routing protocol that prevents the generation of unnecessary packets in a network by letting mobile nodes limit the number of copies of their messages to all nodes to L. Since higher L is distributed to nodes with directivity to the destination node and the maximum number of common neighbor nodes among the mobile nodes based on the directivity information of each node and the maximum number of common neighbor nodes, more efficient node transmission can be realized. In order to verify this proposed algorism, DTN simulator was designed by using ONE simulator. According to the result of this simulation, the suggested algorism can reduce average delay and unnecessary message generation.

• Proceedings of the Korean Information Science Society Conference
• /
• 2008.06d
• /
• pp.276-280
• /
• 2008

무선 센서 네트워크의 연구는 이벤트 기반과 주기적 모니터링 기반미라는 두 가지 응용의 형태에 맞추어 진행되었다. 두 가지 응용의 핵심적인 요구 사항은 다르지만 안정적인 운용을 위해 공동적으로 낮은 전송 자연의 요구가 존재한다. 하지만 기존의 무선 센서 네트워크의 프로토콜은 에너지 효율성을 중심으로 연구가 진행되었기 때문에 전송 자연에 대한 고려가 부족하였다. 본 논문에서는 무선 센서 네트워크의 MAC 프로토콜인 RA-MAC(RTS Aggregation-Media Access Control) 프로토콜을 제안하였다. RA-MAC 프로토콜은 새로운 채널 접근 기법 및 RTS Aggregation 기법에 의해 에너지 효율성과 낯은 전송 자연을 이룰 수 있고 수신 노드의 전송 스케줄링에 의해 이벤트 기반과 주기적 모니터링 기반 응용의 요구 사항을 동시에 만족시킬 수 있다. 실험을 통해 RA-MAC 프로토콜은 기존에 제안된 에너지 효율적인 MAC 프로토콜과 비슷한 에너지 효율을 보이면서 좀 더 낮은 전송 지연을 이루고 전송률을 향상시킬 수 있음을 확인하였다.

• The Journal of the Korea Contents Association
• /
• v.11 no.1
• /
• pp.65-71
• /
• 2011

In this paper, the RFID / USN-based ad-hoc network structure is presented for efficient operation of a container terminal yard. Communication between fixed or mobile devices in the container terminal yard is accomplished through the ad-hoc node, to collect the status information of a container in real time. Any outside shipper of the container as well as central server allows to share the status information of a container through ad-hoc communication. In addition, to predict the maximum wireless transmission range of nodes by RFID tag position in the yard, LAODV (Location based AODV) routing protocol is proposed. The validity is proved by performance evaluation via computer simulation.