Location-aided routing (LAR) in mobile ad hoc networks
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Wireless Communications: Principles and Practice
Wireless Communications: Principles and Practice
Geometric ad-hoc routing: of theory and practice
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Trajectory based forwarding and its applications
Proceedings of the 9th annual international conference on Mobile computing and networking
Geometry of information propagation in massively dense ad hoc networks
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Efficient geographic routing in multihop wireless networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Wireless mesh networks: a survey
Computer Networks and ISDN Systems
Interperf '06 Proceedings from the 2006 workshop on Interdisciplinary systems approach in performance evaluation and design of computer & communications sytems
Energy concerns in wireless networks
IEEE Wireless Communications
The capacity of wireless networks
IEEE Transactions on Information Theory
IEEE Communications Magazine
A survey on position-based routing in mobile ad hoc networks
IEEE Network: The Magazine of Global Internetworking
Wireless Innovations as Enablers for Complex & Dynamic Artificial Systems
Wireless Personal Communications: An International Journal
On the scalability of expanding ring search for dense wireless sensor networks
Journal of Parallel and Distributed Computing
Journal of Network and Computer Applications
Applicability of Hop Distance in Random Sensor Networks
Wireless Personal Communications: An International Journal
Gauss-seidel correction algorithm: A macroscopic model-derived routing algorithm for WSNs
ACM Transactions on Sensor Networks (TOSN)
Hi-index | 0.00 |
This work is based on the observation that, as the number of nodes in a wireless network approaches infinity, minimum cost routes become smooth curves that observe the same laws followed by rays of light in properly defined optical media. Accordingly, in this paper an analogy between optimal routing in large wireless networks and Geometrical Optics is first formally defined. The analogy is based on the concept of the cost function, which plays the role of the refractive index in the networking context. Then, the relevance of the principle of Fermat and the eikonal equation in routing problems is shown, and a methodology for calculating the cost function is proposed and applied in two cases of special interest, i.e., bandwidth limited and energy limited networks. The applicability of the Optics-Networking analogy is also discussed in the case of networks with large but finite numbers of nodes. Finally, novel, distributed route discovery protocols that make use of the analogy are outlined.