By Topic

Tree-forming schemes for overload control in Wireless Sensor Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Sergiou, C. ; Dept. of Comput. Sci., Univ. of Cyprus, Nicosia, Cyprus ; Vassiliou, V.

Node placement in Wireless Sensor Networks (WSNs) is frequently redundant and massive. Massive and dense deployments require efficient and effective, topology control algorithms in order to reduce the number of active nodes and ease the transportation of data from sources to sinks. Tree-forming is a common strategy in topology control algorithms that can be employed for such purpose. The most common tree-forming scheme, is shared, core-based tree, which initiates from the sink. In this work, we study how tree-forming schemes that initiate from sources can affect the performance of congestion/overload control algorithms. Specifically, we study source-based routing trees in comparison with shared-, core-based trees, under traffic and resource congestion control algorithms.

Published in:

Ad Hoc Networking Workshop (Med-Hoc-Net), 2012 The 11th Annual Mediterranean

Date of Conference:

19-22 June 2012