• ETRI Journal
• /
• v.38 no.5
• /
• pp.952-961
• /
• 2016

In this paper, we study a spectrum sharing network (SSN) where a spectrum sharing device (SSD) coexists with multiple wireless communication systems (WCSs) in the same channel. The SSD can operate with either a duty cycle (DC) channel access mechanism or a listen-before-talk (LBT) channel access mechanism, whereas WCSs operate with an LBT mechanism. An opportunistic channel selection scheme for the SSD in the SSN is first proposed to minimize the outage probability. The optimal data transmission time for the DC-based SSD is derived to further improve the outage probability. We also derive the exact and closed-form outage probability of the proposed channel selection in the SSN by assuming that the number of WCSs operating in each channel is uniformly distributed. The simulation results show that the proposed channel selection scheme outperforms other channel selection schemes. It was also observed that a DC-based SSD with an optimal data transmission time provides a better outage performance than an LBT-based SSD. As the number of available channels increases, the channel selection scheme plays an important role in minimizing the outage probability of the SSNs.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.9A
• /
• pp.717-727
• /
• 2003

The HIPERLAN/2(HIgh PERformance Local Area Network Type2) is one of the wireless LAN standards for providing raw data rates of up to 54 Mbps. The MAC protocol of HIPERLAN/2 is based on TDMA/TDD, and resources in one MAC frame can be allocated dynamically by Access Point(AP). The random channel(RCH) is defined for the purpose of giving a mobile terminal the opportunity to request transmission resources in the uplink MAC frames. It is desirable that the number of RCHs is dynamically adapted by the AP depending on the current traffic situation. Allocation of excessive RCHs may waste radio resources and insufficient RCHs compared to traffic loads may result in many collisions in access attempts. We propose an RCH allocation scheme based on split algorithm in HIPERLAN/2. The simulation and analytic results show that the proposed scheme achieves a higher channel throughput, lower access delay and delay jitter than previously proposed RCH allocation schemes.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.2
• /
• pp.63-72
• /
• 2011

Broadcast-based data dissemination has become a widely accepted approach of communication in the mobile computing environment. However, with a large set of data items, the expected delay of receiving a desired data increases due to the sequential nature of the broadcast channel. With the objective of minimizing this wait time, this paper explores the problem of data broadcast over multiple channels. In traditional approaches, data items are partitioned based on their access probabilities and allocated on multiple channels, assuming flat data scheduling per channel. If the data items allocated on the same channel are broadcast in different frequencies based on their access probabilities, the performance will be enhanced further. In this respect, this paper proposes a new broadcast scheduling scheme named two level dynamic programming(TLDP) which can reflect a variation of access probabilities among data items allocated on the same channel.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.2 no.1
• /
• pp.53-59
• /
• 2007

Wimedia UWB(Ultra-Wideband) platform provides data rates up to 480Mbps in WPAN (Wireless Personal Area Network). Wimedia conformant devices access to the channels through superframe concept for communications. As the channel resource is limited, the optimal channel time required for each device needs to be estimated to share the resource efficiently among the devices. In this paper, we propose a scheme to estimate the required channel time in a super frame to satisfy the QoS of the application on a device. The channel time is estimated from the service rate which is computed from the TSPEC of the application. In the process of the estimation, we take the frame overhead for data transmission as well as the overhead due to the acknowledgement scheme, preamble, and MDSU size into consideration. We also analyze and compare the throughputs for different acknowledgement scheme, preamble, and MDSU size situations. The estimated channel time required for a given service rate is allocated in the unit of MAS(Medium Access Slot).

• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 2001.11a
• /
• pp.340-347
• /
• 2001

Security operating system applied to MAC(Mandatory Access Control) or to MLS(Multi Level Security) gives both subject and object both Security Level and value of Category, and it restrict access to object from subject. But it violates Security policy of system and could be a circulated course of illegal information. This is correctly IPC(Interprocess Communication)mechanism and Covert Channel. In this thesis, I tried to design and implementation as OS kernel in order not only to give confidence of information circulation in the Security system, but also to defend from Covert Channel by Storage and IPC mechanism used as a circulated course of illegal information. For removing a illegal information flow by IPC mechanism. I applied IPC mechanism to MLS Security policy, and I made Storage Covert Channel analyze system call Spec. and than distinguish Storage Covert Channel. By appling auditing and delaying, I dealt with making low bandwidth.

• Journal of Korea Society of Industrial Information Systems
• /
• v.25 no.4
• /
• pp.39-47
• /
• 2020

We propose a multi-access points transmit power control algorithm in consideration of the channel estimation error and the multi-rate service. In the real communication systems, the channel estimation at the receiver side is imperfect due to limited number of pilot symbol usage. Furthermore, the multi-rate service is supported. We theoretically prove the uniqueness and the convergence of the proposed algorithm in multi-rate service environment. The proposed algorithm composes of one inner loop part and one outer loop part. Simulation results show that 1) the inner loop algorithm guarantees convergence of the transmit power level and the multi-rate service, 2) the outer loop algorithm compensates for the channel estimation error.

• Journal of Internet Computing and Services
• /
• v.12 no.4
• /
• pp.1-14
• /
• 2011

This paper analyzes the fairness and efficiency of channel sharing when heterogeneous wireless networks that have different transmission power and/or coverage coexist with the contention-based channel access protocol. First, we show that the existing CSMA (carrier sensing multiple access) protocol, that is a prevailing contention-based mechanism, results in significant unfairness of channel access because of (1) the asymmetric capability of carrier sensing and (2) the blindness of binary exponential backoff and link adaptation mechanisms to the interference-driven transmission failures. Next, we derive the feasible region of carrier sensing thresholds that assures spatial reuse and fair channel sharing simultaneously. Moreover, we establish an analytical model for per-system throughput and investigate the effect of contention window size and transmission rate on the fairness and efficiency of channel sharing. Finally, we compare the performance of several approaches for fair channel sharing via simulations under various network configurations.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.5B
• /
• pp.463-468
• /
• 2009

In VANET(Vheicle Ad hoc Network), the researches based on the wireless LAN are conducting and the method based on 802.11a is being adapted in IEEE 802.11p WAVE(Wireless Access in Vehicular Environments). However, wireless LAN which uses a single channel in a competition can cause transmission delays because of a frequent collision and a use of CSMA/CA to avoid competition in VANET requiring a fast access. In this paper, we designed CMMP (Clustering based Multi-channel MAC protocol) adequate to VANET and then confirmed the appropriate channel conditions in a V2V communication on the basis of this protocol. The simulation results showed that a packet collision and a transmission delay by the use of an existing single channel based on the contention decreased more than 60% by CMMP.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.05a
• /
• pp.722-724
• /
• 2010

CAS(Conditional Access System) was developed for paid-for service in cable and fixed satellite broadcast system and technology and market maturity are high. However, these assessment is limited by CAS in fixed broadcasting system. In case of digital mobile broadcast such as T-DMB is difficult to apply CAS technology of fixed broadcasting system because of a use method and technology characteristic. Expecially, in case T-DMB using limited resources, a CAS message which must transmit in each service channel can cause problems. It is desirable that system transmits the CAS message which transmitted by each service channel through logical CAS message-only channel. In order to make a logical CAS message channel, we need a multiplexing techniques for CAS message using in each channel. In this paper, we design the CAS message multiplexing techniques for composition of CAS message-only channel.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.6
• /
• pp.2240-2254
• /
• 2021

We investigate the channel allocation problem in an ultra-dense device-to-device (D2D) enabled cellular network in underlaying mode where multiple D2D users are forced to share the same channel. Two kinds of low complexity solutions, which just require partial channel state information (CSI) exchange, are devised to resolve the combinatorial optimization problem with the quality of service (QoS) guaranteeing. We begin by sorting the cellular users equipment (CUEs) links in sequence in a matric of interference tolerance for ensuring the SINR requirement. Moreover, the interference quota of CUEs is regarded as one kind of communication resource. Multiple D2D candidates compete for the interference quota to establish spectrum sharing links. Then base station calculates the occupation of interference quota by D2D users with partial CSI such as the interference channel gain of D2D users and the channel gain of D2D themselves, and carries out the channel allocation by setting different access priorities distribution. In this paper, we proposed two novel fast matching algorithms utilize partial information rather than global CSI exchanging, which reduce the computation complexity. Numerical results reveal that, our proposed algorithms achieve outstanding performance than the contrast algorithms including Hungarian algorithm in terms of throughput, fairness and access rate. Specifically, the performance of our proposed channel allocation algorithm is more superior in ultra-dense D2D scenarios.