• Journal of Communications and Networks
• /
• v.7 no.2
• /
• pp.144-156
• /
• 2005

Video streaming over wireless networks is challenging due to node mobility and high channel error rate. In this paper, we propose a multi-source video streaming (MUVIS) system to support high quality video streaming service over IEEE 802.1l-based wireless networks. We begin by collocating a streaming proxy with the wireless access point to help leverage both the media server and peers in the WLAN. By tracking the peer mobility patterns and performing content discovery among peers, we construct a multi-source sender group and stream video using a rate-distortion optimized scheme. We formulate such a multi-source streaming scenario as a combinatorial packet scheduling problem and introduce the concept of asynchronous clocks to decouple the problem into three steps. First, we decide the membership of the multisource sender group based on the mobility pattern tracking, available video content in each peer and the bandwidth each peer allocates to the multi-source streaming service. Then, we select one sender from the sender group in each optimization instance using asynchronous clocks. Finally, we apply the point-to-point rate-distortion optimization framework between the selected sender-receiver pair. In addition, we implement two different caching strategies, simple caching simple fetching (SCSF) and distortion minimized smart caching (DMSC), in the proxy to investigate the effect of caching on the streaming performance. To design more realistic simulation models, we use the empirical results from corporate wireless networks to generate node mobility. Simulation results show that our proposed multi-source streaming scheme has better performance than the traditional server-only streaming scheme and that proxy-based caching can potentially improve video streaming performance.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.12
• /
• pp.2957-2986
• /
• 2013

The traditional approach of fixed spectrum allocation to licensed networks has resulted in spectrum underutilisation. Cognitive radio technology is envisioned as a promising solution that can be used to resolve the ineffectiveness of the fixed spectrum allocation policy by accessing the underutilised spectrum of existing technologies opportunistically. The implementation of cognitive radio networks (CRNs) faces distinct challenges due to the fact that two systems (i.e., cognitive radio (CR) and primary users (PUs)) with conflicting interests interact with each other. Specially, in self-organised systems such as ad-hoc CRNs (AHCRNs), the coordination of spectrum access introduces challenges to researchers due to rapid utilisation changes in the available spectrum, as well as the multi-hop nature of ad-hoc networks, which creates additional challenges in the analysis of resource allocation (e.g., power control, channel and rate allocation). Instead, game theory has been adopted as a powerful mathematical tool in analysing and modelling the interaction processes of AHCRNs. In this survey, we first review the most fundamental concepts and architectures of CRNs and AHCRNs. We then introduce the concepts of game theory, utility function, Nash equilibrium and pricing techniques. Finally, we survey the recent literature on the game theoretic analysis of AHCRNs, highlighting its applicability to the physical layer PHY, the MAC layer and the network layer.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.10
• /
• pp.1862-1878
• /
• 2011

With the advances in wireless communication technology and the advent of smartphones, research on location-based services (LBSs) is being actively carried out. In particular, several spatial index methods have been proposed to provide efficient LBSs. However, finding an optimal indexing method that balances query performance and index size remains a challenge in the case of wireless environments that have limited channel bandwidths and device resources (computational power, memory, and battery power). Thus, mechanisms that make existing spatial indexing techniques more efficient and highly applicable in resource-limited environments should be studied. Bitmap-based Spatial Indexing (BSI) has been designed to support LBSs, especially in wireless broadcast environments. However, the access latency in BSI is extremely large because of the large size of the bitmap, and this may lead to increases in the search time. In this paper, we introduce a Selective Bitmap-based Spatial Indexing (SBSI) technique. Then, we propose an Adaptive Bitmap-based Spatial Indexing (ABSI) to improve the tuning time in the proposed SBSI scheme. The ABSI is applied to the distribution of geographical objects in a grid by using the Hilbert curve (HC). With the information in the ABSI, grid cells that have no objects placed, (i.e., 0-bit information in the spatial bitmap index) are not tuned during a search. This leads to an improvement in the tuning time on the client side. We have carried out a performance evaluation and demonstrated that our SBSI and ABSI techniques outperform the existing bitmap-based DSI (B DSI) technique.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.2 s.46
• /
• pp.209-220
• /
• 2007

Mobile devices become a pak of our daily life due to their versatility, such as the wireless phone calls, the wireless accessibility to Internet, the display of multimedia content, and the communication with nearby mobile devices. Third generation telecommunication service provides an easy access to the Internet for nubile devices. Mobile users pay a fee charged by the telecommunication provider based on the amount of data transferred. This paper introduces a special ad hoc network in which mobile devices cooperate each other to download an interesting content from the Internet in order to reduce the telecommunication cost. The mobile devices, called the peers, in the ad hoc network are assigned a portion of the target file, and are responsible for downloading the portion using their 3G connection. Then, the peers exchange their downloaded portion with other participating peers using their cost-free ad hoc connection in order to reconstruct the whole content. According to the simulation results, large number of participating peers saves the telecommunication cost up to 90% with as few as 10 peers, although it slightly increase the overall content reconstruction time.

• Journal of Korean society of Dental Hygiene
• /
• v.14 no.2
• /
• pp.189-196
• /
• 2014

Objectives : The purpose of this study was to examine the awareness of dental hygienists in public health center towards multicultural family and educational needs to provide information on community oral health programs. Methods : The subjects were 74 recruited from 126 dental hygienists in 14 public dental clinics in Jeonbuk Province. A self-reported questionnaire was filled out by 64 dental hygienists in charge of dental health care. Data were anlatzed by the statistical package SPSS WIN 12.0. Results : The characteristics of the subjects had no impact on their positive multicultural awareness, and there existed differences by age, rank and period of services in the channel of information acquisition. They got 3.5 out of five in multicultural awareness showing a positive way. The types of medical services for multicultural family revealed that they provided oral health education, dental checkup services and simple treatment covered by health insurance. Health insurance accounted for 15.4 percent of dental services. The obstacles to dental services in multicultural family were communication problems, poor concern for oral health and cultural gaps. They got 3.86 out of five points in educational needs for multicultural family who need the dental education most. The multicultural family showed the higher score in every question. Conclusions : Public health center dental clinics should help dental hygienists to acquire information on multicultural family. Public health center should provide the easy access way of dental health checkup for the multicultural family.

• Journal of KIISE:Information Networking
• /
• v.32 no.6
• /
• pp.723-731
• /
• 2005

Wide spread deployment of infrastructure WLANs has made Wi Fi an integral part of today's Internet access technology. Despite its crucial role in affecting end to end performance, past research has focused on MAC protocol enhancement, analysis and simulation based performance evaluation without sufficient consideration for modeling inaccuracies stemming from inter layer dependencies, including physical layer diversity, that significantly impact performance. We take a fresh look at IEEE 802.11 WLANs, and using experiment, simulation, and analysis demonstrate its surprisingly agile performance traits. Contention based MAC throughput degrades gracefully under congested conditions, enabled by physical layer channel diversity that reduces the effective level of MAC contention. In contrast, fairness and jitter significantly degrade at a critical offered load. This duality obviates the need for link layer flow control for throughput improvement but necessitates traffic control for fairness and QoS. We use experimentation and simulation in a complementary fashion, pointing out performance characteristics where they agree and differ.

• Journal of KIISE
• /
• v.43 no.2
• /
• pp.163-176
• /
• 2016

The contention overhead on the same channel in an NoC architecture can significantly increase a communication delay due to the simultaneous communication requests that occur. To reduce the overall overhead, we propose task-to-tile binding techniques for an NoC-based manycore platform, whereby it is assumed that the task mapping decision has already made. Since the NoC architecture may have multiple memory tiles as its size grows, memory clustering is used to balance the load of memory by making applications access different memory tiles. We assume that the information on the communication overhead of each application is known since it is specified in a dataflow task graph. Using this information, this paper proposes two heurisitics that perform binding of multiple tasks at once based on a proper memory clustering method. Experiments with an NoC simulator prove that the proposed heurisitic shows performance gains that are 25% greater than that of the previous binding heuristic.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.10
• /
• pp.2100-2112
• /
• 2011

An orthogonal code hopping multiplexing (OCHM) technique has been proposed for accommodating a large number of users with low channel activities than the number of orthogonal codewords through statistical multiplexing in downlink cellular systems. In this paper, a multiple input multiple output (MIMO) antenna based OCHM system is proposed to improve the performance. Each modulated symbol is repeated N times and the N repeated symbols are transmitted simultaneously using N transmit antennas. Through repetitions, the effect of perforations that the OCHM system experiences is decentralized among the repeated symbols and the full perforation probability is significantly reduced. Each receiver detect the transmitted signal using its pre-assigned code hopping pattern. Simulation results show that the proposed scheme saves the required energy for a given frame error rate (FER).

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.4
• /
• pp.914-925
• /
• 1998

This paper considers the evaluation of the hybrid acquistion perdformance for the pilot signal in the direct sequence code division multiple access(DS/CDMA) forward link. the hybrid acquisition is introduced by the combination of two schemes, the parallel and serial acquisions. The mean acquisition time of the proposed scheme is derived to consider both the best case(the correct code-phase offsets are included i one subset) and the worst case(the correct code-phase offsets exist at the boundary of two subsets), which are cause by the distribution of the correct code-phase offsets in the subset. Expressions for the detection, false alarm, and miss probabilities are derived for the case of multiple correct code-phase offsets and multipath Rayleigh fading channel. Numerical results present the hybrid acquistion performance with repect to design parameters such as postdetectio integration length in the search and verification modes, subset size, and number of I/Q noncoherent correlators, and compare the hybrid acquistion with the parallel acquistion in terms of the minimum acquistion time under the same hardware complexity.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.1A
• /
• pp.74-80
• /
• 2000

In this paper, we proposed the MAC protocol and analyzed the performance for CATV/LAN network which was based upon HFC(hybrid optic coaxial) increased abruptly as alternative method of high speed network. Upstream channel which analyzed very deeply for CATV/LAN network have the preferential access property depending upon that position and unidirectional property. To solve this fairness problem, we propose the CSMA-CD/U/P protocol that transm it as $P_i$ probability although data packets is immediately transmitted when it was occurred. As the analytic result and simulation, we obtained $P_i$ value and its average delay time. Also, we get its variance value and queue length distribution. The mean delay time and queue length increase as the load and number of stations increase in the CATV/LAN network.