• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.1
• /
• pp.157-176
• /
• 2011

An interest-based P2P constructs the peer connections based on similarities for efficient search of resources. A clustering technique using peer similarities as data is an effective approach to group the most relevant peers. However, the separation of groups produced from clustering lowers the scalability of a P2P network. Moreover, the interest-based approach is only concerned with user-level grouping where topology-awareness on the physical network is not considered. This paper proposes an efficient scalable search for the interest-based P2P system. A scalable multi-ring (SMR) based on fuzzy clustering handles the grouping of relevant peers and the proposed scalable search utilizes the SMR for scalability of peer queries. In forming the multi-ring, a minimized route function is used to determine the shortest route to connect peers on the physical network. Performance evaluation showed that the SMR acquired an accurate peer grouping and improved the connectivity rate of the P2P network. Also, the proposed scalable search was efficient in finding more replicated files throughout the peer network compared to other traditional P2P approaches.

• Journal of Multimedia Information System
• /
• v.8 no.2
• /
• pp.101-110
• /
• 2021

In computer vision, single-image super resolution has been an area of research for a significant period. Traditional techniques involve interpolation-based methods such as Nearest-neighbor, Bilinear, and Bicubic for image restoration. Although implementations of convolutional neural networks have provided outstanding results in recent years, efficiency and single model multi-scalability have been its challenges. Furthermore, previous works haven't placed enough emphasis on real-number scalability. Interpolation-based techniques, however, have no limit in terms of scalability as they are able to upscale images to any desired size. In this paper, we propose a convolutional neural network possessing the advantages of the interpolation-based techniques, which is also efficient, deeming it suitable in practical implementations. It consists of convolutional layers applied on the low-resolution space, post-up-sampling along the end hidden layers, and additional layers on high-resolution space. Up-sampling is applied on a multiple channeled feature map via bicubic interpolation using a single model. Experiments on architectural structure, layer reduction, and real-number scale training are executed with results proving efficient amongst multi-scale learning (including scale multi-path-learning) based models.

• Journal of Communications and Networks
• /
• v.11 no.3
• /
• pp.248-260
• /
• 2009

To connect a mobile ad hoc network (MANET) with an IP network and to carryout communication, ad hoc network node needs to be configured with unique IP adress. Dynamic host configuration protocol (DHCP) server autoconfigure nodes in wired networks. However, this cannot be applied to ad hoc network without introducing some changes in auto configuration mechanism, due to intrinsic properties (i.e., multi-hop, dynamic, and distributed nature) of the network. In this paper, we propose a scalable autoconfiguration scheme for MANETs with hierarchical topology consisting of leader and member nodes, by considering the global Internet connectivity with minimum overhead. In our proposed scheme, a joining node selects one of the pre-configured nodes for its duplicate address detection (DAD) operation. We reduce overhead and make our scheme scalable by eliminating the broadcast of DAD messages in the network. We also propose the group leader election algorithm, which takes into account the resources, density, and position information of a node to select a new leader. Our simulation results show that our proposed scheme is effective to reduce the overhead and is scalable. Also, it is shown that the proposed scheme provides an efficient method to heal the network after partitioning and merging by enhancing the role of bordering nodes in the group.

• Journal of Broadcast Engineering
• /
• v.13 no.1
• /
• pp.34-42
• /
• 2008

This paper proposes the mechanism which improves the qualify of video on a limited network bandwidth by applying the ROI technique to an H.264 Scalable Extension technique. The network environment assumed in this parer is the next generation network convergence environment in which the mobile device has one or more network interfaces. Therefore, we allocate the priority to video packets as the hierarchy structure of H.264 SVC-encoded video stream and ROI information, and transmit those packets over appropriate network channel for using those multiple network interfaces. This paper shows two experiments first one is extracting and allocating the video stream on an appropriate network channel, second one is unequal packet transmission by allocated priorities (e.g. ROI). Performance evaluations show that this approach delivers an improved decoded video quality when compared with conventional transmission schemes, especially on device which has multiple network interfaces.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.2
• /
• pp.901-923
• /
• 2017

Efficient key distribution and management mechanisms as well as lightweight ciphers are the main pillar for establishing secure wireless sensor networks (WSN). Several symmetric based key distribution protocols are already proposed, but most of them are not scalable, yet vulnerable to a small number of compromised nodes. In this paper, we propose an efficient and scalable key management and distribution framework, named KMMR, for large scale WSNs. The KMMR contributions are three fold. First, it performs lightweight local processes orchestrated into upward and downward tiers. Second, it limits the impact of compromised nodes to only local links. Third, KMMR performs efficient secure node addition and revocation. The security analysis shows that KMMR withstands several known attacks. We implemented KMMR using the NesC language and experimented on Telosb motes. Performance evaluation using the TOSSIM simulator shows that KMMR is scalable, provides an excellent key connectivity and allows a good resilience, yet it ensures both forward and backward secrecy. For a WSN comprising 961 sensor nodes monitoring a 60 hectares agriculture field, KMMR requires around 2.5 seconds to distribute all necessary keys, and attains a key connectivity above 96% and a resilience approaching 100%. Quantitative comparisons to earlier work show that KMMR is more efficient in terms of computational complexity, required storage space and communication overhead.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.1 no.3
• /
• pp.91-96
• /
• 2008

An image scalablity function is noted as technology to embody One Source-Multi-use's Image division by the network Bandwidth and diversification of resolution of reception terminal recently. In MPEG present H.264/MPEG-4 AVC that do to standardization of SVC (Scalable Video Coding) that know go and SVC can offer space time SNR scalability. But, encoding that do scalable usually is known that encoding efficiency drops than encoding that do rain scalable during time and treatise that see. Examine technique to plan improvement of management quality as that aim to time, SNR scalability in treatise that see so and change FGS (Fine Granular Scalability) function that offer SNR scalability that do about scalability's particle size and encoding efficiency relation by SVC to foundation.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.9
• /
• pp.1679-1686
• /
• 2007

Clustering is a topology control approach often used in wireless ad hoc networks to improve scalability and prolong network lifetime. Furthermore, it is also employed to provide semi-management functionalities and capacity enhancement. The usage of clustering topology control technique can also be applied to multi-radio wireless mesh network. This would utilize the advantages of the multi-radio implementation in the network. The aggregation would result to a more stable, connected, scalable and energy-efficient network. On this paper, we design a clustering algorithm for multi-radio wireless mesh network that would use these advantages and would take into consideration both mobility and heterogeneity of the network entities. We also show that the algorithm terminates at a definite time t and the message control overhead complexity is of constant order of O(1) per node.

• Journal of Korea Multimedia Society
• /
• v.15 no.3
• /
• pp.299-311
• /
• 2012

Recently, H.264 SE(scalable extension) has become a standard of next generation multimedia service which is one source, multi-user service in the telecommunication environment of different kinds of networks and terminal equipments. But existing DRM schemes for multimedia service are not fit for H.264 SE system. Because the amount of transmitted multimedia data is changed considering network environment and terminal equipments' performance by the system, but in the existing DRM schemes, the amount of handled multimedia data are not variable according to network environment and terminal equipments' performance. In this paper, an information security scheme combined video watermarking and encryption is presented for H.264 SE. Amount of watermarks and embedding positions are calculated by the frame number of enhancement layers which are created according to the state of networks and terminal equipments. In order to minimize delayed time by video watermarking and encryption, the video data are watermarked and encrypted in the H.264 SE compression process. In the experimental results, we confirmed that proposed scheme is robust against video compression, general signal processing and geometric processing.

• ETRI Journal
• /
• v.32 no.4
• /
• pp.622-625
• /
• 2010

In this letter, we assess the scalability of a path computation flooding (PCF) approach to compute optimal end-to-end inter-domain paths in a path computation element-based multi-domain network. PCF yields a drastically reduced network blocking probability compared to a blind per-domain path computation but introduces significant network control overhead and path computation complexity. In view of this, we introduce and compare an alternative low overhead PCF (LoPCF) solution. From the obtained results, LoPCF leads to similar blocking probabilities to PCF while exhibiting around 50% path computation complexity and network control overhead reduction.

• Journal of KIISE:Information Networking
• /
• v.35 no.6
• /
• pp.510-520
• /
• 2008

These days, the network convergence for utilizing heterogeneous network on mobile device is being very actively studied. However, understanding characteristics of physical network interfaces and video encoder is needed for using the network convergence technologies efficiently. Thus, this paper proposes an optimized method for streaming video data through different network paths depending on data characteristics and channel condition. Accordingly, unlike the traditional methods, this study divides scalable coded videos by layer importance, the importance of stream information, and the importance in consideration of video decoder's robustness and selectively sends the data via multiple channels. And the experimental results show over 1dB increment in PSNR. The result of this study will provide an optimized video transmission technique in the next generation network convergence environment in which mobile devices have multiple network interfaces.