|
![]() |
|||
|
||||
OverviewFull Product DetailsAuthor: Sandor P. FeketePublisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K Edition: 2008 ed. Volume: 5389 Dimensions: Width: 15.50cm , Height: 0.80cm , Length: 23.50cm Weight: 0.260kg ISBN: 9783540928614ISBN 10: 3540928618 Pages: 151 Publication Date: 18 December 2008 Audience: Professional and scholarly , Professional & Vocational Format: Paperback Publisher's Status: Active Availability: In Print ![]() This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us. Table of ContentsAlgorithms for Sensor Networks: What Is It Good for?.- Tight Local Approximation Results for Max-Min Linear Programs.- Minimizing Average Flow Time in Sensor Data Gathering.- Target Counting under Minimal Sensing: Complexity and Approximations.- Efficient Scheduling of Data-Harvesting Trees.- Link Scheduling in Local Interference Models.- Algorithms for Location Estimation Based on RSSI Sampling.- Random Fault Attack against Shrinking Generator.- Probabilistic Protocols for Fair Communication in Wireless Sensor Networks.- Simple Robots in Polygonal Environments: A Hierarchy.- Deployment of Asynchronous Robotic Sensors in Unknown Orthogonal Environments.- Optimal Backlog in the Plane.ReviewsAuthor InformationTab Content 6Author Website:Countries AvailableAll regions |