• Journal of Communications and Networks
• /
• v.15 no.3
• /
• pp.312-320
• /
• 2013

Home evolved Node-B (HeNB), also called a femtocell or a femto base station, is introduced to provide high data rate to indoor users. However, two main problems arise in femtocell networks: (1) Small coverage area of HeNB, which results in limited cell-splitting gain and ping-pong handover (HO) problems and (2) high inter-femtocell interference because HeNBs may be densely deployed in a small region. In this study, an efficient cooperation mechanism called an HeNB-aided virtual-HO (HaVHO) scheme is proposed to expand the coverage area of femtocells and to reduce inter-femtocell interference. The cooperation among neighbor HeNBs is exploited in HaVHO by enabling an HeNB to relay the data of its neighbor HeNB without an HO. The HaVHO procedure is compatible with the existing long term evolution specification, and the information exchange overhead in HaVHO is relatively low. To estimate the signal to interference plus noise ratio improvement, the area average channel state metric is proposed, and the amount of user throughput enhancement by HaVHO is derived. System-level simulation shows that HaVHO has a better performance than the other four schemes, such as lesser radio link failure, lesser ping-pong handover, lesser short-stay handover, and higher user throughput.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.46 no.2
• /
• pp.36-43
• /
• 2009

In this paper, we propose a Cooperative Routing using ARQ-based Transmission (CRARQ) in Mobile Ad-hoc Wireless Sensor Networks (MAWSN). The goals of the CRARQ are to improve both the efficiency of transmission and the reliability of transmission together. The main features and contributions of the proposed CRARQ for supporting these goals are as follows. First, CRARQ uses a reactive concept to construct a route from a source to a destination. Second, CRARQ chooses the most stable relay at each hop along the route by mobility-based strategy. Third, cooperative transmission using the ARQ technique which can improve reliability is used at each hop to send data packets from source to destination. Finally, we present a theoretical analysis model for the proposed CRARQ. The performance evaluation of our protocol is implemented via simulation using Optimized Network Engineering Tool (OPNET) and analysis. The results of both simulation and analysis show that CRARQ achieves the improved packet delivery ratio (PDR) and outage probability.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.8B
• /
• pp.904-909
• /
• 2011

Cell zooming adjusts the cell range of base stations depending on traffic condition. The cell zooming can be implemented by the adjustment of antenna angles, the clustering of the base stations, and the cell relay. The base stations can adjust the cell range in term of energy efficiency, which can then reduce the overall energy consumption of cellular networks. There is, however, a trade-off between the energy savings and the blocking probability of user calls. A periodic scheme that manages the cell zooming of the base stations was proposed but it was inadequate for dealing with the dynamic nature of traffic patterns. This paper proposes a semi-periodic cell zooming scheme along with the algorithms that select such base stations and define the operation procedure. Simulation results show that the proposed method outperforms the existing scheme in terms of the energy savings without the degradation of the blocking probability.

• Journal of Communications and Networks
• /
• v.14 no.5
• /
• pp.524-532
• /
• 2012

In this paper, we present the performance evaluation of the reliable cooperative media access control (RCO-MAC) protocol, which has been proposed in [1] by us in order to enhance system throughput in bad wireless channel environments. The performance of this protocol is evaluated with computer simulation as well as mathematical analysis in this paper. The system throughput, two types of average delays, average channel access delay, and average system delay, which includes the queuing delay in the buffer, are used as performance metrics. In addition, two different traffic models are used for performance evaluation: The saturated traffic model for computing system throughput and average channel access delay, and the exponential data generation model for calculating average system delay. The numerical results show that the RCO-MAC protocol proposed by us provides over 20% more system throughput than the relay distributed coordination function (rDCF) scheme. The numerical results show that the RCO-MAC protocol provides a slightly higher average channel access delay over a greater number of source nodes than the rDCF. This is because a greater number of source nodes provide more opportunities for cooperative request to send (CRTS) frame collisions and because the value of the related retransmission timer is greater in the RCO-MAC protocol than in the rDCF protocol. The numerical results also confirm that the RCO-MAC protocol provides better average system delay over the whole gamut of the number of source nodes than the rDCF protocol.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.11
• /
• pp.2187-2192
• /
• 2016

A data-centric routing protocol considering a data aggregation technique at relay nodes is required to increase the lifetime of wireless sensor networks. An energy-efficient data-centric routing algorithm is proposed by considering a tradeoff between acquisition time and energy consumption in the wireless sensor network. First, the proposed routing scheme decides the sink node among all sensor nodes in order to minimize the maximum distance between them. Then, the proposed routing extends its tree structure in a way to minimize the link cost between the connected nodes for reducing energy consumption while minimizing the maximum distance between sensor nodes and a sink node for rapid information gathering. Simulation results show that the proposed data-centric routing algorithm has short information acquisition time and low energy consumption; thus, it achieves high energy efficiency in the wireless sensor network compared to conventional routing algorithms.

• Journal of Advanced Navigation Technology
• /
• v.11 no.4
• /
• pp.461-472
• /
• 2007

In Ubiquitous Sensor Network (USN), the sensor nodes are required to consume their energy evenly to prolong the lifetime of the entire sensor network because of the limited energy of the sensor node. AODV which is applied to USN as routing protocol selects route according to only the shortest distance of the minimum hop count but regardless of the remaining battery power for each node. Thus it comes to ill-balanced power consumption seriously. In this paper, a scheme that controls packet relay quantity of each sensor node adaptively to prevent traffic overhead at a certain node and to increase the entire network lifetime is proposed. As it is analyzed by simulations, the proposed scheme enhances USN lifetime by balancing each sensor node's packet relay quantity.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.10
• /
• pp.4844-4864
• /
• 2017

Interference-aware routing protocol design for underwater wireless sensor networks (UWSNs) is one of the key strategies in reducing packet loss in the highly hostile underwater environment. The reduced interference causes efficient utilization of the limited battery power of the sensor nodes that, in consequence, prolongs the entire network lifetime. In this paper, we propose an energy-efficient interference-aware routing (EEIAR) protocol for UWSNs. A sender node selects the best relay node in its neighborhood with the lowest depth and the least number of neighbors. Combination of the two routing metrics ensures that data packets are forwarded along the least interference paths to reach the final destination. The proposed work is unique in that it does not require the full dimensional localization information of sensor nodes and the network total depth is segmented to identify source, relay and neighbor nodes. Simulation results reveal better performance of the scheme than the counterparts DBR and EEDBR techniques in terms of energy efficiency, packet delivery ratio and end-to-end delay.

• The KIPS Transactions:PartC
• /
• v.13C no.5 s.108
• /
• pp.601-606
• /
• 2006

Decode-and-forward cooperative communications protocol (DFP) allows single-antenna users in wireless medium to obtain the powerful benefits of multi-antenna systems without physical antenna arrays. For this protocol, so far the relays have used SNR to evaluate the reliability of the received signal before deciding whether to forward the decoded data so as to prevent their unsuccessful detection. However, SNR only characterizes the long-term statistic of Gaussian noise and thus leading to inaccurate assesment. Therefore, we propose using log-likelihood ratio (LLR) which accounts for the instantaneous noise in the received signal as an alternative to SNR. A variety of simulation results reveal the significant superiority of the SNR-based DFP to the SNR-based DFP regardless of threshold level and relay position under the flat Rayleigh fading channel plus AWGN (Additive White Gaussian Noise).

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.4
• /
• pp.721-727
• /
• 2016

In this paper, in order to resolve the problem of reduction for D2D (device to device) advertisement dissemination efficiency of conventional dissemination algorithms, we here propose several clustering algorithms (modified single linkage algorithm (MSL), K-means algorithm, and expectation maximization algorithm with Gaussian mixture model (EM)) based advertisement dissemination algorithms to improve advertisement dissemination efficiency in D2D communication networks. Target areas are clustered in several target groups by the proposed clustering algorithms. Then, D2D advertisements are consecutively distributed by using a routing algorithm based on the geographical distribution of the target areas and a relay selection algorithm based on the distance between D2D sender and D2D receiver. Via intensive MATLAB simulations, we analyze the performance excellency of the proposed algorithms with respect to maximum number of relay transmissions and D2D user density ratio in a target area and a non-target area.

• Journal of the Korea Society for Simulation
• /
• v.21 no.2
• /
• pp.51-58
• /
• 2012

In IEEE 802.16j MMR protocol, two modes about usage of RS are proposed; one is transparent mode to enhance data throughput and the other is non-transparent mode to extend coverage. In this paper, we focus on non-transparent mode and find that the mode can also improve data throughput. Therefore, we analyze data throughput on various RS topology and their extended coverage area by simulation in IEEE 802.16j non-transparent mode. We also compare the simulation results with the single MR-BS system of which coverage is extended by higher transmission power. From the comparisons of simulation results, we see that higher throughput can be obtained in the proposed non-transparent mode.