Hierarchical data dissemination scheme for large scale sensor networks

Anand Visvanathan, Jong-Hoon Youn, Jitender S Deogun

Research output: Chapter in Book/Report/Conference proceedingConference contribution

25 Citations (Scopus)

Abstract

We introduce three hierarchical data dissemination schemes for reducing energy consumption in sensor networks that dynamically adapt to demands for sensor data. Our schemes are developed in the framework of a general model for wireless sensor networks in which some or all of sink nodes may be mobile. The schemes route data towards sink nodes using a hierarchy of randomly selected dissemination nodes. As dissemination nodes have limited resources, whenever a dissemination node is over-loaded, it inserts another level of dissemination nodes to reduce its load. This is accomplished by dividing the dissemination node's geographical area of coverage into smaller quads by recruiting other sensors. This new level of nodes take over serving the sinks located close to them and thus reduce the load of the dissemination node. The difference between the three schemes is that, the first scheme uses separate hierarchies for each source generating information. The second scheme first aggregates data by creating a level of data aggregating sensor nodes and then uses a common hierarchy to disseminate data to the sinks. The third one combines the ideas implemented in both the first and second schemes and achieves data dissemination. We develop algorithms for dynamic creation of the hierarchy, and maintenance and routing of data to sinks. We show that our schemes scale well and yield 85-95% throughput for large sensor networks with less power consumption compared to existing models.

Original languageEnglish (US)
Title of host publicationIEEE International Conference on Communications
Pages3030-3036
Number of pages7
Volume5
StatePublished - 2005
Event2005 IEEE International Conference on Communications, ICC 2005 - Seoul, Korea, Republic of
Duration: May 16 2005May 20 2005

Other

Other2005 IEEE International Conference on Communications, ICC 2005
CountryKorea, Republic of
CitySeoul
Period5/16/055/20/05

Fingerprint

Sensor networks
Sensors
Sensor nodes
Wireless sensor networks
Electric power utilization
Energy utilization
Throughput

ASJC Scopus subject areas

  • Media Technology

Cite this

Visvanathan, A., Youn, J-H., & Deogun, J. S. (2005). Hierarchical data dissemination scheme for large scale sensor networks. In IEEE International Conference on Communications (Vol. 5, pp. 3030-3036). [WN05-3]

Hierarchical data dissemination scheme for large scale sensor networks. / Visvanathan, Anand; Youn, Jong-Hoon; Deogun, Jitender S.

IEEE International Conference on Communications. Vol. 5 2005. p. 3030-3036 WN05-3.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Visvanathan, A, Youn, J-H & Deogun, JS 2005, Hierarchical data dissemination scheme for large scale sensor networks. in IEEE International Conference on Communications. vol. 5, WN05-3, pp. 3030-3036, 2005 IEEE International Conference on Communications, ICC 2005, Seoul, Korea, Republic of, 5/16/05.
Visvanathan A, Youn J-H, Deogun JS. Hierarchical data dissemination scheme for large scale sensor networks. In IEEE International Conference on Communications. Vol. 5. 2005. p. 3030-3036. WN05-3
Visvanathan, Anand ; Youn, Jong-Hoon ; Deogun, Jitender S. / Hierarchical data dissemination scheme for large scale sensor networks. IEEE International Conference on Communications. Vol. 5 2005. pp. 3030-3036
@inproceedings{e72665ca4a4b4aacbf4cf208962f09f7,
title = "Hierarchical data dissemination scheme for large scale sensor networks",
abstract = "We introduce three hierarchical data dissemination schemes for reducing energy consumption in sensor networks that dynamically adapt to demands for sensor data. Our schemes are developed in the framework of a general model for wireless sensor networks in which some or all of sink nodes may be mobile. The schemes route data towards sink nodes using a hierarchy of randomly selected dissemination nodes. As dissemination nodes have limited resources, whenever a dissemination node is over-loaded, it inserts another level of dissemination nodes to reduce its load. This is accomplished by dividing the dissemination node's geographical area of coverage into smaller quads by recruiting other sensors. This new level of nodes take over serving the sinks located close to them and thus reduce the load of the dissemination node. The difference between the three schemes is that, the first scheme uses separate hierarchies for each source generating information. The second scheme first aggregates data by creating a level of data aggregating sensor nodes and then uses a common hierarchy to disseminate data to the sinks. The third one combines the ideas implemented in both the first and second schemes and achieves data dissemination. We develop algorithms for dynamic creation of the hierarchy, and maintenance and routing of data to sinks. We show that our schemes scale well and yield 85-95{\%} throughput for large sensor networks with less power consumption compared to existing models.",
author = "Anand Visvanathan and Jong-Hoon Youn and Deogun, {Jitender S}",
year = "2005",
language = "English (US)",
volume = "5",
pages = "3030--3036",
booktitle = "IEEE International Conference on Communications",

}

TY - GEN

T1 - Hierarchical data dissemination scheme for large scale sensor networks

AU - Visvanathan, Anand

AU - Youn, Jong-Hoon

AU - Deogun, Jitender S

PY - 2005

Y1 - 2005

N2 - We introduce three hierarchical data dissemination schemes for reducing energy consumption in sensor networks that dynamically adapt to demands for sensor data. Our schemes are developed in the framework of a general model for wireless sensor networks in which some or all of sink nodes may be mobile. The schemes route data towards sink nodes using a hierarchy of randomly selected dissemination nodes. As dissemination nodes have limited resources, whenever a dissemination node is over-loaded, it inserts another level of dissemination nodes to reduce its load. This is accomplished by dividing the dissemination node's geographical area of coverage into smaller quads by recruiting other sensors. This new level of nodes take over serving the sinks located close to them and thus reduce the load of the dissemination node. The difference between the three schemes is that, the first scheme uses separate hierarchies for each source generating information. The second scheme first aggregates data by creating a level of data aggregating sensor nodes and then uses a common hierarchy to disseminate data to the sinks. The third one combines the ideas implemented in both the first and second schemes and achieves data dissemination. We develop algorithms for dynamic creation of the hierarchy, and maintenance and routing of data to sinks. We show that our schemes scale well and yield 85-95% throughput for large sensor networks with less power consumption compared to existing models.

AB - We introduce three hierarchical data dissemination schemes for reducing energy consumption in sensor networks that dynamically adapt to demands for sensor data. Our schemes are developed in the framework of a general model for wireless sensor networks in which some or all of sink nodes may be mobile. The schemes route data towards sink nodes using a hierarchy of randomly selected dissemination nodes. As dissemination nodes have limited resources, whenever a dissemination node is over-loaded, it inserts another level of dissemination nodes to reduce its load. This is accomplished by dividing the dissemination node's geographical area of coverage into smaller quads by recruiting other sensors. This new level of nodes take over serving the sinks located close to them and thus reduce the load of the dissemination node. The difference between the three schemes is that, the first scheme uses separate hierarchies for each source generating information. The second scheme first aggregates data by creating a level of data aggregating sensor nodes and then uses a common hierarchy to disseminate data to the sinks. The third one combines the ideas implemented in both the first and second schemes and achieves data dissemination. We develop algorithms for dynamic creation of the hierarchy, and maintenance and routing of data to sinks. We show that our schemes scale well and yield 85-95% throughput for large sensor networks with less power consumption compared to existing models.

UR - http://www.scopus.com/inward/record.url?scp=24144453548&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=24144453548&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:24144453548

VL - 5

SP - 3030

EP - 3036

BT - IEEE International Conference on Communications

ER -