• Journal of the Korea Society of Computer and Information
• /
• v.17 no.12
• /
• pp.121-129
• /
• 2012

In this paper, we proposed WBAN system model to management an application that requires low rate data transfer in IEEE 802.15.4. We have to use different wireless sensor network technology to transfer different date rate and emergency message in medical application service. A suitable system model for WBAN and a WBAN MAC protocol in order to solve these existing system problems are proposed. Firstly, the priority queuing was applied to contention access period, and the system model which could guarantee transmission of a MAC command frame was proposed. Secondly, the MAC frame was newly defined to use the system model which was proposed above. Thirdly, WBAN CSMA/CA back-off algorithm based on data transmission rate was proposed to enhance data throughput and transmission probability of the data frame which does not have priority in the proposed WBAN system. The proposed algorithm is designed to be variable CSMA/CA algorithm parameter, depending on data rate. For the evaluation of WBAN CSMA/CA algorithm, we used Castalia. As a result of the simulation, it is found that the proposed system model can not only relieve loads of data processing, but also probability of collision was decreased.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.6B
• /
• pp.464-473
• /
• 2012

In this paper, we derive the gain of network coding when it is utilized for retransmission in wireless networks. To the end, we derive the outage probability of the network-coded transmission and express the diversity order as a function of the number of nodes and the node's listening probability. From the outage probability, we formulate the ${\epsilon}$-outage capacity. The network-coding gain is the ratio of the ${\epsilon}$-outage capacities between network-coded and non-coded transmissions. Under our system model, we find that the network-coding gain is a function of the diversity order. Moreover, when there are infinitely many nodes, we show that the network coding gain approaches $0.25{\epsilon}^{-1}$.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.11
• /
• pp.5218-5233
• /
• 2018

The coexisting wireless body area networks (WBAN) is a very challenging issue because of strong inter-networks interference, which seriously affects energy consumption and spectrum utilization ratio. In this paper, we study a power control strategy with nearest neighbor nodes distribution for coexisting WBAN based on stochastic geometry. Using homogeneous Poisson point processes (PPP) model, the relationship between the transmission power and the networks distribution is analytically derived to reduce interference to other devices. The goal of this paper is to increase the transmission success probability and throughput through power control strategy. In addition, we evaluate the area spectral efficiency simultaneously active WBAN in the same channel. Finally, extensive simulations are conducted to evaluate the power control algorithm.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.27 no.4
• /
• pp.77-82
• /
• 2004

Being in an internet era, the rapid transmission of 3D mesh models is getting more important and efforts toward the compression of various aspects of mesh models have been provided. Even though a mesh model usually consists of coordinates of vertices and properties such as colors and normals, topology plays the most important part in the compression of other information in the models. Despite the extensive studies on Edgebreaker, the most frequently used and rigorously evaluated topology compressor, the probability distribution of its five op-codes, C, R, E, S, and L, has never been rigorously analyzed yet. In this paper, we present probability distribution of the op-codes which is useful for both the optimization of the compression performance and a priori estimation of compressed file size.

• Journal of Communications and Networks
• /
• v.17 no.5
• /
• pp.499-505
• /
• 2015

We analyze the performance of multistage cooperation in decode-and-forward relay networks where the transmission between source and destination takes place in $T{\geq}2$ equal duration and orthogonal time phases with the help of relays. The source transmits only in the first time phase. All relays that can decode the source's transmission forward the source's message to the destination in the second time phase, using a space-time code. During subsequent time phases, the relays that have successfully decoded the source message using information from all previous transmitting relays, transmit the space-time coded symbols for the source's message. The non-decoding relays keep accumulating information and transmit in the later stages when they are able to decode. This process continues for T cooperation phases. We develop and analyze the outage probability of multistage cooperation protocol under orthogonal relaying. Through analytical results, we obtain the near-optimal placement strategy for relays that gives the best performance when compared with most other candidate relay location strategies of interest. For different relay network topologies, we also investigate an interesting tradeoff between an increased SNR and decreased spectral efficiency as the number of cooperation stages is increased. It is also shown that the largest multistage cooperation gain is obtained in the low and moderate SNR regime.

• Journal of Communications and Networks
• /
• v.12 no.6
• /
• pp.616-623
• /
• 2010

In this paper, exact closed-form expressions for outage probability and bit error probability (BEP) are presented for multi-hop decode-and-forward (DF) relaying schemes in conjunction with cooperative diversity, in which selection combining technique is employed at each node. We have shown that the proposed protocol offers remarkable diversity advantage over direct transmission as well as the conventional DF relaying schemes with the same combining technique. We then investigate the system performance when different diversity schemes are employed. It has been observed that the system performance loss due to selection combining relative to maximal ratio combining is not significant. Simulations are performed to confirm our theoretical analysis.

• Journal of Communications and Networks
• /
• v.10 no.1
• /
• pp.28-37
• /
• 2008

In this paper, we investigate the problem of minimizing the average transmission power of users while guaranteeing the average delay constraints in time-varying uplink channels. We design a scheduler that selects a user for transmission and determines the transmission rate of the selected user based on the channel and backlog information of users. Since it requires prohibitively high computation complexity to determine an optimal scheduler for multi-user systems, we propose a low-complexity scheduling scheme that can achieve near-optimal performance. In this scheme, we reduce the complexity by decomposing the multiuser problem into multiple individual user problems. We arrange the probability of selecting each user such that it can be determined only by the information of the corresponding user and then optimize the transmission rate of each user independently. We solve the user problem by using a dynamic programming approach and analyze the upper and lower bounds of average transmission power and average delay, respectively. In addition, we investigate the effects of the user selection algorithm on the performance for different channel models. We show that a channel-adaptive user selection algorithm can improve the energy efficiency under uncorrelated channels but the gain is obtainable only for loose delay requirements in the case of correlated channels. Based on this, we propose a user selection algorithm that adapts itself to both the channel condition and the backlog level, which turns out to be energy-efficient over wide range of delay requirement regardless of the channel model.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.8
• /
• pp.3366-3383
• /
• 2020

The Poisson point process (PPP) is widely used in wireless network modeling and performance analysis because it can provide tractable results for heterogeneous cellular networks (HetNets) analysis. However, it cannot accurately reflect the spatial distribution characteristics of the actual base stations (BSs). Considering the fact that the distribution of macro base stations (MBSs) is exclusive, the deployment of MBSs is modeled by the Matérn hard-core point process (MHCPP), and the deployment of pico base stations (PBSs) is modeled by PPP. This paper studies the performance of multiantenna HetNets and improves the energy efficiency (EE) of HetNets by optimizing the transmit power of PBSs. We use a simple approximate method to study the signal-to-interference ratio (SIR) distribution in two-tier MHCPP-PPP HetNets and derive the coverage probability, average data rate and EE of HetNets. Then, an optimization algorithm is proposed to improve the EE of HetNets. Finally, three transmission technologies are simulated and analyzed. The results show that multiantenna transmission has better system performance than single antenna transmission and that selecting the appropriate transmit power for a PBS can effectively improve the EE of the system. In addition, two-tier MHCPP-PPP HetNets have higher EE than two-tier PPP-PPP HetNets.

• Journal of Information Processing Systems
• /
• v.16 no.6
• /
• pp.1261-1270
• /
• 2020

The physical security layer of industrial wireless sensor networks in the event of an eavesdropping attack has been investigated in this paper. An optimal sensor selection scheme based on the maximum channel capacity is proposed for transmission environments that experience Nakagami fading. Comparing the intercept probabilities of the traditional round robin (TRR) and optimal sensor selection schemes, the system secure performance is analyzed. Simulation results show that the change in the number of sensors and the eavesdropping ratio affect the convergence rate of the intercept probability. Additionally, the proposed optimal selection scheme has a faster convergence rate compared to the TRR scheduling scheme for the same eavesdropping ratio and number of sensors. This observation is also valid when the Nakagami channel is simplified to a Rayleigh channel.

• Journal of Internet Computing and Services
• /
• v.9 no.2
• /
• pp.25-33
• /
• 2008

In this paper we propose uplink packet transmission scheme based on Synchronized RA. The scheme can afford to support diverse QoS required from diverse multimeda traffics. In order to minimze the collision probability occurred in contention based channel access, we assign a reservation access channel additionally to the traffic channels. Access probability function for controlling collisions occurred in the reservation access channel is applied. Through assigning different access probability to each traffic user with respect to priority issued by his required QoS, the proposed scheme guarantees minimum throughput required by higher priority users in the whole range of system load.