Algorithmic Aspects of Wireless Sensor Networks: Fourth by Sandor P. Fekete

By Sandor P. Fekete

This publication constitutes the reviewed complaints of the Fourth overseas Workshop on Algorithmic features of instant Sensor Networks, ALGOSENSORS 2008, held in Reykjavik, Iceland, Wroclaw, Poland, July 12, 2008. The workshops aimed toward bringing jointly study contributions regarding diversified algorithmic and complexity-theoretic facets of instant sensor networks. the subjects comprise yet aren't restricted to optimization difficulties, noise and likelihood, robots and excursions.

Show description

Read or Download Algorithmic Aspects of Wireless Sensor Networks: Fourth International Workshop, Algosensors 2008, Reykjavik, Iceland, July 2008. Revised Selected Pape ... Computer Science Computer Communication N) PDF

Similar computers books

Oracle Enterprise Manager. Messages Manual

This handbook presents possible explanations and urged activities for blunders messages generated through Oracle company supervisor and its parts, together with the non-compulsory administration packs.

Lectures on Concurrency and Petri Nets: Advances in Petri Nets

This instructional quantity originates from the 4th complicated path on Petri Nets, ACPN 2003, held in Eichst? tt, Germany in September 2003. as well as lectures given at ACPN 2003, extra chapters were commissioned to offer a well-balanced presentation of the cutting-edge within the region. This e-book may be valuable as either a reference for these operating within the quarter in addition to a research publication for the reader who's drawn to an updated evaluate of study and improvement in concurrent and allotted structures; after all, readers particularly attracted to theoretical or applicational facets of Petri nets will have fun with the ebook besides.

Languages and Compilers for High Performance Computing: 17th International Workshop, LCPC 2004, West Lafayette, IN, USA, September 22-24, 2004, Revised ... Computer Science and General Issues)

This publication constitutes the completely refereed post-proceedings of the seventeenth foreign Workshop on Languages and Compilers for top functionality Computing, LCPC 2004, held in West Lafayette, IN, united states in September 2004. The 33 revised complete papers awarded have been rigorously chosen in the course of rounds of reviewing and development.

Additional resources for Algorithmic Aspects of Wireless Sensor Networks: Fourth International Workshop, Algosensors 2008, Reykjavik, Iceland, July 2008. Revised Selected Pape ... Computer Science Computer Communication N)

Example text

22] add to the basic binary sensing model by considering mobile binary sensors and show that even then the problem is hard. Counting targets is also addressed in [23], the sensors considered are proximity sensors and sense the amplitude only. The target counting is then represented as peak counting problem in the aggregate sensor network, but the framework assumes that the targets are well separated. In [24], the authors look at the problem of counting the number of people in a crowd using image sensors.

Theorem 2. Let ∈ (0, 1). Unless P=NP, no polynomial time algorithm can approximate F-Wgp within a ratio better than Ω(m1− ). Proof. 2 in [6]. As shown in [6], it is possible to construct in polynomial time, given an IBM instance I, an instance I of Wgp with an arbitrary number m of packets such that the following hold: 1. if I has an induced matching of size k, then there is a schedule for I with maximum flow time 2k + 1; 2. if all induced matchings of I are of size at most k/α, then in every schedule for I there will be a round in which Θ(m/k) packets have been released but not yet collected at the sink.

Proof. Notice that the analysis of the above theorem also yields that Cj∗ , Cj ≤ j∈J j∈J where Cj is the completion time of packet j in the schedule generated by 5ISRPT. We can now simulate the schedule generated by 5-ISRPT by running it at a lower speed: whatever 5-ISRPT does at time t, a unit-speed algorithm can do at time 5t. The schedule can be constructed online and clearly it respects the release dates. If Cj is the completion time of packet j in the new schedule, we obtain Cj = 5 · Cj ≤ 5 Cj∗ .

Download PDF sample

Rated 4.54 of 5 – based on 29 votes