2009 IEEE 6th International Conference on Mobile Adhoc and Sensor Systems 2009
DOI: 10.1109/mobhoc.2009.5337039
|View full text |Cite
|
Sign up to set email alerts
|

A price-based adaptive task allocation for Wireless Sensor Network

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
25
0
1

Year Published

2011
2011
2019
2019

Publication Types

Select...
4
3
1

Relationship

1
7

Authors

Journals

citations
Cited by 55 publications
(26 citation statements)
references
References 5 publications
0
25
0
1
Order By: Relevance
“…Data recognized as time frame application are given high need than non-real time data. There exist wide choice of study and investigation on planning the sleep wake times of gadget nodes are performed [1]- [17], however exclusively a little assortment of concentrates live inside of the writing on the bundle arranging of gadget hubs that calendar the managing out of data parcels gave at a gadget hub and also lessens vitality consumptions [18]- [21]. Yet, most commonly utilized errand planning equation as a part of remote gadget systems is first return first Served (FCFS) equipment formula inside of which the movement of data packets happens bolstered point in time and in this manner it takes a ton of amount of your opportunity to be conveyed to an appropriate base station (BS).…”
Section: Literature Reviewmentioning
confidence: 99%
“…Data recognized as time frame application are given high need than non-real time data. There exist wide choice of study and investigation on planning the sleep wake times of gadget nodes are performed [1]- [17], however exclusively a little assortment of concentrates live inside of the writing on the bundle arranging of gadget hubs that calendar the managing out of data parcels gave at a gadget hub and also lessens vitality consumptions [18]- [21]. Yet, most commonly utilized errand planning equation as a part of remote gadget systems is first return first Served (FCFS) equipment formula inside of which the movement of data packets happens bolstered point in time and in this manner it takes a ton of amount of your opportunity to be conveyed to an appropriate base station (BS).…”
Section: Literature Reviewmentioning
confidence: 99%
“…For efficient resource allocation, hierarchical or layered system architectures can be studied in many papers. For example, in [25], the researchers designed a layered distributed system and extended the existing disjoint coalition formation protocol to solve the multi-sensor task allocation problem which aims to automatically decide the best sensors to specified task; in [26], a market-based 4-layer architecture was presented for adaptive task allocation which formulises the pricing mechanism to achieve a fair energy balance among sensor nodes while minimizing delay; [27] designed a two-tiered on-demand resource allocation strategy which is specially designed for VM-based computing environments.…”
Section: Resource Allocation For Information Managementmentioning
confidence: 99%
“…Though extensive research for scheduling the sleep/wake times of sensor nodes [5,13,15,16,33,71,72,58,89,94,92,97,109,108,112,116,128,120] have been conducted only a few studies exist in the literature on the packet scheduling of sensor nodes [27,88,102,119] that schedule the processing of data events available at a sensor node and also reduces energy consumptions. Indeed, most existing Wireless Sensor Network (WSN) applications use First Come First Serve (FCFS) [96] schedulers that process data packets in the order of their arrival time and, thus, require a lot of time to be delivered to a relevant base station (BS).…”
Section: Motivationmentioning
confidence: 99%