• Journal of Communications and Networks
• /
• v.12 no.5
• /
• pp.433-441
• /
• 2010

Multihop transmission is a promising technique that helps in achieving broader coverage (excellent network connectivity) and preventing the impairment of wireless channels. This paper proposes a cluster-based multihop wireless network that makes use of the advantages of multihop relaying, i.e., path loss gain, and partial relay selection in each hop, i.e., spatial diversity. In this partial relay selection, the node with the maximum instantaneous channel gain will serve as the sender for the next hop. With the proposed protocol, the transmit power and spectral efficiency can be improved over those in the case of direct transmission and conventional multihop transmission. Moreover, at a high signal-to-noise ratio (SNR), the performance of the system with at least two nodes in each cluster is dependent only on the last hop and not on any of the intermediate hops. For a practically feasible decode-and-forward relay strategy, a compact expression for the probability density function of the end-to-end SNR at the destination is derived. This expression is then used to derive closed-form expressions for the outage probability, average symbol error rate, and average bit error rate for M-ary square quadrature amplitude modulation as well as to determine the spectral efficiency of the system. In addition, the probability of SNR gain over direct transmission is investigated for different environments. The mathematical analysis is verified by various simulation results for demonstrating the accuracy of the theoretical approach.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37B no.12
• /
• pp.1138-1147
• /
• 2012

IEEE standard 802.16, often referred to as WiMAX, is considered a "last mile" broadband wireless access alternative to conventional DSL and Cable Internet. One extension that is recently receiving great attention is the IEEE 802.16j Mobile Multihop Relay (MMR) amendment. The focus of this amendment is the development of simple and lower cost relay stations (RSs) that can enhance network coverage and capacity. We use our proposed simple scheduling scheme for serving the SSs in a fair manner and evaluate the performance of WiMAX networks with relays, especially we analyze the impact of interference between RSs on cell throughput Through simulations and numerical analysis, we make several fundamental observations about interference aware cost effective coverage extension in such networks.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.48 no.1
• /
• pp.45-49
• /
• 2011

Cooperative multihop communications support effective transmissions over underwater acoustic channels as inferior wireless channels. But the performance of cooperative multihop systems may degrade due to the lack of cooperative nodes at the initial operation time duration. At the initial time duration, the lack of cooperative nodes causes more errors, and the multihop network propagates these errors. In this paper, we apply fountain code to the cooperative multihop system at the initial time duration, and show performance improvements by simulations.

• Journal of Communications and Networks
• /
• v.13 no.3
• /
• pp.221-231
• /
• 2011

A joint multipath routing algorithm and channel allocation and scheduling for wireless multihop and multichannel systems is discussed. In packet transmission, distribution of packets to multiroutes makes it possible to reduce the transmission cost of the channels. Cross-layer cooperation of routing, channel allocation, and scheduling is an effective method of packet distribution. As a framework for the cooperation, we propose a multiroute distance vector routing (MDVR) scheme. In the MDVR scheme, the routing table is logically placed in between the routing and link layers, and the table plays the role of a service access point between these two layers. To evaluate the performance of MDVR, simulation is performed in a multichannel, multihop environment. The simulation results show that the MDVR framework can be efficiently implemented in the form of a distributed routing algorithm. It is also shown that in MDVR, the system-wise channel efficiency is almost 25% higher than that in a conventional single-route routing approach.

• Journal of Korea Multimedia Society
• /
• v.14 no.12
• /
• pp.1559-1571
• /
• 2011

In wireless ad hoc networks, nodes communicate with each other using multihop routed transmission in which hop-by-hop cooperative diversity can be effectively employed. This paper proposes (i) two cooperation models for per-link cooperation (PLC) and per-node cooperation (PNC) for exploiting cooperative diversity in wireless ad hoc networks and (ii) a cooperative routing algorithm for the above models in which best relays are selected for cooperative transmission. First, two cooperation models for PLC and PNC are introduced and represented as an edge-weighted graph with effective link quality. Then, the proposed models are transformed into a simplified graph and a cooperative routing algorithm with O(n2) time is developed, where n is the number of nodes in the network. The effectiveness of the algorithm is confirmed for the two cooperation models using simulation.

• ETRI Journal
• /
• v.36 no.6
• /
• pp.960-967
• /
• 2014

In this paper, an analytical framework is proposed for the optimization of network performance through joint congestion control, channel allocation, rate allocation, power control, scheduling, and routing with the consideration of fairness in multi-channel wireless multihop networks. More specifically, the framework models the network by a generalized network utility maximization (NUM) problem under an elastic link data rate and power constraints. Using the dual decomposition technique, the NUM problem is decomposed into four subproblems - flow control; next-hop routing; rate allocation and scheduling; power control; and channel allocation - and finally solved by a low-complexity distributed method. Simulation results show that the proposed distributed algorithm significantly improves the network throughput and energy efficiency compared with previous algorithms.

• Journal of Communications and Networks
• /
• v.17 no.6
• /
• pp.647-655
• /
• 2015

Low-power and lossy networks (LLNs) comprised of thousands of embedded networking devices can be used in a variety of applications, such as smart grid automated metering infrastructures (AMIs) and wireless sensor networks. Connecting these LLNs to the Internet has even greater potential, leading to the emerging concept of the Internet of Things (IoT). With the goal of integrating LLNs into IoT, the IETF has recently standardized RPL and 6LoWPAN to allow the use of IPv6 on LLNs. Although there already exist several studies on the the performance of RPL and embedded IPv6 stack in LLN, performance measurement and characterization of TCP over RPL in multihop LLNs is yet to be studied. In this article, we present a comprehensive experimental study on the performance of TCP over RPL in an embedded IPv6-based LLN running over a 30-node multihop IEEE 802.15.4 testbed network. Our results and findings are aimed at investigating how embedded TCP interoperates with common Linux TCP and underlying RPL (and vice versa), which furthers our understanding of the performance trade-offs when choosing TCP over RPL in IPv6-based LLNs.

• Journal of Communications and Networks
• /
• v.16 no.4
• /
• pp.371-377
• /
• 2014

Localized topology control is attractive for obtaining reduced network graphs with desirable features such as sparser connectivity and reduced transmit powers. In this paper, we focus on studying how to prolong network lifetime in the context of localized topology control for wireless multi-hop networks. For this purpose, we propose an energy efficient localized topology control algorithm. In our algorithm, each node is required to maintain its one-hop neighborhood topology. In order to achieve long network lifetime, we introduce a new metric for characterizing the energy criticality status of each link in the network. Each node independently builds a local energy-efficient spanning tree for finding a reduced neighbor set while maximally avoiding using energy-critical links in its neighborhood for the local spanning tree construction. We present the detailed design description of our algorithm. The computational complexity of the proposed algorithm is deduced to be O(mlog n), where m and n represent the number of links and nodes in a node's one-hop neighborhood, respectively. Simulation results show that our algorithm significantly outperforms existing work in terms of network lifetime.

• Journal of Communications and Networks
• /
• v.11 no.2
• /
• pp.196-206
• /
• 2009

Over the last five years, relaying or multihop techniques have been intensively researched as means for potentially improving link performance of wireless networks. However, the data rates of relays are often limited because they cannot transmit and receive on the same frequency simultaneously. This limitation has come to the attention of researchers, and recently a number of relay techniques have been proposed specifically to improve the data efficiency of relaying protocols. This paper surveys transmission protocols that employ first single relays, then multiple relays and finally multiple antenna relays. A common feature of these techniques is that novel signal processing techniques are required in the relay network to support increased data rates. This paper presents results and discussion that highlight the advantages of these approaches.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.49 no.5
• /
• pp.21-26
• /
• 2012

Intra-session network coding has been proposed to improve throughput by simplifying scheduling of multi-hop wireless network and efficiency of packet transmission. Multi-rate transmission has been used in multihop wireless networks. An opportunistic routing with multirate shows throughput improvement compared with single rate. In this paper, we propose a method of throughput improvement in multi-hop wireless network by using multi-rate and intra-session network coding. We suggest a method to select an local optimal transmission rate at each node. The maximum throughput is evaluated by using linear programming (LP). To solve the LP, we use MATLAB and lp_solve IDE program. The performance evaluation results show that end-to-end throughput is improved by using multirate and intra-session network coding can achieve better throughput than opportunistic routing.