An Adaptive Data Dissemination Strategy for Wireless Sensor Networks.

International Journal of Distributed Sensor Networks (Impact Factor: 0.92). 01/2007; 3:23-40. DOI: 10.1080/15501320601067725
Source: DBLP

ABSTRACT Future large-scale sensor networks may comprise thousands of wirelessly connected sensor nodes that could provide an unimaginable opportunity to interact with physical phenomena in real time. However, the nodes are typically highly resource-constrained. Since the communication task is a significant power consumer, various attempts have been made to introduce energy-awareness at different levels within the communication stack. Clustering is one such attempt to control energy dissipation for sensor data dissemination in a multihop fashion. The Time-Controlled Clustering Algorithm (TCCA) is proposed to realize a network-wide energy reduction. A realistic energy dissipation model is derived probabilistically to quantify the sensor network's energy consumption using the proposed clustering algorithm. A discrete-event simulator is developed to verify the mathematical model and to further investigate TCCA in other scenarios. The simulator is also extended to include the rest of the communication stack to allow a comprehensive evaluation of the proposed algorithm.

  • [Show abstract] [Hide abstract]
    ABSTRACT: Event triggered data aggregation and routing minimizes the amount of energy and bandwidth required to transmit the data from the event affected area. This paper proposes a Wheel based Event Triggered data aggregation and routing (WETdar) scheme in Wireless Sensor Networks (WSNs) by employing a set of static and mobile agents. A wheel with spokes is constructed by WSN nodes around an event node (a sensor node where an event occurs). Gathering and aggregation of the information is performed along the spokes of a wheel in Spoke Aggregator (SA) nodes and sent to an event node, which routes to a sink node. Spoke generation and identification of SA nodes along the spokes is performed by using a mobile agent, based on parameters such as Euclidean distance, residual energy, spoke angle and connectivity. Mobile agent and its clones discover multiple paths to a sink node from an event node. The scheme is simulated in various WSN scenarios to evaluate the effectiveness of the approach. The performance parameters analyzed are number of SAs, SA selection time, aggregation time, aggregation energy, energy consumption, number of isolated nodes and network life time. We observed that proposed scheme outperforms as compared to the existing aggregation scheme.
    Wireless Personal Communications 07/2013; 71(1). · 0.98 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Clustering is an important research topic for wireless sensor networks (WSNs). A large variety of approaches has been presented focusing on different performance metrics. Even though all of them have many practical applications, an extremely limited number of software implementations is available to the research community. Furthermore, these very few techniques are implemented for specific WSN systems or are integrated in complex applications. Thus it is very difficult to comparatively study their performance and almost impossible to reuse them in future applications under a different scope. In this work we study a large body of well established algorithms. We identify their main building blocks and propose a component-based architecture for developing clustering algorithms that (a) promotes exchangeability of algorithms thus enabling the fast prototyping of new approaches, (b) allows cross-layer implementations to realize complex applications, (c) offers a common platform to comparatively study the performance of different approaches, (d) is hardware and OS independent. We implement 5 well known algorithms and discuss how to implement 11 more. We conduct an extended simulation study to demonstrate the faithfulness of our implementations when compared to the original implementations. Our simulations are at very large scale thus also demonstrating the scalability of the original algorithms beyond their original presentations. We also conduct experiments to assess their practicality in real WSNs. We demonstrate how the implemented clustering algorithms can be combined with routing and group key establishment algorithms to construct WSN applications. Our study clearly demonstrates the applicability of our approach and the benefits it offers to both research & development communities.
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: A sensor network is composed of a large number of sensor nodes, which are densely deployed either inside the phenomenon or very close to it. Sensor nodes have sensing, processing and transmitting capability . They however have limited energy and measures need to be taken to make op-timum usage of their energy and save them from task of only receiving and transmitting data without processing. Various techniques for energy utilization optimisation have been proposed Ma jor players are however clustering and relay node placement. In the research related to relay node placement, it has been proposed to deploy some relay nodes such that the sensors can transmit the sensed data to a nearby relay node, which in turn delivers the data to the base stations. In general, the relay node placement problems aim to meet certain connectivity and/or survivabil-ity requirements of the network by deploying a minimum number of relay nodes. The other approach is grouping sensor nodes into clusters with each cluster having a cluster head (CH). The CH nodes aggregate the data and transmit them to the base station (BS). These two approaches has been widely adopted by the research community to satisfy the scala-bility objective and generally achieve high energy efficiency and prolong network lifetime in large-scale WSN environments and hence are discussed here along with single hop and multi hop characteristic of sensor node.


Available from