Enhancing lifetime of sensor nodes should be considered as the key design objective in Wireless Sensor Networks (WSN). A sensor node can only be equipped with a limited energy supply and it loses its energy during data communication. In some application scenarios, replenishment of energy resources might be impossible since the sensor nodes are distributed in remote environment. Hence, the nodes...

Because of the influence of energy consumption of wireless sensor network, the location information of nodes in wireless sensor networks is very important, the current general localization algorithm is not suitable for harsh environment. This paper proposes a scheme based on the ranging node localization to improve the overall performance of the network. The routing algorithm is designed to dir...

A Wireless Sensor Network (WSN) is composed of a set of energy and processing-constrained devices that gather data about a set of phenomena. An efficient way to enlarge the lifetime of a wireless sensor network is clustering organization, which structures hierarchically the sensors in groups and assigns one of them as a cluster-head. Such a head is in charge of specific tasks as data gathering ...

In this work, we propose a low-power consumption hierarchical topology control algorithm for wireless sensor network, which is called LDH. As a control topology algorithm with multi-levels, it contains two phases: network establishment and network maintenance. The phase of network establishment contains three missions: electing of cluster head, identifying cluster head and nodes, as well as opt...

In the paper we propose a dependable and efficient data aggregation scheme based on fault map that is constructed by estimated fault probability using Bayesian Belief Network (BBN). Cluster head will forward aggregated event depend on the total dependability of collected event in which we assign each detecting node a dependence weight. The dependence weight of sensor node is mapped from its fau...

Many sensor applications are interested in computing a function over measurements (e.g., sum, average, max) as opposed to collecting all sensor data. Today, such data aggregation is done in a cluster-head. Sensor nodes transmit their values sequentially to a cluster-head node, which calculates the aggregation function and forwards it to the base station. In contrast, this paper explores the pos...

This research paper has focused on evaluating the performance of the heterogeneous WSNs using fuzzy based cluster head selection and the tradition EDDEEC protocols. The EDDEEC has used different probability function for choosing the best cluster head by using the remaining energy and average energy of the network. But EDDEEC has neglected the use of number of neighbours of sensor nodes during c...

An energy efficient hierarchical cluster-based routing protocol for continuous stream queries in WSN we introduce a set of cluster heads, head-set, for cluster-based routing. The head-set members are responsible for control and management of the network. On rotation basis, a head-set member receives data from the neighbouring nodes and transmits the aggregated results to the distant base statio...

We have studied the effect of shape of an amphiphilic molecule on micellization properties by carrying out stochastic molecular dynamics simulation on a bead-spring model of amphiphiles for several sizes of hydrophilic head group with a fixed hydrophobic tail length. Our studies show that the effect of geometry of an amphiphile on shape and cluster distribution of micelles is significant. We fi...

Neighbour discovery is the determination of all nodes in the network that can communicate with a given node. Routing typically begins with neighbour discovery. Discovering neighbours should be both quick as well as energy efficient. Many algorithms which mostly work at a protocol level had been developed for neighbour discovery. Here a new method for neighbour node discovery that maximizes netw...