• Journal of KIISE:Information Networking
• /
• v.30 no.3
• /
• pp.307-315
• /
• 2003

This paper proposes a Multicast Tree Extension (MTE) scheme for multicast in IP-based wireless networks. If a group receiver Joins a multicast group in a visited foreign network, multicast service may be disrupted when the foreign network does not have a multicast router. To avoid disruption, our scheme creates a bi-directional tunnel between the previous foreign agent (FA) and new foreign agent, if a mobile node (MN) moves from a foreign network with multicast capability to another foreign network with non-multicast capability. The MN thus continues to receive the multicast packets through the tunnel from the previous FA. Our scheme can avoid a long latency due to a long tunneling for group membership as well as multicast service disruption, even if the MN enters foreign networks with non-multicast capability. Simulation results show that our scheme offers lower costs for multicast delivery, tunneling and handoff latency than the existing scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.7A
• /
• pp.706-714
• /
• 2010

In wireless sensor networks, real-time data delivery schemes typically achieve a desired delivery speed by performing one-hop lookahead. Recently, to reduce the deadline miss ratio against the desired delivery speed, a study has proposed a real-time routing protocol based on proactively performing two-hop lookahead. However, the study might cause heavy message exchange overhead and high computing complexity to carry out obtainment of two-hop neighborhood speed information in the entire sensor nodes whether data are delivered or not. Moreover, although multi-hop lookahead provides the least deadline miss ratio, due to the restriction from the overhead and the complexity, the recent study merely adopts the two-hop lookahead manner. In this paper, we propose a novel real-time routing protocol that adopts on-demand neighborhood multi-hop information obtainments only around data forwarding paths. Simulation results prove that the proposed routing protocol offers better performances with respect to deadline miss ratio, total communication costs, energy efficiency, and network lifetime.

• Journal of IKEEE
• /
• v.21 no.2
• /
• pp.115-122
• /
• 2017

In vehicular safety service, every vehicle broadcasts Basic Safety Message (BSM) periodically to inform neighbor vehicles of host vehicle information. However, this can cause network congestion in a region that is crowded with vehicles resulting in a reduction in the message delivery ratio and an increase in the end-to-end delay. Therefore, it could destabilize the vehicular safety service system. In this paper, in order to improve the congestion control and to consider the hidden node problem, we propose a congestion control scheme using entire network congestion level estimation combined with transmission power control, data rate control and time slot based transmission control algorithm. The performance of this scheme is evaluated using a Qualnet network simulator. The simulation result shows that our scheme mitigates network congestion in heavy traffic cases and enhances network capacity in light traffic cases, so that packet error rate is perfectly within 10% and entire network load level is maintained within 60~70%. Thus, it can be concluded that the proposed congestion control scheme has quite good performance.

• Journal of KIISE
• /
• v.42 no.3
• /
• pp.408-412
• /
• 2015

In base station based networks, traffic overload at the base station is inevitable. Peer-to-peer DTN which disperses the traffic overhead to each node can relieve the traffic overload at the base station. To increase the message delivery ratio and reduce the message overhead, we present novel routing using mobility information which can be obtained from each node, unlike the existing flooding based routings. In the proposed routing scheme, the routing decision metric, which is defined based on the node mobility information, is computed by using the expected distance between each node to the destination. The message is copied to other nodes that have lower expected distance to the destination than the value for the node willing to copy the message. We conducted simulations by using both a random mobility model and a real mobility trace to compare the performance of the proposed routing scheme to the existing routing scheme that does not utilize the mobility information. The performance evaluation showed the proposed routing successfully delivers messages with 10% to 30% less copies compared to previously proposed routing schemes.

• Journal of Communications and Networks
• /
• v.16 no.2
• /
• pp.155-161
• /
• 2014

Mobility can lead to continual loss of data and service interruptions during communications in multi-hop cognitive radio networks. Mobility of primary users (PUs) or cognitive users (CUs) requires adjustment of multi-hop communications among CUs to avoid any interference to PUs. To provide durable and reliable data routing that ensures continuous network service, we propose mobility-aware cognitive routing (MCR) for multi-hop cognitive radio networks. MCR examines the risk level of each node against interference regions and selects the most reliable path for data delivery using a Markov predictor. Through simulation, we verify that the proposed scheme can avoid route destruction preemptively and achieve reliable data delivery.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.7
• /
• pp.41-46
• /
• 2004

Two multicast delivery schemes are proposed to minimize the packet loss that occurs in the mobile multicast (MoM) protocol due to the handoff and relocation. The proposed schemes use a primary designated multicast service provider (DMSP) and a redundant or non-redundant backup DMSP. The simulation results verify that the proposed schemes greatly reduce the packet loss rate at the expense of the increased network traffic or the extra protocol overhead related to the operation of the non-redundant backup DMSP.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.10
• /
• pp.55-63
• /
• 2007

Multicast is an efficient transport mechanism for community communications and MANET is recently regarded as a promising solution for support ubiquitous computing as an underlying network technology. However, it is hard to deploy multicast mechanism into MANET owing to scarce resources in wireless networks and unpredictable changes in network topology. Several multicast mechanisms have been proposed in the literature to overcome the limitations. Especially, overlay multicasting schemes present several advantages over network based multicasting schemes. Yet, the overlay multicasting schemes still introduce redundant data transmissions that waste network bandwidth and battery of relay nodes. As a result the performance of the network is degraded. To reduce the redundancy, we propose an efficient way to construct an overlay structure as a multicast data delivery tree that utilizes a branch node which belongs to the tree. By using network simulation, we show that the proposed scheme presents higher packet delivery ratio and lower transmission cost than previously proposed schemes.

• Journal of Internet of Things and Convergence
• /
• v.10 no.2
• /
• pp.131-135
• /
• 2024

In the MQTT protocol, if the retained flag of a message published by a publisher is set, the message is stored in the broker as a retained message. When a new subscriber performs a subscribe, the broker immediately sends the retained message. This allows the new subscriber to perform updates on the current state via the retained message without waiting for new messages from the publisher. However, sending retained messages can become a traffic overhead if new messages are frequently published by the publisher. This situation could be considered an overhead when new subscribers frequently subscribe. Therefore, in this paper, we propose a retained message delivery scheme by considering the characteristics of the published messages. We model the delivery and waiting actions to new subscribers from the perspective of the broker using reinforcement learning, and determine the optimal policy through Q learning algorithm. Through performance analysis, we confirm that the proposed method shows improved performance compared to existing methods.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.7B
• /
• pp.679-689
• /
• 2006

Delivering multicast stream is one of the cost-saving approach in the large scale VOD environment. Because implementing VCR-like interactions for user's convenience in the multicast streaming system involves complex problems, we need the proper solutions for them. In this paper, we propose a hybrid scheme which uses the general P2P and the patching scheme with the Collaborative Interaction Streaming Scheme(CISS). CISS provides jumping functionability to the appropriate multicast session after VCR-like interaction in the environment in which multiple peers transmit VCR-like interaction streams to the VCR-like functionability request node to reduce the loads generated by frequent join or departure of peers at the multicast tree during providing VCR-like functionability. Therefore, with the proposed scheme we can distribute network traffic and reduce control overhead and latency. And to evaluate the performance of proposed scheme we compare it in the aspect of the performance of streaming delivery topology, control overhead and streaming quality with P2Cast[10] and DSL[11]. The simulation result shows that proposed P2Patching reduces about 30% of process overhead and enhances about $25{\sim}30%$ of streaming quality compared with DSL.

• Journal of Information Processing Systems
• /
• v.18 no.1
• /
• pp.1-11
• /
• 2022

Online video telephony systems have been increasingly used in several industrial areas because of coronavirus disease 2019 (COVID-19) spread. The existing session initiation protocol (SIP)-based video call system is being usefully utilized, however, there is a limitation that it is very inconvenient for users to transmit additional information during conversation to the other party in real time. To overcome this problem, an enhanced scheme is presented based on augmented real-time reality (AR). In this scheme, augmented information is automatically searched from the Internet and displayed on the user's device during video telephony. The proposed approach was qualitatively evaluated by comparing it with other conferencing systems. Furthermore, to evaluate the feasibility of the approach, we implemented a simple network application that can generate SIP call requests and answer with AR object pre-fetching. Using this application, the call setup time was measured and compared between the original SIP and pre-fetching schemes. The advantage of this approach is that it can increase the convenience of a user's mobile phone by providing a way to automatically deliver the required text or images to the receiving side.