• Journal of Broadcast Engineering
• /
• v.20 no.2
• /
• pp.283-299
• /
• 2015

In this paper, we propose new broadcasting services that combine MMT (MPEG Media Transport) standard with MPEG-DASH (Dynamic Adaptive Streaming over HTTP) standard. MMT is a next-generation multimedia transport standard that is IP-friendly and provides functionalities appropriate for hybrid broadcasting that uses broadcast physical channels and the Internet simultaneously. MPEG-DASH enables media streaming services that can be dynamically adaptive both to the network traffic conditions of wired and/or wireless Internet and the receiving entity environment. We explain the scenarios of the proposed broadcasting services and demonstrate that various hybrid broadcasting services can be easily realized through the combined usage of MMT and MPEG-DASH. By making the test bitstreams containing contents for the new services and developing the receiver back-end software that performs the function of the receiving entity for the new services on personal computers, we verified that the proposed scenarios can be realized.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.9 s.351
• /
• pp.88-98
• /
• 2006

VANET has several different characteristics from MANET such as high mobility of nodes and frequent change of node density and network topology. Due to these characteristics, the network topology based protocol, often used in MANET, can not be applied to VANET. In this paper, we propose an emergency warning message broadcast protocol using range based relay node selecting algorithm which determines the minimal waiting time spent by a given node before rebroadcasting the received warning message. Because the time is randomly calculated based on the distance between sender node and receiver node, a node chosen as a relay node is assured to have a minimal waiting time, even though it is not located at the border of radio transmission range. The proposed emergency warning message broadcast protocol has low network traffic because it does not need to exchange control messages for message broadcasting. In addition, it can reduce End-to-End delay under circumstances of low node density and short transmission range in VANET.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.5C
• /
• pp.302-308
• /
• 2011

In this paper we propose a coordinated beamforming(CBF) scheme considering the effects of feedback quantization and delay in time-varying multiple-input multiple-output(MIMO) broadcast channels. By equal power allocation per data stream, the proposed CBF scheme transmits multiple data streams per user terminals without additional feedback overhead when quantized feedback information is used. The proposed CBF scheme also applies a linear channel predictor to each user terminals to prevent errors due to feedback delays that are not evitable in practical wireless systems. Each user terminal utilizes Wiener filter to predict future channel responses and generates feedback information based on the predicted channels. Consequently the proposed CBF scheme adapting Wiener filter improves system performances compared with the conventional scheme using delayed feedback.

• Journal of Internet Computing and Services
• /
• v.10 no.6
• /
• pp.1-6
• /
• 2009

In this paper, we propose an energy efficient index scheme for Nearest Neighbor queries, specially designed for mobile P2P environments. we propose a PMBR (P2P Minimum Boundary Rectangle) index that provides the client with the ability of selective contacting and tuning from other nodes. The mobile client is able to identify whether or not the neighbor nodes have the desired information by accessing PMBR. Thus, the client immediately switches to change to another node's broadcast channel if the index does not contain the desired information. Furthermore, the client is able to predict the arrival time of the desired data items and only needs to tune into the broadcast channel when the requested data items arrives, by first accessing PMBR. Thus, the mobile client can stay in power save mode most of time, and tune into the broadcast channel only when the requested data items arrive. Experiments are conducted to evaluate the performance of the proposed scheme. Comprehensive experiments illustrate that the proposed scheme is more efficient than the previous techniques in terms of energy consumption.

• Journal of KIISE:Databases
• /
• v.37 no.4
• /
• pp.203-208
• /
• 2010

This paper deals with an efficient index scheduling technique based on Hilbert curve and MBR for k-NN query in a single wireless broadcast channel environment. Previous works have two major problems. One is that they need a long time to process queries due to the back-tracking problem. The other is that they have to download too many spatial data since they can not reduce search space rapidly. Our proposed method broadcasts spatial data based on Hilbert curve order where a distributed index table is also broadcast with each spatial data. Each entry of index table represents the MBR which groups spatial data. By predicting the unknown location of spatial data, our proposed index scheme allows mobile clients to remove unnecessary data and to reduce search space rapidly. As a result, our method gives the decreased tuning time and access latency.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.5
• /
• pp.282-296
• /
• 2006

In a wireless client server environment, data broadcasting is an efficient data dissemination method; a server broadcasts data, and some of broadcasted data are cached in a mobile client's cache to save the narrow communication bandwidth, limited resources, and data access time. A server also broadcasts invalidation reports to maintain the consistency between server data and a client's cached data. Most of existing works on the cache consistency problems simply purge the entire cache when the disconnection time is long enough to miss the certain amount(window size) of IRs. This paper presents a cache invalidation method to increase mobile clients' cache reusability in case of a long disconnection. Instead of simply dropping the entire cache regardless of its consistency, a client estimates the cost of purging all the data with the cost of selective purge. If the cost of dropping entire cache is higher, a client maintains the cache and selectively purge inconsistent data using uplink bandwidth for validation request. The simulation results show that this scheme increases the cache reusability since it effectively considers the update rates and the broadcast frequencies of cached data in estimating the cost of cache maintenance.

• The KIPS Transactions:PartC
• /
• v.13C no.6 s.109
• /
• pp.749-756
• /
• 2006

Broadcast nature of wireless medium and path-loss reduction create a favourable condition for collaborative communications (CC) among single-antenna users to gain the powerful benefits of multi-antenna system without the demand for physical arrays. This paper proposes a CC strategy adapting to the propagation environment changes by optimizing the transmit signal amplification factors to simplify the structure of maximum likelihood (ML) detector and to obtain the minimum error probability as well. The closed-form BER expression was also derived and compared to the simulation results to evaluate the performance of the suggested solution. A variety of numerical results revealed the cooperation significantly outperforms non-cooperative counterpart under flat Rayleigh fading channel plus AWGN (Additive White Gaussian Noise).

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.3
• /
• pp.1031-1046
• /
• 2018

Vehicular ad hoc network (VANET) is a dedicated network to connect vehicles without any centralized administration or infrastructure. The wireless access in vehicular environments (WAVE) protocol leveraging IEEE 1609/802.11p is widely implemented for VANETs. However, in congested traffic situation, the performance of the WAVE system degrades significantly due to serious collision, especially for safety related broadcast services on the control channel (CCH) interval due to the inherent drawback of its collision avoidance mechanisms called carrier sense multiple access with collision avoidance (CSMA/CA). In this paper, we propose a method that can decrease the number of frame collisions in CCH with a few modifications to the IEEE 802.11p protocol. In the paper, vehicles still employ CSMA/CA to compete for the channel access opportunity. However, by taking advantage of periodicity of synchronization interval, a two-state switching scheme introducing two new inter frame space (IFS) is proposed to reduce the number of competing vehicles substantially and as a result, the collision probability is significantly decreased. The simulation results demonstrate the superiority of the proposed method in packet collision rate.

• Proceedings of the KIEE Conference
• /
• 2003.11c
• /
• pp.384-387
• /
• 2003

In this paper, we have designed the integrated wire and wireless P2P framework using mobile agents to share efficiently resources as media file. Most of the P2P applications are used on the wire network. We propose the integrated wire and wireless P2P framework. Proposed P2P platform is based on JXTA of Sun Microsystems. But JXTA is pure peer-to-peer network model, so it sends message other peers as broadcast style to request resources. In this way, there are some problems as massage overload, bandwidth loss, etc. In order to solve this problem, we propose a hybrid peer-to-peer network model using mobile agent. Proposed scheme also solve existing hybrid pEp model's flaws which have the delay and low rate due to concentrated server. In proposed scheme, mobile agents that have autonomy and mobility are used to search the location of resources. Besides, mobile agents could solve the loss problem of the search result. To improve P2P QoS(Quality of Service), we could monitor peer's state information using PIP(Peer Information Protocol) of JXTA.

• The KIPS Transactions:PartC
• /
• v.14C no.4
• /
• pp.365-370
• /
• 2007

Connected Dominating Set(CDS) has been used as a virtual backbone in wireless ad hoc networks by numerous routing and broadcast protocols. Although computing minimum CDS is known to be NP-hard, many protocols have been proposed to construct a sub-optimal CDS. However, these protocols are either too complicated, needing non- local information, not adaptive to topology changes, or fail to consider the difference of energy consumption for nodes in and outside of the CDS. In this paper, we present two Timer-based Energy-aware Connected Dominating Set Protocols(TECDS). The energy level at each node is taken into consideration when constructing the CDS. Our protocols are able to maintain and adjust the CDS when network topology is changed. The simulation results have shown that our protocols effectively construct energy-aware CDS with very competitive size and prolong the network operation under different level of nodal mobility.