720 research outputs found
Proportional fairness in wireless powered CSMA/CA based IoT networks
This paper considers the deployment of a hybrid wireless data/power access
point in an 802.11-based wireless powered IoT network. The proportionally fair
allocation of throughputs across IoT nodes is considered under the constraints
of energy neutrality and CPU capability for each device. The joint optimization
of wireless powering and data communication resources takes the CSMA/CA random
channel access features, e.g. the backoff procedure, collisions, protocol
overhead into account. Numerical results show that the optimized solution can
effectively balance individual throughput across nodes, and meanwhile
proportionally maximize the overall sum throughput under energy constraints.Comment: Accepted by Globecom 201
Life-Add: Lifetime Adjustable Design for WiFi Networks with Heterogeneous Energy Supplies
WiFi usage significantly reduces the battery lifetime of handheld devices
such as smartphones and tablets, due to its high energy consumption. In this
paper, we propose "Life-Add": a Lifetime Adjustable design for WiFi networks,
where the devices are powered by battery, electric power, and/or renewable
energy. In Life-Add, a device turns off its radio to save energy when the
channel is sensed to be busy, and sleeps for a random time period before
sensing the channel again. Life-Add carefully controls the devices' average
sleep periods to improve their throughput while satisfying their operation time
requirement. It is proven that Life-Add achieves near-optimal proportional-fair
utility performance for single access point (AP) scenarios. Moreover, Life-Add
alleviates the near-far effect and hidden terminal problem in general multiple
AP scenarios. Our ns-3 simulations show that Life-Add simultaneously improves
the lifetime, throughput, and fairness performance of WiFi networks, and
coexists harmoniously with IEEE 802.11.Comment: This is the technical report of our WiOpt paper. The paper received
the best student paper award at IEEE WiOpt 2013. The first three authors are
co-primary author
StrawMAN: Making Sudden Traffic Surges Graceful in Low-Power Wireless Networks
ReSensePromossuppleCONE
Survey of Spectrum Sharing for Inter-Technology Coexistence
Increasing capacity demands in emerging wireless technologies are expected to
be met by network densification and spectrum bands open to multiple
technologies. These will, in turn, increase the level of interference and also
result in more complex inter-technology interactions, which will need to be
managed through spectrum sharing mechanisms. Consequently, novel spectrum
sharing mechanisms should be designed to allow spectrum access for multiple
technologies, while efficiently utilizing the spectrum resources overall.
Importantly, it is not trivial to design such efficient mechanisms, not only
due to technical aspects, but also due to regulatory and business model
constraints. In this survey we address spectrum sharing mechanisms for wireless
inter-technology coexistence by means of a technology circle that incorporates
in a unified, system-level view the technical and non-technical aspects. We
thus systematically explore the spectrum sharing design space consisting of
parameters at different layers. Using this framework, we present a literature
review on inter-technology coexistence with a focus on wireless technologies
with equal spectrum access rights, i.e. (i) primary/primary, (ii)
secondary/secondary, and (iii) technologies operating in a spectrum commons.
Moreover, we reflect on our literature review to identify possible spectrum
sharing design solutions and performance evaluation approaches useful for
future coexistence cases. Finally, we discuss spectrum sharing design
challenges and suggest future research directions
Adaptive Distributed Fair Scheduling and Its Implementation in Wireless Sensor Networks
A novel adaptive and distributed fair scheduling (ADFS) scheme for wireless sensor networks is shown through hardware implementation. In contrast to simulation, hardware evaluation provides valuable feedback to protocol and hardware development process. The proposed protocol focuses on quality-of-service (QoS) issues to address flow prioritization. Thus, when nodes access a shared channel, the proposed ADFS allocates the channel bandwidth proportionally to the weight, or priority, of the packet flows. Moreover, ADFS allows for dynamic allocation of network resources with little added overhead. Weights are initially assigned using user specified QoS criteria. These weights are subsequently updated as a function of delay, enqueued packets, flow arrival rate, and the previous packet weight. The back-off interval is also altered using the weight update equation. The weight update and the back-off interval selection ensure that global fairness is attained even with variable service rates. The algorithm is implemented using UMR/SLU motes for an industrial monitoring application. Results the hardware implementation demonstrates improved performance in terms of fairness index, flow rate, and delay
Deep-Reinforcement Learning Multiple Access for Heterogeneous Wireless Networks
This paper investigates the use of deep reinforcement learning (DRL) in a MAC
protocol for heterogeneous wireless networking referred to as
Deep-reinforcement Learning Multiple Access (DLMA). The thrust of this work is
partially inspired by the vision of DARPA SC2, a 3-year competition whereby
competitors are to come up with a clean-slate design that "best share spectrum
with any network(s), in any environment, without prior knowledge, leveraging on
machine-learning technique". Specifically, this paper considers the problem of
sharing time slots among a multiple of time-slotted networks that adopt
different MAC protocols. One of the MAC protocols is DLMA. The other two are
TDMA and ALOHA. The nodes operating DLMA do not know that the other two MAC
protocols are TDMA and ALOHA. Yet, by a series of observations of the
environment, its own actions, and the resulting rewards, a DLMA node can learn
an optimal MAC strategy to coexist harmoniously with the TDMA and ALOHA nodes
according to a specified objective (e.g., the objective could be the sum
throughput of all networks, or a general alpha-fairness objective)
Is Our Model for Contention Resolution Wrong?
Randomized binary exponential backoff (BEB) is a popular algorithm for
coordinating access to a shared channel. With an operational history exceeding
four decades, BEB is currently an important component of several wireless
standards. Despite this track record, prior theoretical results indicate that
under bursty traffic (1) BEB yields poor makespan and (2) superior algorithms
are possible. To date, the degree to which these findings manifest in practice
has not been resolved.
To address this issue, we examine one of the strongest cases against BEB:
packets that simultaneously begin contending for the wireless channel. Using
Network Simulator 3, we compare against more recent algorithms that are
inspired by BEB, but whose makespan guarantees are superior. Surprisingly, we
discover that these newer algorithms significantly underperform. Through
further investigation, we identify as the culprit a flawed but common
abstraction regarding the cost of collisions. Our experimental results are
complemented by analytical arguments that the number of collisions -- and not
solely makespan -- is an important metric to optimize. We believe that these
findings have implications for the design of contention-resolution algorithms.Comment: Accepted to the 29th ACM Symposium on Parallelism in Algorithms and
Architectures (SPAA 2017
- …