Abstract
We describe a distributed method for keeping down “token-passing” overhead in a mobile multi-access network, by performing local corrections in the token-passing sequence as they become necessary due to changes in node spatial configuration. These corrections involve only a subset of the nodes in the network, thus reducing the required computational effort. The method consists of three distributed protocols. The first is for detecting deterioration and identifying a subset of nodes that constitutes a “problem area”, the second is to provide each node with the distances (propagation delays) to all other nodes, and the third is to use this topological information to construct a minimal spanning tree, from which a good “token passing” sequence can be derived. The second and third protocols may also have applications other than the one described here, such as position location, routing and broadcasting.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
