A distributed implementation of RAND, a randomized time slot scheduling algorithm, called DRAND. This algorithm is suitable for a wireless network where most nodes do not move, such as wireless sensor networks. A Distributed RAND algorithm is implemented and demonstrate its performance in a sensor nodes. Further evaluating the effect of the time varying nature of wireless links on the conflict free property of DRAND assigned time slots is done.
|Number of Pages||68|
|Book Type||Computing & information technology|
|Country of Manufacture||India|
|Product Brand||LAP LAMBERT Academic Publishing|
|Product Packaging Info||Box|
|In The Box||1 Piece|
|Product First Available On ClickOnCare.com||2015-07-08 00:00:00|