Zhu, Konglin

[["dc.bibliographiccitation.firstpage","7585"],["dc.bibliographiccitation.journal","IEEE Access"],["dc.bibliographiccitation.lastpage","7593"],["dc.bibliographiccitation.volume","4"],["dc.contributor.author","Zhu, Konglin"],["dc.contributor.author","Zhi, Wenting"],["dc.contributor.author","Zhang, Lin"],["dc.contributor.author","Chen, Xu"],["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/access.2016.2618940"],["dc.identifier.gro","3148996"],["dc.identifier.uri","https://resolver.sub.uni-goettingen.de/purl?gro-2/5636"],["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.eissn","2169-3536"],["dc.relation.issn","2169-3536"],["dc.title","Social-Aware Incentivized Caching for D2D Communications"],["dc.type","journal_article"],["dc.type.internalPublication","unknown"],["dc.type.peerReviewed","no"],["dspace.entity.type","Publication"]]

[["dc.bibliographiccitation.firstpage","183"],["dc.bibliographiccitation.journal","Computer Networks"],["dc.bibliographiccitation.lastpage","198"],["dc.bibliographiccitation.volume","93"],["dc.contributor.author","Zhu, Konglin"],["dc.contributor.author","Li, Wenzhong"],["dc.contributor.author","Fu, Xiaoming"],["dc.contributor.author","Zhang, Lin"],["dc.date.accessioned","2017-09-07T11:44:54Z"],["dc.date.available","2017-09-07T11:44:54Z"],["dc.date.issued","2015"],["dc.identifier.doi","10.1016/j.comnet.2015.10.018"],["dc.identifier.gro","3149006"],["dc.identifier.uri","https://resolver.sub.uni-goettingen.de/purl?gro-2/5647"],["dc.notes.intern","Fu Crossref Import"],["dc.notes.status","final"],["dc.notes.submitter","chake"],["dc.publisher","Elsevier BV"],["dc.relation.issn","1389-1286"],["dc.title","Data routing strategies in opportunistic mobile social networks: Taxonomy and open challenges"],["dc.type","journal_article"],["dc.type.internalPublication","unknown"],["dc.type.peerReviewed","no"],["dspace.entity.type","Publication"]]

[["dc.bibliographiccitation.firstpage","3234"],["dc.bibliographiccitation.lastpage","3239"],["dc.contributor.author","Zhu, Konglin"],["dc.contributor.author","Li, Wenzhong"],["dc.contributor.author","Fu, Xiaoming"],["dc.contributor.author","Zhang, Lin"],["dc.date.accessioned","2018-04-23T09:08:11Z"],["dc.date.available","2018-04-23T09:08:11Z"],["dc.date.issued","2015"],["dc.description.abstract","Opportunistic Mobile Social Networks (MSNs) as a kind of social network in which nodes are opportunistically connected. Many data routing strategies have been proposed for opportunistic MSNs. Most of them apply a utility for relay selection that a node with a higher utility value is selected as relay. However, such utility-based routing strategies run into dead end problem in which the data is stuck into a node with local maximal utility value. In this paper, we propose a virtual routing method named VIRO, which exerts conformal mapping to convert the local topology of dead end into a virtual geometric map to guarantee data dissemination to the next relay. We first convert the utility into geometric planner, and then conduct the discrete Ricci Flow bypass the gap between the dead end and next relay. Extensive experiment results suggest VIRO can reduce the ratio of dead end effectively so that the data delivery ratio is enhanced up to 42% by increasing only a slight amount of delay and cost."],["dc.identifier.doi","10.1109/ICC.2015.7248822"],["dc.identifier.uri","https://resolver.sub.uni-goettingen.de/purl?gro-2/13260"],["dc.language.iso","en"],["dc.notes.preprint","yes"],["dc.notes.status","final"],["dc.publisher","IEEE"],["dc.relation.conference","IEEE International Conference on Communications"],["dc.relation.eventend","2015-06-12"],["dc.relation.eventlocation","London, UK"],["dc.relation.eventstart","2015-06-08"],["dc.relation.isbn","978-1-4673-6432-4"],["dc.relation.iserratumof","yes"],["dc.title","VIRO: A virtual routing method for eliminating dead end in Opportunistic Mobile Social Network"],["dc.type","conference_paper"],["dc.type.internalPublication","unknown"],["dspace.entity.type","Publication"]]