Beschreibung
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.
Autorenporträt
V.Sumathy received B.E CSE in April 2002. She was awarded Honor in M.E CSE in April 2010.She is a Life Member in professional Bodies like ISTE. She is working as Asst. Professor in the Department of CSE in Kingston Engineering College, Vellore-Tamil Nadu.She has published papers in International Journals & her research includes network security.
