• Title/Summary/Keyword: data delivery mechanism

Search Result 100, Processing Time 0.021 seconds

Develop of a Personalized Learning System based on Data Stream Technology (데이터 스트림 기술에 기반 한 개인화된 교육 시스템 개발)

  • Cho, Sung Ho
    • The Journal of Korean Association of Computer Education
    • /
    • v.8 no.4
    • /
    • pp.49-56
    • /
    • 2005
  • Because e-learning system does not have any dynamic contents-delivery mechanism, all students in the same class get identical contents. In this paper, we introduce a personalized learning system, which is carefully designed and implemented based on data stream technology. The proposed system have a mechanism and interface changing lecture contents based on learner's level and ability. The system consists of a dynamic contents-delivery mechanism and learner level-test system. In this paper, we describe what are points to be considered when design and implementing a personalized learning system.

  • PDF

An Evaluation of Data Delivery Mechanisms in Clustered Sensor Networks (클러스터 기반 센서 망에서 데이터 전달 방법들의 성능 분석)

  • Park Tae-Keun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.3A
    • /
    • pp.304-310
    • /
    • 2006
  • This paper evaluates the performance of three types of data delivery mechanisms in clustered sensor networks, as a basic research to develop an energy efficient topology management scheme. In the first mechanism, one node per cluster(clusterhead) turns on its radio(or wakes up) to transmit and receive RTS/CTS/DATA/ACK messages, but in the second one, k nodes per cluster wake up and participate in the message exchange. In the last mechanism, clusterheads turn on the radio to exchange RTS/CTS messages, and if a clusterhead receives RTS containing its cluster m as a destination, it makes k nodes in the cluster hun on the radio to receive DATA and transmit ACK. Through simulation, we show the energy consumption of the three types of data delivery mechanisms as functions of the number of active nodes per cluster, offered load, and packet loss probability.

Confidential Convergecast Based on Random Linear Network Coding for the Multi-hop Wireless Sensor Network

  • Davaabayar Ganchimeg;Sanghyun Ahn;Minyeong Gong
    • Journal of Information Processing Systems
    • /
    • v.20 no.2
    • /
    • pp.252-262
    • /
    • 2024
  • The multi-hop wireless sensor network (WSN) suffers from energy limitation and eavesdropping attacks. We propose a simple and energy-efficient convergecast mechanism using inter-flow random linear network coding that can provide confidentiality to the multi-hop WSN. Our scheme consists of two steps, constructing a logical tree of sensor nodes rooted at the sink node, with using the Bloom filter, and transmitting sensory data encoded by sensor nodes along the logical tree upward to the sink where the encoded data are decoded according to our proposed multi-hop network coding (MHNC) mechanism. We conducted simulations using OMNET++ CASTALIA-3.3 framework and validated that MHNC outperforms the conventional mechanism in terms of packet delivery ratio, data delivery time and energy efficiency.

Robot Control Data Management System for Automatic Parcel Sorting (물류 작업 자동화를 위한 로봇 제어 정보 관리 시스템)

  • Shin, Moon-Sun;Kim, Myung-Sic
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.14 no.6
    • /
    • pp.3023-3031
    • /
    • 2013
  • In this paper, we propose a robot control data generation system applying context aware mechanism in order to control the robot manipulator which automatically sorts parcels. The context aware mechanism generates intelligent information to control a robot using context data such as the parcel shape, weight, location and barcodes. The proposed system collects context data of the parcel and generates robot control data to pick up and drop parcels. Then a robot manipulator, which receives control data of picking-up and dropping, processes the automated sorting of parcels according to delivery persons and delivery routes. It will contribute not only to save much time and cost but also to reduce the industrial accidents.

Publish/Subscribe Protocol in Wireless Sensor Networks: Improved Reliability and Timeliness

  • Davis, Ernesto Garcia;Auge, Anna Calveras
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.4
    • /
    • pp.1527-1552
    • /
    • 2018
  • The rapidly-evolving demand of applications using wireless sensor networks in several areas such as building and industrial automation or smart cities, among other, makes it necessary to determine and provide QoS support mechanisms which can satisfy the requirements of applications. In this paper we propose a mechanism that establishes different QoS levels, based on Publish/Subscribe model for wireless networks to meet application requirements, to provide reliable delivery of packet and timeliness. The first level delivers packets in a best effort way. The second one intends to provide reliable packet delivery with a novel approach for Retransmission Timeout (RTO) calculation, which adjusts the RTO depending on the subscriber Packet Delivery Ratio (PDR). The third one provides the same reliable packet delivery as the second one, but in addition, it provides data aggregation trying to be efficient in terms of energy consumption and the use of network bandwidth. The last one provides timeliness in the packet delivery. We evaluate each QoS Level with several performance metrics such as PDR, Message Delivery Ratio, Duplicated and Retransmitted Packet Ratio and Packet Timeliness Ratio to demonstrate that our proposal provides significant improvements based on the increase of the PDR obtained.

A Network Coding-Aware Routing Mechanism for Time-Sensitive Data Delivery in Multi-Hop Wireless Networks

  • Jeong, Minho;Ahn, Sanghyun
    • Journal of Information Processing Systems
    • /
    • v.13 no.6
    • /
    • pp.1544-1553
    • /
    • 2017
  • The network coding mechanism has attracted much attention because of its advantage of enhanced network throughput which is a desirable characteristic especially in a multi-hop wireless network with limited link capacity such as the device-to-device (D2D) communication network of 5G. COPE proposes to use the XOR-based network coding in the two-hop wireless network topology. For multi-hop wireless networks, the Distributed Coding-Aware Routing (DCAR) mechanism was proposed, in which the coding conditions for two flows intersecting at an intermediate node are defined and the routing metric to improve the coding opportunity by preferring those routes with longer queues is designed. Because the routes with longer queues may increase the delay, DCAR is inefficient in delivering real-time multimedia traffic flows. In this paper, we propose a network coding-aware routing protocol for multi-hop wireless networks that enhances DCAR by considering traffic load distribution and link quality. From this, we can achieve higher network throughput and lower end-to-end delay at the same time for the proper delivery of time-sensitive data flow. The Qualnet-based simulation results show that our proposed scheme outperforms DCAR in terms of throughput and delay.

Improved Real-time Transmission Scheme using Temporal Gain in Wireless Sensor Networks (무선 센서 망에서 시간적 이득을 활용한 향상된 실시간 전송 방안)

  • Yang, Taehun;Cho, Hyunchong;Kim, Sangdae;Kim, Cheonyong;Kim, Sang-Ha
    • Journal of KIISE
    • /
    • v.44 no.10
    • /
    • pp.1062-1070
    • /
    • 2017
  • Real-time transmission studies in wireless sensor networks propose a mechanism that exploits a node that has a higher delivery speed than the desired delivery speed in order to satisfy real-time requirement. The desired delivery speed cannot guarantee real-time transmission in a congested area in which none of the nodes satisfy the requirement in one hop because the desired delivery speed is fixed until the packet reaches the sink. The feature of this mechanism means that the packet delivery speed increases more than the desired delivery speed as the packet approaches closer to the sink node. That is, the packet can reach the sink node earlier than the desired time. This paper proposes an improved real-time transmission by controlling the delivery speed using the temporal gain which occurs on the packet delivery process. Using the received data from a previous node, a sending node calculates the speed to select the next delivery node. The node then sends a packet to a node that has a higher delivery speed than the recalculated speed. Simulation results show that the proposed mechanism in terms of the real-time transmission success ratio is superior to the existing mechanisms.

The Complex Characterization Analysis of the Risk Awareness Affecting an Accident Experience of Quick Service Workers (퀵서비스 종사자의 사고 경험에 영향을 미치는 안전의식의 복합적 특성 분석)

  • Rhee, Kyung Yong;Ahn, Sang Hyun;Kim, Ki Sik
    • Journal of the Korea Safety Management & Science
    • /
    • v.15 no.4
    • /
    • pp.145-152
    • /
    • 2013
  • The purpose of this study was to investigate the effect of risk awareness on injury experience in quick delivery service workers. Risk awareness has complicate characteristics such as its level of worker and worker's decision about the level of other's risk perception. Data were collected by interview survey with structured questionnaire about injury experience, risk perception, work characteristics, and socio-demographic characteristics of quick delivery service workers by cross sectional survey design in 2012. The sample size was 120 respondent of quick delivery service workers. Statistical method for this study was hierarchical logistic regression method with 3 different models using socio-demographic characteristics and work characteristics and risk perception, etc. The difference between the level of risk perception of quick delivery service and other's was statistically significant effect on the experience of injury. Especially the higher the level of risk perception of quick delivery service workers is than other's, the lower the injury experience of quick delivery service worker is. The limitation of this study can be found in survey design. The future study for investigation of mechanism of the combined effect of risk perception of quick delivery service workers and others on injury experience.

Design and Implementation of Data Binder for Dynamic Data Delivery in Healthcare Service (헬스케어 서비스에서 동적인 데이터 전달을 위한 데이터 결합기 설계 및 구현)

  • Kang, Kyu-Chang;Lee, Jeun-Woo;Choi, Hoon
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.15 no.12
    • /
    • pp.891-898
    • /
    • 2009
  • This paper suggests producer/consumer-based Data Binder enabling applications and biomedical devices developed by mutually different vendors to transfer data dynamically. Data Binder is implemented as a bundle of OSGi platform providing component-based programming model and service-oriented operation architecture. Data Binder complements the disadvantage of OSGi WireAdmin service enabling static data delivery between a producer and a consumer of data. Data Binder normalizes an application requirement as an application descriptor and a device capability as a device descriptor so that it enables dynamic data delivery by making data producer/consumer pair in runtime. Therefore, Data Binder can be used as a connection management of a data link between a data producer and a data consumer in sensor-based application development. The object of this paper is to provide the facility of the healthcare service development by separating a data producer such as a biomedical device from a data consumer such as a healthcare application.

An Efficient Scheme to Create Data Delivery Tree for Community Group Communication (커뮤니티 그룹 통신을 위한 효율적인 데이터 전달 트리 구성 방안)

  • Oh, Je-Jun;Kang, Nam-Hi;Kim, Yong-Hyuk;Kim, Young-Han
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.44 no.10
    • /
    • pp.55-63
    • /
    • 2007
  • Multicast is an efficient transport mechanism for community communications and MANET is recently regarded as a promising solution for support ubiquitous computing as an underlying network technology. However, it is hard to deploy multicast mechanism into MANET owing to scarce resources in wireless networks and unpredictable changes in network topology. Several multicast mechanisms have been proposed in the literature to overcome the limitations. Especially, overlay multicasting schemes present several advantages over network based multicasting schemes. Yet, the overlay multicasting schemes still introduce redundant data transmissions that waste network bandwidth and battery of relay nodes. As a result the performance of the network is degraded. To reduce the redundancy, we propose an efficient way to construct an overlay structure as a multicast data delivery tree that utilizes a branch node which belongs to the tree. By using network simulation, we show that the proposed scheme presents higher packet delivery ratio and lower transmission cost than previously proposed schemes.