Silvija Kokalj-Filipovic

Learn More
—This paper studies source location anonymity in a large monitoring wireless sensor network with a single data collector, and under a global attack. The qualifier " global " indicates the capability of the eavesdropper (attacker) to capture all network transmissions, and to discern their time and location. We propose a scheme for generating fake network(More)
The number of doped packets can be surprisingly small when employed with an Ideal Soliton code degree distribution and, hence, the doping strategy may have the least collection delay when the density of source nodes is sufficiently large. Furthermore , we demonstrate that network coding makes dissemination more efficient at the expense of a larger(More)
—This paper studies decentralized strategies for facilitating data collection in circular wireless sensor networks, which rely on the stochastic diversity of data storage. The goal is to allow for a reduced delay collection by a mobile data collector (MDC) who accesses the network at a random position and random time. We consider a two-phase data(More)
— We describe three in-field data collection efforts yielding a large database of RSSI values vs. time or distance from vehicles communicating with each other via DSRC. We show several data processing schemes we have devised to develop Vehicle-to-Vehicle (V2V) propagation models from such data. The database is limited in several important ways, not least,(More)
—We propose a method for estimating channel parameters from RSSI measurements and the lost packet count, which can work in the presence of losses due to both interference and signal attenuation below the noise floor. This is especially important in the wireless networks, such as vehicular, where propagation model changes with the density of nodes. The(More)
— For wireless sensor networks with many location-unaware nodes, we investigate a protocol, dubbed BeSpoken, that steers data transmissions along a straight path called a spoke. The protocol directs data transmissions by randomly selecting relays to retransmit data packets from crescent-shaped areas along the spoke axis. The packet retransmission by the(More)
—For wireless sensor networks with many location-unaware nodes, which can be modeled as a planar Poisson point process, we investigate a protocol, dubbed BeSpoken, which steers data transmissions along a straight path called a spoke. BeSpoken implements a simple, spatially recursive process, where a basic set of control packets and a data packet are(More)
—Based on the erasure channel FEC model as defined in multimedia wireless broadcast standards, we illustrate how doping mechanisms included in the design of erasure coding and decoding may improve the scalability of the packet throughput, decrease overall latency and potentially differentiate among classes of multimedia subscribers regardless of their(More)