GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Routing using potentials: a dynamic traffic-aware routing algorithm
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Computer Networks: The International Journal of Computer and Telecommunications Networking
A CDMA/TDD approach for wireless mesh networks
Computers and Electrical Engineering
IEEE Communications Letters
Controlled potential-based routing for large-scale wireless sensor networks
Proceedings of the 14th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
CATT: potential based routing with content caching for ICN
Proceedings of the second edition of the ICN workshop on Information-centric networking
Gauss-seidel correction algorithm: A macroscopic model-derived routing algorithm for WSNs
ACM Transactions on Sensor Networks (TOSN)
Controlled and self-organized routing for large-scale wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
Hi-index | 0.00 |
Congested hot spots and node failures severely degrade the performance of wireless mesh networks. However, conventional routing schemes are inefficient in mitigation of the problems. Considering analogy to physics, we propose a novel distributed potential-field-based routing scheme for anycast wireless mesh networks, which is robust to sudden traffic and network perturbations, effectively balancing load among multiple gateways and mesh nodes with little control overhead. Simulation results exhibit autonomous load balancing and failure-tolerant performance in wireless mesh networking.