• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.10a
• /
• pp.540-542
• /
• 2014

The Universal Plug and Play (UPnP) specification permits networked devices to discover each other and to provide diverse services in the home network environment. Recently, new paradigms such as mobile connected computing, cloud-based service delivery, smart device content sharing, and Internet of Things (IoT) have emerged, but the home network based UPnP shows functional limitations in supporting such paradigms. To support them, the UPnP Forum has recently extended the capabilities of the existing UPnP, calling it UPnP+. In this paper, the UPnP Device Architecture V2.0 (UDA 2.0), which forms the basis of UPnP+, is presented. We present how UDA 2.0 enables the expansion of the home network to wide-area networks and non-IP device domains.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.9
• /
• pp.2147-2154
• /
• 2014

JXTA does not need to be managed by the central server, and has the property that can communicate with any device that is connected to the network. Thus, JXTA can be applied to the communication between heterogeneous P2P systems. This paper deals with the design of a data exchange system utilizing the JXTA's foregoing property, which is able to connect P2P systems with different protocols and APIs.

• Journal of the Korea Society of Computer and Information
• /
• v.24 no.8
• /
• pp.59-66
• /
• 2019

As the monetary value of cryptocurrency increases, the security measures for cryptocurrency becomes more important. A limitation of the existing cryptocurrency exchanges is their vulnerability to threats of hacking due to their centralized manner of management. In order to overcome such limitation, blockchain technology is increasingly adopted. The blockchain technology enables decentralization and Peer-to-Peer(P2P) transactions, in which blocks of information are linked in chain topology, and each node participating in the blockchain shares a distributed ledger. In this paper, we propose and implement a mobile electronic wallet that can safely store, send and receive cryptocurrencies. The proposed mobile cryptocurrency wallet connects to the network only when the wallet actively is used. Wallet owner manages his or her private key offline, which is advantageous in terms of security. JavaScript based wallet apps were implemented to respectively run on Android and iOS mobile phones. I demonstrate the process of transferring Ethereum cryptocurrency from an account to another account through Ropsten, a test net for Ethereum. Hardware wallets, such as Ledger Nano S, provide a slightly higher level of security, yet have the disadvantages of added burden of carrying additional physical devices and high costs (about 80$).

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.6
• /
• pp.33-42
• /
• 2013

In the early stage of P2P, the technology was limited to narrow usage of file sharing, but currently, P2P technology has become essential to maximize the efficiency between associated technologies without additional deployment of high costly infrastructure and also the burden of the server. Especially, P2P media streaming service is a highly attractive service to mobile users. which requires a higher quality in the mobile environment in accordance with the development of technology of wired network as well as better mobile terminals. However, P2P technology should consider the trade-off between 'peer selfishness' and QoE for providing fairness. The P2P system also try to maximize the resource utilization through an incentive mechanism for service differentiation and encourage peers to contribute continuously for improving the overall system performance. In this paper, we propose an point-based incentive mechanism based on peer's contribution level and energy availability for service differentiation. We also introduce that the proposed mechanism efficiently enhances the system performance as the peer with incentive using contribution and energy obtains more effective resource distribution.

• The Journal of the Korea Contents Association
• /
• v.15 no.7
• /
• pp.30-42
• /
• 2015

In this paper, we propose a new skyline query processing scheme to enhance accuracy of query processing and communication cost in mobile P2P environments. The proposed scheme consists of three stages such as the pre-skyline processing, the query transmission range extension policy, and the continuous skyline query processing. In the pre-skyline processing, a peer selects the candidate filtering objects who have the potential to be selected. By doing so, the proposed scheme reduces the filtering cost when processing the query. In the query transmission range extension policy, we have improved the accuracy by extending the query transmission range. In addition, it can handle continuous skyline query by performing the monitoring after the first skyline query processing. In order to show the superiority of the proposed method, we compare it with the existing schemes through performance evaluation. As a result, it was shown that the proposed scheme outperforms the existing schemes.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.49 no.12
• /
• pp.81-88
• /
• 2012

As the performance of the next-generation broadband wireless networks is dramatically enhanced, various services (i.e., education, Live video streaming, Live video conferencing, online games, etc.) have been provided to users through a smart mobile platform. Those services are usually provided by using the centralized communication server. However, since all multimedia traffic is exchanged through a communication server, it often has the scalability problem with regard to traffic management. Our main purpose is for group smart users to provide scalable live multimedia streaming service based on P2P network. To do this, we have designed an architecture of P2P-based service management for mobile group communication management and service management protocol. In order to verify the performance of the proposed scheme, we have mathematically analyzed the performance in terms of the average transmission delay and bandwid th utilization.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.9
• /
• pp.1947-1954
• /
• 2009

Service discovery mechanism is a core technique for getting a desired service in MANET(Mobile Ad-Hoc NETwork) environment. However, As feature of MANET, existing mechanisms have some problem that service requester search for trustable service. also it can not support scalability. in this paper, how to reliably support applications such as service discovery on top of MANET. we are firstly finding a trustable service provider and configure DHT(Distributed Hash Table). P2P's DHT can be adopted to service discovery mechanism because P2P and MANET share certain similarities, primarily the fact that both are instances of self-organizing decentralized systems. Especially, Proposed DHT systems used for P2P overlay network can be effective in reducing the communication overhead in service discovery. So proposed mechanism can support for reliably searching required service and scalability. Simulation results show that our mechanism is scalable and outperforms existing service discovery mechanism.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.12
• /
• pp.109-117
• /
• 2009

In this paper, we propose an efficient service discovery scheme that combines peer-to-peer caching advertisement and node ID-based selective forwarding service requests. P2P caching advertisement quickly spreads available service information and reduces average response hop count since service information store in neighbor node cache. In addition, node ID-based service requests can minimize network transmission delay and can reduce network load since do not broadcast to all neighbor node. Proposed scheme does not require a central lookup server or registry and not rely on flooding that create a number of transmission messages. Simulation results show that proposed scheme improved network loads and response times since reduce a lot of messages and reduce average response hop counts using adaptive selective nodes among neighbor nodes compared to traditional flooding-based protocol.

• Journal of information and communication convergence engineering
• /
• v.11 no.3
• /
• pp.173-178
• /
• 2013

To discover objects of interest in unstructured peer-to-peer networks, the peers rely on flooding query messages which create incredible network traffic. This article evaluates the performance of an unstructured Gnutella-like protocol over mobile ad-hoc networks and proposes modifications to improve its performance. This paper offers an enhanced mechanism for an unstructured Gnutella-like network with improved peer features to better meet the mobility requirement of ad-hoc networks. The proposed system introduces a novel caching optimization technique and enhanced ultrapeer selection scheme to make communication more efficient between peers and ultrapeers. The paper also describes an enhanced query mechanism for efficient searching by applying multiple walker random walks with a jump and replication technique. According to the simulation results, the proposed system yields better performance than Gnutella, XL-Gnutella, and random walk in terms of the query success rate, query response time, network load, and overhead.

• Journal of Broadcast Engineering
• /
• v.24 no.2
• /
• pp.251-263
• /
• 2019

Recently the huge demand for Internet media streaming has dramatically increased the cost of the CDN (Content Delivery Network) and the need for a means to reduce it is increasing day by day. In this situation, a P2P-assisted DASH technology has recently emerged, which uses P2P (Peer-to-Peer) communications based on WebRTC (Web Real-Time Communication) standards to reduce the CDN cost. This paper proposes an algorithm that can significantly improve CDN cost savings in this technology by selecting peers based on the transport history. Also we implemented this algorithm in an experimental system and, after setting experimental conditions that emulate the actual mobile network environment, we measured the performance of the experimental system. As a result, we demonstrated that the proposed algorithm can achieve higher CDN cost savings compared to the conventional algorithm where peers are selected at random.