• Journal of Korea Multimedia Society
• /
• v.18 no.8
• /
• pp.909-914
• /
• 2015

In wireless sensor networks, sensor nodes have a short transmission range and data is transferred from source to destination node using the multi-hop transmission. Sensor nodes are powered by battery and the link qualities are different, and the routing protocol in the wireless sensor network is one of the important technical issues. Multipath routing was proposed to reduce the data congestion and increase data throughput. In the multipath routing, however, each path can be interfered by the other path, and it can aggravate network performance. In this paper, we propose the multipath routing scheme for multi-rate wireless sensor networks. The multipath routing selects transmission paths to minimize transmission delay and path interference.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38C no.2
• /
• pp.219-226
• /
• 2013

Distributed multi-hop relay scheme to reduce delay-constrained outage probability for broadcast network is proposed. We consider multi-hop relay scheme, which is similar to distributed beamforming, where multiple nodes simultaneously relay packets, and we propose channel access control and power control for relaying nodes to satisfy energy constraint. Compared with flooding which is multi-hop relay scheme used for ZigBee, the proposed scheme is better in terms of outage probability and average reception throughput.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.4
• /
• pp.37-42
• /
• 2012

LED is just a semiconductor which can produce light. Currently, there are active research works on LED lighting technologies according to the growth of energy-saving environmental industry. Especially, LED communication is one of the active research works in these fields. In this paper, we design a LED communication-based multi-hop transmission wireless network system. The designed system consists of a transmission circuit system(transmitter) using LED and a receiving circuit system(receiver) using PD(photo detector) and OP-Amp, and relay system which can support multi-hop wireless network service with PD, OP-Amp, and LED, respectively. The experiments for the designed system are performed as follows. One computer is connected at the end of transmitter and receiver, respectively. There are two relays between transmitter and receiver, and text files are transmitted continuously by using text transmission programming. In this experiment, we test the performance with various baud rates, transmission ranges.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.3 no.1
• /
• pp.5-25
• /
• 2009

In recent years the popularity of multi-hop wireless networks has been growing. Its flexible topology and abundant routing path enables many types of applications. However, the lack of a centralized controller often makes it difficult to design a reliable service in multi-hop wireless networks. While packet routing has been the center of attention for decades, recent research focuses on data discovery such as file sharing in multi-hop wireless networks. Although there are many peer-to-peer lookup (P2P-lookup) schemes for wired networks, they have inherent limitations for multi-hop wireless networks. First, a wired P2P-lookup builds a search structure on the overlay network and disregards the underlying topology. Second, the performance guarantee often relies on specific topology models such as random graphs, which do not apply to multi-hop wireless networks. Past studies on wireless P2P-lookup either combined existing solutions with known routing algorithms or proposed tree-based routing, which is prone to traffic congestion. In this paper, we present two wireless P2P-lookup schemes that strictly build a topology-dependent structure. We first propose the Ring Interval Graph Search (RIGS) that constructs a DHT only through direct connections between the nodes. We then propose the ValleyWalk, a loosely-structured scheme that requires simple local hints for query routing. Packet-level simulations showed that RIGS can find the target with near-shortest search length and ValleyWalk can find the target with near-shortest search length when there is at least 5% object replication. We also provide an analytic bound on the search length of ValleyWalk.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.7
• /
• pp.1313-1319
• /
• 2017

In this paper, we evaluate the performance of multi-hop transmissions in IEEE 802.15.6 ultra wide band (UWB) wireless body area network (WBAN). The packet structure in the physical layer, and encoding and decoding are considered for multi-hop transmissions in IEEE 802.15.6 UWB WBAN. We analyze the data success rate and energy efficiency of multi-hop transmissions with considering the length of data payload, transmission power, and distances between the nodes in IEEE 802.15.6 UWB WBAN. Through simulations, we evaluate the data success rate and energy efficiency of multi-hop transmissions with varying the length of data payload, transmission power, and distances between the nodes in IEEE 802.15.6 UWB WBAN. Finally, we can select an energy-efficient multi-hop transmission in IEEE 802.15.6 UWB WBAN depending on the length of data payload, transmission power, and distances between the nodes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.4A
• /
• pp.394-400
• /
• 2010

Mobile Multi-hop Relaying (MMR) system can provide increased system capacity of wireless access network by coverage extension and enhanced transmission rate within the Base Station (BS) coverage area. The previous researches for the MMR system with a non-transparent mode Relay Station (RS) do not consider channel selection procedure of Mobile Station (MS), co-channel interference and Multi-hop Relay Base Station (MR-BS) coverage and RS coverage ratio in MMR system. In this paper, we investigate the performance of MMR uplink system in multicell environments with various topologies. The performance is presented in terms of call blocking probability, channel utilization, outage probability and system throughput by varying offered load. It is found that, for certain system parameters, the MMR uplink system achieve the maximum system throughput when MR-BS coverage to RS coverage ratio is 7.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.11
• /
• pp.1679-1685
• /
• 2022

In this paper, we propose an optimal multi-hop transmission scheme to maximize the end-to-end data rate from the source to the destination node in a wireless powered communication network. The frame structure for multi-hop transmission is presented to transmit multi-hop data while harvesting energy. Then, the transmission time of each node that maximizes the end-to-end transmission rate is determined through mathematical analysis in consideration of different harvested energy and link quality among nodes. We derive an optimization problem through system modeling of the considered wireless powered multi-hop transmission, and prove that there is a global optimal solution by verifying the convexity of this optimization problem. This analysis facilitates to find the optimal solution of the considered optimization problem. The proposed optimal multi-hop transmission scheme maximizes the end-to-end rate by allocating the transmission time for each node that equalizes the transmission rates of all links.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37B no.9
• /
• pp.741-749
• /
• 2012

Ad Hoc Self-Organizing TDMA (ASO-TDMA) has been proposed as a specification to support the multi-hop data communication service for ships over VHF band. It allows for organizing a multi-hop ad-hoc network in a distributed manner by sharing the radio resources among the ships navigating along the route. In this paper, Markov chain analysis is given to provide the average throughput performance for ASO-TDMA protocol Furthermore, the analytical results are verified with computer simulation, which shows that there exists the optimal transmission rate to maximize the average throughput as the subframe size and the number of ships are varying in each hop region.

• Journal of Communications and Networks
• /
• v.15 no.3
• /
• pp.266-275
• /
• 2013

The exact closed-form expressions for outage probability and bit error rate of spectrum sharing-based multi-hop decode-and-forward (DF) relay networks in non-identical Rayleigh fading channels are derived. We also provide the approximate closed-form expression for the system ergodic capacity. Utilizing these tractable analytical formulas, we can study the impact of key network parameters on the performance of cognitive multi-hop relay networks under interference constraints. Using a linear network model, we derive an optimum relay position scheme by numerically solving an optimization problem of balancing average signal-to-noise ratio (SNR) of each hop. The numerical results show that the optimal scheme leads to SNR performance gains of more than 1 dB. All the analytical expressions are verified by Monte-Carlo simulations confirming the advantage of multihop DF relaying networks in cognitive environments.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.9
• /
• pp.3008-3028
• /
• 2022

In this paper, we investigate traffic scheduling for a delay-sensitive multi-hop relay network, and aim to minimize the priority-based end-to-end delay of different data packet via joint relay selection, subcarrier assignment, and power allocation. We first derive the priority-based end-to-end delay based on queueing theory, and then propose a two-step method to decompose the original optimization problem into two sub-problems. For the joint subcarrier assignment and power control problem, we utilize an efficient particle swarm optimization method to solve it. For the relay selection problem, we prove its convexity and use the standard Lagrange method to deal with it. The joint relay selection, subcarriers assignment and transmission power allocation problem for each hop can also be solved by an exhaustive search over a finite set defined by the relay sensor set and available subcarrier set. Simulation results show that both the proposed routing scheme and the resource allocation scheme can reduce the average end-to-end delay.