Search results for "ARCHITECTURE"
showing 10 items of 3706 documents
Serial In-network Processing for Large Stationary Wireless Sensor Networks
2017
International audience; In wireless sensor networks, a serial processing algorithm browses nodes one by one and can perform different tasks such as: creating a schedule among nodes, querying or gathering data from nodes, supplying nodes with data, etc. Apart from the fact thatserial algorithms totally avoid collisions, numerous recent works have confirmed that these algorithms reduce communications andconsiderably save energy and time in large-dense networks. Yet, due to the path construction complexity, the proposed algorithmsare not optimal and their performances can be further enhanced. To do so, in the present paper, we propose a new serial processing algorithm that, in most of the case…
An On-Demand Energy Requesting Scheme for Wireless Energy Harvesting Powered IoT Networks
2018
Energy harvesting (EH) delivers a unique technique for replenishing batteries in Internet of Things (IoT) devices. Equipped with an energy harvesting accessory, EH-enabled sensor nodes/IoT devices ...
Priority-based initial access for URLLC traffic in massive IoT networks: Schemes and performance analysis
2020
Abstract At a density of one million devices per square kilometer, the10’s of billions of devices, objects, and machines that form a massive Internet of things (mIoT) require ubiquitous connectivity. Among a massive number of IoT devices, a portion of them require ultra-reliable low latency communication (URLLC) provided via fifth generation (5G) networks, bringing many new challenges due to the stringent service requirements. Albeit a surge of research efforts on URLLC and mIoT, access mechanisms which include both URLLC and massive machine type communications (mMTC) have not yet been investigated in-depth. In this paper, we propose three novel schemes to facilitate priority-based initial …
Optimal Buffer Resource Allocation in Wireless Caching Networks
2019
Wireless caching systems have been exhaustively investigated in recent years. Due to limited buffer capacity, and unbalanced arrival and service rates, the backlogs may exist in the caching node and even cause buffer overflow. In this paper, we first investigate the relationship among backlogs, buffer capacity, data arrival rate and service rate, utilizing the martingale theory which is flexible in handling any arrival and service processes. Then given a target buffer overflow probability, the minimal required buffer portion is determined. If the devoted buffer capacity can fulfill all serving users' minimal buffer requirements, an optimization problem is constructed with the objective to m…
Life-based design as an extension of problem-based learning — A tool for understanding people and technology
2015
Global conditions are changing at such a rate that foreseeing trends in technological development, economic fluctuations and climatic conditions is ever more difficult. When developing technologies, there is one constant factor that practitioners and researchers should be aware of, and that is people. This is not to say that people, culture and social conditions remain stagnant, for these too evolve with the surrounding circumstances. Rather, appropriate tools and capabilities for investigating people, their lives and life situations, are integral to understanding what people need in terms of technology, how these technologies will be used, and more importantly how they will be valued in th…
xloops - Automated Feynman diagram calculation
1998
The program package xloops, a general, model independent tool for the calculation of high energy processes up to the two-loop level, is introduced. xloops calculates massive one- and two-loop Feynman diagrams in the standard model and related theories both analytically and numerically. A user-friendly Xwindows frontend is part of the package. xloops relies on the application of parallel space techniques. The treatment of tensor structure and the separation of divergences in analytic expressions is described in this scheme. All analytic calculations are performed with Maple. We describe the mathematical methods and computer algebra techniques xloops uses and give a brief introduction how to …
Using knowledge of human-generated code to bias the search in program synthesis with grammatical evolution
2021
Recent studies show that program synthesis with GE produces code that has different structure compared to human-generated code, e.g., loops and conditions are hardly used. In this article, we extract knowledge from human-generated code to guide evolutionary search. We use a large code-corpus that was mined from the open software repository service GitHub and measure software metrics and properties describing the code-base. We use this knowledge to guide the search by incorporating a new selection scheme. Our new selection scheme favors programs that are structurally similar to the programs in the GitHub code-base. We find noticeable evidence that software metrics can help in guiding evoluti…
Embedding Evolution in Epidemic-Style Forwarding
2007
International audience; In this work, we introduce a framework to let forwarding schemes evolve in order to adapt to changing and a priori unknown environments. The framework is inspired by genetic algorithms: at each node a genotype describes the forwarding scheme used, a selection process fosters the diffusion of the fittest genotypes in the system and new genotypes are created by combining existing ones or applying random changes. A case study implementation is presented and its performance evaluated via numerical simulations.
Performance analysis of the out-of-band signaling scheme for high speed wireless LANs
2005
In this paper, we study the performance of our earlier proposed out-of-band signaling (OBS) scheme for high speed wireless local area networks (WLANs). We employ the system approximation technique for modeling of the OBS scheme. An equivalent state dependent single server queue, that describes the OBS scheme, is constructed for the analysis of the throughput and delay performances. Moreover, we study the throughput optimization of the OBS scheme, which provides a means for optimizing the performance of the OBS scheme, given a particular network environment. Finally, we conduct several simulation experiments to validate our analytical results.
Call Admission Control in Single and Two-Tier Cellular Networks
2010
We consider four strategies for call admission control (CAC) in single and two-tier cellular networks, which are designed to ensure advantage of handover calls: dynamic redundancy (cutoff priority scheme), partial dynamic redundancy (fractional guard channel scheme), static redundancy (rigid division-based CAC scheme) and restriction of the number of new calls admitted (new call bounding scheme). We show the advantage of dynamic reservation by numerical analysis. We strictly prove it in the case of two-channel system with losses.