Abstract
The paper examines the resources needed to carry on all the tasks within wireless sensor networks (WSN) by modeling the data-aggregation within WSN as a scheduling problem. A typical sensor executes three tasks periodically, which are mainly sensing, processing and transmitting. We have modeled the sensorpsilas three tasks as a task-flow graph (TFG), and then we have combined all TFGs for all sensors within WSN as a super task-flow-graph (STFG). Three scheduling algorithms (as soon as possible (ASAP), as late as possible (ALAP) and branch-and-bound (BB)) are utilized to order all tasks within STFG, subject to the concurrency of executions among the sensorspsila tasks. The computational results have provided excellent bounds on the number of gateways, which are needed to retrieve the collected data by the sensors.
Sign-in/Register to access full text options 
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.
