Pu, Lingjun

[["dc.contributor.author","Pu, Lingjun"],["dc.contributor.author","Chen, Xu"],["dc.contributor.author","Xu, Jingdong"],["dc.contributor.author","Fu, Xiaoming"],["dc.date.accessioned","2017-11-29T15:56:52Z"],["dc.date.available","2017-11-29T15:56:52Z"],["dc.date.issued","2016"],["dc.fs.externid","233140"],["dc.fs.pkfprnr","21263"],["dc.identifier.fs","622909"],["dc.identifier.uri","https://resolver.sub.uni-goettingen.de/purl?gro-2/11240"],["dc.language.iso","en"],["dc.notes.intern","FactScience-Import"],["dc.notes.status","final"],["dc.publisher","Institute of Electrical and Electronics Engineers (IEEE)"],["dc.publisher.place","New York, NY"],["dc.relation.conference","IEEE INFOCOM"],["dc.relation.ispartof","IEEE INFOCOM 2016"],["dc.title","Crowdlet: Optimal Worker Recruitment for Self-Organized Mobile Crowdsourcing"],["dc.type","conference_paper"],["dc.type.internalPublication","yes"],["dc.type.peerReviewed","unknown"],["dspace.entity.type","Publication"]]

[["dc.bibliographiccitation.firstpage","3887"],["dc.bibliographiccitation.issue","12"],["dc.bibliographiccitation.journal","IEEE Journal on Selected Areas in Communications"],["dc.bibliographiccitation.lastpage","3901"],["dc.bibliographiccitation.volume","34"],["dc.contributor.author","Pu, Lingjun"],["dc.contributor.author","Chen, Xu"],["dc.contributor.author","Xu, Jingdong"],["dc.contributor.author","Fu, Xiaoming"],["dc.date.accessioned","2017-09-07T11:44:52Z"],["dc.date.available","2017-09-07T11:44:52Z"],["dc.date.issued","2016"],["dc.identifier.doi","10.1109/jsac.2016.2624118"],["dc.identifier.gro","3148993"],["dc.identifier.uri","https://resolver.sub.uni-goettingen.de/purl?gro-2/5633"],["dc.notes.intern","Fu Crossref Import"],["dc.notes.status","final"],["dc.notes.submitter","chake"],["dc.publisher","Institute of Electrical and Electronics Engineers (IEEE)"],["dc.relation.issn","0733-8716"],["dc.title","D2D Fogging: An Energy-Efficient and Incentive-Aware Task Offloading Framework via Network-assisted D2D Collaboration"],["dc.type","journal_article"],["dc.type.internalPublication","unknown"],["dc.type.peerReviewed","no"],["dspace.entity.type","Publication"]]

[["dc.bibliographiccitation.firstpage","14"],["dc.bibliographiccitation.lastpage","19"],["dc.contributor.author","Pu, Lingjun"],["dc.contributor.author","Chen, Xu"],["dc.contributor.author","Xu, Jingdong"],["dc.contributor.author","Fu, Xiaoming"],["dc.date.accessioned","2018-04-23T08:38:44Z"],["dc.date.available","2018-04-23T08:38:44Z"],["dc.date.issued","2015"],["dc.description.abstract","In this paper, we advocate cooperative content retrieval , a novel and content-centric service paradigm via device-to-device (D2D) communications to reduce cellular traf fi c volume and to facilitate user wireless connectivity in mobile networks. By leveraging the Named Data Networking (NDN) principle, we propose sNDN ,a social-aware NDN framework to achieve ef fi cient cooperative con- tent retrieval. Speci fi cally, sNDN introduces Friendship Circle by grouping a user with her close friends of high physical proximity and content similarity. We construct NDN routing tables condi- tioned on Friendship Circle encounter frequency to navigate con- tent requests and content deliveries between Friendship Circles, and leverage social properties in Friendship Circle to search for the fi nal target as inner-Friendship Circle routing. The evaluation results demonstrate that sNDN outperforms other content retrieval schemes signi fi cantly."],["dc.identifier.doi","10.1145/2795381.2795386"],["dc.identifier.uri","https://resolver.sub.uni-goettingen.de/purl?gro-2/13253"],["dc.language.iso","en"],["dc.notes.preprint","yes"],["dc.notes.status","final"],["dc.publisher","ACM"],["dc.relation.conference","ACM International Workshop on Mobility in the Evolving Internet Architecture (MobiArch)"],["dc.relation.eventend","2015-09-07"],["dc.relation.eventlocation","Paris, France"],["dc.relation.eventstart","2015-09-07"],["dc.relation.isbn","978-1-4503-3695-6"],["dc.relation.iserratumof","yes"],["dc.title","sNDN: a Social-aware Named Data Framework for Cooperative Content Retrieval via D2D Communications"],["dc.type","conference_paper"],["dc.type.internalPublication","unknown"],["dspace.entity.type","Publication"]]

[["dc.bibliographiccitation.firstpage","848"],["dc.bibliographiccitation.issue","4"],["dc.bibliographiccitation.journal","IEEE Journal on Selected Areas in Communications"],["dc.bibliographiccitation.lastpage","862"],["dc.bibliographiccitation.volume","35"],["dc.contributor.author","Pu, Lingjun"],["dc.contributor.author","Chen, Xu"],["dc.contributor.author","Xu, Jingdong"],["dc.contributor.author","Fu, Xiaoming"],["dc.date.accessioned","2020-12-10T18:26:14Z"],["dc.date.available","2020-12-10T18:26:14Z"],["dc.date.issued","2017"],["dc.description.abstract","Recent years have witnessed the proliferation of mobile crowdsourcing that brings a new opportunity to leverage human intelligence and movement behaviors to wider application areas. In parallel with the development of online centralized platforms, we look into the realization of self-organized mobile crowdsourcing drawing on opportunistic networks, and propose the Crowd Foraging framework, in which a mobile task requester can proactively recruit a massive crowd of opportunistic encountered mobile workers in real time for quick and high-quality results. We present a comprehensive framework model that fully integrates human behavior factors for modeling task profile, worker arrival, and work ability, and then introduce a service quality concept to indicate the expected service gain that a requester can enjoy when she recruits an arrival worker by jointly considering the work ability of workers as well as timeliness and reward of tasks. Furthermore, we formulate a sequential worker recruitment problem as an online multiple stopping problem to maximize the expected sum of service quality, and accordingly derive an optimal worker recruitment policy through the dynamic programming principle, which exhibits a nice threshold-based structure. We provide data-driven case studies to validate the assumptions used in the policy design, and conduct extensive trace-driven numerical evaluations, which demonstrate that our policy can achieve superior performance (e.g., improve more than 30% performance over classic policies). Besides, our Android prototype shows that the Crowd Foraging framework is cost-efficient, such as requiring less than 7 s and 6 J in terms of time and energy consumption for the optimal threshold calculation in our policy in most cases."],["dc.identifier.doi","10.1109/JSAC.2017.2679598"],["dc.identifier.isi","000402151400003"],["dc.identifier.issn","0733-8716"],["dc.identifier.uri","https://resolver.sub.uni-goettingen.de/purl?gro-2/76005"],["dc.notes.intern","DOI Import GROB-354"],["dc.notes.status","zu prüfen"],["dc.notes.submitter","PUB_WoS_Import"],["dc.publisher","Ieee-inst Electrical Electronics Engineers Inc"],["dc.relation.issn","1558-0008"],["dc.relation.issn","0733-8716"],["dc.title","Crowd Foraging: A QoS-Oriented Self-Organized Mobile Crowdsourcing Framework Over Opportunistic Networks"],["dc.type","journal_article"],["dc.type.internalPublication","yes"],["dc.type.peerReviewed","yes"],["dc.type.status","published"],["dspace.entity.type","Publication"]]

[["dc.bibliographiccitation.firstpage","135"],["dc.bibliographiccitation.issue","1"],["dc.bibliographiccitation.journal","IEEE Transactions on Emerging Topics in Computing"],["dc.bibliographiccitation.lastpage","148"],["dc.bibliographiccitation.volume","7"],["dc.contributor.author","Pu, Lingjun"],["dc.contributor.author","Chen, Xu"],["dc.contributor.author","Xu, Jingdong"],["dc.contributor.author","Fu, Xiaoming"],["dc.date.accessioned","2022-06-08T08:00:24Z"],["dc.date.available","2022-06-08T08:00:24Z"],["dc.date.issued","2019"],["dc.identifier.doi","10.1109/tetc.2016.2581704"],["dc.identifier.gro","3149007"],["dc.identifier.uri","https://resolver.sub.uni-goettingen.de/purl?gro-2/111064"],["dc.notes.intern","DOI-Import GROB-575"],["dc.notes.status","final"],["dc.notes.submitter","chake"],["dc.publisher","Institute of Electrical and Electronics Engineers (IEEE)"],["dc.relation.eissn","2168-6750"],["dc.relation.eissn","2376-4562"],["dc.relation.issn","2168-6750"],["dc.title","Content Retrieval at the Edge: A Social-Aware and Named Data Cooperative Framework"],["dc.type","journal_article"],["dc.type.internalPublication","unknown"],["dc.type.peerReviewed","no"],["dspace.entity.type","Publication"]]