• Journal of Communications and Networks
• /
• 제12권1호
• /
• pp.11-18
• /
• 2010

Diversity-multiplexing tradeoff (DMT) is an efficient tool to measure the performance of multiple-input and multiple-output (MIMO) systems and cooperative systems. Recently, cooperative multicast system with wireless network coding stretched tremendous interesting due to that it can drastically enhance the throughput of the wireless networks. It is desirable to apply DMT to the performance analysis on the multicast system with wireless network coding. In this paper, DMT is performed at the three proposed wireless network coding protocols, i.e., non-regenerative network coding (NRNC), regenerative complex field network coding (RCNC) and regenerative Galois field network coding (RGNC). The DMT analysis shows that under the same system performance, i.e., the same diversity gain, all the three network coding protocols outperform the traditional transmission scheme without network coding in terms of multiplexing gain. Our DMT analysis also exhibits the trends of the three network coding protocols' performance when multiplexing gain is changing from the lower region to the higher region. Monte-Carlo simulations verify the prediction of DMT.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제7권7호
• /
• pp.1533-1546
• /
• 2013

Wireless multicast is considered as an effective transmission mode for the future mobile social contact services supported by Long Time Evolution (LTE). Though wireless multicast has an excellent resource efficiency, its performance suffers deterioration from the channel condition and wireless resource availability. Cognitive Radio (CR) and Device to Device (D2D) are two solutions to provide potential resource. However, resource allocation for cognitive wireless multicast based on D2D is still a great challenge for LTE social networks. In this paper, a joint sub-carriers and power allocation model based on D2D for general cognitive radio multicast (CR-D2D-MC) is proposed for Orthogonal Frequency-Division Multiplexing (OFDM) LTE systems. By opportunistically accessing the licensed spectrum, the maximized capacity for multiple cognitive multicast groups is achieved with the condition of the general scenario of imperfect spectrum sensing, the constrains of interference to primary users (PUs) and an upper-bound power of secondary users (SUs) acting as multicast source nodes. Furthermore, the fairness for multicast groups or unicast terminals is guaranteed by setting a lower-bound number of the subcarriers allocated to cognitive multicast groups. Lagrange duality algorithm is adopted to obtain the optimal solution to the proposed CR-D2D-MC model. The simulation results show that the proposed algorithm improves the performance of cognitive multicast groups and achieves a good balance between capacity and fairness.

• 대한산업공학회지
• /
• 제36권2호
• /
• pp.94-100
• /
• 2010

The reliable multicast MAC (Medium Access Control) protocol is needed to guarantee the recipients' nonerroneous reception of the multicast data frames, which can be transmitted by the AP (Access Point) in infrastructure mode IEEE 802.11 wireless LANs. Enhancing the BMMM (Batch Mode Multicast MAC) protocol, in the literature, the connectivity-based reliable multicast MAC protocol was proposed to reduce the RAK (Request for ACKnowledgement) frame transmissions and enhance the multicast MAC performance. However, the number of necessary RAK frame transmissions increases as the number of multicast recipients increases. To alleviate the problem of the larger number of RAK frame transmissions with the larger number of multicast recipients, we propose the clustering algorithm for partitioning the recipients into a small number of clusters, so that the recipients are connected each other within the same clusters. Numerical examples are presented to show the reliable multicast MAC performance improvement by the clustering algorithm.

• 대한산업공학회지
• /
• 제38권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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제5권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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제5권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.

• 인터넷정보학회논문지
• /
• 제6권5호
• /
• pp.143-154
• /
• 2005

본 논문은 무선 엑세스 포인트를 기반으로 사용자가 광고 컨텐츠 수신을 통해 무선 네트워크 접속 서비스를 받을 수 있는 인터넷 접근형 광고 시스템에서 신뢰적 멀티캐스트 전송에 관한 것이다. 본 논문에서는 무선 LAN 환경에서 신뢰성 있는 멀티캐스트를 위해 네트워크 상태에 따라 이동단말기의 전송량을 조절하는 응용 계층 멀티캐스트 프로토콜을 제안한다. 인터넷 광고란 상품 또는 서비스의 판매나 인지도를 높이기 위하여 인터넷의 운용 프로그램이나 서비스 등을 광고 매체로 제공하는 광고 메시지를 통칭한다. 기존의 인터넷 광고 시스템들은 대부분 유선 환경의 불특정 다수를 대상으로 광고를 하며, 사용자의 웹브라우저를 광고 표현 매체로 하기 때문에 임의로 접근하는 사이트에 따라 노출 빈도가 매우 달라지는 수동적인 방법이다. 더욱이 사용자가 광고를 보아야 하는 필연적인 이유가 없으므로 광고가 사용자들에게 얼마나 효과적으로 노출될 수 있느냐 하는 문제점을 가지고 있다. 본 논문에 따른 인터넷 광고 시스템을 사용할 때, 사용자들은 무선 인터넷을 무료로 이용하고 광고주들은 사용자들에게 타겟 마케팅을 위한 지역적(현장성), 시간적(즉시성), 카테고리별(개인성) 타겟 광고를 하며, 네트워크 인프라 소유자는 기존 네트워크 인프라의 변경을 최소화하여 저비용으로 인터넷 광고 시스템을 운영할 수 있다.

• 한국정보통신학회논문지
• /
• 제13권1호
• /
• pp.161-169
• /
• 2009

한 노드에서 다수의 노드로 데이터를 전달하는 one-hop 통신에 사용되는 매체접속제어(MAC)는 멀티캐스트 기반의 데이터 통신을 사용하는 것이 매우 효율적이다. 유니캐스트와 달리 멀티캐스트에서는 모든 노드들과의 통신에서 우수한 품질을 얻기 위해서는 여러 노드들과의 서로 다른 무선 채널환경과 노드 이동성에 따른 무전 채널환경 변화에 대응할 수 있어야 한다. 하지만, IEEE 802.11에서는 다수개의 노드들과 RTS, CTS, ACK을 교환하는 방법이 정의되어 있지 않아서 신뢰성 있는 멀티캐스트를 지원하지 않고 있다. 이러한 문제를 해결하기 위해서 몇 가지 MAC 계층 프로토콜들이 제안되었다. 하지만, 신뢰성 있는 멀티 캐스트를 구현하기 위해서는 추가적인 오버헤드가 필요하며, 이 오버헤드로 인해서 시스템 성능이 저하하게 된다. 본 논문에서는 OFDMA 시스템에서 신뢰성 있는 멀티 캐스트를 구현하기 위해 필요한 오버헤드를 줄이기 위하여 계층통합적 (cross-layer) 설계기법을 제안한다. 제안된 오버헤드와 시스템 성능간의 관계를 분석하는 방법도 제안한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제6권2호
• /
• pp.629-648
• /
• 2012

Given a video stream delivering system deployed on a multicast tree, which is embedded in a multi-channel multi-radio wireless mesh network, our problem is concerned about how to allocate interference-free channels to tree links and maximize the number of serviced mesh clients at the same time. In this paper, we propose a channel allocation heuristic algorithm based on best-first search and backtracking techniques. The experimental results show that our BFB based CA algorithm outperforms previous methods such as DFS and BFS based CA methods. This superiority is due to the backtracking technique used in BFB approach. It allows previous channel-allocated links to have feasibility to select the other eligible channels when no conflict-free channel can be found for the current link during the CA process. In addition to that, we also propose a tree refinement method to enhance the quality of channel-allocated trees by adding uncovered destinations at the cost of deletion of some covered destinations. Our aim of this refinement is to increase the number of serviced mesh clients. According to our simulation results, it is proved to be an effective method for improving multicast trees produced by BFB, BFS and DFS CA algorithms.