• Journal of information and communication convergence engineering
• /
• v.5 no.2
• /
• pp.88-92
• /
• 2007

In this paper, an SS-RRA protocol that is based on Code Division Multiple Access is proposed and analyzed under the integrated voice and data traffic load. The backward logical channels consist of slotted time division frames with multiple spreading codes per slot. The protocol uses a reservation mechanism for the voice traffic, and a random access scheme for the data traffic. A discrete-time, discrete-state Markov chain is used to evaluate the performance. The numerical results show that the performance can be significantly improved by a few distinct spreading codes.

• Journal of Communications and Networks
• /
• v.6 no.1
• /
• pp.9-18
• /
• 2004

Self-encoded multiple access (SEMA) is a unique realization of random spread spectrum. As the term implies, the spreading code is obtained from the random digital information source instead of the traditional pseudo noise (PN) code generators. The time-varying random codes can provide additional security in wireless communications. Multi-rate transmissions or multi-level grade of services are also easily implementable in SEMA. In this paper, we analyze the performance of SEMA in additive white Gaussian noise (AWGN) channels and Rayleigh fading channels. Differential encoding eliminates the BER effect of error propagations due to receiver detection errors. The performance of SEMA approaches the random spread spectrum discussed in literature at high signal to noise ratios. For performance improvement, we employ multiuser detection and Turbo coding. We consider a downlink synchronous system such as base station to mobile communication though the analysis can be extended to uplink communications.

• Proceedings of the IEEK Conference
• /
• summer
• /
• pp.35-38
• /
• 2004

The MAC protocol of HIPERLAN/2 is based on TDMA/TDD and AP (Access Point) can dynamically allocate the number of RCHs (Random CHannels). We propose a dynamic random channel allocation scheme improved by limiting the number of minimum RCHs. On a simulated scenario adopted practical Internet traffic, the proposed scheme is shown to achieve over $19\%$ lower delay than previously studied algorithm. This study will be a first step towards designing scope of RCHs for high-performance wireless packet network

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.5B
• /
• pp.365-377
• /
• 2006

We define the incomplete medium sharing system as a multi-channel shared medium communication system where any types of constraints are imposed to the set of channels that may be allocated to any transmitter-receiver node pair. A set of distributed MAC schemes are proposed, all of which are based on the CSMA/CA scheme employed in IEEE 802. 11 WLAN standards. Distributed MAC schemes are proposed in three different forms, which can be differentiated by the number and the location of back-off timers; that is, (1) one timer for all queues destined for different receiver nodes, (2) multiple timers at individual transmission queues, (3) multiple timers for individual channels. Through an extensive set of computer simulations, the performances of the proposed MAC schemes show that the MAC scheme with timers at individual transmission queues outperform the others in terms of throughput and delay for most cases considered. The complexity of the proposed schemes is also compared, and the first scheme obviously turned out to be the simplest, and the complexity of the second and third schemes depends on the number of receiver nodes and the number of channels, respectively.

• The Transactions of the Korean Institute of Electrical Engineers P
• /
• v.63 no.2
• /
• pp.81-88
• /
• 2014

In this paper, an implementation of concurrent backoff delay process on a single chip with IEEE 802.15.4 hardware and 8051 processor core that can be used for analyzing the interference on IEEE 802.15.4 channels due to WiFi traffics is studied. The backoff delay process of IEEE 802.15.4 CSMA-CA algorithm is explained. The characteristics of random number generator, timer, and CCA register included in the single chip are described with their control procedure in order to implement the process. A concurrent backoff delay process to evaluate multiple IEEE 802.15.4 channels is proposed, and a method to service the associated tasks at sequentially ordered backoff delay events occurring on the channels is explained. For the implementation of the concurrent backoff delay process on a single chip IEEE 802.15.4 hardware, the elements for the single channel backoff delay process and their control procedure are used to be extended to multiple channels with little modification. The medium access delay on each channel, which is available after execution of the concurrent backoff delay process, is displayed on the LCD of an IEEE 802.15.4 channel analyzer. The experimental results show that we can easily identify the interference on IEEE 802.15.4 channels caused by WiFi traffics in comparison with the way displaying measured channel powers.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.1A
• /
• pp.58-64
• /
• 2009

In this paper, we propose an dynamic random channel allocation scheme increasing probability of channel acquisition and reducing delay by limiting the number of minimum RCHs(Random CHannels) as an optimal factor $\beta$. The MAC protocol of HIPERLAN/2 is based on TDMA/TDD and MT(Mobile Terminal) can obtain chance of traffic transmission through channel competition in RCH period. And AP(Access Point) can dynamically schedule the number of RCHs based on the number of the collision in each RCH of the previous frame. Therefore, the proposed scheme increases a probability of channel acquisition and reduces delay by means of guaranteeing the number of minimum RCHs. With a practical Internet traffic, it is concluded that by the proposed scheme the delay reduction of the order of 19% and slightly better throughput are obtained compared to the conventional algorithm.

• Journal of Digital Contents Society
• /
• v.12 no.3
• /
• pp.347-353
• /
• 2011

In HIPERLAN/2, the radio channels are assigned by AP(Access Point) that is centrally operated and the MAC protocol is based on TDMA/TDD. Mobile terminal that data transmission is necessary to uplink requests radio resource to AP through RCH channel. The changing number of RCHs in each MAC frame is important because too many RCHs may result in a waste of radio resources and too few RCHs may result in many access collisions and prolong time that connect to AP. Hence the number of RCH should be allocated properly according to traffic. From these point, this paper proposes an scheme that dynamically assigned the number of RCH which is based on the number of success and collision of message in previous MAC frame. To prove efficiency of proposed scheme, lots of simulations are conducted and analyzed.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.2 no.3
• /
• pp.325-333
• /
• 1998

In this paper, conventional STM(Synchronous Transfer Mode) supports another traffics by using idle channels. Proposed mobile terminals are distributed independently at the BSA(Basic Service Area). So, MAC(Medium Access Control) specified on the wireless ATM networks, which is managing statistics multiplewing functions, idle channel's ultilization is maximized and multimedia service characteristic for conventional wired networks based fixed assignment scheme(connection-oriented) and random assignment scheme(connection-oriented) improving on dynamic reservation based MAC protocol.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 1998.05a
• /
• pp.132-137
• /
• 1998

In this paper, conventional STM(Synchronous Transfer Mode) supports another traffics by using idle channels Proposed mobile terminals are distributed independently at the BSA(Basic Service Area). So, MAC(Medium Access Control) specified on the wireless ATM networks, which is managing statistics multiplexing functions, idle channel's utilization is maximized and multimedia service characteristic for conventional wired networks based fixed assignment scheme(connection-oriented) and random assignment scheme(connectionless) improving on dynamic reservation based MAC protocol.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.10A
• /
• pp.816-829
• /
• 2003

In this paper, we evaluate the performance of PN (Pseudo Noise) code based time hopping sequences for M-ary UWB (Ultra Wide Band) multiple access systems using the equicorrelated signal sets. In particular, we consider two different types of M-ary UWB systems in UWB indoor wireless multipath channels: The first type of the systems (System #1) has identical symbol transmission rate regardless of the number of symbols M since the length of signal pulse train is fixed while M increases, and the second type of the systems (System #2) has the same bit transmission rate regardless of M since the length of signal pulse train is extended according to the increase of M. We compare the proposed systems with those using the ideal random time hopping sequence in terms of the symbol error rate performance. Simulation results show that the PN code based time hopping sequence achieves quite good performance which is favorably comparable to that of the ideal random sequence. Moreover, as M increases, we observe that System #2 shows better robustness against multiple access interference than System # 1.