The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Data access is an important and challenging issue in Mobile Social Networks (MSNs), and cooperative caching is an effective technique to improve the access performance. Most of current research efforts in data access of MSNs focus on improving the access performance while neglecting the fair treatment of users. Because fairness is considered as a major incentive for peer-to-peer service especially...
Delay Tolerant Networks (DTNs) are intermittently connected mobile networks, in which a fully connected path from source to destination does not exist. Therefore in these networks, message delivery relies on opportunistic routing where nodes use store-carry-and-forward paradigm to route the messages. However, effective forwarding based on a limited knowledge of contact behavior of nodes is challenging...
SNS (social network service) is becoming more and more popular on the web, and it is even more so for Mobile Internet browsing. The huge success of foursquare on the web shows that introducing LBS (location based service) to mobile Internet is promising. With LBS, mobile device (client) needs to commit user's location information as a request to the remote server (server). The server receives the...
We propose a novel collaborative caching framework to support spatial query processing in Mobile Peer-to-Peer Networks (MP2PNs). To maximize cache sharing among clients, each client caches not only data objects but also parts of the index structure built on the spatial objects. Thus, we call the proposed method structure-embedded collaborative caching (SECC). By introducing a novel index structure...
In this paper, we investigate the mobile P2P file-sharing problem, and proposed a mobile P2P content distribution architecture. Due to mobile specific influence factors, a hybrid architecture has been employed. We assume that the P2P mobile terminal can publish, index and retrieve resources on the Index Server, and collect the real-time state and cache content resource through Resource Management...
Applications using P2P as an Overlay network in MANet (P2M) are very unstable in terms of MANet interconnections and P2P churn. MANet-based P2P applications usually create a considerable overhead on the P2P consumer due to the control of the end-to-end communication with the peer that provides the shared content. Moreover, traditional P2P networks offer polluted contents wasting the device's scarce...
Abstract-Recently, popularity of multimedia content sharing among the Internet users and development of wireless mobile devices have promoted a trend of deploying Peer-to-Peer (P2P) networks over mobile ad hoc networks (MANETs) for mobile content distribution. However, due to limited radio transmission range, sporadic node densities and power limitations, MANETs may become intermittently connected...
In this paper, we propose a novel peer-to-peer based information diffusion scheme for mobile ad hoc networks. Due to mobility and bandwidth constraints, it is not always possible to share a complete content within a single transmission from one mobile device to another. To address this problem, we introduce segmentation of contents into smaller pieces for efficient information exchange. In mobile...
The participation of stationary computers with high-bandwidth links in peer-to-peer content-distribution networks is highly popular. Mobile devices (e.g. cell phones), however, could not yet be launched into the field to a satisfactory extent. This paper discusses mobile peer-to-peer approaches that cover this issue and compares two promising approaches in detail. The first approach supports mobile...
Peer-to-peer file sharing applications are increasingly popular and they enable users to share various files with high scalability. However, in intermittently connected mobile network environment, existing file sharing systems are hindered by the lack of node stable connectivity and constant network topology change. We propose a social network based file sharing system in mobile P2P networks. It takes...
Mashup combines multiple data sources to form some kind of new services. Using Mashup, services creation becomes more convenient, effctive and low-cost with user's participation. It is more frequently used in education service systems. With the development of mobile Internet, mobile mashup become more and more popular in mobile software by assembling applications and sources both from Internet and...
Mobile ad hoc networks (MANETs) are self-organizing and adaptive, and securing such networks is non-trivial. Most security schemes suggested for MANETs tend to build upon some fundamental assumptions regarding the trustworthiness of the participating hosts and the underlying networking systems without presenting any definite scheme for trust establishment. If MANET is to achieve the same level of...
P2P overlay networks are a natural fit for MANETs because both are decentralized and have dynamic topologies. Most nodes in P2P file sharing networks are freeloaders, nodes that do not contribute to the network. In order to have a useful P2P network, it is important that nodes not only share files but also forward data. In this paper we present Incite, an incentive scheme for P2P file sharing over...
Efficiently discovering services in terms of diversified service constraints in a dense MANET is a challenging issue. This paper proposes to build a distributed suffix tree on backbone nodes as XML-based services?? index to provide a concise profile for service descriptions. Moreover, a content-addressable P2P overlay and corresponding fault-tolerance mechanisms are introduced to support the distributed...
Along with the development of wireless technology and especially 3Gpsilas throw into commercial, the mobile value-added services gradually popular used, such as mobile automatic question and answer (Q/A) system. But the current mobile Q/A system mainly based on FAQ database, the question and answer can not be validated and updated by itself. So this paper attempts to implement a p2p based model updatable...
Key challenges in mobile ad-hoc networks are computational resource constraints, power limitations and time delays in information exchange. Therefore it is necessary to develop intelligent, efficient indexing strategies for knowledge addressing and exchange in dynamic mobile P2P architectures. The short range radio technology Bluetooth suffers from long service discovery delays and high power consumption...
According to 3G standard, the communicating bandwidth of mobile devices is 2Mbps, which makes it possible to realize 3G faced P2P e-commerce service among mobile devices. In this paper, the author mainly solved the problem of how to apply mobile P2P technology into modern e-commerce platform. Then, introduced the actuality of modern e-commerce in use and the system architecture of a 3G faced mobile...
A continuous k nearest neighbor (cKNN) query is a query that continuously returns a set of k nearest moving objects (mobile hosts) to a given query point. For example, report three nearest moving sensors to a given location continuously. Most existing research efforts focus on centralized solutions. In a mobile peer-to-peer network (M-P2P), a centralized approach incurs expensive communication cost...
Voronoi diagrams and Delaunay triangulations are gaining attention in several P2P applications managing a wide number of distributed and mobile entities, from resource discovery in auction-like networks to the realization of networked virtual environments. In this paper we consider a scalable partitioning technique of the entity space based on Voronoi diagrams, useful for a wide variety of distributed...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.