A formal proof of the optimal frame setting for Dynamic-Frame Aloha with known population size

In Dynamic-Frame Aloha subsequent frame lengths must be optimally chosen to maximize throughput. When the initial population size ${\cal N}$ is known, numerical evaluations show that the maximum efficiency is achieved by setting the frame length equal to the backlog size at each subsequent frame; however, at best of our knowledge, a formal proof of this result is still missing, and is provided here. As byproduct, we also prove that the asymptotical efficiency in the optimal case is $e^{-1}$, provide upper and lower bounds for the length of the entire transmission period and show that its asymptotical behaviour is $\sim ne-\zeta \ln (n)$, with $\zeta=0.5/\ln(1-e^{-1})$.Comment: 22 pages, submitted to IEEE Trans. on Information Theor

Energy Consumption Of Visual Sensor Networks: Impact Of Spatio-Temporal Coverage

Wireless visual sensor networks (VSNs) are expected to play a major role in future IEEE 802.15.4 personal area networks (PAN) under recently-established collision-free medium access control (MAC) protocols, such as the IEEE 802.15.4e-2012 MAC. In such environments, the VSN energy consumption is affected by the number of camera sensors deployed (spatial coverage), as well as the number of captured video frames out of which each node processes and transmits data (temporal coverage). In this paper, we explore this aspect for uniformly-formed VSNs, i.e., networks comprising identical wireless visual sensor nodes connected to a collection node via a balanced cluster-tree topology, with each node producing independent identically-distributed bitstream sizes after processing the video frames captured within each network activation interval. We derive analytic results for the energy-optimal spatio-temporal coverage parameters of such VSNs under a-priori known bounds for the number of frames to process per sensor and the number of nodes to deploy within each tier of the VSN. Our results are parametric to the probability density function characterizing the bitstream size produced by each node and the energy consumption rates of the system of interest. Experimental results reveal that our analytic results are always within 7% of the energy consumption measurements for a wide range of settings. In addition, results obtained via a multimedia subsystem show that the optimal spatio-temporal settings derived by the proposed framework allow for substantial reduction of energy consumption in comparison to ad-hoc settings. As such, our analytic modeling is useful for early-stage studies of possible VSN deployments under collision-free MAC protocols prior to costly and time-consuming experiments in the field.Comment: to appear in IEEE Transactions on Circuits and Systems for Video Technology, 201

Occupancy Estimation Using Low-Cost Wi-Fi Sniffers

Real-time measurements on the occupancy status of indoor and outdoor spaces can be exploited in many scenarios (HVAC and lighting system control, building energy optimization, allocation and reservation of spaces, etc.). Traditional systems for occupancy estimation rely on environmental sensors (CO2, temperature, humidity) or video cameras. In this paper, we depart from such traditional approaches and propose a novel occupancy estimation system which is based on the capture of Wi-Fi management packets from users' devices. The system, implemented on a low-cost ESP8266 microcontroller, leverages a supervised learning model to adapt to different spaces and transmits occupancy information through the MQTT protocol to a web-based dashboard. Experimental results demonstrate the validity of the proposed solution in four different indoor university spaces.Comment: Submitted to Balkancom 201

Road-side units operators in competition: A game-theoretical approach

International audienceWe study the interactions among Internet providers in vehicular networks which offer access to commuters via road side units (RSUs). Namely, we propose a game-theoretical framework to model the competition on prices between vehicular Internet providers to capture the largest amount of users, thus selfishly maximizing the revenues. The equilibria of the aforementioned game are characterized under different mobile traffic conditions, RSU capabilities and users requirements and expectations. In particular, we also consider in the analysis the case where mobile users modify the price they accept to pay for the access as the likeliness of finding an access solution decreases. Our game-theoretical analysis gives insights on the outcomes of the competition between vehicular Internet providers, further highlighting some counter-intuitive behaviors; as an example, comparing with the case when users have constant price valuation over time, having users inclined to increasing their "acceptable" price may force vehicle Internet providers to charge lower prices due to competition

Coding local and global binary visual features extracted from video sequences

Binary local features represent an effective alternative to real-valued descriptors, leading to comparable results for many visual analysis tasks, while being characterized by significantly lower computational complexity and memory requirements. When dealing with large collections, a more compact representation based on global features is often preferred, which can be obtained from local features by means of, e.g., the Bag-of-Visual-Word (BoVW) model. Several applications, including for example visual sensor networks and mobile augmented reality, require visual features to be transmitted over a bandwidth-limited network, thus calling for coding techniques that aim at reducing the required bit budget, while attaining a target level of efficiency. In this paper we investigate a coding scheme tailored to both local and global binary features, which aims at exploiting both spatial and temporal redundancy by means of intra- and inter-frame coding. In this respect, the proposed coding scheme can be conveniently adopted to support the Analyze-Then-Compress (ATC) paradigm. That is, visual features are extracted from the acquired content, encoded at remote nodes, and finally transmitted to a central controller that performs visual analysis. This is in contrast with the traditional approach, in which visual content is acquired at a node, compressed and then sent to a central unit for further processing, according to the Compress-Then-Analyze (CTA) paradigm. In this paper we experimentally compare ATC and CTA by means of rate-efficiency curves in the context of two different visual analysis tasks: homography estimation and content-based retrieval. Our results show that the novel ATC paradigm based on the proposed coding primitives can be competitive with CTA, especially in bandwidth limited scenarios.Comment: submitted to IEEE Transactions on Image Processin

Adaptive Quality of Service Control for MQTT-SN

Internet of Things and wireless sensor networks applications are becoming more and more popular nowadays, supported by new communication technologies and protocols tailored to their specific requirements. This paper focuses on improving the performance of a Wireless Sensor Network operated by the MQTT-SN protocol, one of the most popular publish/subscribe protocols for IoT applications. In particular, we propose a dynamic Quality of Service (QoS) controller for the MQTT-SN protocol, capable of evaluating the status of the underlying network in terms of end-to-end delay and packet error rate, reacting consequently by assigning to a node the best QoS value. We design and implement the QoS controller in a simulated environment based on the ns-3 network emulator and we perform extensive experiments to prove its effectiveness compared to a non-controlled scenario. The reported results show that, by controlling the Quality of Service, it is possible to manage effectively the number of packets successfully received by each device and their average latency, to improve the quality of the communication of each end node