• 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.

• 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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.1
• /
• pp.43-51
• /
• 2015

Upcoming cellular networks such as LTE-advanced and IEEE 802.16m are enhanced by relay stations to support high data rate multimedia services and minimize the shadow zone with low cost. Enhancing the relay stations, however, divides the multihop cellular network into smaller microcells and the distance between microcells is closer, which intends large intra-cell and inter-cell interference. Especially the access link on downlink in the OFDMA cellular network is the throughput bottleneck due to the severe interference caused by base stations and relay stations transmitting large data to mobile stations simultaneously. In this paper, we present interference aware channel allocation algorithm to avoid severe interference on multihop cellular networks with random topology. Proposed algorithm increases SINR(signal to interference plus noise ratio) and decreases number of required control messages for channel allocation, so that increases overall throughput on the networks.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.3
• /
• pp.778-798
• /
• 2014

This paper proposes a novel exposed-terminal-eliminated medium access control (ETE-MAC) protocol by combining channel reservation, collision avoidance and concurrent transmissions to improve multi-access performance of the multihop wireless networks. Based on the proposed slot scheduling scheme, each node senses the control channel (CCH) or the data channel (DCH) to accurately determine whether it can send or receive the corresponding packets without collisions. Slot reservation on the CCH can be simultaneously executed with data packet transmissions on the DCH. Therefore, it resolves the hidden-terminal type and the exposed-terminal type problems efficiently, and obtains more spatial reuse of channel resources. Concurrent packet transmissions without extra network overheads are maximized. An analytical model combining Markov model and M/G/1 queuing theory is proposed to analyze its performance. The performance comparison between analysis and simulation shows that the analytical model is highly accurate. Finally, simulation results show that, the proposed protocol obviously outperforms the link-directionality-based dual-channel MAC protocol (DCP) and WiFlex in terms of the network throughput and the average packet delay.

• ETRI Journal
• /
• v.32 no.2
• /
• pp.273-280
• /
• 2010

The overall channel capacity of a multihop wireless path drops progressively over each hop due to the cascading effect of noise and interference. Hence, without optimal rate adaptation, the video quality is expected to degrade significantly at any client located at a far-edge of an ad-hoc network. To overcome this limitation, decoding and forwarding (DF), which fully decodes codewords at each intermediate node, can be employed to provide the best video quality. However, complexity and memory usage for DF are significantly high. Consequently, we propose syndrome-based partial decoding (SPD). In the SPD framework an intermediate node partially decodes a codeword and relays the packet along with its syndromes if the packet is corrupted. We demonstrate the efficacy of the proposed scheme by simulations using actual 802.11b wireless traces. The trace-driven simulations show that the proposed SPD framework, which reduces the overall processing requirements of intermediate nodes, provides reasonably high goodput when compared to simple forwarding and less complexity and memory requirements when compared to DF.

• Journal of KIISE:Information Networking
• /
• v.27 no.1
• /
• pp.12-21
• /
• 2000

Arrangement graph has desirable properties for design requirements of a multihop lightwave network, such as node and edge symmetry, low diameter, simple routing, etc. In this paper, arrangement lightwave network based on arrangement graph model is proposed as new logical topology of multihop lightwave network. In the proposed scheme, multistar and grouping of network are used for improving reusability of wavelength and scalability. Also, this paper shows that the proposed scheme is an alternative logical topology for application requiring more nodes with limited wavelengths by evaluating performance with related works.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.06a
• /
• pp.401-405
• /
• 2007

In sensor network, cluster based routing protocol about efficient energy usage method has researched variously. But existing cluster based routing protocol have problems. one of the problem is sensor nodes's imbalance energy consumption problem at cluster reconstruction. anther is non- connection problem between header node and spc node when they are far from each other, not properly connected. We propose cluster re-division and header node of multihop transmission method in this paper. The cluster re-division method is the method that re-divides existing routing protocol with the small-scale cluster and multihop transmission method is the method regarding the relay transmission between the header nodes. Through the simulation, the proposed routing mechanism shows more excellent than exiting routing protocol in balance energy consumption and energy efficiency.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.4A
• /
• pp.330-335
• /
• 2007

This paper proposes a multichannel random access channel allocation scheme for multihop cellular networks to guarantee the stable throughput of a random access. The fundamental contribution is a mathematical formula for an optimal partition ratio of shared random access channels between a base station and a relay station. In addition, the proposed scheme controls the retransmission probability of random access packets under heavy load condition. Simulation results show that the proposed scheme can guarantee the required random access channel utilization and packet transmission delay even if the a random access packet arrival rate is higher than 0.1.

• 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.