Abstract
We study real-time data aggregation problem for wireless sensor networks that use CSMA/CA MAC layer protocols. The problem is, for a given sink, a set of sensor nodes and a delay bound, to maximise the average transmission success probability of all sensor nodes within the delay bound. In CSMA/CA protocols, the success probability and the expected transmission delay are highly sensitive to node interference. We divide the system time into time-frames with fixed size and schedule the transmission of nodes into time-frames. The transmissions of all child nodes under the same parent are scheduled in the same time-frame. Therefore, the construction of data aggregation trees becomes very important in maximising the success probability of data collection. We solve the joint routing and scheduling problem by first constructing an aggregation tree that minimises the node interference. Then, we propose an efficient greedy scheduling method to assign time-frames to sensor nodes.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
