• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.44 no.1
• /
• pp.64-69
• /
• 2007

This paper designs an interpolator for a high speed ultra wide bandwidth (UWB). The UWB wireless technology will play a key role in short-range wireless connectivity supporting very high bit rates availability, low power consumption, and location capabilities. Because the UWB needs high operating speed, a cubic interpolator based on variable parameters for the UWB needs to be operated at a high speed. In order to improve an operating speed, the modified cubic interpolator is based on both a parallel processing and a pipelining in the existing interpolator simultaneously. Experimental results show that a maximum operating speed and period of the proposed interpolator using Stratix II EP2S60F1020C3 is 102.42MHz and 9.764ns, respectively. Compared to the conventional interpolator, the designed cubic parameter interpolator has been improved more than about 190%.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.3A
• /
• pp.287-295
• /
• 2010

In wireless sensor networks(WSNs), the studies that support sink mobility without global position information exploit a Backbone-based Virtual Infrastructure (BVI) which considers one-hop clusters and a backbone-based tree. Since the clusters of a sink and a source node are connected via flooding into the infrastructure, it causes high routing cost. Although the network could reduce the number of clusters via multi-level clusters, if the source nodes exist at nearest clusters from the cluster attached by the sink and they are in different branches of the tree, the data should be delivered via detour paths on the tree. Therefore, to reduce the number of clusters, we propose a novel multi-hop cluster based communication protocol supporting sink mobility without global position information. We exploit a rendezvous cluster head for sink location service and data dissemination but the proposed protocol effectively reduces data detour via comparing cluster hops from the source. Simulation shows that the proposed protocol is superior to the existing protocols in terms of the data delivery hop counts.

• Journal of Internet Computing and Services
• /
• v.17 no.3
• /
• pp.11-18
• /
• 2016

Accessing unauthorized rogue APs in WiFi environments is a very dangerous behavior which may lead WiFi users to be exposed to the various cyber attacks such as sniffing, phishing, and pharming attacks. Therefore, prompt and precise detection of rogue APs and properly alarming to the corresponding users has become one of most essential requirements for the WiFi security. This paper proposes a new rogue AP detection method which is mainly using the installation information of authorized APs and the DHCP snooping information of the corresponding switches. The proposed method detects rogue APs promptly and precisely, and notify in realtime to the corresponding users. Since the proposed method is simple and does not require any special devices, it is very cost-effective comparing to the wireless intrusion prevention systems which are normally based on a number of detection sensors and servers. And it is highly precise and prompt in rogue AP detection and flexible in deployment comparing to the existing rogue AP detection methods based on the timing information, location information, and white list information.

• Journal of KIISE:Information Networking
• /
• v.29 no.3
• /
• pp.224-232
• /
• 2002

The routing protocols designed for wired networks can hardly be used for mobile ad-hoc networks due to limited bandwidth of wireless transmission and unpredictable topological change. Recently, several routing protocols for mobile ad-hoc networks have been proposed. However, when these protocols are applied to support real time services like multimedia transmission, they still have problems in ad-hoe networks, where the topology changes drastically. In this paper, we propose a new route selection algorithm which selects the most reliable rouse that is impervious to route failures by topological changes by mobile hosts. For reliable route selection, the concept of virtual zone (stable lone and caution zone) is proposed. The lone is located in a mobile node's transmission range and determined by mobile node's mobility information received by Global Positioning System (GPS). The proposed algorithm is applied to the route discovery procedure of the existing on-demand routing protocol, AODV, and evaluated by simulation in various traffic conditions and mobility patterns.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.4A
• /
• pp.377-385
• /
• 2010

In this paper, we propose a SInk-initiated geographic Multicast (SIM) protocol to reduce frequent location updates from mobile sinks to a source and to achieve fast multicast tree construction and data delivery. The proposed protocol allows sinks to construct their own data delivery paths to a source node and a multicast tree to be atomically constructed by merging the paths. Then, the source forwards data to the destinations down the multicast tree. This paper also propose a round-based virtual infrastructure with a radial shape for increasing the merging probability of data delivery paths and reducing reconstruction ratio of the multicast tree due to mobility of sinks. Simulation results show that the proposed protocol is superior to previous SOurce-initiated geographic Multicast (SOM) protocols in term of average data delivery delay and average energy consumption.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.48 no.6
• /
• pp.51-60
• /
• 2011

Researches on indoor localization using the wireless sensor network have been actively carried out to be used for indoor area where GPS signal is not received. Computationally efficient WCL(Weighted Centroid Localization) algorithm is shown to perform relatively well. However, to get the best performance for WCL all the anchor nodes must send signal with power to cover 96% of the network. The fact that outside the transmission range of the fixed nodes drastic localization error occurs results in large mean error and deviation. Due to these problems the WCL algorithm is not easily applied for use in the real indoor environment. In this paper we propose SRS(Succesive Region Setting) algorithm which sequentially reduces the estimated location area using the signal strength from the anchor nodes. The proposed algorithm does not show significant performance degradation corresponding to transmission range of the anchor nodes. Simulation results show that the proposed SRS algorithm has mean localization error 5 times lower than that of the WCL under free space propagation environment.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.7B
• /
• pp.668-676
• /
• 2009

Hierarchical Mobile 1Pv6(HM1Pv6) have been proposed by IETF(Internet Engineering Task Force) beginning from Mobile 1Pv6 for mobility support in IP networks, however these researches relying on client based mobility support have not been drawn attention due to excessive consumption of wireless resources and long handover delay. In this paper, we propose the Router-based Binding Update(RBU) scheme to solve problems in existing client-based mobility support schemes. The router registers location information of mobile nodes through Neighbor Discovery protocol without additional codes for the RBU scheme to a terminal operated by existing HMlPv6. By using this the RBU scheme is designed so that it can support partial nupport based mobility and reduce handover latency rather than using HMIPv6. It is analysed and compared with existing HMIPv6 to verify efficiency of the RBU scheme. As a result, the RBU scheme has outperformed existing HMIPv6 by 15% in terms of macro handover delay especially when long delay on wireless links exists.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.6
• /
• pp.49-59
• /
• 2014

Recently, wireless sensor networks(WSNs) are widely used for intrusion detection and ecology, environment, atmosphere, industry, traffic, fire monitoring. In this paper, an energy efficient clustering algorithm is proposed. The proposed algorithm forms clusters uniformly by selecting cluster head that optimally located based on receiving power. Besides, proposed algorithm can induce uniform energy consumption regardless of location of nodes by multi-hop transmission and MST formation with limited maximum depth. Through the above, proposed algorithm elongates network life time, reduces energy consumption of nodes and induces fair energy consumption compared to conventional LEACH and HEED. The results of simulation show that the proposed clustering algorithm elongates network life time through fair energy consumption.

• Journal of Positioning, Navigation, and Timing
• /
• v.6 no.3
• /
• pp.105-116
• /
• 2017

Several wireless localization algorithms are evaluated for the IR-UWB-based indoor location with the assumption that the ranging measurements contain the channelwise Non-Calibration Error (NCE). The localization algorithms can be divided into the Model-free Localization (MfL) methods and Model-based Kalman Filtering (MbKF). The algorithms covered in this paper include Iterative Least Squares (ILS), Direct Solution (DS), Difference of Squared Ranging Measurements (DSRM), and ILS-Common (ILS-C) methods for the MfL methods, and Extended Kalman Filter (EKF), EKF-Each Channel (EKF-EC), EKF-C, Cubature Kalman Filter (CKF), and CKF-C for the MbKF. Experimental results show that the DSRM method has better accuracy than the other MfL methods. Also, it demands smallest computation time. On the other hand, the EKF-C and CKF-C require some more computation time than the DSRM method. The accuracy of the EKF-C and CKF-C is, however, best among the 9 methods. When comparing the EKF-C and CKF-C, the CKF-C can be easily used. Finally, it is concluded that the CKF-C can be widely used because of its ease of use as well as it accuracy.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.7
• /
• pp.62-66
• /
• 2008

In this paper we have proposed a power aware location based routing protocol for wireless ad hoc network. The existing greedy perimeter stateless routing (GPSR) has some problems which are certain node overloaded and void situation. The proposed power aware greedy perimeter stateless routing (PAGPSR) protocol gives a solution for these problems in GPSR. PAGPSR uses power aware and geographically informed neighbor selection to route a packet towards the destination. It also gives a solution for the fundamental problem in geographical routing called communication void. It considers residual energy of battery and distance to the destination for the next hope node selection. When it encounters a void it starts limited-flooding to select next hop node. To evaluate the performance of our protocol we simulated PAGPSR in ns-2. Our simulation results show that our protocol achieves longer network lifetime compared with greedy perimeter stateless routing (GPSR).