T
Thierry Val
Researcher at University of Toulouse
Publications - 155
Citations - 1752
Thierry Val is an academic researcher from University of Toulouse. The author has contributed to research in topics: Wireless sensor network & Wireless. The author has an hindex of 17, co-authored 145 publications receiving 1399 citations. Previous affiliations of Thierry Val include Centre national de la recherche scientifique & Nanjing University of Science and Technology.
Papers
More filters
Journal ArticleDOI
Which Wireless Technology for Industrial Wireless Sensor Networks? The Development of OCARI Technology
TL;DR: An industrial development of a wireless sensor network technology called OCARI: optimization of communication for ad hoc reliable industrial networks, which targets applications in harsh environments such as power plants and warships is presented.
Journal ArticleDOI
Improvement of range-free localization technology by a novel DV-hop protocol in wireless sensor networks
TL;DR: Simulation results prove that Selective 3-Anchor DV-hop algorithm offers the best performance when it comes to localization accuracy, mobility, synchronization and overhead.
Proceedings ArticleDOI
BLE localization using RSSI measurements and iRingLA
TL;DR: This paper proposes a model that averages the received signal strength indication (RSSI) at any distance domain which offered accuracy down to 0.4 meters, depending on the deployment configuration.
Proceedings Article
Comparative analysis of new high data rate wireless communication technologies "From Wi-Fi to WiMAX"
TL;DR: The confrontation of WiMAX and Wi-Fi characteristics will highlight evolutions in wireless networking and will give us keywords of what new networks are attended for.
Proceedings ArticleDOI
Improving Localization Accuracy Using Selective 3-Anchor DV-Hop Algorithm
Linqing Gui,Thierry Val,Anne Wei +2 more
TL;DR: A Selective 3- Anchor DV-hop algorithm with the following idea: the normal node first selects any three anchors to form a 3-anchor group, then it calculates the candidate positions based on each 3- anchor group, and finally according to the relation between candidate positions and the minimum hop counts to anchors, the normal nodes chooses the best candidate position.