Exploration data aggregation distributed de nandy indranil (9 resultados)
- Tapa blanda
Librería: Books Puddle, New York, NY, Estados Unidos de AmericaBooks Puddle
Contactar con el vendedorVendedor de 4 estrellasCondición: Nuevo
EUR 93,96
Envío por EUR 3,50Se envía dentro de Estados Unidos de AmericaCantidad disponible: 4 disponibles
Condición: New. pp. 156.
- Más imágenes
- Tapa blanda
Librería: moluna, Greven, Alemaniamoluna
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 48,50
Envío por EUR 48,99Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: Más de 20 disponibles
Condición: New.
- Más imágenes
- Tapa blanda
Librería: preigu, Osnabrück, Alemaniapreigu
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 51,10
Envío por EUR 70,00Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 5 disponibles
Taschenbuch. Condición: Neu. Exploration and Data Aggregation in Distributed Sensor Networks | - A Geometric Approach | Indranil Nandy | Taschenbuch | 156 S. | Englisch | 2011 | LAP LAMBERT Academic Publishing | EAN 9783846554456 | Verantwortliche Person für die EU: BoD - Books on Demand, In de Tarpen 42, 22848 Norderstedt, info…[at]bod[dot]de | Anbieter: preigu.
- Tapa blanda
Librería: Mispah books, Redhill, SURRE, Reino UnidoMispah books
Contactar con el vendedorVendedor de 4 estrellasCondición: Usado - Como Nuevo
EUR 139,42
Envío por EUR 29,17Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: 1 disponibles
Paperback. Condición: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
- Más imágenes
- Tapa blanda
- Impresión bajo demanda
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, AlemaniaBuchWeltWeit Ludwig Meier e.K.
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 59,00
Envío por EUR 23,00Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 2 disponibles
Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Coverage is an important issue in WSN. The problem is to ensure full coverage of a region whose geometrical details are not available. A set of mobile sensors is to be deployed in the unexplored region to form a mobile sensor networ…k. In the first part, our work is on the field of Exploration in sensor networks. We have proposed an incremental algorithm to explore the region. First a general algorithm is given for a completely unknown region. Next with a little modification it is applied to the case of partially known region. Later we have discussed about some more special cases and related algorithms. In the second part, we have worked on another important field of sensor networks - Data Aggregation. Here we have discussed about the k-selection algorithm. Given a general connected network of diameter D, consisting of n nodes, each node containing m number of numeric elements, we are to find the kth smallest element among the elements across the network. In our work, there is no imposed assumption or constraint on the magnitude of the elements or the size of the network or the range of element-values. We have proposed a deterministic algorithm with much improved complexity. 156 pp. Englisch.
- Tapa blanda
- Impresión bajo demanda
Librería: Majestic Books, Hounslow, Reino UnidoMajestic Books
Contactar con el vendedorVendedor de 4 estrellasCondición: Nuevo
EUR 94,98
Envío por EUR 7,58Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: 4 disponibles
Condición: New. Print on Demand pp. 156 2:B&W 6 x 9 in or 229 x 152 mm Perfect Bound on Creme w/Gloss Lam.
- Tapa blanda
- Impresión bajo demanda
Librería: Biblios, frankfurt am main, HESSE, AlemaniaBiblios
Contactar con el vendedorVendedor de 4 estrellasCondición: Nuevo
EUR 96,02
Envío por EUR 9,95Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 4 disponibles
Condición: New. PRINT ON DEMAND pp. 156.
- Más imágenes
- Tapa blanda
- Impresión bajo demanda
Librería: AHA-BUCH GmbH, Einbeck, AlemaniaAHA-BUCH GmbH
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 59,00
Envío por EUR 61,25Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 1 disponibles
Taschenbuch. Condición: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Coverage is an important issue in WSN. The problem is to ensure full coverage of a region whose geometrical details are not available. A set of mobile sensors is to be deployed in the unexplored region to form a mobile sensor network. In… the first part, our work is on the field of Exploration in sensor networks. We have proposed an incremental algorithm to explore the region. First a general algorithm is given for a completely unknown region. Next with a little modification it is applied to the case of partially known region. Later we have discussed about some more special cases and related algorithms. In the second part, we have worked on another important field of sensor networks - Data Aggregation. Here we have discussed about the k-selection algorithm. Given a general connected network of diameter D, consisting of n nodes, each node containing m number of numeric elements, we are to find the kth smallest element among the elements across the network. In our work, there is no imposed assumption or constraint on the magnitude of the elements or the size of the network or the range of element-values. We have proposed a deterministic algorithm with much improved complexity.
- Más imágenes
- Tapa blanda
- Impresión bajo demanda
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemaniabuchversandmimpf2000
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 59,00
Envío por EUR 60,00Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 1 disponibles
Taschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Coverage is an important issue in WSN. The problem is to ensure full coverage of a region whose geometrical details are not available. A set of mobile sensors is to be deployed in the unexplored region to form a mobile sensor network. I…n the first part, our work is on the field of Exploration in sensor networks. We have proposed an incremental algorithm to explore the region. First a general algorithm is given for a completely unknown region. Next with a little modification it is applied to the case of partially known region. Later we have discussed about some more special cases and related algorithms. In the second part, we have worked on another important field of sensor networks - Data Aggregation. Here we have discussed about the k-selection algorithm. Given a general connected network of diameter D, consisting of n nodes, each node containing m number of numeric elements, we are to find the kth smallest element among the elements across the network. In our work, there is no imposed assumption or constraint on the magnitude of the elements or the size of the network or the range of element-values. We have proposed a deterministic algorithm with much improved complexity.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 156 pp. Englisch.
