• Journal of Internet Computing and Services
• /
• v.15 no.6
• /
• pp.1-8
• /
• 2014

As the e-learning spreads widely and demands on the internet video service, transmitting video data for many users over the Internet becomes popular. To satisfy this needs, the traditional approach uses a tree structure that uses the video server as the root node. However, this approach has the danger of stopping the video service even when one of the nodes along the path has a some problem. In this paper, we propose a video-on-demand service that uses multiple paths. We add new paths for backup and speed up for transmitting the video data. We show by simulation experiments that our approach provides a high-quality of video service.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.3
• /
• pp.149-156
• /
• 2011

In wireless multi-hop network, many applications need multicast communication where the group leader needs to send data to all members of the group. Multicast routing provides a balanced, efficient, and fairness network environment for the group members. However, large load for transmission management to leader node and signal interference between several paths for multi-hop links always took long transmission delay and low throughput efficiency. In this paper, we propose a Zone-based Hierarchical Multicast Routing Protocol (ZHMP). This routing protocol is designed based on zone routing schemes, where proactive routing is applied for intra-zone node level multicasting and reactive routing is used for searching inter-zone paths. By each hierarchical and independent multicast working in separated zones, load of multicast source node will be distributed by several zone-level routings for a better load balance and signal interference between each multi-hop paths will be resisted for a maximum multicast throughput.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39C no.11
• /
• pp.1068-1077
• /
• 2014

In this paper, we propose a novel method for path setup that optimizes energy consumptions for wireless sensor network. Existing studies usually generate paths according to Random way point approach so that it requires unnecessary energy consumptions for estimating location of the mobile sink node and transmission paths of packets. To address this problem, we propose a method that creates paths for mobile sink node using the Hilbert curve. Moreover, our method adjusts the path of the mobile sink node according to the density of sensor nodes to minimize data transmission delay. In our experiments, the proposed method outperforms existing work such as TTDD and CBPER by up to 50 times in terms of energy efficiency.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.19 no.1
• /
• pp.1-10
• /
• 2024

The radio propagation characteristics of the 6, 10, and 17 GHz frequency bands in multiple paths in an indoor lobby environment were analyzed. The line-of-sight (LOS) and non-LOS (NLOS) paths were measured from a distance of 2-16 m (0.5 m intervals) from the transmitting to the receiving antenna positions. For basic transmission losses, three parameters were compared using the floating intercept path loss model corresponding to the path. For a root mean square delay spread, the measurement results were compared for cumulative probabilities of 10, 50, and 90%. Propagation loss and propagation delay occurred in all measured frequencies owing to the existence of pillars and an unusual lobby structure. Thus, a measurement scenario for an indoor lobby environment and the provision of standard measurement data was proposed. The results may facilitate research on the radio propagation characteristics of 5G and millimeter-wave bands in indoor lobby environments with various structures.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.10 no.3
• /
• pp.101-109
• /
• 2011

In this paper, we present a new routing protocol, multipath and multi-priority based routing protocol, (MMRP) for wireless multimedia sensor networks. The proposed MMRP chooses the multiple routing paths from source to the sink, then the selected paths are assigned with different priority levels depending upon the residual energy and transmission delay in the routing paths. That is, the highly prioritized I frames of the MPEG video are transmitted over the high priority routing paths, and other P and B frames are transmitted over the lower priority routing paths. The proposed MMRP protocol can be applied to time critical applications which require both lower latency and low power consumption over wireless multimedia sensor network. Simulations results of MMRP protocol show respectively an improvement of 23.48% and 23.11% in energy conservation and 81.6% and 32.01% improvement in latency as compared to protocols without and with multipath routing.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.3
• /
• pp.1406-1424
• /
• 2017

Recent advancements in network infrastructures provide increased opportunities to support data delivery over multiple paths. Compared with multi-homing scenario, overlay network is regarded as an effective way to construct multiple paths between end devices without any change on the underlying network. Exploiting multipath characteristics has been explored for TCP with multi-homing device, but the corresponding exploration with overlay network has not been studied in detail yet. Motivated by improving quality of experience (QoE) for reliable data delivery, we propose a multipath message transport protocol based on application level relay (MPMTP-AR). MPMTP-AR proposes mechanisms and algorithms to support basic operations of multipath transmission. Dynamic feedback provides a foundation to distribute reasonable load to each path. Common source decrease (CSD) takes the load weight of the path with congestion into consideration to adjust congestion window. MPMTP-AR uses two-level sending buffer to ensure independence between paths and utilizes two-level receiving buffer to improve queuing performance. Finally, the MPMTP-AR is implemented on the Linux platform and evaluated by comprehensive experiments.

• The KIPS Transactions:PartA
• /
• v.17A no.1
• /
• pp.1-8
• /
• 2010

The fault diameter is one of the important measures for transmission rate and reliability of interconnection network. H.-O. Lee et al.[Parallel paths in folded hyper-star graph, Journal of KIPS, Vol.6, No.7, pp.1756-1769, 1999] suggested the node-disjoint paths of FHS (2n,n), and proved that the fault diameter of FHS(2n,n) is less than 2n-1. In this paper, we suggest an advanced node-disjoint paths of FHS(2n,n). We also prove that the wide diameter of FHS(2n,n) is dist(U,V)+4, and the fault diameter of FHS(2n,n) is less than n+2.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.2
• /
• pp.78-97
• /
• 2010

Route discovery in wireless mobile networks requires a considerable amount of resources due to the mobility of the hosts. Therefore, it would be wise to utilize the effort already invested in existing paths. This paper proposes an efficient way to reuse, whenever possible, existing paths when a new path is being established. In our proposed algorithm, called Route Reutilization Routing (RRR), the reusability is accomplished by the notion of the dynamic proactive zones (DPZ), through which nearby existing path information is disseminated. By utilizing the information stored in DPZs, RRR can achieve considerable savings over other on-demand routing algorithms that use flooding. The unique feature of the proposed algorithm is that DPZs are created and destroyed dynamically around the existing paths, whereas proactive zones are formed around the nodes throughout the network in other route finding algorithms. Even though using DPZs may not result in the shortest path between source and destination, simulation results show the considerable reduction in traffic needed to find a path and therefore increases the available bandwidth for data transmission.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.7
• /
• pp.1756-1769
• /
• 1999

Parallel paths in an interconnection network have some significance in that message transmission time can be reduced because message is divided into packets and transmitted in parallel through several paths, and also an whose nodes has 2n binary bit string, is an interconnection network which has a lower network cost than hypercube and its variation. In this paper, we analyze node disjoint parallel path in Folded Hyper-Star graph FHS(2n,n) proposed as the topology of parallel computers and, using the result, prove that the fault diameter of a Folded Hyper-Star graph FHS(2n,n) is 2n-1.

• Journal of Communications and Networks
• /
• v.16 no.3
• /
• pp.305-310
• /
• 2014

Optimal position of access point (AP) is important for multi-gigabit wireless transmission in terahertz (THz) wireless local area network (WLAN)-type applications, where there exist the THz characteristic multiple clusters in channel propagation. By considering the multiple clusters in THz indoor communications, this paper investigates the optimal AP position when two APs are issued for increasing the system capacity. Numerical results reveal that the central position of each AP within each half service region, which offers the shortest cumulated path length for line-of-sight paths, is optimal to achieve the maximal system capacity.