@inproceedings {42585,
	title = {Risk-Aware Particle-Filtering for State Estimation in Recirculating Aquaculture Systems},
	journal = {IEEE Asilomar Conference on Signals, Systems, and Computers},
	year = {2022},
	note = {This work is a joint collaboration between SimulaMet and University of Agder. This work was supported by\&nbsp; the IKTPLUSS INDURB grant 270730/O70 from the Research Council of Norway.},
	publisher = { IEEE},
	author = {Juan Diego {Cardenas-Cartagena} and Elnourani, Mohamed and Beferull-Lozano, Baltasar and Romero, Daniel}
}
@article {28424,
	title = {Robust Sum-Rate Maximization for Underlay Device-to-Device Communications on Multiple Channels},
	journal = {IEEE Transactions on Vehicular Technology},
	volume = {73},
	number = {3},
	year = {2022},
	note = {This work is a joint collaboration between SimulaMet and University of Agder. This work was supported by the FRIPRO TOPPFORSK under Grant WISECART 250910/F20 from the Research Council of Norway.},
	pages = {3075-3091},
	publisher = {IEEE},
	abstract = {Most recent works in device-to-device (D2D) underlay communications focus on the optimization of either power or channel allocation to improve the spectral efficiency, and typically consider uplink and downlink separately. Further, several of them also assume perfect knowledge of channel state information (CSI). In this paper, we formulate a joint uplink and downlink resource allocation scheme, which assigns both power and channel resources to D2D pairs and cellular users in an underlay network scenario. The objective is to maximize the overall network rate while maintaining fairness among the D2D pairs. In addition, we also consider imperfect CSI, where we guarantee a certain outage probability to maintain the desired quality-of-service (QoS). The resulting problem is a mixed integer non-convex optimization problem and we propose both centralized and decentralized algorithms to solve it, using convex relaxation, fractional programming, and alternating optimization. In the decentralized setting, the computational load is distributed among the D2D pairs and the base station, keeping also a low communication overhead. Moreover, we also provide a theoretical convergence analysis, including also the rate of convergence to stationary points. The proposed algorithms have been experimentally tested in a simulation environment, showing their favorable performance, as compared with the state-of-the art alternatives.},
	issn = {0018-9545},
	doi = {10.1109/TVT.2022.3145011},
	author = {Elnourani, Mohamed and Deshmukh, Siddharth and Beferull-Lozano, Baltasar and Romero, Daniel}
}
