2,779 research outputs found
DiDrip: A Secure and Distributed Protocol for Updation and Dissemination of Data in WSN
A data discovery and dissemination protocol for wireless sensor networks (WSNs) is responsible for updation of configuration parameters and distribution of management commands to the sensor nodes. The existing data discovery and dissemination protocols faces several drawbacks. The idea behind the project is to use the first secure and distributed data discovery and dissemination protocol named DiDrip for WSN. DiDrip allows the network owners to authorize multiple network users with different privileges to directly and simultaneously disseminate data items to the nodes. Extensive security analysis shows that DiDrip is probably secure
EMEEDP: Enhanced Multi-hop Energy Efficient Distributed Protocol for Heterogeneous Wireless Sensor Network
In WSN (Wireless Sensor Network) every sensor node sensed the data and
transmit it to the CH (Cluster head) or BS (Base Station). Sensors are randomly
deployed in unreachable areas, where battery replacement or battery charge is
not possible. For this reason, Energy conservation is the important design goal
while developing a routing and distributed protocol to increase the lifetime of
WSN. In this paper, an enhanced energy efficient distributed protocol for
heterogeneous WSN have been reported. EMEEDP is proposed for heterogeneous WSN
to increase the lifetime of the network. An efficient algorithm is proposed in
the form of flowchart and based on various clustering equation proved that the
proposed work accomplishes longer lifetime with improved QOS parameters
parallel to MEEP. A WSN implemented and tested using Raspberry Pi devices as a
base station, temperature sensors as a node and xively.com as a cloud. Users
use data for decision purpose or business purposes from xively.com using
internet.Comment: 6 pages, 4 figures. arXiv admin note: substantial text overlap with
arXiv:1409.1412 by other author
Continuum percolation of wireless ad hoc communication networks
Wireless multi-hop ad hoc communication networks represent an
infrastructure-less and self-organized generalization of todays wireless
cellular networks. Connectivity within such a network is an important issue.
Continuum percolation and technology-driven mutations thereof allow to address
this issue in the static limit and to construct a simple distributed protocol,
guaranteeing strong connectivity almost surely and independently of various
typical uncorrelated and correlated random spatial patterns of participating ad
hoc nodes.Comment: 30 pages, to be published in Physica
Distributed protocol for communications among underwater vehicles
Underwater surveying by swarms of autonomous underwater vehicles presents problems in communication among the robots. These problems involve the bandwidth, power consumption, timing, processing power, and other issues. This paper presents a novel approach to communicate and coordinate effectively among underwater vehicles to accomplish this task successfully. The proposed approach solves issues by reducing the number of hops to conserve power, while reducing computation time and bandwidth, effectively utilizing resources to reduce the load on each node. Finally, the simulation results are presented, in order to prove that the proposed approach improves efficiency and effectiveness in communicating among underwater vehicles.<br /
Dynamic Analysis of the Arrow Distributed Protocol
Distributed queuing is a fundamental coordination problem that arises in a variety of applications, including distributed directories, totally ordered multicast, and distributed mutual exclusion. The arrow protocol is a solution to distributed queuing that is based on path reversal on a pre-selected spanning tree of the network. We present a novel and comprehensive competitive analysis of the arrow protocol. We consider the total cost of handling a finite number of queuing requests, which may or may not be issued concurrently, and show that the arrow protocol is -competitive to the optimal queuing protocol, where s and D are the stretch and the diameter, respectively, of the spanning tree. In addition, we show that our analysis is almost tight by proving that for every spanning tree chosen for execution, the arrow protocol is -competitive to the optimal queuing protocol. Our analysis reveals an intriguing connection between the arrow protocol and the nearest neighbor traveling salesperson tour on an appropriately defined grap
Consensus Propagation
We propose consensus propagation, an asynchronous distributed protocol for
averaging numbers across a network. We establish convergence, characterize the
convergence rate for regular graphs, and demonstrate that the protocol exhibits
better scaling properties than pairwise averaging, an alternative that has
received much recent attention. Consensus propagation can be viewed as a
special case of belief propagation, and our results contribute to the belief
propagation literature. In particular, beyond singly-connected graphs, there
are very few classes of relevant problems for which belief propagation is known
to converge.Comment: journal versio
Scalable and Secure Aggregation in Distributed Networks
We consider the problem of computing an aggregation function in a
\emph{secure} and \emph{scalable} way. Whereas previous distributed solutions
with similar security guarantees have a communication cost of , we
present a distributed protocol that requires only a communication complexity of
, which we prove is near-optimal. Our protocol ensures perfect
security against a computationally-bounded adversary, tolerates
malicious nodes for any constant (not
depending on ), and outputs the exact value of the aggregated function with
high probability
- âŠ