• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.9
• /
• pp.4429-4445
• /
• 2019

As low-power and low-rate WSNs are being widely used for industrial applications, the scheduling of such applications becomes a critical issue to guarantee meeting the stringent requirements of determinism and tight latencies. This paper studies the link scheduling problem for real-time industrial applications in time-slotted channel hopping (TSCH) networks. We propose a heuristic algorithm for centralized link scheduling referred to as path-collision aware least laxity first (PC-LLF) algorithm, which dynamically prioritizes the packets based on the laxity time to the end-to-end deadlines and the amount of collisions that messages might deal with along their designated paths to the destination device. We propose schedulability analysis of real-time applications scheduled under our prioritization approach over TSCH networks, based on the literature on real-time schedulability analysis of multiprocessors and distributed systems. We show that our methodology provides an improved schedulability condition with respect to the existing approaches. Performance evaluation studies quantify to quantify the performance of our proposed approach under a variety of scenarios.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.5
• /
• pp.1912-1931
• /
• 2018

In future wireless network, user experience and energy efficiency will play more and more important roles in the communication systems compared to their roles at present. Quality of experience (QoE) and Energy Efficiency (EE) become the widely used metrics. In this paper, we study a combinatorial problem of QoE and EE and investigate a fair power allocation in heterogeneous networks. We first design a new metric, QoE-aware EE (QEE) to reflect the relationship of QoE and energy. Then, the concept of Utopia QEE is introduced, which is defined as the achievable maximum QEE in ideal conditions, for each user. Finally, we transform the power allocation process to an optimization of ratio of QEE and Utopia QEE and use invasive weed optimization (IWO) algorithm to solve the optimization problem. Numerical simulation results indicate that the proposed algorithm can get converged and efficiently improve the system energy efficiency and the QoE for each user.

• Journal of KIISE:Computing Practices and Letters
• /
• v.13 no.5
• /
• pp.252-259
• /
• 2007

With the rapid development of multimedia applications and wireless communication networks, consumer demand for video-over-wireless capability on mobile computing systems is growing rapidly. In this regard, this paper introduces YUV-aware instructions that enhance the performance and efficiency in the processing of color image and video. Traditional multimedia extensions (e.g., MMX, SSE, VIS, and AltiVec) depend solely on generic subword parallelism whereas the proposed YUV-aware instructions support parallel operations on two-packed 16-bit YUV (6-bit Y, 5-bits U, V) values in a 32-bit datapath architecture, providing greater concurrency and efficiency for color image and video processing. Moreover, the ability to reduce data format size reduces system cost. Experiment results on a representative dynamically scheduled embedded superscalar processor show that YUV-aware instructions achieve an average speedup of 3.9x over the baseline superscalar performance. This is in contrast to MMX (a representative Intel#s multimedia extension), which achieves a speedup of only 2.1x over the same baseline superscalar processor. In addition, YUV-aware instructions outperform MMX instructions in energy reduction (75.8% reduction with YUV-aware instructions, but only 54.8% reduction with MMX instructions over the baseline).

• Bulletin of the Society of Naval Architects of Korea
• /
• v.3 no.1
• /
• pp.25-32
• /
• 1966

For preliminary estimation of ships' machinery weights, many papers giving well-judged data and discussions for rational method of estimation, such as [1], [2], [3], [4], [5], [6], are available, however, they are mostly concerned with large ships propelled by power more than about 2, 000 horsepower. Regarding the medium and small-sized ships, as far as the author is aware, fragmental data and vague discussions found in various technical literature are the all available. In this paper, available data concerned with machinery weights of commercial ships propelled by direct-drive diesel plants of power below 3, 000 horsepower with single screw propeller are collected and analysed to obtain systematic data Fig. 1 and Fig. 2 as weight to power ratio versus power per shaft diagrams together with suplementary data Fig. 1 and Fig. 3. Influences of various factor such as revolutions per minute, mean effective pressure, type and construction of the main units on machinery weights are also investigated in detail to give a better guidance for logical and rational utlization of the proposed diagrams in preliminary estimation of machinery weights.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.5
• /
• pp.251-259
• /
• 2014

In this paper, we propose Low Energy Service Discovery (LESD) protocol for common discovery mode of IEEE 802.15.8 Peer Aware Communications (PAC). In order to minimize power consumption, Basic Repetition Block (BRB) is defined. Device is able to select operating mode and synchronize other devices through it. Proposed MAC procedure is Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) based on overhearing technique. Even if device has not been received response signal since transmitted request signal, it is able to discover other devices of same group through the overhearing technique. IEEE 802.15.8 PAC has required that performances of common discovery mode are presented about discovered devices during the simulation time, discovery latency and average power consumption. By considering the number of devices per group and channel environment, two scenarios are evaluated through system level simulation and the simulation results of proposed scheme are compared with CSMA/CA in same simulation conditions. As a result, proposed scheme is able to get high energy efficiency of devices as well as increase the number of discovered devices during simulation time when the longer the number of devices is distributed over a limited area.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.40 no.12
• /
• pp.106-115
• /
• 2003

Diverse multimedia services will be deployed at hand on 3G-and-beyond multi-service CDMA systems in order to satisfy different quality of service (QoS) according to traffic types. In order to use appropriate resources efficiently the call admission control (CAC) as a major resource control mechanism needs to be used to take care of efficient utilization of limited resources. In this paper, we propose a QoS-aware CAC (QCAC) that is enabled to provide service fairness and service differentiation in accordance with priority order and that applies the different thresholds in received power considering different QoS requirements such as different bit error rates (BER) when adopting total received power as the ceil load estimation. The proposed QCAC calculates the different thresholds of the different traffic types based on different required BER applies it for admission policy, and can get service fairness and differentiation in terms of call dropping probability as a main performance metric. The QCAC is aware of the QoS requirement per traffic type and allows admission discrimination according to traffic types in order to minimize the probability of QoS violation. Also the CAC needs to consider the resource allocation schemes such as complete sharing (CS), complete partitioning (CP), and priority sharing(PS) in order to provide fairness and service differentiation among traffic types. Among them, PS is closely related with the proposed QCAC having differently calculated threshold per each traffic type according to traffic priority orders.

• Journal of KIISE:Information Networking
• /
• v.34 no.4
• /
• pp.262-268
• /
• 2007

The efficient node-energy utilization in wireless sensor networks has been studied because sensor nodes operate with limited power based on battery. To extend the lifetime of the wireless sensor networks, maintaining balanced power consumption between sensor nodes is more important than reducing total energy consumption of the overall network. Since a large number of sensor nodes are densely deployed and collect data by cooperation in wireless sensor network, keeping more sensor nodes alive as possible is important to extend the lifetime of the sensor network. In this paper, we submit an efficient energy aware routing protocol based on AODV ad hoc routing protocol for wireless sensor networks to increase its lifetime without degrading network performance. The proposed protocol is designed to avoid traffic congestion on minor specific nodes at data transfer and to make the node power consumption be widely distributed to increase the lifetime of the network. The performance of the proposed protocol has been examined and evaluated with the NS-2 simulator in terms of network lifetime and end-to-end delay.

• The KIPS Transactions:PartD
• /
• v.13D no.1 s.104
• /
• pp.23-28
• /
• 2006

In this paper, a power-aware query processing using optimized distributed R-tree in a sensor network is proposed. The proposed technique is a new approach for processing range queries that uses spatial indexing. Range queries are most often encountered under sensor networks for computing aggregation values. The previous work just addressed the importance but didn't provide any efficient technique for processing range queries. A query processing scheme is thus designed for efficiently processing them. Each node in the sensor network has the MBR of the region where its children nodes and the node itself are located. The range query is evaluated over the region which intersects the geographic location of sensors. It ensures the maximum power savings by avoiding the communication of nodes not participating over the evaluation of the query.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.05a
• /
• pp.37-39
• /
• 2015

In this paper, we propose a distributed user scheduling with interference-aware power control (IAPC) to maximize signal to generating interference plus noise ratio (SGINR) in multi-cell uplink network. Assuming that the channel reciprocity time-division duplexing (TDD) system is used, the interference channel from users to other cell BSs is obtained at each user. In the proposed scheduling, each user reduces the transmit power if its generating interference to other BSs is larger than a predetermined threshold. Each BS selects the user with the largest SGINR among users. Simulation results show that the proposed technique significantly outperform the existing user scheduling algorithms.

• Journal of Digital Contents Society
• /
• v.14 no.3
• /
• pp.349-356
• /
• 2013

Products of Wi-Fi devices in recent years offer higher throughput and have longer signal coverage which also bring unnecessary signal interference to neighboring wireless networks, and result in decrease of network throughput. Signal interference is an inevitable problem because of the broadcast nature of wireless transmissions. However it could be optimized by reducing signal coverage of wireless devices. On the other hand, smaller signal coverage also means lower transmission power and lower data throughput. Therefore, in this paper, we analyze the relationship among signal strength, coverage and interference of Wi-Fi networks, and as a tradeoff between transmission power and data throughput, we propose a range-aware Wi-Fi network scheme which controls transmission power according to positions and RSSI(Received Signal Strength Indication) of Wi-Fi devices and analyze the efficiency of the proposed scheme by simulation.