26,99 €
inkl. MwSt.
Versandkostenfrei*
Versandfertig in über 4 Wochen
  • Broschiertes Buch

A routing strategy based on minimum spanning tree of the nodes is proposed. Through simulation the results are proved to be nearby 2x better than corresponding homogeneous one. This scheme helps to determine required energy of nodes in a network as well as to increase stable life time of the network since all nodes are alive at this moment. The nodes remain static after deployment. As a future work one can think of about automatic placement of nodes which can incorporate mobility as well.

Produktbeschreibung
A routing strategy based on minimum spanning tree of the nodes is proposed. Through simulation the results are proved to be nearby 2x better than corresponding homogeneous one. This scheme helps to determine required energy of nodes in a network as well as to increase stable life time of the network since all nodes are alive at this moment. The nodes remain static after deployment. As a future work one can think of about automatic placement of nodes which can incorporate mobility as well.
Autorenporträt
L'autore lavora come professore associato presso il Dipartimento di Informatica e Ingegneria dell'Università di Chandigarh, Punjab (India). I suoi campi di interesse sono la progettazione algoritmica, le strutture dati e le reti di sensori wireless.