• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.3B
• /
• pp.224-236
• /
• 2003

MANET(Mobile Ad hoc networks) is a mobile, multi-hop, and wireless network which is bandwidth constrained, energy constrained, resource constrained, autonomous, and self operating systems with dynamic topology. These constraints make the routing between communicating nodes in ad hoc networks difficult. In this paper we survey several routing protocol for mobile ad hoc networks. Especially, we focus on Zone Routing Protocol, hybrid routing framework suitable for a wide of mobile ad hoc networks and analyze performance of ZRP. In the case of ZRP protocol, it is essential that the use of optimal zone radius for efficient use. Otherwise it was proved through an simulation that performance of whole network is rapidly decrease with greatly increasing overhead of ZRP traffic that need for transmission of packet by IARP or IERP traffic. Also we suggest the process of finding QoS path that use in-band signal for QoS routing in ad hoc network. This method guarantees route that make real time multimedia service for QoS enabled path.

• Journal of Communications and Networks
• /
• v.5 no.1
• /
• pp.73-81
• /
• 2003

The controlled load service defined within the IETF's Integrated Services architecture for quality-of-service (QoS) in the Internet requires source nodes to regulate their traffic while the network, in combination with an admission control strategy, provides a guarantee of performance equivalent to that achieved in a lightly loaded network. Packets sent in violation of the traffic contract are marked so that the network may assign them a lower priority in the use of bandwidth and buffer resources. In this paper, we define the requirements of a scheduler serving packets belonging to the controlled load service and present a novel scheduler that exactly achieves these requirements. In this set of requirements, besides efficiency and throughput, we include an additional important requirement to bound the additional delay of unmarked packets caused due to the transmission of marked packets while dropping as few marked packets as possible. Without such a bound, unmarked packets that are in compliance with the traffic contract are not likely to experience delays consistent with that in al lightly loaded network. For any given desired bound ${\alpha}$ on this additional delay, we present the CL(${\alpha}$) scheduler which achieves the bound while also achieving a per-packet work complexity of O(1) with respect to the number of flows. We provide an analytical proof of these properties of the CL(${\alpha}$) scheduler, and we also verify this with simulation using real traces of video traffic. The scheduler presented here may be readily adapted for use in scheduling flows with multi-level priorities such as in some real-time video streams, as well as in other emerging service models of the Internet that mark packets to identify drop precedences.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.3
• /
• pp.506-515
• /
• 2015

In this paper, we propose a group playback synchronization method using adaptive synchronization delay time by the bit rate of media to synchronize a play position of streaming media between mobile smart devices. This method consists of streaming server-side and client-side synchronization algorithms based on synchronization delay time which includes connection time, control packet transmission time, streaming data buffering time, and synchronization processing time. We implement the Android media player application with synchronization support using the proposed algorithms and present the result of performance evaluation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.5B
• /
• pp.243-252
• /
• 2008

In this paper, we propose the next-generation broadband wireless access network architecture, which is based on the wavelength division multiplexing-passive optical network(WDM-PON), and efficient mobility management scheme to support quality-of-service(QoS) of multimedia services in the next-generation wireless network. By adapting WDM-PON technology to wireless access network, the proposed scheme can realize broadband wireless access network. In addition, We utilize newly proposed local channels between optical network units(ONUs) or subnets in order to support the fast and efficient local data and handoff data transmission. We evaluate the performance of the proposed scheme in terms of handoff delay and packet loss thru computer simulation. Thru various computer simulation results, we verified the superior performance of the proposed scheme by comparing with the results of other schemes.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.3
• /
• pp.699-709
• /
• 1999

This paper is aimed at defining items of analysis using SNMP MIB-II for the purpose of managing the Internet based network running on TCP/IP protocol, and then utilize these items, in conjunction with various Web technology and JAVA to design and implement a Web based interface of a management system to analyze the performance and status of the Internet. Among the required items in order to accomplish this task are utilization, interface packet transmission rate, I/O traffic ratio, and so on. Based on these items, the actual analysis is carried out by the Web interface according to the type of analysis. For instance, the interface executes the function of real-time analysis, collection processing, elementary analysis and detailed analysis. The demand of the user is fed into the Web interface which carried out a real-time analysis with the client system which in turn will eventually produce the results of the analysis. In order words, the interface acts as a mediator server for the analysis system. Furthermore, a protocol for exchange of data and messages between the server and the analysis system, the MATP protocol, was also designed. Finally, the results obtained through the system presented in this paper were displayed on screen according to the type of analysis. The system realized in this paper uses We technology and is independent of platform and allows the user to determine the performance of Internet at his/her own host according to the selected items of analysis.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.1 no.2
• /
• pp.81-89
• /
• 2008

Improved EKF suggests variable path prediction to reduce the event traffic caused by the information sharing among multi-users in networked virtual environment. The three dimensional virtual space is maintained consistently by endless status information exchange among dispersed users, and periodic status transmission brings traffic overhead in network. By using the error between the measured movement trace of dynamic information and the EKF predicted, we propose the method applied to predict the mobile packet of dynamic data which is simultaneously changing. And, the simulation results of DIS dead reckoning algorithms and EKF path prediction is compared here. It followed the specific path and while moving, the proposed method which it proposes predicting with DIS dead reckoning algorithm and to compare to the mobile path of the actual object and it got near it predicts the possibility of knowing it was.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.05a
• /
• pp.886-889
• /
• 2010

Power consumption measurement in sensor network is difficult to proceed by survey in real field. Thus, through simulation, the power consumption is estimated and replacement time of nodes are decided. A simulation tool simulates various facts such as power consumption, packet transmission traffic, network topology and etc. In this paper, it suggests sensor node power model to simulate power consumption which has large importance among simulation facts in sensor network. This model omits calculating expressions that the data originally surveyed can substitute with, according to power consumption property of each functions in sensor node in order to minimize calculations in simulation. In this case accuracy of power consumption estimation will be reduced, but can simulate it faster due to reduced calculation. Suggested model is fitted to analyze power consumption difference between two or more sensor network algorithms with rapid simulation speed rather than accurate simulation.

• Journal of Korea Multimedia Society
• /
• v.7 no.5
• /
• pp.668-679
• /
• 2004

When users of mobile environments move fast or slow into a number of base stations(BS) and request the services of continuous media data such as video or audio, this study examines what the caching has the usefulness in mobile environments. Namely, to reduce packet disconnections and network overheads in mobile environments and minimize transmission delay time, we propose domain-based hierarchical caching structure and study whether application of caching has the usefulness. So we have a model based on user environments and hierarchical network structure to process continuous media services, and analyze the usefulness of caching which depends on the mobile patterns of user and the locations of caching nodes. And then, we research whether caching offers the usefulness in mobile environments. As the result, we are able to see that an adaptable application of caching is needed because the hit ratio and the number of replacement vary in large according to mobile patterns of user and locations of caching.

• 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.

• Journal of KIISE:Information Networking
• /
• v.33 no.1
• /
• pp.49-58
• /
• 2006

When the movement of a node breaks the route in ad-hoc network, on-demand routing protocol performs the local route recovery or a new route search for the route maintenance. And when it performs the new route search or the local search, the packet which is transmitted can be delayed. There are ARMP and RPAODV as the methods reducing the delay resulted from the route-breakage. They predict the route-breakage and construct an alterative local route before the occurrence of the route-breakage. When the link state is unstable, the success rate of the alternative local route that can avoid the route-breakage can give a direct effect on the route-breakage and the transmission delay, To estimate the performance of routing protocols avoiding route-breakage, we suggest the numerical formulas of AODV, the representative on-demand routing protocol, and ARMP, RPAODV. To verify the efficiency and accuracy of the proposed numerical formulas, we analysis and compare with the results of the computer simulation and that of the numerical formulas.