An Efficient Data Aggregation Algorithm for Cluster-based Sensor Network

Data aggregation in wireless sensor networks eliminates redundancy to improve bandwidth utilization and energy-efficiency of sensor nodes. One node, called the cluster leader, collects data from surrounding nodes and then sends the summarized information to upstream nodes. In this paper, we propose an algorithm to select a cluster leader that will perform data aggregation in a partially connected sensor network. The algorithm reduces the traffic flow inside the network by adaptively selecting the shortest route for packet routing to the cluster leader. We also describe a simulation framework for functional analysis of WSN applications taking our proposed algorithm as an exampl

Reliability Evaluation and Analysis of Mobile Ad Hoc Networks

The paper addresses the reliability problem of mobile ad hoc networks under link and node failure model. Node reliability is calculated as a function of no. of neighbor nodes, packet success rate, and device type and packet size. The presence of a link between any node pair is binary and its reliability is computed considering the distance between nodes and signal-to-noise ratio (SNR). An efficient algorithm is proposed to analyze and calculate the reliability of mobile ad hoc networks considering multiple routes from source and destination nodes. The effect of different parameters on node reliability and link reliability are analyzed and discussed. The network is simulated and analyzed using INET frame work. Reliability of two distinct cases of this simulation is evaluated. The simulated results and discussions ensure that evaluation of the reliability of any mobile ad hoc networks can be done easily and in an efficient manner by the proposed method

Formal analysis techniques for gossiping protocols

We give a survey of formal verification techniques that can be used to corroborate existing experimental results for gossiping protocols in a rigorous manner. We present properties of interest for gossiping protocols and discuss how various formal evaluation techniques can be employed to predict them

On modeling fault tolerance of gossip-based reliable multicast protocols

2008-2009 > Academic research: refereed > Refereed conference paperVersion of RecordPublishe

On the Complexity of Asynchronous Gossip

In this paper, we study the complexity of gossip in an asynchronous, message-passing fault-prone distributed system. In short, we show that an adaptive adversary can significantly hamper the spreading of a rumor, while an oblivious adversary cannot. In the latter case, we present three randomized algorithms for achieving gossip, each offering a different trade-off between time and message complexity. We then show how to use these gossip algorithms to develop message-efficient asynchronous (randomized) consensus protocols

Efficient Probabilistic Information Broadcast Algorithm over Random Geometric Topologies

International audience—This paper studies reliability of probabilistic gossip algorithms over the random geometric topologies which model ad hoc networks. We propose an efficient algorithm that ensures higher reliability at lower message complexity than the three families of gossip algorithms. Such an improvement is reasonably estimated by our reliability model. The results obtained by OMNET++ simulator confirm the prediction that our algorithm is the best choice for random geometric networks