Multicasting is emerging as an enabling technology for multimedia transmissions over wireless networks to support several groups of users with flexible quality of service (QoS) requirements. Although multicast has huge potential to push the limits of next generation communication systems; it is however one of the most challenging issues currently being addressed. In this survey, we explain multicast group formation and various forms of group rate determination approaches. We also provide a systematic review of recent channel-aware multicast scheduling and resource allocation (MSRA) techniques proposed for downlink multicast services in OFDMA based systems. We study these enabling algorithms, evaluate their core characteristics, limitations and classify them using multidimensional matrix. We cohesively review the algorithms in terms of their throughput maximization, fairness considerations, performance complexities, multi-antenna support, optimality and simplifying assumptions. We discuss existing standards employing multicasting and further highlight some potential research opportunities in multicast systems.

Variations in electricity tariffs arising due to stochastic demand loads on the power grids have stimulated research in finding optimal charging=discharging scheduling solutions for electric vehicles (EVs). Most of the current EV scheduling solutions are either centralized, which suffer from low reliability and high complexity, while existing decentralized solutions do not facilitate the efficient scheduling of on-move EVs in large-scale networks considering a smart energy distribution system. Motivated by smart cities applications, we consider in this paper the optimal scheduling of EVs in a geographically largescale smart energy distribution system where EVs have the flexibility of charging=discharging at spatiallydeployed smart charging stations (CSs) operated by individual aggregators. In such a scenario, we define the social welfare maximization problem as the total profit of both supply and demand sides in the form of a mixed integer non-linear programming (MINLP) model. Due to the intractability, we then propose an online decentralized algorithm with low complexity which utilizes effective heuristics to forward each EV to the most profitable CS in a smart manner. Results of simulations on the IEEE 37 bus distribution network verify that the proposed algorithm improves the social welfare by about 30% on average with respect to an alternative scheduling strategy under the equal participation of EVs in charging and discharging operations. Considering the best-case performance where only EV profit maximization is concerned, our solution also achieves upto 20% improvement in flatting the final electricity load. Furthermore, the results reveal the existence of an optimal number of CSs and an optimal vehicle-to-grid penetration threshold for which the overall profit can be maximized. Our findings serve as guidelines for V2G system designers in smart city scenarios to plan a cost-effective strategy for large-scale EVs distributed energy management.

The mild symptoms in Mild Cognitive Impairment (MCI), a precursor of dementia, often go unnoticed and are assumed as normal aging signs. Such negligence result in late visits which consequently, lead to the diagnosis and progression of dementia. An instrumented gait assessment in home settings may facilitate the detection of subtle MCI-related motor deficits thus, allowing early diagnosis and intervention. This paper investigates potential gait biomarkers derived from shank mounted inertial sensors signals under normal and dual-task walking conditions using data collected from thirty MCI and thirty cognitively normal (CN) subjects. To identify potential gait biomarkers for MCI screening, we assess the variance and predictive power of each feature. Moreover, multiple classification models using different machine learning and feature selection techniques are built to automate MCI detection by leveraging the gait biomarkers. Statistical analysis reveal multiple gait parameters that are significantly different under both single and dual-task settings. However, we show that dual-task walking provides better distinction between MCI and CN subjects. The machine learning model employed for MCI pre-screening based on the inertial sensor-derived gait biomarkers achieves accuracy and sensitivity of 71.67% and 83.33%, respectively.

The ability to predict future epidemic threats, both in real and digital worlds, and to develop effective containment strategies heavily leans on the availability of reliable infection spreading models. The stochastic behavior of such processes makes them even more demanding to scrutinize over structured networks. This paper concerns the dynamics of a new susceptible-infected-susceptible (SIS) epidemic model incorporated with multistage infection (infection delay) and an infective medium (propagation vector) over complex networks. In particular, we investigate the critical epidemic thresholds and the infection spreading pattern using mean-field approximation (MFA) and results obtained through extensive numerical simulations. We further generalize the model for any arbitrary number of infective media to mimic existing scenarios in biological and social networks. Our analysis and simulation results reveal that the inclusion of multiple infective medium and multiple stages of infection significantly alleviates the epidemic threshold and, thus, accelerates the process of infection spreading in the population.

2=0.54ex Information aging has gained prominence in characterizing communication protocols for timely remote estimation and control applications. This work proposes an Age of Information (AoI)-aware threshold-based dynamic frame slotted ALOHA (T-DFSA) for contention resolution in random access machine-type communication networks. Unlike conventional DFSA that maximizes the throughput in each frame, the frame length and age-gain threshold in T-DFSA are determined to minimize the normalized average AoI reduction of the network in each frame. At the start of each frame in the proposed protocol, the common Access Point (AP) stores an estimate of the age-gain distribution of a typical node. Depending on the observed status of the slots, age-gains of successful nodes, and maximum available AoI, the AP adjusts its estimation in each frame. The maximum available AoI is exploited to derive the maximum possible age-gain at each frame and thus, to avoid overestimating the age-gain threshold, which may render T-DFSA unstable. Numerical results validate our theoretical analysis and demonstrate the effectiveness of the proposed T-DFSA compared to the existing optimal frame slotted ALOHA, threshold-ALOHA, and age-based thinning protocols in a considerable range of update generation rates.