• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.10A
• /
• pp.896-905
• /
• 2005

In this paper, we propose a SPD(Selective Packet Delay) scheme to improve the performance of High-Speed Downlink Shared Channel(HS-DSCH) employing N-Channel Stop and Wait retransmission scheme in High Speed Downlink Packet Access(HSDPA) system. The proposed SPD coordinates packet transmissions according to the channel condition. When the channel condition is bad, packet transmission is forcedly delayed, and the designated time slot is set over to other users in good channel condition. Hence, the SPD is able to reduce the average transmission delay for packet transmission under the burst error environments. In addition, we propose two packet scheduling schemes called SPD-LDPF(Long Delayed Packet First) and SPD-DCRR(Deficit Compensated Round Robin) that are effectively combined with the SPD scheme. Simulation results show that the proposed scheme has better performance in terms of delay, throughput and fairness.

• Journal of IKEEE
• /
• v.7 no.2 s.13
• /
• pp.288-298
• /
• 2003

We consider a window-controlled selective-repeat ARQ scheme for error control between two adjacent nodes lying on a communication path. In this scheme, each packet to be transmitted is endowed with a serial number in a cyclic and sequential fashion. In turn, the transmitting node is not allowed to transmit a packet belonging to a window before every packet in the previous window is positively acknowledged. Such postponement of packet transmission incurs a degradation in throughput and delay performance. In this paper, aiming at improving packet delay performance, we employs a supplement scheme in which a serial number is duplicated within a frame. Classifying duplication rules into fixed, random and adaptive categories, we present candidate rules in each category and evaluate the packet delay performance induced by each duplication rule. From numerical examples, we observe that duplicating serial numbers, especially ADR-T2 effectively reduces mean packet delay for the forward channel characterized by a low packet error rate. We also reveal that such delay enhancement is achieved by a high probability of hitting local optimal window size.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.11B
• /
• pp.930-937
• /
• 2004

In this paper, we analyze the delay performance for a Markovian source transported over a wireless channel with time-varying error characteristics. To improve the reliability of the channel, the end points of the wireless link implement a selective-repeat (SR) ARQ error control protocol. We provide an approximate discrete-time analysis of the end-to-end mean packet delay, which consists of transport and resequencing delays. Numerical results and simulations indicate that our approximate analysis is sufficiently accurate for a wide range of parameter values.

• The KIPS Transactions:PartC
• /
• v.15C no.6
• /
• pp.523-530
• /
• 2008

In this paper, we analyze the mean queuing delay of selective-repeat automatic repeat request (SR-ARQ) protocol with the finite retransmission persistence. The retransmission persistence means the willingness of the protocol to retransmit a lost (or corrupted) packet to ensure reliable packet delivery across a lossy link. According to the retransmission persistence, SR-ARQ protocols have a different performance in terms of both packet delay and link reliability. So far, however, there is no serious study in the effect of the retransmission persistence on the SR-ARQ performance. We present a simple M/G/1 queuing model for the SR-ARQ protocol with the finite retransmission persistence by using the ideal SR-ARQ approximation. The mean queuing delay is obtained from the queuing model and verified its accuracy through the simulation results using the OPNET simulator. Both the analytical predictions and simulation results clearly show the effect of retransmission persistence on the queuing delay of the SR-ARQ protocol in various network conditions: packet loss rate and traffic condition over a wireless link.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.3
• /
• pp.556-563
• /
• 2009

HMIP, an extending version of MIP, makes the signaling traffic low, thereby reducing the packet losses and delay. However, it still has the same problem in MIPv6 in the case of macro mobility, though it can reduce the out-signaling in the case of a micro mobility, a regional mobility with the MAP protocol. To overcome this problem, this paper proposes a handover which exploits an address insurance with selective buffering for the HMIP macro handover. This scheme can decrease the lost packets and the delay time and provide better performance for high QoS traffic and real-time multimedia transmission. The simulation result shows that the proposed scheme makes the transmission delay time and the lost packets smaller than the existing schemes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.11
• /
• pp.5354-5369
• /
• 2019

Sensor networks are deployed in unheeded environment to monitor the situation. In view of the unheeded environment and by the nature of their communication channel sensor nodes are vulnerable to various attacks most commonly malicious packet dropping attacks namely blackhole, grayhole attack and sinkhole attack. In each of these attacks, the attackers capture the sensor nodes to inject fake details, to deceive other sensor nodes and to interrupt the network traffic by packet dropping. In all such attacks, the compromised node advertises itself with fake routing facts to draw its neighbor traffic and to plunge the data packets. False routing advertisement play vital role in deceiving genuine node in network. In this paper, behavior based routing misbehavior detection (BRMD) is designed in wireless sensor networks to detect false advertiser node in the network. Herein the sensor nodes are monitored by its neighbor. The node which attracts more neighbor traffic by fake routing advertisement and involves the malicious activities such as packet dropping, selective packet dropping and tampering data are detected by its various behaviors and isolated from the network. To estimate the effectiveness of the proposed technique, Network Simulator 2.34 is used. In addition packet delivery ratio, throughput and end-to-end delay of BRMD are compared with other existing routing protocols and as a consequence it is shown that BRMD performs better. The outcome also demonstrates that BRMD yields lesser false positive (less than 6%) and false negative (less than 4%) encountered in various attack detection.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.2
• /
• pp.392-401
• /
• 2007

Wireless network has high BER characteristic because of path loss, fading, noise and interference. Many packet losses occur without any congestion in wireless network. Therefore, many wireless TCP algorithms have been proposed. SNOOP, one of wireless TCP algorithms, hides packet losses for Fixed Host and retransmits lost packets in wireless network. However, SNOOP has a weakness for bust errors in wireless network. This paper proposes the SACK-SNOOP to improve TCP performance based on SNOOP and Freeze-TCP that use ZWA messages in wireless network. This message makes FH stop sending packets to MH. BS could retransmit error packets to MH for this time. SACK-SNOOP use improved Selective ACK, thereby reducing the number of packet sequences according to error environment. This method reduces the processing time for generation, transmission, analysis of ACK. This time gain is enough to retransmit local burst errors in wireless link. Furthermore, SACK-SNOOP can manage the retransmitted error by extending delay time to FH. The simulation shows that our proposed protocol is more effective for packet losses in wireless networks.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.3A
• /
• pp.240-248
• /
• 2006

In this paper, we consider an OFDM receiver algorithm design for IEEE 802.11a/p system, which targeting large coverage area while keeping the transmission format unchanged. Particularly, taking into account the inter-symbol interference(ISI) and inter-carrier interference(ICI) that can be induced with large RMS delay spread, we employ channel shortening time-domain equalizer(TEQ) and evaluate the receiver performance in terms of SINR and packet error rate(PER). The preamble defined in IEEE802.11a/p is used to estimated the initial equalizer tap coefficients. Primary purpose of the paper is to give an answer to the question, though partially, whether or not 16-QAM constellation can be used in none line of sight environment at the boundary of a large coverage area. To this end, we first analyze the required TEQ parameters for the target channel environment and then perform simulation for PER performance evaluation in a generic frequency selective fading channel with exponential power-delay profile.

• The KIPS Transactions:PartC
• /
• v.11C no.3
• /
• pp.379-386
• /
• 2004

The WAP 2.0 system is a newly proposed wireless communication system by the WAP Forum for interoperability across Internet environment and the system takes charge of communication between WAP terminals and existing origin Web servers. The purpose of this paper is 1) to construct a WAP 2.0 proxy proposed by the WAP Forum and 2) to improve the WAP Proxy in order to increase communication efficiency between wired and wireless communication objects. The Improved WAP proxy constructed in this study provides links between wired and wireless communication environments using the split-TCP concept. However, unlike the split-TCP connection, The improved WAP proxy maintains TCP's end-to-end semantics and reduces overhead by avoiding operations as much as possible on the upper protocol layer. In addition, The improved WAP proxy supports SACK(Selective Acknowledgement ) option and Timestamp option for speedy re-transmission which leads to reduction of performance degradation. After constructing the improved WAP proxy under Linux environment, experiments have been taken. The experimental results show that, compared with the experiments when a WAP proxy proposed by the WAP Forum is used, both data transmission delay time and data transmission size decrease to show that communication efficiency is increased. In particular, as packet missing ratio Increases, data transmission size decreases, which demonstrates that the improved WAP proxy is very effective for performance improvement in wireless communication environment.

• Journal of Communications and Networks
• /
• v.5 no.3
• /
• pp.266-274
• /
• 2003

One of the major issues in current on-demand routing protocols for ad hoc networks is the high resource consumed by route discovery traffic. In these protocols, flooding is typically used by the source to broadcast a route request (RREQ) packet in search of a route to the destination. Such network-wide flooding potentially disturbs many nodes unnecessarily by querying more nodes than is actually necessary, leading to rapid exhaustion of valuable network resources such as wireless bandwidth and battery power. In this paper, a simple optimization technique for efficient route discovery is proposed. The technique proposed herein is location-based and can be used in conjunction with the existing Location-Aided Routing (LAR) scheme to further reduce the route discovery overhead. A unique feature of our technique not found in LAR and most other protocols is the selective use of unicast instead of broadcast for route request/query transmission made possible by a novel reuse of routing and location information. We refer to this new optimization as the UNIQUE (UNIcast QUEry) technique. This paper studies the efficacy of UNIQUE by applying it to the route discovery of the Dynamic Source Routing (DSR) protocol. In addition, a comparative study is made with a DSR protocol optimized with only LAR. The results show that UNIQUE could further reduce the overall routing overhead by as much as 58% under highly mobile conditions. With less congestion caused by routing traffic, the data packet delivery performance also improves in terms of end-to-end delay and the number of data packets successfully delivered to their destinations.