• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.11
• /
• pp.5264-5281
• /
• 2017

Multihop relay-based cellular networks are attracting much interest because of their throughput enhancement, coverage extension, and low infrastructure cost. In these networks, relay stations (RSs) between a base station (BS) and mobile stations (MSs) drastically increase the overall spectral efficiency, with improved channel quality for MSs located at the cell edge or in shadow areas, and enhanced throughput of MSs in hot spots. These relay-based networks require an advanced radio resource management scheme because the optimal amount of radio resource for a BS-to-RS link should be allocated according to the MS channel quality and distribution, considering the interference among RSs and neighbor BSs. In this paper, we propose optimal resource planning algorithms that maximize the overall utility of relay-based networks under a proportional fair scheduling policy. In the first phase, we determine an optimal scheduling policy for distributing BS-to-RS link resources to RSs. In the second phase, we determine the optimal amount of the BS-to-RS link resources using the results of the first phase. The proposed algorithms efficiently calculate the optimal amount of resource without exhaustive searches, and their accuracy is verified by comparison with simulation results, in which the algorithms show a perfect match with simulations.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.49 no.4
• /
• pp.82-88
• /
• 2012

A VANET (Vehicular Ad Hoc Network), a subclass of MANET (Mobile Ad Hoc Network), is an ad hoc network using wireless communication between vehicles without fixed infrastructure such as base station. VANET suffers a frequent link breakage and network topology change because of the rapid movement of vehicles and the density change of vehicles. From these characteristics of VANET, geographical routing protocols such as GPSR (Greedy Perimeter Stateless Routing) using only the information of neighbor nodes are more suitable rather than AODV and DSR that are used in existing MANETs. However, GPSR may have a transmission delay and packet loss by frequent link disconnection and continual local maxima under the low vehicle density conditions. Therefore, in this paper, we propose a DTVR (Delay Tolerant Vehicular Routing) algorithm that perform a DTN-based routing scheme if there is no 2-hop neighbor nodes for efficient routing under the low vehicle densities in VANETs. Simulation results using ns-2 reveal that the proposed DTVR protocol performs much better performance than the existing routing protocols.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.3
• /
• pp.692-698
• /
• 1999

In this paper, we proposed the channel assignment scheme for the CDMA(Code Division Multiple Access) cellular system using power allocation concept. Also, the performance of the proposed scheme was analyzed and it was compared with the channel assignment scheme using the fixed power allocation method in the CDMA cellular system. The proposed scheme allocates the power adaptively in according to the traffic loads and the traffic distribution pattern of neighbor cells in the forward link. We found that total call blocking probability (Pr) is more dependent on blocking probability($P_B$) than outage probability (Po) under physical number of channels ($C_{th}$)=30. Pr(Call Blocking Probability) is dependent on $P_B$(Blocking Probability) and Po(Outage Probability) at the same ratio under $C_{th}$=32, in which case P$P_{TA}$(blocking probability for the adaptive power allocation) is greater than $P_{TF}$(blocking probability for the fixed power allocation) about 6%.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37C no.9
• /
• pp.829-840
• /
• 2012

Recently, in network communication environments, it is changing very fast from wired to wireless. The open shortest path firtst (OSPF), one of link state routing protocols, mainly used in wired networks, is the routing method to select optimal traffic path as identifying the link state of neighbor routers. The traditional OSPF cost functions performs with first fixed cost permanently, unless the router link is changed. However, in wireless networks, the performance of links show big difference by other environment factors. The bit error rate (BER), a parameter which can quite affect link state in wireless networks, is not considered in the traditional OSPF cost functions. Only a link bandwidth is considered in the traditional OSPF cost functions. In this paper, we verify the various parameters which can affect link performance, whether it is permissible to use as the parameter of proposed cost functions. To propose new cost functions, we use the effective bandwidth. This bandwidth is calculated by proposed formula using the BER of the network link and link bandwidth. As applied by the proposed triggering condition, the calculated effective bandwidth decrease the unstable of network by generating less link state update messages in wireless networks that frequently changes the link state. Simulation results show that the proposed cost functions significantly outperforms the traditional cost functions in wireless networks in terms of the services of VoIP and data transmission.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.11 no.2
• /
• pp.92-101
• /
• 2012

In this paper, we propose a distributed transmit power control algorithm for optimal end-to-end throughput in wireless multihop networks. Considering a solidarity property of link rates consisting of a multihop link and the fact that the multihop end-to-end throughput is determined by the minimum link rate, the proposed scheme controls the transmit power to make all link rates be equal and so maximizes the end-to-end throughput of multihop link. In addition, in the proposed scheme the transmit node calculates its transmit power autonomously in a distributed manner just through the information sharing with its neighbor nodes and so decreases the information sharing overhead. Simulation results show that the proposed scheme achieves significant improvements in terms of end-to-end throughput and power consumption compared with the conventional maximum equal power allocation scheme.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.5
• /
• pp.2009-2028
• /
• 2018

Considering a dual-hop energy-harvesting (EH) relaying system, this paper advocates novel relaying protocols based on adaptive time power switching-based relaying (AR) architecture for amplify-and-forward (AF) mode. We introduce novel system model relaying network with impacts of co-channel interference (CCI) and derive analytical expressions for the average harvested energy, outage probability, and the optimal throughput of the information transmission link, taking into account the effect of CCI from neighbor cellular users. In particular, we consider such neighbor users procedure CCI both on the relay and destination nodes. Theoretical results show that, in comparison with the conventional solutions, the proposed model can achieve optimal throughput efficiency for sufficiently small threshold SNR with condition of reasonable controlling time switching fractions and power splitting fractions in concerned AR protocol. We also explore impacts of transmission distances in each hop, transmission rate, the other key parameters of AR to throughput performance for different channel models. Simulation results are presented to corroborate the proposed methodology.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.4 s.346
• /
• pp.22-30
• /
• 2006

In this paper, the goal of our proposed algorithm is to reduce link -failure and route failure caused by dead nodes which consume all of the battery life. I propose an algorithm which provides a ability of changing mutes to neighbor nodes before some of intermediate nodes be shutting don to get the stable route maintenance. To achieve this goal, The proposed routing algerian uses additional new messages to check energy status for monitoring energy of neighbor nodes and to change the path to a neighbor node. From extensive simulations, results show that possibility of cut-offs and time-delay cause of packet-loss have been decreased and also the improvement of transmission effectiveness.

• Journal of Communications and Networks
• /
• v.7 no.3
• /
• pp.325-336
• /
• 2005

Mobile ad hoc networks (MANET) are composed of moving wireless hosts which, within range of each other, form wireless networks. For communication to occur between hosts that are not within each other's range, routes involving intermediate nodes must be established; however, since the hosts may be in motion, a host that was part of a route may move away from its upstream and downstream partners, thus breaking the route. In this paper, we propose anticipated route maintenance (ARM) protocol with two extensions to route discovery based routing scheme: Extend the route when nodes on a link move apart from each other and they have common neighbor that can be 'inserted' in the path, and shrink route when a node discovers that one of its neighbor which is not the next hop is also on the same route several hops later on. By utilizing only local geographic information (now a part of some route finding algorithms), a host can anticipate its neighbor's departure and, if other hosts are available, choose a host to bridge the gap, keeping the path connected. We present a distributed algorithm that anticipates route failure and performs preventative route maintenance using location information to increase a route lifespan. The benefits are that this reduces the need to find new routes (which is very expensive) and prevents interruptions in service. As the density of nodes increases, the chance to successfully utilize our route maintenance approach increases, and so does the savings. We have compared the performance of two protocols, pure dynamic source routing (DSR) protocol and DSR with ARM. The simulation results show how ARM improves the functionality of DSR by preventing the links in the route from breaking. Packets delivery ratio could be increased using ARM and achieved approximately $\100%$ improvement. The simulations clarify also how ARM shows a noticeable improvement in dropped packets and links stability over DSR, even though there is more traffic and channel overhead in ARM.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.11
• /
• pp.730-742
• /
• 2014

In the case of On-demand routing protocol in cognitive radio ad-hoc networks, broadcasting of control packets may occur common control channel overload and packet collisions during the routing procedure. This situation is to increase the overhead of path finding and also limited to find the accurate and reliable path. Since reliable channel and path finding is restricted, path life time is shorten and path reliability is reduced. In this paper, we propose a new routing algorithm that reduces control channel overhead and increases path life time by considering the probability of appearance of primary user and channel status of neighbor nodes. Each node performs periodic local sensing to detect primary user signal and to derive primary user activity patterns. The probability of primary appearance on the current channel and the channel status can be obtained based on the periodic sensing. In addition, each node identifies the quality of the channel by message exchange through a common channel with neighbor nodes, then determines Link_Levels with neighbor nodes. In the proposed method, the Link Level condition reduces the number of control messages that are generated during the route discovery process. The proposed method can improve path life time by choosing a path through Path_Reliability in which stability and quality are weighted depending on the location. Through simulation, we show that our proposed algorithm reduces packet collisions and increases path life time in comparison with the traditional algorithm.

• The KIPS Transactions:PartC
• /
• v.11C no.7 s.96
• /
• pp.879-888
• /
• 2004

Ad Node transmits packets to a destination node using routing function of intermediate nodes on the path in Ad Hoc networks. When the link to a next hop node in a path is broken due to the next hop node's mobility, a new route search process is required for continuing packets transmission. The node which recognizes link fault starts a local route recovery or the source node starts a new route search in the on demand routing protocol AODV. In this case, the new route search or the local route search brings packet delays and bad QoSs by packet delay. We propose RPAODV that the node predicts a link fault selects a possible node in neighbor nodes as a new next hop node for the path. The proposed protocol can avoid path faults and improve QoS.