Wireless sensor networks have been envisioned to be useful in many government forces and civilian applications like for habitat monitoring and target tracking in air force, battlefield surveillance and so on.The problem of least-latency end-to-end multicast routing over adaptively duty-cycled wireless sensor networks when considered. Such networks exhibit a time-dependent feature, where the link cost and transmission latency from one node to other nodes vary constantly in different discrete time moments. It presents distributed algorithm for finding the time-dependent shortest paths to the sink node for all nodes. It presents distributed shortest path maintenance algorithms with low message complexity and space complexity. It proposes suboptimal implementation by using vector compression mechanism.
"Sinopsis" puede pertenecer a otra edición de este libro.
Wireless sensor networks have been envisioned to be useful in many government forces and civilian applications like for habitat monitoring and target tracking in air force, battlefield surveillance and so on.The problem of least-latency end-to-end multicast routing over adaptively duty-cycled wireless sensor networks when considered. Such networks exhibit a time-dependent feature, where the link cost and transmission latency from one node to other nodes vary constantly in different discrete time moments. It presents distributed algorithm for finding the time-dependent shortest paths to the sink node for all nodes. It presents distributed shortest path maintenance algorithms with low message complexity and space complexity. It proposes suboptimal implementation by using vector compression mechanism.
"Sobre este título" puede pertenecer a otra edición de este libro.
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Wireless sensor networks have been envisioned to be useful in many government forces and civilian applications like for habitat monitoring and target tracking in air force, battlefield surveillance and so on.The problem of least-latency end-to-end multicast routing over adaptively duty-cycled wireless sensor networks when considered. Such networks exhibit a time-dependent feature, where the link cost and transmission latency from one node to other nodes vary constantly in different discrete time moments. It presents distributed algorithm for finding the time-dependent shortest paths to the sink node for all nodes. It presents distributed shortest path maintenance algorithms with low message complexity and space complexity. It proposes suboptimal implementation by using vector compression mechanism. 52 pp. Englisch. Nº de ref. del artículo: 9783659748332
Cantidad disponible: 2 disponibles
Librería: moluna, Greven, Alemania
Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Pradhan PradhnyaPradhnya S. Pradhan, M.E.: Wireless Communication and Computing, Assistant Professor at St. Francis Institute of Technology (Engineering College), Mumbai.Wireless sensor networks have been envisioned to be useful . Nº de ref. del artículo: 158224338
Cantidad disponible: Más de 20 disponibles
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
Taschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Wireless sensor networks have been envisioned to be useful in many government forces and civilian applications like for habitat monitoring and target tracking in air force, battlefield surveillance and so on.The problem of least-latency end-to-end multicast routing over adaptively duty-cycled wireless sensor networks when considered. Such networks exhibit a time-dependent feature, where the link cost and transmission latency from one node to other nodes vary constantly in different discrete time moments. It presents distributed algorithm for finding the time-dependent shortest paths to the sink node for all nodes. It presents distributed shortest path maintenance algorithms with low message complexity and space complexity. It proposes suboptimal implementation by using vector compression mechanism.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 52 pp. Englisch. Nº de ref. del artículo: 9783659748332
Cantidad disponible: 1 disponibles
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Taschenbuch. Condición: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Wireless sensor networks have been envisioned to be useful in many government forces and civilian applications like for habitat monitoring and target tracking in air force, battlefield surveillance and so on.The problem of least-latency end-to-end multicast routing over adaptively duty-cycled wireless sensor networks when considered. Such networks exhibit a time-dependent feature, where the link cost and transmission latency from one node to other nodes vary constantly in different discrete time moments. It presents distributed algorithm for finding the time-dependent shortest paths to the sink node for all nodes. It presents distributed shortest path maintenance algorithms with low message complexity and space complexity. It proposes suboptimal implementation by using vector compression mechanism. Nº de ref. del artículo: 9783659748332
Cantidad disponible: 1 disponibles
Librería: preigu, Osnabrück, Alemania
Taschenbuch. Condición: Neu. Designing Multicast Wireless Sensor Network | Pradhnya Pradhan (u. a.) | Taschenbuch | 52 S. | Englisch | 2015 | LAP LAMBERT Academic Publishing | EAN 9783659748332 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu. Nº de ref. del artículo: 104349553
Cantidad disponible: 5 disponibles