{"id":"https://openalex.org/W2115594786","doi":"https://doi.org/10.1109/sahcn.2009.5168911","title":"Bargain-based Stimulation Mechanism for Selfish Mobile Nodes in Participatory Sensing Network","display_name":"Bargain-based Stimulation Mechanism for Selfish Mobile Nodes in Participatory Sensing Network","publication_year":2009,"publication_date":"2009-06-01","ids":{"openalex":"https://openalex.org/W2115594786","doi":"https://doi.org/10.1109/sahcn.2009.5168911","mag":"2115594786"},"language":"en","primary_location":{"id":"doi:10.1109/sahcn.2009.5168911","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sahcn.2009.5168911","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 6th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5113746395","display_name":"Xiaojuan Xie","orcid":null},"institutions":[{"id":"https://openalex.org/I79516672","display_name":"University of Louisiana at Lafayette","ror":"https://ror.org/01x8rc503","country_code":"US","type":"education","lineage":["https://openalex.org/I2799628689","https://openalex.org/I79516672"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Xiaojuan Xie","raw_affiliation_strings":["Center of Advanced Computer Studies, University of Louisiana, Lafayette, Lafayette, LA, USA","Center for Advanced Computer Studies, University of Louisiana at Lafayette, Lafayette, LA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Center of Advanced Computer Studies, University of Louisiana, Lafayette, Lafayette, LA, USA","institution_ids":["https://openalex.org/I79516672"]},{"raw_affiliation_string":"Center for Advanced Computer Studies, University of Louisiana at Lafayette, Lafayette, LA#TAB#","institution_ids":["https://openalex.org/I79516672"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5084665945","display_name":"Haining Chen","orcid":"https://orcid.org/0000-0002-7543-3674"},"institutions":[{"id":"https://openalex.org/I4210099341","display_name":"Bethel College","ror":"https://ror.org/012mfbs12","country_code":"US","type":"education","lineage":["https://openalex.org/I4210099341"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Haining Chen","raw_affiliation_strings":["Computer Information Technology Division, Bethel College, Mishawaka, IN, USA","Bethel College, Mishawaka, IN"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Information Technology Division, Bethel College, Mishawaka, IN, USA","institution_ids":["https://openalex.org/I4210099341"]},{"raw_affiliation_string":"Bethel College, Mishawaka, IN","institution_ids":["https://openalex.org/I4210099341"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5115636506","display_name":"Hongyi Wu","orcid":"https://orcid.org/0000-0001-6030-6480"},"institutions":[{"id":"https://openalex.org/I79516672","display_name":"University of Louisiana at Lafayette","ror":"https://ror.org/01x8rc503","country_code":"US","type":"education","lineage":["https://openalex.org/I2799628689","https://openalex.org/I79516672"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Hongyi Wu","raw_affiliation_strings":["Center of Advanced Computer Studies, University of Louisiana, Lafayette, Lafayette, LA, USA","Center for Advanced Computer Studies, University of Louisiana at Lafayette, Lafayette, LA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Center of Advanced Computer Studies, University of Louisiana, Lafayette, Lafayette, LA, USA","institution_ids":["https://openalex.org/I79516672"]},{"raw_affiliation_string":"Center for Advanced Computer Studies, University of Louisiana at Lafayette, Lafayette, LA#TAB#","institution_ids":["https://openalex.org/I79516672"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":62,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"9"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10080","display_name":"Energy Efficient Wireless Sensor Networks","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7166140079498291},{"id":"https://openalex.org/keywords/nash-equilibrium","display_name":"Nash equilibrium","score":0.6710947155952454},{"id":"https://openalex.org/keywords/database-transaction","display_name":"Database transaction","score":0.6485437154769897},{"id":"https://openalex.org/keywords/mechanism","display_name":"Mechanism (biology)","score":0.5826811790466309},{"id":"https://openalex.org/keywords/pareto-optimal","display_name":"Pareto optimal","score":0.5734467506408691},{"id":"https://openalex.org/keywords/mechanism-design","display_name":"Mechanism design","score":0.48259198665618896},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.45862430334091187},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.4393007457256317},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.43261411786079407},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.43070870637893677},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.4216039180755615},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.42055544257164},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.3159216642379761},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.22803443670272827},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1280779242515564},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.10818195343017578}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7166140079498291},{"id":"https://openalex.org/C46814582","wikidata":"https://www.wikidata.org/wiki/Q23389","display_name":"Nash equilibrium","level":2,"score":0.6710947155952454},{"id":"https://openalex.org/C75949130","wikidata":"https://www.wikidata.org/wiki/Q848010","display_name":"Database transaction","level":2,"score":0.6485437154769897},{"id":"https://openalex.org/C89611455","wikidata":"https://www.wikidata.org/wiki/Q6804646","display_name":"Mechanism (biology)","level":2,"score":0.5826811790466309},{"id":"https://openalex.org/C2986314615","wikidata":"https://www.wikidata.org/wiki/Q36829","display_name":"Pareto optimal","level":3,"score":0.5734467506408691},{"id":"https://openalex.org/C153517567","wikidata":"https://www.wikidata.org/wiki/Q26090","display_name":"Mechanism design","level":2,"score":0.48259198665618896},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.45862430334091187},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.4393007457256317},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.43261411786079407},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.43070870637893677},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.4216039180755615},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.42055544257164},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.3159216642379761},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.22803443670272827},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1280779242515564},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.10818195343017578},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/sahcn.2009.5168911","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sahcn.2009.5168911","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 6th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.411.973","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.411.973","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cacs.louisiana.edu/~wu/paper/bargin-secon09.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1559785148","https://openalex.org/W1630733292","https://openalex.org/W1649979232","https://openalex.org/W1783774796","https://openalex.org/W1974887268","https://openalex.org/W2042413420","https://openalex.org/W2069423052","https://openalex.org/W2127699957","https://openalex.org/W2149479922","https://openalex.org/W2162862273","https://openalex.org/W6678686615","https://openalex.org/W6683966771"],"related_works":["https://openalex.org/W1963790170","https://openalex.org/W2073298047","https://openalex.org/W2033790662","https://openalex.org/W2586328217","https://openalex.org/W2049264236","https://openalex.org/W317165722","https://openalex.org/W2728870795","https://openalex.org/W312725187","https://openalex.org/W1923149708","https://openalex.org/W1999828099"],"abstract_inverted_index":{"This":[0],"paper":[1],"focuses":[2],"on":[3,97],"the":[4,30,39,81,87],"Participatory":[5],"Sensing":[6],"Network":[7],"(PSN)":[8],"that":[9],"consists":[10],"of":[11,86],"selfish":[12,31],"participants":[13],"stimulated":[14],"by":[15,93],"certain":[16],"reward":[17],"programs.":[18],"We":[19,37,49,73],"propose":[20],"a":[21,47,54,76],"bargain-based":[22,88],"mechanism":[23,90],"to":[24,33,63,79],"encourage":[25],"cooperative":[26,56],"message":[27,44,51],"trading":[28],"among":[29],"nodes":[32],"maximize":[34],"their":[35],"rewards.":[36],"state":[38],"necessary":[40],"condition":[41],"for":[42],"feasible":[43],"transactions":[45],"in":[46],"theorem.":[48],"model":[50],"transaction":[52],"as":[53],"two-person":[55],"game,":[57],"and":[58,70],"we":[59],"apply":[60],"Nash":[61],"Theorem":[62],"obtain":[64],"optimal":[65,82],"solution":[66],"which":[67],"is":[68,91],"fair":[69],"Pareto":[71],"optimal.":[72],"also":[74],"present":[75],"greedy":[77],"algorithm":[78],"reach":[80],"solution.":[83],"The":[84],"effectiveness":[85],"stimulation":[89],"studied":[92],"extensive":[94],"simulations":[95],"based":[96],"real":[98],"mobility":[99],"traces.":[100]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":14},{"year":2015,"cited_by_count":9},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":7}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}
