• Proceedings of the IEEK Conference
• /
• 2002.07c
• /
• pp.1428-1431
• /
• 2002

It is general opinion that the future mobile multimedia networks will use different standards and a prospective solution to this problem will be software defined radio (SDR) techniques. SDR provides the flexibility to support multiple air interfaces and signal processing functions at the same time. Especially, digital signal processors and FPGAs are widely used for implementation of these adaptive and flexible functions of a baseband modem for SDR applications. Also, it is known that the modulation schemes of OCQPSK (Orthogonal Complex QPSK) and HPSK (Hybrid PSK) are used for IMT-2000 services of cdma2000 and WCDMA, respectively. Thus, in this paper, we design and implement an OCQPSK / HPSK modem using a DSP chip of Texas Instrument's TMS320C6701. One modulation scheme is operated by adaptive selection between the two schemes and 5 physical traffic channels differentiated by orthogonal codes are implemented in one DSP chip and each channel has 1Mbps data rates and 8Mcps chip rates.

• Journal of Communications and Networks
• /
• v.8 no.3
• /
• pp.297-305
• /
• 2006

High-rate wireless personal area network (HR-WPAN) has been standardized by the IEEE 802.15.3 task group (TG). To support multimedia services, the IEEE 802.15.3 TG adopts a time-slotted medium access control (MAC) protocol controlled by a central device. In the time division multiple access (TDMA)-based wireless packet networks, the packet scheduling algorithm plays a key role in quality of service (QoS) provisioning for multimedia services. In this paper, we propose an adaptive cross-layer packet scheduling method for the TDMA-based HR-WPAN. Physical channel conditions, MAC protocol, link layer status, random traffic arrival, and QoS requirement are taken into consideration by the proposed packet scheduling method. Performance evaluations are carried out through extensive simulations and significant performance enhancements are observed. Furthermore, the performance of the proposed scheme remains stable regardless of the variable system parameters such as the number of devices (DEVs) and delay bound.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.8B
• /
• pp.764-768
• /
• 2006

Over the years, the widespread proliferation of multimedia services has necessitated the development for an efficient network management. In this paper, we investigate the role of adaptive online pricing mechanism in order to manage effectively the network congestion problem. Our on-line approach is dynamic and flexible that responds to current network conditions. With a simulation study, we demonstrate that our proposed scheme enhances network performance and system efficiency simultaneously under widely diverse traffic load intensities.

• Journal of Communications and Networks
• /
• v.6 no.2
• /
• pp.133-146
• /
• 2004

Recently, many active queue management (AQM) algorithms have been proposed to address the performance degradation. of end-to-end congestion control under tail-drop (TD) queue management at Internet routers. However, these AQM algorithms show performance improvement only for limited network environments, and are insensitive to dynamically changing network situations. In this paper, we propose an adaptive queue management algorithm, called PID-controller, that uses proportional-integral-derivative (PID) feedback control to remedy these weak-Dalles of existing AQM proposals. The PID-controller is able to detect and control congestion adaptively and proactively to dynamically changing network environments using incipient as well as current congestion indications. A simulation study over a wide range of IP traffic conditions shows that PID-controller outperforms other AQM algorithms such as Random Early Detection (RED) [3] and Proportional-Integral (PI) controller [9] in terms of queue length dynamics, packet loss rates, and link utilization.

• Journal of information and communication convergence engineering
• /
• v.22 no.3
• /
• pp.207-214
• /
• 2024

In wireless sensor networks, the implementation of routing protocols is crucial owing to their limited computational capacities. Tree routing is a suitable method in wireless sensors owing to its minimal routing overhead. However, single-hop metric schemes, such as hop count, cause congestion at specific nodes, whereas multiple metric schemes cannot control dynamically changing network environments. To address these issues, we propose a scheme to implement enhanced tree routing with adaptive metrics based on hop count. This approach assigns different weights to metrics to select suitable parent nodes based on hop count. The parent-selection algorithm utilizes hop count, buffer occupancy, and received signal strength indicator (RSSI) as metrics. This study evaluates the performance through simulation scenarios to analyze whether improvements can be made to address problems encountered in traditional tree routing. The performance metrics include packet delivery speed, throughput, and end-to-end delay, which vary depending on the volume of network traffic.

• Annual Conference of KIPS
• /
• 2007.05a
• /
• pp.1288-1290
• /
• 2007

Congestion in WSN increases energy dissipation rates of sensor nodes as well as loss of packets and thereby hinders fair and reliable event detections. We find that one of the key reasons of congestion in WSN is allowing sensing nodes to transfer as many packets as possible. This is due to the use of CSMA/CA that gives opportunistic media access control. In this paper, we propose an energy efficient congestion avoidance protocol that includes source count based hierarchical and load adaptive medium access control. Our proposed mechanism ensures load adaptive media access to the nodes and thus achieves fairness in event detection. The results of simulation show our scheme exhibits more than 90% delivery ratio with retry limit 1, even under bursty traffic condition which is good enough for reliable event perception.

• Proceedings of the Korea Institute of Convergence Signal Processing
• /
• 2001.06a
• /
• pp.21-24
• /
• 2001

For very large multimedia traffic to be supported successfully in wireless network environment, it is necessary to provide Quality-of-Service(QoS) guarantees between mobile hosts(clients). In order to guarantee the Qos, we have to keep the call blocking probability below target value during handoff session. However, the QoS negotiated between the client and the network may not be guaranteed due to lack of available channels for traffic in the new cell, since mobile clients should be able to continue their on-going sessions. In this paper we propose a efficient load-balancing algorithm based on the adaptive bandwidth reservation scheme for enlarging available channels in a cell. We design a new method to predict the mobility of clients using MPT(mobility profile table). This method is then used to reserve a part of bandwidths for handoff calls to its adjacent cells and this reserved bandwidth can be used for handoff call prior to new connection requests. If the number of free channels is also under a low threshold value, our scheme use a load-balancing algorithm with a adaptive bandwidth reservation. In order to evaluate the performance of our algorithm, we measure the metrics such as the blocking probability of new calls and dropping probability of handoff calls, and compare with other existing schemes.

• ETRI Journal
• /
• v.30 no.1
• /
• pp.21-32
• /
• 2008

Cognitive radio (CR) has been proposed as an effective technology for flexible use of the radio spectrum. The interference between primary users and CR users, however, becomes a critical problem when they are using adjacent frequency channels with different transmission power levels. In this paper, a robust CR orthogonal frequency division multiplexing (OFDM) architecture, which can effectively suppress interference to nearby primary users and overcome adjacent channel interference (ACI) to the CR user, is proposed. This new approach is characterized by adaptive data repetition for subcarriers under heavy ACI, and adaptive time spreading for subcarriers near the borders of the CR user's spectrum. The data repetition scheme provides extra power gain against the ACI coming from primary users. Time spreading guarantees an acceptable interference level to nearby primary users. By computer simulation, we demonstrate that, under a CR environment, the proposed CR OFDM architecture outperforms conventional OFDM systems in terms of throughput and BER performance.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.14 no.5
• /
• pp.880-887
• /
• 2011

The Wireless Mesh Network(WMN) technology is able to provide an infrastructure for isolated islands, in which it is difficult to install cables or wide area such as battlefield. Therefore, WMN is frequently used to satisfy needs for internet connection and active studies and research on them are in progress. However, as a result of increase in number of hops under hop-by-hop communication environment has caused a significant decrease in throughput and an increase in delay. Considering the heavy traffic of real-time data, such as voice or moving pictures to adaptive WMN, in a military environment. Such phenomenon might cause an issue in fairness index. In order to resolve this issue, we proposed a Cluster Based Multi-channel Assignment Scheme(CB-MAS) for adaptive tactical wireless mesh network. In the CB-MAS, the communication between the Cluster-Head(CH) and cluster number nodes uses a channel has no effect on channels being used by the inter-CH links. Therefore, the CB-MAS can minimize the interference within multi-channel environments. Our Simulation results showed that CB-MAS achieves improved the throughput and fairness index in WMN.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.6
• /
• pp.2144-2159
• /
• 2015

CISCO VNI predicted an average annual growth rate of 66% for mobile video traffic between 2014 and 2019 and accordingly much academic research related to video streaming has been initiated. In video streaming, Adaptive Bitrate (ABR) is a streaming technique in which a source video is stored on a server at variable encoding rates and each streaming user requests the most appropriate video encoding rate considering their channel capacity. However, these days, ABR related studies are only focusing on real-time rate adaptation omitting energy efficiency though it is one of the most important requirement for mobile devices, which may cause dissatisfaction for streaming users. In this paper, we propose an energy efficient prefetching based dynamic adaptive streaming technique by considering the limited characteristics of the batteries used in mobile devices, in order to reduce the energy waste and provide a similar level of service in terms of the average video rate compared to the latest ABR streaming technique which does not consider the energy consumption. The simulation results is showing that our proposed scheme saves 65~68% of energy at the average global mobile download speed compared to the latest high performance ABR algorithm while providing similar rate adaptation performance.