Article

An Adaptive Data Dissemination Strategy for Wireless Sensor Networks.

International Journal of Distributed Sensor Networks (Impact Factor: 0.67). 01/2007; 3(1):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.

Download full-text

Full-text

Available from: hindawi.com · License: CC BY
  • Source
    • "Data dissemination is a fundamental issue for information diffusion in networks [1] [2] [3] [4] [5]. Gossiping (a.k.a. "
    [Show abstract] [Hide abstract]
    ABSTRACT: Gossiping of a single source with multiple messages (by splitting information into pieces) has been treated only for complete graphs, shown to considerably reduce the completion time, that is, the first time at which all network nodes are informed, compared with single-message gossiping. In this paper, gossiping of a single source with multiple messages is treated, for networks modeled as certain structured graphs, wherein upper bounds of the high-probability completion time are established through a novel “dependency graph” technique. The results shed useful insights into the behavior of multiple-message gossiping and can be useful for data dissemination in sensor networks, multihopping content distribution, and file downloading in peer-to-peer networks.
    Full-text · Article · Jan 2015 · International Journal of Distributed Sensor Networks
  • 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.
    Full-text · Article ·
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Why to build clusters in sensor networks ? Agregating nodes in clusters allows to reduce the complexity of the routing algorithms, to optimize the medium resource by letting it to be locally managed by a cluster head, to make easy the data fusion, to simplify the network management and particularly the address allocation, to optimize the energy consumption, and at last to make the network more scalable. Using clusters allows also to stabilize the topology if the cluster size is large in comparison to the speed of the nodes. This chapter is dedicated to clustering in sensor networks. First, the state of the art is presented, followed by the detailed presentation of one of the best and most cited cluster formation method with its validation and correction. Then, the next parts of the chapter are dedicated to some considerations on cluster modelling. In the last part, a method to assign addresses to the nodes within a cluster is presented.
    Full-text · Article · Jan 2010
Show more