65 research outputs found
Free Energy Approximations for CSMA networks
In this paper we study how to estimate the back-off rates in an idealized
CSMA network consisting of links to achieve a given throughput vector using
free energy approximations. More specifically, we introduce the class of
region-based free energy approximations with clique belief and present a closed
form expression for the back-off rates based on the zero gradient points of the
free energy approximation (in terms of the conflict graph, target throughput
vector and counting numbers). Next we introduce the size clique free
energy approximation as a special case and derive an explicit expression for
the counting numbers, as well as a recursion to compute the back-off rates. We
subsequently show that the size clique approximation coincides with a
Kikuchi free energy approximation and prove that it is exact on chordal
conflict graphs when . As a by-product these results provide us
with an explicit expression of a fixed point of the inverse generalized belief
propagation algorithm for CSMA networks. Using numerical experiments we compare
the accuracy of the novel approximation method with existing methods
Wireless network control of interacting Rydberg atoms
We identify a relation between the dynamics of ultracold Rydberg gases in
which atoms experience a strong dipole blockade and spontaneous emission, and a
stochastic process that models certain wireless random-access networks. We then
transfer insights and techniques initially developed for these wireless
networks to the realm of Rydberg gases, and explain how the Rydberg gas can be
driven into crystal formations using our understanding of wireless networks.
Finally, we propose a method to determine Rabi frequencies (laser intensities)
such that particles in the Rydberg gas are excited with specified target
excitation probabilities, providing control over mixed-state populations.Comment: 6 pages, 7 figures; includes corrections and improvements from the
peer-review proces
A Performance-to-Cost Analysis of IEEE 802.15.4 MAC With 802.15.4e MAC Modes
[EN] The IEEE 802.15.4 standard is one of the widely adopted networking specification for Internet of Things (IoT). It defines several physical layer (PHY) options and medium access control (MAC) sub-layer protocols for interconnection of constrained wireless devices. These devices are usually battery-powered and need to support requirements like low-power consumption and low-data rates. The standard has been revised twice to incorporate new PHY layers and improvements learned from implementations. Research in this direction has been primarily centered around improving the energy consumption of devices. Recently, to meet specific Quality-of-Service (QoS) requirements of different industrial applications, the IEEE 802.15.4e amendment was released that focuses on improving reliability, robustness and latency. In this paper, we carry out a performance-to-cost analysis of Deterministic and Synchronous Multi-channel Extension (DSME) and Time-slotted Channel Hopping (TSCH) MAC modes of IEEE 802.15.4e with 802.15.4 MAC protocol to analyze the trade-off of choosing a particular MAC mode over others. The parameters considered for performance are throughput and latency, and the cost is quantified in terms of energy. A Markov model has been developed for TSCH MAC mode to compare its energy costs with 802.15.4 MAC. Finally, we present the applicability of different MAC modes to different application scenarios.This work was supported in part by the SERB, DST, Government of India under Grant ECRA/2016/001651.Choudhury, N.; Matam, R.; Mukherjee, M.; Lloret, J. (2020). A Performance-to-Cost Analysis of IEEE 802.15.4 MAC With 802.15.4e MAC Modes. IEEE Access. 8:41936-41950. https://doi.org/10.1109/ACCESS.2020.2976654S4193641950
Recommended from our members
Modeling and analyzing device-to-device content distribution in cellular networks
Device-to-device (D2D) communication is a promising approach to optimize the utilization of air interface resources in 5G networks, since it allows decentralized proximity-based communication. To obtain caching gains through D2D, mobile nodes must possess content that other mobiles want. Thus, devising intelligent cache placement techniques are essential for D2D. The goal of this dissertation is to provide randomized spatial models for content distribution in cellular networks by capturing the locality of the content, and additionally, to provide dynamic content placement algorithms exploiting the node configurations.
First, a randomized content caching scheme for D2D networks in the cellular context is proposed. Modeling the locations of the devices as a homogeneous Poisson Point Process (PPP), the probability of successful content delivery in the presence of interference and noise is derived. With some idealized modeling aspects, i.e., given that (i) only a fraction of users to be randomly scheduled at a given time, and (ii) the request distribution does not change over time, it has been shown that the performance of caching can be optimized by smoothing out the request distribution, where the smoothness of the caching distribution is mainly determined by the path loss exponent, and holds under Rayleigh, Ricean and Nakagami fading models.
Second, to take the randomized caching model a step further, a spatially correlated content caching scenario is contemplated. Inspired by the Matérn hard-core point process of type II, which is a first-order pairwise interaction model, D2D nodes caching the same file are never closer to each other than the exclusion radius. The exclusion radius plays the role of a substitute for caching probability. The optimal exclusion radii that maximize the hit probability can be determined by using the request distribution and cache memory size. Unlike independent content placement, which is oblivious to the geographic locations of the nodes, the new strategy can be effective for proximity-based communication even when the cache size is small.
Third, an auction-aided Matérn carrier sense multiple access (CSMA) policy that considers the joint analysis of scheduling and caching is studied. The auction scheme is distributed. Given a cache configuration, i.e., the set of cached files in each user at a given snapshot, each D2D receiver determines the value of its request, by bidding on the set of potential transmitters in its communication range. The values of the receiver bids are reported to the potential transmitter, which computes the cumulated sum of these variables taken on all users in its cell. The potential transmitter then reports the value of the bid sum to other potential transmitters in its contention range. Given the accumulated bids of all potential transmitters, the contention range and the medium access probability, a fraction of the potential transmitters are jointly scheduled, determined by the auction policy, in order to optimize the throughput. Later, a Gibbs sampling-based cache update strategy is proposed to iteratively optimize the hit rate by taking the scheduling scheme into account.
In this dissertation, a variety of distributed algorithms for D2D content caching are proposed. Our results indicate that the geographic locality and the network parameters have a significant role in determining and optimizing the placement strategy. Exploiting the user interactions and spatial diversity, and incentivizing cooperation among D2D nodes are crucial in realizing the full potential of caching. Furthermore, from a network point of view, the scheduling and the caching phases are closely linked to each other. Hence, understanding the interaction between these two phases helps develop novel dynamic caching strategies capturing the temporal and spatial locality of the demand.Electrical and Computer Engineerin
Congestion and medium access control in 6LoWPAN WSN
In computer networks, congestion is a condition in which one or more egressinterfaces are offered more packets than are forwarded at any given instant [1]. In wireless sensor networks, congestion can cause a number of problems including packet loss, lower throughput and poor energy efficiency. These problems can potentially result in a reduced deployment lifetime and underperforming applications. Moreover, idle radio listening is a major source of energy consumption therefore low-power wireless devices must keep their radio transceivers off to maximise their battery lifetime. In order to minimise energy consumption and thus maximise the lifetime of wireless sensor networks, the research community has made significant efforts towards power saving medium access control protocols with Radio Duty Cycling. However, careful study of previous work reveals that radio duty cycle schemes are often neglected during the design and evaluation of congestion control algorithms. This thesis argues that the presence (or lack) of radio duty cycle can drastically influence the performance of congestion control mechanisms. To investigate if previous findings regarding congestion control are still applicable in IPv6 over low power wireless personal area and duty cycling networks; some of the most commonly used congestion detection algorithms are evaluated through simulations. The research aims to develop duty cycle aware congestion control schemes for IPv6 over low power wireless personal area networks. The proposed schemes must be able to maximise the networks goodput, while minimising packet loss, energy consumption and packet delay. Two congestion control schemes, namely DCCC6 (Duty Cycle-Aware Congestion Control for 6LoWPAN Networks) and CADC (Congestion Aware Duty Cycle MAC) are proposed to realise this claim.
DCCC6 performs congestion detection based on a dynamic buffer. When congestion occurs, parent nodes will inform the nodes contributing to congestion and rates will be readjusted based on a new rate adaptation scheme aiming for local fairness. The child notification procedure is decided by DCCC6 and will be different when the network is duty cycling. When the network is duty cycling the child notification will be made through unicast frames. On the contrary broadcast frames will be used for congestion notification when the network is not duty cycling. Simulation and test-bed experiments have shown that DCCC6 achieved higher goodput and lower packet loss than previous works. Moreover, simulations show that DCCC6 maintained low energy consumption, with average delay times while it achieved a high degree of fairness.
CADC, uses a new mechanism for duty cycle adaptation that reacts quickly to changing traffic loads and patterns. CADC is the first dynamic duty cycle pro- tocol implemented in Contiki Operating system (OS) as well as one of the first schemes designed based on the arbitrary traffic characteristics of IPv6 wireless sensor networks. Furthermore, CADC is designed as a stand alone medium access control scheme and thus it can easily be transfered to any wireless sensor network architecture. Additionally, CADC does not require any time synchronisation algorithms to operate at the nodes and does not use any additional packets for the exchange of information between the nodes (For example no overhead).
In this research, 10000 simulation experiments and 700 test-bed experiments have been conducted for the evaluation of CADC. These experiments demonstrate that CADC can successfully adapt its cycle based on traffic patterns in every traffic scenario. Moreover, CADC consistently achieved the lowest energy consumption, very low packet delay times and packet loss, while its goodput performance was better than other dynamic duty cycle protocols and similar to the highest goodput observed among static duty cycle configurations
- …