2,544 research outputs found
Towards the fast and robust optimal design of Wireless Body Area Networks
Wireless body area networks are wireless sensor networks whose adoption has
recently emerged and spread in important healthcare applications, such as the
remote monitoring of health conditions of patients. A major issue associated
with the deployment of such networks is represented by energy consumption: in
general, the batteries of the sensors cannot be easily replaced and recharged,
so containing the usage of energy by a rational design of the network and of
the routing is crucial. Another issue is represented by traffic uncertainty:
body sensors may produce data at a variable rate that is not exactly known in
advance, for example because the generation of data is event-driven. Neglecting
traffic uncertainty may lead to wrong design and routing decisions, which may
compromise the functionality of the network and have very bad effects on the
health of the patients. In order to address these issues, in this work we
propose the first robust optimization model for jointly optimizing the topology
and the routing in body area networks under traffic uncertainty. Since the
problem may result challenging even for a state-of-the-art optimization solver,
we propose an original optimization algorithm that exploits suitable linear
relaxations to guide a randomized fixing of the variables, supported by an
exact large variable neighborhood search. Experiments on realistic instances
indicate that our algorithm performs better than a state-of-the-art solver,
fast producing solutions associated with improved optimality gaps.Comment: Authors' manuscript version of the paper that was published in
Applied Soft Computin
A fast ILP-based Heuristic for the robust design of Body Wireless Sensor Networks
We consider the problem of optimally designing a body wireless sensor
network, while taking into account the uncertainty of data generation of
biosensors. Since the related min-max robustness Integer Linear Programming
(ILP) problem can be difficult to solve even for state-of-the-art commercial
optimization solvers, we propose an original heuristic for its solution. The
heuristic combines deterministic and probabilistic variable fixing strategies,
guided by the information coming from strengthened linear relaxations of the
ILP robust model, and includes a very large neighborhood search for reparation
and improvement of generated solutions, formulated as an ILP problem solved
exactly. Computational tests on realistic instances show that our heuristic
finds solutions of much higher quality than a state-of-the-art solver and than
an effective benchmark heuristic.Comment: This is the authors' final version of the paper published in G.
Squillero and K. Sim (Eds.): EvoApplications 2017, Part I, LNCS 10199, pp.
1-17, 2017. DOI: 10.1007/978-3-319-55849-3\_16. The final publication is
available at Springer via http://dx.doi.org/10.1007/978-3-319-55849-3_1
Load Balancing Congestion Games and their Asymptotic Behavior
A central question in routing games has been to establish conditions for the
uniqueness of the equilibrium, either in terms of network topology or in terms
of costs. This question is well understood in two classes of routing games. The
first is the non-atomic routing introduced by Wardrop on 1952 in the context of
road traffic in which each player (car) is infinitesimally small; a single car
has a negligible impact on the congestion. Each car wishes to minimize its
expected delay. Under arbitrary topology, such games are known to have a convex
potential and thus a unique equilibrium. The second framework is splitable
atomic games: there are finitely many players, each controlling the route of a
population of individuals (let them be cars in road traffic or packets in the
communication networks). In this paper, we study two other frameworks of
routing games in which each of several players has an integer number of
connections (which are population of packets) to route and where there is a
constraint that a connection cannot be split. Through a particular game with a
simple three link topology, we identify various novel and surprising properties
of games within these frameworks. We show in particular that equilibria are non
unique even in the potential game setting of Rosenthal with strictly convex
link costs. We further show that non-symmetric equilibria arise in symmetric
networks. I. INTRODUCTION A central question in routing games has been to
establish conditions for the uniqueness of the equilibria, either in terms of
the network topology or in terms of the costs. A survey on these issues is
given in [1]. The question of uniqueness of equilibria has been studied in two
different frameworks. The first, which we call F1, is the non-atomic routing
introduced by Wardrop on 1952 in the context of road traffic in which each
player (car) is infinitesimally small; a single car has a negligible impact on
the congestion. Each car wishes to minimize its expected delay. Under arbitrary
topology, such games are known to have a convex potential and thus have a
unique equilibrium [2]. The second framework, denoted by F2, is splitable
atomic games. There are finitely many players, each controlling the route of a
population of individuals. This type of games have already been studied in the
context of road traffic by Haurie and Marcotte [3] but have become central in
the telecom community to model routing decisions of Internet Service Providers
that can decide how to split the traffic of their subscribers among various
routes so as to minimize network congestion [4]. In this paper we study
properties of equilibria in two other frameworks of routing games which exhibit
surprisin
Distance Aware Relaying Energy-efficient: DARE to Monitor Patients in Multi-hop Body Area Sensor Networks
In recent years, interests in the applications of Wireless Body Area Sensor
Network (WBASN) is noticeably developed. WBASN is playing a significant role to
get the real time and precise data with reduced level of energy consumption. It
comprises of tiny, lightweight and energy restricted sensors, placed in/on the
human body, to monitor any ambiguity in body organs and measure various
biomedical parameters. In this study, a protocol named Distance Aware Relaying
Energy-efficient (DARE) to monitor patients in multi-hop Body Area Sensor
Networks (BASNs) is proposed. The protocol operates by investigating the ward
of a hospital comprising of eight patients, under different topologies by
positioning the sink at different locations or making it static or mobile.
Seven sensors are attached to each patient, measuring different parameters of
Electrocardiogram (ECG), pulse rate, heart rate, temperature level, glucose
level, toxins level and motion. To reduce the energy consumption, these sensors
communicate with the sink via an on-body relay, affixed on the chest of each
patient. The body relay possesses higher energy resources as compared to the
body sensors as, they perform aggregation and relaying of data to the sink
node. A comparison is also conducted conducted with another protocol of BAN
named, Mobility-supporting Adaptive Threshold-based Thermal-aware
Energy-efficient Multi-hop ProTocol (M-ATTEMPT). The simulation results show
that, the proposed protocol achieves increased network lifetime and efficiently
reduces the energy consumption, in relative to M-ATTEMPT protocol.Comment: IEEE 8th International Conference on Broadband and Wireless
Computing, Communication and Applications (BWCCA'13), Compiegne, Franc
Electronically-switched Directional Antennas for Low-power Wireless Networks: A Prototype-driven Evaluation
We study the benefits of electronically-switched directional antennas in low-power wireless networks. This antenna technology may improve energy efficiency by increasing the communication range and by alleviating contention in directions other than the destination, but in principle requires a dedicated network stack. Unlike most existing works, we start by characterizing a real-world antenna prototype, and apply this to an existing low-power wireless stack, which we adapt with minimal changes. Our results show that: i) the combination of a low-cost directional antenna and a conventional network stack already brings significant performance improvements, e.g., nearly halving the radio-on time per delivered packet; ii) the margin of improvement available to alternative clean-slate protocol designs is similarly large and concentrated in the control rather than the data plane; iii) by artificially modifying our antenna's link-layer model, we can point at further potential benefits opened by different antenna designs
MatSWMM - An open-source toolbox for designing real-time control of urban drainage systems
This manuscript describes the MatSWMM toolbox, an open-source Matlab, Python, and LabVIEW-based software package for the analysis and design of real-time control (RTC) strategies in urban drainage systems (UDS). MatSWMM includes control-oriented models of UDS, and the storm water management model (SWMM) of the US Environmental Protection Agency (EPA), as well as systematic-system edition functionalities. Furthermore, MatSWMM is also provided with a population-dynamics-based controller for UDS with three of the fundamental dynamics, i.e., the Smith, projection, and replicator dynamics. The simulation algorithm, and a detailed description of the features of MatSWMM are presented in this manuscript in order to illustrate the capabilities that the tool has for educational and research purposes.Peer ReviewedPostprint (author's final draft
Reliable Energy-Efficient Routing Algorithm for Vehicle-Assisted Wireless Ad-Hoc Networks
We investigate the design of the optimal routing path in a moving vehicles
involved the internet of things (IoT). In our model, jammers exist that may
interfere with the information exchange between wireless nodes, leading to
worsened quality of service (QoS) in communications. In addition, the transmit
power of each battery-equipped node is constrained to save energy. We propose a
three-step optimal routing path algorithm for reliable and energy-efficient
communications. Moreover, results show that with the assistance of moving
vehicles, the total energy consumed can be reduced to a large extend. We also
study the impact on the optimal routing path design and energy consumption
which is caused by path loss, maximum transmit power constrain, QoS
requirement, etc.Comment: 6 pages, 5 figures, rejected by IEEE Globecom 2017,resubmit to IEEE
WCNC 201
A comprehensive survey of wireless body area networks on PHY, MAC, and network layers solutions
Recent advances in microelectronics and integrated circuits, system-on-chip design, wireless communication and intelligent low-power sensors have allowed the realization of a Wireless Body Area Network (WBAN). A WBAN is a collection of low-power, miniaturized, invasive/non-invasive lightweight wireless sensor nodes that monitor the human body functions and the surrounding environment. In addition, it supports a number of innovative and interesting applications such as ubiquitous healthcare, entertainment, interactive gaming, and military applications. In this paper, the fundamental mechanisms of WBAN including architecture and topology, wireless implant communication, low-power Medium Access Control (MAC) and routing protocols are reviewed. A comprehensive study of the proposed technologies for WBAN at Physical (PHY), MAC, and Network layers is presented and many useful solutions are discussed for each layer. Finally, numerous WBAN applications are highlighted
- âŠ