Scheduling And Resource Allocation In Wireless Sensor Networks

<p>In computer science and telecommunications, wireless sensor networks are an active research area. Each sensor in a wireless sensor network has some pre-defined or on demand tasks such as collecting or disseminating data. Network resources, such as broadcast channels, number of sensors, power, battery life, etc., are limited. Hence, a schedule is required to optimally allocate network resources so as to maximize some profit or minimize some cost. This thesis focuses on scheduling problems in the wireless sensor networks environment. In particular, we study three scheduling problems in the wireless sensor networks: broadcast scheduling, sensor scheduling for area monitoring, and content distribution scheduling. For each problem the goal is to find efficient scheduling algorithms that have good approximation guarantees and perform well in practice. </p>

Name thesis:degree_name

Doctor of Philosophy

Level thesis:degree_level

Doctoral

Discipline thesis:degree_discipline

Computer Science

Grantor

The Graduate School and University Center of The City University of New York

Year dc:date.available

2014

Author dc:creator

• Alayev, Yosef

Advisor dc:contributor.advisor

• Amotz Bar-Noy

• Computer Sciences
• Mathematics
• Operational Research
• algorithms
• mathematical programs
• optimization
• resource allocation
• scheduling
• wireless sensor networks

Repository record dc:identifier

https://academicworks.cuny.edu/gc_etds/6

OAI identifier oai:identifier

oai:academicworks.cuny.edu:gc_etds-1005