Hierarchical state routing

Hierarchical state routing (HSR), proposed in Scalable Routing Strategies for Ad Hoc Wireless Networks by Iwata et al. (1999),^[1]^[2] is a typical example of a hierarchical routing protocol.

HSR maintains a hierarchical topology, where elected clusterheads at the lowest level become members of the next higher level. On the higher level, superclusters are formed, and so on. Nodes which want to communicate to a node outside of their cluster ask their clusterhead to forward their packet to the next level, until a clusterhead of the other node is in the same cluster. The packet then travels down to the destination node.

Furthermore, HSR proposes to cluster nodes in a logical way instead of in a geological^{[clarification needed]} way: members of the same company or in the same battlegroup are clustered together, assuming they will communicate much within the logical cluster.

HSR does not specify how a cluster is to be formed.

References

^ Iwata, A.; Ching-Chuan Chiang; Guangyu Pei; Gerla, M.; Tsu-Wei Chen (1999). "Scalable routing strategies for ad hoc wireless networks". IEEE Journal on Selected Areas in Communications. 17 (8): 1369–1379. doi:10.1109/49.779920.
^ Guangyu Pei; Gerla, M.; Hong, X.; Chiang, C.-C. (21 September 1999). A Wireless Hierarchical Routing Protocol with Group Mobility. Wireless Communications and Networking Conference. Vol. 3. pp. 1538–1542. doi:10.1109/WCNC.1999.796996.

This computer networking article is a stub. You can help Wikipedia by expanding it.

[1] Iwata, A.; Ching-Chuan Chiang; Guangyu Pei; Gerla, M.; Tsu-Wei Chen (1999). "Scalable routing strategies for ad hoc wireless networks". IEEE Journal on Selected Areas in Communications. 17 (8): 1369–1379. doi:10.1109/49.779920.

[2] Guangyu Pei; Gerla, M.; Hong, X.; Chiang, C.-C. (21 September 1999). A Wireless Hierarchical Routing Protocol with Group Mobility. Wireless Communications and Networking Conference. Vol. 3. pp. 1538–1542. doi:10.1109/WCNC.1999.796996.

[1]

[2]