Zbog tehničkih razloga telefonska podrška danas neće biti dostupna, molimo kontaktirajte nas putem e-maila.

Provjerite status narudžbe

Pridružite se zajednici ljubitelja knjige iz cijelog svijeta i ostvarite mnoštvo pogodnosti. Izradite besplatni račun

Besplatna dostava Overseas kurirskom službom iznad 69.99 €

DPD kurir 3.99 € DPD točka 3.49 € GLS Kurir 4.99 € GLS paketomat 3.99 € Hrvatska pošta 4.99 € Dostava Overseas 4.99 € Box Now 4.49 €

Kontakt

Kako kupovati

Pomoć

Moj račun

▸ Prazno :-(

Zbog tehničkih razloga telefonska podrška danas neće biti dostupna, molimo kontaktirajte nas putem e-maila.

Efficient Query Processing for Opportunistic Sensor Networks

Name: Efficient Query Processing for Opportunistic Sensor Networks
Brand: LAP Lambert Academic Publishing
SKU: 07177808
Price: 35.49 EUR
Availability: InStock
Author: Mehul Shah
ISBN: 9783659592737

Mehul Shah

Jignesh Rathod

Jezik

Engleski

Knjiga Meki uvez

Libristo kod: 07177808

Nakladnici LAP Lambert Academic Publishing, rujan 2014

Opportunistic sensor networks are formed by sensors embedded in hand held devices like cell phones.... Cijeli opis

Libristo kod: 07177808

86 b

35.49 €

Vanjske zalihe Šaljemo za 8-11 dana

Do 30 dana za povrat

Kupci su kupili i

Povídky z jedné kapsy Karel Čapek

Tvrdi uvez

8.74 €

SWING 01 SEJIC

Tvrdi uvez

18.79 €

Musical Instruments from Around the World (Brazilian Portuguese-English) Emily Kobren

Meki uvez

17.29 €

Léčba pooperační bolesti Jiří Málek

Tvrdi uvez

11.86 €

Görlitz - Fimstadt mit Charme (Wandkalender 2026 DIN A4 quer), CALVENDO Monatskalender Calvendo

Kalendar

19.50 €

300 najważniejszych pozycji szachowych Thomas Engqvist

Meki uvez

12.16 €

Atlas praktycznej kapilaroskopii w reumatologii. Atlas of practical capillaroscopy in rheumatology Sławomir Jeka

Tvrdi uvez

31.77 €

As cores de Alemete V. Cobe

Meki uvez

13.06 €

Zufall und Schicksal in filmischen Erzahlungen von Julio Medem Christiane Hagn

Meki uvez

42.52 €

Acostumbrada a un cielo extraûo XU XI

Meki uvez

18.49 €

TWELVE SPANISH SONGS CHANT JOAQUIN RODRIGO Tiskanica

Note

13.87 €

Vivre dans le coeur - Comment entrer dans l'espace sacré du coeur Melchizedek

Meki uvez

22.11 €

Dans les nuages

Meki uvez

6.53 €

Poemata Didascalica, Nunc Primum Vel Edita, Vel Collecta Pierre-Joseph Thoulier Olivet

Meki uvez

25.03 €

Alimentaci Maribel Ortells

Meki uvez

14.97 €

DIAN Alessandra De Cristofaro

Meki uvez

12.36 €

Parasitfri Lena Holfve

Meki uvez

10.95 €

Darth vader Gillen

Knjiga

4.41 €

Edouard Manet - Weiblicher Akt - 1.000 Teile (Puzzle)

Igra

29.35 €

Introduction A La Statistique Medicale Des Hopitaux de Lyon MAYET-F-O

Meki uvez

13.56 €

Himmel und Erde Wilhelm Meyer

Meki uvez

35.49 €

Encyclopedie d'Hygiene Et de Medecine Publique. Tome 2, Hygiene Generale, Hygiene Alimentaire Sans Auteur

Meki uvez

45.74 €

Industria del entretenimiento Valdes Cervantes Juan Carlos

Meki uvez

34.68 €

Dig, Dag und Ritter Runkel - Auf der Spur von Digedag Hannes Hegen

Tvrdi uvez

15.17 €

Opportunistic sensor networks are formed by sensors embedded in hand held devices like cell phones. Opportunistic networks are a type of intermittently connected network where there is intermittent connection between Sensor Access points (SAP) such as Wi-Fi hotspots and cell phones. An end user injects query in to the network specifying certain sensing modality of a particular location. These queries are tasked by SAP to the cell phones. Mobility of cell phones generates opportunities to resolving these queries. Selection of scheduling algorithm at SAP decides rate of query completion. This book presents a novel human mobility based efficient query processing algorithm for opportunistic sensor networks. Characteristics of human mobility are leveraged to achieve this. Performance evaluation of the presented algorithm is compared with existing one. A discrete time simulation of the query processing algorithm is done using MATLAB software. Simulation results indicates superiority of the proposed human mobility based scheduling algorithm compared to mobility based shortest job first scheduling algorithm. MATLAB code of the simulation is also presented in appendix of the text.