• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.12
• /
• pp.2811-2817
• /
• 2010

In this paper we propose the QAC-MAC that supports Quality of Service(QoS) and saves energy resources of the sensor node, and hence prolonging the lifetime of the sensor network with multiple sink nodes. Generally, the nodes nearest to the sink node often experience heavy congestion since all data is forwarded toward the sink through those nodes. So this critically effects on the delay-constraint data traffics. QAC-MAC uses a hybrid mechanism that adapts scheduled scheme for medium access and scheduling and unscheduled scheme based on TDMA for no data collision transmission. Generally speaking, characteristics of the real-time traffic with higher priority tends to be bursty and has same destination. QAC-MAC adapts cross-layer concept to rearrange the data transmission order in each sensor node's queue, saves energy consumption by allowing few nodes in data transmission, and prolongs the network lifetime.

• ETRI Journal
• /
• v.29 no.3
• /
• pp.329-335
• /
• 2007

This paper considers a timeslot assignment problem in an interactive satellite multimedia (ISM) system with digital video broadcast-return channel via satellite (DVB-RCS). The timeslot assignment problem is formulated as a binary integer programming to maximize the overall weighted throughput and is shown to be NP-hard. Thus, three real-time heuristic algorithms including ratio-based, packet-size (PS)-based, and transmission gain (TG)-based are derived, and some computational experiments are made. Considering the results, the ratio-based heuristic algorithm is demonstrated to be the most effective and efficient. We propose adapting the ratio-based heuristic algorithm to the timeslot assignment problem to greatly improve the ISM system utilization.

• ETRI Journal
• /
• v.42 no.1
• /
• pp.36-45
• /
• 2020

A priority-based data communication approach, developed by employing cognitive radio capacity for sensor nodes in a wireless terrestrial sensor network (TSN), has been proposed. Data sensed by a sensor node-an unlicensed user-were prioritized, taking sensed data importance into account. For data of equal priority, a first come first serve algorithm was used. Non-preemptive priority scheduling was adopted, in order not to interrupt any ongoing transmissions. Licensed users used a nonpersistent, slotted, carrier sense multiple access (CSMA) technique, while unlicensed sensor nodes used a nonpersistent CSMA technique for lossless data transmission, in an energy-restricted, TSN environment. Depending on the analytical model, the proposed wireless TSN environment was simulated using Riverbed software, and to analyze sensor network performance, delay, energy, and throughput parameters were examined. Evaluating the proposed approach showed that the average delay for sensed, high priority data was significantly reduced, indicating that maximum throughput had been achieved using wireless sensor nodes with cognitive radio capacity.

• Journal of Institute of Control, Robotics and Systems
• /
• v.7 no.10
• /
• pp.882-890
• /
• 2001

The data link layer of Foundation Fieldbus is operated on the basis of scheduling and token-passing disciplines. This paper presents a network design method of Foundation Fieldbus using a bandwidth allocation scheme. Fieldbus traffic consists of periodic data and sporadically generated time-critical and time-available data. The bandwidth allocation scheme schedules the transmission of periodic data. Time-critical and time-available data are transmitted via a token-passing service. The validity of this bandwidth allocation scheme is determined using an experimental model of a network system. The results obtained from the experimental model show that the proposed scheme restricts the delay of both periodic and time-critical data to a pre-specified bound. The proposed bandwidth allocation scheme also fully utilizes the bandwidth resource of the network system.

• 제어로봇시스템학회:학술대회논문집
• /
• 1997.10a
• /
• pp.680-683
• /
• 1997

Fieldbus system should be designed by considering the number of sensors/actors(actuators+ controllers) and their sampling times. But the number of sensors/actors and which are connected to the network bus can be varied by addition and/or fault of the field devices. That variation decreases the efficiency of system which is off-line designed optimally. This paper proposes an algorithm that ensures transmission of cyclic data even though there is the number change in the field devices. We assign the different weight values to cyclic data and acyclic data. By simulation and experiment, the cyclic and acyclic data are processed via the proposed network, and the results are compared with those of the Profibus system. It is shown that the proposed algorithm is more robust with the uncertainties of the field devices of the control system.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.50 no.5
• /
• pp.218-225
• /
• 2001

This paper analyses the performance of network system using the CAN(Controller Area Network) protocol. Given messages are assumed to be scheduled by the DMS(Deadline Monotonic Scheduling) algorithm. The mathematical models for time-delay that can be occurred between CAN nodes are defined. The effectiveness of modeling is shown by comparing the difference of time-delay between simulations and practical experiments. We analyse the results according to the variation of factors, such as the number of nodes, the transmission speed, the message size and the number of aperiodic messages through simulation and confirm the real-time performance of lower priority messages. We also investigate the real-time performance of periodic messages when aperiodic message generates.

• 한국정보통신설비학회:학술대회논문집
• /
• 2007.08a
• /
• pp.256-259
• /
• 2007

Multicast and Broadcast Service (MBS) provides flexible and efficient transmission of the same information to multiple users using shared radio resources on WiBro network. The advantage of this service is to achieve the most efficient use of radio and network resources as well as to lessen sender's processing load when sending the same information to multiple users. Though radio resources are saved since a multicast or broadcast transport connection is associated with a service flow, it is hard to change MBS service channel dynamically. In this paper, we propose a Radio Resource Management System (RRMS) for supporting dynamic scheduling of MBS service channels. Results show that our proposed scheme using Radio Resource Allocation Table (RRAT) can efficiently support MBS services by providing dynamic schedule for MBS service channels.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.10 no.4
• /
• pp.35-40
• /
• 2010

Recently, The medical services make use mobile healthcare system to transmit patient information on wireless environment. But It is difficult to satisfied for specified patient to send message, and it's not sufficient healthcare system to help regular treatment for example a diabetic or a pregnant woman. Thus, this paper proposes an healthcare scheduling application which manages a pregnant woman pregnant-checking, fetal movement sensing, antenatal training and promotion of health information using networking, data transmission method and application framwork of WPAN concepts.

• Proceedings of the KIEE Conference
• /
• 2004.07d
• /
• pp.2400-2402
• /
• 2004

The Controller Area Network (CAN) is being widely used in real-time control applications such as automobiles, aircraft, and automated factories. Unfortunately, CAN, in its current form, is not able to either share out the system bandwidth among the different devices fairly or to grant an upper bound on the transmission times experienced by the nodes connected to the communication medium as it happens, for instance, in the token-based networks. In this paper, we present the message scheduling for CAN, based on the distributed control scheme to integrate actuators and sensors in a humanoid robot. Besides introducing the new algorithm, this paper also presents some performance figures obtained using a specially developed software simulator, while the behavior of the new algorithm is compared with the traditional CAN systems, in order to see how effective they are.

• ETRI Journal
• /
• v.22 no.3
• /
• pp.1-9
• /
• 2000

Self-Clocked Fair Queueing (SCFQ) algorithm has been considered as an attractive packet scheduling algorithm because of its implementation simplicity, but it has unbounded delay property in some input traffic conditions. In this paper, we propose a Rate Proportional SCFQ (RP-SCFQ) algorithm which is a rate proportional version of SCFQ. If any fair queueing algorithm can be categorized into the rate proportional class and input is constrained by a leaky bucket, its delay is bounded and the same as that of Weighted Fair Queueing (WFQ) which is known as an optimal fair queueing algorithm. RP-SCFQ calculates the timestamps of packets arriving during the transmission of a packet using the current value of system potential updated at every packet departing instant and uses a starting potential when it updates the system potential. By doing so, RP-SCFQ can have the rate proportional property. RP-SCFQ is appropriate for high-speed packet-switched networks since its implementation complexity is low while it guarantees the bounded delay even in the worst-case input traffic conditions.