Future paths for integer programming and links to artificial intelligence
Computers and Operations Research - Special issue: Applications of integer programming
Routing with guaranteed delivery in ad hoc wireless networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
Small worlds: the dynamics of networks between order and randomness
Small worlds: the dynamics of networks between order and randomness
Self Organized Terminode Routing
Cluster Computing
The Small-World Phenomenon: An Algorithmic Perspective
The Small-World Phenomenon: An Algorithmic Perspective
Mobility-assisted resolution of queries in large-scale mobile sensor networks (MARQ)
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Wireless sensor networks
CAPTURE: location-free contact-assisted power-efficient query resolution for sensor networks
ACM SIGMOBILE Mobile Computing and Communications Review - Special issue on wireless pan & sensor networks
A Location-Based Routing Method for Mobile Ad Hoc Networks
IEEE Transactions on Mobile Computing
A scalable routing scheme with group motion support in large and dense wireless ad hoc networks
Computers and Electrical Engineering
Routing in wireless networks with position trees
ADHOC-NOW'07 Proceedings of the 6th international conference on Ad-hoc, mobile and wireless networks
Path approximation for multi-hop wireless routing under application-based accuracy constraints
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
Terminode routing, defined for potentially very large mobile ad hoc networks, forwards packets along anchored paths. An anchored path is a list of fixed geographic points, called anchors. Given that geographic points do not move, the advantage to traditional routing paths is that an anchored path is always "valid". In order to forward packets along anchored paths, the source needs to acquire them by means of path discovery methods. We present two of such methods: Friend Assisted Path Discovery assumes a common protocol in all nodes and a high collaboration among nodes for providing paths. It is a social oriented path discovery scheme. Geographic Maps-based Path Discovery needs to have or to build a summarized view of the network topology, but does not require explicit collaboration of nodes for acquiring path. The two schemes are complementary and can coexist.