• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.6
• /
• pp.1493-1504
• /
• 2010

The localization service which provides the location information of mobile user, is one of important service provided by sensor network. Many methods to obtain the location information of mobile user have been proposed. However, these methods were developed for only one mobile user so that it is hard to extend for multiple mobile users. If multiple mobile users start the localization process concurrently, there could be interference of beacon or ultrasound that each mobile user transmits. In the paper, we propose LME, the localization technique for multiple mobile nodes in mobile wireless sensor networks. In LME, collision of localization between sensor nodes is prevented by forcing the mobile node to get the permission of localization from anchor nodes. For this, we use CTS packet type for localization initiation by mobile node and RTS packet type for localization grant by anchor node. NTS packet type is uevento reject localization by anchor node for interference avoidance.nghe experimental result shows that the number of interference between nodes are increased in proportion to the number of mobile nodes and LME provides efficient localization.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.15 no.6
• /
• pp.59-69
• /
• 2005

Ad hoc network is the network which can be considered without a pre-constructed infrastructure, and a mobile node can join the network freely. However, the participation of the mobile nodes to the ad hoc network brings up much burden of re-computation for new routes, because it leads to losing the connection frequently. And, also, it causes serious security problem to be broadcasted wrong information by the malicious user. Therefore, it needs authentication against the mobile nodes. To make that Possible, we have two methods: single CA and distributed CA. In the case of CA method, the wireless network can be collapsed owing to expose the CA, but still the distributed CA method is a little more safe than previous one because it needs attacks toward a lot of CAs to collapse the network We can consider Secret Share scheme as the method that constructs the distributed CA system, but it is weak when the network size is too large. In this paper, we suggest hierarchical structure for the authentication method to solve this problem, and we will show the results of simulation for this suggestion.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.4
• /
• pp.31-37
• /
• 2008

In this paper, we propose a dynamic job relocation strategy that considering application's characteristics in multiple grid sites. This scheme classifies application to execute in multiple grid sites by their characteristics : computing intensive application, network intensive application. Also, it eliminates the communication between sites by allocating the network intensive application in single site, thus reducing the total job execution time. But if a number of free nodes to execute the network intensive application aren't found in single site, the proposed scheme the first allocates the network intensive application in multiple sites to minimize network latency. Then if the network intensive application being executed in multiple sites suitable free nodes are found in single site. the proposed scheme relocates the application being executed in multiple sites to another single site. This results in reducing the total job execution time. Through simulation, we show that the proposed dynamic job reallocation strategy improves the performance of Data Grid environment compared with previous strategies.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.22 no.3
• /
• pp.354-361
• /
• 2011

In this paper, we propose a spectrum sharing system that enable secondary user's spectrum access in cooperative communication scheme. At phase 1, a transmitter in primary system broadcasts signals to the rest nodes. And then, at phase 2, a transmitter in secondary system combines the decoded signals after received from a transmitter in primary system and its own signal. And then transmitter of secondary system broadcasts the combined signals to receivers of primary and secondary systems. At this time, due to the process of combining signals, receivers of primary and secondary systems experiences a performance degradation. Therefore, we propose a novel adaptive incremental decode-andforward(AIDF) protocol to overcome this problem. By using AIDF protocol, we show performance improvement of total system through various simulations.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.1
• /
• pp.179-187
• /
• 2014

The underlay protocol is a cognitive radio method in which secondary or cognitive users use the same frequency without affecting the quality of service (QoS) for the primary users. In addition, because of the broadcast characteristics of the wireless environment, some nodes, which are called eavesdropper nodes, want to illegally receive information that is intended for other communication links. Hence, Physical Layer Security is applied considering the achievable secrecy rate (ASR) to prevent this from happening. In this paper, a performance analysis of the amplify-and-forward scheme under an interference constraint and Physical Layer Security is investigated in the cooperative communication mode. In this model, the relays use an amplify-and- forward method to help transmit signals from a source to a destination. The best relay is chosen using an opportunistic relay selection method, which is based on the end-to-end ASR. The system performance is evaluated in terms of the outage probability of the ASR. The lower and upper bounds of this probability, based on the global statistical channel state information (CSI), are derived in closed form. Our simulation results show that the system performance improves when the distances from the relays to the eavesdropper are larger than the distances from the relays to the destination, and the cognitive network is far enough from the primary user.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2011.05a
• /
• pp.336-339
• /
• 2011

In the RTLS(Real Time Location Based System), in case of existing a number of moving target, extremely complecated data flow is can be occurred. In the network where single gateway exists, various data which was collected from sensor node is transmitted along the simple route as time goes by. In case of multi-gateway configuration, the collected data is transmitted through diverse routes rather than simple route. This kind of data causes jams on nodes and this brings down the performance of the network. Different from existing studies, in this thesis, MAC (Media Access Control) protocol which minimizes data collision between nodes and guarantees QoS(Quality of Service) is suggested, in order to communicate efficiently in multi-gateway underwater sensor network environment. In the suggested protocol, source node which wants to transmit data makes a channel reservation to a number of destination node using a RTS packet. Source node reserves a channel without collision, by scheduling CTS response time using expected delay information from neighbor nodes. Once the reservation is made, source node transmit data packet without collision. This protocol analyzes/estimates the performance compared to a method provided from existing studies via simulation. As a results of the analysis, it was comfirmed that the suggested method has better performance, such as efficiency and delay.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.49 no.3
• /
• pp.19-25
• /
• 2012

Underwater sensor networks (UWSNs) employ acoustic channels for communications. One of the main characteristics of the underwater acoustic channel is long propagation delay. Previously proposed MAC (medium access control) protocols for wireless sensor networks cannot be directly used in UWSNs due to the long propagation delay. The long propagation delay and uneven nodes deployments cause spatial fairness in UWSNs. Therefore, a new MAC protocol for UWSNs needs to be developed to provide efficient communications. In this paper, we propose an efficient MAC protocol in order to alleviate the fairness problem. In the proposed scheme, when a node receives a RTS packet, it does not immediately send back but delays a CTS packet. The node collects several RTS packets from source nodes during the delay time. It chooses one of the RTS packets based on the queue status information. And then, it sends a CTS packet to the source node which sent the chosen RTS packet. The performance of the proposed scheme is investigated via simulation. Simulation results show that our scheme is effective and alleviates the fairness problem.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.8A
• /
• pp.1247-1253
• /
• 2000

To fully utilize the capabilities of a SONET/ADM network, traffic grooming is needed to multiplex a number of lower-rate traffic streams into a higher-rate stream, and vice versa. Although the capacity of a SONET ring network can be upgraded by operating it over multiple wavelengths, the corresponding network design may be costly if it employs a large number of ADMs. A cost-effective design attempts to minimize the total number of ADMs used in the network while carrying the offered traffic. We introduce and evaluate the performance characteristics of a new traffic-grooming approach for WDM ring networks, called multihop. The multihop implementation places an ADM at each node based on the requested traffic in the traffic-demand matrix then, it tries to groom the wavelengths which can be groomed. We select one of the nodes to be the "hub" node which has an ADM for each wavelength. The hub node, therefore, can "bridge" traffic between all of the wavelengths. The algorithm is specified and illustrated by a simple example. Our results demonstrate that it is beneficial to use a single-hop approach, but for a large grooming ratio and node number, we advocate the use of the multihop approach.e multihop approach.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2009.05a
• /
• pp.996-1000
• /
• 2009

물순환계를 종합적으로 관리하기 위해서는 물순환계의 모니터링과 해석모형의 구축이 필요하다. 실측자료만으로는 복잡 다양한 물순환계 구조 및 인과관계를 규명할 수 없기 때문에 시간적 공간적으로 변화하는 다양한 수문현상을 일관된 하나의 시스템으로 이해하기 위해 물순환 해석모델을 구축하여 검토할 필요가 있다. CAT(Catchment hydrologic cycle Analysis Tool)은 수문학적으로 균일하게 판단되는 범위를 소유역으로 분할하여 지형학적 요인에 의한 유출 특성을 객관적으로 반영할 수 있게 하며, 토양층에 따라 침투, 증발, 지하수 흐름 등의 모의가 가능하도록 하는 Link-Node 모형으로, 증발산은 기준 증발산을 외부에서 직접 입력하거나, Penman-Monteith 방법을 선택할 수 있으며, 침투는 토양의 수리전도도에 따른 연직방향 침투 및 사면방향 복귀류를 고려할 수 있다. 노드의 지하수 유거를 고려하여 기존 노드-링크 방식 모형의 장기 유출 해석시 제한점을 보완하였으며, Muskingum, Muskingum-Cunge, Kinematic wave 방법을 이용하여 하도추적을 모의할 수 있다. 또한 GUI를 통해 사용자가 손쉽게 모형을 적용하고 관리 할 수 있도록 하고, 여러 시나리오를 적용함에 있어서 편리하도록 개발 중인 모형이다. 본 연구에서는 개발중인 CAT 모형을 평가 하기위해 시험 유역으로 운영 중인 설마천 유역에 적용하여 소유역 분할(노드수), 계산 시간 간격(일/시단위) 등에 따른 적용성을 평가하였다. 관측 자료를 통해 구축 가능한 물리적 매개변수를 통해 해당 유역을 단일 노드 및 다중 노드로 간단히 모형화할 수 있었으며, 모의 결과, 관측 유량과 적절히 일치하는 결과를 얻을 수 있었다. 1시간 단위에 대한 모의에서도 유출을 적절히 모의할 수 있었으며, 소규모 유역에 대한 정밀한 물순환 해석이 가능할 것으로 평가되었다.

• The Journal of the Korea Contents Association
• /
• v.11 no.7
• /
• pp.38-50
• /
• 2011

For energy-efficiency in Wireless Sensor Networks (WSNs), when a sensor node detects events, the sensing period for collecting the detailed information is likely to be short. The lifetime of WSNs decreases because communication modules are used excessively on a specific sensor node. To solve this problem, the TARP decentralized network packets to neighbor nodes. It considered the average data transmission rate as well as the data distribution. However, since the existing scheme did not consider the energy consumption of a node in WSNs, its network lifetime is reduced. The proposed scheme considers the remaining amount of energy and the transmission rate on a single node in fitness evaluation. Since the proposed scheme performs an efficient congestion control it extends the network lifetime. The simulation result shows that our scheme enhances the data fairness and improves the network lifetime by about 27% on average over the existing scheme.