Results 191 to 200 of about 2,533,593 (249)
Beacon-less geographic routing for multihop wireless sensor networks
, 2012 Ibrahim Amadou, VALOIS, Fabrice
openalex +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Energy-Aware Geographic Routing for Real-Time Workforce Monitoring in Industrial Informatics
IEEE Internet of Things Journal, 2021Workforce monitoring is a vital activity in large factories in order to oversee the worker’s concentration on their duty and increase productivity. Workforces are kind of moving targets which can be monitored via wireless sensor networks (WSNs).
A. K. Sangaiah +6 more
semanticscholar +1 more source
Adaptive UAV-Assisted Geographic Routing With Q-Learning in VANET
IEEE Communications Letters, 2021The Q-learning based geographic routing approaches suffer from problems of low converging speed and inefficient resources utilization in VANET due to the dynamic scale of Q-value table.
Shanshan Jiang +2 more
semanticscholar +1 more source
Journal of the Institution of Electronics and Telecommunication Engineers, 2023
In situations where a regular network may not be appropriate or is unable to function correctly, data collection and real-time transmission are commonly done using Wireless Sensor Networks (WSNs).
P. P. Bairagi, M. Dutta, K. S. Babulal
semanticscholar +1 more source
In situations where a regular network may not be appropriate or is unable to function correctly, data collection and real-time transmission are commonly done using Wireless Sensor Networks (WSNs).
P. P. Bairagi, M. Dutta, K. S. Babulal
semanticscholar +1 more source
International Journal of Pervasive Computing and Communications, 2020
Purpose This study aims to evaluate the direct trust value for each node and calculate the trust value of all nodes satisfying the condition and update the trust value and value each trust update interval for a secure and efficient communication between
F. H. Shajin, P. Rajesh
semanticscholar +1 more source
Purpose This study aims to evaluate the direct trust value for each node and calculate the trust value of all nodes satisfying the condition and update the trust value and value each trust update interval for a secure and efficient communication between
F. H. Shajin, P. Rajesh
semanticscholar +1 more source
A comparative study on geographic‐based routing algorithms for flying ad‐hoc networks
Concurrency and Computation, 2021The advancement of the technology and broad availability of low‐cost devices (e.g., networking technology, micro‐embedded computers, and sensors, etc.) have opened new ways for the expansion of flying ad‐hoc networks (FANETs).
Juhi Agrawal, M. Kapoor
semanticscholar +1 more source
Proceedings of the 2006 international conference on Wireless communications and mobile computing, 2006
High-resolution data collection using low-cost wireless sensor networks has recently become feasible due to advances in electronics and wireless networking technologies. High quality data collection over an extended period of time requires consideration of a number of orthogonal goals including scalability, versatility, reliability and energy ...
Jeff Hornsberger, Gholamali C. Shoja
openaire +1 more source
High-resolution data collection using low-cost wireless sensor networks has recently become feasible due to advances in electronics and wireless networking technologies. High quality data collection over an extended period of time requires consideration of a number of orthogonal goals including scalability, versatility, reliability and energy ...
Jeff Hornsberger, Gholamali C. Shoja
openaire +1 more source
2011 IEEE Symposium on Computers and Communications (ISCC), 2011
In this paper we offer a novel geographical routing algorithm that relies on a well known data structure called Quadtree. Quadtree is an efficient method of mapping a two-dimensional area by recursively partitioning it to disjoint squares. We present a greedy, guaranteed delivery routing algorithm called Greedy-Quadtree-Greedy (GQG).
Chen Avin, Yaniv Dvory, Ran Giladi
openaire +1 more source
In this paper we offer a novel geographical routing algorithm that relies on a well known data structure called Quadtree. Quadtree is an efficient method of mapping a two-dimensional area by recursively partitioning it to disjoint squares. We present a greedy, guaranteed delivery routing algorithm called Greedy-Quadtree-Greedy (GQG).
Chen Avin, Yaniv Dvory, Ran Giladi
openaire +1 more source