• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.10 no.2
• /
• pp.184-191
• /
• 2017

This paper presents cluster based hybrid spectrum sensing system for M2M services. For each cluster, secondary nodes within the transmission radius of the primary node use hard decision method through local spectrum sensing to determine whether the primary node exists. And the other secondary nodes and the secondary nodes having poor radio channel conditions judge the existence of the primary node through the soft decision method of the values obtained by performing the cooperative spectrum sensing. In the proposed hybrid spectrum sensing system, the performance according to the number of secondary nodes is analyzed with the conventional system over Rayleigh fading channel. As the number of cooperative sensing users increased to 2, 3 and 4, the cluster error probability decreased to 0.5608, 0.5252 and 0.4001 at SNR of -10[dB] respectively. Since the proposed system uses less overhead traffic, it is found that it is more effective in terms of frequency usage than the conventional system using soft decision-soft decision and soft decision-hard decision methods.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.8A
• /
• pp.787-793
• /
• 2008

3GPP evolved packet system (EPS) is an all-IP based system that supports various access networks such LTE, HSPA/HSPA+, and non-3GPP networks. Recently, the support of IP flows with packet level QoS profiles was added to the requirements of the EPS. This paper proposes an adaptive modulation and coding (AMC) scheme that supports the QoS of such IP flows in the 3G LTE access network of the EPS. Defining the retransmission as a critical factor for QoS, the proposed scheme applies different maximum packet error probability $P_{max}$ to each packet when selecting the AMC transmission mode. In determining $P_{max}$, the QoS constraints and NACK-to-ACK error as well as channel condition are considered, balancing two objectives: the satisfaction of the QoS and the maximization of spectral efficiency. The simulation results show that it is able to reduce both delay violation and status report by 10%, while improving the throughput 10% in comparison with an existing scheme.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.7
• /
• pp.1026-1031
• /
• 2022

Cognitive Radio Ad-Hoc Networks (CRAHNs) enable to overcome the shortage of frequency resources due to the increase of radio services. In order to avoid interference with the primary user in CRANH, channel sensing to check the idle channel is required, and when the primary user appears, the time delay due to handover should be minimized through fast idle channel selection. In this paper, throughput was improved by reducing the number of channel sensing and preferentially sensing a channel with a high probability of being idle, using reinforcement learning. In addition, we proposed a multi-channel MAC (Medium Access Control) protocol that can minimize the possibility of collision with the primary user by sensing the channel at the time of data transmission without performing periodic sensing. The performance was compared and analyzed through computer simulation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.7
• /
• pp.989-998
• /
• 1993

In a bursty user traffic mode, ALOHA random multiple access protocol achieves higher performance than any conventional fixed assignment technique. One of central problems in slotted ALOHA is synchronization. Because of the long propagation delay in satellite mobile communication, packet may be spilt over into adjacent slots and thus guard time may be included between packet intervals. In conventional ALOHA channels, simultaneous transmission by two or more users results in a collision : the unsuccessful packets have to be retransmitted according to some retransmission algorithm. However, in a radio environment, users are often at different distances from the receiver : therefore, their received signals have substantially different power levels. The packet arriving with the highest energy now has a good chance of being detected accurately. Similarly, in some spread-spectrum random access systems, the earliest arriving packet dominates later arriving packets and thus captures the channel. In this paper slotted ALOHA channel with non zero guard time and capture probability is studied. Using the Markovian model, the performance of slotted ALOHA with guard time and capture effects is derived and compared with that of the conventional ALOHA via numerical analysis.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.1B
• /
• pp.86-100
• /
• 2004

To provide the end-to-end service differentiation for assured services, the random early demotion and promotion (REDP) marker in the edge router at each domain boundary monitors the aggregate flow of the incoming in-profile packets and demotes in-profile packets or promotes the previously demoted in-profile packets at the aggregate flow level according to the negotiated interdomain service level agreement (SLA). The REDP marker achieves UDP fairness in demoting and promoting packets through random and early marking decisions on packets. But, TCP fairness of the REDP marker is not obvious as for UDP sources. In this paper, to improve TCP fairness of the REDP marker, we propose a modified REDP marker where we combine a dropper, meters and a token filling rate configuration component with the REDP marker. To make packet transmission rates of TCP flows more fair, at the aggregate flow level the combined dropper drops incoming excessive in-profile packets randomly with a constant probability when the token level in the leaky bucket stays in demotion region without incoming demoted in-profile packets. Considering the case where the token level cannot stay in demotion region without the prior demotion, we propose a token filling rate configuration method using traffic meters. By using the token filling rate configuration method, the modified REDP marker newly configures a token filling rate which is less than the negotiated rate determined by interdomain SLA and larger than the current input aggregate in-profile traffic rate. Then, with the newly configured token filling rate, the token level in the modified REDP marker can stay in demotion region pertinently fir the operation of the dropper to improve TCP fairness. We experiment with the modified REDP marker using ns2 simulator fur TCP sources at the general case where the token level cannot stay in demotion region without the prior demotion at the negotiated rate set as the bottleneck link bandwidth. The simulation results demonstrate that through the combined dropper with the newly configured token filling rate, the modified REDP marker also increases both aggregate in-profile throughput and link utilization in addition to TCP fairness improvement compared to the REDP marker.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.7A
• /
• pp.757-767
• /
• 2008

Start Ongoing next generation networks are expected to be deployed over current existing networks, in the form of overlayed heterogeneous networks, in particular, in hot spot areas. Therefore, it will be necessary to develop an interworking technique such as load balancing, to achieve increased overall resource utilization in the various heterogeneous networks. In this paper, we present a new load balancing mechanism termed 'soft' load balancing where the IP(Internet Protocol) traffic of a user is divided into sub-traffic, each of which flows into a different access network. The terminology of soft load balancing involves the use of both load sharing and handover techniques. Through a numerical analysis, we obtain an optimal LBR (Load Balancing Ratio) for determining the volume of traffic delivered to each network over an overlayed multi-cell environment. Using the optimal LBR, a more reliable channel transmission can be achieved by reducing the outage probability efficiently for a given user traffic.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.3B
• /
• pp.165-173
• /
• 2012

In this paper, we propose a random backoff scheme for Emergency Warning Messages (EWMs) in the vehicle-to-vehicle environment. The EWMs are disseminated from a vehicle that detects an emergency situation to other vehicles in a multi-hop fashion. Since the vehicle-to-vehicle communication based on IEEE 802.11 adapts CSMA/CA, the density of vehicles increase the probability of collisions between transmissions. Moreover, in the presence of background traffic, the EWM should have a higher priority than that of other messages in neighboring vehicles. To that end, we propose the Distant-Dependent Adaptive Backoff (DDAB) scheme, which set a different contention window for random backoff depending on the distance from the sender to the receiver. In the case when a vehicle is expected to located in the outskirts of the communication boundary, the proposed scheme makes the contention window size small in order to compete the background traffic transmission. Otherwise the contention window is set to a large number to reduce the collision possibility among the EWM transmissions. Via simulations, we show that the proposed scheme performs better than the previous schemes for EWM.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.30 no.1
• /
• pp.29-37
• /
• 2020

Work to improve network throughput has been focused on network coding as the utilization of IoT-based application services increases and network usage increases rapidly. In network coding, nodes transform packets received from neighboring nodes into a combination of encoded packets for transmission and decoding at the destination. This scheme is based on trust among nodes, but in the IoT environment where nodes are free to join, a malicious node can fabricate the packet if it legally participates in the configuration. It is difficult to identify the authenticity of the encoded packet since the packet received at destination is not a single source but a combination of packets generated by several nodes. In this paper, we propose a method to detect "look-like-valid" packets that have been attacked and disguised in packets received at destination, and to identify valid messages in the reconstructions. This method shows that network coding performance is significantly improved because the destination can reconstruct a valid message with only received packets without retransmission with a high probability, despite the presence of disguised packets.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.7
• /
• pp.1589-1598
• /
• 2014

To support the WBAN, IEEE 802.15 Task Group 6 announced standardized documents on technical requirements of the PHY and MAC. In the IEEE 802.15.6 MAC protocol, CSMA/CA(Carrier Sense Multiple Access with Collision Avoidance) algorithm is performed based on the eight-level priorities according to the type of traffics of the periodic data from medical sensor nodes. Several nodes, which detected the changed bio signals, transmit emergency data at the same time, so latency could be higher than emergency latency and energy consumption will increase. In this thesis, we proposed a CSMA/CA algorithm in WBAN to solve these problems. Simulations are performed using a Castalia based on the OMNeT++ network simulation framework to estimate the performance of the proposed superframe and algorithms. Performance evaluation results show that the packet transmission success rate and energy efficiency are improved by reducing the probability of collision using the proposed MAC protocol.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.11A
• /
• pp.831-843
• /
• 2009

In this paper, we propose a new adaptive cooperation scheme with multi-relay nodes which achieves higher performance and spectral efficiency than that of some conventional cooperative schemes. The relay-selection is applied to choose the most potential relay among K ones. Afterward, the instantaneous signal-to-noise ratio (SNR) differences between S-D, S-R and R-D channels are considered for adaptive selection between the direct and the cooperation transmission strategy. In the proposed adaptive protocol, if the direct link is of high quality, the source will transmit to destination directly with all power consumption. Otherwise, the source broadcasts the signal with a lower power and requires the help of the chosen relay if it decodes correctly, else the source will transmit again with remaining power. Firstly, the spectral efficiency is derived by calculating the probability of each mode. Subsequently, the BER performance for the adaptive cooperation scheme is analyzed by considering each event that one of K relays is selected and then making the summation of all. Finally, the numerical results are presented to confirm the performance enhancement offered by the proposed schemes.