Options
Fu, Xiaoming
Loading...
Preferred name
Fu, Xiaoming
Official Name
Fu, Xiaoming
Alternative Name
Fu, X.
Main Affiliation
ORCID
Now showing 1 - 10 of 19
2017Book Chapter [["dc.contributor.author","Zhu, Konglin"],["dc.contributor.author","Fu, Xiaoming"],["dc.contributor.author","Li, Wenzhong"],["dc.contributor.author","Lu, Sanglu"],["dc.contributor.author","Nagler, Jan"],["dc.contributor.editor","Fu, Xiaoming"],["dc.contributor.editor","Luo, Jar-Der"],["dc.contributor.editor","Boos, Margarete"],["dc.date.accessioned","2017-09-07T11:50:48Z"],["dc.date.available","2017-09-07T11:50:48Z"],["dc.date.issued","2017"],["dc.identifier.doi","10.1371/journal.pone.0100023"],["dc.identifier.gro","3147824"],["dc.identifier.purl","https://resolver.sub.uni-goettingen.de/purl?gs-1/10488"],["dc.identifier.uri","https://resolver.sub.uni-goettingen.de/purl?gro-2/5150"],["dc.language.iso","en"],["dc.notes.intern","Merged from goescholar"],["dc.notes.status","final"],["dc.notes.submitter","chake"],["dc.publisher","Taylor & Francis Group"],["dc.publisher.place","Boca Raton"],["dc.relation.isbn","1-4987-3664-5"],["dc.relation.ispartof","Social Network Analysis: Interdisciplinary Approaches and Case"],["dc.rights","CC BY 4.0"],["dc.rights.uri","https://creativecommons.org/licenses/by/4.0"],["dc.title","How Do Online Social Networks Grow?"],["dc.type","book_chapter"],["dc.type.internalPublication","unknown"],["dc.type.peerReviewed","no"],["dc.type.version","published_version"],["dspace.entity.type","Publication"]]Details DOI2015Journal Article [["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"]]Details DOI2012Conference Abstract [["dc.contributor.author","Zhu, Konglin"],["dc.contributor.author","Li, Wenzhong"],["dc.contributor.author","Fu, Xiaoming"],["dc.date.accessioned","2018-05-02T11:40:54Z"],["dc.date.available","2018-05-02T11:40:54Z"],["dc.date.issued","2012"],["dc.identifier.uri","https://resolver.sub.uni-goettingen.de/purl?gro-2/13814"],["dc.language.iso","en"],["dc.notes.status","final"],["dc.publisher","PdN"],["dc.relation.eventend","2012-05"],["dc.relation.eventlocation","Frankfurt am Main, Germany"],["dc.relation.eventstart","2012-05"],["dc.title","Exploring Regional and Global Population Growth in Online Social Networks"],["dc.type","conference_abstract"],["dc.type.internalPublication","unknown"],["dspace.entity.type","Publication"]]Details2015Journal Article [["dc.bibliographiccitation.firstpage","382"],["dc.bibliographiccitation.issue","2"],["dc.bibliographiccitation.journal","IEEE Transactions on Parallel and Distributed Systems"],["dc.bibliographiccitation.lastpage","391"],["dc.bibliographiccitation.volume","26"],["dc.contributor.author","Li, Wenzhong"],["dc.contributor.author","Hu, Yuefei"],["dc.contributor.author","Fu, Xiaoming"],["dc.contributor.author","Lu, Sanglu"],["dc.contributor.author","Chen, Daoxu"],["dc.date.accessioned","2017-09-07T11:44:53Z"],["dc.date.available","2017-09-07T11:44:53Z"],["dc.date.issued","2015"],["dc.identifier.doi","10.1109/tpds.2014.2310471"],["dc.identifier.gro","3148995"],["dc.identifier.uri","https://resolver.sub.uni-goettingen.de/purl?gro-2/5635"],["dc.notes.intern","Fu Crossref Import"],["dc.notes.status","final"],["dc.notes.submitter","chake"],["dc.relation.issn","1045-9219"],["dc.title","Cooperative Positioning and Tracking in Disruption Tolerant Networks"],["dc.type","journal_article"],["dc.type.internalPublication","unknown"],["dc.type.peerReviewed","no"],["dspace.entity.type","Publication"]]Details DOI2013Journal Article [["dc.bibliographiccitation.firstpage","1"],["dc.bibliographiccitation.issue","8"],["dc.bibliographiccitation.journal","Science China Information Sciences"],["dc.bibliographiccitation.lastpage","15"],["dc.bibliographiccitation.volume","56"],["dc.contributor.author","Li, Wenzhong"],["dc.contributor.author","Fu, Xiaoming"],["dc.contributor.author","Chan, Edward"],["dc.contributor.author","Lu, SangLu"],["dc.contributor.author","Chen, DaoXu"],["dc.date.accessioned","2017-09-07T11:44:57Z"],["dc.date.available","2017-09-07T11:44:57Z"],["dc.date.issued","2013"],["dc.identifier.doi","10.1007/s11432-013-4910-x"],["dc.identifier.gro","3149025"],["dc.identifier.uri","https://resolver.sub.uni-goettingen.de/purl?gro-2/5668"],["dc.notes.intern","Fu Crossref Import"],["dc.notes.status","final"],["dc.notes.submitter","chake"],["dc.relation.issn","1674-733X"],["dc.title","Golden age: on multi-source software update propagation in pervasive networking environments"],["dc.type","journal_article"],["dc.type.internalPublication","unknown"],["dc.type.peerReviewed","no"],["dspace.entity.type","Publication"]]Details DOI2017Book Chapter [["dc.bibliographiccitation.firstpage","307"],["dc.bibliographiccitation.lastpage","342"],["dc.contributor.author","Li, Wenzhong"],["dc.contributor.author","Lu, Sanglu"],["dc.contributor.author","Zhu, Konglin"],["dc.contributor.author","Chen, Xiao"],["dc.contributor.author","Nagler, Jan"],["dc.contributor.author","Fu, Xiaoming"],["dc.contributor.editor","Fu, Xiaoming"],["dc.contributor.editor","Luo, Jar-Der"],["dc.contributor.editor","Boos, Margarete"],["dc.date.accessioned","2017-09-07T11:44:50Z"],["dc.date.available","2017-09-07T11:44:50Z"],["dc.date.issued","2017"],["dc.identifier.doi","10.1201/9781315369594-14"],["dc.identifier.gro","3148990"],["dc.identifier.uri","https://resolver.sub.uni-goettingen.de/purl?gro-2/5629"],["dc.language.iso","en"],["dc.notes.intern","Fu Crossref Import"],["dc.notes.status","final"],["dc.notes.submitter","chake"],["dc.publisher","CRC Press"],["dc.publisher.place","Boca Raton/London/New York"],["dc.relation.eisbn","978-1-4987-3668-8"],["dc.relation.isbn","978-1-4987-3664-0"],["dc.relation.ispartof","Social Network Analysis"],["dc.title","Information Dissemination in Social-Featured Opportunistic Networks"],["dc.type","book_chapter"],["dc.type.internalPublication","unknown"],["dc.type.peerReviewed","no"],["dspace.entity.type","Publication"]]Details DOI2014Journal Article [["dc.bibliographiccitation.firstpage","3423"],["dc.bibliographiccitation.issue","7"],["dc.bibliographiccitation.journal","IEEE Transactions on Vehicular Technology"],["dc.bibliographiccitation.lastpage","3434"],["dc.bibliographiccitation.volume","63"],["dc.contributor.author","Zhu, Konglin"],["dc.contributor.author","Li, Wenzhong"],["dc.contributor.author","Fu, Xiaoming"],["dc.date.accessioned","2017-09-07T11:44:57Z"],["dc.date.available","2017-09-07T11:44:57Z"],["dc.date.issued","2014"],["dc.identifier.doi","10.1109/tvt.2014.2298494"],["dc.identifier.gro","3149028"],["dc.identifier.uri","https://resolver.sub.uni-goettingen.de/purl?gro-2/5671"],["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","1939-9359"],["dc.relation.issn","0018-9545"],["dc.title","SMART: A Social- and Mobile-Aware Routing Strategy for Disruption-Tolerant Networks"],["dc.type","journal_article"],["dc.type.internalPublication","unknown"],["dc.type.peerReviewed","no"],["dspace.entity.type","Publication"]]Details DOI2013Conference Paper [["dc.bibliographiccitation.firstpage","000705"],["dc.bibliographiccitation.lastpage","000710"],["dc.contributor.author","Wei, Xingshen"],["dc.contributor.author","Li, Wenzhong"],["dc.contributor.author","Wang, Xiaoliang"],["dc.contributor.author","Lu, Sanglu"],["dc.contributor.author","Fu, Xiaoming"],["dc.date.accessioned","2018-04-30T09:18:11Z"],["dc.date.available","2018-04-30T09:18:11Z"],["dc.date.issued","2013"],["dc.description.abstract","Error correction techniques play an important role to guarantee reliable communication in wireless networks. The widely used error-correcting codes (ECCs) such as Hamming code introduce the benefit of error correction without retransmitting the data packet, but they suffer from high redundancy and communication overhead. In the recent years, error estimating code (EEC) was proposed to estimate the bit-error-rate (BER) of a packet efficiently with very low data redundancy. However, the ability of error correction using EEC remains unexplored. In this paper, we argue that EEC can be used to recover erroneous bits from the data packet. To show the capacity of error recovery with EEC, we propose an error correction scheme based on the parity check information provided by the EEC bits. We first introduce a filtering algorithm to rule out the correct data bits and obtain a set of suspicious bits containing most of the errors. Then we apply a polynomial randomized algorithm called Rand_flipping to examine the suspicious bits and flip the most promising erroneous bits aiming to minimize the total numbers of errors in the packet. Theoretical analysis proves that under some constraints the proposed Rand_flipping algorithm can correct most of the erroneous bits with probability higher than 1-1/e. Extensive experiments based on a real WiFi trace are conducted, which shows that the proposed algorithm corrects over 80% erroneous bits of the trace in practice."],["dc.identifier.doi","10.1109/ISCC.2013.6755031"],["dc.identifier.uri","https://resolver.sub.uni-goettingen.de/purl?gro-2/13798"],["dc.language.iso","en"],["dc.notes.preprint","yes"],["dc.notes.status","final"],["dc.publisher","IEEE"],["dc.relation.conference","Symposium on Computers and Communications (lSCC 2013)"],["dc.relation.eventend","2013-07-10"],["dc.relation.eventlocation","Split, Croatia"],["dc.relation.eventstart","2013-07-07"],["dc.relation.isbn","978-1-4799-3755-4"],["dc.relation.iserratumof","yes"],["dc.title","Recovering erroneous data bits using error estimating code"],["dc.type","conference_paper"],["dc.type.internalPublication","unknown"],["dspace.entity.type","Publication"]]Details DOI2011Conference Paper [["dc.bibliographiccitation.firstpage","1"],["dc.bibliographiccitation.lastpage","6"],["dc.contributor.author","Tian, Yu"],["dc.contributor.author","Li, Wenzhong"],["dc.contributor.author","Li, Zhuo"],["dc.contributor.author","Lu, Sanglu"],["dc.contributor.author","Fu, Xiaoming"],["dc.date.accessioned","2018-05-07T11:45:55Z"],["dc.date.available","2018-05-07T11:45:55Z"],["dc.date.issued","2011"],["dc.description.abstract","Opportunistic spectrum access, which allows secondary users opportunistically access unused licensed channels to exploit instantaneous spectrum availability, is a promising approach to achieve efficient spectrum utilization and mitigate spectrum scarcity. To address the challenge of dynamic spectrum access, one of the most important issues is cooperative spectrum reallocation among secondary users to minimize spectrum handoffs. In this paper, we present a low-complexity approach based on conflict graph to optimize spectrum reallocation by local coordination. In order to reduce communication overhead, we propose two heuristic spectrum selection methods named local observation and metric maximum. Experimental results show two benefits of the proposed schemes. On one hand, the coordination approach can dynamically improve the total system throughput (approximately doubled at most). On the other hand, our heuristic strategies decrease the number of spectrum handoff by up to 20% compared with existing strategies."],["dc.identifier.doi","10.1109/ICCCN.2011.6005935"],["dc.identifier.uri","https://resolver.sub.uni-goettingen.de/purl?gro-2/14621"],["dc.language.iso","en"],["dc.notes.status","final"],["dc.publisher","IEEE"],["dc.relation.conference","International Conference on Computer Communications and Networks"],["dc.relation.eventend","2011-08-04"],["dc.relation.eventlocation","Maui, HI, USA"],["dc.relation.eventstart","2011-07-31"],["dc.relation.isbn","978-1-4577-0637-0"],["dc.relation.ispartof","Proceedings of IEEE 20th International Conference on Computer Communications and Networks"],["dc.title","Low Overhead Dynamic Spectrum Reallocation in Opportunistic Spectrum Access Networks"],["dc.type","conference_paper"],["dc.type.internalPublication","unknown"],["dspace.entity.type","Publication"]]Details DOI2010Report [["dc.bibliographiccitation.volume","IFI-TB-2010-03"],["dc.contributor.author","Xu, Tianyin"],["dc.contributor.author","Ye, Baoliu"],["dc.contributor.author","Wang, Qinhui"],["dc.contributor.author","Li, Wenzhong"],["dc.contributor.author","Lu, Sanglu"],["dc.contributor.author","Fu, Xiaoming"],["dc.date.accessioned","2018-05-28T09:27:53Z"],["dc.date.available","2018-05-28T09:27:53Z"],["dc.date.issued","2010"],["dc.identifier.issn","1611-1044"],["dc.identifier.uri","http://hdl.handle.net/2/14781"],["dc.language.iso","en"],["dc.notes.status","final"],["dc.publisher","Institute of Computer Science, Georg-August-Universität Göttingen"],["dc.publisher.place","Göttingen"],["dc.title","A personalization framework to improve quality of experience for DVD-like functions in P2P VoD applications"],["dc.type","report"],["dc.type.internalPublication","yes"],["dspace.entity.type","Publication"]]Details