• ETRI Journal
• /
• v.37 no.2
• /
• pp.380-386
• /
• 2015

Guaranteeing quality of service over a multihop wireless network is difficult because end-to-end (ETE) delay is accumulated at each hop in a multihop flow. Recently, research has been conducted on network coding (NC) schemes as an alternative mechanism to significantly increase the utilization of valuable resources in multihop wireless networks. This paper proposes a new section-based joint NC and scheduling scheme that can reduce ETE delay and enhance resource efficiency in a multihop wireless network. Next, this paper derives the average ETE delay of the proposed scheme and simulates a TDMA network where the proposed scheme is deployed. Finally, this paper compares the performance of the proposed scheme with that of the conventional sequential scheduling scheme. From the performance analysis and simulation results, the proposed scheme gives more delay-and energy-efficient slot assignments even if the NC operation is applied, resulting in a use of fewer network resources and a reduction in ETE delay.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.1
• /
• pp.24-51
• /
• 2011

When supporting both voice and TCP in a wireless multihop network, there are two conflicting goals: to protect the VoIP traffic, and to completely utilize the remaining capacity for TCP. We investigate the interaction between these two popular categories of traffic and find that conventional solution approaches, such as enhanced TCP variants, priority queues, bandwidth limitation, and traffic shaping do not always achieve the goals. TCP and VoIP traffic do not easily coexist because of TCP aggressiveness and data burstiness, and the (self-) interference nature of multihop traffic. We found that enhanced TCP variants fail to coexist with VoIP in the wireless multihop scenarios. Surprisingly, even priority schemes, including those built into the MAC such as RTS/CTS or 802.11e generally cannot protect voice, as they do not account for the interference outside communication range. We present VAGP (Voice Adaptive Gateway Pacer) - an adaptive bandwidth control algorithm at the access gateway that dynamically paces wired-to-wireless TCP data flows based on VoIP traffic status. VAGP continuously monitors the quality of VoIP flows at the gateway and controls the bandwidth used by TCP flows before entering the wireless multihop. To also maintain utilization and TCP performance, VAGP employs TCP specific mechanisms that suppress certain retransmissions across the wireless multihop. Compared to previous proposals for improving TCP over wireless multihop, we show that VAGP retains the end-to-end semantics of TCP, does not require modifications of endpoints, and works in a variety of conditions: different TCP variants, multiple flows, and internet delays, different patterns of interference, different multihop topologies, and different traffic patterns.

• Journal of Communications and Networks
• /
• v.4 no.4
• /
• pp.351-362
• /
• 2002

In this paper, we introduce a new approach to the minimum energy routing (MER) for next generation (NG) multihop wireless networks. We remove the widely used assumption of deterministic, distance-based channel model is removed, and analyze the potentials of MER within the context of the realistic channel model, accounting for shadowing and fading. Rather than adopting the conventional unrealistic assumption of perfect power control in a distributed multihop environment, we propose to exploit inherent spatial diversity of mobile terminals (MT) in NG multihop networks and to combat fading using transmit diversity. We propose the cooperation among MTs, whereby couples of MTs cooperate with each other in order to transmit the signal using two MTs as two transmit antennas. We provide the analytical framework for the performance analysis of this scheme in terms of the feasibility and achievable transmit power reduction. Our simulation result indicate that significant gains can be achieved in terms of the reduction of total transmit power and extension of network lifetime. These gains are in the range of 20-100% for the total transmit power, and 25-90% for the network lifetime, depending on the desired error probability. We show that our analytical results provide excellent match with our simulation results. The messaging load generated by our scheme is moderate, and can be further optimized. Our approach opens the way to a new family of channel-aware routing schemes for multihopNG wireless networks in fading channels. It is particularly suitable for delivering multicast/ geocast services in these networks.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.5
• /
• pp.1618-1637
• /
• 2014

Clustering wireless sensor network is an efficient way to reduce the energy consumption of individual nodes in a cluster. In clustering, multihop routing techniques increase the load of the Cluster head near the sink. This unbalanced load on the Cluster head increases its energy consumption, thereby Cluster heads die faster and create an energy hole problem. In this paper, we propose an Energy Balancing Cluster Head (EBCH) in wireless sensor network. At First, we balance the intra cluster load among the cluster heads, which results in nonuniform distribution of nodes over an unequal cluster size. The load received by the Cluster head in the cluster distributes their traffic towards direct and multihop transmission based on the load distribution ratio. Also, we balance the energy consumption among the cluster heads to design an optimum load distribution ratio. Simulation result shows that this approach guarantees to increase the network lifetime, thereby balancing cluster head energy.

• Journal of Advanced Navigation Technology
• /
• v.11 no.1
• /
• pp.118-126
• /
• 2007

An ad hoc network is a system of wireless mobile nodes that dynamically self-organize in arbitrary and temporary network topologies allowing people and devices to internetwork without any preexisting communication infrastructure. Although ad hoc network is attractive solution, there are still some major flaws that prevent commercial growth. Security is one of these main barriers; ad hoc networks are known to be particularly vulnerable to security attack. It is difficult to establish a centralized key distribution center and a trusted certification authority to provide cryptographic keys and digital certificates to nodes. To prevent attacks in ad hoc routing protocols, many algorithms have been used. In this paper, we have depicted a secure framework for multipath routing in wireless multihop network, which is comprehensive solution for secure data forwarding in wireless multihop networks. With the simulation results, the proposed scheme is compared with existing source routing scheme.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2018.10a
• /
• pp.499-502
• /
• 2018

We propose a wireless-powered multihop transmission scheme using inter-node cooperation in a linear network topology. The proposed protocol determines the energy transfer time for each node to make the lifetime of the each node be equal in order to maximize the lifetime of the multihop path. To make the lifetime of each node the same, we apply the flocking algorithm which imitates the behavior of a bird flock flying at the same velocity, so that the lifetime of the nodes is averaged locally. Simulation results show that the proposed algorithm can maximize the lifetime of the multihop path by making all nodes have the same lifetime.

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

In this paper, we propose a method for throughput improvement in multirate multihop wireless networks with intra-session network coding. A multirate transmission supports several rates so that it has a tradeoff between transmission rate and transmission range, therefore multirate can cope with the performance degradation. We present the rate selection method with intra-session network coding in multirate nodes. The effective transmission rate is calculated by using intra-session network coding, and then its maximum effective transmission rate is selected. Concurrent transmission set is determined by selected transmission rate and then the linear programming is formulated for throughput calculation in multihop wireless networks. We evaluate the performance by using MATLAB and lp_solve programs in two topologies. It is shown that the throughput of the proposed method is improved.

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

• Journal of Communications and Networks
• /
• v.12 no.5
• /
• pp.433-441
• /
• 2010

Multihop transmission is a promising technique that helps in achieving broader coverage (excellent network connectivity) and preventing the impairment of wireless channels. This paper proposes a cluster-based multihop wireless network that makes use of the advantages of multihop relaying, i.e., path loss gain, and partial relay selection in each hop, i.e., spatial diversity. In this partial relay selection, the node with the maximum instantaneous channel gain will serve as the sender for the next hop. With the proposed protocol, the transmit power and spectral efficiency can be improved over those in the case of direct transmission and conventional multihop transmission. Moreover, at a high signal-to-noise ratio (SNR), the performance of the system with at least two nodes in each cluster is dependent only on the last hop and not on any of the intermediate hops. For a practically feasible decode-and-forward relay strategy, a compact expression for the probability density function of the end-to-end SNR at the destination is derived. This expression is then used to derive closed-form expressions for the outage probability, average symbol error rate, and average bit error rate for M-ary square quadrature amplitude modulation as well as to determine the spectral efficiency of the system. In addition, the probability of SNR gain over direct transmission is investigated for different environments. The mathematical analysis is verified by various simulation results for demonstrating the accuracy of the theoretical approach.

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