Red list and checklist of the planthoppers and leafhoppers

Erstmalig wird für das Land Berlin eine Rote Liste der Zikaden vorgelegt, außerdem eine aktualisierte Gesamtartenliste. Von insgesamt 337 Arten gelten demnach 39 Arten als verschollen, 25 als vom Aussterben bedroht (Kategorie 1), 5 als stark gefährdet (Kategorie 2) und 15 als gefährdet (Kategorie 3). 20 Arten gelten als gefährdet mit unbekannten Ausmaß (Kategorie G), 14 Arten als extrem selten (Kategorie R), 12 Arten wurden auf die Vorwarnliste gesetzt (Kategorie V) und für 14 Arten wurde der Befund „Daten defizitär“ gestellt (Kategorie D). Für drei Arten wurde eine besondere Verantwortlichkeit Berlins festgestellt, die Schmuckseggenzirpe (Cicadula ornata), die Braune Kragenzirpe (Anoplotettix fuscovenosus) und die Dünenzirpe (Pinumius areatus). Die beiden erstgenannten kommen deutschlandweit nur in Berlin vor, die letztere weist hier Schwerpunktvorkommen auf.We present, for the first time, a Red List of the planthoppers and leafhoppers of the federal state of Berlin, as well as an updated checklist. Altogether 337 species have been recorded so far, 39 of them are considered as regionally extinct (category 0), 25 as critically endangered (category 1), 5 as endangered (category 2), 15 as vulnerable (category 3), 20 as indeterminate (category G), 14 rare (category R), 12 near-threatened (category V). The data base is deficient (category D) for 14 further species. Berlin is assigned a particular responsibility for conservation of Cicadula ornata, Anoplotettix fuscovenosus and Pinumius areatus. The first two species are in Germany so far only known from Berlin. For the latter species most recent German records are from Berlin

Using OLSR Multipoint Relays (MPRs) to estimate node positions in a Wireless Mesh Network

In this paper we address in this paper the problem of nodes localization in wireless heterogeneous networks, focussing particularly on selection methods to estimate position. The OLSR routing protocol uses special nodes called Multipoint Relay (MPR) nodes to broadcast control messages within the network. We propose a novel approach based on using these Multipoint Relay (MPR) nodes as anchor nodes to estimate nodes positions. We evaluate its performance by simulation and compare it to other selection techniques such as convex hull selection and greedy selection

An Efficient Simulation Model for Wireless LANs Applied to the IEEE 802.11 Standard

In this research report, we propose a simple simulation model for wireless LANs. In wireless LANs, contrary to LANs different transmission results can be observed by network nodes. This phenomenon is the result of radio propagation laws where the signal decay is by far more important than on cables. This leads to new and interesting modelization and simulation problems. In this article we propose a simple but general physical model to take into account radio propagation. We then apply this model to the study of the IEEE 802.11 standard. We show how IEEE 802.11 can be efficiently modeled and simulated. This allows us to offer a detailed study of the standard. We will give performance evaluations of the IEEE 802.11 DS standard with transmisson rate 1, 2, 5.5 or 11 Mbit/s which take into account the exact protocol overhead. We also study special behaviour as broadcast transmission, performance with hidden nodes, spatial reuse

Geometric Bucket Trees: Analysis of Linear Bucket Tree

International audienceWe analyse the average number of buckets in a Linear Bucket tree created by $n$ points uniformly dispatched on an interval of length $y$. A new bucket is created when a point does not fall in an existing bucket. The bucket is the interval of length 2 centered on the point. We illustrate this concept by an interesting tale of how the moon's surface took on its present form. Thanks to an explicit Laplace transform of the Poissonized sequence, and the use of dePoissonization tools, we obtain the explicit asymptotic expansions of the average number of buckets in most of the asymptotic regimes relative to $n$ and $y$

Stack Algorithms in Implicit Framing, Free Access and Blocked Access for CATV Networks

In this paper we present in the framework of access protocols for Cable TV (CATV) networks performant and easy implementation of stack algorithms with an implicit framing scheme. We use a stack algorithm with a single interleaved process in a free or blocked access mode. We show that the blocked access can be implemented to have a deterministic behaviour. We show that a dynamic tuning of the access persistence parameter $R$ improves the performance both in terms of throughput and delays

Vehicular Ad-hoc Networks: Point-to-Point, Emergency and Broadcast Communications

International audienceThe aim of this paper is to analyze the Aloha medium access (MAC) scheme in one-dimensional, linear networks, which might be an appropriate assumption for Vehicular Ad-hoc NETworks (VANETs). The locations of the vehicles are assumed to follow a homegeneous Poisson point process. Assuming powerlaw mean path-loss and independent point-to-point fading we study performance metrics based on the signal-over-interference and noise ratio (SINR). In contrast to previous studies where the receivers are at a fixed distance from the transmitter, we assume here that the receivers are the nearest neighbors of the transmitters in the Poisson process and in a given direction. We derive closed formulas for the capture probability and for the density of progress of a packet sent by a given node. We compute the mean delay to send a packet transmitted at each slot until successful reception. We also evaluate an upper bound to discover the neighborhood within a given space interval. We show that we can include noise in the previous models

Active Signaling for 802.11 Networks in the ns-3 Simulator

International audienceIn wireless networks, wireless channels are often shared between multiple nodes, which may interfere when they transmit simultaneously. The media access control (MAC) scheme coordinates channel access between the different nodes. In this article, we focus one specific method of channel access, Elimination-Yield Non-Preemptive Priority Multiple Access, EY- NPMA, which is part of the European standard wireless HIPERLAN. EY-NPMA is a wireless MAC method that partly relies on "active signaling": i.e. transmitting (activity) to simply signal a node's presence (with pseudo-noise), rather than transmitting data (bits). In this article, we study the adaptation of EY-NPMA named Ey-Wifi as an extension of the 802.11-based standards. Our main focus is the implementation of a such an extension in a module of the network simulator, ns-3, with the emphasis on the software architecture

Detailed specifications of a security architecture for OLSR

In Mobile Ad Hoc Networks (MANETs), mobile nodes use wireless devices to create spontaneously a larger network, larger than the one hop radio range, in which communication with each other is made possible by the means of routing. The goal of this document is the study of security issue related to integrity of an ad hoc network. We only consider ad hoc networks using the OLSR routing protocol. In a previous research report we have carried out a theoretical analysis of this issue. In this document we aim at precising a detailed security using the OLSR routing protocol. We also validate this This security architecture at the CELAR

Performant Implementations of Tree Collision Resolution Algorithms for CATV Networks

In this paper, we analyze optimizations and adptations of the stack (tree) algorithm needed to use it as access scheme for a CATV channel access. In CATV network, we have large round trip delays, therefore it is possible have simultaneous tree collision resolution process. One approach is to handle many independant collision resolution process, another is to interleave all the collision resolution process. We give a detailed analysis of the two schemes concerning average and distribution of access delays. We show that the interleaving technique is both more simple and more efficient. This leads us to define a CATV channel access technique with interleaved collision resolution process on which we had a mechanism to offer reservation for successive slots. We a give a detailed implementation of this protocol as a thorough performance analysis. We deeply investigate the effect on throughput and delays of the end to end propagation delay and of the number of active stations