menu
{ "item_title" : "Algorithms for Sensor Systems", "item_author" : [" Seth Gilbert", "Danny Hughes", "Bhaskar Krishnamachari "], "item_description" : "Local Gossip and Neighbour Discovery in Mobile Ad Hoc Radio Networks.- Competitive Routing in Hybrid Communication Networks.- On the Approximability and Hardness of the Minimum Connected Dominating Set with Routing Cost Constraint.- On the Maximum Connectivity Improvement problem.- Average Case - Worst Case Tradeoffs for Evacuating 2 Robots from the Disk in the Face-to-Face Model.- Mutual Visibility by Asynchronous Robots on Infinite Grid.- Optimal Gathering by Asynchronous Oblivious Robots in Hypercubes.- Barrier Coverage Problem in 2D.- Time- and Energy-aware Task Scheduling in Environmentally-powered Sensor Networks.- Mobility-Aware, Adaptive Algorithms for Wireless Power Transfer in Ad Hoc Networks.- Distributed leader election and computation of local identifiers for programmable matter.- Reaching Consensus in Ad-Hoc Diffusion Networks.- Filling Arbitrary Connected Areas by Silent Robots with Minimum Visibility Range.- BSLoc: Base Station ID-based Telco Outdoor Localization.- Orientation Estimation using Filter-Based Inertial Data Fusion for Posture Recognition.", "item_img_path" : "https://covers4.booksamillion.com/covers/bam/3/03/014/093/3030140938_b.jpg", "price_data" : { "retail_price" : "54.99", "online_price" : "54.99", "our_price" : "54.99", "club_price" : "54.99", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }
Algorithms for Sensor Systems|Seth Gilbert

Algorithms for Sensor Systems : 14th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, Algosensors 2018, Helsinki, Fi

local_shippingShip to Me
In Stock.
FREE Shipping for Club Members help

Overview

Local Gossip and Neighbour Discovery in Mobile Ad Hoc Radio Networks.- Competitive Routing in Hybrid Communication Networks.- On the Approximability and Hardness of the Minimum Connected Dominating Set with Routing Cost Constraint.- On the Maximum Connectivity Improvement problem.- Average Case - Worst Case Tradeoffs for Evacuating 2 Robots from the Disk in the Face-to-Face Model.- Mutual Visibility by Asynchronous Robots on Infinite Grid.- Optimal Gathering by Asynchronous Oblivious Robots in Hypercubes.- Barrier Coverage Problem in 2D.- Time- and Energy-aware Task Scheduling in Environmentally-powered Sensor Networks.- Mobility-Aware, Adaptive Algorithms for Wireless Power Transfer in Ad Hoc Networks.- Distributed leader election and computation of local identifiers for programmable matter.- Reaching Consensus in Ad-Hoc Diffusion Networks.- Filling Arbitrary Connected Areas by Silent Robots with Minimum Visibility Range.- BSLoc: Base Station ID-based Telco Outdoor Localization.- Orientation Estimation using Filter-Based Inertial Data Fusion for Posture Recognition.

This item is Non-Returnable

Details

  • ISBN-13: 9783030140939
  • ISBN-10: 3030140938
  • Publisher: Springer
  • Publish Date: February 2019
  • Dimensions: 9.21 x 6.14 x 0.52 inches
  • Shipping Weight: 0.78 pounds
  • Page Count: 235

Related Categories

You May Also Like...

    1

BAM Customer Reviews