• Journal of Communications and Networks
• /
• v.13 no.1
• /
• pp.26-31
• /
• 2011

In this paper, we formulate the minimum power multicast problem in wireless networks as a mixed integer linear programming problem and then propose a Lagrangean relaxation based algorithm to solve this problem. By leveraging on the information from the Lagrangean multiplier, we could construct more power efficient routing paths. Numerical results demonstrate that the proposed approach outperforms the existing approaches for broadcast, multicast, and unicast communications.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.10B
• /
• pp.1004-1012
• /
• 2009

Although it is raising expectation of multimedia multicast services in various wireless networks, it requires an efficient IP multicast group membership management in wireless environment. However, the existing IGMPv3/MLDv2 protocols are too heavy; they are not suitable for wireless environment. Moreover they suffer from a number of problems, such as unreliable signaling, slow state transition, low spectral efficiency, bulk report, and interrupting dormant receivers. In this paper, we propose a wireless host agent (WHA)-based IP multicast group management scheme that requires a reduced number of signaling, which also solves such problems effectively. We develop an analytic model to quantify costs of bandwidth usage and signaling overhead, and perform comparison and analysis of the proposed scheme.

• Journal of Korean Institute of Industrial Engineers
• /
• v.38 no.4
• /
• pp.285-288
• /
• 2012

The connectivity-based reliable multicast MAC protocol was proposed for IEEE 802.11 wireless LANs and the formulae for the lower bounds of the multicast downlink throughput and the uplink throughput of the connectivity-based reliable multicast MAC protocol were derived in our previous study. We provide the tighter throughput lower bounds of the connectivity-based reliable multicast MAC protocol than the lower bounds presented in our previous study.

• Journal of the Korea Convergence Society
• /
• v.7 no.4
• /
• pp.25-32
• /
• 2016

When using reliable multicast protocol over air links, the multicast packets lost in the air link cause the initiation of retransmission request packets and the implosion of retransmission packets, which deteriorate multicast session performance. This paper proposes on the efficient reliable multicast mechanism in wireless networks utilizing the Agents. In this paper we show the design of a retransmission agent which improves the performance of reliable multicast sessions in wireless network. The main idea is to cache reliable multicast packets at the base station and perform local retransmissions across the wireless link. MATLAB has been used to simulate and to get performance results for signaling overhead and processing delay through the comparison of the proposed agent model to the Multicast File Transfer Protocol. It has been proven from the simulation results that the proxy module make pass trials shorter in Multicast File Transfer Protocol.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.2
• /
• pp.269-286
• /
• 2011

In this paper, we study a problem that is concerning how to construct a delay-constrained multicast tree on a wireless mesh network (WMN) such that the number of serviced clients is maximized. In order to support high-quality and concurrent interference-free transmission streams, multiple radios are implemented in each mesh node in the WMNs. Instead of only orthogonal channels used for the multicast in the previous works, both orthogonal and partially overlapping channels are considered in this study. As a result, the number of links successfully allocated channels can be expected to be much larger than that of the approaches in which only orthogonal channels are considered. The number of serviced subscribers is then increased dramatically. Hence, the goal of this study is to find interference-free and delay-constrained multicast trees that can lead to the maximal number of serviced subscribers. This problem is referred as the MRDCM problem. Two heuristics, load-based greedy algorithm and load-based MCM algorithm, are developed for constructing multicast trees. Furthermore, two load-based channel assignment procedures are provided to allocate interference-free channels to the multicast trees. A set of experiments is designed to do performance, delay and efficiency comparisons for the multicast trees generated by all the approximation algorithms proposed in this study.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.4
• /
• pp.787-793
• /
• 2015

In order to support reliable medium access control (MAC) layer multicast services in Broadband Wireless Access (BWA) networks, we here propose spreading codes (Cumulative ACK (CA) code and ARQ Feedback Request (AFR) code) based reliable multicast feedback scheme. The status indications based on the automatic repeat request (ARQ) mechanism are needed in some multicast services. In accordance with various wireless channel environments, we demonstrate the performance excellency of our proposed scheme with respect to required uplink resources compared with the original feedback scheme based on unicast ARQ feedback messages. In addition, we analyze packet error rate (PER) against the various wireless channel environments.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.12
• /
• pp.5191-5211
• /
• 2016

It is essential to satisfy class-specific QoS constraints to provide broadband services for new generation networks. The present study proposes a QoS-driven multicast scheme for wireless networks in which the transmission rate and end-to-end delay are assumed to be bounded during a multiple multicast session. A distributed algorithm was used to identify a cost-efficient sub-graph between the source and destination which can satisfy QoS constraints of a multicast session. The model was then modified as to be applied for wireless networks in which satisfying interference constraints is the main challenge. A discrete power control scheme was also applied for the QoS-aware multicast model to accommodate the effect of transmission power level based on link capacity requirements. We also proposed random power allocation (RPA) and gradient power allocation (GPA) algorithms to efficient resource distribution each of which has different time complexity and optimality levels. Experimental results confirm that the proposed power allocation techniques decrease the number of unavailable links between intermediate nodes in the sub-graph and considerably increase the chance of finding an optimal solution.

• Journal of Communications and Networks
• /
• v.13 no.5
• /
• pp.525-535
• /
• 2011

In this paper, we study the contribution of network coding (NC) in improving the multicast capacity of random wireless ad hoc networks when nodes are endowed with multi-packet transmission (MPT) and multi-packet reception (MPR) capabilities. We show that a per session throughput capacity of ${\Theta}$(nT$^3$(n)) can be achieved as a tight bound when each session contains a constant number of sinks where n is the total number of nodes and T(n) is the transmission range. Surprisingly, an identical order capacity can be achieved when nodes have only MPR and MPT capabilities. This result proves that NC does not contribute to the order capacity of multicast traffic in wireless ad hoc networks when MPR and MPT are used in the network. The result is in sharp contrast to the general belief (conjecture) that NC improves the order capacity of multicast. Furthermore, if the communication range is selected to guarantee the connectivity in the network, i.e., ${\Omega}$($\sqrt{log\;n/n}$)=T(n) = O(log log n / log n), then the combination of MPR and MPT achieves a throughput capacity of ${\Theta}$(log$^{\frac{3}{2}}$ n/$\sqrt{n}$) which provides an order capacity gain of ${\Theta}$(log$^2$ n) compared to the point-to-point multicast capacity with the same number of destinations.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.5
• /
• pp.1028-1048
• /
• 2011

The relation of multicast transmission and directional antennas is an open problem that has been debated for a long period of time. In this paper, we propose a group-aware multicast scheme of efficient multicast communication using the directional antennas for 60GHz millimeter wave wireless networks. For this purpose, we first derive the relation among beamwidth, distance between devices and most suitable data rate in the 60GHz frequency-based wireless network. In addition, for the dynamic beamforming of multicast communication, the x and y coordinates of any point with sender device at the center is generated, and a best-chosen group is deduced based on the Euclidean distance. Then the most suitable data rate for the group is obtained using the law of cosine. Using the Standard IEEE 802.11ad MAC protocol as an example, extensive simulation results demonstrate that the proposed scheme outperforms the existing multicast communication schemes with directional antennas under different situations.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.4
• /
• pp.813-818
• /
• 2015

In this paper, WiMedia Distributed-MAC protocol is adopted for development of a seamless N-screen wireless service. Furthermore, to provide the OSMU (One Source Multi Use) N-screen service through P2P streaming in the seamless D-MAC protocol, a new Multicast-free DRP Availability IE is proposed and analyzed. In this Multicast-free DRP Availability IE, indicating Multicast DRP Owner and Receiver is required. The ACK frame transmissions are not required for Multicast transmissions in P2P N-screen services. Using this property, the Multicast-free DRP Availability IE scheme is proposed to expand the number of time slots available for unicast and multicast DRP reservations. Simulation results show that our Multicast scheme enhances performances in vewpoints of DRP reservation conflict and throughput.