Hop-2 IEEE 802.15.5 Optimization framework for Resource Allocation with Service Differentiation

Author(s):  
Samar Sindian ◽  
Abed Ellatif Samhat ◽  
Ayman Khalil ◽  
Matthieu Crussiere ◽  
Jean-Francois Helard ◽  
...  
Author(s):  
Samar Sindian ◽  
Abed Ellatif Samhat ◽  
Matthieu Crussiere ◽  
Jean-Francois Helard ◽  
Ayman Khalil

Author(s):  
Peifang Zhang ◽  
Scott Jordan

Emerging wideband code division multiple access (WCDMA) data services will likely require resource allocation to ensure that throughput targets are met. Scheduling and access control can both be key components in this task. In this chapter, we introduce a two-layer scheduler and connection access controller that attempts to balance efficiency with fairness. We first propose a scheduler that takes advantage of variations in the wireless channel—both channel fluctuations in time for each user, and channel variations among multiple users at a particular time. By mixing a max-min policy with a policy of serving users with relatively good channels, the scheduler can achieve individual average throughput targets in a manner that encourages system efficiency. We then propose a two-layer algorithm that offers targeted throughput for interactive nomadic data streams, such as video or music streaming. The design purpose is to provide users with service differentiation, which lays the groundwork for network optimization in terms of capacity or utility, and can be easily extended to revenue maximization. Upon the request of a data stream connection, a target throughput is negotiated between the user and the network/base station. The network attempts to achieve the throughput targets over the duration of each individual connection by maximizing a system objective based on users’ satisfaction that is represented by a utility function. We assume that a users’ utility function depends not only on the throughput target but also on final achieved throughput. The algorithm integrates connection access control and resource allocation per connection request with rate scheduling on a per frame basis adaptive to slow fading. Through numerical analysis, the proposed joint scheduler and connection access controller is shown to achieve the design goals.


Author(s):  
Samar Sindian ◽  
Matthieu Crussière ◽  
Jean-François Hélard ◽  
Abed Ellatif Samhat ◽  
Ayman Khalil

Sensors ◽  
2020 ◽  
Vol 20 (8) ◽  
pp. 2191
Author(s):  
Dimitrios Dechouniotis ◽  
Nikolaos Athanasopoulos ◽  
Aris Leivadeas ◽  
Nathalie Mitton ◽  
Raphael Jungers ◽  
...  

The potential offered by the abundance of sensors, actuators, and communications in the Internet of Things (IoT) era is hindered by the limited computational capacity of local nodes. Several key challenges should be addressed to optimally and jointly exploit the network, computing, and storage resources, guaranteeing at the same time feasibility for time-critical and mission-critical tasks. We propose the DRUID-NET framework to take upon these challenges by dynamically distributing resources when the demand is rapidly varying. It includes analytic dynamical modeling of the resources, offered workload, and networking environment, incorporating phenomena typically met in wireless communications and mobile edge computing, together with new estimators of time-varying profiles. Building on this framework, we aim to develop novel resource allocation mechanisms that explicitly include service differentiation and context-awareness, being capable of guaranteeing well-defined Quality of Service (QoS) metrics. DRUID-NET goes beyond the state of the art in the design of control algorithms by incorporating resource allocation mechanisms to the decision strategy itself. To achieve these breakthroughs, we combine tools from Automata and Graph theory, Machine Learning, Modern Control Theory, and Network Theory. DRUID-NET constitutes the first truly holistic, multidisciplinary approach that extends recent, albeit fragmented results from all aforementioned fields, thus bridging the gap between efforts of different communities.


Sign in / Sign up

Export Citation Format

Share Document