Download Now Free registration required
This paper studies distributed topology control algorithms to support the efficient Open Shortest Path First (OSPF) link state routing in multi-hop wireless networks. It is highly desirable to retain the basic OSPF model of reliable flooding, especially when large quantities of external, rarely-changing routing data must be carried across the radio network. However, it is not easy to implement reliable flooding, and improper implementations may cause excessive message control overheads. An existing patent method proposes an expanding ring algorithm to build adjacency graph for reliable flooding.
- Format: PDF
- Size: 582.8 KB