Source-Based Routing Trees for Efficient Congestion Control in Wireless Sensor Networks

Placement of nodes in Wireless Sensor Network (WSNs) is often massive and random. Topology control algorithms focus in lowering the initial network topology, by reducing active nodes and links, thus saving resources and increasing network lifetime. Currently, most algorithms and schemes in WSNs, con...

Full description

Saved in:
Bibliographic Details
Published in:2012 IEEE 8th International Conference on Distributed Computing in Sensor Systems pp. 378 - 383
Main Authors: Sergiou, C., Vassiliou, V.
Format: Conference Proceeding
Language:English
Published: IEEE 01.05.2012
Subjects:
Algorithm design and analysis
Congestion Control
Measurement
Network topology
Routing
Sink Based Trees
Source Based Trees
Throughput
Topology
Wireless sensor networks
ISBN:1467316938, 9781467316934
ISSN:2325-2936
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Placement of nodes in Wireless Sensor Network (WSNs) is often massive and random. Topology control algorithms focus in lowering the initial network topology, by reducing active nodes and links, thus saving resources and increasing network lifetime. Currently, most algorithms and schemes in WSNs, construct shared, core-based trees, with the sink as a root for this purpose. In this paper, we study whether trees that initiate from each source, called source-based trees, can assist in this purpose and provide, under specific circumstances, an efficient topology control solution. Simulation results show that source-based trees can provide proper topology and routing control solution in WSNs, when are employed along with "resource", congestion control algorithms in WSNs.
ISBN:1467316938
9781467316934
ISSN:2325-2936
DOI:10.1109/DCOSS.2012.52