![Page 1: Dynamic Leadership Protocol for S-nets Gregory J. Barlow, Thomas C. Henderson, Andrew L. Nelson, and Edward Grant North Carolina State University University](https://reader033.vdocuments.net/reader033/viewer/2022051619/56649d4c5503460f94a298a0/html5/thumbnails/1.jpg)
Dynamic LeadershipProtocol for S-nets
Gregory J. Barlow, Thomas C. Henderson, Andrew L. Nelson, and Edward Grant
North Carolina State University
University of Utah
![Page 2: Dynamic Leadership Protocol for S-nets Gregory J. Barlow, Thomas C. Henderson, Andrew L. Nelson, and Edward Grant North Carolina State University University](https://reader033.vdocuments.net/reader033/viewer/2022051619/56649d4c5503460f94a298a0/html5/thumbnails/2.jpg)
Introduction
• Distributed sensing is an alternative to using large amounts of on-board sensors on mobile robots
• Smart sensor networks can be used for distributed sensing, communication, and computation
• This work presents a leadership protocol that forms clusters in a smart sensor network for distributed sensing
![Page 3: Dynamic Leadership Protocol for S-nets Gregory J. Barlow, Thomas C. Henderson, Andrew L. Nelson, and Edward Grant North Carolina State University University](https://reader033.vdocuments.net/reader033/viewer/2022051619/56649d4c5503460f94a298a0/html5/thumbnails/3.jpg)
S-nets
• S-element: a stationary agent capable of computation, communication, and sensing. S-elements have a limited communication range.
• S-net: a network of spatially distributed S-elements.
• S-cluster: a group of S-elements with one agent as the leader.
![Page 4: Dynamic Leadership Protocol for S-nets Gregory J. Barlow, Thomas C. Henderson, Andrew L. Nelson, and Edward Grant North Carolina State University University](https://reader033.vdocuments.net/reader033/viewer/2022051619/56649d4c5503460f94a298a0/html5/thumbnails/4.jpg)
Dynamic S-net Leadership Algorithm
• The DSNL algorithm is a distributed algorithm run by each S-element
• Each S-element must have a unique identification number
• Our goal is to form S-clusters with one leader for each cluster
• As S-elements are added to and removed from the S-net, clusters should update dynamically
![Page 5: Dynamic Leadership Protocol for S-nets Gregory J. Barlow, Thomas C. Henderson, Andrew L. Nelson, and Edward Grant North Carolina State University University](https://reader033.vdocuments.net/reader033/viewer/2022051619/56649d4c5503460f94a298a0/html5/thumbnails/5.jpg)
S-element State
id_num unique ID number
leader Boolean, whether node is a leader
resolved Boolean, whether node is resolved
nodelist list of all nodes in communication range
remaining list of unresolved nodes
cluster list of resolved nodes in the cluster
lastcluster list of nodes in the cluster during the
previous generation
noncluster list of resolved nodes not in the cluster
![Page 6: Dynamic Leadership Protocol for S-nets Gregory J. Barlow, Thomas C. Henderson, Andrew L. Nelson, and Edward Grant North Carolina State University University](https://reader033.vdocuments.net/reader033/viewer/2022051619/56649d4c5503460f94a298a0/html5/thumbnails/6.jpg)
DSNL Algorithm
Update lists of S-elements
Resolve the node’s leadership status
Resolve nodes in remaining
Execute task code once resolved
![Page 7: Dynamic Leadership Protocol for S-nets Gregory J. Barlow, Thomas C. Henderson, Andrew L. Nelson, and Edward Grant North Carolina State University University](https://reader033.vdocuments.net/reader033/viewer/2022051619/56649d4c5503460f94a298a0/html5/thumbnails/7.jpg)
Objectives
1. The node that has the lowest ID number of all unresolved nodes in communication range should resolve as a leader
2. Any node that is in communication range of a leader should resolve as a follower
3. Every node should be a leader or a follower
4. When a follower is removed, its leader should remove it from cluster
5. When a node’s leader is removed, that node should re-resolve
![Page 8: Dynamic Leadership Protocol for S-nets Gregory J. Barlow, Thomas C. Henderson, Andrew L. Nelson, and Edward Grant North Carolina State University University](https://reader033.vdocuments.net/reader033/viewer/2022051619/56649d4c5503460f94a298a0/html5/thumbnails/8.jpg)
S-nets implementation in simulation
![Page 9: Dynamic Leadership Protocol for S-nets Gregory J. Barlow, Thomas C. Henderson, Andrew L. Nelson, and Edward Grant North Carolina State University University](https://reader033.vdocuments.net/reader033/viewer/2022051619/56649d4c5503460f94a298a0/html5/thumbnails/9.jpg)
S-nets implementation in simulation
Time
Node
1 2 3 4
0
1 L L
4 L L F F
10 L L
12 L L FL = leader, F = follower
![Page 10: Dynamic Leadership Protocol for S-nets Gregory J. Barlow, Thomas C. Henderson, Andrew L. Nelson, and Edward Grant North Carolina State University University](https://reader033.vdocuments.net/reader033/viewer/2022051619/56649d4c5503460f94a298a0/html5/thumbnails/10.jpg)
S-net implementation using a robot colony
![Page 11: Dynamic Leadership Protocol for S-nets Gregory J. Barlow, Thomas C. Henderson, Andrew L. Nelson, and Edward Grant North Carolina State University University](https://reader033.vdocuments.net/reader033/viewer/2022051619/56649d4c5503460f94a298a0/html5/thumbnails/11.jpg)
S-nets implementation using 20 S-elements
![Page 12: Dynamic Leadership Protocol for S-nets Gregory J. Barlow, Thomas C. Henderson, Andrew L. Nelson, and Edward Grant North Carolina State University University](https://reader033.vdocuments.net/reader033/viewer/2022051619/56649d4c5503460f94a298a0/html5/thumbnails/12.jpg)
Conclusions
• We developed a leadership protocol for S-nets that allows dynamic updating of clusters
• We also developed an implementation of algorithm for embedded systems
• We successfully tested the leadership protocol in simulation and on a colony of mobile robots