default search action
Farid Benbadis
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
- [c22]Clément Bertier, Marcelo Dias de Amorim, Farid Benbadis, Vania Conan:
Modeling Realistic Bit Rates of D2D Communications between Android Devices. MSWiM 2019: 315-322 - [c21]Clément Bertier, Farid Benbadis, Vania Conan, Marcelo Dias de Amorim:
Computing Realistic and Adaptive Capacity of D2D Contacts. WOWMOM 2019: 1-9 - 2018
- [c20]Clément Bertier, Farid Benbadis, Marcelo Dias de Amorim, Vania Conan:
Centrality Maps for Moving Nodes. COMPLEX NETWORKS (1) 2018: 118-129 - [c19]Farid Benbadis, Hicham Khalife, Catherine Lamy-Bergot
:
Efficient Scheduling for Planned Robot Networks. ICT 2018: 319-323 - 2016
- [c18]Anass Seddiki, David Lim, Farid Benbadis:
DECODE: DisruptivE COntent DissEmination with or without infrastructure, it syncs. MobiArch 2016: 37-39 - 2015
- [c17]Alexis Sultan, Farid Benbadis, Vincent Gauthier
Mobile Data Network Analysis Platform. HotPlanet@MobiCom 2015: 13-18 - [c16]Farid Benbadis, Filippo Rebecchi, Florian Cosnier, Matteo Sammarco, Marcelo Dias de Amorim, Vania Conan:
Demo: D2D Rescue of Overloaded Cellular Channels. MobiSys 2015: 441 - 2014
- [j5]Marcelo Yannuzzi, Muhammad Shuaib Siddiqui, Annika Sällström, John Brian Pickering, René Serral-Gracià, Anny Martínez, W. Chen, S. Taylor, Farid Benbadis, Jeremie Leguay
TEFIS: A single access point for conducting multifaceted experiments on heterogeneous test facilities. Comput. Networks 63: 147-172 (2014) - [c15]Farid Benbadis, Filippo Rebecchi, Florian Cosnier, Matteo Sammarco, Marcelo Dias de Amorim, Vania Conan:
Demo: opportunistic communications to alleviate cellular infrastructures: the FP7-moto approach. CHANTS@MobiCom 2014: 85-88 - 2013
- [c14]Christophe Melki, Farid Benbadis, Luigi Iannone:
Graceful node shutdown in wireless mesh networks. AINTEC 2013: 49-56 - 2012
- [c13]Georgios Aristomenopoulos, Argyris Kaninis, Panagiotis Vlahopoulos, Annika Sällström, Farid Benbadis, Symeon Papavassiliou:
The QUEENS Experiment through TEFIS Platform. TRIDENTCOM 2012: 394-396 - 2011
- [j4]Yesid Jarma, Golnaz Karbaschi, Marcelo Dias de Amorim, Farid Benbadis, Guillaume Chelius:
Volume-aware positioning in the context of a marine port terminal. Comput. Commun. 34(8): 962-972 (2011) - [j3]Pierre-Ugo Tournoux, Jeremie Leguay
Density-Aware Routing in Highly Dynamic DTNs: The RollerNet Case. IEEE Trans. Mob. Comput. 10(12): 1755-1768 (2011) - [c12]Stéphane Rousseau, Farid Benbadis, Damien Lavaux:
Tendoc: A Network Coding Video Transmission for Public Safety. MASS 2011: 953-954 - [c11]Stéphane Rousseau, Farid Benbadis, Damien Lavaux, Vania Conan:
Public Safety Situation Aware Services over Cognitive Radio Networks. MASS 2011: 962-967 - [c10]Pierre-Ugo Tournoux, Vania Conan, Jon Crowcroft
Wardrop Equilibrium Formulation of Resource-Constrained DTN Routing in Public Safety Networks. MASS 2011: 968-974 - [c9]Jeremie Leguay
Travel eCommerce Experiment - Through TEFIS, a Single Access Point to Different Testbed Resources. ServiceWave 2011: 334-336 - [c8]Stéphane Rousseau, Farid Benbadis, Damien Lavaux, Laurent San:
Overview and optimization of flooding techniques in OLSR. WOWMOM 2011: 1-7
2000 – 2009
- 2009
- [c7]Pierre-Ugo Tournoux, Jeremie Leguay
The Accordion Phenomenon: Analysis, Characterization, and Impact on DTN Routing. INFOCOM 2009: 1116-1124 - [c6]Yesid Jarma, Golnaz Karbaschi, Marcelo Dias de Amorim, Farid Benbadis, Guillaume Chelius:
VAPS: Positioning with spatial constraints. WOWMOM 2009: 1-8 - 2008
- [j2]Farid Benbadis, Katia Obraczka, Jorge Cortés
Exploring Landmark Placement Strategies for Topology-Based Localization in Wireless Sensor Networks. EURASIP J. Adv. Signal Process. 2008 (2008) - [c5]Farid Benbadis, Fabien Mathieu, Nidhi Hegde, Diego Perino:
Playing with the Bandwidth Conservation Law. Peer-to-Peer Computing 2008: 140-149 - 2007
- [c4]Farid Benbadis, Katia Obraczka, Jorge Cortés, Alexandre Brandwajn:
Exploring Landmark Placement Strategies for Self-Localization in Wireless Sensor Networks. PIMRC 2007: 1-5 - 2006
- [j1]Marcelo Dias de Amorim, Farid Benbadis, Serge Fdida, Mihail L. Sichitiu
Dissecting the routing architecture of self-organizing networks. IEEE Wirel. Commun. 13(6): 98-104 (2006) - [c3]Farid Benbadis, Jeremie Leguay
Millipede: a rollerblade positioning system. WiNTECH 2006: 117-118 - [c2]Farid Benbadis, Marcelo Dias de Amorim, Serge Fdida:
The Effect of Locality on Coordinate Dissemination. PIMRC 2006: 1-5 - [i1]Farid Benbadis, Jean-Jacques Puig, Marcelo Dias de Amorim, Claude Chaudet, Timur Friedman
Jumps: Enhancing hop-count positioning in sensor networks using multiple coordinates. CoRR abs/cs/0604105 (2006) - 2005
- [c1]Farid Benbadis, Marcelo Dias de Amorim, Serge Fdida:
ELIP: Embedded Location Information Protocol. NETWORKING 2005: 1156-1167
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-09 21:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: