• Proceedings of the Korea Society for Simulation Conference
• /
• 2003.06a
• /
• pp.61-66
• /
• 2003

Mobile IP has been designed only to maintain communication as they move form place to place, so it doesn't guarantee Quality of Service(QoS). QoS in mobile IP is important to provide multimedia and real-time applications services in mobile, and it is closely related to handoff delay. Therefore, handoff delay problem is actively studied to guarantee QoS as a main issue in mobile IP research area Next generation Mobile IPv6 resolve this problem somewhat, triangle problem for first packet and handoff delay still remain. In this paper, we suggest SNMP Information-based routing that adds keyword management method to Information-based routing in active network in order to resolve such a problem, and then suggest QoS controlled handoff based on SNMP Information-Based routing. After modeling of suggested method and existing handoff method simulations we carried out with NS-2 for performance evaluation. The results of simulations show the some improvement on handoff delay, and therefore on QoS improvement.

• Journal of Information Processing Systems
• /
• v.13 no.6
• /
• pp.1544-1553
• /
• 2017

The network coding mechanism has attracted much attention because of its advantage of enhanced network throughput which is a desirable characteristic especially in a multi-hop wireless network with limited link capacity such as the device-to-device (D2D) communication network of 5G. COPE proposes to use the XOR-based network coding in the two-hop wireless network topology. For multi-hop wireless networks, the Distributed Coding-Aware Routing (DCAR) mechanism was proposed, in which the coding conditions for two flows intersecting at an intermediate node are defined and the routing metric to improve the coding opportunity by preferring those routes with longer queues is designed. Because the routes with longer queues may increase the delay, DCAR is inefficient in delivering real-time multimedia traffic flows. In this paper, we propose a network coding-aware routing protocol for multi-hop wireless networks that enhances DCAR by considering traffic load distribution and link quality. From this, we can achieve higher network throughput and lower end-to-end delay at the same time for the proper delivery of time-sensitive data flow. The Qualnet-based simulation results show that our proposed scheme outperforms DCAR in terms of throughput and delay.

• Journal of Korea Multimedia Society
• /
• v.16 no.8
• /
• pp.943-953
• /
• 2013

By the enormous increase in mobile nodes and diverse service requests on wireless networks, wireless mesh network(WMN) takes an interest as the solution for such requests. However, lots of issues which should be solved to deploy WMN are still remained. In the network layer, the performance improvement of routing protocols is the major issue of nowadays researches. WMN can be easily deployed by use of protocols for mobile ad-hoc networks(MANET) because it is much similar with MANET in multi-hop wireless routing and which node plays as host and router concurrently. Unfortunately, most routing protocols for MANET have drawbacks such as large traffic overhead and long delay time for route discovery due to the network extension. They are major factors of performance degradation of WMN and most researches are focused on them. In this paper, domain-based AODV which is amended AODV to be applied in hybrid WMN is proposed. The proposed scheme divides a hybrid WMN as several domains and performs route discovery by header layer domain. Therefore it can reduce the distance for route discovery as much as average hop count between domain header and member nodes. From the simulation, domain-based AODV was showed slowly increasing delay time due to the network extension.

• Journal of Digital Convergence
• /
• v.12 no.1
• /
• pp.339-345
• /
• 2014

This study has a purpose that improves efficiency of energy management and adaptation followed by movement of node better than the various early studied routing techniques. The purpose of this paper is the technique that uses RSSI value and location of sensor that is received by each sensor node to routing. This sduty does not save node information of 1-hop distance. And it solves energy-inefficient traffic problem that happens during data exchange process for middle node selection in close range multi hop transmission technique. The routing protocol technique that is proposed in this study selects a node relevant to the range of transmission which is set for RSSI value that is received by each node and selects the closest node as a middle node followed by location data. Therefore, it is for not exhaustion of node's energy by managing energy efficiently and cutting data transmission consuming until the destination node.

• Journal of Korea Multimedia Society
• /
• v.7 no.10
• /
• pp.1436-1442
• /
• 2004

A shared-based tree established by the Core Based Tree multicast routing protocol (CBT), the Protocol Independent Multicast Sparse-Mode(PIM-SM), or the Core-Manager based Multicast Routing(CMMR) is rooted at a center node called core or Rendezvous Point(RP). The routes from the core (or RP) to the members of the multicast group are shortest paths. The costs of the trees constructed based on the core and the packet delays are dependent on the location of the core. The location of the core may affect the cost and performance of the shared-based tree. In this paper, we propose three methods for selecting the set of candidate cores. The three proposed methods, namely, k-minimum average cost, k-maximum degree, k-maximum weight are compared with a method which select the candidate cores randomly. Three performance measures, namely, tree cost, mean packet delay, and maximum packet delay are considered. Our simulation results show that the three proposed methods produce lower tree cost, significantly lower mean packet delay and maximum packet delay than the method which selects the candidate cores randomly.

• Journal of Korea Multimedia Society
• /
• v.16 no.10
• /
• pp.1196-1203
• /
• 2013

In general, the cost of transceiver for wireless network configuration is more expensive than that for wired network. However, in case of environmental management system in a tunnel, the cost can be minimized by adopting low rate tranceiver because the amount of the exchanged data for tunnel monitoring is very small. When the obtained data from sensor node is sent directly to the corresponding command node, there is no need to consider routing problem of the data transfer. However in this case, sensor nodes are required to be implemented with high power transmitter and experience high energy consumption. To tackle this problem, relay nodes can be used to transfer the data of tunnel monitoring, and suitable routing protocols for selecting optimum path are needed. Therefore, in this paper, we propose a routing algorithm and a self-configuration protocol for environment management system in tunnel.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.10A
• /
• pp.736-745
• /
• 2009

The growth of mobile devices and the increase of using them have required the support of realtime multimedia application in wireless environments. Especially, wireless ad-hoc networks without central management system and with dynamically changing network topology need much researches of QoS routing for multimedia applications. However it is impossible to support the hard realtime QoS for these dynamic networks. In this paper, we propose a QoS routing scheme by using QoS DAG that is maintained by each mobile node and contains the QoS information for neighbor nodes. In order to maintain the QoS DAG, each node transmits its QoS information to neighbor nodes by local broadcasting, and the neighbor nodes update their QoS DAGs by the received message. In our proposed scheme, it is possible to search the QoS path efficiently by the QoS DAG without searching it in the whole network.

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

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.281-284
• /
• 1998

The multimedia services like video-conferencing and interactive multimedia services require the support for the multipoint-to multipoint connections from the networks. The routing and signaling protocols for supporting these connections in ATM networks have been a interesting topics in the Telecommunication standardization sector such as ATM-Forum. In this paper, we survey and discuss the various well-known switching algorithms for multi-way communication.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2001.11a
• /
• pp.531-535
• /
• 2001

인터넷에서 가상현실 기법의 도입은 인터넷의 범용성과 함께 사용자가 쉽게 접할 수 있고 다양한 정보를 획득할 수 있기 때문에 지속적으로 발전해 가고 있다. VRML은 이러한 인터넷에서 가상세계를 구현하는 표준언어로 자리잡고 있다. 본 연구에서는 현재 많이 활용되고있는 VRML 저작툴인 ISA(Internet Scene Assembler)와 ISB(Internet Scene Builder)를 이용해 가상신호등 시스템을 설계하고 구현하는 것이 목적이다. 가상 신호등 시스템의 시뮬레이션을 위해 애니메이션 기법과 Sensor Node 및 Time_Bool_Converter 등의 Logic 함수를 사용하게 되고, Routing Diagram의 연결을 통해 시뮬레이션을 제작하게 된다.