67,714 research outputs found
A comparison of protocols for updating location information
The detailed location information of mobile objects, for example that of a user with a mobile computer or phone, is an important input for many location-aware applications. However, constantly updating the location information for thousands of mobile objects is not feasible. Update protocols for location information therefore use the special properties of this information to transmit it as efficiently as possible, that is requiring only few update messages, while still being effective in returning the location information with the desired accuracy. Different classes of such update protocols are described in this paper and a new combined protocol is proposed. To be able to compare their effectiveness and efficiency, we present an analysis for the minimum and average resulting accuracy of the location information on the receiver and the number of messages transmitted between them. We also present some simulation results, which we have performed to back up our analysis
A stateless opportunistic routing protocol for underwater sensor networks
Routing packets in Underwater Sensor Networks (UWSNs) face different challenges, the most notable of which is perhaps how to deal with void communication areas. While this issue is not addressed in some underwater routing protocols, there exist some partially state-full protocols which can guarantee the delivery of packets using excessive communication overhead. However, there is no fully stateless underwater routing protocol, to the best of our knowledge, which can detect and bypass trapped nodes. A trapped node is a node which only leads packets to arrive finally at a void node. In this paper, we propose a Stateless Opportunistic Routing Protocol (SORP), in which the void and trapped nodes are locally detected in the different area of network topology to be excluded during the routing phase using a passive participation approach. SORP also uses a novel scheme to employ an adaptive forwarding area which can be resized and replaced according to the local density and placement of the candidate forwarding nodes to enhance the energy efficiency and reliability. We also make a theoretical analysis on the routing performance in case of considering the shadow zone and variable propagation delays. The results of our extensive simulation study indicate that SORP outperforms other protocols regarding the routing performance metrics
On Mobility Management in Multi-Sink Sensor Networks for Geocasting of Queries
In order to efficiently deal with location dependent messages in multi-sink wireless sensor networks (WSNs), it is key that the network informs sinks what geographical area is covered by which sink. The sinks are then able to efficiently route messages which are only valid in particular regions of the deployment. In our previous work (see the 5th and 6th cited documents), we proposed a combined coverage area reporting and geographical routing protocol for location dependent messages, for example, queries that are injected by sinks. In this paper, we study the case where we have static sinks and mobile sensor nodes in the network. To provide up-to-date coverage areas to sinks, we focus on handling node mobility in the network. We discuss what is a better method for updating the routing structure (i.e., routing trees and coverage areas) to handle mobility efficiently: periodic global updates initiated from sinks or local updates triggered by mobile sensors. Simulation results show that local updating perform very well in terms of query delivery ratio. Local updating has a better scalability to increasing network size. It is also more energy efficient than ourpreviously proposed approach, where global updating in networks have medium mobility rate and speed
Lightweight Mutual Authentication Protocol for Low Cost RFID Tags
Radio Frequency Identification (RFID) technology one of the most promising
technologies in the field of ubiquitous computing. Indeed, RFID technology may
well replace barcode technology. Although it offers many advantages over other
identification systems, there are also associated security risks that are not
easy to be addressed. When designing a real lightweight authentication protocol
for low cost RFID tags, a number of challenges arise due to the extremely
limited computational, storage and communication abilities of Low-cost RFID
tags. This paper proposes a real mutual authentication protocol for low cost
RFID tags. The proposed protocol prevents passive attacks as active attacks are
discounted when designing a protocol to meet the requirements of low cost RFID
tags. However the implementation of the protocol meets the limited abilities of
low cost RFID tags.Comment: 11 Pages, IJNS
Synaptic mechanisms of interference in working memory
Information from preceding trials of cognitive tasks can bias performance in
the current trial, a phenomenon referred to as interference. Subjects
performing visual working memory tasks exhibit interference in their
trial-to-trial response correlations: the recalled target location in the
current trial is biased in the direction of the target presented on the
previous trial. We present modeling work that (a) develops a probabilistic
inference model of this history-dependent bias, and (b) links our probabilistic
model to computations of a recurrent network wherein short-term facilitation
accounts for the dynamics of the observed bias. Network connectivity is
reshaped dynamically during each trial, providing a mechanism for generating
predictions from prior trial observations. Applying timescale separation
methods, we can obtain a low-dimensional description of the trial-to-trial bias
based on the history of target locations. The model has response statistics
whose mean is centered at the true target location across many trials, typical
of such visual working memory tasks. Furthermore, we demonstrate task protocols
for which the plastic model performs better than a model with static
connectivity: repetitively presented targets are better retained in working
memory than targets drawn from uncorrelated sequences.Comment: 28 pages, 7 figure
A Taxonomy of Data Grids for Distributed Data Sharing, Management and Processing
Data Grids have been adopted as the platform for scientific communities that
need to share, access, transport, process and manage large data collections
distributed worldwide. They combine high-end computing technologies with
high-performance networking and wide-area storage management techniques. In
this paper, we discuss the key concepts behind Data Grids and compare them with
other data sharing and distribution paradigms such as content delivery
networks, peer-to-peer networks and distributed databases. We then provide
comprehensive taxonomies that cover various aspects of architecture, data
transportation, data replication and resource allocation and scheduling.
Finally, we map the proposed taxonomy to various Data Grid systems not only to
validate the taxonomy but also to identify areas for future exploration.
Through this taxonomy, we aim to categorise existing systems to better
understand their goals and their methodology. This would help evaluate their
applicability for solving similar problems. This taxonomy also provides a "gap
analysis" of this area through which researchers can potentially identify new
issues for investigation. Finally, we hope that the proposed taxonomy and
mapping also helps to provide an easy way for new practitioners to understand
this complex area of research.Comment: 46 pages, 16 figures, Technical Repor
Making On-Demand Routing Efficient with Route-Request Aggregation
In theory, on-demand routing is very attractive for mobile ad hoc networks
(MANET), because it induces signaling only for those destinations for which
there is data traffic. However, in practice, the signaling overhead of existing
on-demand routing protocols becomes excessive as the rate of topology changes
increases due to mobility or other causes. We introduce the first on-demand
routing approach that eliminates the main limitation of on-demand routing by
aggregating route requests (RREQ) for the same destinations. The approach can
be applied to any existing on-demand routing protocol, and we introduce the
Ad-hoc Demand-Aggregated Routing with Adaptation (ADARA) as an example of how
RREQ aggregation can be used. ADARA is compared to AODV and OLSR using
discrete-event simulations, and the results show that aggregating RREQs can
make on-demand routing more efficient than existing proactive or on-demand
routing protocols
- âŚ