• ETRI Journal
• /
• v.35 no.1
• /
• pp.120-130
• /
• 2013

This paper presents an analysis of resource assignment for multihop communications in millimeter-wave (mm-wave) wireless personal area networks. The purpose of this paper is to figure out the effect of using directional antennas and relaying devices (DEVs) in communications. The analysis is performed based on a grouping algorithm, categorization of the flows, and the relaying DEV selection policy. Three schemes are compared: direct and relaying concurrent transmission (DRCT), direct concurrent transmission (DCT), and direct nonconcurrent transmission (DNCT). Numerical results show that DRCT is better than DCT and DCT is better than DNCT for any antenna beamwidths under the proposed algorithm and policy. The results also show that using relaying DEVs increases the throughput up to 30% and that there is an optimal beamwidth that maximizes spatial reuse and depends on parameters such as the number of flows in the networks. This analysis can provide guidelines for improving the performance of mm-wave band communications with relaying DEVs.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 2006.07a
• /
• pp.59-72
• /
• 2006

• Current Optics and Photonics
• /
• v.5 no.2
• /
• pp.114-120
• /
• 2021

Free-space optical (FSO) communication is considered to be a potential solution to congestion in the radio-frequency spectrum and last-mile-access bottleneck issues in future cellular communication networks, such as 5G and beyond. However, FSO link performance may degrade significantly due to irradiance fluctuations and random temporal fluctuations from atmospheric turbulence. Therefore, in this work the main objective is to reduce the effect of the atmospheric turbulence by considering a multihop FSO communication system with amplify-and-forward relaying supported by a radio-frequency (RF) link, which form a hybrid FSO/RF communication system. The FSO link is assumed to follow the gamma-gamma fading model, which represents strong turbulence. Also, the RF link is modeled by a Rayleigh distribution. The performance of the considered system, in terms of the outage probability and average bit-error rate (BER), is investigated and analyzed under various weather conditions and pointing errors. Furthermore, the effect of the number of employed relay nodes on the performance of the system is investigated. The results indicate that the considered system reduces outage probability and average BER significantly, especially for low channel quality. Finally, the closed-form expressions derived in this work are compared to the results of Monte Carlo simulations, for verification.

• Journal of KIISE:Information Networking
• /
• v.35 no.3
• /
• pp.192-206
• /
• 2008

Multihop is the main communication style for wireless sensor networks composed of tiny sensor nodes. Until now, most applications have treated the periodic small sized sensing data. Recently, the burst traffic with the transient and continuous nature is increasingly introduced due to the advent of wireless multimedia sensor networks. Therefore, the efficient communication protocol to support this trend is required. In this paper, we propose a novel PIGAB(Packet Interval Gap based on Adaptive Backoff) protocol to efficiently transmit the burst data in multihop wireless sensor networks. The contention-based PIGAB protocol consists of the PIG(Packet Interval Gap) control algorithm in the source node and the MF(MAC-level Forwarding) algorithm in the relay node. The PIGAB is on basis of the newly proposed AB(Adaptive Backoff), CAB(Collision Avoidance Backoff), and UB(Uniform Backoff). These innovative algorithms and schemes can achieve the performance of network by adjusting the gap of every packet interval, recognizing the packet transmission of the hidden node. Through the simulations and experiments, we identify that the proposed PIGAB protocol considerably has the stable throughput and low latency in transmitting the burst data in multihop wireless sensor networks.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.5
• /
• pp.911-916
• /
• 2016

The nearest-neighbor multihop routing with/without infrastructure support is known to achieve the optimal capacity scaling in a large packet-erasure network in which multiple wireless nodes and relay stations are regularly placed and packets are erased with a certain probability. In this paper, a throughput scaling law is shown for an infrastructure-supported erasure network where wireless nodes are randomly distributed, which is a more feasible scenario. We use an exponential decay model to suitably model an erasure probability. To achieve high throughput in hybrid random erasure networks, the multihop routing via highway using the percolation theory is proposed and the corresponding throughput scaling is derived. As a main result, the proposed percolation highway based routing scheme achieves the same throughput scaling as the nearest-neighbor multihop case in hybrid regular erasure networks. That is, it is shown that no performance loss occurs even when nodes are randomly distributed.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.11
• /
• pp.2533-2540
• /
• 2013

In multihop cellular network environments, the mobility of nodes is a major obstacle to find a reliable routing path between a mobile node (MN) and the access node (AN). Therefore, in this paper, we propose a fast and reliable neighbor discovery protocol that enables the fast and reliable neighbor discovery by considering the node mobility in the multihop cellular network. The proposed neighbor discovery protocol inhibits the transmission of unnecessary control messages to quickly find a suitable neighbor node (NN) and performs a priority-based access control to transmit control messages without collision in the order of NN desirable to be selected. Simulation results show that the proposed neighbor discovery protocol can discover the NNs faster than the conventional scheme and select a more reliable relay node although the number of neighbor nodes increases and the node mobility increases.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 2004.07a
• /
• pp.262-262
• /
• 2004

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.241-242
• /
• 2008

This paper proposes a sectorization and exclusive subcarrier allocation technique for dirty paper coding (DPC) aided orthogonal frequency division multiple access (OFDMA) multihop cellular networks. Simulation result shows that the proposed technique significantly increases the achievable sum rate compared to the conventional mobile station selection approach.

• 한국정보통신설비학회:학술대회논문집
• /
• 2008.08a
• /
• pp.17-20
• /
• 2008

A clustering scheme for ad hoc networks is aimed at managing a number of mobile devices by utilizing hierarchical structure of the networks. In order to construct and maintain an effective hierarchical structure in ad hoc networks where mobile devices may move at high mobility, the following requirements must be satisfied. The role of each mobile device for the hierarchical structure is adaptive to dynamic change of the topology of the ad hoc networks. The role of each mobile device should thus change autonomously based on the local information. The overhead for management of the hierarchical structure is small. The number of mobile devices in each cluster should thus be almost equivalent. This paper proposes an adaptive multihop clustering scheme for highly mobile ad hoc networks. The results obtained by extensive simulation experiments show that the proposed scheme does not depend on mobility and node degree of mobile devices in the ad hoc network, which satisfy the above requirements.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38C no.1
• /
• pp.33-42
• /
• 2013

This paper presents a multihop range-free localization algorithm to estimate the physical location of a normal node with local connectivity information in anisotropic sensor networks. In the proposed algorithm, a normal node captures the detour degree of the shortest path connecting an anchor pair and itself by comparing the measured hop count and the expected hop count, and the node estimates the distances to the anchors based on the detour degree. The normal node repeats this procedure with all anchor combinations and pinpoints its location using the obtained distance estimates. The proposed algorithm requires fewer anchors and less communication overhead compared to existing range-free algorithms. We showed the superiority of the proposed algorithm over existing range-free algorithms through MATLA simulations.