1,947 research outputs found
On the tradeoff between privacy and energy in wireless sensor networks
Source location privacy is becoming an increasingly important property of some wireless sensor network applica- tions. The fake source technique has been proposed as an approach for handling the source location privacy problem in these situations. However, whilst the efficiency of the fake source techniques is well documented, there are several factors that limit the usefulness of current results: (i) the assumption that fake sources are known a priori, (ii) the selection of fake sources based on an prohibitively expensive pre-configuration phase and (iii) the lack of a commonly adopted attacker model. In this paper we address these limitations by investigating the efficiency of the fake source technique with respect to possible implementations, configurations and extensions that do not require a pre-configuration phase or a priori knowledge of fake sources. The results presented demonstrate that one possible implementation, in presence of a single attacker, can lead to a decrease in capture ratio of up to 60% when compared with a flooding baseline. In the presence of multiple attackers, the same implementation yields only a 30% decrease in capture ratio with respect to the same baseline. To address this problem we investigate a hybrid technique, known as phantom routing with fake sources, which achieves a corresponding 50% reduction in capture ratio
Laplace Functional Ordering of Point Processes in Large-scale Wireless Networks
Stochastic orders on point processes are partial orders which capture notions
like being larger or more variable. Laplace functional ordering of point
processes is a useful stochastic order for comparing spatial deployments of
wireless networks. It is shown that the ordering of point processes is
preserved under independent operations such as marking, thinning, clustering,
superposition, and random translation. Laplace functional ordering can be used
to establish comparisons of several performance metrics such as coverage
probability, achievable rate, and resource allocation even when closed form
expressions of such metrics are unavailable. Applications in several network
scenarios are also provided where tradeoffs between coverage and interference
as well as fairness and peakyness are studied. Monte-Carlo simulations are used
to supplement our analytical results.Comment: 30 pages, 5 figures, Submitted to Hindawi Wireless Communications and
Mobile Computin
SINK MOBILITY MODEL FOR WIRELESS SENSOR NETWORKS USING KOHONEN SELF-ORGANIZING MAP
Wireless sensor networks are expected to operate in an unattended manner for long periods of time. As a result, different mobility models were proposed by many research papers in order to improve the performance and extend the lifetime of the network. In this paper a new sink mobility model that is based on kohonen self-organizing maps is proposed in order to provide a mobile sink node with the ability to collect data from static sensor nodes. Moreover, the performance of the proposed mobility model was studied using NS-2 simulator under different network sizes and movement speeds of the mobile sink. Finally, the performance of the proposed model was evaluated based on different performance metrics namely, end-to-end delay, packet delivery ratio and throughput
- …