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

One inevitable problem in Ad Hoc networks is the limited battery capacity, which explains why portable devices might shut down suddenly when the power of hardware is depleted. Hence, how to decrease the power consumption is an important issue in ad hoc networks. With the development of wireless technology, mobile devices can transmit voices, surf the Internet, download entertaining stuffs, and even support some P2P applications, like sharing real-time streaming. In order to keep the quality stable, the transmission must be continuous and it is thus necessary to select some managers to coordinate all nodes in a P2P community. In addition to assigning jobs to the staffs (children) when needed, these managers (ancestors) are able to reappoint jobs in advance when employees retire. This paper proposed a mechanism called Cluster-based Power Management (CPM) to stabilize the transmissions and increase Time to Live (TTL) of mobile hosts. In our new proposed method, we establish the clusters according to every node's joining order and capability, and adjust their sleep time dynamically through three different mathematical models. Our simulation results reveal that this proposed scheme not only reduces the power consumption efficiently, but also increases the total TTLs evidently.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.6
• /
• pp.1311-1326
• /
• 2010

Peer-to-peer (P2P) networks consume the most bandwidth in the current Internet and file sharing accounts for the majority of the P2P traffic. Thus it is important for a P2P file sharing application to be efficient in bandwidth consumption. Bandwidth consumption as much as downloaded file sizes is inevitable, but those in file search and bad downloads, e.g. wrong, corrupted, or malicious file downloads, are overheads. In this paper, we target to reduce these overheads even in the presence of high volume of malicious users and their bad files. Sybil attacks are the example of such hostile environment. Sybil attacker creates a large number of identities (Sybil nodes) and unfairly influences the system. When a large portion of the system is subverted, either in terms of the number of users or the number of files shared in the system, the overheads due to the bad downloads rapidly increase. We propose ELiSyR, a file search protocol that can tolerate such a hostile environment. ELiSyR uses social networks for P2P file search and finds benign files in 71% of searches even when more than half of the users are malicious. Furthermore, ELiSyR provides similar success with less bandwidth than other general efforts against Sybil attacks. We compare our algorithm to SybilGuard, SybilLimit and EigenTrust in terms of bandwidth consumption and the likelihood of bad downloads. Our algorithm shows lower bandwidth consumption, similar chances of bad downloads and fairer distribution of computation loads than these general efforts. In return, our algorithm takes more rounds of search than them. However the time required for search is usually much less than the time required for downloads, so the delay in search is justifiable compared to the cost of bad downloads and subsequent re-search and downloads.

• Journal of KIISE:Information Networking
• /
• v.32 no.6
• /
• pp.705-715
• /
• 2005

A peer-to-peer web caching has been studied recently as it can reduce the traffic converged on the server side and can support the traditional web caching model. Although the peer-to-peer web caching has the merit of having additional cache space from the local caches of peers without additional infrastructure, several constraints such as dynamic participation and local caching strategy caused by the autonomy of peers in peer-to-peer networks nay limit the performance of the peer-to-peer web caching. To overcome these limitations, we propose an efficient directory-based peer-to-peer web caching system under dynamic participation of peers. In the proposed caching system, we present new peer selection and replica management schemes by introducing the concept of the object lifetime in P2P networks. We evaluate the effectiveness of the proposed system through trace-driven simulations with a web log dataset. Simulation results show that the proposed system has higher accuracy and fewer redirection failures than the conventional directory-based P2P web caching system in feasible peer-to-peer networks.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.4B
• /
• pp.200-207
• /
• 2007

Many P2P systems which are designed to implement large-scale data sharing have been introduced in internet recently. They exhibit interesting features like sell-configuration, sell-healing and complete decentralization, which make them appealing for deployment in ad hoc environments as well. This paper proposes an Gnutella-based P2P system that can operate efficiently in ad hoc networks. The objectives of this paper are to extend the overall system lifetime, to reduce overheads, and to provide enhanced performance. The proposed system uses an ultrapeer election scheme based on metric values and proactive distribution of ultrapeer information. According to the simulation results, the proposed system can provide better performance than Gnutella in terms of query success rate, query response time, overhead and residual battery power by utilizing network resources efficiently.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.8
• /
• pp.1669-1675
• /
• 2005

Recently, the small sized wireless terminals have problems of processing of large sized file because of the trends of a small sized terminals and a large sized files. Moreover, the web servers or the file servers have problems of the overload because of the concentration with many number of files to the them. Also, There is a security vulnerability of the data processing caused by the processing with a unit of the independent file. To resolve the problems, this paper proposes a new scheme of fat splining distribution using the P2P networks with the mesh topology. The proposed scheme is to distribute blocks of file into any peer of P2P networks. It can do that the small sized wireless terminals can process the large size file, the overload problems of a web or file servers can solve because of the decentralized files, and, the security vulnerability of the data processing is mitigated because of the distributed processing with a unit of the blocks to the peers.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.11
• /
• pp.2143-2159
• /
• 2011

The hybrid architecture of content delivery networks (CDN) and peer-to-peer overlay networks (P2P) is a promising technology enables effective real-time streaming services. It complements the advantages of quality control and reliability in a CDN, and the scalability of a P2P system. With real-time streaming services, however, high connection setup and media delivery latency are becoming the critical issues in deploying the CDN-P2P system. These issues result from biased peer selection without location awareness or content awareness, and can lead to significant service disruption. To reduce service disruption latency, we propose a group-based CDN-P2P hybrid architecture (iCDN-P2P) with a location/content-aware selection of peers. Specifically, a SuperPeer network makes a location-aware peer selection by employing a content addressable network (CAN) to distribute channel information. It also manages peers with content awareness, forming a group of peers with the same channel as the sub-overlay. Through a performance evaluation, we show that the proposed architecture outperforms the original CDN-P2P hybrid architecture in terms of connection setup delay and media delivery time.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.494-494
• /
• 2000

This paper demonstrates that the largest Lyapunov exponent $\lambda$ of recurrent neural networks can be controlled by a gradient method. The method minimizes a square error $e_{\lambda}=(\lambda-\lambda^{obj})^2$ where $\lambda^{obj}$ is desired exponent. The $\lambda$ can be given as a function of the network parameters P such as connection weights and thresholds of neurons' activation. Then changes of parameters to minimize the error are given by calculating their gradients $\partial\lambda/\partialP$. In a previous paper, we derived a control method of $\lambda$via a direct calculation of $\partial\lambda/\partialP$ with a gradient collection through time. This method however is computationally expensive for large-scale recurrent networks and the control is unstable for recurrent networks with chaotic dynamics. Our new method proposed in this paper is based on a stochastic relation between the complexity $\lambda$ and parameters P of the networks configuration under a restriction. Then the new method allows us to approximate the gradient collection in a fashion without time evolution. This approximation requires only $O(N^2)$ run time while our previous method needs $O(N^{5}T)$ run time for networks with N neurons and T evolution. Simulation results show that the new method can realize a "stable" control for larege-scale networks with chaotic dynamics.

• Journal of Information Processing Systems
• /
• v.3 no.1
• /
• pp.8-15
• /
• 2007

Grid environments provide the mechanism to share heterogeneous resources among nodes. Because of the similarity between grid environments and P2P networks, the structures of P2P networks can be adapted to enhance scalability and efficiency in deployment and to search for services. In this paper, we present a membership management based on a hierarchical ring which constructs P2P-like Grid environments. The proposed approach uses only a limited number of connections, reducing communication cost. Also, it only keeps local information for membership, which leads to a further reduction in management cost. This paper analyzes the performance of the approach by simulation and compares it with other approaches.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2003.11a
• /
• pp.466-469
• /
• 2003

PC의 컴퓨팅 능력과 네트워크 성능이 급속도로 향상됨에 따라 이러한 인프라를 바탕으로 떠오르고 있는 Peer-to-Peer (P2P) 시스템은 자원의 복제 및 공유를 통하여 컴퓨팅 시스템 전반에 걸친 신뢰성과 결함감내 능력을 향상시킨다. 그러나 현재까지 연구된 P2P 네트워크는 각 노드가 복제한 데이터의 일관성 유지를 위해 필요한 그룹통신에 대한 고려가 부족하다. 본 논문은 SpanningTree 방식의 링 구성을 통하여, P2P 시스템에서의 그룹통신을 위해 설계된 메시지 전송 방식을 설명하고 기존 P2P 메시지 전송방식과의 비교를 통하여 성능향상의 근거를 보인다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.9
• /
• pp.2136-2152
• /
• 2012

The growth of Internet technologies and the widespread use of mobile devices have been paving the way for the increasing use of conferencing services. Two types of systems have been designed to provide conferencing services: 1) a conferencing system using session control over a peer-to-peer (P2P) network and 2) an IP Multimedia Subsystem (IMS) conferencing system. The IMS conferencing system was developed to adapt to a server-based centralized system, whereas the benefits of the P2P operational model in providing such conference services are widely acknowledged. However, each system provides conferencing services only to its own users. Therefore, in this paper, we propose an interworking model to support multimedia conferencing service between the P2P environment and IMS networks. We also introduce protocol architecture and some service scenarios. To verify this system model and the design architecture, we perform an actual implementation and show experienced test results.