• Journal of Advanced Navigation Technology
• /
• v.15 no.6
• /
• pp.1015-1024
• /
• 2011

Mobile P2P protocols in ad-hoc networks have gained large attention recently. Although there has been much research on P2P algorithms for wired networks, existing P2P protocols are not suitable for mobile ad-hoc networks because they do not consider mobility of peers. This study proposes a new cluster-based P2P protocol for ad hoc networks which utilizes peer mobility. In typical cluster-based P2P algorithms, each cluster has a super peer and other peers of the cluster register their file list to the super peer. High mobility peers would cause a lot of file list registration traffic because they hand-off between clusters frequently. In the proposed scheme, while peers with low mobility behave in the same way as the peers of the typical cluster-based P2P schemes, peers with high mobility behave differently. They inform their entrance to the cluster region to the super peer but they do not register their file list to the super peer. When a peer wishes to find a file, it first searches the registered file list of the super peer and if fails, query message is broadcasted. We perform mathematical modeling, analysis and optimization of the proposed scheme regarding P2P traffic and associated routing traffic. Numerical results show that the proposed scheme performs much better than or similar to the typical cluster-based P2P scheme and flooding based Gnutella.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.1B
• /
• pp.73-85
• /
• 2004

SIn this paper, we introduce our experience for designing and implementing new concept of a global XML-based Peer-to-Peer (P2P) engine to support various P2P applications, and interconnection among PC, Web and mobile computing environments. The proposed P2P engine can support to heterogeneous data exchanges and web interconnection by facilitating with the text-base XML while message exchange are necessary. It is also to provide multi-level security functions as well as to apply different types of security algorithms. The system consist of four modules; a message dispatcher to scheduling and filtering the message, a SecureNet to providing security services and data transmission, a Discovery Manager to constructing peer-to-peer networking, and a Repository Manager to processing data management including XML documents. As a feasibility test, we implement various P2P services such as chatting as a communication service, white-board as an authoring tool set during collaborative working, and a file system as a file sharing service. We also compared the proposed system to a Gnutella in order to measure performance of the systems.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.12
• /
• pp.870-872
• /
• 2014

In this paper, we devise a cost function by considering the energy consumption rate and the remaining energy of a peer. Then, we propose a parent peer selection method that chooses the least cost peer in the system in a distributed manner. On the contrary to the conventional method that makes each peer select the least cost neighbor as a parent peer, the proposed method chooses a parent peer using the swarm intelligence formed among a set of peers. Therefore, the proposed method could extent distributedly the number of peers searched for parent peer selection. Thus, compared to the conventional method, the proposed method increases the probability of being a parent peer as the cost of a peer becomes smaller with less operational load.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.11a
• /
• pp.207-208
• /
• 2009

Peer-to-Peer (P2P) network has great potential on utilizing the network while reducing the server loads. Video on Demand (VoD) has become widely used since we can watch contents we like without having to download the overall file first. The mobile users may not need high quality of video; they only need good enough quality that can be played in the limited resource of physical device and network. So does with the devices with very limited network bandwidth. These issues emerge an idea of allowing Free-Rider in the P2P VoD system, where those low performance devices will only optimize the network utilization, affecting none to the performance of main system.

• Journal of The Institute of Information and Telecommunication Facilities Engineering
• /
• v.10 no.4
• /
• pp.121-127
• /
• 2011

Many peer-to-peer (p2p) systems have been studied in distributed, ubiquitous computing environments. Distributed hash table (DHT)-based p2p systems can improve load-balancing even though locality utilization and user mobility are not guaranteed. We propose a mobile locality-based hierarchical p2p overlay network (MLH-Net) to address locality problems without any other services. MLH-Net utilizes mobility features in a mobile environment. MLH-Net is constructed as two layers, an upper layer formed with super-nodes and a lower layer formed with normal-nodes. Because super-nodes can share advertisements, we can guarantee physical locality utilization between a requestor and a target during any discovery process. To overcome a node failure, we propose a simple recovery mechanism. The simulation results demonstrate that MLH-Net can decrease discovery routing hops by 15% compared with JXTA and 66% compared with Chord.

• Journal of Advanced Navigation Technology
• /
• v.15 no.2
• /
• pp.204-212
• /
• 2011

Mobile P2P(Peer-to-Peer) protocols in MANET(mobile ad-hoc networks) have gained much attention recently. Existing P2P protocols can be categorized into structured and unstructured ones. In MANET, structured P2P protocols show large control traffic because they does not consider the locality of P2P data and unstructured P2P protocols have a scalability problem with respect to the number of nodes. Hybrid P2P protocols combine advantages of the structured and unstructured P2P protocols. Cluster-based P2P protocol is one of the hybrid P2P protocols. Our study makes an analysis of the cluster-based P2P protocol and derives the optimal cluster formation in MANET. In the derived optimal cluster formation, the cluster-based P2P protocol shows better performance than Gnutella protocol with respect to control traffic.

• International Journal of Contents
• /
• v.5 no.1
• /
• pp.21-26
• /
• 2009

Peer to Peer (P2P) utilizes the resources of an offered service without the need for a central server or preexistent server-client, making it a desirable network environment for data exchange based on direct connection between peers. Proposed by Sun Microsystems. JXTA(Juxtapose) is a typical P2P system and distributed computing model that does not require central service resources and is flexible to deal with various network configuration changes. Meanwhile. Mobile Ad-hoc NETwork(MANET) is a typical wireless network configured with mobile nodes and without an infrastructure. where a network is established by direct connection or through other peers in the propagation area. Thus, MANET maintains the latest path information by establishing paths and changing path information for communication between peers in a highly mobile wireless network. Accordingly. this article proposes the JXTAMANET method for wireless networks to enable JXTA to be applied to MANET. NS2 is used to evaluate the performance and the proposed architecture is shown to produce better results than a conventional flooding method.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.7
• /
• pp.1458-1464
• /
• 2005

A P2P is a method that can share and exchange on digital resources through a direct connection on personnel without a central server. In this paper, Although the P2P application that uses our proposed framework should obtain one or more IP addresses of the neighbor peers manually, after instantiate, the application can do its job while maintaining connection to the network continuously and automatically. To evaluate our proposed scheme, we measured and analyzed the time for a peer to reconnect to the network when the mediating peer fails and the network isolation occurs.

• The KIPS Transactions:PartA
• /
• v.11A no.4
• /
• pp.257-266
• /
• 2004

Mobile agents are defined as processes which can be autonomously delegated or transferred among the hosts in a network in order to perform some computations on behalf of the user and co-operate with other agents. Currently, mobile agents are used in various fields, such as electronic commerce, mobile communication, parallel processing, search of information, recovery, and so on. In pure P2P network environment, if mobile agents that require computing resources rashly migrate to another peers without consideration on the peer's capacity of resources, the peer may have a problem that the performance of the peer is degraded due to lack of resources. To solve this problem, we propose resource reservation based load balancing scheme of using RMA(Resource Management Agent) that monitors workload information of the peers and that decides migrating agents and destination peers. In mobile agent migrating procedure, if the resource of specific peer is already reserved, our resource reservation scheme prevents other mobile agents from allocating the resource.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.3
• /
• pp.815-834
• /
• 2012

Recently, along with the innovative development of wireless communication techniques and mobile devices, mobile P2P services in mobile wireless networks have gained a lot of attention. In this paper, we propose a resource discovery scheme with data dissemination over mobile P2P networks. In the proposed scheme, each peer manages a local information table, a resource index table, and a routing table in a local database to enhance the accuracy and cost of resource discovery. The local information table stores the status of a mobile peer, and the resource index table stores the resource information of the neighbor peers via the ranking function. The routing table is used to communicate with the neighbor peers. We use a timestamp message to determine whether or not the resource index table will be changed before the resource information is exchanged. Our ranking function considers the interest and mobility of the mobile peer and prioritizes the resource information transmitted from the neighbor peers. It is shown via various experiments that the proposed scheme outperforms the existing scheme.