• Journal of Korea Multimedia Society
• /
• v.13 no.5
• /
• pp.740-753
• /
• 2010

Performance of TCP can be severely degraded in WLP-based Mobile IP wireless networks where packet loss not related to network congestion occurs frequently during WLP-based inter-subnetwork handoff by user mobility. To resolve such a problem in the networks using WLP-based Mobile IP, the packet buffering method recovering seamlessly the packets dropped due to user mobility has been proposed. The packet buffering method at a bridge station recovers those packets dropped during handoff by forwarding buffered packets at the old bridge station to the WLP device. But, when the WLP device moves to a congested bridge station in a new WLP foreign subnetwork, those buffered packets forwarded by the old bridge station are dropped and TCP transmission performance of a WLP device in the congested bridge station degrades due to increased congestion by those forwarded burst packets. In this paper, a PBM(Packet Bridge Marker) is proposed for preventing buffered out-of-profile(OUT) packets from reducing the throughput of in-profile(IN) packets of an Assured Service WLP device. From this operation, the packet losses of buffered OUT packets are avoided and the throughput of IN and Total packets of an AS WLP device are increased.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.10 s.352
• /
• pp.79-89
• /
• 2006

TCP is the most widely used transport protocol in Internet applications that guarantees a reliable data transfer. But, in the wireless multi-hop networks, TCP performance is degraded because it is designed for wired networks. The main reasons of TCP performance degradation are contention for wireless medium at the MAC layer, hidden terminal problem, exposed terminal problem, packet losses in the link layer, unfairness problem, reordering problem caused by path disconnection, bandwidth waste caused by exponential backoff of retransmission timer due to node's mobility and so on. Specially, in the mobile ad-hoc networks, discrepancy between a station's transmission range and interference range produces hidden terminal problem that decreases TCP performance greatly by limiting simultaneous transmission at a time. In this paper, we propose a new MAC algorithm for mobile ad-hoc networks to solve the problem that a node can not transmit and just increase CW by hidden terminal. In the IEEE 802.11 MAC DCF, a node increases CW exponentially when it fails to transmit, but the proposed algorithm, changes CW adaptively according to the reason of failure so we get a TCP performance enhancement. We show by ns-2 simulation that the proposed algorithm enhances the TCP performance by fairly distributing the transmission opportunity to the failed nodes by hidden terminal problems.

• Journal of Communications and Networks
• /
• v.10 no.3
• /
• pp.338-350
• /
• 2008

The differentiated services (DiffServ) is proposed to provide packet level service differentiations in a scalable manner. To provide an end-to-end service differentiation to users having a connection over multiple domains, as well as a flow marker, an intermediate marker is necessary at the edge routers, and it should not be operated at a flow level due to a scalability problem. Due to this operation requirement, the intermediate marker has a fairness problem among the transmission control protocol (TCP) flows since TCP flows have intrinsically unfair throughputs due to the TCP's congestion control algorithm. Moreover, it is very difficult to resolve this problem without individual flow state information such as round trip time (RTT) and sending rate of each flow. In this paper, to resolve this TCP fairness problem of an intermediate marker, we propose a fair scalable marker (FSM) as an intermediate marker which works with a source flow three color marker (sf-TCM) operating as a host source marker. The proposed fair scalable marker improves the fairness among the TCP flows with different RTTs without per-flow management. Through the simulations, we show that the FSM can improve TCP fairness as well as link utilization in multiple domain DiffServ networks.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.9
• /
• pp.3008-3028
• /
• 2022

In this paper, we investigate traffic scheduling for a delay-sensitive multi-hop relay network, and aim to minimize the priority-based end-to-end delay of different data packet via joint relay selection, subcarrier assignment, and power allocation. We first derive the priority-based end-to-end delay based on queueing theory, and then propose a two-step method to decompose the original optimization problem into two sub-problems. For the joint subcarrier assignment and power control problem, we utilize an efficient particle swarm optimization method to solve it. For the relay selection problem, we prove its convexity and use the standard Lagrange method to deal with it. The joint relay selection, subcarriers assignment and transmission power allocation problem for each hop can also be solved by an exhaustive search over a finite set defined by the relay sensor set and available subcarrier set. Simulation results show that both the proposed routing scheme and the resource allocation scheme can reduce the average end-to-end delay.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.2
• /
• pp.197-203
• /
• 2011

Ad-hoc networks do not rely on a preexisting infrastructure such as Access Points(AP) in wireless network infrastructure. Instead each node participates in routing by forwarding data for other nodes. It makes required broadcasting to transmit packets to the whole network. In that part, each node tries to transmit data without any information about the other nodes. Therefore it causes duplication of transmission and waste of power. This paper presents adaptive probabilistic broadcasting schemes based on packet reception counts to alleviate the broadcast storm problem for wireless ad hoc networks. In this algorithm, each node calculates efficiency broadcast probability. Simulation results for the proposed flood algorithm are also presented.

• Proceedings of the IEEK Conference
• /
• 2003.07a
• /
• pp.214-217
• /
• 2003

In this paper, we deal with implementing design for a correlator access code generator module which they are used for setting up a connection between units, a packet decision, a clock syncronization, by FPGA. The orrelator module which is composed of the Wallace Tree's CSA and threshold value decision device decides useful a packet and syncronizes a clock, after it correlates an input signal of 1 Mbps transmission rate by a sliding window. An access code generator module which is composed of a BCH (Bose-Chadhuri-Hocquenghem) cyclic encoder and control device was designed according as a four steps' generation process proposed in the bluetooth standard. The pseudo random sequence which solves syncronization problem saved a voluntary device Proposed the module was designed by VHDL. An simulation and test are inspected by Xilinx FPGA.

• Journal of Advanced Navigation Technology
• /
• v.15 no.2
• /
• pp.241-247
• /
• 2011

Most of network congestions are caused by TCP packet losses in the wired network ecosystems. On the contrary, high BER (Bit Error Rate), which is characteristic of the wireless networks, is a main factor in wireless network environments. Many wireless networks carry out the congestion control mechanisms frequently because they estimate that packet losses are not due to the wireless signal qualities but the congestion controls in their networks. To solve this problem, we propose the improved EWLN (Explicit Wireless Loss Notification) algorithm that more efficiently utilize the congestion window size to increase the wireless network throughput than legacy EWLN algorithm.

• Journal of Advanced Navigation Technology
• /
• v.14 no.2
• /
• pp.253-259
• /
• 2010

Wireless mesh network is flexible network like Ad hoc network or bluetooth together based on base station. But, wireless mesh network shows high packet loss and when TCP was created, however as it was design based on wired link, wireless link made more transmission error than wired link. It is existent problem of TCP congestion control algorithm that TCP unfairness and congestion collapse over wireless mesh network. When TCP operation occurs with the packet loss where is not the congestion loss, it brings the performance degradation which is serious. In this paper, in order to improve efficient TCP congestion control algorithm in wireless mesh network, we proposed that TCP can adaptively regulate the congestion window in wireless link.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.2
• /
• pp.250-260
• /
• 1993

Packet Reservation Multiple Access(PRMA) protocol provides a very efficient mechanism for many number of voice and data terminals with bursty traffic characteristics to share efficiently a common transmission channel. This protocol, however, cannot operate in high load conditions. That is, there occurs a instability problem, since the reservation channel is allowed to shrink to zero. In this paper, a more stable PRMA protocol which can avoid such problems and integrates voice and data traffic efficiently is proposed. Also, the performance of the proposed protocol is analyzed by a computer simulation. According to the simulation results, it can be shown that the proposed protocol provides a more efficient mechanism for voice/data integration and ensures a more stable operation than conventional PRMA protocol in high load conditions.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.41 no.3
• /
• pp.47-54
• /
• 2004

By using wireless terminal, the number of users who wish to use the multimedia service like the Internet as well as Short Message Services and voice service has increased dramatically over the last years. We propose the method that improves Mobile IPv4 (MIPv4) Regional Registration in wireless mobile networks to decrease traffic's transmission delay and message generation compared with an existing method We design the scheme in MIPv4 environments that a packet do not pass through the home agent transmitted from correspondent node to mobile node, if a mobile node moves to other mobility agent. Simulation results show that the proposed method significantly reduces the expenses for registration and delivering packet.