Search results for "wireless LAN"
showing 10 items of 38 documents
Error-Based Interference Detection in WiFi Networks
2017
In this paper we show that inter-technology interference can be recognized by commodity WiFi devices by monitoring the statistics of receiver errors. Indeed, while for WiFi standard frames the error probability varies during the frame reception in different frame fields (PHY, MAC headers, payloads) protected with heterogeneous coding, errors may appear randomly at any point during the time the demodulator is trying to receive an exogenous interfering signal. We thus detect and identify cross-technology interference on off-the-shelf WiFi cards by monitoring the sequence of receiver errors (bad PLCP, bad PCS, invalid headers, etc.) and develop an Artificial Neural Network (ANN) to recognize t…
Wireless MAC processors: programming MAC protocols on commodity hardware
2012
Programmable wireless platforms aim at responding to the quest for wireless access flexibility and adaptability. This paper introduces the notion of wireless MAC processors. Instead of implementing a specific MAC protocol stack, Wireless MAC processors do support a set of Medium Access Control “commands” which can be run-time composed (programmed) through software-defined state machines, thus providing the desired MAC protocol operation. We clearly distinguish from related work in this area as, unlike other works which rely on dedicated DSPs or programmable hardware platforms, we experimentally prove the feasibility of the wireless MAC processor concept over ultra-cheap commodity WLAN hardw…
An Improved Detection Technique for Cyclic-Prefixed OFDM
2010
A novel Orthogonal Frequency Division Multiplexing detection technique compatible to standard (e.g. Wireless LAN) transmitters is proposed. It features enhanced error-rate performance with flexible computational complexity and robustness to imperfect channel estimation. It is based on exploitation of the redundancy available in the cyclic prefix after cancellation of interference from the preceding block. In order to show the effectiveness of our proposal, an analysis of computational complexity and a number of comparisons to the standard per-subcarrier receiver and a previously existing method in terms of error rates are reported.
Refinements on IEEE 802.11 Distributed Coordination Function Modeling Approaches
2010
With the popularity of the IEEE 802.11 standards, many analytical saturation throughput studies for the distributed coordination function (DCF) have been reported. In this paper, we outline a number of issues and criticalities raised by previously proposed models. In particular, a careful look at backoff counter decrement rules allows us to conclude that, under saturation conditions, the slot immediately following a successful transmission can be accessed only by the station (STA) that has successfully transmitted in the previous channel access. Moreover, due to the specific acknowledgment (ACK) timeout setting adopted in the standard, the slot immediately following a collision cannot be ac…
Out-of-Band Signaling Scheme for High Speed Wireless LANs
2007
In recent years, the physical layer data rate provided by 802.11 Wireless LANs has dramatically increased thanks to significant advances in the modulation and coding techniques employed. However, previous studies show that the 802.11 MAC operation, namely the distributed coordination function (DCF), represents a limiting factor: the throughput efficiency drops as the channel bit rate increases, and a throughput upper limit does indeed exist when the channel bit rate goes to infinite high. These findings indicate that the performance of the DCF protocol will not be efficiently improved by merely increasing the channel bit rate. This paper shows that the DCF performance may significantly bene…
A Kalman Filter Approach for Distinguishing Channel and Collision Errors in IEEE 802.11 Networks
2008
In the last years, several strategies for maximizing the throughput performance of IEEE 802.11 networks have been proposed in literature. Specifically, it has been shown that optimizations are possible both at the medium access control (MAC) layer, and at the physical (PHY) layer. In fact, at the MAC layer, it is possible to minimize the channel waste due to collisions and backoff expiration times, by tuning the minimum contention window as a function of the network congestion level. At the PHY layer, it is possible to improve the transmission robustness, by selecting a suitable modulation/coding scheme as a function of the channel quality perceived by the stations. However, the feasibility…
Remarks on IEEE 802.11 DCF performance analysis
2005
This letter presents a new approach to evaluate the throughput/delay performance of the 802.11 distributed coordination function (DCF). Our approach relies on elementary conditional probability arguments rather than bidimensional Markov chains (as proposed in previous models) and can be easily extended to account for backoff operation more general than DCF's one.
PV-Alert: A fog-based architecture for safeguarding vulnerable road users
2017
International audience; High volumes of pedestrians, cyclists and other vulnerable road users (VRUs) have much higher casualty rates per mile; not surprising given their lack of protection from an accident. In order to alleviate the problem, sensing capabilities of smartphones can be used to detect, warn and safeguard these road users. In this research we propose an infrastructure-less fog-based architecture named PV-Alert (Pedestrian-Vehicle Alert) where fog nodes process delay sensitive data obtained from smartphones for alerting pedestrians and drivers before sending the data to the cloud for further analysis. Fog computing is considered in developing the architecture since it is an emer…
Resource sharing optimality in WiFi infrastructure networks
2009
In WiFi networks, mobile nodes compete for accessing a shared channel by means of a random access protocol called Distributed Coordination Function (DCF). Although this protocol is in principle fair, since all the stations have the same probability to transmit on the channel, it has been shown that unfair behaviors may emerge in actual networking scenarios. Assuming that a contending node can dynamically change its strategy, by tuning its contention parameters to non-standard values on the basis of channel observations, we prove that, for infrastructure networks with bidirectional traffic and homogeneous application requirements, selfish access strategies are able to reach equilibrium condi…
Performance analysis of selfish access strategies on WiFi infrastructure networks
2009
In this paper we propose a game-theoretic approach for characterizing WiFi network performance in presence of intelligent nodes employing cognitive functionalities. We assume that a cognitive WiFi node is aware of its application requirements and is able to dynamically estimate the network status, in order to dynamically change its access strategy by tuning the contention window settings. We prove that, for infrastructure networks with bidirectional traffic and homogeneous application requirements, selfish access strategies are able to reach equilibrium conditions, which are also Pareto optimal. Indeed, we show that the station strategies converge toward values which maximize a per-node uti…