DocumentCode
2500833
Title
Joint Computation and Communication Scheduling to Enable Rich Mobile Applications
Author
Mukhopadhyay, Shoubhik ; Schurgers, Curt ; Dey, Sujit
Author_Institution
Univ. of California, San Diego
fYear
2007
fDate
26-30 Nov. 2007
Firstpage
2117
Lastpage
2122
Abstract
Increasing interest in sensor networking and ubiquitous computing has created a trend towards embedding more and more intelligence into our surroundings. This enables thin wireless clients to support powerful applications by using processing resources that are available around them. One of the major challenges is how to schedule both the embedded computing and wireless communication resources to support a broad set of client nodes. This scheduling has to take into account the constraints on the wireless capacity, as well as the resource limitations on the processing elements. We have developed a set of fast algorithms to perform this scheduling, based on an LP-approachand a greedy solution. These algorithms are able to perform the scheduling with a performance close to the optimal exhaustive solution, but with an execution time that is reduced by three or more orders of magnitude (from hours to seconds).
Keywords
greedy algorithms; scheduling; telecommunication computing; wireless sensor networks; LP-approach; greedy solution; scheduling; sensor networking; wireless capacity; wireless communication; Embedded computing; Intelligent networks; Intelligent sensors; Mobile communication; Mobile computing; Pervasive computing; Processor scheduling; Scheduling algorithm; Ubiquitous computing; Wireless sensor networks;
fLanguage
English
Publisher
ieee
Conference_Titel
Global Telecommunications Conference, 2007. GLOBECOM '07. IEEE
Conference_Location
Washington, DC
Print_ISBN
978-1-4244-1042-2
Electronic_ISBN
978-1-4244-1043-9
Type
conf
DOI
10.1109/GLOCOM.2007.405
Filename
4411315
Link To Document