Academic
Publications
Enhancing the Data Collection Rate of Tree-Based Aggregation in Wireless Sensor Networks

Enhancing the Data Collection Rate of Tree-Based Aggregation in Wireless Sensor Networks,10.1109/SAHCN.2008.74,Özlem Durmaz Incel,Bhaskar Krishnamacha

Enhancing the Data Collection Rate of Tree-Based Aggregation in Wireless Sensor Networks   (Citations: 16)
BibTex | RIS | RefWorks Download
What is the fastest rate at which we can collect a stream of aggregated data from a set of wireless sensors organized as a tree? We explore a hierarchy of techniques using realistic simulation models to address this question. We begin by considering TDMA scheduling on a single channel, reducing the original problem to minimizing the number of time slots needed to schedule each link of the aggregation tree. The second technique is to combine the scheduling with transmission power control to reduce the effects of interference. To better cope with interference, we then study the impact of utilizing multiple frequency channels by introducing a simple receiver-based frequency and time scheduling approach. We find that for networks of about a hundred nodes, the use of multi-frequency scheduling can suffice to eliminate most of the interference. The data collection rate then becomes limited not by interference, but by the maximum degree of the routing tree. Therefore we consider finally how the data collection rate can be further enhanced by the use of degree-constrained routing trees. Considering deployments at different densities, we show that these enhancements can improve the streaming aggregated data collection by as much as 10 times compared to the baseline of single-channel data collection over non-degree constrained routing trees. Addition to our primary conclusion, in the frequency scheduling domain we evaluate the impact of different interference models on the scheduling performance and give topology-specific bounds on time slot and frequency channel requirements.
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.
    • ...We evaluate the performance of three different channel assignment methods: 1) Joint Frequency Time Slot Scheduling (JFTSS), 2) Receiver-Based Channel Assignment [7], and 3) Tree-Based Multichannel Protocol (TMCP) [8]...
    • ...in [7] and [9], and also by others in [5], [10], and [11]...
    • ...In [7], we experimentally investigated the impact of transmission power control and multiple frequency channels on the schedule length, while the theoretical aspects were discussed in [9], where we proposed constant factor and logarithmic approximation algorithms on geometric networks (disk graphs)...
    • ...5.2.3 Receiver-Based Channel Assignment In our previous work [7], we proposed a channel assignment method called RBCA where we statically assigned the channels to the receivers (parents) so as to remove as many interfering links as possible...

    Ozlem Durmaz Incelet al. Fast Data Collection in Tree-Based Wireless Sensor Networks

    • ...In a previous work [27] we have investigated the impact of transmission power control on the network’s performance with a realistic setting and found that discrete and finite levels of adjustable transmission power on the radios may not completely eliminate the impact of interference...

    Özlem Durmaz Incelet al. MC-LMAC: A multi-channel MAC protocol for wireless sensor networks

    • ...Landmarks are used also in HVGR, which uses concepts from Voronoi graphs to construct and maintain a virtual hierarchy that spans all sensor nodes [36]...

    Abdalkarim Awadet al. Exploiting Virtual Coordinates for Improved Routing Performance in Sen...

    • ...Alternatively, purely based on network topology [23]–[25], the static protocols can not efficiently reduce the interference due to the lack of the information of routing and transmitting flows...
    • ...The links toward a receiver can be divided into two categories: intersecting links and interfering links [25]...

    Jiming Chenet al. Game Theoretical Approach for Channel Allocation in Wireless Sensor an...

    • ...A link between a child and its parent is called an intersecting link and a link that the receiver is not the parent of the sender is an interfering link [18]...

    Fulong Jianget al. Traffic-aware game based channel assignment in wireless sensor network...

Sort by: