• Title/Summary/Keyword: relay network

Search Result 702, Processing Time 0.023 seconds

Design of Dynamic Buffer Assignment and Message model for Large-scale Process Monitoring of Personalized Health Data (개인화된 건강 데이터의 대량 처리 모니터링을 위한 메시지 모델 및 동적 버퍼 할당 설계)

  • Jeon, Young-Jun;Hwang, Hee-Joung
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.15 no.6
    • /
    • pp.187-193
    • /
    • 2015
  • The ICT healing platform sets a couple of goals including preventing chronic diseases and sending out early disease warnings based on personal information such as bio-signals and life habits. The 2-step open system(TOS) had a relay designed between the healing platform and the storage of personal health data. It also took into account a publish/subscribe(pub/sub) service based on large-scale connections to transmit(monitor) the data processing process in real time. In the early design of TOS pub/sub, however, the same buffers were allocated regardless of connection idling and type of message in order to encode connection messages into a deflate algorithm. Proposed in this study, the dynamic buffer allocation was performed as follows: the message transmission type of each connection was first put to queuing; each queue was extracted for its feature, computed, and converted into vector through tf-idf, then being entered into a k-means cluster and forming a cluster; connections categorized under a certain cluster would re-allocate the resources according to the resource table of the cluster; the centroid of each cluster would select a queuing pattern to represent the cluster in advance and present it as a resource reference table(encoding efficiency by the buffer sizes); and the proposed design would perform trade-off between the calculation resources and the network bandwidth for cluster and feature calculations to efficiently allocate the encoding buffer resources of TOS to the network connections, thus contributing to the increased tps(number of real-time data processing and monitoring connections per unit hour) of TOS.

A Study on Establishment of the Optimum Mountain Meteorological Observation Network System for Forest Fire Prevention (산불 방지를 위한 산악기상관측시스템 구축방안)

  • Lee, Si-Young;Chung, Il-Ung;Kim, Sang-Kook
    • Korean Journal of Agricultural and Forest Meteorology
    • /
    • v.8 no.1
    • /
    • pp.36-44
    • /
    • 2006
  • In this study, we constructed a forest fire danger map in the Yeongdong area of Gangwon-do and Northeastern area of Gyeongsangbuk-do using a forest fire rating model and geographical information system (GIS). We investigated the appropriate positions of the automatic weather station (AWS) and a comprehensive network solution (a system including measurement, communication and data processing) for the establishment of an optimum mountain meteorological observation network system (MMONS). Also, we suggested a possible plan for combining the MMONS with unmanned monitoring camera systems and wireless relay towers operated by local governments and the Korea Forest Service for prevention of forest fire.

A MAC Protocol for Efficient Burst Data Transmission in Multihop Wireless Sensor Networks (멀티홉 무선 센서 네트워크에서 버스트 데이타의 효율적인 전송을 위한 프로토콜에 관한 연구)

  • Roh, Tae-Ho;Chung, Kwang-Sue
    • Journal of KIISE:Information Networking
    • /
    • v.35 no.3
    • /
    • pp.192-206
    • /
    • 2008
  • Multihop is the main communication style for wireless sensor networks composed of tiny sensor nodes. Until now, most applications have treated the periodic small sized sensing data. Recently, the burst traffic with the transient and continuous nature is increasingly introduced due to the advent of wireless multimedia sensor networks. Therefore, the efficient communication protocol to support this trend is required. In this paper, we propose a novel PIGAB(Packet Interval Gap based on Adaptive Backoff) protocol to efficiently transmit the burst data in multihop wireless sensor networks. The contention-based PIGAB protocol consists of the PIG(Packet Interval Gap) control algorithm in the source node and the MF(MAC-level Forwarding) algorithm in the relay node. The PIGAB is on basis of the newly proposed AB(Adaptive Backoff), CAB(Collision Avoidance Backoff), and UB(Uniform Backoff). These innovative algorithms and schemes can achieve the performance of network by adjusting the gap of every packet interval, recognizing the packet transmission of the hidden node. Through the simulations and experiments, we identify that the proposed PIGAB protocol considerably has the stable throughput and low latency in transmitting the burst data in multihop wireless sensor networks.

A Field test of an Integrated Electronic Block System for verification of the suitability (통합형 전자폐색제어장치의 적합성 확인을 위한 현장시험)

  • Kim, Young-June;Baek, Jong-Hyen
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.14 no.12
    • /
    • pp.6427-6433
    • /
    • 2013
  • For trains to run safely and quickly, the train should always follow the preceding train at a proper spacing. For this purpose, a certain distance between the stations is set for each block section. For the safe operation of trains in one block section, only one train service for an automatic block system is needed. The existing block system is composed an ABS, which is a linked track circuit and line sideway system through the interlocking system. The interlocking system is being replaced with a domestic electronic interlocking system. On the other hand, the block system still uses the relay format of an analog system, and is independently installed of the line sideway systems. Therefore, the existing block system has many problems in terms of construction and maintenance. In addition, the existing domestic line is used for ABS and LEU , which is installed separately, despite the train being controlled by the information of the same signal at the same location. This is not efficient in terms of each product price and the maintenance costs. This paper introduces an integrated electronic block system and the field test results. The field test was carried out through a periodic inspection performed eight times from January to late August.

An Enhanced Greedy Message Forwarding Protocol for High Mobile Inter-vehicular Communications (고속으로 이동하는 차량간 통신에서 향상된 탐욕 메시지 포워딩 프로토콜)

  • Jang, Hyun-Hee;Yu, Suk-Dae;Park, Jae-Bok;Cho, Gi-Hwan
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.46 no.3
    • /
    • pp.48-58
    • /
    • 2009
  • Geo-graphical routing protocols as GPSR are known to be very suitable and useful for vehicular ad-hoc networks. However, a corresponding node can include some stale neighbor nodes being out of a transmission range, and the stale nodes are pone to get a high priority to be a next relay node in the greedy mode. In addition, some useful redundant information can be eliminated during planarization in the recovery mode. This paper deals with a new recovery mode, the Greedy Border Superiority Routing(GBSR), along with an Adaptive Neighbor list Management(ANM) scheme. Each node can easily treat stale nodes on its neighbor list by means of comparing previous and current Position of a neighbor. When a node meets the local maximum, it makes use of a border superior graph to recover from it. This approach improve the packet delivery ratio while it decreases the time to recover from the local maximum. We evaluate the performance of the proposed methods using a network simulator. The results shown that the proposed protocol reveals much better performance than GPSR protocol. Please Put the of paper here.

The Analysis of Competition Structure in Business Data Service Market Using Henry Model and Suggestion for Competitive Strategies (Hendry Model을 활용한 기업용데이터서비스시장의 경쟁구조 분석 및 전략 제언)

  • 유광숙;최문기
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.26 no.12C
    • /
    • pp.280-291
    • /
    • 2001
  • LL (Leased Line service) is a facility-based service as a traditional business data service, but new competition services, such as FR (Frame Relay), VPN (Virtual Private Network), and ATM (Asynchronous Transfer Mode), are value-added services. Because of different service classifications, it is hard to gather necessary data for the service providers to plan their market strategies and regulations and policies are also applied asymmetrically to each service provider. Therefore an appropriate market classification is required for the business data services. After various methods of market classification are reviewed, the Hendry model is selected in this paper to analyze substitution-degree among brands or among services. Since the structure of virtual competitions is required for the Hendry model to be applied to data service market, the market is analyzed first by the well-known Porter's model. By the analysis of Porter's model, two virtual competition structures are set up - one is for the competitions among leased line service providers, and the other is for the competitions among business data services such as LL, FR, VPN and ATM. After the Hendry model is applied to each competition structure, it is confirmed that 7 LL service providers do not compete directly, but 2 sub-markets exist for the LL service provisions. However, it is shown that 4 business data services compete directly. Using the Switching Probability Matrix from Hendry model, future market shares of LL service providers and market shares of business data services are forecasted. These empirical results are helpful for service providers to set competitive strategies with the minimization of cannibalization effect and they can easily and efficiently predict their market demands.

  • PDF

Design of a Service Broker for Large Scale Connections to Support Pubsub QoS between TOS and Mobile Devices (TOS와 Mobile device 간의 펍섭 QoS를 지원하는 대량 커넥션 서비스 브로커 설계)

  • Jeon, Young-Jun;Hwang, Hee-Joung
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.16 no.5
    • /
    • pp.137-142
    • /
    • 2016
  • A two-step open system(TOS) was proposed to relay between a healing platform and a repository of personal health documents. TOS was designed by taking into consideration the pubsub service based on large scale connections to monitor a provider's access/request process for health documents in real time. TOS, however, uses WebSocket as a communication protocol in case of pubsub. Given the operational environment of low quality wireless networks for mobile devices that are user terminals in a healing platform, there is a need to add a messaging protocol to support QoS as well as a transmission protocol. As a light messaging protocol optimized for mobile devices, MQTT defines reliable messaging QoS to consider a wireless network situation of low speed/low quality. This study designed an MQTT protocol-based message broker to support QoS in case of large scale connections and pubsub by taking into consideration mobile devices that are user terminals in a healing platform. After designing a model between TOS and MQTT message broker, the study implemented a prototype based on the proposed design and compared it with its counterparts from previous studies based on the performance indicators in a load-test with the MQTT client tool.

Energy Efficient Clustering Algorithm for Surveillance and Reconnaissance Applications in Wireless Sensor Networks (무선 센서 네트워크에서 에너지 효율적인 감시·정찰 응용의 클러스터링 알고리즘 연구)

  • Kong, Joon-Ik;Lee, Jae-Ho;Kang, Jiheon;Eom, Doo-Seop
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37C no.11
    • /
    • pp.1170-1181
    • /
    • 2012
  • Wireless Sensor Networks(WSNs) are used in diverse applications. In general, sensor nodes that are easily deployed on specific areas have many resource constrains such as battery power, memory sizes, MCUs, RFs and so on. Hence, first of all, the efficient energy consumption is strongly required in WSNs. In terms of event states, event-driven deliverly model (i.e. surveillance and reconnaissance applications) has several characteristics. On the basis of such a model, clustering algorithms can be mostly used to manage sensor nodes' energy efficiently owing to the advantages of data aggregations. Since a specific node collects packets from its child nodes in a network topology and aggregates them into one packet to relay them once, amount of transmitted packets to a sink node can be reduced. However, most clustering algorithms have been designed without considering can be reduced. However, most clustering algorithms have been designed without considering characteristics of event-driven deliverly model, which results in some problems. In this paper, we propose enhanced clustering algorithms regarding with both targets' movement and energy efficiency in order for applications of surveillance and reconnaissance. These algorithms form some clusters to contend locally between nodes, which have already detected certain targets, by using a method which called CHEW (Cluster Head Election Window). Therefore, our proposed algorithms enable to reduce not only the cost of cluster maintenance, but also energy consumption. In conclusion, we analyze traces of the clusters' movements according to targets' locations, evaluate the traces' results and we compare our algorithms with others through simulations. Finally, we verify our algorithms use power energy efficiently.

A Study on Traffic analysis for System Optimization of CDMA base station and repeaters (CDMA 기지국과 중계기의 시스템 최적화를 위한 Traffic 분석 기법)

  • Jo, Ung;Chin, Yong-Ohk
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.4C
    • /
    • pp.333-341
    • /
    • 2002
  • This article is written to make a foundation for effective radio network engineering by enabling the accurate traffic assumption between Base Station (BTS : Base Station Transceiver Subsystem) md Repeater through the scientific and systematic analysis of mobile traffic dealt within CDMA Base Station. Among these, Repeater, having direct physical connection with BTS, simply does the remote relay function but the volume of the traffic flowed into the repeater is not accountable. The total BTS traffic is the sum of traffic dealt by the BTS and multiple Repeaters. In this article, we tried traffic analysis of this kind by adopting RTD (Round Trip Delay) which is specially designed to measure distribution of the distance between the Base Station and the Mobile station by differentiating the traffic dealt by BTS from traffic dealt by Repeaters. The fact that the connection between mobile station and BTS via Repeater (which is located remotely) yields far more delay than the direct connection between mobile station and BTS is the clue of this article. Based on this fact, Time Delay equipment was put at the receiving side of the Repeater to add certain amount of delay to the traffic to BTS and the result showed that the 99.78% of the traffic can be identified.

Continuous Moving Object Tracking Using Query Relaying in Tree-Based Sensor Network (트리 기반의 센서 네트워크에서 질의 중계를 통한 이동 객체의 연속적인 위치 획득 방안)

  • Kim, Sangdae;Kim, Cheonyong;Cho, Hyunchong;Yim, Yongbin;Kim, Sang-Ha
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39B no.5
    • /
    • pp.271-280
    • /
    • 2014
  • In wireless sensor networks, there have been two methods for sensing continuously moving object tracking: user-query based method and periodic report based method. Although the former method requires overhead for user query rather than the latter method, the former one is known as an energy-efficient method without transferring unnecessary information. In the former method, a virtual tree, consisting of sensor nodes, is exploited for the user querying and sensor reporting. The tree stores the information about mobile objects; the stored information is triggered to report by the user query. However, in case of fast moving object, the tracking accuracy reduces due to the time delay of end-to-end repeated query. To solve the problem, we propose a query relaying method reducing the time delay for mobile object tracking. In the proposed method, the nodes in the tree relay the query to the adjacent node according to the movement of mobile object tracking. Relaying the query message reduces the end-to-end querying time delay. Simulation results show that our method is superior to the existing ones in terms of tracking accuracy.