Abstract-Aggregation services play an important role in the domain of Wireless Sensor Networks (WSNs) because they significantly reduce the number of required data transmissions, and improve energy efficiency on those networks. In most of the existing aggregation methods that have been developed based on the mathematical models or functions, the user of the WSN has not access to the original observations. In this paper, we propose an algorithm which let the base station access the observations by introducing a distributed method for computing the Principal Component Analysis (PCA). The proposed algorithm is based on transmission workload of the intermediate nodes. By using PCA, we aggregate the incoming packets of an intermediate node into one packet and as a result, an intermediate node merely sends a packet instead of relaying all the incoming packets. Consequently, we can achieve considerable reduction in data transmission. We have analyzed the performance of the proposed algorithm through numerical simulations. The experimental results show that our algorithm performs better than the existing state of the art PCA-based aggregation algorithms such as PCAg in terms of accuracy and efficiency.

We present a process algebra for modeling and reasoning about Mobile Ad hoc Networks (MANETs)

Mobile ad hoc networks (MANETs) have become very interesting during last years, but the security is the most important problem they suffer from. Asymmetric cryptography is a very useful solution to provide a secure environment in multihop networks where intermediate nodes are able to read, drop or change messages before resending them. However, storing all keys in every node by this approach is inefficient, if practically possible, in large-scale MANETs due to some limitations such as memory or process capability. In this paper, we propose a new probabilistic key management algorithm for large-scale MANETs. To the best of our knowledge, this is the first method which probabilistically uses asymmetric cryptography to manage the keys in MANETs. In this algorithm, we store only a few keys in each node instead of all. We analytically prove that the network will remain connected with a high probability more than 99.99%. Furthermore, we analytically calculate the average path length in the network and show that this parameter will not have a significant increment using our algorithm. All analytical results are also validated by simulation to make them dependable.

No abstract

makespan of the entire grid. Numerical results obtained by applying the proposed SAN model, the algorithm presented to find the makespan of a single resource, and the proposed SA-based scheduling algorithm to a desktop grid show the applicability of the proposed approach in real grid environments.

Abstract. We provide an equational theory for Restricted Broadcast Process Theory to reason about ad hoc networks. We exploit an extended algebra called Computed Network Theory to axiomatize restricted broadcast. It allows one to define an ad hoc network with respect to the underlying topologies. We give a sound and complete axiomatization for the recursion-free part of the term algebra CNT, modulo what we call rooted branching computed network bisimilarity.

No abstract

No abstract