Coordinated Workload Scheduling in Hierarchical Sensor Networks for Data Fusion Applications

Li, Xin; Kang, Hui; Cao, Jiannong

doi:10.1109/mobhoc.2007.4428665

Cited by 7 publications

(4 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Single cluster means very little in wireless sensor networks [7]. Existing research efforts on multi-cluster three tier hierarchical wireless sensor networks model based on four scenarios (single/multi channel, with/without front-end) [11][12][13]. However, the network models in those papers are assumed to be homogeneous.…”

Section: Sink Nodesmentioning

confidence: 99%

A Task Scheduling Strategy in Heterogeneous Multi-sinks Wireless Sensor Networks

Dai¹,

Xu²,

Chen³

2011

JNW

View full text Add to dashboard Cite

Using multiple sinks in a wireless sensor network can signiﬁcantly decrease the amount of energy spent on communication, so it has been paid much attention in recent years. In this paper, we introduce a new divisible load scheduling strategy to solve the problem how to complete the tasks within the possibly shortest time in multi-sinks wireless sensor network. In this strategy, the tasks are distributed to wireless sensor network based on the processing and communication capacity of each sensors by multiple sinks. After received the sub-tasks, the intra-cluster sensors perform its tasks simultaneously, and send its results to cluster head sequentially. By removing communications interference between each sensor, reduced makespan and improved network resource utilization achieved. Cluster heads send fused data to sinks sequentially after fused the data got from intra-cluster sensors, which could overlap the task-performing and communication phase much better. A unique scheduling strategy that allows one to obtain closed form solutions for the optimal finish time and load allocation for each node in heterogeneous clustered networks is presented. And solutions for an optimal allocation of fractions of task to sensors in the network are also obtained via bi-level programming. Finally, simulation results indicate this strategy reasonably distributes tasks to each node in multi-sinks wireless sensor networks, and effectively reduces the time-consuming of task completion. Compared to the traditional single-sink structure, makespan is reduced by 20%, and the energy-consuming of sensors is more balanced

show abstract

Section: Sink Nodesmentioning

confidence: 99%

A Task Scheduling Strategy in Heterogeneous Multi-sinks Wireless Sensor Networks

Dai¹,

Xu²,

Chen³

2011

JNW

View full text Add to dashboard Cite

show abstract

“…Beaumont et al consolidates the results for single-level tree and bus topologies and presents extensive discussions on some open problems in this domain [25]. A few new applications and solutions in DLT have been investigated in recent years, e.g., bioinformatics [26], multimedia streaming [27], sensor networks [28,29], economic and game-theoretic approaches [30,31].…”

Section: Related Workmentioning

confidence: 99%

PPDD: scheduling multi-site divisible loads in single-level tree networks

Veeravalli

2009

Cluster Comput

Self Cite

View full text Add to dashboard Cite

This paper investigates scheduling strategies for divisible jobs/loads originating from multiple sites in hierarchical networks with heterogeneous processors and communication channels. In contrast, most previous work in the divisible load scheduling theory (DLT) literature mainly addressed scheduling problems with loads originating from a single processor. This is one of the first works that address scheduling multiple loads from multiple sites in the DLT paradigm. In addition, scheduling multi-site jobs is common in Grids and other general distributed systems for resource sharing and coordination. An efficient static scheduling algorithm PPDD (Processor-set Partitioning and Data Distribution Algorithm) is proposed to near-optimally distribute multiple loads among all processors so that the overall processing time of all jobs is minimized. The PPDD algorithm is applied to two cases: when processors are equipped with front-ends and when they are not equipped with frontends. The application of the algorithm to homogeneous systems is also studied. Further, several important properties exhibited by the PPDD algorithm are proven through lemmas. To implement the PPDD algorithm, we propose a communication strategy. In addition, we compare the performance of the PPDD algorithm with a Round-robin Scheduling Algorithm (RSA), which is most commonly used. Ex-

show abstract

“…Due to space limit, we only describe the basic scheduling strategies in multi-hop hierarchical sensor networks. For more details, please refer to our previous work [Li and Cao, 2008]. The hierarchical scheduling strategy includes intracluster scheduling and inter-cluster scheduling.…”

Section: Potential-driven Node Selectionmentioning

confidence: 99%

ASGrid: autonomic management of hybrid sensor grid systems and applications

Liu

Han

et al. 2009

IJSNET

Self Cite

View full text Add to dashboard Cite

In this paper, we propose an autonomic management framework (ASGrid) to address the requirements of emerging large-scale applications in hybrid grid and sensor network systems. To the best of our knowledge, we are the first who proposed the notion of autonomic sensor grid systems in a holistic manner, aiming at non-trivial large applications. To bridge the gap between the physical world and the digital world and facilitate information analysis and decision making, ASGrid is designed to smooth the integration of sensor networks and grid systems and efficiently use both on demand. Under the blueprint of ASGrid, we present several building blocks that fulfill the following major features: (1) Self-configuration through content-based aggregation and associative rendezvous mechanisms; (2) Self-optimization through utility-based sensor selection, model-driven hierarchical sensing task scheduling, and auction-based game-theoretic approach for grid scheduling; (3) Self-protection through ActiveKey dynamic key management and S3Trust trust management mechanisms. Experimental and simulation results on these aspects are presented.

show abstract

Coordinated Workload Scheduling in Hierarchical Sensor Networks for Data Fusion Applications

Cited by 7 publications

References 23 publications

A Task Scheduling Strategy in Heterogeneous Multi-sinks Wireless Sensor Networks

A Task Scheduling Strategy in Heterogeneous Multi-sinks Wireless Sensor Networks

PPDD: scheduling multi-site divisible loads in single-level tree networks

ASGrid: autonomic management of hybrid sensor grid systems and applications

Contact Info

Product

Resources

About