Milena Radenkovic

Dr. Milena Radenkovic


Research Focus & Metrics

Academic Career Length

25Years (2002-Present)

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

Representative Publications

View All Publications
26 March 2018 in IEEE Transactions on Industrial Informatics
Verified
Journal Article
Closed access
MRMubashir Husain Rehmani
Mubashir Husain Rehmani
Martin ReissleinMartin Reisslein
Martin Reisslein
Abderrezak RachediAbderrezak Rachedi
Abderrezak Rachedi
Melike Erol-KantarciMelike Erol-Kantarci
Melike Erol-Kantarci
MRMilena Radenkovic
Milena Radenkovic
Rising energy costs, losses in the present-day electricity grid, risks from nuclear power generation, and global environmental changes are motivating a transformation of the conventional ways of generating electricity. Globally, there is a desire to rely more on renewable energy resources (RERs) for electricity generation. RERs reduce green house gas emissions and may have economic benefits, e.g., through applying demand side management with dynamic pricing so as to shift loads from fossil fuel-based generators to RERs. The electricity grid is presently evolving towards an intelligent grid, the so-called smart grid (SG). One of the major goals of the future SG is to move towards 100% electricity generation from RERs, i.e., towards a 100% renewable grid. However, the disparate, intermittent, and typically widely geographically distributed nature of RERs complicates the integration of RERs into the SG. Moreover, individual RERs have generally lower capacity than conventional fossil-fuel plants, and these RERs are based on a wide spectrum of different technologies. In this article, we give an overview of recent efforts that aim to integrate RERs into the SG. We outline the integration of RERs into the SG along with their supporting communication networks. We also discuss ongoing projects that seek to integrate RERs into the SG around the globe. Finally, we outline future research directions on integrating RERs into the SG.

1 September 2012 in Ad Hoc Networks
Verified
Journal Article
Open access
MRMilena Radenkovic
Milena Radenkovic
AGAndrew Grundy
Andrew Grundy
Detecting and dealing with congestion in delay-tolerant networks (DTNs) is an important and challenging problem. Current DTN forwarding algorithms typically direct traffic towards more central nodes in order to maximise delivery ratios and minimise delays, but as traffic demands increase these nodes may become saturated and unusable. We pro- pose CafRep, an adaptive congestion aware protocol that detects and reacts to congested nodes and congested parts of the network by using implicit hybrid contact and resources congestion heuristics. CafRep exploits localised relative utility based approach to offload the traffic from more to less congested parts of the network, and to replicate at adaptively lower rate in different parts of the network with non-uniform congestion levels. We extensively evaluate our work against benchmark and competitive protocols across a range of metrics over three real connectivity and GPS traces such as Sassy [44], San Francisco Cabs [45] and Infocom 2006 [33]. We show that CafRep performs well, independent of network connectivity and mobility patterns, and consistently outperforms the state-of-the-art DTN forwarding algorithms in the face of increasing rates of congestion. CafRep maintains higher availability and success ratios while keeping low delays, packet loss rates and delivery cost. We test CafRep in the presence of two application scenarios, with fixed rate traffic and with real world Facebook application traffic demands, showing that regardless of the type of traffic CafRep aims to deliver, it reduces congestion and improves forwarding performance

6 November 2005
Verified
Conference Paper
Open access
PDF file
MCMauricio Capra
Mauricio Capra
MRMilena Radenkovic
Milena Radenkovic
SBSteve Benford
Steve Benford
LOLeif Oppermann
Leif Oppermann
ADAdam Drozd
Adam Drozd
MFMartin Flintham
Martin Flintham
Pervasive gaming is a new form of multimedia entertainment that extends the traditional computer gaming experience out into the real world. Through a combination of personal devices, positioning systems and other multimedia sensors, combined with wireless networking, a pervasive game can respond to a player’s movements and context and enable them to communicate with a game server and other players. We review recent examples of pervasive games in order to explain their distinctive characteristics as multimedia applications. We then consider the challenge of scaling pervasive games to include potentially very large numbers of players. We propose a new approach based upon a campaign model in which individuals, local groups and experts draw on a combination of pervasive games, online services and broadcasting to take part in national or even global events. We discuss the challenges that this raises for further researc

13 November 2017 in Information & Computer Security
Verified
Journal Article
Closed access
JAJoyce Hoese Addae
Joyce Hoese Addae
MBMatthew Francis Brown
Matthew Francis Brown
Xu SunXu Sun
Xu Sun
DTDavid Peter Towey
David Peter Towey
MRMilena Radenkovic
Milena Radenkovic
Purpose: This paper presents an initial development of a personal data attitude (PDA) measurement instrument based on established psychometric principles. The aim of the research was to develop a reliable measurement scale for quantifying and comparing attitudes towards personal data that can be incorporated into cybersecurity behavioural research models. Such a scale has become necessary for understanding individuals’ attitudes towards specific sets of data, as more technologies are being designed to harvest, collate, share and analyse personal data.Design/methodology/approach: An initial set of 34 five-point Likert-style items were developed with eight subscales and administered to participants online. The data collected were subjected to exploratory and confirmatory factor analyses and MANOVA. The results are consistent with the multidimensionality of attitude theories and suggest that the adopted methodology for the study is appropriate for future research with a more representative sample.Findings: Factor analysis of 247 responses identified six constructs of individuals’ attitude towards personal data: protective behaviour, privacy concerns, cost-benefit, awareness, responsibility and security. This paper illustrates how the PDA scale can be a useful guide for information security research and design by briefly discussing the factor structure of the PDA and related results.Originality/value: This study addresses a genuine gap in research by taking the first step towards establishing empirical evidence for dimensions underlying personal data attitudes. It also adds a significant benchmark to a growing body of literature on understanding and modelling computer users’ security behaviours.

27 September 2022 in Deep Sea Research Part I: Oceanographic Research Papers
Verified
Journal Article
Closed access
GCGe Chen
Ge Chen
HBHuang Baoxiang
Huang Baoxiang
XCXiaoyan Chen
Xiaoyan Chen
LGLinyao Ge
Linyao Ge
MRMilena Radenkovic
Milena Radenkovic
YMYing Ma
Ying Ma

29 September 2020 in IEEE Access
Verified
Journal Article
Open access
MRMilena Radenkovic
Milena Radenkovic
VHVu San Ha Huynh
Vu San Ha Huynh
Content caching in the current commercial content delivery networks (CDNs) allows reduction of duplicate traffic and improvement of QoS and QoE but it still suffers from surges of content traffic, network congestion, high mobility of users and dynamic users’ content request patterns which may result in high content access latency. With the increasing interest of large companies in providing next-generation mobile edge applications and services that the users can use despite potentially sparse, non-uniform connectivity, it is becoming increasingly important to provide efficient, smart content caching services at the edges to help with scalable storage and processing of local data as well as sharing data both at the edges and in the cloud. We propose a novel multi-agent deep reinforcement learning approach, CognitiveCache, in which edges adaptively learn their best caching policies while collaborating with other neighbouring edges to better understand if they can be usable for cache content placement optimisation problem in dynamic environments. We show that CognitiveCache can respond and adapt to the spatial-temporal locality of dynamically changing content workloads and resources, improve the reliability and scalability of content sharing, enhance QoE for users and decrease operational costs in mobile social community networks. We perform extensive multi-criteria evaluation of our proposal against four benchmark and competitive protocols over two different real-world scenarios in New York and London in the face of different mobility and users’ interest patterns to show that CognitiveCache achieves higher cache hit ratios, lower delays while reducing resource consumption.