{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T00:18:53Z","timestamp":1772065133461,"version":"3.50.1"},"reference-count":17,"publisher":"SAGE Publications","issue":"6","license":[{"start":{"date-parts":[[2015,6,1]],"date-time":"2015-06-01T00:00:00Z","timestamp":1433116800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"funder":[{"name":"Shanghai Science and Technology Development Funds","award":["13dz2260200"],"award-info":[{"award-number":["13dz2260200"]}]},{"name":"Shanghai Science and Technology Development Funds","award":["13511504300"],"award-info":[{"award-number":["13511504300"]}]},{"name":"Shanghai Science and Technology Development Funds","award":["13dz2260200"],"award-info":[{"award-number":["13dz2260200"]}]},{"name":"Shanghai Science and Technology Development Funds","award":["13511504300"],"award-info":[{"award-number":["13511504300"]}]}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["International Journal of Distributed Sensor Networks"],"published-print":{"date-parts":[[2015,6,1]]},"abstract":"<jats:p> The key to realizing the crowd sensing network is to overcome the resource restrictions of energy, bandwidth, computing, and so on. First of all, due to the number of users and sensor availability will be dynamic change over time, crowd sensing system is difficult to accurately predict and allocate resource to accomplish a specific task. Secondly, there is a need to consider how to choose an effective subset from a large number of users with different sensing ability, so as to allocate the sensing devices in communication resources under the constraint conditions. This paper proposes a profit maximization algorithm for resource allocation component in crowd sensing environment. The proposed algorithm not only considers the current profit of crowd sensing service request but also considers the long-term expected profits, so as to ensure long-term maximum profit. The objective function is no longer to minimize the completion time but rather to achieve the target profit maximization. The experimental results show that the new algorithm is feasible and superior to the traditional algorithms. <\/jats:p>","DOI":"10.1155\/2015\/264125","type":"journal-article","created":{"date-parts":[[2015,6,18]],"date-time":"2015-06-18T21:00:58Z","timestamp":1434661258000},"page":"264125","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":3,"title":["Resource Allocation Algorithm Based on Profit Maximization for Crowd Sensing"],"prefix":"10.1177","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6347-8130","authenticated-orcid":false,"given":"Kun","family":"Gao","sequence":"first","affiliation":[{"name":"Zhejiang Wanli University, Ningbo 315100, China"},{"name":"Shanghai Key Laboratory of Data Science, Fudan University, Shanghai 200433, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bin","family":"Wang","sequence":"additional","affiliation":[{"name":"Zhejiang Wanli University, Ningbo 315100, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xinwu","family":"Yu","sequence":"additional","affiliation":[{"name":"Zhejiang Wanli University, Ningbo 315100, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2015,6,18]]},"reference":[{"key":"B1-2015-264125","doi-asserted-by":"publisher","DOI":"10.1145\/1721654.1721672"},{"key":"B2-2015-264125","doi-asserted-by":"publisher","DOI":"10.1145\/322003.322011"},{"key":"B3-2015-264125","doi-asserted-by":"publisher","DOI":"10.1287\/isre.1120.0451"},{"key":"B4-2015-264125","doi-asserted-by":"publisher","DOI":"10.1109\/cloudcom.2012.6427567"},{"key":"B18-2015-264125","doi-asserted-by":"publisher","DOI":"10.1007\/11495772_24"},{"key":"B19-2015-264125","doi-asserted-by":"publisher","DOI":"10.1007\/11508380_57"},{"key":"B15-2015-264125","doi-asserted-by":"publisher","DOI":"10.1155\/2015\/507967"},{"key":"B16-2015-264125","doi-asserted-by":"publisher","DOI":"10.1155\/2015\/604752"},{"key":"B17-2015-264125","doi-asserted-by":"publisher","DOI":"10.1155\/2015\/363815"},{"key":"B5-2015-264125","doi-asserted-by":"publisher","DOI":"10.1145\/1551609.1551635"},{"key":"B6-2015-264125","doi-asserted-by":"publisher","DOI":"10.1109\/infcom.2009.5062010"},{"key":"B7-2015-264125","doi-asserted-by":"publisher","DOI":"10.1145\/1851476.1851516"},{"key":"B8-2015-264125","doi-asserted-by":"publisher","DOI":"10.1109\/tse.2006.106"},{"key":"B10-2015-264125","first-page":"1","volume-title":"Proceedings of the Grid Computing Environments Workshop (GCE '08)","author":"Foster I."},{"key":"B11-2015-264125","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2008.12.001"},{"key":"B13-2015-264125","doi-asserted-by":"publisher","DOI":"10.1109\/ccgrid.2009.93"},{"key":"B14-2015-264125","doi-asserted-by":"publisher","DOI":"10.1109\/gce.2008.4738443"}],"container-title":["International Journal of Distributed Sensor Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/journals.sagepub.com\/doi\/pdf\/10.1155\/2015\/264125","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/journals.sagepub.com\/doi\/full-xml\/10.1155\/2015\/264125","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/journals.sagepub.com\/doi\/pdf\/10.1155\/2015\/264125","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,6]],"date-time":"2021-05-06T01:20:15Z","timestamp":1620264015000},"score":1,"resource":{"primary":{"URL":"http:\/\/journals.sagepub.com\/doi\/10.1155\/2015\/264125"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6,1]]},"references-count":17,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2015,6,1]]}},"alternative-id":["10.1155\/2015\/264125"],"URL":"https:\/\/doi.org\/10.1155\/2015\/264125","relation":{},"ISSN":["1550-1477","1550-1477"],"issn-type":[{"value":"1550-1477","type":"print"},{"value":"1550-1477","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,6,1]]}}}