Name: Relay Nodes in Big-Data Wireless Sensor Networks (en Inglés)
SKU: 62830944
Price: 66.76 USD
Availability: InStock
Author: Chandra Shekar Kemedi

portada Relay Nodes in Big-Data Wireless Sensor Networks (en Inglés)

Relay Nodes in Big-Data Wireless Sensor Networks (en Inglés)

Formato

Libro Físico

Editorial

Grin Verlag

Autor

Chandra Shekar Kemedi

Idioma

Inglés

N° páginas

Encuadernación

Tapa Blanda

ISBN13

9783656845003

Relay Nodes in Big-Data Wireless Sensor Networks (en Inglés)

Chandra Shekar Kemedi (Autor) · Grin Verlag · Tapa Blanda

Libro Nuevo Importado

Envío: 25 a 32 días háb.

$ 121.38$ 66.76

-45%

Costos de importación incluídos en el precio ✅

Libro Nuevo

Quedan 10 unidades

$ 66.76

Llega entre el 28 Sep y el 12 Oct a Quito, Pichincha. Seleccionar ubicación

Agregar a lista de deseos

Reseña del libro "Relay Nodes in Big-Data Wireless Sensor Networks (en Inglés)"

Scientific Essay from the year 2014 in the subject Computer Science - Programming, grade: A, Jawaharlal Nehru University (Guru Nanak college of institutions and technology), course: CSE, language: English, abstract: Wireless Sensor Networks (WSNs) are increasingly used in data-intensive applications such as micro-climate monitoring, precision agriculture, and audio/video surveillance. A key challenge faced by data-intensive WSNs is to transmit all the data generated within an application's lifetime to the base station despite the fact that sensor nodes have limited power supplies. We propose using low-cost disposable mobile relays to reduce the energy consumption of data-intensive WSNs. Our approach differs from previous work in two main aspects. First, it does not require complex motion planning of mobile nodes, so it can be implemented on a number of low-cost mobile sensor platforms. Second, we integrate the energy consumption due to both mobility and wireless transmissions into a holistic optimization framework. We present efficient distributed implementations for each algorithm that require only limited, localized synchronization. Because we do not necessarily compute an optimal topology, our final routing tree is not necessarily optimal. However, our simulation results show that our algorithms significantly outperform the best existing solutions.