• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 2004.07a
• /
• pp.60-60
• /
• 2004

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 2004.11a
• /
• pp.299-299
• /
• 2004

• Journal of Korea Multimedia Society
• /
• v.7 no.2
• /
• pp.187-193
• /
• 2004

Wireless networks play a very important role in communications today. For example, wireless networks today provide from the basic services like e-mail and FTP to the multimedia applications like Web service. It is obvious that QoS requirements to these diverse applications over wireless networks will continue as in wired networks. Much research has been done to develop QoS supporting algorithms on Internet. But due to the limited bandwidth and varying channel states of the wireless networks, it is difficult to support differentiated service over wireless networks. In this paper we propose the modified wireless token ring protocol supporting QoS to the real-time traffic service node over Internet environments in which non-real-time and real-time traffic service nodes coexist. In the proposed algorithm, the real-time traffic service node gets the priority to take token over the non-real-time traffic service node. So the proposed algorithm support quick transmission of the real-time traffic service node. And this advantage can be obtained with minor modification of the legacy wireless token ing protocol to support QoS. We also consider the lost token recovery mechanism.

• Journal of Korea Multimedia Society
• /
• v.19 no.10
• /
• pp.1808-1815
• /
• 2016

TPSN(Timing-sync Protocol for Sensor Networks), the representative of time synchronization protocol, has been already developed to provide time synchronization among nodes in wireless sensor networks. Even though the TPSN's method has been referenced by so many other time synchronization schemes for resource-constrained networks like wireless sensor networks or low power personal area networks, it has some inefficiency in terms of power consumption and network-wide synchronization time (or called convergence time). The main reason is that each node in TPSN needs waiting delay to solve the collision problem due to simultaneous transmission among competing nodes, which causes more power consumption and longer network convergence time for a network-wide synchronization. In this paper an improved scheme is proposed by changing message exchange method among nodes. The proposed scheme not only shortens network-wide synchronization time, but also reduce collision traffic which lead to needless power consumption. The proposed scheme's performance has been evaluated and compared with an original scheme by simulation. The results are shown to be better than the original algorithm used in TPSN.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.06d
• /
• pp.136-138
• /
• 2006

The high-rate Wireless Personal Area Networks (WPANs) which IEEE 802.15.3 standard support, foster the Digital Home Network (DHN) scenarios with high rate multimedia data transmission. Actually, there are a few routing protocols for ad-hoc networks which considered the terminal location information and routing metric to reduce the energy consumption and optimize the routing path in mobile system. Based on other routing protocols, this paper presents the reliable location-based routing algorithm which is an adaptation to these networks.

• Journal of information and communication convergence engineering
• /
• v.9 no.6
• /
• pp.775-779
• /
• 2011

As the technology of multimedia sensor networks is desired in large numbers of applications nowadays, real-time service becomes one of the most important research challenges. Even though lots of related works have been conducted to meet this requirement in several ways, the specific traffic model for real-time has not been taken yet. Thus, it causes lack of adaptability of those approaches in real deployment. To solve this problem, in this paper, we model the application via (m,k)-firm streams which have weakly hard real-time property. And then, a novel forwarding scheme based on modified DBP (Distance-Based Priority) is proposed by considering local-DBP and stream DBP together. Local-DBP can contribute to identify the detailed causes of unsatisfied quality, that is, network congestion or wireless link failure. Simulation results reveal that (m,k)-firm is a good traffic model for multimedia sensor networks and the proposed scheme can contribute to guarantee real-time requirement well.

• Journal of Korea Multimedia Society
• /
• v.18 no.9
• /
• pp.1083-1090
• /
• 2015

A generalized recursive circulant network(GR) is widely used in the design and implementation of local area networks and parallel processing architectures. In this paper, we investigate the routing of a message on this network, that is a key to the performance of this network. We would like to transmit maximum number of packets from a source node to a destination node simultaneously along paths on this network, where the i^th packet traverses along the i^th path. In order for all packets to arrive at the destination node securely, the i^th path must be node-disjoint from all other paths. For construction of these paths, employing the Hamiltonian Circuit Latin Square(HCLS), a special class of (n x n) matrices, we present O(n²) parallel routing algorithm on generalized recursive circulant networks.

• Proceedings of the Korea Multimedia Society Conference
• /
• 1998.04a
• /
• pp.366-370
• /
• 1998

One major limitation of the efficiency of parallel computer designs has been the prohibitively high cost of parallel communication between processors and memories. Linear order concentrators can be used to build theoretically optimal interconnection schemes. Current designs call for building superconcentrators from concentrators, then using these to recursively partition the connection streams O(log2N) times to achieve point-to-point routing. Since the superconcentrators each have O(N) hardware complexity but O(log2N) depth, the resulting networks are optimal in hardware, but they are of O(log2N) depth. This pepth is not better than the O(log2N) depth Bitonic sorting networks, which can be implemented on the O(N) shuffle-exchange network with message passing. This paper introduces a new method of constructing networks using linear order concentrators and expanders, which can be used to build interconnection networks with O(log2N) depth as well as O(Nlog2N) hardware cost. (All logarithms are in base 2 throughout paper)

• 한국정보통신설비학회:학술대회논문집
• /
• 2009.08a
• /
• pp.91-96
• /
• 2009

In Public Switched Telephone Networks(PSTN) number portability is implemented by utilizing Intelligent Network(IN) functions for number mapping. And voice over IP(VoIP) and IP Multimedia Subsystem(IMS) networks can deploy number portability by using E.164 Number Mapping(ENUM). This paper discuss the possibility of using E.164 Number Mapping(ENUM) for number portability in voice over IP/IP Multimedia Subsystem and Public Switched Telephone Networks, eliminating the need for Number Portability Database(NPDB) for number portability routing data in Public Switched Telephone Networks.

• Journal of Korea Multimedia Society
• /
• v.21 no.3
• /
• pp.391-399
• /
• 2018

In this paper, we construct and compare various guitar chord classification systems using perceptron neural network and convolutional neural network without pre-processing other than Fourier transform to identify the optimal chord classification system. Conventional guitar chord classification schemes use, for better feature extraction, computationally demanding pre-processing techniques such as stochastic analysis employing a hidden markov model or an acoustic data filtering and hence are burdensome for real-time chord classifications. For this reason, we construct various perceptron neural networks and convolutional neural networks that use only Fourier tranform for data pre-processing and compare them with dataset obtained by playing an electric guitar. According to our comparison, convolutional neural networks provide optimal performance considering both chord classification acurracy and fast processing time. In particular, convolutional neural networks exhibit robust performance even when only small fraction of low frequency components of the data are used.