Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks. ACM Wireless Networks Journal, 2002 BENJIE CHEN, KYLE JAMIESON, HARI BALAKRISHNAN and ROBERT MORRIS. Outline. Introduction Related works Span design Simulation Conclusion. Introduction.
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks
ACM Wireless Networks Journal, 2002
BENJIE CHEN, KYLE JAMIESON, HARI BALAKRISHNAN and ROBERT MORRIS
A connected dominating set
Without 5 being coordinator, 3->4 contend for bandwidth with 1->2
HELLO: <Id>,<isCoordinator>,<list of coordinators>,<list of neighbors>,<timeStamp>
<27>,< True >,<8,12>,<10,34>,<12001>
Number of neighbors
Round trip time
number of additional pairs of nodes among these neighbors that would be connected if i were to become a coordinator
R uniformly at random from the interval (0, 1]
128 bytes packets CBR flow
Only 100 node participate in Span
Motion follows random waypoint model