• Title/Summary/Keyword: 호네트

Search Result 853, Processing Time 0.034 seconds

A Mobility Prediction Scheme using a User's Mobility Pattern in Wireless Networks (무선 네트워크에서 사용자 이동 패턴을 사용한 이동성 예측 기법)

  • Kwon, Se-Dong;Park, Hyun-Min
    • The KIPS Transactions:PartC
    • /
    • v.11C no.2
    • /
    • pp.193-202
    • /
    • 2004
  • Handoff if the most Important feature for the user's mobility in a cellular communication system, which is related to resource reservation at nearby cells. For efficient resource reservation, mobility prediction has been reported as an effective means to decrease call dropping probability and to shorten handoff latency in wireless cellular environments. Several early proposed handoff schemes making use of tile user's movement history on a cell-by-cell basis work on the assumption that the user's movements are restricted to the indoor locations such as an office or a building. However, those algorithms cannot be applied to a micro-cell structure or a metropolis with complicated structure of roads. In this paper, to overcome those drawbacks we propose a new mobility prediction algorithm, which stores and uses the history of the user's positions within the current cell to predict the next cell.

A Key Management Scheme for Radio Frequency Communication Environment (저속 무전 통신 환경에 적용 가능한 키 관리 방식)

  • Kim, Song-Yi;Lee, Kwang-Woo;Jeong, Han-Jae;Cho, Young-Jun;Cha, Wook-Jae;Kim, Seung-Joo;Won, Dong-Ho
    • The KIPS Transactions:PartC
    • /
    • v.16C no.4
    • /
    • pp.439-448
    • /
    • 2009
  • The development of wireless communications provides mobility and accessibility to the wire communication users. Wireless sensor network is one of the leading wireless communication techniques. The security mechanism for wired network communication cannot be applied to wireless sensor network because of the limited resource and computing capability of nodes. Furthermore, communication errors frequently occur and the speed is low. Thus, efficient key management scheme is required in low-speed environment. In this paper, we proposed an efficient and secured master key-based scheme compared to the existing scheme. The advantage of our scheme is that establishing and renewing the pair-wise key is possible. In addition, it provides functions such as establishing group keys and renewing it. Furthermore, adding nodes is enabled through our scheme. The master key-based scheme can be applied to military operations and to radio communications for confidential communications.

Location Area Design of a Cellular Network with Time-dependent Mobile flow and Call Arrival Rate (시간에 따른 인구유동/호 발생의 변화를 고려한 이동통신 네트워크의 위치영역 설계)

  • Hong Jung-Sik;Jang Jae-Song;Kim Ji-Pyo;Lie Chang-Hoon;Lee Jin-Seung
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.30 no.3
    • /
    • pp.119-135
    • /
    • 2005
  • Design of location erea(LA) in a cellular network is to partition the network into clusters of cells so as to minimize the cost of location updating and paging. Most research works dealing with the LA design problem assume that the call. arrival rate and mobile flow rate are fixed parameters which can be estimated independently. In this aspect, most Problems addressed so far are deterministic LA design problems(DLADP), known to be NP hard. The mobile flow and call arrival rate are, however, varying with time and should be treated simultaneously because the call arrival rate in a cell during a day is influenced by the change of a population size of the cell. This Paper Presents a new model on IA design problems considering the time-dependent call arrival and mobile flow rate. The new model becomes a stochastic LA design problem(SLADP) because It takes into account the possibility of paging waiting and blocking caused by the changing call arrival rate and finite paging capacity. Un order to obtain the optimal solution of the LA design problem, the SIADP is transformed Into the DLADP by introducing the utilization factor of paging channels and the problem is solved iteratively until the required paging quality is satisfied. Finally, an illustrative example reflecting the metropolitan area, Seoul, is provided and the optimal partitions of a cell structure are presented.

Innovation Capacities of Jinju's Silk Industry Cluster and the Evaluation of the Government Policy (진주 실크산업 집적지의 혁신 역량과 활성화 정책 평가)

  • Kim, Eun-Ju;Lee, Jong-Ho
    • Journal of the Korean association of regional geographers
    • /
    • v.18 no.4
    • /
    • pp.388-399
    • /
    • 2012
  • Jinju City has been often called as the largest agglomeration of the silk industry in Korea. However Jinju's silk industry has experienced a continuous decline in employment and to production outputs after the late 1980s. This paper aims to explore innovation capacities of Jinju's silk industry and evaluate the government policy to promote the competitiveness of the silk industry in Jinju. The main findings are as follows. First, the survey shows that the major sources of innovation tend to come from customer firms in the Capital area and the innovation supporting agency and universities in Jinju City. Second, local silk production firms tend to by and large evaluate that the industrial policy projects to promote the competitiveness of Jinju's silk industry have been successful, particularly in terms of a joint branding project and the marketing support program.

  • PDF

Service Quality Factors Affecting Satisfaction and Repurchase Intention of Social Commerce (소셜커머스의 만족도와 재구매의도에 영향을 미치는 서비스품질요인)

  • Jin, Guo-Shan;Lee, Jong-Ho
    • The Journal of the Korea Contents Association
    • /
    • v.12 no.3
    • /
    • pp.311-321
    • /
    • 2012
  • This study derived from 5 variables(information, product diversity, communication possibility, responsiveness, price) of service quality on social commerce from literature studies and set up the research model and hypotheses. The 167 questionnaires are used in this analysis. The results were as follows: first, all the variables had positive influences upon satisfaction except responsiveness. Second, all the variables had positive influences upon repurchase intention except price. Third, the satisfaction of social commerce had a positive influence upon repurchase intention. This study suggested the strategic implications to induce customers satisfaction and repurchase intention after analyzing critical factors about service quality of social commerce.

Implementation of Movement Detection System for Patient on Bed (병상환자의 움직임 감지 시스템 구현)

  • Baec, Sung-Ho;Jeon, Min-Sik;Ko, Bong-Jin
    • Journal of Advanced Navigation Technology
    • /
    • v.19 no.5
    • /
    • pp.458-463
    • /
    • 2015
  • This paper suggests detection system for the movement of patient on bed based on IEEE802.15.4 by using pressure pad and guard sensor. The system is designed to detect ordinary activities of patients on bed as well as patients' falling from the bed while sleeping at night. The node that is installed at bed sends data to gather when the pressure pad and sensor of guard detect patients' activities and falling. These data sent to gather are transmitted to monitor at help desk by TCP/IP communication. To remove unnecessary data that occurred due to switch chattering during tossing and turning, timer of MCU is used. Also, Communication module can change transmission power to apply this system to various environments of hospital room. Therefore, the nurse can take care of patients on bed in real time with data about patients' conditions.

Two-Tree Collective Communication in Grid Computing Systems (그리드 컴퓨팅 시스템에서의 두 개의 트리를 이용한 집합 통신)

  • 차광호;이정희;한동수;유찬수
    • Journal of KIISE:Information Networking
    • /
    • v.31 no.5
    • /
    • pp.450-459
    • /
    • 2004
  • This paper studies the collective communication in the grid computing environment, which is characterized by the combination of heterogeneous networks as well as uneven, long communication delay. Efficient collective communication requires communication schedule, which in turn requires network information. When the network information is not accurate or network faults occur, the performance of collective communication can be markedly degraded. This paper proposes TTCC(Two-Tree Collective Communication) for scheduling collective communication in the grid. It Provides an efficient and reliable schedule even In this unfavorable network condition by maintaining two disjoint communication trees. Benefits of the proposed method are manifested via simulation, where the performance degradation with TTCC is much slower than those using conventional scheduling algorithms.

Decision Rule using Confidence Based Anti-phone Model and Interrupt-Polling Method for Distributed Speech Recognition DSP Networking System (분산형 음성인식 DSP 네트워킹 시스템을 위한 반음소 모델기반의 신뢰도를 사용한 결정규칙과 인터럽트-폴링)

  • Song, Ki-Chang;Kang, Chul-Ho
    • Journal of Korea Multimedia Society
    • /
    • v.13 no.7
    • /
    • pp.1016-1022
    • /
    • 2010
  • Far-talking recognition and distributed speech recognition networking techniques are essential to control various and complex home services conveniently with voices. It is possible to control devices everywhere at home by using only voices. In this paper, we have developed the server-client DSP module for distributed speech recognition network system and proposed a new decision rule to decide intelligently whether to accept the recognition results or not by the transferred confidence rate. Simulation results show that the proposed decision rule delivers better performances than the conventional decision by majority rule or decision by first-arrival. Also, we have proposed the new interrupt-polling technique to remedy the defect of existing delay technique which always has to wait several clients' results for a few seconds. The proposed technique queries all client's status after first-arrival and decides whether to wait or not. It can remove unnecessary delay-time without any performance degradation.

Analysis of contact-center lines and PBX based on MCS (MCS 기반의 컨택센터 회선·PBX 용량 분석)

  • Hwang, eui-chul
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2009.05a
    • /
    • pp.652-658
    • /
    • 2009
  • As the rate of personnel expenses of contact center operating costs is the highest, we can reduce operating costs, if we answer a automatic phone call wholly or partially. The MCS(Managed Contact Services) play an important role in cost reduction and work efficiency related with voice self-services. The excellent functions of the MCS are able to implement self-service applications in network connected with effective network routing of the enterprise. The MCS makes a proper consultant rapidly response and process customer calls, improve customer processing services, and consequently increase customer satisfaction. The increase of customer satisfaction lead to improve profits and reduce the cost of building contact center infrastructure. In this paper, we analyze the contact center line capacity and PBX capacity based on the MCS. We can reduce communication costs and personnel expenses by reducing the call shifting need between consultants and rapidly solving customer questions with the MCS.

  • PDF

A Peer-to-Peer Key Establishment Scheme without Pre-distributing Keys in Ad-Hoc Networks (Ad-Hoc 네트워크에서 선행 키 분배 없는 단 대 단 키 설정 방안)

  • 왕기철;방상원;정병호;조기환
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.7C
    • /
    • pp.1015-1023
    • /
    • 2004
  • In order to protect an exchanged data, it is indispensable to establish a peer-to-peer key between the two communicating nodes. Pre-distributing keys among the nodes is unrealistic in Ad-Hoc network environment because of the dynamic nature of its network topology and the equal authority of its nodes. This paper presents a peer-to-peer key establishment scheme without pre-distributing keys in Ad-Hoc networks. The proposed scheme is based on the Diffie-Hellman key exchange protocol. Main idea is to prevent the falsification of Diffe-Hellman values using some elements of a hash chain. As a result, it is as safe as the underlying hash function against a man-in-the-middle attack. Simulation results have shown that the proposed scheme dramatically reduces the number of messages, and has relatively higher scalability, as compared with the key pre-distribution based scheme.