• Title/Summary/Keyword: communication networks

Search Result 5,470, Processing Time 0.032 seconds

A Design and Implementation of Physiological Data Measurement System using Ubiquitous Sensor Network (유비쿼터스 센서 네트워크를 이용한 생리학적 데이터 측정 시스템의 설계 및 구현)

  • Min, Gyeong-Woo;Seo, Jung-Hee;Park, Hung-Bog
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2010.05a
    • /
    • pp.852-855
    • /
    • 2010
  • Based on the rapid development of the computer network technology, the ubiquitous sensor network (USN) was developed to enable us to have access to the communication environment anywhere and anytime without the need for recognizing computers or networks. Moreover, with the increasingly high interest on individual health, the USN technology is being applied to diverse sectors for healthcare and disease prevention. In this paper, a system was designed and implemented using the USN-based RF communication for doctors and nurses who care patients in the hospital to easily measure and control the physiological data on blood pressure and blood sugar. In addition, a database was designed using MS SQL database to store and manage the blood pressure and blood sugar data, which were passively or actively measured from patients. Using the results of this study, the physiological data of patients can be managed in real time and emergency situation can be instantly addressed. It is expected that the healthcare service can be improved and the paradigm of healthcare service environment can be changed.

  • PDF

An Efficient Resource Allocation Algorithm for Ubiquitous Sensor Networks (유비쿼터스 센서 네트워크를 위한 효율적인 자원할당 알고리즘)

  • Hwang, Jeewon;Cho, Juphil
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.12
    • /
    • pp.2769-2774
    • /
    • 2013
  • The key of USN(Ubiquitous Sensor Network) technology is low power wireless communication technology and proper resource allocation technology for efficient routing. The distinguished resource allocation method is needed for efficient routing in sensor network. To solve this problems, we propose an algorithm that can be adopted in USN with making up for weak points of PQ and WRR in this paper. The proposed algorithm produces the control discipline by the fuzzy theory to dynamically assign the weight of WRR scheduler with checking the Queue status of each class in sensor network. From simulation results, the proposed algorithm improves the packet loss rate of the EF class traffic to 6.5% by comparison with WRR scheduling method and that of the AF4 class traffic to 45% by comparison with PQ scheduling method.

Access Delay Characteristics of Wi-Fi Network According to User Increase in Subway Section (지하철 구간에서 이용객 증가에 따른 Wi-Fi 접속 지연 특성)

  • Koh, Seoung-chon;Choi, Kyu-Hyoung
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.16 no.5
    • /
    • pp.3455-3461
    • /
    • 2015
  • LTE and Wi-Fi networks provide wireless communication services to passengers in subway where the number of network access fluctuates according to passenger movement. While the number of network access increase, LTE can provide stable communication service but Wi-Fi suffers temporal access delay to network. This paper analyzes the increase in access delay of Wi-Fi network according to increasing user in subway section by making mathematical modeling of Wi-Fi network and simulation study. The access delay characteristics of Wi-Fi network is measured along an subway line and the results are compared to the theoretical study. These results can be applied to the connection method to build an efficient network structure between LTE and Wi-Fi interworking network and the future introduction of LTE-R.

A Study on the Performance Evaluation of Elliptic Curve Cryptography based on a Real Number Field (실수체 기반 타원곡선 암호의 성능 평가에 관한 연구)

  • Woo, Chan-Il;Goo, Eun-Hee;Lee, Seung-Dae
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.14 no.3
    • /
    • pp.1439-1444
    • /
    • 2013
  • Recently, as the use of the applications like online banking and stock trading is increasing by the rapid development of the network, security of data content is becoming more and more important. Accordingly, public key or symmetric key encryption algorithm is widely used in open networks such as the internet for the protection of data. Generally, public key cryptographic systems is based on two famous number theoretic problems namely factoring or discrete logarithm problem. So, public key cryptographic systems is relatively slow compared to symmetric key cryptography systems. Among public key cryptographic systems, the advantage of ECC compared to RSA is that it offers equal security for a far smaller key. For this reason, ECC is faster than RSA. In this paper, we propose a efficient key generation method for elliptic curve cryptography system based on the real number field.

Implementation of Multimedia Services in a Mobile Ad-hoc Network (이동 Ad-hoc 네트워크에서의 멀티미디어 서비스 구현)

  • Ro Kwang-Hyun;Kwon Hye-Yeon;Shin Jae-Wook;Park Ae-Soon
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.7 no.2
    • /
    • pp.45-52
    • /
    • 2006
  • Mobile Ad-hoc Network(MANET) could be applied to various applications by virtue of its characteristics such as self-organizing and infrastructure-free network. This paper proposes a multimedia application service model for MANET, called multi-hop Relay(mRelay) system. It supports a multi-hop communication-based multimedia service interworked with Internet by using an unmanned moving robot with wireless multimedia communication function as a mRelay terminal. The modified AODV routing protocol was applied to the terminal and it was verified that composition and maintenance of mobile Ad-hoc network in mRelay system under the various indoor scenarios were successful and stable multi-hop multimedia services were possible. The mRelay system can be applicable to various application services of mobile Ad-hoc networks.

  • PDF

A New Active RED Algorithm for Congestion Control in IP Networks (IP 네트워크에서 혼잡제어를 위한 새로운 Active RED 알고리즘)

  • Koo, Ja-Hon;Chung, Kwang-Sue
    • Journal of KIISE:Information Networking
    • /
    • v.29 no.4
    • /
    • pp.437-446
    • /
    • 2002
  • In order to reduce the increasing packet loss rates caused by an exponential increase in network traffic, the IETF (Internet Engineering Task Force) is considering the deployment of active queue management techniques such as RED (Random Early Detection). While active queue management in routers and gateways can potentially reduce packet loss rates in the Internet, this paper has demonstrated the inherent weakness of current techniques and shows that they are ineffective in preventing high loss rates. The inherent problem with these queue management algorithms is that they all use static parameter setting. So, in case where these parameters do not match the requirement of the network load, the performance of these algorithms can approach that of a traditional Drop-tail. In this paper, in order to solve this problem, a new active queue management algorithm called ARED (Active RED) is proposed. ARED computes the parameter based on our heuristic method. This algorithm can effectively reduce packet loss while maintaining high link utilizations.

Functional Programs as Process Networks using Program-derived Combinators (프로그램유도 컴비네이터를 이용하는 함수프로그램의 포로세스망 구성)

  • Sin, Seung-Cheol;Yu, Won-Hui
    • The Transactions of the Korea Information Processing Society
    • /
    • v.3 no.3
    • /
    • pp.478-492
    • /
    • 1996
  • For parallel implementations of functional programs without concurrent primitives, the λ-calculus encodings have been introduced. A functional program may be trans for med into a process network using process calculiby the λ-calculus encoding and there sult of a program can be obtained by a deal of communication actions in it's process network. But the λ-calculus encodings cause too many communication actions even in constant expressions. This paper shows the encoding for a combinator program without concurrency primitives which can combine the graph reduction and the process-net reduction using computable processes,'chores'. A 'chore' may have graph reduction functions for primitive operations of constants for which local graph reduction may be possible, and be encoded from a 'G-reducible' subexpression which is obtained by an annotation and trans for mati-on for a combinator program, assuring that it does not include any combinator application. Also, we show that a process network with chores raises less commu-nication actions than one without chores.

  • PDF

Price-based Resource Allocation for Virtualized Cognitive Radio Networks

  • Li, Qun;Xu, Ding
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.10
    • /
    • pp.4748-4765
    • /
    • 2016
  • We consider a virtualized cognitive radio (CR) network, where multiple virtual network operators (VNOs) who own different virtual cognitive base stations (VCBSs) share the same physical CBS (PCBS) which is owned by an infrastructure provider (InP), sharing the spectrum with the primary user (PU). The uplink scenario is considered where the secondary users (SUs) transmit to the VCBSs. The PU is protected by constraining the interference power from the SUs. Such constraint is applied by the InP through pricing the interference. A Stackelberg game is formulated to jointly maximize the revenue of the InP and the individual utilities of the VNOs, and then the Stackelberg equilibrium is investigated. Specifically, the optimal interference price and channel allocation for the VNOs to maximize the revenue of the InP and the optimal power allocation for the SUs to maximize the individual utilities of the VNOs are derived. In addition, a low‐complexity ±‐optimal solution is also proposed for obtaining the interference price and channel allocation for the VNOs. Simulations are provided to verify the proposed strategies. It is shown that the proposed strategies are effective in resource allocation and the ±‐optimal strategy achieves practically the same performance as the optimal strategy can achieve. It is also shown that the InP will not benefit from a large interference power limit, and selecting VNOs with higher unit rate utility gain to share the resources of the InP is beneficial to both the InP and the VNOs.

Traffic Control using Q-Learning Algorithm (Q 학습을 이용한 교통 제어 시스템)

  • Zheng, Zhang;Seung, Ji-Hoon;Kim, Tae-Yeong;Chong, Kil-To
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.12 no.11
    • /
    • pp.5135-5142
    • /
    • 2011
  • A flexible mechanism is proposed in this paper to improve the dynamic response performance of a traffic flow control system in an urban area. The roads, vehicles, and traffic control systems are all modeled as intelligent systems, wherein a wireless communication network is used as the medium of communication between the vehicles and the roads. The necessary sensor networks are installed in the roads and on the roadside upon which reinforcement learning is adopted as the core algorithm for this mechanism. A traffic policy can be planned online according to the updated situations on the roads, based on all the information from the vehicles and the roads. This improves the flexibility of traffic flow and offers a much more efficient use of the roads over a traditional traffic control system. The optimum intersection signals can be learned automatically online. An intersection control system is studied as an example of the mechanism using Q-learning based algorithm, and simulation results showed that the proposed mechanism can improve the traffic efficiency and the waiting time at the signal light by more than 30% in various conditions compare to the traditional signaling system.

Resource Management System for Multimedia Service in Wireless Mobile Networks (무선 이동 통신망에서의 멀티미디어 서비스를 위한 자원 제어 시스템)

  • Lee, Won-Yeoul
    • Journal of Korea Multimedia Society
    • /
    • v.10 no.9
    • /
    • pp.1153-1164
    • /
    • 2007
  • One of the most challenging technical issues in mobile communication for multimedia is Quality of Service (QoS) management of handover calls. This paper proposes a 2-level handover control system to copy with this problem. A 2-level handover control system consists of resource reservation and call admission control modules. The resource reservation module divides the network resource into Hard and Soft reserved resource. The Hard reserved resource is only for the handover calls while the Soft reserved resource is for both the handovers and the new calls. And also, the resource reservation module classifies handovers into primary and secondary handovers based on often they occur. The call admission control module deals with the primary and secondary handover calls in different ways. The new calls can use Soft reserved resource only if there is sufficient amount available in the Hard reserved resource. Proposed system is evaluated using an M/M/c/c queueing model. It is shown that proposed system allows more efficient utilization of network resource without degrading QoS comparing with the legacy handover control systems.

  • PDF