• Journal of the Korea Society of Computer and Information
• /
• v.11 no.5 s.43
• /
• pp.165-173
• /
• 2006

Network Mobility Basic Support protocol enables mobile network to change their point of attachment to the Internet, but causes some problems such as suboptimal muting and multiple encapsulations. The proposed scheme, combining Prefix Delegation protocol with HMIPv6 concept can provide more effective route optimization and reduce the amount of packet losses and the burden of location registration for handoff. It also uses hierarchical mobile network prefix (HMNP) assignment and provides tree-based routing mechanism to allocate the location address of mobile network nodes (MNNs) and support micro-mobility. In this scheme, Mobility Management Router (MMR) not only maintains the binding informations for all MNNs in nested mobile networks, but also supports binding procedures to reduce the volume of handoff signals oyer the mobile network. The performance is evaluated using NS-2.

• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.101-104
• /
• 2000

Nowadays, the issue of congestion control in high-speed communication networks becomes critical in view of the bandwidth-delay products for efficient data flow. In particular, the fact that the congestion is often accompanied by the data flow from the high-speed link to low-speed link is important with respect to the stability of closed-loop congestion control. The Virtual-Connection Network (VCN) in Gigabit Ethernet networks is a packet-switching based network capable of implementing cell- based connection, link-by-link flow-controlled connection, and single- or multi-destination virtual connections. VCN described herein differ from the virtual channel in ATM literature in that VCN have link-by-link flow control and can be of multi-destination. VCNs support both connection-oriented and connectionless data link layer traffic. Therefore, the worst collision scenario in Ethernet CSMA/CD with virtual collision brings about end-to-end delay. Gigabit Ethernet networks based on CSMA/CD results in non-deterministic behavior because its media access rules are based on random probability. Hence, it is difficult to obtain any sound mathematical formulation for congestion control without employing random processes or fluid-flow models. In this paper, an analytical method for the design of a congestion control scheme is proposed based on Smith＇s principle to overcome instability accompanied with the increase of end-to-end delays as well as to avoid cell losses. To this end, mathematical analysis is provided such that the proposed control scheme guarantees the performance improvement with respect to bandwidth and latency for selected network links with different propagation delays. In addition, guaranteed bandwidth is to be implemented by allowing individual stations to burst several frames at a time without intervening round-trip idle time.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.4
• /
• pp.831-840
• /
• 2010

While Wireless Internet services were activated, many users got possible to use various Internet services without limitation in location. In particular, the demands to Wireless Internet Services are getting expanded because mobile devices that support high mobility are getting smarter. However, if a user uses various wireless networks, much limitation occurs in network setting when they move to another network. This is because there are few appropriate Handover Mechanisms to support Heterogeneous Network. So, this paper propose that Fast-Handover for Vertical Network Handover with MIH in PMIPv6 to support heterogeneous network and to reduce the handover latency time. Analysis result presented in this paper shows that by carefully selecting suitable system configuration model and parameters, suggestion has reduced latency time of 26% and packet losses of 90% (Avg.) at the maximum in comparison with original PMIPv6 handover.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.6B
• /
• pp.867-874
• /
• 2010

Since high packet losses occur in multi-hop transmission of wireless sensor networks, reliable data transmission is required. Especially, in case of event-driven data, a loss recovery mechanism should be provided for lost packets. Because retransmission for lost packets is requested to a node that caches the packets, the caching node should maintains all of data for transmission in its buffer. However, nodes of wireless sensor networks have limited resources. Thus, both a loss recovery mechanism and a buffer management technique are provided for reliable data transmission in wireless sensor networks. In this paper, we propose a buffer management technique at a caching position determined by a loss recovery mechanism. The caching position of data is determined according to desirable reliability for the data. In addition, we validate the performance of the proposed method through computer simulations.

• The KIPS Transactions:PartC
• /
• v.16C no.1
• /
• pp.57-64
• /
• 2009

In order to efficiently provide IP based Wireless Broadband services in Mobile WiMAX, schemes for more efficiently utilizing a limited bandwidth in radio links are needed. Robust Header Compression (ROHC), a standard header compression scheme proposed by IETF, Bi-directional Optimistic (O) mode provides higher compression efficiency and robustness compared with Payload Header Suppression (PHS) which is an optional header compression scheme for mobile WiMAX [1, 2]. However, if consecutive packet losses occur because of a Shadow Region of Mobile WiMAX or bit errors, header decompression failure rate of the ROHC O mode increases due to inconsistency of the compression information between the Compressor and the Decompressor. Therefore, a complementary mechanism is needed. In this paper, we propose an approach for the dynamic adjustment of an optimistic parameter, which has an effect on both the compression efficiency and the robustness, for improving the performance of ROHC O mode. We also analyze the performance of the proposed approach using an OPNET simulator.

• The KIPS Transactions:PartB
• /
• v.12B no.7 s.103
• /
• pp.755-760
• /
• 2005

To transmit a video bit stream over low bandwith, such as mobile, channels, encoding algorithms for high bit rate like H.263+ are used. In transmitting video bit-streams, packet losses cause severe degradation in image quality. This paper proposes a new algorithm for the recovery of missing or erroneous motion vectors when H.263+ bit-stream is transmitted. Considering that the missing or erroneous motion vectors are closely related with those of neighboring blocks, this paper proposes a temporal-spatial error concealment algorithm. The proposed approach is that missing or erroneous Motion Vectors(MVs) are recovered by clustering the movements of neighboring blocks by their homogeneity. MVs of neighboring blocks we clustered according to ALA(Average Linkage Algorithm) clustering and a representative value for each cluster is determined to obtain the candidate MV set. By computing the distortion of the candidates, a MV with the minimum distortion is selected. Experimental results show that the proposed algorithm exhibits better performance in subjective and objective evaluation than existing methods.

• Journal of Korea Multimedia Society
• /
• v.5 no.1
• /
• pp.68-76
• /
• 2002

Multicast in mobile host has the problem of hast mobility, multicast decision, triangle routing, tunnel convergence, implosion of retransmission, and bandwidth waste. In particular, the bandwidth waste in radio is a definite factor that decreases transmission rate. To solve the problems, this paper proposes a new multicast transmission protocol called FIM(Forward Error Correction Integrated Multicast), which supports reliable packet recovery mechanism by integrating If Mobility Support for the host mobility, IGMP(Interned Group Management Protocol) for the group management, and DVMRP(Distance Vector Multicast Routing Protocol) for the multicast routing, and it also uses FEC and the local recovery method based on receiver. The performance measurement is performed by dividing the losses into the homogeneous independent loss, the heterogeneous independent loss, and the shared source link loss model.. The result shows that the performances improves in proportion to the size of local areal group when the size of transmission group exceeds designated size. This indicates FIM is effective in the environment where there are much of data and many receivers in the mobile host.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.39 no.6
• /
• pp.623-629
• /
• 2002

In transmitting compressed video bit-stream over Internet, packet losses cause error propagations in both spatial and temporal domains, which in turn leads to severe degradation I image quality. In this paper, a new error concealment algorithm, called EBMA(Edge Detection based Boundary Matching Algorithm), is proposed to repair damaged portions of the video frames in the receiver. Conventional BMA(Boundary Matching Algorithm) assumes that the pixels on the boundary of the missing block and its neighboring blocks are very similar, but has no consideration of edges across the boundary. In our approach, the edges are detected across the boundary of the lost or erroneous block. Once the orientation of each edge is found, only the pixel difference along the expected edges across the boundary is measured instead of the calculation of difference along the expected edges across the boundary is measured instead of the calculation of differences between all adjacent pixels on the boundary Therefore, the proposed approach needs very few computations and the experiment shows and improvement of the performance over the conventional BMA in terms of both subjective and objective quality of video sequences.

• The KIPS Transactions:PartC
• /
• v.15C no.5
• /
• pp.399-408
• /
• 2008

Mobile WiMAX provides wireless broadband services for data communication based on IP protocol. The limitation of physical bandwidth in the radio links may cause performance degradation in providing wireless broadband services in WIMAX. To enhance the efficiency of the radio link utilization, Payload Header Suppression (PHS) is defined as an optional header compression mechanism for mobile WiMAX. It has, however, a very limited compression capability since it has very restrictive compression fields. In this paper, hence, we assumed the application of Robust Header Compression (ROHC), a header compression scheme proposed for links characterized by high bit error ratios, long round-trip times (RTT), and scarce resource, to Mobile WiMAX, and studied its performance. Previous studies on ROHC performance merely focused on the impact of high bit error rate. However, bit error is virtually transparent to ROHC in the wireless systems like WiMAX, since the MAC provides the bit error checking function. In order to evaluate the performance of ROHC in the Mobile WiMAX environments, therefore, we evaluated the performance of ROHC with respect to the packet losses instead of bit error. We investigated the impact of the ROHC parameters that are recommended for the implementation in the ROHC and compared the performance of ROHC with PHS.

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

Recently, the high-speed Internet users increase rapidly and broadband networks have been widely deployed. However, the current TCP congestion control algorithm was designed for relatively narrowband network environments, and thus its performance is inefficient for traffic transport in broadband networks. To remedy this problem, the TCP having an enhanced congestion control algorithm is required for broadband networks. In this paper, we propose an improved TCP congestion control that can sufficiently utilize the large available bandwidth in broadband networks. The proposed algorithm predicts the available bandwidth by using ACK information and RTT variation, and prevents large packet losses by adjusting congestion window size appropriately. Also, it can rapidly utilize the large available bandwidth by enhancing the legacy TCP algorithm in congestion avoidance phase. In order to evaluate the performance of the proposed algorithm, we use the ns-2 simulator. The simulation results show that the proposed algorithm improves not only the utilization of the available bandwidth but also RTT fairness and the fairness between contending TCP flows better than the HSTCP in high bandwidth delay product network environment.