• Journal of Korea Multimedia Society
• /
• v.19 no.8
• /
• pp.1404-1414
• /
• 2016

Cross-layer design is a concept, which captures the dependencies and interactions and enables information sharing among layers in order to improve the network performance and security. There are two key challenges in wireless networks, lossy features of links and power assumption of network nodes. Cross-layer design of congestion control and power allocation in wireless lossy networks has been studied in the existing literature; however, there has been no contribution proposed in the literature that exploits the path diversity. In this paper, we are motivated to develop a cross-layer design of congestion control and power allocation, which takes into account lossy features of wireless links and transmission powers of network nodes and can be implemented in a distributed manner. Numerical simulation is conducted to illustrate the performance of our proposed algorithm and the comparison with current alternative approaches.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.5B
• /
• pp.427-434
• /
• 2003

This paper suggests an improved TCP congestion algorithm, which is more robust to lossy wireless environment than other algorithms such as TCP-Reno. The suggested algorithm decides on the size of a congestion window depending on both PER (Packet Error Rate) and its state, which is one of fast recovery state and slow start state. Some simulations are given to validate the suggested algorithm and the algorithm is compared with other TCP congestion algorithm from the point of view of performance measures such as a congestion window and throughput. The suggested algorithm has better throughput than other algorithm over wireless links with high PER and similar throughput to others over wireless links with low BER.

• Journal of KIISE:Information Networking
• /
• v.35 no.1
• /
• pp.56-66
• /
• 2008

Contention-based forwarding in wireless ad-hoc networks reduces transmission failure rate by selecting one receiver with good channel among multiple receivers. However, contention-based forwarding may increase transmission latency due to the collision problem caused by the simultaneous transmission among multiple receivers. In this paper, we present an analytic model that reflects the delay and collision rate of contention-based forwarding in lossy wireless links. Through the analytic model, we calculate the expected delay and progress in one-hop transmission under given wireless link model and delay model. Based on the analytic results, we observe that delay model should be adapted to wireless link model for optimal performance in contention-based forwarding.

• Journal of Communications and Networks
• /
• v.18 no.5
• /
• pp.806-817
• /
• 2016

Opportunistic routing (OR) has been proposed as a viable approach to improve the performance of wireless multihop networks with lossy links. However, the exponential growth of the bandwidth-sensitive mobile traffic (e.g., mobile video streaming and online gaming) poses a great challenge to the performance of OR in term of bandwidth guarantee. To solve this problem, a novel mechanism is proposed to opportunistically forwarding data packets and provide bandwidth guarantee for the bandwidth-sensitive traffic. The proposal exploits the broadcast characteristic of wireless transmission and reduces the negative effect of wireless lossy links. First, the expected available bandwidth (EAB) and the expected transmission cost (ETC) under OR are estimated based on the local available bandwidth, link delivery probability, forwarding candidates, and prioritization policy. Then, the policies for determining and prioritizing the forwarding candidates is devised by considering the bandwidth and transmission cost. Finally, bandwidth-aware routing algorithm is proposed to opportunistically delivery data packets; meanwhile, admission control is applied to admit or reject traffic flows for bandwidth guarantee. Extensive simulation results show that our proposal consistently outperforms other existing opportunistic routing schemes in providing performance guarantee.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.9
• /
• pp.3110-3125
• /
• 2014

Network coding improves TCP's performance in lossy wireless networks. However, the complex congestion window evolution of network coded TCP (TCP-NC) makes the analysis of end-to-end throughput challenging. This paper analyzes the evolutionary process of TCP-NC against lossy links. An analytic model is established by applying a two-dimensional Markov chain. With maximum window size, end-to-end erasure rate and redundancy parameter as input parameters, the analytic model can reflect window evolution and calculate end-to-end throughput of TCP-NC precisely. The key point of our model is that by the novel definition of the states of Markov chain, both the number of related states and the computation complexity are substantially reduced. Our work helps to understand the factors that affect TCP-NC's performance and lay the foundation of its optimization. Extensive simulations on NS2 show that the analytic model features fairly high accuracy.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.24 no.11
• /
• pp.1477-1483
• /
• 2020

The stability guarantee of wireless network based control systems is still challenging due to the lossy links and node failures. This paper proposes a hierarchical cluster-based network protocol called robust wireless sensor and actuator network (R-WSAN) by combining time, channel, and space resource diversity. R-WSAN includes a scheduling algorithm to support the network resource allocation and a control task sharing scheme to maintain the control stability of multiple plants. R-WSAN was implemented on a real test-bed using Zolertia RE-Mote embedded hardware platform running the Contiki-NG operating system. Our experimental results demonstrate that R-WSAN provides highly reliable and robust performance against lossy links and node failures. Furthermore, the proposed scheduling algorithm and the task sharing scheme meet the stability requirement of control systems, even if the controller fails to support the control task.

• Journal of Communications and Networks
• /
• v.9 no.3
• /
• pp.236-246
• /
• 2007

This paper investigates the performance of the transmission control protocol (TCP) transport protocol over IEEE 802.11 infrastructure based wireless networks. A wireless link is generally characterized by high transmission errors, random interference and a varying latency. The erratic packet losses usually lead to a curbing of the flow of segments on the TCP connection and thus limit TCP's performance. This paper examines the impact of the lossy nature of IEEE 802.11 wireless networks on the TCP performance and proposes a scheme to improve the performance of TCP over wireless links. A negative acknowledgment scheme, selective negative acknowledgment (SNACK), is applied on TCP over wireless networks and a series of ns-2 simulations are performed to compare its performance against that of other TCP schemes. The simulation results confirm that SNACK and its proposed enhancement SNACK-S, which incorporates a bandwidth estimation model at the sender, outperform conventional TCP implementations in 802.11 wireless networks.

• KIPS Transactions on Computer and Communication Systems
• /
• v.3 no.10
• /
• pp.357-364
• /
• 2014

The first mission for the IoT based hyper-connectivity communication is developing a device-to-device communication technique in infra-less low-power and lossy networks. In a low-power and lossy wireless network, IoT devices and routers cannot keep the original path toward the destination since they have the limited memory. Different from the previous light-weight routing protocols focusing on the reduction of the control messages, the proposed scheme provides the light-weight IPv6 address auto-configuration, IPv6 neighbor discovery and routing protocol in a IoT capable infra-less wireless networks with the bloom filer and enhanced rank concepts. And for the first time we evaluate our proposed scheme based on the modeling of various probability distributions in the IoT environments with the lossy wireless link. Specifically, the proposed enhanced RPL based light-weight routing protocol improves the robustness with the multi-paths locally established based on the enhanced rank concepts even though lossy wireless links are existed. We showed the improvements of the proposed scheme up to 40% than the RPL based protocol.

• The KIPS Transactions:PartC
• /
• v.9C no.2
• /
• pp.197-212
• /
• 2002

Transmission Control Protocol (TCP) [1] has been tuned as a reliable transfer protocol for traditional networks comprising wired links and stationary hosts with same link characteristics. TCP assumes that congestion in the network be a primary cause for packet losses and unusual delays. TCP performs welt over such networks adapting to end-to-end delays and congestion losses, by standard congestion control mechanisms, such as slow-start, congestion avoidance, fast retransmit and recovery. However, networks with wireless and other lossy links suffer from significant losses due to bit errors and handoffs. An asymmetry network such as ADSL has different bandwidth for both directions. As a result, TCP's standard mechanisms incur end-to-end performance degradation in various links. In this paper, we analyze the TCP problems in wireless, satellite, and asymmetry links, and measure the new TCP mechanisms that are recommended by IETF Performance Implications of Link Characteristics (PILC) WG[2], by using Network Simulator 2 (NS-2).

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.04a
• /
• pp.217-219
• /
• 2002

TCP has been designed and tuned as a reliable transfer protocol far wired links. However, it incurs end-to-end performance degradation in wireless environments where packet loss is very high. TCP HACK(Header Checksum Option) is a novel mechanism proposed to improve original TCP in lossy link. It presents an extension to TCP that enables TCP to distinguish packet corruption from congestion in losssy environments. TCP HACK performs well when the sender receives the special ACKs correctly, hut if the ACKs are also lost much, the efficient of TCP HACK will net be prominent. In this paper we present an extension to TCP HACK, which can perform well even when the ACKs are much corrupted.