• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.7
• /
• pp.1203-1212
• /
• 1994

This paper proposes a variable block size vector quantization based on a biorthogonal wavelet transform for image compression. An image is first decomposed with the biorthogonal wavelet transform into multiresolution image and the wavelet coefficients of the middle frequency bands are segmented using the quadtree sturcture to extract the perceptually important regions in the middle frequency bands. A sedges of middle frequency bands exist the corresponding position of high frequency bands, the complicated quadtree structure of middle frequency bands is equally applied to the high frequency bands. Therefore the overhaed information of the quadtree codes needed to segment the high frequency bands can be reduced. The segmented subblocks are encoded with the codebook designed at the each scales and directions. The simulation results showed that the proposed methods could reproduce higher quality image with bit rate reduced about 20(%) than of the preceding VQ method and sufficiently reduce the bolck effect and the edge degradation.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.9
• /
• pp.1135-1144
• /
• 1999

본 논문에서 우리는 셀룰러 통신 시스템을 위한 위치갱신과 위치질의 비용을 줄일 수 있는 새로운 위치관리 기법을 제안한다. 위치갱신 및 위치질의 비용을 줄이기 위하여, 제안한 위치관리 기법은 사용자 지역성을 사용한다. 사용자 지역성은 이동 지역성과 호 지역성으로 이루어진다. 이동 지역성을 갖는 이동단말들을 위한 위치갱신은 지역 PVLR(Proxy-Visitor Location Register) 갱신에 의해 위치갱신 비용을 줄일 수 있다. 호 지역성을 갖는 이동단말들을 위한 위치질의는 지역 PVLR 질의에 의해 위치질의 비용을 줄일 수 있다. 분석 모델을 통하여, 제안한 기법의 성능 분석과 IS-41 표준과 제안 기법과의 성능을 비교한다. 사용된 비교 척도는 네트워크 비용, 데이타베이스 비용 그리고 호 설정 지연이다. 이들 모든 척도들에 대해서, 제안 기법이 IS-41 표준에서 정의된 위치관리 기법보다 더 좋은 성능을 보인다. 또한 비교 결과는 CMR(Call-to-Mobility Ratio)에 상관없이 제안 기법이 IS-41 기법보다 성능이 좋음을 보여준다. Abstract In this paper, we propose a new location management scheme for cellular communication systems with the goal of reducing both location update and query cost. In order to reduce both location update and query cost, the proposed scheme uses user locality. User locality consists of movement and call locality. For mobile terminals with movement locality, location update cost is reduced by local PVLR(Proxy-Visitor Location Register) update. Location query cost is reduced by local PVLR query for mobile terminals with call locality. Through analytical models, we analyze the performance of the proposed scheme and compare it with that of the IS-41 scheme. The measures of comparison used are the network cost, the database cost, and the call set up delay. For all these measures, the proposed scheme performs better than the location management scheme defined in the IS-41 standard. Result comparison also shows that the our scheme performs better than the IS-41 scheme, regardless of CMR(Call-to-Mobility Ratio).

• Journal of KIISE:Software and Applications
• /
• v.26 no.10
• /
• pp.1143-1155
• /
• 1999

셀룰러 방식의 이동통신 시스템에서 전파의 유효신호 도달범위를 예측하기 위해서는 전파전파 모델을 이용한 예측기법이 주로 사용된다. 그러나, 전파과정에서 주변 지형지물에 의해 발생하는 전파손실은 매우 복잡한 비선형적인 특성을 가지며 수식으로는 정확한 표현이 불가능하다. 본 논문에서는 신경회로망의 함수 근사화 능력을 이용하여 전파손실 예측모델을 생성하는 방법을 제안한다. 즉, 전파손실을 송수신 안테나간의 거리, 송신안테나의 특성, 장애물 투과영향, 회절특성, 도로, 수면에 의한 영향 등과 같은 전파환경 변수들의 함수로 가정하고, 신경회로망 학습을 통하여 함수를 근사화한다. 전파환경 변수들이 신경회로망 입력으로 사용되기 위해서는 3차원 지형도와 벡터지도를 이용하여 전파의 반사, 회절, 산란 등의 물리적인 특성이 고려된 특징 추출을 통해 정량적인 수치들을 계산한다. 이와 같이 얻어진 훈련데이타를 이용한 신경회로망 학습을 통해 전파손실 모델을 완성한다. 이 모델을 이용하여 서울 도심 지역의 실제 서비스 환경에 대한 타 모델과의 비교실험결과를 통해 제안하는 모델의 우수성을 보인다.Abstract In cellular mobile communication systems, wave propagation models are used in most cases to predict cell coverage. The amount of propagation loss induced by the obstacles in the propagation path, however, is a highly non-linear function, which cannot be easily represented mathematically. In this paper, we introduce the method of producing propagation loss prediction models by function approximation using neural networks. In this method, we assume the propagation loss is a function of the relevant parameters such as the distance from the base station antenna, the specification of the transmitter antenna, obstacle profile, diffraction effect, road, and water effect. The values of these parameters are produced from the field measurement data, 3D digital terrain maps, and vector maps as its inputs by a feature extraction process, which takes into account the physical characteristics of electromagnetic waves such as reflection, diffraction and scattering. The values produced are used as the input to the neural network, which are then trained to become the propagation loss prediction model. In the experimental study, we obtain a considerable amount of improvement over COST-231 model in the prediction accuracy using this model.

• Journal of KIISE:Information Networking
• /
• v.31 no.2
• /
• pp.188-195
• /
• 2004

We have analyzed the performance of TCP in the CDMA mobile communications systems with the adaptive modulation and coding(AMC). The wireless channel using AMC is characterized with not high error rate but highly varying bandwidth. Due to time-varying bandwidth, timeout events of TCP occurs more frequently, which leads to the throughput degradation. The analysis model is composed of the two parts. In the first part, we divide TCP packet stream into ‘packet groups’and derive the probability distribution of the wireless transmission time of each Packet group that reflects the time varying characteristics of AMC. In the second part, we formulate embedded Markov chain by making use of the results of the first part to model TCP timer mechanism and wireless transmission. Since our system model is characterized by the forward link high speed data transmission using AMC, the results reported in this paper can be used as a guideline for the design and operation of HSDPA, 1xEV-DO, and 1xEV-DV.

• Journal of KIISE:Information Networking
• /
• v.32 no.1
• /
• pp.34-50
• /
• 2005

Recently, various proposals for supporting network mobility, which provides efficient Internet access when a network formed within a vehicle moves around as a unit, have emerged. The schemes in those proposals, though, manifest some major drawbacks with respect to scalability: If the number of mobile nodes within a mobile network is large, the handoff latency would increase greatly, causing communication disruption; Data delivery to a node within a nested mobile network nay suffer extremely inefficient pinball routing. We propose a scalable network mobility supporting mechanism named SNEMOS (Scalable NEtwork Mobility Support), which resolves the above two major problems of the existing schemes. The performance of SNEMOS is compared with the existing schemes through extensive simulations. The numerical results show that SNEMOS outperforms the existing schemes with respect to handoff latency hop counts of routing paths, packet delivery time, header overhead in data packets, and signaling overhead.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.8
• /
• pp.1464-1474
• /
• 1994

GPS(Global Positioning System)is a satellite-based navigation system that we can survey where we are, anywhere and anytime. In this paper, delay-lock loop of the receiver which detects the navigation data is theoretically analyzed, and designed using the digital logic circuit. Also logic operations for the synchronization are analyzed. The designed system consists of the correlator which correlates the received C/A code and the generated C/A code in the receiver, the C/A code generator which generates C/A code of selected satellite, and the direct digital clock syntheizer which generates the clock of the C/A code generator to control the C/A code phase and clock rate. From the analyses results of the proposed digital delay-lock loop system, the system has the detection propertied over 90% when its input signal power is above-113.98dB. The influence of input signal variation of digital delay loop, which is the input of A/D converter, is investigated and the performance is analyzed with the variation of threshold level via the computer simulation. The logic simulation results show that the designed system detects precisely the GPS navigation data.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.3
• /
• pp.321-325
• /
• 2008

Void areas(holes) as an inevitable phenomenon exist in geographic routing of wireless sensor networks, because the unpredictable and harsh nature application environment or uneven energy consumption. Most of the existing schemes for the issue tend to construct a static detour path to bypass a hole. The static detour path may lead to uneven energy consumption of the nodes on the perimeter of the hole; thus it may enlarge the hole. At the same time, traffic would concentrate on the peripheral node of the hole; thus the nodes on the perimeter of the hole tend to be depleted quietly. In previous work, we have proposed a hole geometric model to reduce the energy consumption and packet collisions of the nodes on the hole boundary. This scheme, however, still has the static detour path problem. Therefore, we extend the previous work by constructing a dynamic detour path hole geometric model for wireless sensor networks in this paper. The location of hole detour anchors is dynamically shifted according to Gaussian function, just generating dynamic hole detour paths.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.4
• /
• pp.389-400
• /
• 2008

As the wireless network technologies and the capability of the mobile terminals are evolving, advanced peer to peer applications for mobile users are attracting interests. In this paper, we propose the mobile P2P communication platform(MPCP) which provides transparency to the wireless network technologies and solutions to the limited resources of the mobile terminals. MPCP classifies the connection into two levels: a virtual channel and a session. A virtual channel is the network layer connection between the terminals whereas a session is the application layer connection. MPCP classifies the sessions into four types and applies different scheduling priority and data processing policies such as segmentation and reassembly. It selects proper wireless network technologies depending on the distance between the communication endpoints. To acquire dynamically changed access address, we harness the Session Initiation Protocol. We implemented MPCP on embedded Linux simulator and utilized the implementation in mobile P2P service development. For the quantitative analysis, we compared the performance of MPCP with that of ftp. Regardless of the number of simultaneous sessions, MPCP maintains the relative performance.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.10B
• /
• pp.831-840
• /
• 2004

Providing quality of service (QoS) guarantees over wireless link requires thorough understanding and quantification of the interactions among the traffic source, the wireless channel, and the underlying error control mechanisms. In this paper, we account for such interactions in a network-layer model that we use to investigate the delay performance of a wireless channel. We consider a single ON/OFF traffic stream transported over a wireless link. The capacity of this link fluctuates according to a fluid version of Gilbert-Elliot's model. We derive the packet delay distribution via two different approaches: uniformization and Laplace transform. Numerical aspects of both approaches are compared. The delay distribution is further used to quantify the wireless effective bandwidth under a given delay guarantee. Numerical results and simulations are used to verify the adequacy of our analysis and to study the impact of error control and bandwidth allocation on the packet delay performance. Wireless networks, QoS, delay distribution, fluid analysis.

• Journal of KIISE:Information Networking
• /
• v.32 no.6
• /
• pp.687-695
• /
• 2005

With increasing demand of using mobile Internet, HMIPv6 is proposed by IETF to reduce location management traffics due to micro mobility and to provide IP-based movement. A paging mechanism combined with HMIPv6 can reduce the signaling traffics of a mobile node. We propose a dynamic paging mechanism in HMIPv6 which decides an optimal paging area for each mobile node by considering its characteristics. Total costs of a static paging mechanism and a dynamic paging mechanism are analyzed by mathematical formulas. As a result, we proved that the dynamic paging mechanism reduced total signal traffic costs more than a static paging mechanism.