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 the RFID system, when two or more tags respond their IDs to the reader simultaneously, wireless signal collision occurs and no tag can be identified successfully by the reader. How to reduce such collisions in order to speed up the identification performance is thus important. There are many anti-collision protocols proposed to solve the tag collision problem. They can be categorized into two classes:...
Grid computing is the combination of computer resources from multiple administrative domains to compute a complex and time consuming computational problems whereas Data Grids address data intensive applications that deal with the evaluation and mining of large amounts of data in the terabyte and petabyte range. By having large number of data in a complex computing structure such as grid requires a...
In this paper, snoopy cache coherence protocols with update strategy have been studied, since description of protocols is apparently different in references, so we offer a common description in order to show simplicity and comparability protocols. Evaluating of protocols is in simulation level By limes simulator tools. Limes includes dragon protocol [1], that we added WTU and firefly protocols to...
We propose a novel scheme, called cooperative semantic caching scheme (CSCS) for multi-level super-peer networks that support hierarchical P2P architecture. Peers share information according the semantic proximity between peers and between shared files to self-organise into clustered groups. In this paper we tackle the problem of exploiting the semantic locality of peer requests to improve the performance...
The paper addresses the problem of creating a comprehensive fault injection environment, which integrates and improves various simulation and supplementary functions. This is illustrated with experimental results.
Opportunistic routing (OR) schemes, such as ExOR, have been shown to provide significant throughput gains over traditional best-path routing schemes for wireless networks. Though the performance of OR schemes depend on the bit-rate, they currently use a fixed rate for transmitting packets. While several schemes have been proposed for selecting bit-rate for unicast transmission to a single receiver,...
The traditional error control coding of channel has no long satisfied the requirement of the deep space communication, because of the long delay, great error rate, probability of packet loss, links easily interrupted and so on. The Fountain codes, used in deep space communication, has been introduced and analyzed. The coding and decoding process of LT codes of Fountain codes has been introduced and...
A principal factor in sensor network design is energy efficiency. In this work, we propose to extend the lifetime of sensor networks using appropriate choice of sensor node distribution. The key idea of our scheme is to deploy more nodes in areas of extensive energy usage. Using this scheme of sensor node distribution, we use probabilistic angular routing to route data packets from the sensor nodes...
This paper presents a distributed fermat-point range estimation strategy, which is important in the moving sensor localization applications. The fermat-point is defined as a point which minimizes the sum of distances from three sensors inside a triangle. This point is indeed at the trianglepsilas center of gravity. We solve the problems of large errors and poor performance in the bounding box algorithm...
In this paper, we propose an adaptive pacing scheme at the link layer for IEEE 802.11 based multihop wireless networks. Our objective is to improve the performance of higher layer protocols without any modifications to them. Our adaptive pacing scheme estimates the four-hop transmission delay in the network path without incurring any additional overheads, and accordingly paces the packets to reduce...
Sink mobility has become an increasingly important requirement of various sensor network applications. Handling such mobile sink conditions brings new challenges to large-scale sensor networking. This investigation proposed a hybrid-structure routing protocol (HSRP) that combines the benefits of grid-based and cluster-based structures. Grid-based structure is designed to solve the cluster head selection...
A conflict of multiplicity k occurs when k stations transmit simultaneously to a multiple access channel. As a result, all stations receive feedback indicating whether k is 0, 1, or is ≥ 2. If k = 1 the transmission succeeds, whereas if k ≥ 2 all the transmissions fail. In general, no a priori information about k is available. We present and analyze an algorithm that enables the conflicting stations...
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.