Performance Analysis of Data Aggregation in Wireless Sensor Mesh Networks

Liu, Haoying; Shen, Jian; Yuan, Xiaojing; Moges, Mequanint

doi:10.1061/40988(323)210

Cited by 6 publications

(7 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [5], based on [4], Liu analyses the delay of measurement and communication in single-level wireless sensor networks. LIU applied divisible load theory to wireless sensor mesh networks to analysis task scheduling, the task issuing and the results reporting are also based on single-level tree [6]. Kijeung considers a single channel cluster composed of single cluster head and n sensors in the wireless network (star topology).…”

Section: Sink Nodesmentioning

confidence: 99%

“…Owing to the wireless sensor network node with limited energy, the task should be completed within the shortest possible amount of time. Divisible load theory [3] provides an effective solution to wireless sensor networks for task scheduling [4][5][6][7]. Different from other heuristic solutions of task scheduling problem in wireless sensor networks [8][9], this scheme can get not only the optimal solution, but also the analytic solution, thus ensuring the consistency of the results of scheduling.…”

Section: Introductionmentioning

confidence: 99%

“…Divisible load scheduling algorithms were applied to wireless sensor networks in [4][5][6][7]. Although the authors derived closed-form solutions to obtain the optimal finish time, the network topology discussed in those papers is single-level tree structure.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

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%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

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

“…Furthermore, finishing sensing task faster will benefit energy saving, which is critical in system design of wireless sensor networks. Divisible load theory [2] provides an effective solution to wireless sensor networks for task scheduling [3][4][5][6]. Different from other heuristic solutions of task scheduling problem in wireless sensor networks [7,8], this scheme can get not only the optimal solution, but also the analytic solution, thus ensuring the consistency of the results of scheduling.…”

Section: Introductionmentioning

confidence: 99%

“…Divisible load scheduling algorithms were applied to wireless sensor networks in [3][4][5][6]. Although the authors derived closed-form solutions to obtain the optimal finish time, the network topology discussed in those papers is single-level tree structure.…”

Section: Introductionmentioning

confidence: 99%

A Non-cooperative Game Algorithm for Task Scheduling in Wireless Sensor Networks

Dai

Chen

Shen

2011

INT J COMPUT COMMUN

View full text Add to dashboard Cite

Scheduling tasks in wireless sensor networks is one of the most challenging problems. Sensing tasks should be allocated and processed among sensors in minimum times, so that users can draw prompt and effective conclusions through analyzing sensed data. Furthermore, finishing sensing task faster will benefit energy saving, which is critical in system design of wireless sensor networks. But sensors may refuse to take pains to carry out the tasks due to the limited energy. To solve the potentially selfish problem of the sensors, a non-cooperative game algorithm (NGTSA) for task scheduling in wireless sensor networks is proposed. In the proposed algorithm, according to the divisible load theory, the tasks are distributed reasonably to every node from SINK based on the processing capability and communication capability. By removing the performance degradation caused by communications interference and idle, the reduced task completion time and the improved network resource utilization are achieved. Strategyproof mechanism which provide incentives to the sensors to obey the prescribed algorithms, and to truthfully report their parameters, leading to an effient task scheduling and execution. A utility function related with the total task completion time and tasks allocating scheme is designed. The Nash equilibrium of the game algorithm is proved. The simulation results show that with the mechanism in the algorithm, selfish nodes can be forced to report their true processing capability and endeavor to participate in the measurement, thereby the total time for accomplishing the task is minimized and the energy-consuming of the nodes is balanced.

show abstract

Analysis and modeling of task scheduling in wireless sensor network based on divisible load theory

Dai

Shen

Chen

et al. 2012

Int J Communication

View full text Add to dashboard Cite

SUMMARYIn this paper, we propose a novel task scheduling algorithm (Divisible Task scheduling Algorithm for Wireless sensor networks (DTAW)) based on divisible load theory in heterogeneous wireless sensor networks to complete the tasks within the shortest possible time and reduce the sensors' energy‐consuming. In DTAW, the tasks are distributed to the wireless sensor network by the (SINK) on the basis of the processing and communication capacity of each sensor. After receiving the subtasks, the intracluster sensors carry out its tasks simultaneously and send the results to cluster head sequentially. By removing communication interference between each sensor, reduced task completion time and improved network resource utilization are achieved. Each cluster head simultaneously finishes sending fused data to the SINK after fusing the data obtained from intracluster sensors. In this way, the overlap between the task performing and communication phase would be much better. Simulation results are presented to demonstrate the impacts of different network parameters on the makespan and energy consumption. The results show that the algorithm enables to reasonably distribute tasks to each sensor and then effectively reduces the time‐consuming and energy‐consuming. Copyright © 2012 John Wiley & Sons, Ltd.

show abstract

Performance Analysis of Data Aggregation in Wireless Sensor Mesh Networks

Cited by 6 publications

References 15 publications

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

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

A Non-cooperative Game Algorithm for Task Scheduling in Wireless Sensor Networks

Analysis and modeling of task scheduling in wireless sensor network based on divisible load theory

Contact Info

Product

Resources

About