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.
In this paper, we propose a P2P network construction method to achieve effective sensor data collection in a ubiquitous sensor environment. Our method constructs a P2P network overlay considering the location and the cycle of sensing of each sensor device (peer). First, according to the location of each peer, a hierarchical overlay network is constructed. In addition, considering the cycle of sensing,...
Due to the recent development of computer and network technologies, there has been increasing interest in peer-to-peer (P2P) networks. To reduce query messages for information retrieval in P2P networks, many conventional studies proposed methods that categorize similar data items and cluster peers that have data items in the same category. Some of them aim to construct clusters dynamically when the...
Two Phase geographic Greedy Forwarding (TPGF) is a pure on-demand geographic greedy forwarding protocol for wireless multimedia sensor networks (WMSNs). Unlike position-based routing protocols, TPGF has explicit route discovery, i.e., a node greedily forwards a routing packet to the neighbor that is the closest one to the destination to build a route. Thus, TPGF is vulnerable to some greedy forwarding...
In P2P networks, it is effective to allocate replicas of each data item to multiple peers for improving search efficiency and data availability. It has been mathematically proved that the square-root allocation, in which the ratios of numbers of replicas are proportional to the square-root of their access frequencies, is optimal in terms of search efficiency. In this paper, we propose a replica relocation...
To improve the efficiency of information retrieval in P2P networks, there have been many researches on categorizing data items and clustering peers. In almost all these researches, the number of categories and the policy of categorization are predetermined and static. However, users' requirements for information retrieval dynamically change. This leads to undesired increase of network traffic. In...
In a P2P network, it is common that data items are replicated on multiple peers for improving data availability. In such an environment, when a data item is updated on a particular peer, the update should be immediately propagated to other peers holding its replicas. However, in some applications, some replica holders do not need the update when the degree of change in the update is small. In this...
In a mobile ad hoc network, consistency management of data operations on replicas is a crucial issue for system performance.In our previous work, we classified several primitive consistency levels considering requirements from applications and provided protocols to realize them.In this paper, we assume special types of applications in which the instances of each data item can be partitioned and propose...
This paper introduces a new sensor network testbed, X-sensor, that integrates multiple sensor networks deployed at different sites. X-sensor provides three functionalities: (a) a sensor network search which enables users to find a sensor networks appropriate for experiment and data acquisition, (b) a sensor data archive which provides users with various sensor data acquired by sensor nodes, and (c)...
In this paper, we propose a consistency management method that constructs quorums with fewer nodes. In our method, assuming that the area where nodes exist is divided into several regions, each quorum is constructed based on the locations of the regions. As a result, the proposed methods can reduce the communication overhead while keeping the strict consistency among replicas.
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.