Academic
Publications
Bounded-Degree Minimum-Radius Spanning Trees for Fast Data Collection in Sensor Networks

Bounded-Degree Minimum-Radius Spanning Trees for Fast Data Collection in Sensor Networks,10.1109/INFCOMW.2010.5466684,Amitabha Ghosh,Ozlem Durmaz Ince

Bounded-Degree Minimum-Radius Spanning Trees for Fast Data Collection in Sensor Networks   (Citations: 1)
BibTex | RIS | RefWorks Download
We study the effect of routing topologies on maximizing the aggregated data collection rate and minimizing the maximum packet delay in TDMA-based sensor networks. We propose a bi-criteria formulation to the optimal routing tree construction problem, and show that a tree with bounded node degree and minimum radius can achieve the best trade-off between the data collection rate and packet delays.
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
    • ...Typical data acquisition frameworks [4-5] organize sensors of a WSN in a spanning tree rooted at the sink and collect data from all sensors following the path in that tree...
    • ...Amitabha et al. studied the effect of routing topologies on the aggregated data collection rate and packet delays in TDMA based sensor networks [5]...
    • ...To ensure connected sensors within a region, the side length of hexagon is set to , where is the transmission radius of sensor s [5]...
    • ...This results in shorter query execution delay in comparison to BDMRST [5], where query load is not considered in placing fusion nodes in the tree hierarchy...
    • ...constructed DAST for different number of sensors with various query loads and the total average delay is shown in Fig. 5 along with corresponding delay in BDMRST [5]...

    Shaila Pervinet al. Quality Adjustable Query Processing Framework for Wireless Sensor Netw...

Sort by: