• The KIPS Transactions:PartC
• /
• v.14C no.1 s.111
• /
• pp.87-94
• /
• 2007

In mobile ad hoc networks the most popular on demand routing protocols are the Dynamic Source Routing (DSR) protocol and the Ad hoc On demand Distance Vector (AODV) routing protocol. These and other representative standard routing protocols are designed to find and maintain only a single path. Whenever there is a link break on the active route, source node has to invoke a route discovery process from the beginning and it causes a lot of overhead. Multipath routing protocols, which can alleviate these problems by establishing multiple alternative paths between a source and a destination, are widely studied. In this paper we propose a node disjoint multipath discovery technique based on AODV local route discovery. This technique can find and build completely separated node disjoint multi paths from a source to a destination as many as possible. It will make routing more robust and stable.

• Journal of Communications and Networks
• /
• v.16 no.5
• /
• pp.548-558
• /
• 2014

Load distribution is vital to the performance of multipath transport. The task becomes more challenging in real-time multimedia applications (RTMA), which impose stringent delay requirements. Two key issues to be addressed are: 1) How to minimize end-to-end delay and 2) how to alleviate packet reordering that incurs additional recovery time at the receiver. In this paper, we propose sub-packet based multipath load distribution (SPMLD), a new model that splits traffic at the granularity of sub-packet. Our SPMLD model aims to minimize total packet delay by effectively aggregating multiple parallel paths as a single virtual path. First, we formulate the packet splitting over multiple paths as a constrained optimization problem and derive its solution based on progressive approximation method. Second, in the solution, we analyze queuing delay by introducing D/M/1 model and obtain the expression of dynamic packet splitting ratio for each path. Third, in order to describe SPMLD's scheduling policy, we propose two distributed algorithms respectively implemented in the source and destination nodes. We evaluate the performance of SPMLD through extensive simulations in QualNet using real-time H.264 video streaming. Experimental results demonstrate that: SPMLD outperforms previous flow and packet based load distribution models in terms of video peak signal-to-noise ratio, total packet delay, end-to-end delay, and risk of packet reordering. Besides, SPMLD's extra overhead is tiny compared to the input video streaming.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.9A
• /
• pp.722-728
• /
• 2005

In this paper, the reverse-link performance of synchronous DS-CDMA cellular networks is investigated in Rician multipath fading environments. The system's performance is evaluated in terms of the achievable average bit error rate BER) and the user capacities of two different network layouts, namely those of a uniform grid of hexagonal multiple cells and a single isolated cell. In the multiple-cell scenario, the impact of the other cells' interference on the attainable capacity of the synchronous DS-CDMA uplink is investigated. Upon comparing both networks to a conventional asynchronous CDMA system, we demonstrate an achievable user capacity gain of $25\%$ to $56\%$ for synchronous uplink transmissions over that of the corresponding asynchronous transmission scenario at BER = $10^{-3}$.

• Journal of Korea Multimedia Society
• /
• v.10 no.9
• /
• pp.1165-1174
• /
• 2007

Mobile ad hoc networks suffer from the re-construction of the routing path as a node on the path moves away and/or fails. In this paper we propose a multipath routing scheme, designed for the network based on the directional antennas, in which a new path is quickly recovered by do-touring to an alternative neighbor called braid. Simulations are conducted in random networks with 50 nodes uniformly deployed in a $1,000m{\times}1,000M$ area where, all nodes have a transmission range of 250m and the average node moving speed varies from 0 to 10m/s. The proposed approach under the ideal antenna with K(>1) directional sectors achieves better results compared with the case of K=1, the omnidirectional antenna model, in terms of the metrics: packet delivery ratio and average number of hops for the routing paths. As further study, a scheme to alleviate the heavy amount of latency accompanied by the rout setup is urgently required.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.5
• /
• pp.179-186
• /
• 2008

In proportion as the growth of the wireless sensor network applications, we need for more accuracy wireless channel information. In the case of indoor or outdoor wireless sensor networks, multipath propagation causes severe problems in terms of fading. Therefore, a path-loss model for multipath environment is required to optimize communication systems. This paper deals with log-normal path loss modeling of the indoor 2.4 GHz channel. We measured variation of the received signal strength between the sender and receiver of which separation was increased from 1 to 30m. The path-loss exponent and the standard deviation of wireless channel were determined by fitting of the measured data. By using the PRR(Packet Reception Rate) of this model. Wireless sensor channel is defined CR(Connect Region), DR(Disconnected Region). In order to verify the characteristics of wireless channel, we performed simulations and experiments. We demonstrated that connection ranges are 24m in indoor, and 14m in outdoor.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.11
• /
• pp.5322-5342
• /
• 2016

In vehicle-to-vehicle (V2V) networks, where selfishness degrades node activity, countermeasures for collaboration enforcement must be provided to enable application of a sage and efficient network environment. Because vehicular networks feature both high mobility and various topologies, selfish behavior judgment and establishment of a stable routing protocol become intensely challenging. In this paper, a two-phase-based generous cooperative routing protocol (called GEC) is presented for V2V networks to provide resistance to selfishness. To detect selfish behaving vehicles, a packet forwarding watchdog and an average connection rate based on the multipath weight method are used, where evidence is gathered from different watchdogs. Then, multihop relay decisions are made using a generous cooperative algorithm based on game theory. Finally, through buffering of the multiple end-to-end paths and judicious choice of optimal cooperative routes, route maintenance phase is capable of dealing with congestion and rapidly exchanging traffic. Specifically, it is proved that the GEC is theoretically subgame perfect. Simulation results show that for V2V networks with inherently selfish nodes, the proposed method isolates uncooperative vehicles and is capable of accommodating both the mobility and congestion circumstances by facilitating information dissemination and reducing end-to-end delay.

• Journal of Communications and Networks
• /
• v.16 no.1
• /
• pp.10-17
• /
• 2014

This work investigates two important performance metrics of underlay cooperative cognitive radio (CR) networks: Interference cumulative distribution function of licensed users and outage probability of unlicensed users. These metrics are thoroughly analyzed in realistic operating conditions such as imperfect fading channel information and strict transmit power constraint, which satisfies interference power constraint and maximum transmit power constraint, over Nakagami-m fading channels. Novel closed-form expressions are derived and subsequently validated extensively through comparisons with respective results from computer simulations. The proposed expressions are rather long but straightforward to handle both analytically and numerically since they are expressed in terms of well known built-in functions. In addition, the offered results provide the following technical insights: i) Channel information imperfection degrades considerably the performance of both unlicensed network in terms of OP and licensed network in terms of interference levels; ii) underlay cooperative CR networks experience the outage saturation phenomenon; iii) the probability that the interference power constraint is satisfied is relatively low and depends significantly on the corresponding fading severity conditions as well as the channel estimation quality; iv) there exists a critical performance trade-off between unlicensed and licensed networks.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.3
• /
• pp.534-539
• /
• 2005

The key in wireless sensor networks, which consist of a number of sensor nodes, is an energy efficiency. Many routing protocols have been proposed for prolonging network lifetime and reducing traffic in wireless sensor networks. Wireless sensor networks usually use wireless ad-hoc network protocols for routing, but these protocols are not well-suited for wireless sensor networks due to many reasons. In this paper, RM-flooding protocol is proposed for reducing routing overhead occurred when packet flooding. The nodes using this routing protocol can consume the limited energy effectively, and exchange information with remote nodes usulg information receiving from multipath. So, RM-flooding prolongs the network's lifetime.

• Journal of Communications and Networks
• /
• v.17 no.2
• /
• pp.162-171
• /
• 2015

This paper provides an analytic performance evaluation of the bit error rate (BER) of underlay decode-and-forward cognitive networks with best relay selection over Rayleigh multipath fading channels. A generalized BER expression valid for arbitrary operational parameters is firstly presented in the form of a single integral, which is then employed for determining the diversity order and coding gain for different best relay selection scenarios. Furthermore, a novel and highly accurate closed-form approximate BER expression is derived for the specific case where relays are located relatively close to each other. The presented results are rather convenient to handle both analytically and numerically, while they are shown to be in good agreement with results from respective computer simulations. In addition, it is shown that as in the case of conventional relaying networks, the behaviour of underlay relaying cognitive networks with best relay selection depends significantly on the number of involved relays.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.6
• /
• pp.131-142
• /
• 2011

In this paper, we propose a new multipath routing protocol and compare it with other multipath routing protocols in mobile ad hoc network (MANET) environments. The new multipath routing establishes the main route using a mechanism based on Ad Hoc On-demand Distance Vector(AODV), after which data transmission starts immediately. The backup route search process takes place while data are transmitted, to reduce the transmission delay. The protocol can also operate in a hybrid node-disjoint/link-disjoint mode, where the protocol finds the node-disjoint backup route first; if the node-disjoint does not exist, the protocol discovers the link-disjoint backup route from the main route. When either of the main route or the backup route is broken, data are transmitted continuously through the other route and the broken route is recovered by the route maintenance process. The results of simulations, based on the Qualnet simulator, show that the proposed multipath routing protocol increases the packet transmission success rate and reduces end-to-end delays, when compared with AODV and AOMDV protocols.