I received my PhD in computer science from INP Toulouse in 2013 and my Master of Research as well as an engineering degree, both in networks and telecommucations, from INSA Toulouse, in 2009.
My research is in the area of mobile and wireless networking, with current interest in mobile data analytics. My past work has contributed to delay-tolerant, mobile-opportunistic networks, mobile cloud computing, mobile sensing and network localization .
I'm currently involved in the ANR ABCD project, working on mobile data analysis for future 5G networks.
Previously, I worked on 2 DGA (Direction générale de l'armement) collaborative projects in the field of mobile sensing and drone network collaborative localization
My PhD work was a project funded by the MESR (French Ministry of Higher Education and Research. The project aims to model and analyze dynamic networks with application for routing in mobile opportunistic networks.
Behavioral and Structural Analysis of Mobile Cloud Opportunistic Networks Anh-Dung Nguyen, Patrick Sénac and Michel Diaz Book chapter in "Opportunistic Mobile Social Networks, CRCPress, 2014
Contributions to modeling, structural analysis, and routing performance in dynamic networks - Thesis nominated by the dissertation committee for the Leopold Escande prize (each year, this prize award the best thesis of INP Toulouse, about 15% of theses are nominated)
Modeling mobile opportunistic networks - from mobility to structural and behavioral analysis Anh-Dung Nguyen, Patrick Senac, Michel Diaz Elsevier Ad Hoc Networks (IF 1.943)
Tightly Coupled INS/DGPS System for Collaborative Navigation in Mobile Ad Hoc Networks
Pages, Gael and Anh-Dung Nguyen and Perennou, Tanguy and Calmette, Vincent and Benoit, Priot ION-GNSS 2014
Low-Cost INS/DGPS-Aided Collaborative Navigation
In Mobile Ad Hoc Network Anh-Dung Nguyen, Gaël Pages, Tanguy Pérennou, Vincent Calmettes ENC-GNSS 2014, Rotterdam, Netherlands
How Disorder Impacts Routing in Human-Centric Disruption Tolerant Networks Anh-Dung Nguyen, Patrick Sénac and Michel Diaz ACM SIGCOMM 2013 Workshop on Future Human-Centric Multimedia Networking, Hong Kong
On the Impact of Disorder on Dynamic Networks Navigation Anh-Dung Nguyen, Patrick Sénac, Tanguy Pérennou Temporal and Dynamic Networks: From Data to Models workshop, NetSci 2013, Copenhagen, Denmark
On the Impact of Disorder on Dynamic Network Navigation Anh-Dung Nguyen, Patrick Sénac and Michel Diaz IEEE INFOCOM 2013, Student Workshop, Turin, Italy (acceptance rate: 14%)
Understanding and Modeling the Small-World Phenomenon in Dynamic Networks Anh-Dung Nguyen, Patrick Sénac and Michel Diaz ACM MSWIM 2012, Paphos, Cyprus (acceptance rate = 26%)
How Mobility Increases Mobile Cloud Computing Processing Capacity Anh-Dung Nguyen, Patrick Sénac, Victor Ramiro and Michel Diaz
IEEE NCCA 2011, Toulouse, France
Pervasive Intelligent Routing in Content Centric Delay Tolerant Networks Anh-Dung Nguyen, Patrick Sénac, Victor Ramiro and Michel Diaz IEEE PICOM 2011, Sydney, Australia
Swarm-based Intelligent Routing (SIR) - a New Approach for Efficient Routing in Content Centric Delay Tolerant Networks Anh-Dung Nguyen, Patrick Sénac, Victor Ramiro and Michel Diaz ACM MOBIWAC 2011, Miami, USA (held in conjunction with MSWiM 2011, acceptance rate = 26%)
STEPS - an Approach for Human Mobility Modeling Anh-Dung Nguyen, Patrick Sénac, Victor Ramiro and Michel Diaz IFIP/TC6 NETWORKING 2011, Valencia, Spain (acceptance rate = 20%)
STIgmergy Routing (STIR) for Content-Centric Delay-Tolerant Networks Anh-Dung Nguyen, Patrick Sénac and Michel Diaz Latin-American Workshop on Dynamic Networks (LAWDN) 2010, Buenos Aires, Argentina
Analyse spatio-temporelle des traffics Internet dans les réseaux mobiles Anh-Dung Nguyen, Razvan Stanica, Marco Fiore Journées non thématiques RESCOM 2016, Lille
Stigmergy Routing Protocol for Content-Centric Delay-Tolerant Networks Anh-Dung Nguyen, Patrick Sénac and Michel Diaz RESCOM 2010, Giens
At INSA Lyon: network programing (24h)
At ISAE-ENSICA: introduction of computer science, object-oriented programming in JAVA (60h)
I developped the following pieces of code for my researche works. Please find the details in the related papers.
All-pairs-shortest-path algorithm for dynamic networks - this efficient algorithm allows to find the shortest dynamic path lengths (as defined in the paper "Understanding and Modeling the Small-World Phenomenon in Dynamic Networks") between all pairs of nodes in a dynamic network.
K-clique algorithm (in MATLAB) as defined in the paper "Uncovering the overlapping community structure of complex networks in nature and society" - G. Palla, I. Derényi, I. Farkas, and T. Vicsek - Nature 435, 814–818 (2005)
Reviewer for Transactions on Emerging Telecommunications Technologies Journal, Elsevier Computer Communications, Elsevier Ad Hoc Networks, Elsevier Journal of Network and Computer Applications, IEEE Transactions on Mobile Computing, IEEE Communications Letters IEEE WOWMOM, IEEE NCCA
Email: anh-dung.nguyen at inria dot fr
Address: Inria Antenne Lyon la Doua
56, Boulevard Niels Bohr