• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.5
• /
• pp.950-956
• /
• 2015

In this paper, a WiMedia Distributed-MAC (D-MAC) protocol is adopted for development of a seamless N-screen wireless service in Indoor and Ship Area Networks. Furthermore, to provide the OSMU (One Source Multi Use) N-screen service through P2P streaming in the seamless D-MAC protocol, a ATMT (Asynchronous Traffic Multi-hop Transmission) technology is proposed and analyzed. In this system, a WiMedia ATMT D-MAC bridge transmits control and managing information to various sensors and instruments, from a central integrated ship area network station. For this technology, a time slot allocation scheme for WiMedia asynchronous traffic and a multi-hop resource reservation scheme are combined to evaluate the performance of each scheme. From simulation results, the proposed ATMT scheme enhances performances in viewpoints of N-screen asynchronous data latency and throughput, compared to the conventional WiMedia D-MAC system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.7B
• /
• pp.668-676
• /
• 2009

Hierarchical Mobile 1Pv6(HM1Pv6) have been proposed by IETF(Internet Engineering Task Force) beginning from Mobile 1Pv6 for mobility support in IP networks, however these researches relying on client based mobility support have not been drawn attention due to excessive consumption of wireless resources and long handover delay. In this paper, we propose the Router-based Binding Update(RBU) scheme to solve problems in existing client-based mobility support schemes. The router registers location information of mobile nodes through Neighbor Discovery protocol without additional codes for the RBU scheme to a terminal operated by existing HMlPv6. By using this the RBU scheme is designed so that it can support partial nupport based mobility and reduce handover latency rather than using HMIPv6. It is analysed and compared with existing HMIPv6 to verify efficiency of the RBU scheme. As a result, the RBU scheme has outperformed existing HMIPv6 by 15% in terms of macro handover delay especially when long delay on wireless links exists.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.11A
• /
• pp.1101-1112
• /
• 2006

With the recent growth in demand for high-data rate multimedia services in the wireless environments, the Mobile Broadband Wireless Access (MBWA) technologies, such as WiBro (Wireless Broadband internet) system, are gradually coming into the spotlight. Unlike the conventional mobile communication networks based on cellular system, the WiBro system basically consists of IP based backbone networks that will be ultimately deployed by Ipv6 (IP version six) based backbone networks according to the All-IP trend for the network evolution. In such wireless mobile environments, it is needed to support the mobility management protocol on network layer as well as physical layer and Medium Access Control (MAC) layer in WiBro system. Accordingly, in this paper, we propose a fast handover scheme for improving the handover performance in IPv6 based WiBro system and show that the proposed scheme achieves loss-free and low handover latency during inter-subnet movement of the mobile stations through the simulation.

• KIPS Transactions on Computer and Communication Systems
• /
• v.1 no.3
• /
• pp.205-218
• /
• 2012

Mobility management of the mobile nodes and provision of seamless handover is crucial to an efficient support for the global roaming of the mobile nodes in next-generation wireless networks. Mobile IPv6 and mobility management in extended IP layer, which highly depend on traffic characteristics and user mobility models, were proposed by the IETF. Therefore, to evaluate the in-depth performance about these factors is important. Generally, the performance of IPv6-based mobility management protocol is evaluated through simulation. This paper shows the correlation between network parameters and performance metrics through numerical results, which is investigated how influence handoff latency and packet loss. And this paper uses mathematical analysis of the system parameters, such as the subnet residence time, the packet arrival rate and delay in wireless connection through the analytical framework which evaluate the performance of IPv6-based mobility management protocol.

• The KIPS Transactions:PartC
• /
• v.13C no.7 s.110
• /
• pp.873-880
• /
• 2006

Since various networks are deployed and the most of users request higher mobility, there are many researches about the interworking between widely deployed 3G network and rapidly boarded WLAN. On the other side, WiBro is focused on as a next generation network, because many people expect that WiBro gives satisfaction about the enough mobility and mass data transmission. So the study of the integration between WiBro and cdma2000 will show better effects than the present study of the integration between WLAN and cdma2000. The L2 handoff proposed in this paper takes advantages over the existing L3 handoff scheme because it does not require the L3 procedure for the mobility unlike the L3 handoff. Through extensive computer simulations, the efficiency of the proposed scheme has been validated.

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

In this paper, we propose multicast technique in order to reduce the required network bandwidth by n times, by merging the adjacent multicasts depending on the number of HENs (Head-End-Nodes) n that request the same video. Allowing new clients to immediately join an existing multicast through patching improves the efficiency of the multicast and offers services without any initial latency. A client might have to download data through two channels simultaneously, one for multicast and the other for patching. The more the frequency of requesting the video is, the higher the probability of caching it among HENs increases. Therefore, the requests for the cached video data can be served by HENs. Multicast from server is generated when the playback time exceeds the amount of cached video data. Since the interval of multicast can be dynamically expanded according to the popularity of videos, it can be reduced the server's workload and the network bandwidth. We perform simulations to compare its performance with that of conventional multicast. From simulation results, we confirm that the Proposed multicast technique offers substantially better performance.

• Journal of KIISE:Information Networking
• /
• v.30 no.5
• /
• pp.649-655
• /
• 2003

Network-based computing such as cluster computing requires a reliable high-speed transport protocol. TCP is a representative reliable transport protocol on the Internet, which implements many mechanisms, such as flow control, congestion control, and retransmission, for reliable packet delivery. This paper, however, finds out that Myrinet does not incur any packet losses caused by network congestion. In addition, we ascertain that Myrinet supports reliable and ordered packet delivery. Consequently, most of reliable routines implemented in TCP produce unnecessarily additional overheads on Myrinet. In this paper, we show that we can attain the reliability only by flow control on Myrinet and propose a new reliable protocol based on UDP named RUM (Reliable UDP on Myrinet) that performs a flow control. As a result, RUM achieves a higher throughput by 45% than TCP and shows a similar one-way latency to UDP.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.12 no.7
• /
• pp.3176-3183
• /
• 2011

Traffic and congestion control in the wireless sensor network is an important parameter that decides the throughput and QoS (Quality of Service). This paper proposes a transmission rate priority-based traffic control scheme to serve digital contents streaming in wireless sensor networks. In this paper, priority for transmission rate decides on the real-time traffic and non-real-time with burst time and length. This transmission rate-based priority creates low latency and high reliability so that traffic can be efficiently controlled when needed. Traffic control in this paper performs the service differentiation via traffic detection process, traffic notification process and traffic adjustment. The simulation results show that the proposed scheme achieves improved performance in delay rate, packet loss rate and throughput compared with those of other existing CCF and WCA.

• Journal of Korea Multimedia Society
• /
• v.9 no.5
• /
• pp.606-614
• /
• 2006

The conventional on-demand mobile ad hoc routing algorithms (DSR and AODV) initiate route discovery only after a path breaks, incurring a significant cost and time in detecting the disconnection and establishing a new route. In this theory, we investigate adding proposed pro-active route selection and maintenance to the conventional on-demand mobile ad hoc routing algorithms(DSR and AODV). The key idea is to be only considered likely to be a path break when the received packet power becomes close to the minimum critical power and to be generated the forewarning packet when the signal power of a received packet drops below a optimal threshold value. After generated the forewarning packet, the source node can initiate rout discovery in advance; potentially avoiding the disconnection altogether. Our extensive simulation study shows that the proposed advance-active route selection and maintenance algorithms outperforms the conventional on-demand routing protocol based on DSR and AODV in terms of packet delivery ratio, packet latency and overhead.

• Journal of Korea Multimedia Society
• /
• v.10 no.9
• /
• pp.1165-1174
• /
• 2007

Mobile ad hoc networks suffer from the re-construction of the routing path as a node on the path moves away and/or fails. In this paper we propose a multipath routing scheme, designed for the network based on the directional antennas, in which a new path is quickly recovered by do-touring to an alternative neighbor called braid. Simulations are conducted in random networks with 50 nodes uniformly deployed in a $1,000m{\times}1,000M$ area where, all nodes have a transmission range of 250m and the average node moving speed varies from 0 to 10m/s. The proposed approach under the ideal antenna with K(>1) directional sectors achieves better results compared with the case of K=1, the omnidirectional antenna model, in terms of the metrics: packet delivery ratio and average number of hops for the routing paths. As further study, a scheme to alleviate the heavy amount of latency accompanied by the rout setup is urgently required.