An auction-based strategy for distributed task allocation in wireless sensor networks

Edalat, Neda; Tham, Chen-Khong; Xiao, Wendong

doi:10.1016/j.comcom.2012.02.004

Cited by 92 publications

(33 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In this section, we compare the performance of DTAC with that of other two schemes: EECNP [20] and ED-WDP [13]. The number of sensor nodes is 250. is set as 0.3.…”

Section: Comparison Of Dtac Eecnp and Ed-wdpmentioning

confidence: 99%

See 1 more Smart Citation

A Distributed Task Allocation Strategy for Collaborative Applications in Cluster-Based Wireless Sensor Networks

Wang

Han

Jiang

et al. 2014

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

Balancing energy consumption and prolonging network lifetime have been hot topics in energy limited wireless sensor networks (WSNs). It is generally known that multiple sensor nodes collaborating with each other to perform tasks are an important means of energy balancing. In addition, a reasonable task allocation strategy is also an efficient method for task performing and energy saving. Furthermore, in order to save energy consumption, many WSNs are organized into clusters. Therefore, in this paper, we propose a distributed task allocation strategy for collaborative applications (DTAC) in cluster-based WSNs. In DTAC, the service abilities of sensor nodes are first evaluated and then the sensor nodes are classified into different ranking domains. Based on the service abilities of cluster members, the service ability of each cluster is calculated. A complex task can be first allocated to several clusters, and then scheduled on collaborative cluster members. Simulation results demonstrate that, compared with current related works, DTAC is much more efficient for complex task processing in terms of reducing energy consumption, shortening execution time, and balancing network loads.

show abstract

“…In this section, we compare the performance of DTAC with that of other two schemes: EECNP [20] and ED-WDP [13]. The number of sensor nodes is 250. is set as 0.3.…”

Section: Comparison Of Dtac Eecnp and Ed-wdpmentioning

confidence: 99%

“…The parameters are (1) the number of sensor nodes and (2) which is the ratio of sensor nodes in the first ranking domain. In the second set experiment, we compare the performance of DTAC, EECNP [20], and ED-WDP [13], since the three algorithms are all proposed based on the contract net protocol [19].…”

Section: Simulationmentioning

confidence: 99%

A Distributed Task Allocation Strategy for Collaborative Applications in Cluster-Based Wireless Sensor Networks

Wang

Han

Jiang

et al. 2014

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

show abstract

“…Another auction-based strategy for distributed task allocation is proposed in [15]. The realtime distributed task allocation problem is formulated as an incomplete information reverse auction game.…”

Section: Real-time Task Allocationmentioning

confidence: 99%

A Task Allocation Algorithm Based on Score Incentive Mechanism for Wireless Sensor Networks

Wang

Han

Jiang

et al. 2015

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

A wireless sensor network (WSN) consists of many resource constraint sensor nodes, which are always deployed in unattended environment. Therefore, the sensor nodes are vulnerable to failure and malicious attacks. The failed nodes have a heavily negative impact on WSNs' real-time services. Therefore, we propose a task allocation algorithm based on score incentive mechanism (TASIM) for WSNs. In TASIM, the score is proposed to reward or punish sensor nodes' task execution in cluster-based WSNs, where cluster heads are responsible for task allocation and scores' calculation. Based on the task scores, cluster members can collaborate with each other to complete complex tasks. In addition, the uncompleted tasks on failed nodes can be timely migrated to other cluster members for further execution. Furthermore, the uncompleted tasks on death nodes can be reallocated by cluster heads. Simulation results demonstrate that TASIM is quite suitable for real-time task allocation. In addition, the performance of the TASIM is clearly better than that of conventional task allocation algorithms in terms of both network load balance and energy consumption.

show abstract

“…Definition 2.6 [11] Give a graph G , if the node u has an arc ( , ) u v to the node v , then we call the graph G is connected. If one node u has an arc to all the nodes except itself, we call u as the root of G .…”

Section: Introductionmentioning

confidence: 99%

The Application of the Auction Maximum Flow Algorithm in Traffic Flow Assignment

Tian¹,

Xu²

2015

Advances in Intelligent Systems Research

View full text Add to dashboard Cite

show abstract

An auction-based strategy for distributed task allocation in wireless sensor networks

Cited by 92 publications

References 14 publications

A Distributed Task Allocation Strategy for Collaborative Applications in Cluster-Based Wireless Sensor Networks

A Distributed Task Allocation Strategy for Collaborative Applications in Cluster-Based Wireless Sensor Networks

A Task Allocation Algorithm Based on Score Incentive Mechanism for Wireless Sensor Networks

The Application of the Auction Maximum Flow Algorithm in Traffic Flow Assignment

Contact Info

Product

Resources

About