10,988 research outputs found
Dynamic key ring update mechanism for mobile wireless sensor networks
Key distribution is an important issue to provide security in Wireless Sensor Networks (WSNs). Many of the key pre-distribution schemes proposed for static WSNs perform poorly when they are applied to Mobile Wireless Sensor Networks (MWSNs). In this paper, we propose Dynamic Key Ring Update (DKRU) mechanism for MWSNs. The aim of DKRU mechanism is to enable sensor nodes to update their key rings periodically during movement, by observing the frequent keys in their neighbors. Our mechanism can be used together with different key pre-distribution schemes and it helps to increase the performance of them. For the performance evaluation basis, we used our mechanism together with a location based key pre-distribution scheme. Our results show that DKRU mechanism increases the local and global connectivity when it is applied to MWSNs. Moreover, our mechanism does not cause a significant degradation in network resiliency
Amorphous Placement and Retrieval of Sensory Data in Sparse Mobile Ad-Hoc Networks
Abstract—Personal communication devices are increasingly being equipped with sensors that are able to passively collect information from their surroundings – information that could be stored in fairly small local caches. We envision a system in which users of such devices use their collective sensing, storage, and communication resources to query the state of (possibly remote) neighborhoods. The goal of such a system is to achieve the highest query success ratio using the least communication overhead (power). We show that the use of Data Centric Storage (DCS), or directed placement, is a viable approach for achieving this goal, but only when the underlying network is well connected. Alternatively, we propose, amorphous placement, in which sensory samples are cached locally and informed exchanges of cached samples is used to diffuse the sensory data throughout the whole network. In handling queries, the local cache is searched first for potential answers. If unsuccessful, the query is forwarded to one or more direct neighbors for answers. This technique leverages node mobility and caching capabilities to avoid the multi-hop communication overhead of directed placement. Using a simplified mobility model, we provide analytical lower and upper bounds on the ability of amorphous placement to achieve uniform field coverage in one and two dimensions. We show that combining informed shuffling of cached samples upon an encounter between two nodes, with the querying of direct neighbors could lead to significant performance improvements. For instance, under realistic mobility models, our simulation experiments show that amorphous placement achieves 10% to 40% better query answering ratio at a 25% to 35% savings in consumed power over directed placement.National Science Foundation (CNS Cybertrust 0524477, CNS NeTS 0520166, CNS ITR 0205294, EIA RI 0202067
Homesick L\'evy walk: A mobility model having Ichi-go Ichi-e and scale-free properties of human encounters
In recent years, mobility models have been reconsidered based on findings by
analyzing some big datasets collected by GPS sensors, cellphone call records,
and Geotagging. To understand the fundamental statistical properties of the
frequency of serendipitous human encounters, we conducted experiments to
collect long-term data on human contact using short-range wireless
communication devices which many people frequently carry in daily life. By
analyzing the data we showed that the majority of human encounters occur
once-in-an-experimental-period: they are Ichi-go Ichi-e. We also found that the
remaining more frequent encounters obey a power-law distribution: they are
scale-free. To theoretically find the origin of these properties, we introduced
as a minimal human mobility model, Homesick L\'evy walk, where the walker
stochastically selects moving long distances as well as L\'evy walk or
returning back home. Using numerical simulations and a simple mean-field
theory, we offer a theoretical explanation for the properties to validate the
mobility model. The proposed model is helpful for evaluating long-term
performance of routing protocols in delay tolerant networks and mobile
opportunistic networks better since some utility-based protocols select nodes
with frequent encounters for message transfer.Comment: 8 pages, 10 figure
Uneven key pre-distribution scheme for multi-phase wireless sensor networks
In multi-phase Wireless Sensor Networks (WSNs), sensor nodes are redeployed periodically to replace nodes whose batteries are depleted. In order to keep the network resilient against node capture attacks across different deployment epochs, called generations, it is necessary to refresh the key pools from which cryptographic keys are distributed. In this paper, we propose Uneven Key Pre-distribution (UKP) scheme that uses multiple different key pools at each generation. Our UKP scheme provides self healing that improves the resiliency of the network at a higher level as compared to an existing scheme in the literature. Moreover, our scheme provides perfect local and global connectivity. We conduct our simulations in mobile environment to see how our scheme performs under more realistic scenarios
- …