Amir Sonee

Amir Sonee

Auto-generated profile, based on publicly available information

Amir Sonee

Imperial College London, UK

Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
22 April 2025 in IEEE Open Journal of the Communications Society
Verified
Journal Article
Open access
MAMiguel Arana-Catania
Miguel Arana-Catania
ASAmir Sonee
Amir Sonee
AKAbdul-Manan Khan
Abdul-Manan Khan
KFKavan Fatehi
Kavan Fatehi
YTYun Tang
Yun Tang
ARAlessandra Russo
Alessandra Russo
Future telecommunications will increasingly integrate AI capabilities into network infrastructures to deliver seamless and harmonized services closer to end-users. However, this progress also raises significant trust and safety concerns. The machine learning systems orchestrating these advanced services will widely rely on deep reinforcement learning (DRL) to process multi-modal requirements datasets and make semantically modulated decisions, introducing three major challenges: (1) First, we acknowledge that most explainable AI research is stakeholder-agnostic while, in reality, the explanations must cater for diverse telecommunications stakeholders, including network service providers, legal authorities, and end users, each with unique goals and operational practices; (2) Second, DRL lacks prior models or established frameworks to guide the creation of meaningful long-term explanations of the agent’s behaviour in a goal-oriented RL task, and we introduce state-of-the-art approaches such as reward machine and sub-goal automata that can be universally represented and easily manipulated by logic programs and verifiably learned by inductive logic programming of answer set programs; (3) Third, most explainability approaches focus on correlation rather than causation, and we emphasise that understanding causal learning can further enhance 6G network optimisation. Together, in our judgement they form crucial enabling technologies for trustworthy services in 6G. This review offers a timely resource for academic researchers and industry practitioners by highlighting the methodological advancements needed for explainable DRL (X-DRL) in 6G. It identifies key stakeholder groups, maps their needs to X-DRL solutions, and presents case studies showcasing practical applications. By identifying and analysing these challenges in the context of 6G case studies, this work aims to inform future research, transform industry practices, and highlight unresolved gaps in this rapidly evolving field.

5 February 2015 in IEEE Transactions on Information Forensics and Security
Verified
Journal Article
Closed access
ASAmir Sonee
Amir Sonee
GHGhoshe Abed Hodtani
Ghoshe Abed Hodtani
In this paper, we study the two transmitter multiple-access channel (MAC) with noncausal side information at one (single-sided) or both (two-sided) of the encoders in the presence of an external wiretapper (WT) and under individual and collective secrecy constraints. Our work consists of four parts. First, we consider the discrete memoryless (DM-MAC-WT) case of the model and derive inner and outer bounds on the secrecy capacity region under both of the secrecy constraints. Second, the results are extended to the Gaussian memoryless case [Gaussian multiple-access channel WT (GMAC-WT)] in detail and are used to illustrate numerically that the secrecy rate region is enlarged by increasing the power of the interference signal which is known noncausally at the encoder. Third, we analyze the strong interference regime as an important regime in GMAC with side information and show that under collective secrecy constraint, we can achieve the secrecy capacity region of the single-sided channel asymptotically for a special case in which the signal and noise powers satisfy specific constraints. To the best of our knowledge, this capacity region is the first one obtained for GMAC-WT. Finally, we show that our results include previous works as its special cases for both the single-sided and two-sided channel models.

1 May 2014
Verified
Conference Paper
Closed access
ASAmir Sonee
Amir Sonee
GHGhoshe Abed Hodtani
Ghoshe Abed Hodtani
In this paper, the wiretap channel with side information studied in [2] is revisited for the case in which the side information is available only at the encoder and in a strictly causal manner. We derive a lower bound on the secrecy capacity of the channel based on a coding scheme which consists of block Markov encoding and key generation using the strictly causal state information available at the encoder. In order to provide the secrecy of messages, at the end of each block a description of the state sequence obtained by the encoder is used to generate the key which encrypts the whole or part of the message to be transmitted in the next block. Moreover, for the decoder to be able to decrypt the messages, the description of the sate sequence of each block is sent in common with the message of that block. Also, an upper bound on the secrecy capacity is developed which assumes that the state is noncausally known at the encoder and we prove that it would coincide the lower bound for a special case and results in the secrecy capacity.

1 May 2010
Verified
Conference Paper
Closed access
ASAmir Sonee
Amir Sonee
SSSomayeh Salimi
Somayeh Salimi
In this paper, we propose an information-theoretic scheme which achieves a new rate-equivocation region for the four-terminal relay-eavesdropper channel. The coding scheme used to achieve this region is a combination of the partial decode and forward, compress and forward and noise forwarding strategies. In this strategy the relay cooperates with the source to have both a reliable and secure communication by decoding some part of the source message, compressing the received signal and also sending the codewords independent of the transmitted message. Using this scheme we can obtain the perfect secrecy capacity of the semi- deterministic and deterministic relay channels.

29 August 2016
Verified
Conference Paper
Closed access
ASAmir Sonee
Amir Sonee
GHGhoshe Abed Hodtani
Ghoshe Abed Hodtani
The two-user discrete memoryless cognitive multiple-access channel with confidential messages (DM-CMAC-CM) has been studied in the literature with a result for the secrecy capacity region. In this paper, we study a more general and practical model (three-user DM-CMAC-CM), although similar generalizations have been intractable in some studied cases, and obtain a capacity-equivocation and secrecy capacity region results including previous results as its special cases.

1 January 2026 in IEEE Open Journal of the Communications Society
Verified
Journal Article
Open access
KFKavan Fatehi
Kavan Fatehi
MGMostafa Rahmani Ghourtani
Mostafa Rahmani Ghourtani
ASAmir Sonee
Amir Sonee
PYPoonam Yadav
Poonam Yadav
ARAlessandra M Russo
Alessandra M Russo
Hamed AhmadiHamed Ahmadi
Hamed Ahmadi