• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.12
• /
• pp.2664-2673
• /
• 1997

The signal fading distortion has effect on the capacity of cellular mobile communication systems. The short term fading is solved by signal processing techniques depending on the radio communication methods, but another distortion compensation techniques are necessary to combat long term fading. in this paper, we have simulated the call processing in DS-CDMA system using distributed antennas to overcome the long term fading. From the simulation results, we have conformed that the blocking probability of a new call andthe forced probability of handoff-request-call have decreased by increasing the number of distributed antennas.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.12B
• /
• pp.1498-1505
• /
• 2009

In centralized control sensor network, tree-based multi-channel communication overcomes the recurrent channel switching and makes possible to transfer data simultaneously from different sources. In our paper, we propose a greedy algorithm named as NIT (Non-Intersecting Tree) that the trees can avoid inter-tree interference. We also propose channel switching technique by which trees can avoid link failure or area blocking due to external interference locally without rerunningthe algorithm and without interrupting the whole network. At first we applied our algorithm for a random topology and then we evaluate the performance of the network using NS-2 simulator. The results show that with the increasing of channel the throughputand delivery ratio are increased significantly. We got better performance than a using a recent proposed Tree-based Multi-Channel Protocol (TMCP).

• Journal of Internet Technology
• /
• v.20 no.1
• /
• pp.301-313
• /
• 2019

In this paper, we propose a new MAC protocol for Cognitive Radio (CR)-based IoT networks, called MSMA/CA. We extend the standard CSMA/CA, adopted in IEEE 802.11 WLANs, to the CR networks with the minimal modification since it works well in the real world. We resolve the classical hidden/exposed terminal problems by a variant of RTS/CTS mechanism and further, the hidden primary terminal problem by the mutual spectrum sensing at the transmitter and the receiver. We also modify the backoff process of CSMA/CA to incorporate the blocking of secondary transmitters, with the aim of protecting ongoing primary transmissions from aggressive secondary users. We analyze the throughput and delay of our proposed scheme using the Markov chain model on the backoff procedure, and verify its accuracy by simulations. Simulation results demonstrate that our protocol is suitable for IoT networks since the performance is insensitive to the number of users or devices.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.38 no.12
• /
• pp.20-28
• /
• 2001

In this paper, a extended blocking probability formula for reverse link of a DS/CDMA cellular system supporting voice and data service is derived in Rayleigh fading channel. Also, voice and data Erlang capacity considering shadowing are analyzed and compared with those considering both shadowing and multipath fading, respectively. Assuming that the blocking probability set 1% in the Rayleigh fading channel, they are observed that voice Erlang capacity of 13.38 Erlangs and data Erlang capacity of 8.92 Erlangs are supported at the data rate $R_b$=9.6 kbps, and voice Erlang capacity of 7.47 Erlangs and data Erlang capacity of 4.98 Erlangs are supported at the data rate $R_b$=14.4 kbps, respectively, and then are less 21.4% for $R_b$=9.6 kbps, 24.9% for $R_b$=14.4 kbps than Erlang capacity considering shadowing only, respectively. It is shown that the effect of multipath fading must not be ignored. Also, it is presented that accurate voice and data Erlang capacity which could be supported by the DS/CDMA cellular system.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.15 no.4
• /
• pp.387-396
• /
• 2004

A scheme to evaluate the number of users and cell coverage of a WCDMA supporting multi-rate traffic is newly presented through calculation of the realizable Erlang capacity from a derived blocking probability and the path loss from the COST231 Walfisch-Ikegami(W) model. We evaluate the voice-data Erlang capacities at various data rates of 15 kbps to 960 kbps and it is shown that they have a linear relationship to each other. When the E$\_$b//N$\_$o/ is low from 4 ㏈ to 3 ㏈ in case of voice capacity of 50 Erlang at 8 kbps, the result shows the increase for the data capacity of 10 Erlang and the enlargement of 100 m for the cell coverage at low rate of 15 kbps, and the increase of 0.11 Erlang and the enlargement of 40 m at high rate of 960 kbps. The increase of the blocking probability results in the increase of the Erlang capacity, but not an effect on the cell coverage, and the increase of active users in a cell results in the decrease of the coverage.

• The Journal of the Korea Contents Association
• /
• v.5 no.1
• /
• pp.147-155
• /
• 2005

In this paper, communication channels for the transmission of multimedia packets are modeled and evaluated. The multimedia packet traffic characterized by on-off and MMPP process for voice and data, respectively, dynamic channel allocation, queueing of data packets due to unavailability of channels and dropping of queued data packets over timeout, and guard channel for voice packets are modeled. The performance indices adopted in the evaluation of SRN model includes blocking and dropping probabilities. The SRN uses rewards concepts instead of the complicate numerical analysis required for the Markov chain. It is shown that our SRN modeling techniques provide an easier way to carry out performance analysis.

• Journal of Korea Multimedia Society
• /
• v.16 no.5
• /
• pp.601-609
• /
• 2013

One of the most serious factors constraining the next generation cellular mobile consumer communication systems will be the severe co-channel interference experienced at the cell edge. Such a capacity-degrading impairment combined with the limited available spectrum resource makes it essential to develop more spectrally efficient solutions to enhance the system performance and enrich the mobile user's application services. This paper proposes a unique hybrid method of frequency hopping (FH) and subcarrier-reuse-partitioning that can maximize the system capacity by efficiently utilizing the available spectrum while at the same time reduce the co-channel interference effect. The main feature of the proposed method is that it applies an optimal combination of different frequency reuse factors (FRF) and FH-subcarrier allocation patterns into the partitioned cell regions. From the simulation results, it is shown that the proposed method can achieve the optimum number of subcarrier subsets according to the frequency-reuse distance and results in better performance than the fixed FRF methods, for a given partitioning arrangement. The results are presented in the context of both blocking probability and BER performances. It will also be shown how the proposed scheme is well suited to FH-OFDMA based cellular systems aiming at low co-channel interference performance and optimized number of subcarriers.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.5
• /
• pp.709-735
• /
• 2010

The reciprocal virtue of peer-to-peer networking has stimulated an explosion of peer population and service capacity, ensuring rapid content distribution in peer-to-peer networks. Critical issues such as peer churn, free riding, and skewed workload significantly affect performance results such as service agility, fairness, and resource utilization. To resolve these problems systematically, this study proposes a peer assignment scheme that supports fair peer-to-peer file sharing applications. The proposed scheme exploits the peer duality of both server-oriented peer capacity and client-oriented peer contribution. Accordingly, the system server can prioritize download requests and appropriately assign server peers to uploading file objects. Several functional extensions, including peer substitution and elimination, bandwidth adjustment, and distributed modification, help cope with subtle situations of service starvation and download blocking, and hence make the system design robust and amenable. Simulation results show this design is examined under both centralized and distributed peer-to-peer environments. Performance results confirm that the proposed mechanisms are simple but effective in maintaining service agility and fairness, without loss of overall service capacity in peer-to-peer files sharing systems.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.3
• /
• pp.1-7
• /
• 1989

A new algorithm for frequency channel assignment in high capacity cellular mobile communication systems is proposed. The algorithm is the advanced type of the fixed channel assignment scheme. It enables calls having all nominal channels busy to be served by adjacent cells have idle channels. Thus, it considerably reduces the blocking probability compared with the fixed channel assignment. Simulation has been performed for a 49-cell system having uniform traffic density hexagonal array as a representative system lay out. Results showed that new algorithm is better than the fixed channel assignment scheme in high capacity cellular mobile communication systems.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.3
• /
• pp.493-500
• /
• 1996

As the greater interests are focused onto wireless message transfer, wireless data base access and mobile computing the techniques for integrating various dat a services into the mobile communication systems are seriously needed. In this paper we propose a traffic handing scheme to provide mixed media services more effectively, and analyze is performance. The proposed scheme was found to improve data performances and, regardless of varying data traffic load, provide acceptable level of blocking rate to voice services simultaneouly. Also it is more effective for message-oriented data services.