Bio-Inspired Computing and Networking

Adaptive Social Hierarchies: From Nature to Networks

■

345

lightweight in comparison to the role assignment algorithms as it piggybacks onto

existing network control packets providing a transparent evaluation of local role. To

control flooding, the role assignment algorithms use a limited hop neighborhood,

whereas ASH discovers network-wide information in order to assess rank.

The ranking of nodes can be viewed as sorting them into order according to their

attributes. We use a scaled domain, though, to represent the maximum value of the

attribute as 1 and the minimum as 0, so this method is not entirely a simple sorting

procedure. Some recent work has been performed on the theory of Random Sorting

Networks.

42

Random Sorting Networks are networks for