Publications

2022

• Bezas, K., Tsoumanis, G., Angelis, C. T., & Oikonomou, K.. (2022). Coverage Path Planning and Point of Interest Detection Using Autonomous Drone Swarms. Sensors.
  [Bibtex]

  @article{bezas2022coverage,
  author = {Bezas, Konstantinos and Tsoumanis, Georgios and Angelis, Constantinos T and Oikonomou, Konstantinos},
  date-added = {2022-09-29 10:12:13 +0300},
  date-modified = {2022-09-29 10:51:36 +0300},
  journal = {Sensors},
  keywords = {own, refereed, accepted, R:IOT:UAV},
  publisher = {MDPI},
  title = {{{Coverage Path Planning and Point of Interest Detection Using Autonomous Drone Swarms}}},
  year = {2022}}

• Dragonas, V., Kallergis, D., Tsoumanis, G., & Oikonomou, K.. (2022). On Utilizing Unused Slots In Topology-Transparent TDMA MAC Policies for Ad Hoc Networks. Paper presented at the 2022 global information infrastructure and networking symposium (giis) (giis’22), Argostoli, Greece.
  [Bibtex]

  @inproceedings{dragonas2022utilizing,
  abstract = {In the age of the Internet of Things, numerous devices of diverse
  characteristics are communicating with each other. The underlying networks
  supporting those communications can either use some sort of infrastructure
  or implement an ad hoc network. For the latter type of networks and
  depending on the application requirements, Topology-Transparent TDMA MAC
  policies can be considered as they are inherently suited for dynamic and
  unstructured topologies. However, such TDMA based schemes may suffer from
  low throughput performance, especially in sparse networks, where a
  significant portion of available
  time slots remains unused.
  To address this challenge, a Topology-Transparent TDMA MAC policy is
  revisited in this paper, which utilizes unused slots by allowing nodes to
  transmit in them under a common and fixed probability p. Additionally, an
  improvement is proposed, where every node can calculate its own individual
  access probability based on information gathered from its local
  neighborhood. Simulation results demonstrate that the use of the individual
  access probability leads to improved performance in terms of system
  throughput. Moreover, the requirement for assigning a value to probability
  p during the network initialization is relaxed, as this value is now
  calculated dynamically and distributively during the network operation.},
  address = {Argostoli, Greece},
  author = {Vasileios Dragonas and Dimitrios Kallergis and Georgios Tsoumanis and Konstantinos Oikonomou},
  booktitle = {2022 Global Information Infrastructure and Networking Symposium (GIIS) (GIIS'22)},
  date-added = {2022-09-28 10:01:04 +0300},
  date-modified = {2022-09-28 10:02:53 +0300},
  keywords = {own, refereed, v-corfu, accepted, R:MAC:TI},
  month = sep,
  title = {{{On Utilizing Unused Slots In {Topology-Transparent} {TDMA} {MAC} Policies for Ad Hoc Networks}}},
  year = 2022}

• Tsipis, A., Fanarioti, S., Komianos, V., Sioutas, S., & Oikonomou, K.. (2022). A Study on Robustness for the Single Server Location in Distributed Interactive Applications. Paper presented at the 2022 global information infrastructure and networking symposium (giis) (giis’22), Argostoli, Greece.
  [Bibtex]

  @inproceedings{tsipis2022robustness,
  abstract = {In distributed interactive application ecosystems, service provision and
  availability are key factors for the end user's perceived quality.
  Therefore, the location of any server facility is important from the
  provider's standpoint for efficient capital expenditure. Given the
  dynamicity of such environments (e.g., due to traffic load variance over
  time), modeling this challenge as a median problem may require the
  continuous calculation of the optimal location. To address this robustness
  issue, a new robustness metric is introduced here for the case of the
  single server in edge computing, which depends on the overall delay
  experienced by the data traffic. Moreover, the smallest eigenvalue of the
  median matrix is considered as an alternative means for measuring this
  robustness. Using trace-driven simulation results, it is demonstrated that
  there is indeed a relationship between the proposed robustness metric and
  the smallest eigenvalue for the under consideration environment.},
  address = {Argostoli, Greece},
  author = {Athanasios Tsipis and Sofia Fanarioti and Vasileios Komianos and Spyros Sioutas and Konstantinos Oikonomou},
  booktitle = {2022 Global Information Infrastructure and Networking Symposium (GIIS) (GIIS'22)},
  date-added = {2022-09-27 16:26:43 +0300},
  date-modified = {2022-09-28 09:52:23 +0300},
  keywords = {own, refereed, v-corfu, accepted,R:SA,R:CF:CG},
  month = sep,
  title = {{{A Study on Robustness for the Single Server Location in Distributed Interactive Applications}}},
  year = 2022}

• Papamichail, A., Tsipis, A., Tsoumanis, G., & Oikonomou, K.. (2022). Study of a Proposed Spectral-based Approach for Facility Location in Tree Topologies. Paper presented at the 2022 global information infrastructure and networking symposium (giis) (giis’22), Argostoli, Greece.
  [Bibtex]

  @inproceedings{papamichail2022study,
  abstract = {The wide proliferation of smart devices in the emerging Internet of Things
  (IoT) networking environment necessitates a revisit to the facility
  location problems, i.e., where to locate a certain service facility in
  order to minimize a corresponding cost function (e.g., minimize energy
  consumption in wireless sensor network by selecting a suitable location for
  the sink). To address this problem for a single facility, a spectral-based
  approach is presented in this paper for tree topologies considering the
  principal eigenvector of the distance matrix and the aggregate traffic
  loads. It was observed using simulation that even for those cases that the
  proposed approach does not produce the optimal location (i.e., the solution
  of the \textit{median} problem), the corresponding cost is still close to
  the minimum.},
  address = {Argostoli, Greece},
  author = {Asterios Papamichail and Athanasios Tsipis and Georgios Tsoumanis and Konstantinos Oikonomou},
  booktitle = {2022 Global Information Infrastructure and Networking Symposium (GIIS) (GIIS'22)},
  date-added = {2022-09-27 16:16:21 +0300},
  date-modified = {2022-09-27 16:17:34 +0300},
  keywords = {own, refereed, v-corfu, accepted,R:SA},
  month = sep,
  title = {{{Study of a Proposed Spectral-based Approach for Facility Location in Tree Topologies}}},
  year = 2022}

• Dragonas, V., Tsoumanis, G., & Oikonomou, K.. (2022). A Probabilistic Refined Policy For Topology Independent Medium Access Control In Ad Hoc Network Environments. Itu journal on future and evolving technologies – emerging trends and applications in future communication networks, 3(2), 483–497.
  [Bibtex]

  @article{dragonas2022refined,
  abstract = {Modern network environments are starting to engulf billions of different
  interconnected devices that support a wide range of applications. Depending
  on the case, these environments range from static (e.g., wireless sensors)
  to highly dynamic (e.g., vehicular networks) with respect to topology
  changes and have different constraints for throughput, time delay, energy
  consumption etc. Supporting such applications in a topology varying ad hoc
  environment is a challenging task. Thus, TDMA-based MAC policies are
  revisited here and a new policy, i.e., the Refined Policy, is proposed that
  builds and improves on the topology-independent policies that appear in the
  literature. In particular, an individual access probability is introduced
  that is distributively calculated by each node to access time slots that
  may result to collisions, but if not then unused network resources will be
  utilized, thus, increasing throughput. The key idea under the Refined
  Policy is to identify and refrain from transmitting during slots that
  collisions are likely to appear. An analytical expression for the
  individual access probability is also derived here. It is also shown
  through simulation experiments that energy consumption is also reduced in
  addition to throughput incremented under the proposed policy.},
  author = {Dragonas, Vasileios and Tsoumanis, Georgios and Oikonomou, Konstantinos},
  date-added = {2022-09-27 16:01:39 +0300},
  date-modified = {2022-10-04 18:08:16 +0300},
  doi = {10.52953/WSYN6375},
  journal = {ITU Journal on Future and Evolving Technologies - Emerging trends and applications in future communication networks},
  keywords = {own, refereed, v-corfu, R:MAC:TI, R:IOT:VE},
  month = {9},
  number = {2},
  pages = {483--497},
  title = {{{A Probabilistic Refined Policy For Topology Independent Medium Access Control In Ad Hoc Network Environments}}},
  volume = {3},
  year = 2022,
  Bdsk-Url-1 = {https://doi.org/10.52953/WSYN6375}}

• Tsipis, A., Komianos, V., Oikonomou, K., & Stavrakakis, I.. (2022). Towards Fairness and QoE Based Edge Allocation for Multiplayer Virtual Reality Applications in Edge Computing. Itu journal on future and evolving technologies – digital continuum and next generation networks.
  [Bibtex]

  @article{tsipis2022towards,
  abstract = {Edge computing has emerged as the next big thing in distributed computing,
  by extending the cloud paradigm and offering efficient ways to engage with
  latency-intolerant applications, such as Virtual Reality (VR) multiplayer
  games. In edge computing, the service providers can benefit from existing
  cellular infrastructure to deploy services on edge servers that reside in
  close proximity to the users. Given the limited available budget for edge
  resource investment, one fundamental problem that manifests is the
  discovery of a prudent edge allocation strategy, that will efficiently
  prescribe which users are assigned to which edge servers, in order to
  tackle application-specific requirements, like minimizing system deployment
  cost. In this paper, considering the frequent interactions and view
  inconsistencies occurring among multiple users immersed in the same VR
  game, we address the problem from the users' perspective, focusing on
  improving their edge admission rate, resource provisioning and overall
  fairness, in order to subsequently maximize the average Quality of
  Experience (QoE). We call this the ``Fairness and QoE Based Edge
  Allocation'' (FQEA) problem, formally formulating its properties and
  theoretically proving its complexity. However, discovering optimal
  solutions to the NP-hard FQEA in large-scale VR scenarios is challenging.
  Hence, we propose FQEA-H, a heuristic algorithm to generate allocation
  strategies in a reasonable time. Comprehensive simulations, conducted on a
  real-world topological trace, demonstrate how FQEA-H can tackle the problem
  effectively, generally outperforming both the baseline and state-of-the-art
  alternatives.},
  author = {Tsipis, Athanasios and Komianos, Vasileios and Oikonomou, Konstantinos and Stavrakakis, Ioannis},
  date-added = {2022-09-27 15:57:16 +0300},
  date-modified = {2022-09-27 15:59:02 +0300},
  journal = {ITU Journal on Future and Evolving Technologies - Digital Continuum and Next Generation Networks},
  keywords = {own, refereed, v-corfu, R:CF:CG},
  title = {{{Towards Fairness and {QoE} Based Edge Allocation for Multiplayer Virtual Reality Applications in Edge Computing}}},
  year = 2022}

• Karatzas, A., Karras, A., Karras, C., Giotopoulos, K. C., Oikonomou, K., & Sioutas, S.. (2022). On Autonomous Drone Navigation Using Deep Learning and an Intelligent Rainbow DQN Agent. Paper presented at the Intelligent data engineering and automated learning – ideal 2022.
  [Bibtex]

  @inproceedings{karatzas2022autonomous,
  author = {Karatzas, Andreas and Karras, Aristeidis and Karras, Christos and Giotopoulos, Konstantinos C. and Oikonomou, Konstantinos and Sioutas, Spyros},
  booktitle = {Intelligent Data Engineering and Automated Learning -- IDEAL 2022},
  date-added = {2022-09-27 15:44:54 +0300},
  date-modified = {2022-11-23 10:09:01 +0200},
  editor = {Yin, Hujun and Camacho, David and Tino, Peter},
  keywords = {own, refereed, R:IOT:UAV},
  pages = {134--145},
  publisher = {Springer International Publishing},
  title = {{{On Autonomous Drone Navigation Using Deep Learning and an Intelligent Rainbow DQN Agent}}},
  year = {2022},
  Bdsk-Url-1 = {https://doi.org/10.1109/SEEDA-CECNSM.2019.8908532}}

• Karras, A., Karras, C., Giotopoulos, K. C., Tsolis, D., Oikonomou, K., & Sioutas, S.. (2022). Peer to Peer Federated Learning: Towards Decentralized Machine Learning on Edge Devices. Paper presented at the 2022 7th south-east europe design automation, computer engineering, computer networks and social media conference (seeda-cecnsm).
  [Bibtex]

  @inproceedings{karras2022peer,
  author = {Karras, Aristeidis and Karras, Christos and Giotopoulos, Konstantinos C. and Tsolis, Dimitrios and Oikonomou, Konstantinos and Sioutas, Spyros},
  booktitle = {2022 7th South-East Europe Design Automation, Computer Engineering, Computer Networks and Social Media Conference (SEEDA-CECNSM)},
  date-added = {2022-09-27 15:31:50 +0300},
  date-modified = {2022-09-27 15:38:01 +0300},
  keywords = {own, refereed, R:VAR},
  title = {{{Peer to Peer Federated Learning: Towards Decentralized Machine Learning on Edge Devices}}},
  venue = {Ioannina, Greece},
  year = {2022},
  Bdsk-Url-1 = {https://doi.org/10.1109/SEEDA-CECNSM.2019.8908532}}

• Bezas, K., Tsoumanis, G., Koritsoglou, K., Oikonomou, K., Tzallas, A. T., Giannakeas, N., Tsipouras, M., & Angelis, C. T.. (2022). A Fairness-aware Coverage Algorithm for Drone Swarms. Paper presented at the 2022 7th south-east europe design automation, computer engineering, computer networks and social media conference (seeda-cecnsm).
  [Bibtex]

  @inproceedings{bezas2022fairdrone,
  author = {Bezas, Konstantinos and Tsoumanis, Georgios and Koritsoglou, Kyriakos and Oikonomou, Konstantinos and Tzallas, Alexandros T and Giannakeas, Nikolaos and Tsipouras, Markos and Angelis, Constantinos T},
  booktitle = {2022 7th South-East Europe Design Automation, Computer Engineering, Computer Networks and Social Media Conference (SEEDA-CECNSM)},
  date-added = {2022-09-27 15:24:46 +0300},
  date-modified = {2022-09-27 15:24:46 +0300},
  keywords = {own, refereed, R:IOT:UAV},
  title = {{{A Fairness-aware Coverage Algorithm for Drone Swarms}}},
  venue = {Ioannina, Greece},
  year = {2022},
  Bdsk-Url-1 = {https://doi.org/10.1109/SEEDA-CECNSM.2019.8908532}}

• Maidatsi, K., Christopoulou, E., & Oikonomou, K.. (2022). Using STEM Learning Concepts with IoT Technology on the Road of Education for Sustainability: A Short Literature Review. Paper presented at the 2022 7th south-east europe design automation, computer engineering, computer networks and social media conference (seeda-cecnsm).
  [Bibtex]

  @inproceedings{maidatsi2022stem,
  author = {Maidatsi, Konstantina and Christopoulou, Eleni and Oikonomou, Konstantinos},
  booktitle = {2022 7th South-East Europe Design Automation, Computer Engineering, Computer Networks and Social Media Conference (SEEDA-CECNSM)},
  date-added = {2022-09-27 15:06:55 +0300},
  date-modified = {2022-09-27 15:30:40 +0300},
  keywords = {own, refereed, R:VAR},
  title = {{{Using STEM Learning Concepts with IoT Technology on the Road of Education for Sustainability: A Short Literature Review}}},
  venue = {Ioannina, Greece},
  year = {2022},
  Bdsk-Url-1 = {https://doi.org/10.1109/SEEDA-CECNSM.2019.8908532}}

• Tsipis, A., Komianos, V., & Oikonomou, K.. (2022). Fairness-Oriented Edge Allocation for Interactive Group Gaming in Edge Computing. Paper presented at the 2022 13th international conference on information, intelligence, systems and applications (iisa).
  [Bibtex]

  @inproceedings{tsipis2022fairness,
  abstract = {The construction of Connected Dominating Sets (CDS) in order to provide virtual backbones over low-cost wireless networks and facilitate the operation of intelligent services in smart tourism environments is a challenging task. In these kinds of environments, heterogenous networks are usually encountered, consisting of a wide variety of devices, ranging from data centers to Internet of Things devices and sensors. As such, each individual system's performance needs to be taken into account during the construction of the virtual backbone network, in order to maximize its efficiency based on the requirements of a considered service. To accomplish this, each node in the network is characterized by an appropriateness parameter, which indicates how appropriate a node is for a requested virtual backbone network. An algorithm for the construction of a CDS is extended to take this parameter into account. A low-cost wireless network installed in a university campus is used as an experimental testbed to evaluate the effectiveness of the proposed approach. The obtained results show that the proposed approach is capable of constructing appropriate virtual backbone networks for smart tourism services which add reduced network overhead.},
  author = {Tsipis, Athanasios and Komianos, Vasileios and Oikonomou, Konstantinos},
  booktitle = {2022 13th International Conference on Information, Intelligence, Systems and Applications (IISA)},
  date-added = {2022-06-22 13:16:53 +0300},
  date-modified = {2022-06-22 13:18:37 +0300},
  keywords = {own, refereed, v-corfu, R:CF:CG},
  title = {{{Fairness-Oriented Edge Allocation for Interactive Group Gaming in Edge Computing}}},
  venue = {Corfu, Greece},
  year = {2022},
  Bdsk-Url-1 = {https://doi.org/10.1109/IISA.2019.8900750}}

• Tsipis, A., & Oikonomou, K.. (2022). Joint optimization of social interactivity and server provisioning for interactive games in edge computing. Computer networks, 212, 109028.
  [Bibtex]

  @article{tsipis2022joint,
  abstract = {Distributed interactive applications (DIAs), like immersive virtual reality and multiplayer cloud games, where players team-up and form social communities to participate in collaborative virtual events, dominate the modern cloud multimedia industry. Still, due to the massive workload, intensive graphics processing and delay intolerance, conventional cloud-only models are increasingly becoming ineffective. Thankfully, with the shift towards Mobile Edge Computing, game providers can leverage existing cellular infrastructure to deploy edge servers that supply gaming services in a highly accessible fashion. One fundamental challenge, that naturally arises, is the discovery of the most suitable player-to-edge server assignment strategy, that achieves a balanced trade-off between conflicting objectives that refer to high social interactivity on the one hand and low-cost server provisioning on the other. In this article, the core properties of social interactivity for gaming DIAs are investigated through formal formulation under diverse social aspects and strict assignment rules, respecting, in the meantime, the provisioning cost and constraints of the edge servers. We call this the ``Social Interactivity-oriented Edge Allocation'' (SIEA) problem and prove its NP-hardness. Based on our theoretical analysis, we present SIEA-H, a two-phase heuristic algorithm to efficiently assign players to servers and then iteratively refine the edge allocation strategy. SIEA-H is evaluated using comprehensive trace-driven simulations. The results demonstrate how it surpasses the baseline and state-of-the-art assignment alternatives in reducing the total cost, especially as the number of servers and their capacity grows, or the coverage area expands, while for players it exhibits the highest admission rate and the best overall resource management.},
  author = {Athanasios Tsipis and Konstantinos Oikonomou},
  date-added = {2022-06-04 15:18:31 +0300},
  date-modified = {2022-06-04 15:35:26 +0300},
  doi = {https://doi.org/10.1016/j.comnet.2022.109028},
  issn = {1389-1286},
  journal = {Computer Networks},
  keywords = {own, refereed, v-corfu, exceptional,R:CF:CG},
  pages = {109028},
  title = {Joint optimization of social interactivity and server provisioning for interactive games in edge computing},
  volume = {212},
  year = {2022},
  Bdsk-Url-1 = {https://www.sciencedirect.com/science/article/pii/S1389128622001840},
  Bdsk-Url-2 = {https://doi.org/10.1016/j.comnet.2022.109028}}

• Oikonomou, K.. (2022). A Spectrum Analysis Approach for the Median Problem in Modern Network Environments. Paper presented at the 2022 ieee symposium on computers and communications (iscc).
  [Bibtex]

  @inproceedings{oikonomou2022spectrum,
  abstract = {Service facility location is a challenging problem in the emerging dynamic modern network environments of increased number of users, devices, and supported applications.
  Under this perspective, the \textit{median problem} is revisited here from a spectrum analysis point of view. More specifically, a \textit{median matrix} depending on the network topology and the traffic requirements of the network nodes is introduced and studied in this paper. An analytical investigation of its spectral properties reveals that the minimum elements of its \textit{principal eigenvector} correspond to the solution of the median problem.
  The smallest eigenvalue is also studied through simulations to demonstrate the effectiveness of the spectrum analysis approach introduced in this paper.
  Moreover, its relation to a metric related to the robustness of the median solution is investigated, thus shedding further light on the particulars of facility location problems.},
  author = {Oikonomou, Konstantinos},
  booktitle = {2022 IEEE Symposium on Computers and Communications (ISCC)},
  date-added = {2022-02-22 11:28:25 +0200},
  date-modified = {2022-07-16 10:11:58 +0300},
  keywords = {own, refereed, v-corfu, exceptional, accepted,R:SA},
  month = {6},
  title = {{{A Spectrum Analysis Approach for the Median Problem in Modern Network Environments}}},
  venue = {Rhodes, Greece},
  year = {2022},
  Bdsk-Url-1 = {https://doi.org/10.1109/ISCC53001.2021.9631480}}

• Oikonomou, K., Koufoudakis, G., Aïssa, S., & Stavrakakis, I.. (2022). Probabilistic Flooding Performance Analysis Exploiting Graph Spectra Properties. Ieee/acm transactions on networking, 1-14.
  [Bibtex]

  @article{oikonomou2022probabilistic,
  abstract = {The effectiveness of service provisioning in large-scale networks is highly dependent on the number and location of service facilities deployed at various hosts. The classical, centralized approach to determining the latter would amount to formulating and solving the uncapacitated k-median (UKM) problem (if the requested number of facilities is fixed- k) or the uncapacitated facility location (UFL) problem (if the number of facilities is also to be optimized). Clearly, such centralized approaches require knowledge of global topological and demand information, and thus do not scale and are not practical for large networks. The key question posed and answered in this paper is the following: ``How can we determine in a distributed and scalable manner the number and location of service facilities?'' In this paper, we develop a scalable and distributed approach that answers our key question through an iterative reoptimization of the location and the number of facilities within network neighborhoods. We propose an innovative approach to migrate, add, or remove servers within limited-scope network neighborhoods by utilizing only local information about the topology and demand. We show that even with limited information about the network topology and demand, within one or two hops, our distributed approach achieves performance, under various synthetic and real Internet topologies and workloads, that is comparable to that of optimal, centralized approaches requiring full topology and demand information. We also show that it is responsive to volatile demand. Our approach leverages recent advances in virtualization technology toward an automated placement of services on the Internet.},
  author = {Oikonomou, Konstantinos and Koufoudakis, George and A{\"i}ssa, Sonia and Stavrakakis, Ioannis},
  date-modified = {2022-12-09 12:06:29 +0200},
  doi = {10.1109/TNET.2022.3192310},
  journal = {IEEE/ACM Transactions on Networking},
  keywords = {own, sonia, exceptional, refereed, R:ID:LE,R:SA},
  pages = {1-14},
  title = {{{{Probabilistic Flooding Performance Analysis Exploiting Graph Spectra Properties}}}},
  year = {2022},
  Bdsk-Url-1 = {https://doi.org/10.1109/TNET.2013.2270440}}

2021

• Karagiannis, S., & Magkos, E.. (2021). Engaging students in basic cybersecurity concepts using digital game-based learning: computer games as virtual learning environments. In Advances in core computer science-based technologies (pp. 55–81). Springer, cham.
  [Bibtex]

  @incollection{karagiannis2021engaging,
  title={Engaging Students in Basic Cybersecurity Concepts Using Digital Game-Based Learning: Computer Games as Virtual Learning Environments},
  author={Karagiannis, Stylianos and Magkos, Emmanouil},
  booktitle={Advances in Core Computer Science-Based Technologies},
  pages={55--81},
  year={2021},
  publisher={Springer, Cham}
  }

• PIRAS, L., AL-OBEIDALLAH, M. G., PAVLIDIS, M., MOURATIDIS, H., TSOHOU, A., MAGKOS, E., & PRAITANO, A.. (2021). A data scope management service to support privacy by design and gdpr compliancea. Journal of data intelligence, 2(2), 136–165.
  [Bibtex]

  @article{piras2021data,
  title={A DATA SCOPE MANAGEMENT SERVICE TO SUPPORT PRIVACY BY DESIGN AND GDPR COMPLIANCEa},
  author={PIRAS, LUCA and AL-OBEIDALLAH, MOHAMMED GHAZI and PAVLIDIS, MICHALIS and MOURATIDIS, HARALAMBOS and TSOHOU, AGGELIKI and MAGKOS, EMMANOUIL and PRAITANO, ANDREA},
  journal={Journal of Data Intelligence},
  volume={2},
  number={2},
  pages={136--165},
  year={2021}
  }

• Tsipis, A., & Oikonomou, K.. (2021). Player Assignment in MEC Gaming for Social Interactivity and Server Provisioning Optimization. Paper presented at the 2021 ieee symposium on computers and communications (iscc).
  [Bibtex]

  @inproceedings{tsipis2021player,
  author = {Tsipis, Athanasios and Oikonomou, Konstantinos},
  booktitle = {2021 IEEE Symposium on Computers and Communications (ISCC)},
  date-added = {2022-05-04 11:20:19 +0300},
  date-modified = {2022-05-04 11:22:59 +0300},
  doi = {10.1109/ISCC53001.2021.9631480},
  keywords = {own, refereed, v-corfu, exceptional,R:CF:CG},
  month = {9},
  pages = {1-7},
  title = {{{Player Assignment in MEC Gaming for Social Interactivity and Server Provisioning Optimization}}},
  venue = {Athens, Greece},
  year = {2021},
  Bdsk-Url-1 = {https://doi.org/10.1109/ISCC53001.2021.9631480}}

• Zervopoulos, A., & Oikonomou, K.. (2021). A Migration-Based Approach for the SDN Controller Placement Problem in Tree Topologies. Paper presented at the 2021 international balkan conference on communications and networking (balkancom), Novi Sad, Serbia.
  [Bibtex]

  @inproceedings{zervopoulos2021software,
  abstract = {The advent of Software-Defined Networking (SDN) brings about a major shift
  in network management but also introduces various challenges, like
  scalability, giving rise to physically distributed approaches towards a
  logically centralized controller. When deploying multiple controllers,
  where to place them in the network in order to minimize response times and
  overhead is an issue that naturally arises.
  This has been termed as the Controller Placement Problem (CPP). The CPP can
  be viewed as an extension of the k-median problem, if the number of
  controllers is known. However, unlike the k-median problem, assigning
  switches to the available controllers is a challenging task, as even the
  reassignment of a single switch can affect the performance of others. In
  this work, the CPP is studied in the context of tree topologies, where it
  is shown that reassigning a switch only affects its directly adjacent
  switches. Additionally, a migration-based approach for solving the CPP is
  considered, consisting of two parts: (i) the controller migration policy;
  and (ii) the switch migration policy. The controller migration policy is
  based on an existing service migration approach, whereas two different
  switch migration policies are proposed and studied in this paper.
  Simulation results demonstrate that in tree topologies, switch migrations
  offer limited benefit. This is attributed to the limited opportunities for
  switch migration that arise because of the topological aspects of trees. On
  the other hand, the controller migration policy suffices to closely
  approximate optimal solutions.},
  address = {Novi Sad, Serbia},
  author = {Alexandros Zervopoulos and Konstantinos Oikonomou},
  booktitle = {2021 International Balkan Conference on Communications and Networking (BalkanCom)},
  date-added = {2021-08-31 16:44:35 +0300},
  date-modified = {2021-12-06 10:47:19 +0200},
  doi = {10.1109/BalkanCom53780.2021.9593218},
  keywords = {own, refereed, v-corfu, R:CF:FL},
  month = 9,
  pages = {127-132},
  title = {{{A {Migration-Based} Approach for the {SDN} Controller Placement Problem in Tree Topologies}}},
  year = 2021,
  Bdsk-Url-1 = {https://doi.org/10.1109/BalkanCom53780.2021.9593218}}

• Bezas, K., Oikonomou, K., & Tsoumanis, G.. (2021). A Coverage Path Planning Algorithm for Self-Organizing Drone Swarms. Paper presented at the 2021 international balkan conference on communications and networking (balkancom), Novi Sad, Serbia.
  [Bibtex]

  @inproceedings{bezas2021coverage,
  abstract = {Drone swarms are employed for multiple applications nowadays, such as early
  detection of forest fires, disaster response missions etc., area coverage
  being the main hurdle these applications face. In this work, an algorithm
  is proposed for drone swarms that achieves full area coverage and Point of
  Interest (PoI) detection with no decomposition for areas with simple
  polygon shapes and no obstacles. It employs small pieces of information
  that are exchanged among the swarm drones in real-time. Parallel lines and
  spiral coverage paths are examined in terms of the number of slowdowns in
  the swarms speed to fully collect information from a detected PoI, the
  scanned PoIs, and the formation switches that are executed when the swarm
  has to alter its flying direction. Simulations are developed for a square
  area shape. The results showcase that the parallel coverage path is more
  efficient in terms of cover time and travel distance compared to the
  spiral. The parallel coverage requires less slowdowns for the same
  percentage of scanned PoIs.},
  address = {Novi Sad, Serbia},
  author = {Konstantinos Bezas and Konstantinos Oikonomou and Georgios Tsoumanis},
  booktitle = {2021 International Balkan Conference on Communications and Networking (BalkanCom)},
  date-added = {2021-08-31 16:43:06 +0300},
  date-modified = {2021-12-06 10:41:21 +0200},
  doi = {10.1109/BalkanCom53780.2021.9593145},
  keywords = {own, refereed, v-corfu, R:ID:DS, R:IOT:UAV},
  month = 9,
  pages = {122-126},
  title = {{{A Coverage Path Planning Algorithm for {Self-Organizing} Drone Swarms}}},
  year = 2021,
  Bdsk-Url-1 = {https://doi.org/10.1109/BalkanCom53780.2021.9593145}}

• Skiadopoulos, K., Tsipis, A., & Oikonomou, K.. (2021). Constructing Budget Connected Dominating Sets in Large-Scale IoT Network Environments. Paper presented at the 2021 international balkan conference on communications and networking (balkancom), Novi Sad, Serbia.
  [Bibtex]

  @inproceedings{skiadopoulos2021constructing,
  abstract = {Several critical operations depend on various types of information
  dissemination in the Internet of Things (IoT) networks. To avoid costly
  flooding-based solutions in these typically large-scale network
  environments, it is frequently sufficient enough to involve only a proper
  subset of the nodes (or backbone network), ensuring that every other node
  will be at most d hops away from a node belonging to the specific subset,
  i.e., a connected dominating set (CDS). In many cases, the outputted CDS
  size is upper bounded by a specific physical requirement or constraints
  relating to the limited available processing and memory capacities of the
  IoT nodes. Thus, a budget parameter k is frequently introduced as an upper
  bound for the number of nodes comprising the CDS, leading to the creation
  of a Budget Connected Dominating Set (BCDS). In this work, a novel
  distributed algorithm for constructing a BCDS is proposed based on
  information available d hops away from the network nodes, assuming an upper
  budget k limit regarding its final size. An additional upper bound
  parameter relating to the number of sent messages for each node, i.e., the
  stop, is also for the first time utilized. It is shown using simulation
  results that when stop is employed, a BCDS with increased coverage (i.e.,
  the fraction of nodes at most d hops away from the BCDS nodes) is
  constructed under the proposed algorithm.},
  address = {Novi Sad, Serbia},
  author = {Konstantinos Skiadopoulos and Athanasios Tsipis and Konstantinos Oikonomou},
  booktitle = {2021 International Balkan Conference on Communications and Networking (BalkanCom)},
  date-added = {2021-08-31 16:41:21 +0300},
  date-modified = {2021-12-06 10:45:31 +0200},
  doi = {10.1109/BalkanCom53780.2021.9593243},
  keywords = {own, refereed, v-corfu, R:ID:DS, R:IOT:UAV},
  month = 9,
  pages = {75-79},
  title = {{{Constructing Budget Connected Dominating Sets in {Large-Scale} {IoT} Network Environments}}},
  year = 2021,
  Bdsk-Url-1 = {https://doi.org/10.1109/BalkanCom53780.2021.9593243}}

• Dragonas, V., Tsoumanis, G., & Oikonomou, K.. (2021). A Refined Topology-Independent Probabilistic TDMA MAC Policy for Ad Hoc Networks. Paper presented at the 2021 international balkan conference on communications and networking (balkancom), Novi Sad, Serbia.
  [Bibtex]

  @inproceedings{dragonas2021refined,
  abstract = {Entering the age of the Internet of Things, millions of devices with
  different requirements and diverse characteristics will soon be
  interconnected. This interconnection, depending on the scenario, can be
  achieved either through the cloud or by implementing an ad hoc network.
  Frequent topology changes and energy consumption issues create the need for
  researching new MAC Policies that are better suited to tackle the
  aforementioned problems.
  In this paper a TDMA Medium Access Control Policy for wireless ad hoc
  networks is proposed which is unaware of the underlying topology. The
  proposed policy is based on an already existing topology-independent policy
  which utilizes the non-assigned TDMA slots by means of transmitting during
  them probabilistically. The policy suggested here tries to improve by
  identifying transmissions that have a high chance of creating collisions.
  Experimental results show that the proposed policy achieves better
  performance in terms of system throughput and at the same time achieves
  fewer total transmissions, thus contributing in energy conservation.},
  address = {Novi Sad, Serbia},
  author = {Dragonas, Vasileios and Tsoumanis, Georgios and Oikonomou, Konstantinos},
  booktitle = {2021 International Balkan Conference on Communications and Networking (BalkanCom)},
  date-added = {2021-08-31 16:38:17 +0300},
  date-modified = {2022-09-27 16:04:34 +0300},
  doi = {10.1109/BalkanCom53780.2021.9593134},
  keywords = {own, refereed, v-corfu, R:MAC:TI, R:IOT:VE},
  month = 9,
  pages = {61-65},
  title = {{{A Refined {Topology-Independent} Probabilistic {TDMA} {MAC} Policy for Ad Hoc Networks}}},
  year = 2021,
  Bdsk-Url-1 = {https://doi.org/10.1109/BalkanCom53780.2021.9593134}}

• Vergis, S., Tsoumanis, G., & Oikonomou, K.. (2021). A Proposed Multi-Head Clustering Algorithm for VANET Environments. Paper presented at the 2021 6th south-east europe design automation, computer engineering, computer networks and social media conference (seeda-cecnsm).
  [Bibtex]

  @inproceedings{vergis2021proposed,
  author = {Vergis, Spiridon and Tsoumanis, Georgios and Oikonomou, Konstantinos},
  booktitle = {2021 6th South-East Europe Design Automation, Computer Engineering, Computer Networks and Social Media Conference (SEEDA-CECNSM)},
  date-added = {2021-08-31 16:06:34 +0300},
  date-modified = {2021-12-06 10:46:55 +0200},
  doi = {10.1109/SEEDA-CECNSM53056.2021.9566263},
  keywords = {own, refereed, v-corfu,R:IOT:SC},
  month = {9},
  pages = {1-8},
  title = {{{A Proposed Multi-Head Clustering Algorithm for VANET Environments}}},
  venue = {Piraeus, Greece},
  year = {2021},
  Bdsk-Url-1 = {https://doi.org/10.1109/SEEDA-CECNSM.2019.8908532}}

• Tsipis, A., Komianos, V., & Oikonomou, K.. (2021). Distributed Computing Paradigms for Optimization of Mixed Reality Applications in Digital Culture. Paper presented at the Dcac 2021: 3rd international conference on digital culture & audiovisual challenges, interdisciplinary creativity in arts and technology.
  [Bibtex]

  @inproceedings{tsipis2021distributed,
  author = {Tsipis, Athanasios and Komianos, Vasileios and Oikonomou, Konstantinos},
  booktitle = {DCAC 2021: 3rd International Conference on Digital Culture \& AudioVisual Challenges, Interdisciplinary Creativity in Arts and Technology},
  date-added = {2021-08-31 16:00:36 +0300},
  date-modified = {2021-12-06 10:45:54 +0200},
  issn = {null},
  keywords = {own, refereed, v-corfu, accepted, R:VR},
  month = {5},
  title = {{{Distributed Computing Paradigms for Optimization of Mixed Reality Applications in Digital Culture}}},
  venue = {Preveza, Greece},
  year = {2021},
  Bdsk-Url-1 = {https://doi.org/10.1109/SEEDA-CECNSM.2019.8908532}}

• Tsipis, A., & Oikonomou, K.. (2021). ARPA: An autonomous renderer placement algorithm in distributed multimedia fog networks with delay guarantees. Itu journal on future and evolving technologies (itu j-fet), 2(2).
  [Bibtex]

  @article{tsipis2021arpa,
  abstract = {Internet of Things (IoT) appliances, especially those realized through wireless sensor networks (WSNs), have been a dominant subject for heavy research in the environmental and agricultural sectors. To address the ever-increasing demands for real-time monitoring and sufficiently handle the growing volumes of raw data, the cloud/fog computing paradigm is deemed a highly promising solution. This paper presents a WSN-based IoT system that seamlessly integrates all aforementioned technologies, having at its core the cloud/fog hybrid network architecture. The system was intensively validated using a demo prototype in the Ionian University facilities, focusing on response time, an important metric of future smart applications. Further, the developed prototype is able to autonomously adjust its sensing behavior based on the criticality of the prevailing environmental conditions, regarding one of the most notable climate hazards, wildfires. Extensive experimentation verified its efficiency and reported on its alertness and highly conforming characteristics considering the use-case scenario of Corfu Island\'s 2019 fire risk severity. In all presented cases, it is shown that through fog leveraging it is feasible to contrive significant delay reduction, with high precision and throughput, whilst controlling the energy consumption levels. Finally, a user-driven web interface is highlighted to accompany the system; it is capable of augmenting the data curation and visualization, and offering real-time wildfire risk forecasting based on Chandler\'s burning index scoring.},
  author = {Tsipis, Athanasios and Oikonomou, Konstantinos},
  date-added = {2020-07-24 18:50:09 +0300},
  date-modified = {2022-06-01 12:39:06 +0300},
  doi = {https://www.itu.int/en/journal/j-fet},
  issn = {2616-8375},
  journal = {ITU Journal on Future and Evolving Technologies (ITU J-FET)},
  keywords = {own, refereed, v-corfu, R:CF:CG},
  number = {2},
  title = {{{{ARPA: An autonomous renderer placement algorithm in distributed multimedia fog networks with delay guarantees}}}},
  url = {https://www.itu.int/pub/S-JNL-VOL2.ISSUE2-2021-A06},
  volume = {2},
  year = {2021},
  Bdsk-Url-1 = {https://www.itu.int/pub/S-JNL-VOL2.ISSUE2-2021-A06},
  Bdsk-Url-2 = {https://www.itu.int/en/journal/j-fet}}

• Tsoumanis, G., Oikonomou, K., Aïssa, S., & Stavrakakis, I.. (2021). Energy and Distance Optimization in Rechargeable Wireless Sensor Networks. Ieee transactions on green communications and networking, 5(1), 378-391.
  [Bibtex]

  @article{tsoumanis2021energy,
  abstract = {The aim of a mobile recharger operating in a wireless sensor network (WSN) is to keep the network's average consumed energy and covered distance low. As shown in the literature, the covered distance is minimized when the mobile recharger's base is located as per the solution of a median problem, while the network's average energy consumption is minimized as per the solution of a different median problem. In this work, the first problem is analytically investigated, showing that its solution depends on the traffic load and the topology characteristics. Furthermore, it is shown that, under certain conditions, the solution for both problems is identical. These analytical results motivate the introduction of a new on-demand recharging policy, simple to be implemented and depending on local information. The simulation results confirm the analytical findings, showing that the solutions of both median problems are identical under certain conditions in WSN environments. Additionally, the proposed recharging policy is evaluated against a well-known policy that exploits global knowledge, demonstrating its advantage for prolonging network lifetime. For both recharging policies, it is shown that energy consumption and covered distance are minimized when the mobile recharger is initially located at the solution of the said median problems.
  },
  author = {Georgios Tsoumanis and Konstantinos Oikonomou and Sonia A{\"i}ssa and Ioannis Stavrakakis},
  date-added = {2020-06-16 11:38:57 +0300},
  date-modified = {2021-12-05 15:37:47 +0200},
  doi = {10.1109/TGCN.2020.3039338},
  journal = {IEEE Transactions on Green Communications and Networking},
  keywords = {own, refereed, v-corfu, exceptional, sonia,R:ENERGY:FLP},
  month = {3},
  number = {1},
  pages = {378-391},
  title = {{{{Energy and Distance Optimization in Rechargeable Wireless Sensor Networks}}}},
  volume = {5},
  year = {2021},
  Bdsk-Url-1 = {https://doi.org/10.1109/TGCN.2020.3039338}}

• Gournara, C., & Christopoulou, E.. (2021). Designing outdoor museum experiences for city dwellers and tourists. Paper presented at the 3rd international conference digital culture & audiovisual challenges 2021 (dcac 2021).
  [Bibtex]

  @inproceedings{gournara2021designing,
  title={Designing outdoor museum experiences for city dwellers and tourists},
  author={Gournara, Chrysoula and Christopoulou, Eleni},
  booktitle={3rd International Conference Digital Culture & AudioVisual Challenges
  2021 (DCAC 2021)},
  year={2021},
  institution={EasyChair}
  }

• Koutroumpouchos, N., Ntantogian, C., & Xenakis, C.. (2021). Building trust for smart connected devices: the challenges and pitfalls of trustzone. Sensors, 21(2), 520.
  [Bibtex]

  @article{koutroumpouchos2021building,
  title={Building Trust for Smart Connected Devices: The Challenges and Pitfalls of TrustZone},
  author={Koutroumpouchos, Nikolaos and Ntantogian, Christoforos and Xenakis, Christos},
  journal={Sensors},
  volume={21},
  number={2},
  pages={520},
  year={2021},
  publisher={Multidisciplinary Digital Publishing Institute}
  }

• Ntantogian, C., Bountakas, P., Antonaropoulos, D., Patsakis, C., & Xenakis, C.. (2021). Nodexp: node. js server-side javascript injection vulnerability detection and exploitation. Journal of information security and applications, 58, 102752.
  [Bibtex]

  @article{ntantogian2021nodexp,
  title={NodeXP: NOde. js server-side JavaScript injection vulnerability DEtection and eXPloitation},
  author={Ntantogian, Christoforos and Bountakas, Panagiotis and Antonaropoulos, Dimitris and Patsakis, Constantinos and Xenakis, Christos},
  journal={Journal of Information Security and Applications},
  volume={58},
  pages={102752},
  year={2021},
  publisher={Elsevier}
  }

• Lyvas, C., Ntantogian, C., & Xenakis, C.. (2021). [m] allotropism: a metamorphic engine for malicious software variation development. International journal of information security, 1–18.
  [Bibtex]

  @article{lyvas2021m,
  title={[m] allotROPism: a metamorphic engine for malicious software variation development},
  author={Lyvas, Christos and Ntantogian, Christoforos and Xenakis, Christos},
  journal={International Journal of Information Security},
  pages={1--18},
  year={2021},
  publisher={Springer}
  }

• Farao, A., Veroni, E., Ntantogian, C., & Xenakis, C.. (2021). P4g2go: a privacy-preserving scheme for roaming energy consumers of the smart grid-to-go. Sensors, 21(8), 2686.
  [Bibtex]

  @article{farao2021p4g2go,
  title={P4G2Go: A Privacy-Preserving Scheme for Roaming Energy Consumers of the Smart Grid-to-Go},
  author={Farao, Aristeidis and Veroni, Eleni and Ntantogian, Christoforos and Xenakis, Christos},
  journal={Sensors},
  volume={21},
  number={8},
  pages={2686},
  year={2021},
  publisher={Multidisciplinary Digital Publishing Institute}
  }

• Soumelidou, A., & Tsohou, A.. (2021). Towards the creation of a profile of the information privacy aware user through a systematic literature review of information privacy awareness. Telematics and informatics, 101592.
  [Bibtex]

  @article{soumelidou2021towards,
  title={Towards the creation of a Profile of the Information Privacy Aware User through a Systematic Literature review of Information Privacy Awareness},
  author={Soumelidou, Aikaterini and Tsohou, Aggeliki},
  journal={Telematics and Informatics},
  pages={101592},
  year={2021},
  publisher={Pergamon}
  }

• PIRAS, L., AL-OBEIDALLAH, M. G., PAVLIDIS, M., MOURATIDIS, H., TSOHOU, A., MAGKOS, E., & PRAITANO, A.. (2021). A data scope management service to support privacy by design and gdpr compliancea. Journal of data intelligence, 2(2), 136–165.
  [Bibtex]

  @article{piras2021data,
  title={A DATA SCOPE MANAGEMENT SERVICE TO SUPPORT PRIVACY BY DESIGN AND GDPR COMPLIANCEa},
  author={PIRAS, LUCA and AL-OBEIDALLAH, MOHAMMED GHAZI and PAVLIDIS, MICHALIS and MOURATIDIS, HARALAMBOS and TSOHOU, AGGELIKI and MAGKOS, EMMANOUIL and PRAITANO, ANDREA},
  journal={Journal of Data Intelligence},
  volume={2},
  number={2},
  pages={136--165},
  year={2021}
  }

• Papaioannou, T., Tsohou, A., & Karyda, M.. (2021). Forming digital identities in social networks: the role of privacy concerns and self-esteem. Information & computer security.
  [Bibtex]

  @article{papaioannou2021forming,
  title={Forming digital identities in social networks: the role of privacy concerns and self-esteem},
  author={Papaioannou, Thanos and Tsohou, Aggeliki and Karyda, Maria},
  journal={Information \& Computer Security},
  year={2021},
  publisher={Emerald Publishing Limited}
  }

• Karagiannis, S., & Magkos, E.. (2021). Engaging students in basic cybersecurity concepts using digital game-based learning: computer games as virtual learning environments. In Advances in core computer science-based technologies (pp. 55–81). Springer, cham.
  [Bibtex]

  @incollection{karagiannis2021engaging,
  title={Engaging students in basic cybersecurity concepts using digital game-based learning: Computer games as virtual learning environments},
  author={Karagiannis, Stylianos and Magkos, Emmanouil},
  booktitle={Advances in Core Computer Science-Based Technologies},
  pages={55--81},
  year={2021},
  publisher={Springer, Cham}
  }

• Marksteiner, S., Marko, N., Smulders, A., Karagiannis, S., Stahl, F., Hamazaryan, H., Schlick, R., Kraxberger, S., & Vasenev, A.. (2021). A process to facilitate automated automotive cybersecurity testing. Paper presented at the 2021 ieee 93rd vehicular technology conference (vtc2021-spring).
  [Bibtex]

  @inproceedings{marksteiner2021process,
  title={A process to facilitate automated automotive cybersecurity testing},
  author={Marksteiner, Stefan and Marko, Nadja and Smulders, Andre and Karagiannis, Stelios and Stahl, Florian and Hamazaryan, Hayk and Schlick, Rupert and Kraxberger, Stefan and Vasenev, Alexandr},
  booktitle={2021 IEEE 93rd Vehicular Technology Conference (VTC2021-Spring)},
  pages={1--7},
  year={2021},
  organization={IEEE}
  }

• Vielberth, M., Glas, M., Dietz, M., Karagiannis, S., Magkos, E., & Pernul, G.. (2021). A digital twin-based cyber range for soc analysts. Paper presented at the Ifip annual conference on data and applications security and privacy.
  [Bibtex]

  @inproceedings{vielberth2021digital,
  title={A digital twin-based cyber range for SOC analysts},
  author={Vielberth, Manfred and Glas, Magdalena and Dietz, Marietheres and Karagiannis, Stylianos and Magkos, Emmanouil and Pernul, G{\"u}nther},
  booktitle={IFIP Annual Conference on Data and Applications Security and Privacy},
  pages={293--311},
  year={2021},
  organization={Springer, Cham}
  }

• Karagiannis, S., Ntantogian, C., Magkos, E., Ribeiro, L. L., & Campos, L.. (2021). Pocketctf: a fully featured approach for hosting portable attack and defense cybersecurity exercises. Information, 12(8), 318.
  [Bibtex]

  @article{karagiannis2021pocketctf,
  title={PocketCTF: A fully featured approach for hosting portable attack and defense cybersecurity exercises},
  author={Karagiannis, Stylianos and Ntantogian, Christoforos and Magkos, Emmanouil and Ribeiro, Lu{\'\i}s L and Campos, Lu{\'\i}s},
  journal={Information},
  volume={12},
  number={8},
  pages={318},
  year={2021},
  publisher={MDPI}
  }

• Karagiannis, S., Manso, M., Magkos, E., Ribeiro, L. L., & Campos, L.. (2021). Automated and on-demand cybersecurity certification. Paper presented at the 2021 ieee international conference on cyber security and resilience (csr).
  [Bibtex]

  @inproceedings{karagiannis2021automated,
  title={Automated and On-Demand Cybersecurity Certification},
  author={Karagiannis, Stylianos and Manso, Marco and Magkos, Emmanouil and Ribeiro, Lu{\'\i}s L and Campos, Lu{\'\i}s},
  booktitle={2021 IEEE International Conference on Cyber Security and Resilience (CSR)},
  pages={174--179},
  year={2021},
  organization={IEEE}
  }

• Karagiannis, S., Tokatlis, A., Pelekis, S., Kontoulis, M., Doukas, G., Ntanos, C., & Magkos, E.. (2021). A-demo: att&ck documentation, emulation and mitigation operations: deploying and documenting realistic cyberattack scenarios-a rootkit case study. Paper presented at the 25th pan-hellenic conference on informatics.
  [Bibtex]

  @inproceedings{karagiannis2021demo,
  title={A-DEMO: ATT\&CK Documentation, Emulation and Mitigation Operations: Deploying and Documenting Realistic Cyberattack Scenarios-A Rootkit Case Study},
  author={Karagiannis, Stylianos and Tokatlis, Alexandros and Pelekis, Sotiris and Kontoulis, Michael and Doukas, George and Ntanos, Christos and Magkos, Emmanouil},
  booktitle={25th Pan-Hellenic Conference on Informatics},
  pages={328--333},
  year={2021}
  }

2020

• Tsohou, A., Magkos, E., Mouratidis, H., Chrysoloras, G., Piras, L., Pavlidis, M., Debussche, J., Rotoloni, M., & Crespo, B. G.. (2020). Privacy, security, legal and technology acceptance elicited and consolidated requirements for a gdpr compliance platform. Information & computer security.
  [Bibtex]

  @article{tsohou2020privacy,
  title={Privacy, security, legal and technology acceptance elicited and consolidated requirements for a GDPR compliance platform},
  author={Tsohou, Aggeliki and Magkos, Emmanouil and Mouratidis, Haralambos and Chrysoloras, George and Piras, Luca and Pavlidis, Michalis and Debussche, Julien and Rotoloni, Marco and Crespo, Beatriz Gallego-Nicasio},
  journal={Information \& Computer Security},
  year={2020},
  publisher={Emerald Publishing Limited}
  }

• Karagiannis, S., & Magkos, E.. (2020). Engaging students in basic cybersecurity concepts using digital. Advances in core computer science-based technologies: papers in honor of professor nikolaos alexandris, 14, 55.
  [Bibtex]

  @article{karagiannis2020engaging,
  title={Engaging Students in Basic Cybersecurity Concepts Using Digital},
  author={Karagiannis, Stylianos and Magkos, Emmanouil},
  journal={Advances in Core Computer Science-Based Technologies: Papers in Honor of Professor Nikolaos Alexandris},
  volume={14},
  pages={55},
  year={2020},
  publisher={Springer Nature}
  }

• Petrakos, N., Monachos, S., Magkos, E., & Kotzanikolaou, P.. (2020). Design and implementation of an anonymous and secure online evaluation protocol. Electronics, 9(9), 1415.
  [Bibtex]

  @article{petrakos2020design,
  title={Design and Implementation of an Anonymous and Secure Online Evaluation Protocol},
  author={Petrakos, Nikolaos and Monachos, Stefanos and Magkos, Emmanouil and Kotzanikolaou, Panayiotis},
  journal={Electronics},
  volume={9},
  number={9},
  pages={1415},
  year={2020},
  publisher={Multidisciplinary Digital Publishing Institute}
  }

• Magkos, E.. (2020). An analysis and evaluation of open source capture the flag platforms as cybersecurity e-learning tools. Information security education. information security in action: 13th ifip wg, 579, 61.
  [Bibtex]

  @article{magkos2020analysis,
  title={An Analysis and Evaluation of Open Source Capture the Flag Platforms as Cybersecurity e-Learning Tools},
  author={Magkos, Emmanouil},
  journal={INFORMATION SECURITY EDUCATION. INFORMATION SECURITY IN ACTION: 13th Ifip Wg},
  volume={579},
  pages={61},
  year={2020},
  publisher={Springer Nature}
  }

• Piras, L., Al-Obeidallah, M. G., Pavlidis, M., Mouratidis, H., Tsohou, A., Magkos, E., Praitano, A., Iodice, A., & Crespo, B. G.. (2020). Defend dsm: a data scope management service for model-based privacy by design gdpr compliance. Paper presented at the International conference on trust and privacy in digital business.
  [Bibtex]

  @inproceedings{piras2020defend,
  title={DEFeND DSM: a data scope management service for model-based privacy by design GDPR compliance},
  author={Piras, Luca and Al-Obeidallah, Mohammed Ghazi and Pavlidis, Michalis and Mouratidis, Haralambos and Tsohou, Aggeliki and Magkos, Emmanouil and Praitano, Andrea and Iodice, Annarita and Crespo, Beatriz Gallego-Nicasio},
  booktitle={International Conference on Trust and Privacy in Digital Business},
  pages={186--201},
  year={2020},
  organization={Springer, Cham}
  }

• Karagiannis, S., Maragkos-Belmpas, E., & Magkos, E.. (2020). An analysis and evaluation of open source capture the flag platforms as cybersecurity e-learning tools. Paper presented at the Ifip world conference on information security education.
  [Bibtex]

  @inproceedings{karagiannis2020analysis,
  title={An Analysis and Evaluation of Open Source Capture the Flag Platforms as Cybersecurity e-Learning Tools},
  author={Karagiannis, Stylianos and Maragkos-Belmpas, Elpidoforos and Magkos, Emmanouil},
  booktitle={IFIP World Conference on Information Security Education},
  pages={61--77},
  year={2020},
  organization={Springer, Cham}
  }

• Mouratidis, H., Tsohou, A., Magkos, E., Praitano, A., Iodice, A., & Crespo, B. G.. (2020). Defend dsm: a data scope management service for model-based privacy by design gdpr compliance. Paper presented at the Trust, privacy and security in digital business: 17th international conference, trustbus 2020, bratislava, slovakia, september 14–17, 2020, proceedings.
  [Bibtex]

  @inproceedings{mouratidis2020defend,
  title={DEFeND DSM: A Data Scope Management Service for Model-Based Privacy by Design GDPR Compliance},
  author={Mouratidis, Haralambos and Tsohou, Aggeliki and Magkos, Emmanouil and Praitano, Andrea and Iodice, Annarita and Crespo, Beatriz Gallego-Nicasio},
  booktitle={Trust, Privacy and Security in Digital Business: 17th International Conference, TrustBus 2020, Bratislava, Slovakia, September 14--17, 2020, Proceedings},
  volume={12395},
  pages={186},
  year={2020},
  organization={Springer Nature}
  }

• Karagiannis, S., & Magkos, E.. (2020). Adapting ctf challenges into virtual cybersecurity learning environments. Information & computer security.
  [Bibtex]

  @article{karagiannis2020adapting,
  title={Adapting CTF challenges into virtual cybersecurity learning environments},
  author={Karagiannis, Stylianos and Magkos, Emmanouil},
  journal={Information \& Computer Security},
  year={2020},
  publisher={Emerald Publishing Limited}
  }

• Karagiannis, S., Papaioannou, T., Magkos, E., & Tsohou, A.. (2020). Game-based information security/privacy education and awareness: theory and practice. Paper presented at the European, mediterranean, and middle eastern conference on information systems.
  [Bibtex]

  @inproceedings{karagiannis2020game,
  title={Game-Based Information Security/Privacy Education and Awareness: Theory and Practice},
  author={Karagiannis, Stylianos and Papaioannou, Thanos and Magkos, Emmanouil and Tsohou, Aggeliki},
  booktitle={European, Mediterranean, and Middle Eastern Conference on Information Systems},
  pages={509--525},
  year={2020},
  organization={Springer, Cham}
  }

• Karagiannis, S., Magkos, E., Ntantogian, C., & Ribeiro, L. L.. (2020). Sandboxing the cyberspace for cybersecurity education and learning. Paper presented at the European symposium on research in computer security.
  [Bibtex]

  @inproceedings{karagiannis2020sandboxing,
  title={Sandboxing the Cyberspace for Cybersecurity Education and Learning},
  author={Karagiannis, Stylianos and Magkos, Emmanouil and Ntantogian, Christoforos and Ribeiro, Lu{\'\i}s L},
  booktitle={European Symposium on Research in Computer Security},
  pages={181--196},
  year={2020},
  organization={Springer, Cham}
  }

• Tsipis, A., Papamichail, A., Angelis, I., Koufoudakis, G., Tsoumanis, G., & Oikonomou, K.. (2020). An Alertness-Adjustable Cloud/Fog IoT Solution for Timely Environmental Monitoring Based on Wildfire Risk Forecasting. Energies, 13(14).
  [Bibtex]

  @article{tsipis2020alertness,
  abstract = {Internet of Things (IoT) appliances, especially those realized through wireless sensor networks (WSNs), have been a dominant subject for heavy research in the environmental and agricultural sectors. To address the ever-increasing demands for real-time monitoring and sufficiently handle the growing volumes of raw data, the cloud/fog computing paradigm is deemed a highly promising solution. This paper presents a WSN-based IoT system that seamlessly integrates all aforementioned technologies, having at its core the cloud/fog hybrid network architecture. The system was intensively validated using a demo prototype in the Ionian University facilities, focusing on response time, an important metric of future smart applications. Further, the developed prototype is able to autonomously adjust its sensing behavior based on the criticality of the prevailing environmental conditions, regarding one of the most notable climate hazards, wildfires. Extensive experimentation verified its efficiency and reported on its alertness and highly conforming characteristics considering the use-case scenario of Corfu Island\'s 2019 fire risk severity. In all presented cases, it is shown that through fog leveraging it is feasible to contrive significant delay reduction, with high precision and throughput, whilst controlling the energy consumption levels. Finally, a user-driven web interface is highlighted to accompany the system; it is capable of augmenting the data curation and visualization, and offering real-time wildfire risk forecasting based on Chandler\'s burning index scoring.},
  article-number = {3693},
  author = {Tsipis, Athanasios and Papamichail, Asterios and Angelis, Ioannis and Koufoudakis, George and Tsoumanis, Georgios and Oikonomou, Konstantinos},
  date-added = {2021-11-29 11:32:35 +0200},
  date-modified = {2021-11-29 11:32:35 +0200},
  doi = {10.3390/en13143693},
  issn = {1996-1073},
  journal = {Energies},
  keywords = {own, refereed, olinet, R:CF:ARCH,R:IOT:AGR},
  number = {14},
  title = {{{{An Alertness-Adjustable Cloud/Fog IoT Solution for Timely Environmental Monitoring Based on Wildfire Risk Forecasting}}}},
  url = {https://www.mdpi.com/1996-1073/13/14/3693},
  volume = {13},
  year = {2020},
  Bdsk-Url-1 = {https://www.mdpi.com/1996-1073/13/14/3693},
  Bdsk-Url-2 = {https://doi.org/10.3390/en13143693}}

• Bezas, K., Komianos, V., Koufoudakis, G., Tsoumanis, G., Kabassi, K., & Oikonomou, K.. (2020). Structural health monitoring in historical buildings: a network approach. Heritage, 3(3), 796–818.
  [Bibtex]

  @article{bezas2020structural,
  abstract = {Structural health monitoring (SHM) in historical buildings can be achieved through systems that rely on Wireless Sensor Networks (WSNs). Such systems have the ability to acquire information fast and reliably, making them ideal for SHM applications. Historical buildings, having been exposed to the wear of time, are especially sensitive to any kind of intervention. As a result, keeping them as intact as possible is a critical factor for their integrity. In the current work, a low-cost WSN system and a synchronization algorithm are developed in order to be employed for SHM of historical buildings. The synchronization of WSN-based SHM systems is critical for the collection of accurate information describing the building\'s condition. The effectiveness of the assumed hardware and the synchronization algorithm were evaluated with two experiments. The first took place under laboratory conditions and its results showcase the algorithm\'s accuracy of synchronization. The second experiment was conducted in a real-world environment. For that purpose, the Ionian Campus Testbed was chosen since it comprises buildings that are more than 200 years old. These buildings are appropriate since they were built with thick stone walls which help determine the system\'s effectiveness under such conditions. The results derived from the second experiment showcase the effects of the packet transmission collision avoidance mechanism utilized by the assumed hardware. Finally, an estimation of the average clock skew required for accurate information gathering is derived, based on the materials comprising a historical building.},
  author = {Bezas, Konstantinos and Komianos, Vasileios and Koufoudakis, George and Tsoumanis, Georgios and Kabassi, Katerina and Oikonomou, Konstantinos},
  date-added = {2020-07-24 19:00:21 +0300},
  date-modified = {2021-11-13 20:56:22 +0200},
  doi = {10.3390/heritage3030044},
  issn = {2571-9408},
  journal = {Heritage},
  keywords = {own, refereed, olinet,R:SYNC,R:IOT:IU,R:IOT:SC},
  number = {3},
  pages = {796--818},
  title = {Structural Health Monitoring in Historical Buildings: A Network Approach},
  url = {https://www.mdpi.com/2571-9408/3/3/44},
  volume = {3},
  year = {2020},
  Bdsk-Url-1 = {https://www.mdpi.com/2571-9408/3/3/44},
  Bdsk-Url-2 = {https://doi.org/10.3390/heritage3030044}}

• Stylidou, A., Zervopoulos, A., Alvanou, A. G., Koufoudakis, G., Tsoumanis, G., & Oikonomou, K.. (2020). Evaluation of Epidemic-Based Information Dissemination in a Wireless Network Testbed. Technologies, 8(3).
  [Bibtex]

  @article{stylidou2020evaluation,
  abstract = {Information dissemination is an integral part of modern networking environments, such as Wireless Sensor Networks (WSNs). Probabilistic flooding, a common epidemic-based approach, is used as an efficient alternative to traditional blind flooding as it minimizes redundant transmissions and energy consumption. It shares some similarities with the Susceptible-Infected-Recovered (SIR) epidemic model, in the sense that the dissemination process and the epidemic thresholds, which achieve maximum coverage with the minimum required transmissions, have been found to be common in certain cases. In this paper, some of these similarities between probabilistic flooding and the SIR epidemic model are identified, particularly with respect to the epidemic thresholds. Both of these epidemic algorithms are experimentally evaluated on a university campus testbed, where a low-cost WSN, consisting of 25 nodes, is deployed. Both algorithm implementations are shown to be efficient at covering a large portion of the network\'s nodes, with probabilistic flooding behaving largely in accordance with the considered epidemic thresholds. On the other hand, the implementation of the SIR epidemic model behaves quite unexpectedly, as the epidemic thresholds underestimate sufficient network coverage, a fact that can be attributed to implementation limitations.},
  article-number = {36},
  author = {Stylidou, Andreana and Zervopoulos, Alexandros and Alvanou, Aikaterini Georgia and Koufoudakis, George and Tsoumanis, Georgios and Oikonomou, Konstantinos},
  date-added = {2020-07-24 18:38:58 +0300},
  date-modified = {2021-11-13 20:56:16 +0200},
  doi = {10.3390/technologies8030036},
  issn = {2227-7080},
  journal = {Technologies},
  keywords = {own, refereed, olinet, R:ID:LE,R:IOT:IU,R:IOT:SC},
  number = {3},
  title = {{{{Evaluation of Epidemic-Based Information Dissemination in a Wireless Network Testbed}}}},
  volume = {8},
  year = {2020},
  Bdsk-Url-1 = {https://www.mdpi.com/2227-7080/8/3/36},
  Bdsk-Url-2 = {https://doi.org/10.3390/technologies8030036}}

• Tsoumanis, G., Giannakeas, N., Tzallas, A. T., Glavas, E., Stergiou, E., Oikonomou, K., & Angelis, C. T.. (2020). A Lifetime Extension Framework for Wireless Sensor Networks. Paper presented at the 2020 43rd international conference on telecommunications and signal processing (tsp).
  [Bibtex]

  @inproceedings{tsoumanis2020lifetime,
  abstract = {\textbf{Abstract}: Prolonging the lifetime of a wireless sensor network
  (WSN) is closely related to the energy hole problem where nodes
  close to the sink node consume more energy than the other nodes,
  due to their increased traffic load. For tackling the effects of the
  energy hole problem, a framework is proposed here consisting of
  two parts. In its first part, the sink node is selected in order to
  minimize the energy consumption of the most severely affected
  by the energy hole problem node. During the second part, a new
  algorithm proposed here is implemented and changes the path
  followed by traffic forwarded by nodes close to the sink node in
  order to achieve less energy consumption for the most energy
  consuming node of the network.},
  author = {Georgios {Tsoumanis} and Nikolaos {Giannakeas} and Alexandros T. {Tzallas} and Evripidis {Glavas} and Eleftherios {Stergiou} and Konstantinos {Oikonomou} and Constantinos T. {Angelis}},
  booktitle = {2020 43rd International Conference on Telecommunications and Signal Processing (TSP)},
  date-added = {2020-06-16 12:16:53 +0300},
  date-modified = {2021-12-06 16:13:59 +0200},
  doi = {10.1109/TSP49548.2020.9163515},
  keywords = {own, refereed,R:ENERGY:FLP},
  month = {7},
  pages = {260-264},
  title = {{{{A Lifetime Extension Framework for Wireless Sensor Networks}}}},
  venue = {Milan, Italy},
  year = {2020},
  Bdsk-Url-1 = {https://doi.org/10.1109/TSP49548.2020.9163515}}

• Tsipis, A., Oikonomou, K., Komianos, V., & Stavrakakis, I.. (2020). QoE-Aware Rendering Service Allocation in Fog-Assisted Cloud Gaming Environments. Paper presented at the 2020 5th south-east europe design automation, computer engineering, computer networks and social media conference (seeda-cecnsm).
  [Bibtex]

  @inproceedings{tsipis2020qoe,
  author = {Tsipis, Athanasios and Oikonomou, Konstantinos and Komianos, Vasileios and Stavrakakis, Ioannis},
  booktitle = {2020 5th South-East Europe Design Automation, Computer Engineering, Computer Networks and Social Media Conference (SEEDA-CECNSM)},
  date-added = {2020-06-16 12:07:02 +0300},
  date-modified = {2021-12-06 16:18:40 +0200},
  doi = {10.1109/SEEDA-CECNSM49515.2020.9221778},
  keywords = {own, refereed, v-corfu, R:CF:CG},
  pages = {1-8},
  title = {{{{QoE-Aware Rendering Service Allocation in Fog-Assisted Cloud Gaming Environments}}}},
  venue = {Corfu, Greece},
  year = {2020},
  Bdsk-Url-1 = {https://doi.org/10.1109/SEEDA-CECNSM49515.2020.9221778}}

• Tsoumanis, G., Papamichail, A., Dragonas, V., Koufoudakis, G., Angelis, C. T., & Oikonomou, K.. (2020). Implementation of a Topology Independent MAC (TiMAC) Policy on a Low-Cost IoT System. Future internet, 12(5), 86.
  [Bibtex]

  @article{tsoumanis2020implementation,
  abstract = {The emerging new paradigm under the fifth generation of wireless communications technologies (5G) and high expectations for massively expanding today's Internet of Things (IoT) under 5G, are expected to support a large plurality of low-cost devices for an all-increasing number of new IoT applications. Many emerging IoT applications are going to take advantage of techniques and technologies that have high demands from low-cost devices in terms of processing large amounts of data and communication. For example, in systems based on fog computing technology, low-cost devices have to assign some of their limited resources for processing purposes. Considering the drawbacks emerging from using low-cost devices and the fact that many applications are in need for time-constrained approaches, TDMA-based Medium Access Control (MAC) policies need to be revisited and implemented in low-cost devices of today. In this sense, a policy independent of the underlying topology, TiMAC policy, is considered here and is implemented in low-cost devices using 433 MHz RF modules. Even though the implementation is limited by synchronization issues and a small number of nodes, the obtained experimental results demonstrate the potential for employing TDMA-based MAC policies on IoT systems consisting of low-cost devices.},
  author = {Tsoumanis, Georgios and Papamichail, Asterios and Dragonas, Vasileios and Koufoudakis, George and Angelis, Constantinos T and Oikonomou, Konstantinos},
  date-added = {2020-06-16 11:01:21 +0300},
  date-modified = {2021-12-06 16:23:37 +0200},
  doi = {10.3390/fi12050086},
  journal = {Future Internet},
  keywords = {own, refereed, olinet, R:MAC:SF},
  number = {5},
  pages = {86},
  publisher = {Multidisciplinary Digital Publishing Institute},
  title = {{{{Implementation of a Topology Independent MAC (TiMAC) Policy on a Low-Cost IoT System}}}},
  volume = {12},
  year = {2020},
  Bdsk-Url-1 = {https://doi.org/10.3390/fi12050086}}

• Skiadopoulos, K., Giannakis, K., Tsipis, A., Oikonomou, K., & Stavrakakis, I.. (2020). Impact of Drone Route Geometry on Information Collection in Wireless Sensor Networks. Ad hoc networks, 106, 102220.
  [Bibtex]

  @article{skiadopoulos2020impact,
  abstract = {The recent technological evolution of drones along with the constantly growing maturity of its commercialization, has led to the emergence of novel drone-based applications within the field of wireless sensor networks for information collection purposes. In such settings, especially when deployed in outdoor environments with limited external control, energy consumption and robustness are challenging problems for the system's operation. In the present paper, a drone-assisted wireless sensor network is studied, the aim being to coordinate the routing of information (among the ground nodes and its propagation to the drone), investigating several drone trajectories or route shapes and examining their impact on information collection (the aim being to minimize transmissions and consequently, energy consumption). The main contribution lies on the proposed algorithms that coordinate the communication between (terrestrial) sensor nodes and the drone that may follow different route shapes. It is shown through simulations using soft random geometric graphs that the number of transmitted messages for each drone route shape depends on the rotational symmetry around the center of each shape. An interesting result is that the higher the order of symmetry, the lower the number of transmitted messages for data collection. Contrary, for those cases that the order of symmetry is the same, even for different route shapes, similar number of messages is transmitted. In addition to the simulation results, an experimental demonstration, using spatial data from grit bin locations, further validates the proposed solution under real-world conditions, demonstrating the applicability of the proposed approach.},
  author = {Konstantinos Skiadopoulos and Konstantinos Giannakis and Athanasios Tsipis and Konstantinos Oikonomou and Ioannis Stavrakakis},
  date-added = {2020-06-16 10:45:30 +0300},
  date-modified = {2022-07-01 12:35:32 +0300},
  doi = {https://doi.org/10.1016/j.adhoc.2020.102220},
  issn = {1570-8705},
  journal = {Ad Hoc Networks},
  keywords = {own, refereed, olinet, R:ID:DS, R:IOT:UAV},
  pages = {102220},
  rating = {0},
  title = {{{{Impact of Drone Route Geometry on Information Collection in Wireless Sensor Networks}}}},
  url = {http://www.sciencedirect.com/science/article/pii/S1570870519310935},
  volume = {106},
  year = {2020},
  Bdsk-Url-1 = {http://www.sciencedirect.com/science/article/pii/S1570870519310935},
  Bdsk-Url-2 = {https://doi.org/10.1016/j.adhoc.2020.102220}}

• Vergis, S., Komianos, V., Tsoumanis, G., Tsipis, A., & Oikonomou, K.. (2020). A low-cost vehicular traffic monitoring system using fog computing. Smart cities, 3(1), 138–156.
  [Bibtex]

  @article{vergis2020smartcities,
  abstract = {With the rapid increase of vehicles in use worldwide, the need for efficient traffic monitoring systems has arisen. This work proposes a low-cost vehicular traffic monitoring system using IoT devices and fog computing. The system is based on a three-tiered architecture which is composed of (i) the mobile tracking system that records the positions of the vehicles using GPS technologies; (ii) the information gathering system which gathers all the data collected by the mobile tracking system; and (iii) the fog devices that process the data collected and extract the information needed. The system is tested in the town of Corfu during a period of increased tourism when the traffic is considered to be relatively dense. The mobile tracking system devices are placed on taxis and with the help of professional taxi drivers the accuracy of the data collected is evaluated. The system is able to record the movement of the vehicles accurately using its own independent data. The results can be remotely accessed by utilizing fog and cloud computing infrastructure established to process the data and upload it on a server. The system is used to give a better understanding of the speed variance in the center of the town during different dates and hours. In conclusion the system presented in this study can be utilized to monitor the traffic and provide vital information about its behavior in relation to time.},
  author = {Vergis, Spiridon and Komianos, Vasileios and Tsoumanis, Georgios and Tsipis, Athanasios and Oikonomou, Konstantinos},
  date-added = {2020-04-16 20:22:20 +0300},
  date-modified = {2021-11-17 15:20:37 +0200},
  doi = {10.3390/smartcities3010008},
  issn = {2624-6511},
  journal = {Smart Cities},
  keywords = {own, refereed, olinet,R:IOT:SC, R:IOT:VE},
  number = {1},
  pages = {138--156},
  title = {A Low-Cost Vehicular Traffic Monitoring System Using Fog Computing},
  url = {https://www.mdpi.com/2624-6511/3/1/8},
  volume = {3},
  year = {2020},
  Bdsk-Url-1 = {https://www.mdpi.com/2624-6511/3/1/8},
  Bdsk-Url-2 = {https://doi.org/10.3390/smartcities3010008}}

• Alvanou, A. G., Zervopoulos, A., Papamichail, A., Bezas, K., Vergis, S., Stylidou, A., Tsipis, A., Komianos, V., Tsoumanis, G., Koufoudakis, G., & Oikonomou, K.. (2020). Cabius: description of the enhanced wireless campus testbed of the ionian university. Electronics, 9(3).
  [Bibtex]

  @article{alvanou2020electronics,
  abstract = {Technological evolution and in particular the development of the Internet of Things (IoT) has paved the way for material prosperity and a better standard of living. A critical factor in the effectiveness of emerging IoT applications, which heavily rely on sensor information flow, is the development of a functional and efficient Wireless Sensor Network. Additionally, the levels of automation are conducive to usability and time efficiency by reducing the need for human intervention, as well as increasing the rate at which experiments can be carried out. In current work, an already installed infrastructure on the Ionian University campus is considered and enhanced, with the goal of elevating accessibility and user-friendliness, by designing a web platform. The presented platform enables the remote development, execution and monitoring of simple but necessary network-based algorithms using a custom language, without requiring code to be uploaded to remote nodes. As a proof of concept, three information dissemination algorithms are implemented and provided as example templates for users, promoting simultaneously ease of use.},
  article-number = {454},
  author = {Alvanou, Aikaterini Georgia and Zervopoulos, Alexandros and Papamichail, Asterios and Bezas, Konstantinos and Vergis, Spiridon and Stylidou, Andreana and Tsipis, Athanasios and Komianos, Vasileios and Tsoumanis, Georgios and Koufoudakis, George and Oikonomou, Konstantinos},
  date-added = {2020-04-16 20:16:38 +0300},
  date-modified = {2021-11-13 20:52:56 +0200},
  doi = {10.3390/electronics9030454},
  issn = {2079-9292},
  journal = {Electronics},
  keywords = {own, refereed, olinet,R:IOT:IU},
  number = {3},
  title = {CaBIUs: Description of the Enhanced Wireless Campus Testbed of the Ionian University},
  url = {https://www.mdpi.com/2079-9292/9/3/454},
  volume = {9},
  year = {2020},
  Bdsk-Url-1 = {https://www.mdpi.com/2079-9292/9/3/454},
  Bdsk-Url-2 = {https://doi.org/10.3390/electronics9030454}}

• Tsipis, A., Papamichail, A., Koufoudakis, G., Tsoumanis, G., Polykalas, S. E., & Oikonomou, K.. (2020). Latency-adjustable cloud/fog computing architecture for time-sensitive environmental monitoring in olive groves. Agriengineering, 2(1), 175–205.
  [Bibtex]

  @article{tsipis2020agriengineering,
  abstract = {The emerging and vast adoption of the Internet of Things (IoT) has sprung a plethora of research works regarding the potential benefits in smart agriculture. A popular implementation involves the deployment of Wireless Sensor Networks (WSNs), which embed low energy consumption sensory nodes to capture the critical environmental parameters prevailing on the farms. However, to manage the ever-increasing volumes of raw data successfully, new approaches must be explored. Under this scope, current work reports on the design and development of an IoT system, having in mind the case of olive groves, which are considered the dominant sector for agricultural activity in the Mediterranean Basin. The system incorporates the cloud/fog computing paradigm to equip the olive growers with a low-cost solution for accurate, reliable, and almost real-time monitoring of their crops. Its core is based on a three-layered network architecture, capable of dynamically balancing the generated load, by pushing cloud-elastic resources to the underlying fog network. As such, the premise of the approach lies in the conforming character of the system that allows for targeted alterations to its operational functionality to meet stringent latency and traffic load environmental monitoring constraints. To evaluate the performance of the proposed architecture, a demo prototype is developed and deployed in the facilities of the Ionian University. Experimental results illustrate the efficiency, flexibility, and scalability of the approach in terms of latency, achieving response time reduction across all platforms, a subject of the utmost importance when it comes to precision agriculture of the future. Moreover, it is shown that the system is capable of dynamic functionality adaptation, to meet network traffic load constraints, achieving high throughput (on average 95\%) and addressing potential environmental dangers to olive oil production.},
  author = {Tsipis, Athanasios and Papamichail, Asterios and Koufoudakis, George and Tsoumanis, Georgios and Polykalas, Spyros E. and Oikonomou, Konstantinos},
  date-added = {2020-04-16 20:01:14 +0300},
  date-modified = {2021-11-13 21:00:03 +0200},
  doi = {10.3390/agriengineering2010011},
  issn = {2624-7402},
  journal = {AgriEngineering},
  keywords = {own, refereed, olinet, R:CF:ARCH, R:IOT:AGR},
  number = {1},
  pages = {175--205},
  title = {Latency-Adjustable Cloud/Fog Computing Architecture for Time-Sensitive Environmental Monitoring in Olive Groves},
  url = {https://www.mdpi.com/2624-7402/2/1/11},
  volume = {2},
  year = {2020},
  Bdsk-Url-1 = {https://www.mdpi.com/2624-7402/2/1/11},
  Bdsk-Url-2 = {https://doi.org/10.3390/agriengineering2010011}}

• Zervopoulos, A., Tsipis, A., Alvanou, A. G., Bezas, K., Papamichail, A., Vergis, S., Stylidou, A., Tsoumanis, G., Komianos, V., Koufoudakis, G., & Oikonomou, K.. (2020). Wireless sensor network synchronization for precision agriculture applications. Agriculture, 10(3).
  [Bibtex]

  @article{zervopoulos2020agriculture,
  abstract = {The advent of Internet of Things has propelled the agricultural domain through the integration of sensory devices, capable of monitoring and wirelessly propagating information to producers; thus, they employ Wireless Sensor Networks (WSNs). These WSNs allow real time monitoring, enabling intelligent decision-making to maximize yields and minimize cost. Designing and deploying a WSN is a challenging and multivariate task, dependent on the considered environment. For example, a need for network synchronization arises in such networks to correlate acquired measurements. This work focuses on the design and installation of a WSN that is capable of facilitating the sensing aspects of smart and precision agriculture applications. A system is designed and implemented to address specific design requirements that are brought about by the considered environment. A simple synchronization scheme is described to provide time-correlated measurements using the sink node's clock as reference. The proposed system was installed on an olive grove to assess its effectiveness in providing a low-cost system, capable of acquiring synchronized measurements. The obtained results indicate the system's overall effectiveness, revealing a small but expected difference in the acquired measurements; time correlation, caused mostly by serial transmission delays, while yielding a plethora of relevant environmental conditions.},
  article-number = {89},
  author = {Zervopoulos, Alexandros and Tsipis, Athanasios and Alvanou, Aikaterini Georgia and Bezas, Konstantinos and Papamichail, Asterios and Vergis, Spiridon and Stylidou, Andreana and Tsoumanis, Georgios and Komianos, Vasileios and Koufoudakis, George and Oikonomou, Konstantinos},
  date-added = {2020-04-16 19:32:17 +0300},
  date-modified = {2021-11-13 20:59:59 +0200},
  doi = {10.3390/agriculture10030089},
  issn = {2077-0472},
  journal = {Agriculture},
  keywords = {own, refereed, olinet,R:SYNC, R:IOT:AGR},
  number = {3},
  title = {Wireless Sensor Network Synchronization for Precision Agriculture Applications},
  url = {https://www.mdpi.com/2077-0472/10/3/89},
  volume = {10},
  year = {2020},
  Bdsk-Url-1 = {https://www.mdpi.com/2077-0472/10/3/89},
  Bdsk-Url-2 = {https://doi.org/10.3390/agriculture10030089}}

• Dragonas, V., Tsoumanis, G., Koufoudakis, G., Papamichail, A., Oikonomou, K., & Stavrakakis, I.. (2020). A Fairness-Aware topology independent TDMA MAC policy in time constrained wireless ad hoc networks. Computer networks, 171, 107157.
  [Bibtex]

  @article{dragonas2020fairness,
  abstract = {As current network technologies evolve towards 5G supporting increased throughput and low time delays, a need emerges for supporting time constraint applications at the wireless end user level. The network formed due to the dynamicity of the Internet of Things (IoT), can be seen as a wireless ad hoc environment where certain time constraints need to be satisfied motivating the revisit of topology independent TDMA policies in this work. It has been shown that such policies, even though suitable to satisfy certain time constraints, suffer either from low throughput or from fairness issues. In this paper a new fairness-aware policy for medium access control in wireless ad hoc networks is proposed that exploits the topology independent properties of the existing policies in the literature and in addition, it takes into account fairness by accessing the medium according to the individual envy metric that is easily calculated by each node. In particular, under the proposed policy, nodes that are treated ``unfairly'' increase their medium access opportunities in subsequent frames and vice versa. The proposed policy is evaluated against the existing topology independent policies demonstrating its effectiveness of throughput increment while at the same time nodes are treated ``fairly'' (given certain fairness metrics). It is shown here that the best case regarding throughput corresponds to the policy of the worst case regarding fairness while those policies that treat nodes ``fairly'', result in small throughput. Under the proposed policy, fairness remains close to the best fairness case but at the same time throughput is improved compared to the same case. Furthermore, it is also shown here that individual nodes that are treated ``unfairly'' tend to experience a larger number of consecutive re-transmissions and consequently time delays, thus emphasizing the need to consider fairness in these emerging environments.},
  author = {Dragonas, Vasileios and Tsoumanis, Georgios and Koufoudakis, George and Papamichail, Asterios and Oikonomou, Konstantinos and Stavrakakis, Ioannis},
  date-modified = {2021-11-22 20:05:24 +0200},
  doi = {https://doi.org/10.1016/j.comnet.2020.107157},
  issn = {1389-1286},
  journal = {Computer Networks},
  keywords = {own, refereed,olinet, R:MAC:SF},
  pages = {107157},
  title = {{{A Fairness-Aware topology independent TDMA MAC policy in time constrained wireless ad hoc networks}}},
  url = {http://www.sciencedirect.com/science/article/pii/S1389128619316093},
  volume = {171},
  year = {2020},
  Bdsk-Url-1 = {http://www.sciencedirect.com/science/article/pii/S1389128619316093},
  Bdsk-Url-2 = {https://doi.org/10.1016/j.comnet.2020.107157}}

• Tsipis, A., Komianos, V., Oikonomou, K., & Stavrakakis, I.. (2020). Elastic Distributed Rendering Service Placement in Capacitated Cloud/Fog Gaming Systems. Paper presented at the 2020 11th international conference on information, intelligence, systems and applications (iisa).
  [Bibtex]

  @inproceedings{tsipis2020elastic,
  abstract = {The construction of Connected Dominating Sets (CDS) in order to provide virtual backbones over low-cost wireless networks and facilitate the operation of intelligent services in smart tourism environments is a challenging task. In these kinds of environments, heterogenous networks are usually encountered, consisting of a wide variety of devices, ranging from data centers to Internet of Things devices and sensors. As such, each individual system's performance needs to be taken into account during the construction of the virtual backbone network, in order to maximize its efficiency based on the requirements of a considered service. To accomplish this, each node in the network is characterized by an appropriateness parameter, which indicates how appropriate a node is for a requested virtual backbone network. An algorithm for the construction of a CDS is extended to take this parameter into account. A low-cost wireless network installed in a university campus is used as an experimental testbed to evaluate the effectiveness of the proposed approach. The obtained results show that the proposed approach is capable of constructing appropriate virtual backbone networks for smart tourism services which add reduced network overhead.},
  author = {Tsipis, Athanasios and Komianos, Vasileios and Oikonomou, Konstantinos and Stavrakakis, Ioannis},
  booktitle = {2020 11th International Conference on Information, Intelligence, Systems and Applications (IISA)},
  date-modified = {2021-12-06 16:25:29 +0200},
  doi = {10.1109/IISA50023.2020.9284390},
  keywords = {own, refereed, v-corfu, R:CF:CG},
  pages = {1-8},
  title = {{{Elastic Distributed Rendering Service Placement in Capacitated Cloud/Fog Gaming Systems}}},
  venue = {Piraeus, Greece},
  year = {2020},
  Bdsk-Url-1 = {https://doi.org/10.1109/IISA.2019.8900750}}

• Ringas, D., & Christopoulou, E.. (2020). Effect of urban computing on the public’s perception of place, community, and infrastructure. In Megacities and rapid urbanization: breakthroughs in research and practice (pp. 251–273). Igi global.
  [Bibtex]

  @incollection{ringas2020effect,
  title={Effect of Urban Computing on the Public's Perception of Place, Community, and Infrastructure},
  author={Ringas, Dimitrios and Christopoulou, Eleni},
  booktitle={Megacities and Rapid Urbanization: Breakthroughs in Research and Practice},
  pages={251--273},
  year={2020},
  publisher={IGI Global}
  }

• Karageorgiou, Z., Mavrommati, E., Fotaris, P., & Christopoulou, E.. (2020). Escape room in education: evaluating using experience pyramid model. Paper presented at the 2020 5th south-east europe design automation, computer engineering, computer networks and social media conference (seeda-cecnsm).
  [Bibtex]

  @inproceedings{karageorgiou2020escape,
  title={Escape room in education: Evaluating using Experience Pyramid Model},
  author={Karageorgiou, Zoi and Mavrommati, Eirini and Fotaris, Panagiotis and Christopoulou, Eleni},
  booktitle={2020 5th South-East Europe Design Automation, Computer Engineering, Computer Networks and Social Media Conference (SEEDA-CECNSM)},
  pages={1--8},
  year={2020},
  organization={IEEE}
  }

• Mantellos, G., Exarhos, T. P., & Christopoulou, E.. (2020). Human activity and transportation mode recognition using smartphone sensors. Paper presented at the 2020 5th south-east europe design automation, computer engineering, computer networks and social media conference (seeda-cecnsm).
  [Bibtex]

  @inproceedings{mantellos2020human,
  title={Human activity and transportation mode recognition using smartphone sensors},
  author={Mantellos, George and Exarhos, Themis P and Christopoulou, Eleni},
  booktitle={2020 5th South-East Europe Design Automation, Computer Engineering, Computer Networks and Social Media Conference (SEEDA-CECNSM)},
  pages={1--7},
  year={2020},
  organization={IEEE}
  }

• Karagiannis, S., Magkos, E., Ntantogian, C., & Ribeiro, L. L.. (2020). Sandboxing the cyberspace for cybersecurity education and learning. Paper presented at the European symposium on research in computer security.
  [Bibtex]

  @inproceedings{karagiannis2020sandboxing,
  title={Sandboxing the Cyberspace for Cybersecurity Education and Learning},
  author={Karagiannis, Stylianos and Magkos, Emmanouil and Ntantogian, Christoforos and Ribeiro, Lu{\'\i}s L},
  booktitle={European Symposium on Research in Computer Security},
  pages={181--196},
  year={2020},
  organization={Springer}
  }

• Tsohou, A., Siponen, M., & Newman, M.. (2020). How does information technology-based service degradation influence consumers’ use of services? an information technology-based service degradation decision theory. Journal of information technology, 35(1), 2–24.
  [Bibtex]

  @article{tsohou2020does,
  title={How does information technology-based service degradation influence consumers’ use of services? An information technology-based service degradation decision theory},
  author={Tsohou, Aggeliki and Siponen, Mikko and Newman, Mike},
  journal={Journal of Information Technology},
  volume={35},
  number={1},
  pages={2--24},
  year={2020},
  publisher={SAGE Publications Sage UK: London, England}
  }

• Paspatis, I., Tsohou, A., & Kokolakis, S.. (2020). Appaware: a policy visualization model for mobile applications. Information & computer security.
  [Bibtex]

  @article{paspatis2020appaware,
  title={AppAware: a policy visualization model for mobile applications},
  author={Paspatis, Ioannis and Tsohou, Aggeliki and Kokolakis, Spyros},
  journal={Information \& Computer Security},
  year={2020},
  publisher={Emerald Publishing Limited}
  }

• Tsohou, A., Magkos, E., Mouratidis, H., Chrysoloras, G., Piras, L., Pavlidis, M., Debussche, J., Rotoloni, M., & Crespo, B. G.. (2020). Privacy, security, legal and technology acceptance elicited and consolidated requirements for a gdpr compliance platform. Information & computer security.
  [Bibtex]

  @article{tsohou2020privacy,
  title={Privacy, security, legal and technology acceptance elicited and consolidated requirements for a GDPR compliance platform},
  author={Tsohou, Aggeliki and Magkos, Emmanouil and Mouratidis, Haralambos and Chrysoloras, George and Piras, Luca and Pavlidis, Michalis and Debussche, Julien and Rotoloni, Marco and Crespo, Beatriz Gallego-Nicasio},
  journal={Information \& Computer Security},
  year={2020},
  publisher={Emerald Publishing Limited}
  }

• Diamantopoulou, V., Tsohou, A., & Karyda, M.. (2020). From iso/iec27001: 2013 and iso/iec27002: 2013 to gdpr compliance controls. Information & computer security.
  [Bibtex]

  @article{diamantopoulou2020iso,
  title={From ISO/IEC27001: 2013 and ISO/IEC27002: 2013 to GDPR compliance controls},
  author={Diamantopoulou, Vasiliki and Tsohou, Aggeliki and Karyda, Maria},
  journal={Information \& Computer Security},
  year={2020},
  publisher={Emerald Publishing Limited}
  }

• Jiang, H., Tsohou, A., Siponen, M., & Li, Y.. (2020). Examining the side effects of organizational internet monitoring on employees. Internet research.
  [Bibtex]

  @article{jiang2020examining,
  title={Examining the side effects of organizational Internet monitoring on employees},
  author={Jiang, Hemin and Tsohou, Aggeliki and Siponen, Mikko and Li, Ying},
  journal={Internet Research},
  year={2020},
  publisher={Emerald Publishing Limited}
  }

• Piras, L., Al-Obeidallah, M. G., Pavlidis, M., Mouratidis, H., Tsohou, A., Magkos, E., Praitano, A., Iodice, A., & Crespo, B. G.. (2020). Defend dsm: a data scope management service for model-based privacy by design gdpr compliance. Paper presented at the International conference on trust and privacy in digital business.
  [Bibtex]

  @inproceedings{piras2020defend,
  title={DEFeND DSM: a data scope management service for model-based privacy by design GDPR compliance},
  author={Piras, Luca and Al-Obeidallah, Mohammed Ghazi and Pavlidis, Michalis and Mouratidis, Haralambos and Tsohou, Aggeliki and Magkos, Emmanouil and Praitano, Andrea and Iodice, Annarita and Crespo, Beatriz Gallego-Nicasio},
  booktitle={International Conference on Trust and Privacy in Digital Business},
  pages={186--201},
  year={2020},
  organization={Springer, Cham}
  }

• Siponen, M., & Tsohou, A.. (2020). Demystifying the influential is legends of positivism: response to lee’s commentary. Journal of the association for information systems, 21(6), 1.
  [Bibtex]

  @article{siponen2020demystifying,
  title={Demystifying the Influential IS Legends of Positivism: Response to Lee’s Commentary},
  author={Siponen, Mikko and Tsohou, Aggeliki},
  journal={Journal of the Association for Information Systems},
  volume={21},
  number={6},
  pages={1},
  year={2020}
  }

• Skalkos, A., Tsohou, A., Karyda, M., & Kokolakis, S.. (2020). Identifying the values associated with users’ behavior towards anonymity tools through means-end analysis. Computers in human behavior reports, 2, 100034.
  [Bibtex]

  @article{skalkos2020identifying,
  title={Identifying the values associated with users’ behavior towards anonymity tools through means-end analysis},
  author={Skalkos, Andreas and Tsohou, Aggeliki and Karyda, Maria and Kokolakis, Spyros},
  journal={Computers in Human Behavior Reports},
  volume={2},
  pages={100034},
  year={2020},
  publisher={Elsevier}
  }

• Karagiannis, S., Papaioannou, T., Magkos, E., & Tsohou, A.. (2020). Game-based information security/privacy education and awareness: theory and practice. Paper presented at the European, mediterranean, and middle eastern conference on information systems.
  [Bibtex]

  @inproceedings{karagiannis2020game,
  title={Game-Based Information Security/Privacy Education and Awareness: Theory and Practice},
  author={Karagiannis, Stylianos and Papaioannou, Thanos and Magkos, Emmanouil and Tsohou, Aggeliki},
  booktitle={European, Mediterranean, and Middle Eastern Conference on Information Systems},
  pages={509--525},
  year={2020},
  organization={Springer, Cham}
  }

• Karagiannis, S., & Magkos, E.. (2020). Engaging students in basic cybersecurity concepts using digital. Advances in core computer science-based technologies: papers in honor of professor nikolaos alexandris, 14, 55.
  [Bibtex]

  @article{karagiannis2020engaging,
  title={Engaging Students in Basic Cybersecurity Concepts Using Digital},
  author={Karagiannis, Stylianos and Magkos, Emmanouil},
  journal={Advances in Core Computer Science-Based Technologies: Papers in Honor of Professor Nikolaos Alexandris},
  volume={14},
  pages={55},
  year={2020},
  publisher={Springer Nature}
  }

• Vasenev, A., Karagiannis, S., & Mathijssen, R.. (2020). Constructing tool-based security test sequences for vehicles as high-tech data-rich systems.. Paper presented at the Vehits.
  [Bibtex]

  @inproceedings{vasenev2020constructing,
  title={Constructing Tool-based Security Test Sequences for Vehicles as High-tech Data-rich Systems.},
  author={Vasenev, Alexandr and Karagiannis, Stelios and Mathijssen, Roland},
  booktitle={VEHITS},
  pages={53--58},
  year={2020}
  }

• Magkos, E.. (2020). An analysis and evaluation of open source capture the flag platforms as cybersecurity e-learning tools. Information security education. information security in action: 13th ifip wg, 579, 61.
  [Bibtex]

  @article{magkos2020analysis,
  title={An Analysis and Evaluation of Open Source Capture the Flag Platforms as Cybersecurity e-Learning Tools},
  author={Magkos, Emmanouil},
  journal={INFORMATION SECURITY EDUCATION. INFORMATION SECURITY IN ACTION: 13th Ifip Wg},
  volume={579},
  pages={61},
  year={2020},
  publisher={Springer Nature}
  }

• Karagiannis, S., Maragkos-Belmpas, E., & Magkos, E.. (2020). An analysis and evaluation of open source capture the flag platforms as cybersecurity e-learning tools. Paper presented at the Ifip world conference on information security education.
  [Bibtex]

  @inproceedings{karagiannis2020analysis,
  title={An analysis and evaluation of open source capture the flag platforms as cybersecurity e-learning tools},
  author={Karagiannis, Stylianos and Maragkos-Belmpas, Elpidoforos and Magkos, Emmanouil},
  booktitle={IFIP World Conference on Information Security Education},
  pages={61--77},
  year={2020},
  organization={Springer, Cham}
  }

• Campos, L. M., Ribeiro, L., Karydis, I., Karagiannis, S., Pedro, D., Martins, J., Marques, C., Armada, A. G., Leal, R. P., López-Morales, M. J., & others. (2020). Reference scenarios and key performance indicators for 5g ultra-dense networks. Paper presented at the 2020 12th international symposium on communication systems, networks and digital signal processing (csndsp).
  [Bibtex]

  @inproceedings{campos2020reference,
  title={Reference Scenarios and Key Performance Indicators for 5G Ultra-dense Networks},
  author={Campos, Lu{\'e}s Miguel and Ribeiro, Lu{\'\i}s and Karydis, Ioannis and Karagiannis, Stelios and Pedro, D{\'a}rio and Martins, Jorge and Marques, Carlos and Armada, Ana Garcia and Leal, Raquel Perez and L{\'o}pez-Morales, Manuel Jos{\'e} and others},
  booktitle={2020 12th International Symposium on Communication Systems, Networks and Digital Signal Processing (CSNDSP)},
  pages={1--5},
  year={2020},
  organization={IEEE}
  }

• Karagiannis, S., & Magkos, E.. (2020). Adapting ctf challenges into virtual cybersecurity learning environments. Information & computer security.
  [Bibtex]

  @article{karagiannis2020adapting,
  title={Adapting CTF challenges into virtual cybersecurity learning environments},
  author={Karagiannis, Stylianos and Magkos, Emmanouil},
  journal={Information \& Computer Security},
  year={2020},
  publisher={Emerald Publishing Limited}
  }

• Karagiannis, S., Papaioannou, T., Magkos, E., & Tsohou, A.. (2020). Game-based information security/privacy education and awareness: theory and practice. Paper presented at the European, mediterranean, and middle eastern conference on information systems.
  [Bibtex]

  @inproceedings{karagiannis2020game,
  title={Game-Based Information Security/Privacy Education and Awareness: Theory and Practice},
  author={Karagiannis, Stylianos and Papaioannou, Thanos and Magkos, Emmanouil and Tsohou, Aggeliki},
  booktitle={European, Mediterranean, and Middle Eastern Conference on Information Systems},
  pages={509--525},
  year={2020},
  organization={Springer, Cham}
  }

• Karagiannis, S., Magkos, E., Ntantogian, C., & Ribeiro, L. L.. (2020). Sandboxing the cyberspace for cybersecurity education and learning. Paper presented at the European symposium on research in computer security.
  [Bibtex]

  @inproceedings{karagiannis2020sandboxing,
  title={Sandboxing the cyberspace for cybersecurity education and learning},
  author={Karagiannis, Stylianos and Magkos, Emmanouil and Ntantogian, Christoforos and Ribeiro, Lu{\'\i}s L},
  booktitle={European Symposium on Research in Computer Security},
  pages={181--196},
  year={2020},
  organization={Springer, Cham}
  }

2019

• Piras, L., Al-Obeidallah, M. G., Praitano, A., Tsohou, A., Mouratidis, H., Crespo, B. G., Bernard, J. B., Fiorani, M., Magkos, E., Sanz, A. C., & others. (2019). Defend architecture: a privacy by design platform for gdpr compliance. Paper presented at the International conference on trust and privacy in digital business.
  [Bibtex]

  @inproceedings{piras2019defend,
  title={DEFeND architecture: a privacy by design platform for GDPR compliance},
  author={Piras, Luca and Al-Obeidallah, Mohammed Ghazi and Praitano, Andrea and Tsohou, Aggeliki and Mouratidis, Haralambos and Crespo, Beatriz Gallego-Nicasio and Bernard, Jean Baptiste and Fiorani, Marco and Magkos, Emmanouil and Sanz, Andres Castillo and others},
  booktitle={International Conference on Trust and Privacy in Digital Business},
  pages={78--93},
  year={2019},
  organization={Springer, Cham}
  }

• Tsohou, A., Magkos, M., Mouratidis, H., Chrysoloras, G., Piras, L., Pavlidis, M., Debussche, J., Rotoloni, M., & Crespo, B. G.. (2019). Privacy, security, legal and technology acceptance requirements for a gdpr compliance platform. In Computer security (pp. 204–223). Springer, cham.
  [Bibtex]

  @incollection{tsohou2019privacy,
  title={Privacy, security, legal and technology acceptance requirements for a GDPR compliance platform},
  author={Tsohou, Aggeliki and Magkos, Manos and Mouratidis, Haralambos and Chrysoloras, George and Piras, Luca and Pavlidis, Michalis and Debussche, Julien and Rotoloni, Marco and Crespo, Beatriz Gallego-Nicasio},
  booktitle={Computer Security},
  pages={204--223},
  year={2019},
  publisher={Springer, Cham}
  }

• Zervopoulos, A., Skiadopoulos, K., Giannakis, K., Oikonomou, K., Komianos, V., & Tsoumanis, G.. (2019). Constructing Virtual Backbones over Low-Cost Wireless Networks for Smart Tourism Services. Paper presented at the 2019 10th international conference on information, intelligence, systems and applications (iisa).
  [Bibtex]

  @inproceedings{zervopoulos2019constructing,
  abstract = {The construction of Connected Dominating Sets (CDS) in order to provide virtual backbones over low-cost wireless networks and facilitate the operation of intelligent services in smart tourism environments is a challenging task. In these kinds of environments, heterogenous networks are usually encountered, consisting of a wide variety of devices, ranging from data centers to Internet of Things devices and sensors. As such, each individual system's performance needs to be taken into account during the construction of the virtual backbone network, in order to maximize its efficiency based on the requirements of a considered service. To accomplish this, each node in the network is characterized by an appropriateness parameter, which indicates how appropriate a node is for a requested virtual backbone network. An algorithm for the construction of a CDS is extended to take this parameter into account. A low-cost wireless network installed in a university campus is used as an experimental testbed to evaluate the effectiveness of the proposed approach. The obtained results show that the proposed approach is capable of constructing appropriate virtual backbone networks for smart tourism services which add reduced network overhead.},
  author = {Zervopoulos, Alexandros and Skiadopoulos, Konstantinos and Giannakis, Konstantinos and Oikonomou, Konstantinos and Komianos, Vasileios and Tsoumanis, Georgios},
  booktitle = {2019 10th International Conference on Information, Intelligence, Systems and Applications (IISA)},
  date-added = {2020-07-24 18:17:49 +0300},
  date-modified = {2021-12-06 10:47:06 +0200},
  doi = {10.1109/IISA.2019.8900750},
  issn = {null},
  keywords = {own, refereed, olinet, R:ID:DS,R:IOT,R:IOT:SC},
  month = {7},
  pages = {1-8},
  title = {{{Constructing Virtual Backbones over Low-Cost Wireless Networks for Smart Tourism Services}}},
  venue = {Patras, Greece},
  year = {2019},
  Bdsk-Url-1 = {https://doi.org/10.1109/IISA.2019.8900750}}

• Papamichail, A., Alvanou, A. G., Zervopoulos, A., Bezas, K., Vergis, S., Koufoudakis, G., Oikonomou, K., & Tsoumanis, G.. (2019). Description of the Ionian University’s Campus Wireless Network Testbed Infrastructure. Paper presented at the 2019 4th south-east europe design automation, computer engineering, computer networks and social media conference (seeda-cecnsm).
  [Bibtex]

  @inproceedings{papamichail2019description,
  abstract = {The upcoming era of the Internet of Things comes with a plethora of applications in various areas, as well as challenges that can be better addressed in small and controlled environments. This motivates the development of a low-cost wire-less network testbed that consists of Arduino devices and XBee modules that handle the communication among them. Moreover, each device is equipped with humidity, ultraviolet radiation, and structural ambient vibrations sensors. The particular testbed is installed in the premises of the Ionian University (Corfu, Greece). The location of nodes plays a crucial role in the network's topology and is highly considered at the development stage. This paper describes the Ionian University's Campus Wireless Network Testbed Infrastructure and discusses the impact of humidity and ultraviolet radiation on the network's topology by performing several experiments.},
  author = {Papamichail, Asterios and Alvanou, Aikaterini Georgia and Zervopoulos, Alexandros and Bezas, Konstantinos and Vergis, Spiridon and Koufoudakis, George and Oikonomou, Konstantinos and Tsoumanis, Georgios},
  booktitle = {2019 4th South-East Europe Design Automation, Computer Engineering, Computer Networks and Social Media Conference (SEEDA-CECNSM)},
  date-modified = {2021-12-06 10:45:07 +0200},
  doi = {10.1109/SEEDA-CECNSM.2019.8908456},
  issn = {null},
  keywords = {own, refereed, olinet,R:IOT:IU},
  month = {9},
  pages = {1-4},
  title = {{{Description of the Ionian University's Campus Wireless Network Testbed Infrastructure}}},
  venue = {Piraeus, Greece},
  year = {2019},
  Bdsk-Url-1 = {https://doi.org/10.1109/SEEDA-CECNSM.2019.8908456}}

• Bezas, K., Komianos, V., Oikonomou, K., Koufoudakis, G., & Tsoumanis, G.. (2019). Structural Health Monitoring In Historical Buildings Using A Low Cost Wireless Sensor Network. Paper presented at the 2019 4th south-east europe design automation, computer engineering, computer networks and social media conference (seeda-cecnsm).
  [Bibtex]

  @inproceedings{bezas2019structural,
  abstract = {Structural Health Monitoring (SHM) in historical buildings is achieved by sensing the structure's ambient vibrations. Technological advances in Wireless Sensor Networks (WSN) provide potential for non-intrusive monitoring approaches. A common challenge among WSN applications is the synchronization of the participating sensors, in order to collect reliable information. The current work proposes a broadcast-based lightweight synchronization process which is tested for its effectiveness in a small scale multi-hop ad-hoc network under lab conditions. The two experiments conducted in the context of this study, show that the performance of the synchronization initially places timers within a range of zero to three milliseconds and explore the effect of sensors' clock drifts and the resulted accumulation of synchronization deviation over time.},
  author = {Bezas, Konstantinos and Komianos, Vasileios and Oikonomou, Konstantinos and Koufoudakis, George and Tsoumanis, Georgios},
  booktitle = {2019 4th South-East Europe Design Automation, Computer Engineering, Computer Networks and Social Media Conference (SEEDA-CECNSM)},
  date-modified = {2021-12-06 10:41:14 +0200},
  doi = {10.1109/SEEDA-CECNSM.2019.8908531},
  issn = {null},
  keywords = {own, refereed, olinet,R:SYNC,R:IOT:IU,R:IOT:SC},
  month = {9},
  pages = {1-4},
  title = {{{Structural Health Monitoring In Historical Buildings Using A Low Cost Wireless Sensor Network}}},
  venue = {Piraeus, Greece},
  year = {2019},
  Bdsk-Url-1 = {https://doi.org/10.1109/SEEDA-CECNSM.2019.8908531}}

• Zervopoulos, A., Komianos, V., Skiadopoulos, K., Tsoumanis, G., Spiggos, A., Giannakis, K., & Oikonomou, K.. (2019). Constructing Minimal Maintenance Virtual Backbones over Low-Cost Wireless Networks. Paper presented at the 2019 4th south-east europe design automation, computer engineering, computer networks and social media conference (seeda-cecnsm).
  [Bibtex]

  @inproceedings{zervopoulos2019minimal,
  abstract = {Virtual backbones are often used to provide a form of hierarchical infrastructure to ad-hoc and Wireless Sensor Networks, facilitating various demanding operations, such as routing. Virtual backbones are often constructed using Connected Dominating Sets (CDSs). The degree of mobility and chance of node failure present in such networks cause frequent network topology changes that require the maintenance and reconstruction of the virtual backbone, which can hinder the network. Therefore, the ability of the CDS to mitigate and avoid changes in topology should be a major concern during its construction. The approach proposed in this paper aims at minimizing the need for CDS maintenance, achieving its construction by selecting the most reliable nodes, when possible. Additionally, the construction of d-hop CDS is examined, as a way to restrict the resulting virtual backbone networks to reliable core infrastructure. The assessment of this approach is done through experiments, which are conducted on a low-cost wireless network deployed on a university campus testbed, which comprises 25 low-cost devices. Each node is assigned an appropriateness parameter used to describe the node's reliability. The experiments focus on 1-CDS and 2-CDS construction, comparing the virtual backbones resulting from construction where the appropriateness parameter is taken into account, to those where it is not. The results indicate that utilizing the appropriateness parameter yields virtual backbones that are more reliable when 1-CDS is considered, whereas a small decrease in overall reliability is observed in 2-CDS construction.},
  author = {Zervopoulos, Alexandros and Komianos, Vasileios and Skiadopoulos, Konstantinos and Tsoumanis, Georgios and Spiggos, Athanassios and Giannakis, Konstantinos and Oikonomou, Konstantinos},
  booktitle = {2019 4th South-East Europe Design Automation, Computer Engineering, Computer Networks and Social Media Conference (SEEDA-CECNSM)},
  date-modified = {2021-12-06 10:47:12 +0200},
  doi = {10.1109/SEEDA-CECNSM.2019.8908532},
  issn = {null},
  keywords = {own, refereed, olinet, R:ID:DS,R:IOT:SC},
  month = {9},
  pages = {1-6},
  title = {{{Constructing Minimal Maintenance Virtual Backbones over Low-Cost Wireless Networks}}},
  venue = {Piraeus, Greece},
  year = {2019},
  Bdsk-Url-1 = {https://doi.org/10.1109/SEEDA-CECNSM.2019.8908532}}

• Vergis, S., Komianos, V., Tsoumanis, G., Spiggos, A., & Oikonomou, K.. (2019). Implementation of a Low-Cost Vehicle Traffic Monitoring System in the Town of Corfu. Paper presented at the 2019 4th south-east europe design automation, computer engineering, computer networks and social media conference (seeda-cecnsm).
  [Bibtex]

  @inproceedings{vergis2019implementation,
  abstract = {This work presents a low-cost road traffic monitoring system using IoT devices. The system is structured in three tiers: (i) the mobile vehicle tracking system recording vehicles position and movement; (ii) the information gathering system that collects the recorded data from the mobile vehicle tracking system; and (iii) a fog-computing environment which process the collected data and upload it on servers for further process. The monitoring results presented in this work are collected in the historic town of Corfu during periods of both heavy and light traffic conditions. The system is able to recognize the vehicles' movement behavior during heavy and light traffic thus locating the areas where traffic congestion occurs. The results are accessed remotely by exploiting a fog computing infrastructure designed for this purpose and which updates the information on the processing server. In this context, the proposed low-cost system can by utilized to monitor traffic and locate areas where traffic congestion events are possible to happen in order to support enhanced urban transfer services in smart cities.},
  author = {Vergis, Spiridon and Komianos, Vasileios and Tsoumanis, Georgios and Spiggos, Athanassios and Oikonomou, Konstantinos},
  booktitle = {2019 4th South-East Europe Design Automation, Computer Engineering, Computer Networks and Social Media Conference (SEEDA-CECNSM)},
  date-modified = {2021-12-06 10:46:50 +0200},
  doi = {10.1109/SEEDA-CECNSM.2019.8908378},
  issn = {null},
  keywords = {own, refereed, olinet,R:IOT:SC},
  month = {9},
  pages = {1-6},
  title = {{{Implementation of a Low-Cost Vehicle Traffic Monitoring System in the Town of Corfu}}},
  venue = {Piraeus, Greece},
  year = {2019},
  Bdsk-Url-1 = {https://doi.org/10.1109/SEEDA-CECNSM.2019.8908378}}

• Alvanou, A. G., Skiadopoulos, K., Giannakis, K., Oikonomou, K., & Tsoumanis, G.. (2019). Random Walkers Coverage Experimentation and Evaluation in Low-Cost Wireless Home Networks. Paper presented at the 2019 10th international conference on information, intelligence, systems and applications (iisa).
  [Bibtex]

  @inproceedings{alvanou2019random,
  abstract = {The mechanism of random walkers is studied in this paper as a means of disseminating information in resource-constrained networks, such as those encountered in the Internet of Things, a field that is currently emerging in various areas like home networking etc., triggering the creation of new requirements. This leads to an increasing need for effective and drastic solutions. Multiple and replicated random walker mechanisms, which serve as alternative approaches with the ultimate goal of accelerating the coverage of the network, are considered as well. The performance of these mechanisms is experimentally evaluated and compared to past theoretical findings, in a low-cost wireless network deployed on the buildings of a University campus. The obtained experimental results are consistent with previous analytic results, whereas they further indicate the overall time-efficiency in practical applications, showcasing their viability in smart environments.},
  author = {Alvanou, Aikaterini Georgia and Skiadopoulos, Konstantinos and Giannakis, Konstantinos and Oikonomou, Konstantinos and Tsoumanis, Georgios},
  booktitle = {2019 10th International Conference on Information, Intelligence, Systems and Applications (IISA)},
  date-modified = {2021-12-06 10:40:54 +0200},
  doi = {10.1109/IISA.2019.8900692},
  issn = {null},
  keywords = {own, refereed, olinet, R:ID:RW,R:IOT,R:IOT:IU},
  month = {7},
  pages = {1-4},
  title = {{{Random Walkers Coverage Experimentation and Evaluation in Low-Cost Wireless Home Networks}}},
  venue = {Patras, Greece},
  year = {2019},
  Bdsk-Url-1 = {https://doi.org/10.1109/IISA.2019.8900692}}

• Zachariadis, A., Oikonomou, K., & Tsoumanis, G.. (2019). Network Lifetime Extension Evaluation of Energy Harvesting and Clustering Approaches in WSNs. Paper presented at the 2019 4th south-east europe design automation, computer engineering, computer networks and social media conference (seeda-cecnsm).
  [Bibtex]

  @inproceedings{zachariadis2019network,
  abstract = {The energy hole problem is one of the key challenges in Wireless Sensor Network (WSN) technologies that affect the network's lifetime, even though there might be an on average large amount of energy available to the network's nodes. In order to tackle the energy hole problem's effects (i.e., sensor nodes close to the sink consume a considerable amount of their energy for relaying purposes), in this paper two approaches that are proposed in the literature, i.e., energy harvesting and clustering, are considered and evaluated through simulations. It is shown here that under energy harvesting, the network lifetime is prolonged, the latter prolongation to be more effective for low energy consumption regarding the sink. Additionally, it is shown that clustering approaches are effective and can increase the networks' lifetime. This is observed in this paper, especially for the case where the number of data packets generated within the sink's cluster is decreased.},
  author = {Zachariadis, Alexandros and Oikonomou, Konstantinos and Tsoumanis, Georgios},
  booktitle = {2019 4th South-East Europe Design Automation, Computer Engineering, Computer Networks and Social Media Conference (SEEDA-CECNSM)},
  date-modified = {2021-12-06 10:47:01 +0200},
  doi = {10.1109/SEEDA-CECNSM.2019.8908525},
  issn = {null},
  keywords = {own, refereed, olinet,R:ENERGY:LR},
  month = {9},
  pages = {1-6},
  title = {{{Network Lifetime Extension Evaluation of Energy Harvesting and Clustering Approaches in WSNs}}},
  venue = {Piraeus, Greece},
  year = {2019},
  Bdsk-Url-1 = {https://doi.org/10.1109/SEEDA-CECNSM.2019.8908525}}

• Demertzis, A., Oikonomou, K., & Stavrakakis, I.. (2019). Evaluation of a Proposed Minimum Path Impotence Routing Policy in Wireless Sensor Networks. Ad hoc networks, 94, 101928.
  [Bibtex]

  @article{demertzis2019evaluation,
  abstract = {Routing in wireless sensor networks is a challenging task due to the energy hole problem, which negatively affects the network's operation. Taking into account path impotence, i.e., a metric based on the transmission distance and the energy left at the nodes' batteries, an adjustable routing policy is proposed here that allows nodes to choose different parent nodes for forwarding their data packets toward the sink node. A major difference from the conventional approaches is that path impotence is determined by the most impotent node, instead of adding up the metric along the path. Due to this difference, the proposed policy propagates path impotence values throughout the network efficiently, with reduced extra control messages (e.g., no need to continuously reconstruct routing trees). The number of messages sent by the particular policy (i.e., overhead) is analytically investigated here and, in addition, it is analytically shown that no deadlocks are possible. Simulation results are used for evaluating the proposed policy against other eight similar policies that appear in the literature. It is demonstrated that when the introduced overhead is taken into account (e.g., energy is consumed when transmitting messages similarly to data packet transmissions), the proposed policy outperforms the other policies under certain conditions, related to the size of the message compared to the size of data packets.},
  author = {Apostolos Demertzis and Konstantinos Oikonomou and Ioannis Stavrakakis},
  date-modified = {2021-11-13 20:44:40 +0200},
  doi = {https://doi.org/10.1016/j.adhoc.2019.101928},
  issn = {1570-8705},
  journal = {Ad Hoc Networks},
  keywords = {own, refereed,olinet,R:ENERGY:LR},
  pages = {101928},
  title = {{{Evaluation of a Proposed Minimum Path Impotence Routing Policy in Wireless Sensor Networks}}},
  url = {http://www.sciencedirect.com/science/article/pii/S1570870518308977},
  volume = {94},
  year = {2019},
  Bdsk-Url-1 = {http://www.sciencedirect.com/science/article/pii/S1570870518308977},
  Bdsk-Url-2 = {https://doi.org/10.1016/j.adhoc.2019.101928}}

• Skiadopoulos, K., Giannakis, K., Oikonomou, K., Stavrakakis, I., & Fanarioti, S.. (2019). A Distributed Method to Organize Terrestrial Nodes to Facilitate Short Drone Routes in WSNs. Paper presented at the Third international balkan conference on communications and networking 2019 (balkancom’19), Skopje, North Macedonia.
  [Bibtex]

  @inproceedings{skiadopoulos2019distributed,
  abstract = {Drones are currently the focus of increased interest for various purposes
  related to actual applications and communication systems. Although their
  autonomous capabilities allow them to operate as a distinct network
  themselves, it is common to use them in combination with traditional
  communication networks, such as Wireless Sensor Networks (WSN), the
  Internet of Things applications, etc. Energy constraints and limited
  automated control of drones are challenging in certain cases, where a
  network is obligated to operate distributedly with limited control from
  outside. In this work, a setting involving a ground wireless sensor network
  and one drone is studied, taking into account the limited energy
  capabilities of a drone. In particular, the relation between a drone's
  route (in terms of traveled distance) and the communication cost (in terms
  of exchanged messages) is addressed, by proposing a novel algorithm that
  clusters nodes under a simple, cost-effective way. Simulation results
  depict that sufficient advantage is gained using the proposed solution.},
  address = {Skopje, North Macedonia},
  author = {Konstantinos Skiadopoulos and Konstantinos Giannakis and Konstantinos Oikonomou and Ioannis Stavrakakis and Sofia Fanarioti},
  booktitle = {Third International Balkan Conference on Communications and Networking 2019 (BalkanCom'19)},
  comment = {[pdf]},
  date-modified = {2021-11-17 15:17:28 +0200},
  days = {9},
  keywords = {own, refereed, olinet, R:ID:DS, R:IOT:UAV},
  month = {6},
  title = {{{A Distributed Method to Organize Terrestrial Nodes to Facilitate Short Drone Routes in {WSNs}}}},
  year = {2019}}

• Skiadopoulos, K., Oikonomou, K., Avlonitis, M., Giannakis, K., Kogias, D., & Stavrakakis, I.. (2019). Multiple and Replicated Random Walkers Analysis for Service Discovery in Fog Computing IoT Environments. Ad hoc networks, 93, 101893.
  [Bibtex]

  @article{skiadopoulos2019multiple,
  abstract = {The multiple random walkers mechanism is revisited in this paper for service discovery purposes considering modern dynamic network environments like the Internet of Things (IoT), where there is a need for certain services (e.g., virtual network functions) to be available to the end users through fog computing devices. Network coverage is analytically investigated here considering multiple random walkers in soft random geometric graph topologies of various densities. It is shown that as the number of random walkers increases, then coverage linearly increases in the considered topologies. The analytical findings of this work are shown to be in accordance with other results in the literature (e.g., coverage under multiple random walkers for fully connected network topologies). Moreover, for certain coverage and time constraints (i.e., the minimum fraction of network nodes to be covered within a certain time period that is of practical importance in the considered environment), the required minimum number of random walkers satisfying these constraints is also analytically derived. A replication mechanism that allows random walkers to replicate themselves after a fixed number of time steps is also analytically investigated here with respect to coverage for various topology densities. Simulation results demonstrate the effectiveness of multiple random walkers for service discovery purposes in the considered fog computing IoT environment and support the claims and expectations of the analysis for both the multiple random walkers and the replicated multiple random walkers mechanism.},
  author = {Konstantinos Skiadopoulos and Konstantinos Oikonomou and Markos Avlonitis and Konstantinos Giannakis and Dimitrios Kogias and Ioannis Stavrakakis},
  date-modified = {2021-11-13 16:34:52 +0200},
  doi = {https://doi.org/10.1016/j.adhoc.2019.101893},
  issn = {1570-8705},
  journal = {Ad Hoc Networks},
  keywords = {own, refereed, olinet, R:CF:ID, R:ID:RW},
  pages = {101893},
  title = {{{Multiple and Replicated Random Walkers Analysis for Service Discovery in Fog Computing IoT Environments}}},
  url = {http://www.sciencedirect.com/science/article/pii/S1570870518308837},
  volume = {93},
  year = {2019},
  Bdsk-Url-1 = {http://www.sciencedirect.com/science/article/pii/S1570870518308837},
  Bdsk-Url-2 = {https://doi.org/10.1016/j.adhoc.2019.101893}}

• Papamichail, A., Dragonas, V., Koufoudakis, G., Oikonomou, K., Tsoumanis, G., & Stavrakakis, I.. (2019). Low-cost Device Implementation of a Topology Independent MAC (TiMAC) Policy. Paper presented at the Third international balkan conference on communications and networking 2019 (balkancom’19), Skopje, North Macedonia.
  [Bibtex]

  @inproceedings{papamichail2019lowcost,
  abstract = {The emerging new paradigm under the upcoming 5G communication paradigm is
  expected to support the multitudes of low-cost devices and an
  all-increasing number of new applications. Considering time-constrained
  applications (e.g., safety applications in vehicular networks) TDMA-based
  medium access control (MAC) policies, like those independent of the
  underlying topology (e.g., TiMAC) need to be revisited and now implemented
  in already existing low-cost devices. For these purposes, here TiMAC is
  considered and it is implemented in low-cost devices using 433 MHz RF
  modules. Even though at this stage the implementation is limited by
  synchronization issues and a small number of nodes, the obtained
  experimental results demonstrate the potential for employing TDMA-based MAC
  policies for safety applications in low-cost devices.},
  address = {Skopje, North Macedonia},
  author = {Papamichail, Asterios and Dragonas, Vasileios and Koufoudakis, George and Oikonomou, Konstantinos and Tsoumanis, Georgios and Stavrakakis, Ioannis},
  booktitle = {Third International Balkan Conference on Communications and Networking 2019 (BalkanCom'19)},
  comment = {[pdf]},
  date-modified = {2021-12-06 10:45:12 +0200},
  days = {9},
  keywords = {own, refereed, olinet, R:MAC:SF},
  month = {6},
  title = {{{Low-cost Device Implementation of a Topology Independent {MAC} {(TiMAC)} Policy}}},
  year = {2019}}

• Skiadopoulos, K., Tsipis, A., Giannakis, K., Koufoudakis, G., Christopoulou, E., Oikonomou, K., Kormentzas, G., & Stavrakakis, I.. (2019). Synchronization of Data Measurements in Wireless Sensor Networks for IoT Applications. Ad hoc networks, 89, 47-57.
  [Bibtex]

  @article{skiadopoulos2019synchronization,
  abstract = {Time synchronization is a challenging problem for wireless sensor networks, as clocks deviate and sensor measurements need to be associated with the reference clock time they took place. In Internet of Things (IoT) environments, crucial factors like energy, robustness, limited capabilities and extreme ambient conditions (e.g., when nodes are deployed in soil) lead researchers to consider various schemes of relaxing the synchronization requirements. In this paper, a lightweight synchronization algorithm is proposed for wireless sensor networks, focusing on synchronizing the particular measurements in a per hop basis as they are transmitted encapsulated in data packets towards the sink node. The aim is to synchronize data measurements instead of node clocks, and thereby, induce negligible extra overhead, since extra messages and re-synchronization periods are not required. The analysis of the proposed algorithm regarding time deviation and the corresponding variance shows a dependency on residual time (i.e., the particular time period a data packet remains within a node), distance (i.e., the number of hops between the sink node and the sensor node that sensed the data in the first place) and the average skew deviation value. Various simulations were carried out aiming to exhibit thoroughly the effectiveness of the proposed algorithm, as well as the validation of the analytical results. Findings from a comparison between the proposed algorithm and a traditional synchronization algorithm along with their simulation results show that the proposed algorithm can be a suitable solution for demanding environments like IoT systems.},
  author = {Skiadopoulos, Konstantinos and Tsipis, Athanasios and Giannakis, Konstantinos and Koufoudakis, George and Christopoulou, Eleni and Oikonomou, Konstantinos and George Kormentzas and Stavrakakis, Ioannis},
  date-modified = {2021-11-13 20:14:21 +0200},
  doi = {https://doi.org/10.1016/j.adhoc.2019.03.002},
  issn = {1570-8705},
  journal = {Ad Hoc Networks},
  keywords = {own, refereed, olinet, exceptional, R:SYNC},
  pages = {47 - 57},
  title = {{{Synchronization of Data Measurements in Wireless Sensor Networks for IoT Applications}}},
  url = {http://www.sciencedirect.com/science/article/pii/S1570870518308825},
  volume = {89},
  year = {2019},
  Bdsk-Url-1 = {http://www.sciencedirect.com/science/article/pii/S1570870518308825},
  Bdsk-Url-2 = {https://doi.org/10.1016/j.adhoc.2019.03.002}}

• Tsipis, A., Komianos, V., & Oikonomou, K.. (2019). A Cloud Gaming Architecture Leveraging Fog for Dynamic Load Balancing in Cluster-Based MMOs. Paper presented at the 2019 4th south-east europe design automation, computer engineering, computer networks and social media conference (seeda-cecnsm).
  [Bibtex]

  @inproceedings{tsipis2019cloud,
  abstract = {Massively Multiplayer Online (MMO) games have been around for quite some time now, attracting millions of users worldwide, making them one of the most successful video game genres. Many load balancing approaches have been proposed over the years in order to optimize Quality of Experience (QoE) and achieve better scalability and user coverage. These usually split the game world into different clusters using a multi-server architecture. However, not many exist that take into consideration conditions that arise from the newly emerged Internet of Everything (IoE) and cloud/fog gaming paradigms. Hence, the aim here is to present a novel cloud gaming architecture that leverages the capabilities of fog computing for achieving a two level dynamic load balancing in cluster-based multi-server MMOs through the use of an appropriate algorithm. The proposed architecture and algorithm are also validated via preliminary simulation experiments, indicating a high user coverage ratio and a balanced distribution of the load in terms of client proportionality in the servers, even under forced strict gaming conditions.},
  author = {Tsipis, Athanasios and Komianos, Vasileios and Oikonomou, Konstantinos},
  booktitle = {2019 4th South-East Europe Design Automation, Computer Engineering, Computer Networks and Social Media Conference (SEEDA-CECNSM)},
  date-modified = {2021-12-06 10:45:41 +0200},
  doi = {10.1109/SEEDA-CECNSM.2019.8908282},
  issn = {null},
  keywords = {own, refereed, olinet, R:CF:ARCH, R:CF:CG},
  month = {9},
  pages = {1-6},
  title = {{{A Cloud Gaming Architecture Leveraging Fog for Dynamic Load Balancing in Cluster-Based MMOs}}},
  venue = {Piraeus, Greece},
  year = {2019},
  Bdsk-Url-1 = {https://doi.org/10.1109/SEEDA-CECNSM.2019.8908282}}

• Tsipis, A., Oikonomou, K., Komianos, V., & Stavrakakis, I.. (2019). Performance Evaluation in Cloud-Edge Hybrid Gaming Systems. Paper presented at the Third international balkan conference on communications and networking 2019 (balkancom’19), Skopje, North Macedonia.
  [Bibtex]

  @inproceedings{tsipis2019performance,
  abstract = {Cloud gaming architectures have emerged in efforts to provide efficient
  execution of computer video games in computer machines and mobile devices
  with low processing/rendering capabilities. Such approaches are prone to
  network delays since the rendering process is offloaded to the cloud,
  hence, increasing cloud's computational needs and decreasing user coverage.
  To tackle this challenge cloud-edge hybrid gaming systems were proposed in
  order to reduce network latency and improve user experience. By deploying
  rendering devices at the edge of the cloud and in close proximity to the
  end users, cloud-edge hybrid systems aim at augmenting the cloud's
  computational capacity and reducing the game's response time. In current
  work a preliminary simulation model to evaluate the performance of such
  systems and test the above hypothesis is presented, showing that cloud-edge
  hybrid gaming systems are able to outperform conventional cloud gaming
  architectures in latency reduction.},
  address = {Skopje, North Macedonia},
  author = {Athanasios Tsipis and Konstantinos Oikonomou and Vasileios Komianos and Ioannis Stavrakakis},
  booktitle = {Third International Balkan Conference on Communications and Networking 2019 (BalkanCom'19)},
  comment = {[pdf]},
  date-modified = {2021-11-13 16:22:05 +0200},
  days = {9},
  keywords = {own, refereed, olinet, R:CF:ARCH, R:CF:CG},
  month = {6},
  title = {{{Performance Evaluation in {Cloud-Edge} Hybrid Gaming Systems}}},
  year = {2019}}

• Kabassi, K., Amelio, A., Komianos, V., & Oikonomou, K.. (2019). Evaluating Museum Virtual Tours: The Case Study of Italy. Information, 10(11).
  [Bibtex]

  @article{kabasi2019evaluating,
  abstract = {Virtual tours in museums are an ideal solution for those that are not able to visit a museum or those who want to have a small taste of what is presented in the museum before their visit. However, these tours often encounter severe problems while users interact with them. In order to check the status of virtual tours of museums, we present the implementation of an evaluation experiment that uses a combination of two multi-criteria decision making theories, namely the analytic hierarchy process (AHP) and the fuzzy technique for order of preference by similarity to ideal solution (TOPSIS). AHP has been used for the estimation of the weights of the heuristics and fuzzy TOPSIS has been used for the evaluation of virtual tours of museums. This paper presents the exact steps that have to be followed in order to implement such an experiment and run an example experiment for virtual tours of Italian museums.},
  article-number = {351},
  author = {Kabassi, Katerina and Amelio, Alessia and Komianos, Vasileios and Oikonomou, Konstantinos},
  doi = {10.3390/info10110351},
  issn = {2078-2489},
  journal = {Information},
  keywords = {own, refereed},
  number = {11},
  title = {{{Evaluating Museum Virtual Tours: The Case Study of Italy}}},
  url = {https://www.mdpi.com/2078-2489/10/11/351},
  volume = {10},
  year = {2019},
  Bdsk-Url-1 = {https://www.mdpi.com/2078-2489/10/11/351},
  Bdsk-Url-2 = {https://doi.org/10.3390/info10110351}}

• Komianos, V., & Oikonomou, K.. (2019). A Prototype System for Automatic Design of Virtual Exhibitions Integrating Cultural Assets From Public Repositories. Paper presented at the 1st international workshop on visual pattern extraction and recognition for cultural heritage understanding (viperc 2019).
  [Bibtex]

  @inproceedings{komianos2019prototype,
  abstract = {In this work a prototype system for automatic design of cul- tural virtual exhibitions is presented. The system is designed to make use of digitized cultural heritage assets which are suitable for integration in virtual reality systems and applications. The demonstration system re- trieves digital objects and related data from Europeana according to user preferences, creates adaptive virtual exhibitions hosting the retrieved ob- jects and enables users to access the available content. Additionally, the presented system sets the ground for further research on the use of in- telligent methods for information retrieval and content personalization towards the enhancement of cultural understanding while drawing guide- lines for mixed reality, virtual reality and cloud based solutions for digital heritage.},
  author = {Komianos, Vasileios and Oikonomou, Konstantinos},
  booktitle = {1st International Workshop on Visual Pattern Extraction and Recognition for Cultural Heritage Understanding (VIPERC 2019)},
  date-modified = {2021-12-06 10:43:00 +0200},
  keywords = {own, refereed, olinet, R:VR},
  month = {1},
  pages = {107-118},
  title = {{{A Prototype System for Automatic Design of Virtual Exhibitions Integrating Cultural Assets From Public Repositories}}},
  url = {http://ceur-ws.org/Vol-2320/paper10.pdf},
  venue = {Pisa, Italy},
  year = {2019},
  Bdsk-Url-1 = {http://ceur-ws.org/Vol-2320/paper10.pdf}}

• Skiadopoulos, K., Tsipis, A., Giannakis, K., Koufoudakis, G., Christopoulou, E., Oikonomou, K., Kormentzas, G., & Stavrakakis, I.. (2019). Synchronization of data measurements in wireless sensor networks for iot applications. Ad hoc networks, 89, 47–57.
  [Bibtex]

  @article{skiadopoulos2019synchronization,
  title={Synchronization of data measurements in wireless sensor networks for IoT applications},
  author={Skiadopoulos, Konstantinos and Tsipis, Athanasios and Giannakis, Konstantinos and Koufoudakis, George and Christopoulou, Eleni and Oikonomou, Konstantinos and Kormentzas, George and Stavrakakis, Ioannis},
  journal={Ad Hoc Networks},
  volume={89},
  pages={47--57},
  year={2019},
  publisher={Elsevier}
  }

• Karageorgiou, Z., Mavrommati, E., Christopoulou, E., & Fotaris, P.. (2019). Escape room as learning environment: combining technology, theater and creative writing in education. Paper presented at the 2nd international conference digital culture & audiovisual challenges 2019 (dcac 2019).
  [Bibtex]

  @inproceedings{karageorgiou2019escape,
  title={Escape Room as learning environment: combining technology, theater and creative writing in education},
  author={Karageorgiou, Zoi and Mavrommati, Eirini and Christopoulou, Eleni and Fotaris, Panagiotis},
  booktitle={2nd International Conference Digital Culture & AudioVisual Challenges
  2019 (DCAC 2019)},
  year={2019},
  institution={EasyChair}
  }

• Magioladitis, M., Ringas, D., & Christopoulou, E.. (2019). Promoting cultural heritage via gamification and augmented reality. Paper presented at the 2nd international conference digital culture & audiovisual challenges 2019 (dcac 2019).
  [Bibtex]

  @inproceedings{magioladitis2019promoting,
  title={Promoting cultural heritage via gamification and augmented reality},
  author={Magioladitis, Marios and Ringas, Dimitrios and Christopoulou, Eleni},
  booktitle={2nd International Conference Digital Culture & AudioVisual Challenges
  2019 (DCAC 2019)},
  year={2019},
  institution={EasyChair}
  }

• Stasinopoulos, A., Ntantogian, C., & Xenakis, C.. (2019). Commix: automating evaluation and exploitation of command injection vulnerabilities in web applications. International journal of information security, 18(1), 49–72.
  [Bibtex]

  @article{stasinopoulos2019commix,
  title={Commix: automating evaluation and exploitation of command injection vulnerabilities in Web applications},
  author={Stasinopoulos, Anastasios and Ntantogian, Christoforos and Xenakis, Christos},
  journal={International Journal of Information Security},
  volume={18},
  number={1},
  pages={49--72},
  year={2019},
  publisher={Springer Berlin Heidelberg}
  }

• Ntantogian, C., Malliaros, S., & Xenakis, C.. (2019). Evaluation of password hashing schemes in open source web platforms. Computers & security, 84, 206–224.
  [Bibtex]

  @article{ntantogian2019evaluation,
  title={Evaluation of password hashing schemes in open source web platforms},
  author={Ntantogian, Christoforos and Malliaros, Stefanos and Xenakis, Christos},
  journal={Computers \& Security},
  volume={84},
  pages={206--224},
  year={2019},
  publisher={Elsevier Advanced Technology}
  }

• Ntantogian, C., Poulios, G., Karopoulos, G., & Xenakis, C.. (2019). Transforming malicious code to rop gadgets for antivirus evasion. Iet information security.
  [Bibtex]

  @article{ntantogian2019transforming,
  title={Transforming Malicious Code to ROP Gadgets for Antivirus Evasion},
  author={Ntantogian, Christoforos and Poulios, Giorgos and Karopoulos, Georgios and Xenakis, Christos},
  journal={IET Information Security},
  year={2019},
  publisher={IET}
  }

• Ntantogian, C., Veroni, E., Karopoulos, G., & Xenakis, C.. (2019). A survey of voice and communication protection solutions against wiretapping. Computers & electrical engineering, 77, 163–178.
  [Bibtex]

  @article{ntantogian2019survey,
  title={A survey of voice and communication protection solutions against wiretapping},
  author={Ntantogian, Christoforos and Veroni, Eleni and Karopoulos, Georgios and Xenakis, Christos},
  journal={Computers \& Electrical Engineering},
  volume={77},
  pages={163--178},
  year={2019},
  publisher={Elsevier}
  }

• Koutroumpouchos, N., Ntantogian, C., Menesidou, S., Liang, K., Gouvas, P., Xenakis, C., & Giannetsos, T.. (2019). Secure edge computing with lightweight control-flow property-based attestation. Paper presented at the 2019 ieee conference on network softwarization (netsoft).
  [Bibtex]

  @inproceedings{koutroumpouchos2019secure,
  title={Secure edge computing with lightweight control-flow property-based attestation},
  author={Koutroumpouchos, Nikos and Ntantogian, Christoforos and Menesidou, Sofia-Anna and Liang, Kaitai and Gouvas, Panagiotis and Xenakis, Christos and Giannetsos, Thanassis},
  booktitle={2019 IEEE Conference on Network Softwarization (NetSoft)},
  pages={84--92},
  year={2019},
  organization={IEEE}
  }

• Bolgouras, V., Ntantogian, C., Panaousis, E., & Xenakis, C.. (2019). Distributed key management in microgrids. Ieee transactions on industrial informatics.
  [Bibtex]

  @article{bolgouras2019distributed,
  title={Distributed Key Management in Microgrids},
  author={Bolgouras, Vaios and Ntantogian, Christoforos and Panaousis, Emmanouil and Xenakis, Christos},
  journal={IEEE Transactions on Industrial Informatics},
  year={2019},
  publisher={IEEE}
  }

• Ntantogian, C., Xenakis, C., & Lopez, J.. (2019). Sealedgrid: a secure interconnection of technologies for smart grid applications. Paper presented at the Critical information infrastructures security: 14th international conference, critis 2019, linköping, sweden, september 23–25, 2019, revised selected papers.
  [Bibtex]

  @inproceedings{ntantogian2019sealedgrid,
  title={SealedGRID: A Secure Interconnection of Technologies for Smart Grid Applications},
  author={Ntantogian, Christoforos and Xenakis, Christos and Lopez, Javier},
  booktitle={Critical Information Infrastructures Security: 14th International Conference, CRITIS 2019, Link{\"o}ping, Sweden, September 23--25, 2019, Revised Selected Papers},
  volume={11777},
  pages={169},
  year={2019},
  organization={Springer Nature}
  }

• Koutroumpouchos, N., Lavdanis, G., Veroni, E., Ntantogian, C., & Xenakis, C.. (2019). Objectmap: detecting insecure object deserialization. Paper presented at the Proceedings of the 23rd pan-hellenic conference on informatics.
  [Bibtex]

  @inproceedings{koutroumpouchos2019objectmap,
  title={ObjectMap: detecting insecure object deserialization},
  author={Koutroumpouchos, Nikolaos and Lavdanis, Georgios and Veroni, Eleni and Ntantogian, Christoforos and Xenakis, Christos},
  booktitle={Proceedings of the 23rd Pan-Hellenic Conference on Informatics},
  pages={67--72},
  year={2019}
  }

• Bampatsikos, M., Ntantogian, C., Xenakis, C., & Thomopoulos, S. C.. (2019). Barrett blockchain regulated remote attestation. Paper presented at the Ieee/wic/acm international conference on web intelligence-companion volume.
  [Bibtex]

  @inproceedings{bampatsikos2019barrett,
  title={BARRETT BlockchAin Regulated REmote aTTestation},
  author={Bampatsikos, Michail and Ntantogian, Christoforos and Xenakis, Christos and Thomopoulos, Stelios CA},
  booktitle={IEEE/WIC/ACM International Conference on Web Intelligence-Companion Volume},
  pages={256--262},
  year={2019}
  }

• Farao, A., Rubio, J. E., Alcaraz, C., Ntantogian, C., Xenakis, C., & Lopez, J.. (2019). Sealedgrid: a secure interconnection of technologies for smart grid applications. Paper presented at the International conference on critical information infrastructures security.
  [Bibtex]

  @inproceedings{farao2019sealedgrid,
  title={SealedGRID: A Secure Interconnection of Technologies for Smart Grid Applications},
  author={Farao, Aristeidis and Rubio, Juan Enrique and Alcaraz, Cristina and Ntantogian, Christoforos and Xenakis, Christos and Lopez, Javier},
  booktitle={International Conference on Critical Information Infrastructures Security},
  pages={169--175},
  year={2019},
  organization={Springer}
  }

• Jiang, H., Siponen, M., & Tsohou, A.. (2019). A field experiment for understanding the unintended impact of internet monitoring on employees: policy satisfaction, organizational citizenship behaviour and work motivation. Paper presented at the 27th european conference on information systems (ecis).
  [Bibtex]

  @inproceedings{jiang2019field,
  title={A FIELD EXPERIMENT FOR UNDERSTANDING THE UNINTENDED IMPACT OF INTERNET MONITORING ON EMPLOYEES: POLICY SATISFACTION, ORGANIZATIONAL CITIZENSHIP BEHAVIOUR AND WORK MOTIVATION},
  author={Jiang, Hemin and Siponen, Mikko and Tsohou, Aggeliki},
  booktitle={27th European Conference on Information Systems (ECIS)},
  year={2019}
  }

• Piras, L., Al-Obeidallah, M. G., Praitano, A., Tsohou, A., Mouratidis, H., Crespo, B. G., Bernard, J. B., Fiorani, M., Magkos, E., Sanz, A. C., & others. (2019). Defend architecture: a privacy by design platform for gdpr compliance. Paper presented at the International conference on trust and privacy in digital business.
  [Bibtex]

  @inproceedings{piras2019defend,
  title={DEFeND architecture: a privacy by design platform for GDPR compliance},
  author={Piras, Luca and Al-Obeidallah, Mohammed Ghazi and Praitano, Andrea and Tsohou, Aggeliki and Mouratidis, Haralambos and Crespo, Beatriz Gallego-Nicasio and Bernard, Jean Baptiste and Fiorani, Marco and Magkos, Emmanouil and Sanz, Andres Castillo and others},
  booktitle={International Conference on Trust and Privacy in Digital Business},
  pages={78--93},
  year={2019},
  organization={Springer, Cham}
  }

• Diamantopoulou, V., Tsohou, A., & Karyda, M.. (2019). General data protection regulation and iso/iec 27001: 2013: synergies of activities towards organisations’ compliance. Paper presented at the International conference on trust and privacy in digital business.
  [Bibtex]

  @inproceedings{diamantopoulou2019general,
  title={General data protection regulation and ISO/IEC 27001: 2013: synergies of activities towards organisations’ compliance},
  author={Diamantopoulou, Vasiliki and Tsohou, Aggeliki and Karyda, Maria},
  booktitle={International Conference on Trust and Privacy in Digital Business},
  pages={94--109},
  year={2019},
  organization={Springer, Cham}
  }

• Lavranou, R., & Tsohou, A.. (2019). Developing and validating a common body of knowledge for information privacy. Information & computer security.
  [Bibtex]

  @article{lavranou2019developing,
  title={Developing and validating a common body of knowledge for information privacy},
  author={Lavranou, Rena and Tsohou, Aggeliki},
  journal={Information \& Computer Security},
  year={2019},
  publisher={Emerald Publishing Limited}
  }

• Soumelidou, A., & Tsohou, A.. (2019). Effects of privacy policy visualization on users’ information privacy awareness level. Information technology & people.
  [Bibtex]

  @article{soumelidou2019effects,
  title={Effects of privacy policy visualization on users’ information privacy awareness level},
  author={Soumelidou, Aikaterini and Tsohou, Aggeliki},
  journal={Information Technology \& People},
  year={2019},
  publisher={Emerald Publishing Limited}
  }

• Diamantopoulou, V., Tsohou, A., & Karyda, M.. (2019). From iso/iec 27002: 2013 information security controls to personal data protection controls: guidelines for gdpr compliance. In Computer security (pp. 238–257). Springer, cham.
  [Bibtex]

  @incollection{diamantopoulou2019iso,
  title={From ISO/IEC 27002: 2013 information security controls to personal data protection controls: guidelines for GDPR compliance},
  author={Diamantopoulou, Vasiliki and Tsohou, Aggeliki and Karyda, Maria},
  booktitle={Computer Security},
  pages={238--257},
  year={2019},
  publisher={Springer, Cham}
  }

• Tsohou, A., Magkos, M., Mouratidis, H., Chrysoloras, G., Piras, L., Pavlidis, M., Debussche, J., Rotoloni, M., & Crespo, B. G.. (2019). Privacy, security, legal and technology acceptance requirements for a gdpr compliance platform. In Computer security (pp. 204–223). Springer, cham.
  [Bibtex]

  @incollection{tsohou2019privacy,
  title={Privacy, security, legal and technology acceptance requirements for a GDPR compliance platform},
  author={Tsohou, Aggeliki and Magkos, Manos and Mouratidis, Haralambos and Chrysoloras, George and Piras, Luca and Pavlidis, Michalis and Debussche, Julien and Rotoloni, Marco and Crespo, Beatriz Gallego-Nicasio},
  booktitle={Computer Security},
  pages={204--223},
  year={2019},
  publisher={Springer, Cham}
  }

• Gritzalis, A., Tsohou, A., & Lambrinoudakis, C.. (2019). Transparency-enabling information systems: trust relations and privacy concerns in open governance. International journal of electronic governance, 11(3-4), 310–332.
  [Bibtex]

  @article{gritzalis2019transparency,
  title={Transparency-enabling information systems: trust relations and privacy concerns in open governance},
  author={Gritzalis, Aristomenis and Tsohou, Aggeliki and Lambrinoudakis, Costas},
  journal={International Journal of Electronic Governance},
  volume={11},
  number={3-4},
  pages={310--332},
  year={2019},
  publisher={Inderscience Publishers (IEL)}
  }

• Papaioannou, T., Tsohou, A., & Karyda, M.. (2019). Shaping digital identities in social networks: data elements and the role of privacy concerns. In Computer security (pp. 159–180). Springer, cham.
  [Bibtex]

  @incollection{papaioannou2019shaping,
  title={Shaping digital identities in social networks: Data elements and the role of privacy concerns},
  author={Papaioannou, Thanos and Tsohou, Aggeliki and Karyda, Maria},
  booktitle={Computer security},
  pages={159--180},
  year={2019},
  publisher={Springer, Cham}
  }

2018

• Demertzis, A., & Oikonomou, K.. (2018). Average Load Definition in Random Wireless Sensor Networks: The Traffic Load Case. Technologies, 6(4).
  [Bibtex]

  @article{demertzis2018average,
  abstract = {Load is a key magnitude for studying network performance for large-scale wireless sensor networks that are expected to support pervasive applications like personalized health-care, smart city and smart home, etc., in assistive environments (e.g., those supported by the Internet of Things). In these environments, nodes are usually spread at random, since deliberate positioning is not a practical approach. Due to this randomness it is necessary to use average values for almost all network's magnitudes, load being no exception. However, a consistent definition for the average load is not obvious, since both nodal load and position are random variables. Current literature circumvents randomness by computing the average value over nodes that happen to fall within small areas. This approach is insufficient, because the area's average is still a random variable and also it does not permit us to deal with single points. This paper proposes a definition for the area's average load, based on the statistical expected value, whereas a point's average load is seen as the load of an area that has been reduced (or contracted) to that point. These new definitions are applied in the case of traffic load in multi-hop networks. An interesting result shows that traffic load increases in steps. The simplest form of this result is the constant step, which results in an analytical expression for the traffic load case. A comparison with some real-world networks shows that most of them are accurately described by the constant step model.},
  article-number = {112},
  author = {Demertzis, Apostolos and Oikonomou, Konstantinos},
  date-modified = {2021-11-13 20:43:37 +0200},
  doi = {10.3390/technologies6040112},
  issn = {2227-7080},
  journal = {Technologies},
  keywords = {own, refereed,olinet,R:ENERGY:LR},
  number = {4},
  title = {{{Average Load Definition in Random Wireless Sensor Networks: The Traffic Load Case}}},
  url = {http://www.mdpi.com/2227-7080/6/4/112},
  volume = {6},
  year = {2018},
  Bdsk-Url-1 = {http://www.mdpi.com/2227-7080/6/4/112},
  Bdsk-Url-2 = {https://doi.org/10.3390/technologies6040112}}

• Demertzis, A., & Oikonomou, K.. (2018). Analysis of Concise “Average Load” Definitions in Uniformly Random Deployed Wireless Sensor Networks. Paper presented at the Proceedings of the 11th pervasive technologies related to assistive environments conference, New York, NY, USA.
  [Bibtex]

  @inproceedings{demertzis2018load,
  abstract = {A key issue in studying the performance of wireless sensor networks is the study of load and, depending on the case, different definitions can be found in the literature. These definitions may vary significantly and they may not allow for further investigation of particular aspects of the network's behavior, thus impending the researcher's work. The purpose of this paper is to lift any ambiguities with respect to widely used load definitions, analyze their properties and provide for a new perspective to study wireless sensor networks' performance, particularly for the case of uniform random node deployment. First, definitions regarding the node load, the average area load and the average point load, the most widely used cases considered in the literature, are presented. Subsequently, the relation among these definitions is analytically investigated, resulting in an analytical expression between the average area load and the average load of the points within this area. As it is concluded, average load can be seen as a property of every single point, even if that point is not occupied by a sensor, which introduces a difierent way to tackle average load problems in wireless sensor network environments.},
  acmid = {3201536},
  address = {New York, NY, USA},
  author = {Demertzis, Apostolos and Oikonomou, Konstantinos},
  booktitle = {Proceedings of the 11th PErvasive Technologies Related to Assistive Environments Conference},
  date-modified = {2021-11-13 20:43:13 +0200},
  doi = {10.1145/3197768.3201536},
  isbn = {978-1-4503-6390-7},
  keywords = {own, refereed,olinet,R:ENERGY:LR},
  location = {Corfu, Greece},
  numpages = {6},
  pages = {17--22},
  publisher = {ACM},
  series = {PETRA '18},
  title = {{{Analysis of Concise ``Average Load'' Definitions in Uniformly Random Deployed Wireless Sensor Networks}}},
  year = {2018},
  Bdsk-Url-1 = {https://doi.org/10.1145/3197768.3201536}}

• Tsoumanis, G., Oikonomou, K., Koufoudakis, G., & Aïssa, S.. (2018). Energy-Efficient Sink Placement in Wireless Sensor Networks. Computer networks, 141, 166-178.
  [Bibtex]

  @article{tsoumanis2018energy,
  abstract = {Prolonging a wireless sensor network's lifetime is closely related to energy consumption and particularly the energy hole problem, where sensor nodes close to the sink consume a considerable amount of their energy for relaying purposes. To tackle the energy hole problem's effects, this paper proposes an analytical model for analyzing the available energy in the network. The next step is to analytically model the overall energy consumption as a k-median facility location problem, its solution corresponding to the location of k sinks in the network. As analytically shown, when k sinks are placed according to the solution of the previous facility location problem, then the overall energy consumption is minimized, resulting in a higher energy-saving system. Thus, the saved energy can be further utilized, e.g., to extend the network's lifetime and support modern replenishing techniques such as energy harvesting and battery recharging. Simulation results validate the analytical model that is the basis of the analysis and confirm the results with respect to the available energy in the network. In particular, significant energy savings are observed when the analytical results are applied, thus resulting in better energy utilization and subsequent network lifetime increment.},
  author = {Tsoumanis, Georgios and Oikonomou, Konstantinos and Koufoudakis, Georgios and A{\"i}ssa, Sonia},
  date-modified = {2022-07-01 12:33:37 +0300},
  doi = {10.1016/j.comnet.2018.05.029},
  issn = {1389-1286},
  journal = {Computer Networks},
  keywords = {own, sonia, refereed, olinet,R:ENERGY:FLP},
  pages = {166 - 178},
  title = {{{Energy-Efficient Sink Placement in Wireless Sensor Networks}}},
  volume = {141},
  year = {2018},
  Bdsk-Url-1 = {https://doi.org/10.1016/j.comnet.2018.05.029}}

• Tsoumanis, G., Oikonomou, K., Aïssa, S., & Stavrakakis, I.. (2018). Performance Evaluation of a Proposed On-Demand Recharging Policy in Wireless Sensor Networks. Paper presented at the 2018 ieee 19th international symposium on “a world of wireless, mobile and multimedia networks” (wowmom) (ieee wowmom 2018), Chania, Crete, Greece.
  [Bibtex]

  @inproceedings{tsoumanis2018performance,
  abstract = {In order to tackle the energy hole problem in wireless sensor networks,
  various recharging policies have been proposed attempting to keep the
  average energy level high and the recharging distance (i.e., the distance
  covered by a mobile recharger) low. As shown in the literature, the
  recharging distance is minimized when the basis of the mobile recharger is
  located at the solution of a median problem that takes into account both
  distance and traffic demands. In this paper, a novel on-demand recharging
  policy is proposed based on local information, where the mobile recharger
  moves - upon request - to a target node of reduced energy level and
  replenishes its battery. Under the proposed policy, the mobile recharger
  moves in a hop-by-hop manner to the neighbor nodes of the lowest energy
  level, starting from the target node. The effectiveness of this policy is
  investigated here using simulation results and compared against an existing
  well-known on-demand recharging policy that exploits global knowledge
  (i.e., knowledge of both the energy level of all nodes and the network
  topology). It is shown that the proposed policy, even though based on local
  information, maintain the average energy level and termination time higher
  than that under the existing one that exploits global knowledge.
  Furthermore, it is observed that the network's lifetime is maximized when
  the basis of the mobile recharger is located at the solution of the
  mentioned median problem for all studied policies.},
  address = {Chania, Crete, Greece},
  author = {Tsoumanis, Georgios and Oikonomou, Konstantinos and A{\"i}ssa, Sonia and Stavrakakis, Ioannis},
  booktitle = {2018 IEEE 19th International Symposium on {"}A World of Wireless, Mobile and Multimedia Networks{"} (WoWMoM) (IEEE WoWMoM 2018)},
  date-modified = {2021-12-06 16:27:51 +0200},
  doi = {10.1109/WoWMoM.2018.8449796},
  keywords = {own, sonia, refereed, olinet,R:ENERGY:FLP},
  month = {6},
  pages = {14-19},
  title = {{{Performance Evaluation of a Proposed On-Demand Recharging Policy in Wireless Sensor Networks}}},
  year = {2018},
  Bdsk-Url-1 = {https://doi.org/10.1109/WoWMoM.2018.8449796}}

• Tsoumanis, G., Oikonomou, K., Aïssa, S., & Stavrakakis, I.. (2018). A Recharging Distance Analysis for Wireless Sensor Networks. Ad hoc networks, 75-76, 80-86.
  [Bibtex]

  @article{tsoumanis2018recharging,
  abstract = {Efficient energy consumption is a challenging problem in wireless sensor networks especially close to the sink node, known as the energy hole problem. Various policies for recharging battery exhausted nodes have been proposed using special recharging vehicles. The focus in this paper is on a simple recharging policy that permits a recharging vehicle, stationed at the sink node, to move around and replenish any node's exhausted battery when a certain recharging threshold is violated. The minimization of the recharging distance covered by the recharging vehicle is shown to be a facility location problem, and particularly a 1-median one. Simulation results investigate various aspects of the recharging policy -- including an enahnced version -- related to the recharging threshold and the level of the energy left in the network nodes' batteries. In addition, it is shown that when the sink's positioning is set to the solution of the particular facility location problem, then the recharging distance is minimized irrespectively of the recharging threshold.},
  author = {Tsoumanis, Georgios and Oikonomou, Konstantinos and A{\"i}ssa, Sonia and Stavrakakis, Ioannis},
  date-modified = {2022-07-01 12:33:08 +0300},
  doi = {10.1016/j.adhoc.2018.03.003},
  issn = {1570-8705},
  journal = {Ad Hoc Networks},
  keywords = {own, sonia, refereed, olinet,R:ENERGY:FLP},
  pages = {80 - 86},
  title = {{{A Recharging Distance Analysis for Wireless Sensor Networks}}},
  volume = {75-76},
  year = {2018},
  Bdsk-Url-1 = {https://doi.org/10.1016/j.adhoc.2018.03.003}}

• Demertzis, A., Oikonomou, K., & Stavrakakis, I.. (2018). An Adjustable Forwarding Policy Exploiting Path Vulnerability in Wireless Sensor Networks. Paper presented at the Second international balkan conference on communications and networking 2018 (balkancom’18), Podgorica, Montenegro.
  [Bibtex]

  @inproceedings{demertzis2018adjustable,
  abstract = {Forwarding data packets in a wireless sensor network is a challenging task
  due to the energy hole problem that affects the network's operation. Taking
  into account path vulnerability, i.e., a metric based on the transmission
  distance and the energy left at the nodes' batteries, an adjustable policy
  is proposed here that allows nodes to choose different parent nodes for
  forwarding their data packets towards the sink node. Path vulnerabilities
  are propagated in the network with reduced overall overhead (e.g., no need
  to construct continuously routing trees). As it is demonstrated using
  simulation results, the proposed forwarding policy increases the time
  period until the first node runs out of energy when compared to other five
  similar policies. Throughput is also increased and the proposed policy's
  performance is close to the other policies with respect to network
  lifetime, overhead and latency.},
  address = {Podgorica, Montenegro},
  author = {Demertzis, Apostolos and Oikonomou, Konstantinos and Stavrakakis, Ioannis},
  booktitle = {Second International Balkan Conference on Communications and Networking 2018 (BalkanCom'18)},
  comment = {[pdf]},
  date-modified = {2021-12-06 10:41:41 +0200},
  days = {3},
  keywords = {own, refereed, olinet,R:ENERGY:LR},
  month = {6},
  title = {{{An Adjustable Forwarding Policy Exploiting Path Vulnerability in Wireless Sensor Networks}}},
  year = {2018}}

• Skiadopoulos, K., Giannakis, K., Oikonomou, K., Stavrakakis, I., & Aïssa, S.. (2018). Distributed Construction of d-Hop Connected Dominating Sets for Wireless Sensor Networks. Paper presented at the 2018 ieee global communications conference (globecom).
  [Bibtex]

  @inproceedings{skiadopoulos2018distributed,
  abstract = {Several critical operations such as, data collection, routing, service discovery, etc., employ various types of information dissemination in order to be carried out. To avoid costly flooding-based solutions reaching out to all nodes, it is frequently sufficient that only a proper subset of the nodes (or backbone network) be involved, i.e., the one ensuring that every other node will be at most $d$ hops away from a node belonging to the said subset of nodes. Finding this subset is equivalent to the construction of a d-hop Connected Dominating Set (d-CDS). Given the high complexity (non-polynomial) and the requirement of global information for constructing a Minimum d-CDS (d-MCDS), in this paper a distributed algorithm that relies on local information (i.e., $d$ hops away) to construct an approximation of the d-MCDS is developed. The proposed algorithm is studied and compared against a centralized one that is an approximate solution for the minimum d-MCDS problem, and a recently proposed distributed one. It is shown that the size of the constructed d-CDS under the proposed algorithm is (i) close and sometimes smaller than that under the recently proposed one; and (ii) close to the centralized one. In addition, the number of transmitted messages is significantly reduced under the proposed algorithm, which is important for preserving energy resources in wireless sensor networks.},
  author = {Skiadopoulos, Konstantinos and Giannakis, Konstantinos and Oikonomou, Konstantinos and Stavrakakis, Ioannis and A{\"i}ssa, Sonia},
  booktitle = {2018 IEEE Global Communications Conference (GLOBECOM)},
  date-modified = {2021-11-13 16:38:18 +0200},
  doi = {10.1109/GLOCOM.2018.8647369},
  issn = {2576-6813},
  keywords = {own, sonia, refereed, exceptional, olinet, R:CF:ID, R:ID:DS},
  month = {12},
  pages = {1-7},
  title = {{{Distributed Construction of d-Hop Connected Dominating Sets for Wireless Sensor Networks}}},
  year = {2018},
  Bdsk-Url-1 = {https://doi.org/10.1109/GLOCOM.2018.8647369}}

• Koufoudakis, G., Oikonomou, K., & Tsoumanis, G.. (2018). Adapting Probabilistic Flooding in Energy Harvesting Wireless Sensor Networks. Journal of sensor and actuator networks, 7(3), 39.
  [Bibtex]

  @article{koufoudakis2018adapting,
  abstract = {Technological advantages in energy harvesting have been successfully applied in wireless sensor network environments, prolonging network's lifetime, and, therefore, classical networking approaches like information dissemination need to be readdressed. More specifically, Probabilistic Flooding information dissemination is revisited in this work and it is observed that certain limitations arise due to the idiosyncrasies of nodes' operation in energy harvesting network environments, resulting in reduced network coverage. In order to address this challenge, a modified version of Probabilistic Flooding is proposed, called Robust Probabilistic Flooding, which is capable of dealing with nodes of about to be exhausted batteries that resume their operation after ambient energy collection. In order to capture the behavior of the nodes' operational states, a Markov chain model is also introduced and -- based on certain observations and assumptions presented here -- is subsequently simplified. Simulation results based on the proposed Markov chain model and a solar radiation dataset demonstrate the inefficiencies of Probabilistic Flooding and show that its enhanced version (i.e., Robust Probabilistic Flooding) is capable of fully covering the network on the expense of increased termination time in energy harvesting environments. Another advantage is that no extra overhead is introduced regarding the number of disseminated messages, thus not introducing any extra transmissions and therefore the consumed energy does not increase.},
  author = {Koufoudakis, George and Oikonomou, Konstantinos and Tsoumanis, Georgios},
  date-modified = {2021-11-13 16:27:08 +0200},
  doi = {10.3390/jsan7030039},
  journal = {Journal of Sensor and Actuator Networks},
  keywords = {own, refereed, olinet, R:ID:PF},
  number = {3},
  pages = {39},
  title = {{{Adapting Probabilistic Flooding in Energy Harvesting Wireless Sensor Networks}}},
  volume = {7},
  year = {2018},
  Bdsk-Url-1 = {https://doi.org/10.3390/jsan7030039}}

• Koufoudakis, G., Oikonomou, K., Aïssa, S., & Stavrakakis, I.. (2018). Analysis of Spectral Properties for Efficient Coverage Under Probabilistic Flooding. Paper presented at the 2018 ieee 19th international symposium on a world of wireless, mobile and multimedia networks (wowmom) (ieee wowmom 2018), Chania, Crete, Greece.
  [Bibtex]

  @inproceedings{koufoudakis2018analysis,
  abstract = {Information dissemination plays a crucial role in modern network
  environments being an integral part of various vital processes (e.g.,
  service discovery, data collection, routing). Probabilistic flooding has
  been proposed as a suitable alternative to blind flooding in order to
  reduce unnecessary transmissions and save valuable network resources. Under
  probabilistic flooding, an information message, initially located at some
  network node (i.e., the initiator node), is transmitted to neighbor nodes
  according to a forwarding probability attempting to reach all network
  nodes. This paper employs elements from algebraic graph theory to model
  probabilistic flooding behavior and derive analytical results regarding
  coverage (i.e., the number of nodes that have received the information
  message) and a lower bound of the forwarding probability allowing for
  global network outreach. It is also shown here, that for any value of the
  forwarding probability larger than this lower bound, (i) coverage under
  probabilistic flooding, is proportional to the initiator's node eigenvector
  centrality; and (ii) the probability for a node to receive the information
  message is proportional to the particular node's eigenvector centrality.
  Simulations performed for various topologies demonstrate the effectiveness
  of the proposed analytical model and support the analytical results.},
  address = {Chania, Crete, Greece},
  author = {Koufoudakis, George and Oikonomou, Konstantinos and A{\"i}ssa, Sonia and Stavrakakis, Ioannis},
  booktitle = {2018 IEEE 19th International Symposium on A World of Wireless, Mobile and Multimedia Networks (WoWMoM) (IEEE WoWMoM 2018)},
  date-modified = {2022-05-04 11:45:16 +0300},
  doi = {10.1109/WoWMoM.2018.8449800},
  keywords = {own, sonia, exceptional, refereed, olinet, R:ID:LE,R:SA},
  month = {6},
  pages = {1-9},
  title = {{{Analysis of Spectral Properties for Efficient Coverage Under Probabilistic Flooding}}},
  year = {2018},
  Bdsk-Url-1 = {https://doi.org/10.1109/WoWMoM.2018.8449800}}

• Koufoudakis, G., Oikonomou, K., Giannakis, K., & Aïssa, S.. (2018). Probabilistic Flooding Coverage Analysis for Efficient Information Dissemination in Wireless Networks. Computer networks, 140, 51-61.
  [Bibtex]

  @article{koufoudakis2018probabilistic,
  abstract = {Abstract Information dissemination under Probabilistic flooding is revisited here in an attempt to realize full coverage in modern wireless networks and at the same time avoid unnecessary transmissions that waste valuable resources. Approaches like traditional flooding, are not suitable in these typically large scale and inherently dynamic environments due to the large number of transmitted information messages. Probabilistic flooding is capable of pruning unnecessary transmissions, while maintaining a large proportion of the network nodes covered. In this paper, an algebraic-based approach is employed to derive an estimation regarding the particular threshold probability value that would allow for high network coverage and reduced number of sent information messages. For the analysis' purposes, coverage is studied here and eventually modeled as a polynomial; its higher root being related to the threshold probability. By studying this polynomial's roots, the paper's contribution is twofold: (i) results existing in the open literature are confirmed; and (ii) an algorithm is introduced here to estimate the threshold probability. Simulation results confirm the analytical findings and in addition, they demonstrate that the estimated value derived here regarding threshold probability, is suitable for achieving high coverage and reducing the number of transmitted information messages.},
  author = {Koufoudakis, George and Oikonomou, Konstantinos and Giannakis, Konstantinos and A{\"i}ssa, Sonia},
  date-modified = {2022-07-01 12:35:57 +0300},
  doi = {10.1016/j.comnet.2018.05.005},
  issn = {1389-1286},
  journal = {Computer Networks},
  keywords = {own, sonia, refereed, olinet, R:ID:LE, R:SA},
  pages = {51 - 61},
  title = {{{Probabilistic Flooding Coverage Analysis for Efficient Information Dissemination in Wireless Networks}}},
  volume = {140},
  year = {2018},
  Bdsk-Url-1 = {https://doi.org/10.1016/j.comnet.2018.05.005}}

• Skiadopoulos, K., Giannakis, K., Oikonomou, K., & Stavrakakis, I.. (2018). Analysis of Multiple Random Walkers for Service Discovery in Fog Computing Network Environments. Paper presented at the Second international balkan conference on communications and networking 2018 (balkancom’18), Podgorica, Montenegro.
  [Bibtex]

  @inproceedings{skiadopoulos2018analysis,
  abstract = {The multiple random walkers mechanism is revisited in this paper for
  service discovery purposes considering modern dynamic network environments
  like fog computing, where there is a need for certain services (e.g.,
  virtual network functions) to be available to the end users. Network
  coverage is analytically investigated here considering multiple random
  walkers in geometric random graph topologies of various densities. The
  analytical results derived here are shown to be in accordance with other
  results in the literature (e.g., coverage under multiple random walkers for
  fully connected network topologies). Moreover, when there exist certain
  coverage and time constraints (i.e., the fraction of network nodes to be
  covered within a certain time period), the required number of random
  walkers is also analytically derived. Simulation results demonstrate the
  effectiveness of multiple random walkers for service discovery purposes and
  support the claims and expectations of the analysis.},
  address = {Podgorica, Montenegro},
  author = {Skiadopoulos, Konstantinos and Giannakis, Konstantinos and Oikonomou, Konstantinos and Stavrakakis, Ioannis},
  booktitle = {Second International Balkan Conference on Communications and Networking 2018 (BalkanCom'18)},
  comment = {[pdf]},
  date-modified = {2021-12-06 10:45:24 +0200},
  days = {3},
  keywords = {own, refereed, olinet, R:CF:ID, R:ID:RW},
  month = {6},
  title = {{{Analysis of Multiple Random Walkers for Service Discovery in Fog Computing Network Environments}}},
  year = {2018}}

• Dragonas, V., Oikonomou, K., & Stavrakakis, I.. (2018). A Disjoint Frame Topology-Independent TDMA MAC Policy for Safety Applications in Vehicular Networks. Ad hoc networks, 79, 43-52.
  [Bibtex]

  @article{dragonas2018disjoint,
  abstract = {Medium access control (MAC) is a challenging problem in vehicular environments due to a constantly changing topology due to vehicle's mobility and stringent delay requirements, especially for safety-related applications (e.g., for vehicular-to-vehicular communication). Consequently, topology-independent TDMA MAC policies that guarantee a number of successful transmissions per frame independently of the underlying topology, can be regarded as a suitable choice for the particular vehicular environment. One such policy (TiMAC) is revisited and considered in this paper for a vehicular environment and is also extended to one that considers disjoint frames depending on the vehicle's direction of movement (d-TiMAC). Both TiMAC and d-TiMAC are evaluated against VeMAC --- a well-established TDMA MAC protocol in the area of vehicular networks --- based on simulations. It is observed that throughput under the considered TiMAC policy is close to that induced by VeMAC, whereas the number of retransmissions is reduced leading to a smaller time delay. Furthermore, the proposed d-TiMAC appears to achieve a higher throughput than VeMAC, and an even lower number of retransmissions (when compared to TiMAC), suggesting that d-TiMAC yields an even smaller time delay. Eventually, this observation is also supported when d-TiMAC is compared against TiMAC showing a further reduced number of retransmissions.},
  author = {Dragonas, Vasileios and Oikonomou, Konstantinos and Stavrakakis, Ioannis},
  date-modified = {2022-07-01 12:35:01 +0300},
  doi = {10.1016/j.adhoc.2018.06.006},
  issn = {1570-8705},
  journal = {Ad Hoc Networks},
  keywords = {own, refereed, olinet, R:MAC:TI, R:IOT:VE},
  pages = {43 - 52},
  title = {{{A Disjoint Frame Topology-Independent TDMA MAC Policy for Safety Applications in Vehicular Networks}}},
  volume = {79},
  year = {2018},
  Bdsk-Url-1 = {https://doi.org/10.1016/j.adhoc.2018.06.006}}

• Fanarioti, S., Tsipis, A., Giannakis, K., Koufoudakis, G., Christopoulou, E., Oikonomou, K., & Stavrakakis, I.. (2018). A Proposed Algorithm for Data Measurements Synchronization in Wireless Sensor Networks. Paper presented at the Second international balkan conference on communications and networking 2018 (balkancom’18), Podgorica, Montenegro.
  [Bibtex]

  @inproceedings{fanarioti2018proposed,
  abstract = {The proliferation of wireless sensor networks supports numerous areas of
  everyday life and activities. Each sensor node senses some data of interest
  (e.g., humidity, temperature) and the corresponding measurements need to be
  tagged with the reference time (usually sink node's time) they took place,
  in order to be further analyzed (e.g., to exploit time and space
  dimensions). Given that, clocks deviate, time synchronization is a
  challenging problem in this network environment. In this paper, the focus
  is on synchronizing the particular measurements in a per hop basis as they
  are transmitted encapsulated in data packets towards the sink node, instead
  of synchronizing the node clocks thus, inducing no extra overhead.
  Therefore, a synchronization algorithm is proposed here for synchronizing
  the corresponding measurements in a per hop basis based on MAC layer time
  stamping as data packets are transmitted. Analytical results regarding the
  average time deviation and the corresponding variance under the proposed
  algorithm show a dependency on the residual time (i.e., the time period a
  data packet remains with a node), the distance (i.e., the number of hops
  between the sink node and the sensor node that sensed the data initially)
  and the average skew deviation value. The effectiveness of the algorithm as
  well as the validation of the analytical results is demonstrated thoroughly
  using simulation results.},
  address = {Podgorica, Montenegro},
  author = {Fanarioti, Sofia and Tsipis, Athanasios and Giannakis, Konstantinos and Koufoudakis, George and Christopoulou, Eleni and Oikonomou, Konstantinos and Stavrakakis, Ioannis},
  booktitle = {Second International Balkan Conference on Communications and Networking 2018 (BalkanCom'18)},
  comment = {[pdf]},
  date-modified = {2021-12-06 10:42:00 +0200},
  days = {3},
  keywords = {own, refereed, olinet, R:SYNC},
  month = {6},
  title = {{{A Proposed Algorithm for Data Measurements Synchronization in Wireless Sensor Networks}}},
  year = {2018}}

• Tsoumanis, G., Koufoudakis, G., Oikonomou, K., Avlonits, M., & Varotsis, N.. (2018). A Low-Cost Surface Wireless Sensor Network for Pollution Monitoring in the Ionian Sea. Paper presented at the 12th panhellenic symposium of oceanography & fisheries.
  [Bibtex]

  @inproceedings{tsoumanis2018sea,
  abstract = {Wireless sensor networks (Akyildiz, 2002) is a low cost and easily deployed technology in hostle environments like the sea. Sensor technology has been used in sea environments, mainly for scientfc purposes, since the equipments were costly, not easily repairable or widely deployable. The idea here is the development of a system consistng of low-cost sensor nodes widely deployed on the sea surface taking advantage of recent developments on areas of networking, solar engineering and sensors of organic polluton, e.g., (Stach, 2018). The sensed data are expected to be efciently collected in terms of energy consumpton (Tsoumanis, 2018), while the sensor bateries are replenished accordingly to prolong the network's lifetme (Kavvadia, 2014). A set of protocols is developed within low-cost devices (e.g., Arduino) in a way that takes into account the partcular environment. It will be tested and evaluated in a close to reality sea surface environment. The focus is on the low-cost requirement, the network lifetme extension and the resilience in the sea environment. The protocol development process will allow for large-scale manufacturing and the subsequent reduced overall cost per node. The main result is that the developed system satsfes the aforementoned requirements (low- cost, widely deployable, prolonged lifetme) and at the same tme adjusts to new technological advancements. For example, in case new sensors emerge in the future, requiring diferent monitoring procedures, the developed system will be able to seamlessly integrate these changes. A low-cost wireless sensor system for monitoring sea polluton at the surface of the Ionian Sea is designed, tested using simulatons and partly developed in a demo environment facing the challenges of being low-cost, prolonging the network lifetme and delivering data within certain tme constraints. Such a tool is a necessity for the Ionian Sea since from the ancient tmes it has been the main sea route between West and East and motvate a large scale project accordingly.},
  author = {Tsoumanis, Georgios and Koufoudakis, George and Oikonomou, Konstantnos and Avlonits, Markos and Varotsis, Nikos},
  booktitle = {12th Panhellenic Symposium of Oceanography \& Fisheries},
  comment = {[pdf]},
  date-modified = {2021-12-06 10:51:47 +0200},
  keywords = {own, various, R:VAR},
  month = {5},
  note = {Abstract},
  title = {{{A Low-Cost Surface Wireless Sensor Network for Pollution Monitoring in the Ionian Sea}}},
  venue = {Corfu, Greece},
  year = {2018}}

• Polykalas, S., Prezerakos, G., Vlachos, K., & Oikonomou, K.. (2018). Introduction to Robotics for Novice Users: A Case Study from Summer Schools in Greece. European journal of engineering research and science(CIE), 25–29.
  [Bibtex]

  @article{polykalas2018introduction,
  abstract = {The paper conveys experiences and conclusions from the organization of three summer schools aiming at introducing novice users to robotics programming. Issues related to teaching material, teaching approaches, challenges in the classroom and participant's acceptance are all examined in dedicated sections of the paper. The teaching staff's impressions as well as the conclusions drawn from the course evaluation by the participants show that the robots can be successfully employed for introducing novice users, especially schoolchildren, to software development as well as robotic principles.},
  author = {Polykalas, Spyros and Prezerakos, George and Vlachos, Kyriakos and Oikonomou, Konstantinos},
  date-modified = {2021-11-13 21:25:55 +0200},
  doi = {10.24018/ejers.2018.0.CIE.640},
  journal = {European Journal of Engineering Research and Science},
  keywords = {own, refereed, R:VAR},
  number = {CIE},
  pages = {25--29},
  title = {{{Introduction to Robotics for Novice Users: A Case Study from Summer Schools in Greece}}},
  year = {2018},
  Bdsk-Url-1 = {https://doi.org/10.24018/ejers.2018.0.CIE.640}}

• Komianos, V., & Oikonomou, K.. (2018). Adaptive Exhibition Topologies for Personalized Virtual Museums. Paper presented at the The first future of heritage science and technologies conference, (heri-tech), iop conference series: materials science and engineering.
  [Bibtex]

  @inproceedings{komianos2018adaptive,
  abstract = {The paper addresses the issue of virtual museums' space personalization. Personalization techniques are poorly integrated in virtual museums implementations and when applied little attention is given in the abilities, requirements and needs of their visitors. In this paper, the concept of adaptive exhibition topologies is introduced. Adaptive exhibition topologies are patterns of space structure that are specifically designed in order to provide unlimited exhibition space for personalized exhibitions based on users' interests and visiting preferences. Adaptive exhibition topologies focus on the time that visitors are willing to spend for their visit. In contrast to conventional implementations, adaptive exhibition topologies instances are created according to their visitors' interests and their available time while taking into consideration certain curatorial guidelines. A number of topologies is introduced as well as appropriate metrics for their study and comparison reasons. The effect of different exhibition topologies on users' navigation and interaction with the exhibits is studied through the conducted usability and evaluation tests.},
  author = {Komianos, Vasileios and Oikonomou, Konstantinos},
  booktitle = {The First Future of Heritage Science and Technologies Conference, (Heri-Tech), IOP Conference Series: Materials Science and Engineering},
  date-modified = {2021-12-06 10:42:49 +0200},
  keywords = {own, refereed, iivw, R:VR},
  month = {5},
  number = {1},
  pages = {012011},
  title = {{{Adaptive Exhibition Topologies for Personalized Virtual Museums}}},
  url = {http://stacks.iop.org/1757-899X/364/i=1/a=012011},
  venue = {Florence, Italy},
  volume = {364},
  year = {2018},
  Bdsk-Url-1 = {http://stacks.iop.org/1757-899X/364/i=1/a=012011}}

• Komianos, V., Latos, A., & Oikonomou, K.. (2018). Interaction and Information Communication in Virtual Museums. Paper presented at the The first future of heritage science and technologies conference, (heri-tech), iop conference series: materials science and engineering.
  [Bibtex]

  @inproceedings{komianos2018interaction,
  abstract = {The present paper deals with aspects of information communication and interaction in virtual museums. The information communication methods deployed in virtual museums partially take advantage of virtual environments' capabilities while interaction with the exhibits and the exhibition space remains a challenging task for non experienced users. A demonstrative virtual museum is implemented, in which: (i) interactive information communication methods based on conventional information communication methods; and (ii) interaction and navigation assistance methods are developed, tested and proposed. The proposed navigation assistance method is examined further by the conduction of a set of user tests designed to evaluate its effectiveness and test results show its positive effect. In conclusion, guidelines for future work regarding the effectiveness of the interactive information communication methods, especially as the virtual reality technologies and natural interaction interfaces emerge, are drawn.},
  author = {Komianos, Vasileios and Latos, Anastasios and Oikonomou, Konstantinos},
  booktitle = {The First Future of Heritage Science and Technologies Conference, (Heri-Tech), IOP Conference Series: Materials Science and Engineering},
  date-modified = {2021-12-06 10:42:54 +0200},
  keywords = {own, refereed, iivw, R:VR},
  month = {5},
  number = {1},
  pages = {012038},
  title = {{{Interaction and Information Communication in Virtual Museums}}},
  url = {http://stacks.iop.org/1757-899X/364/i=1/a=012038},
  venue = {Florence, Italy},
  volume = {364},
  year = {2018},
  Bdsk-Url-1 = {http://stacks.iop.org/1757-899X/364/i=1/a=012038}}

• Fanarioti, S., Tsipis, A., Giannakis, K., Koufoudakis, G., Christopoulou, E., Oikonomou, K., & Stavrakakis, I.. (2018). A proposed algorithm for data measurements synchronization in wireless sensor networks. Paper presented at the Second international balkan conference on communications and networking 2018 (balkancom’18).
  [Bibtex]

  @inproceedings{fanarioti2018proposed,
  title={A proposed algorithm for data measurements synchronization in wireless sensor networks},
  author={Fanarioti, Sofia and Tsipis, Athanasios and Giannakis, Konstantinos and Koufoudakis, George and Christopoulou, Eleni and Oikonomou, Konstantinos and Stavrakakis, Ioannis},
  booktitle={Second International Balkan Conference on Communications and Networking 2018 (BalkanCom’18)},
  pages={1--5},
  year={2018}
  }

• Karopoulos, G., Ntantogian, C., & Xenakis, C.. (2018). Masker: masking for privacy-preserving aggregation in the smart grid ecosystem. Computers & security, 73, 307–325.
  [Bibtex]

  @article{karopoulos2018masker,
  title={MASKER: Masking for privacy-preserving aggregation in the smart grid ecosystem},
  author={Karopoulos, Georgios and Ntantogian, Christoforos and Xenakis, Christos},
  journal={Computers \& Security},
  volume={73},
  pages={307--325},
  year={2018},
  publisher={Elsevier}
  }

• Kitsaki, T., Angelogianni, A., Ntantogian, C., & Xenakis, C.. (2018). A forensic investigation of android mobile applications. Paper presented at the Proceedings of the 22nd pan-hellenic conference on informatics.
  [Bibtex]

  @inproceedings{kitsaki2018forensic,
  title={A forensic investigation of Android mobile applications},
  author={Kitsaki, Theodoula-Ioanna and Angelogianni, Anna and Ntantogian, Christoforos and Xenakis, Christos},
  booktitle={Proceedings of the 22nd Pan-Hellenic Conference on Informatics},
  pages={58--63},
  year={2018},
  organization={ACM}
  }

• Tsohou, A., & Holtkamp, P.. (2018). Are users competent to comply with information security policies? an analysis of professional competence models. Information technology & people.
  [Bibtex]

  @article{tsohou2018users,
  title={Are users competent to comply with information security policies? An analysis of professional competence models},
  author={Tsohou, Aggeliki and Holtkamp, Philipp},
  journal={Information Technology \& People},
  year={2018},
  publisher={Emerald Publishing Limited}
  }

• Siponen, M., & Tsohou, A.. (2018). Demystifying the influential is legends of positivism. Journal of the association for information systems, 19(7), 600–617.
  [Bibtex]

  @article{siponen2018demystifying,
  title={Demystifying the influential IS legends of positivism},
  author={Siponen, Mikko and Tsohou, Aggeliki},
  journal={Journal of the Association for Information Systems},
  volume={19},
  number={7},
  pages={600--617},
  year={2018},
  publisher={Association for Information Systems}
  }

• Paspatis, I., Tsohou, A., & Kokolakis, S.. (2018). Appaware: a model for privacy policy visualization for mobile applications.. Paper presented at the Mcis.
  [Bibtex]

  @inproceedings{paspatis2018appaware,
  title={AppAware: A Model for Privacy Policy Visualization for Mobile Applications.},
  author={Paspatis, Ioannis and Tsohou, Aggeliki and Kokolakis, Spyros},
  booktitle={MCIS},
  pages={3},
  year={2018}
  }

• Karagiannis, S., & Magkos, E.. (2018). User profiling in cybersecurity education and training. Paper presented at the Mcis2018.
  [Bibtex]

  @inproceedings{karagiannis2018user,
  title={User Profiling in Cybersecurity Education and Training},
  author={Karagiannis, S and Magkos, E},
  booktitle={MCIS2018},
  year={2018}
  }

2017

• Kosyfaki, C., Angelova, N. P., Tsohou, A., & Magkos, E.. (2017). The privacy paradox in the context of online health data disclosure by users. Paper presented at the European, mediterranean, and middle eastern conference on information systems.
  [Bibtex]

  @inproceedings{kosyfaki2017privacy,
  title={The Privacy Paradox in the Context of Online Health Data Disclosure by Users},
  author={Kosyfaki, Chrysanthi and Angelova, Nelina P and Tsohou, Aggeliki and Magkos, Emmanouil},
  booktitle={European, Mediterranean, and Middle Eastern Conference on Information Systems},
  pages={421--428},
  year={2017},
  organization={Springer, Cham}
  }

• Grammenos, P., Syrengela, N., Magkos, E., & Tsohou, A.. (2017). Internet addiction of young greek adults: psychological aspects and information privacy. In Genedis 2016 (pp. 67–78). Springer, cham.
  [Bibtex]

  @incollection{grammenos2017internet,
  title={Internet addiction of young Greek adults: psychological aspects and information privacy},
  author={Grammenos, P and Syrengela, NA and Magkos, E and Tsohou, A},
  booktitle={GeNeDis 2016},
  pages={67--78},
  year={2017},
  publisher={Springer, Cham}
  }

• Tsoumanis, G., Oikonomou, K., Aïssa, S., & Stavrakakis, I.. (2017). Recharging vehicle distance minimization in wireless sensor networks. Paper presented at the Balkancom 2017, first international balkan conference on communications and networking, tirana, albania.
  [Bibtex]

  @inproceedings{tsoumanis2017recharging,
  abstract = {Wireless sensor networks suffer from increased energy consumption close to the sink node, known as the energy hole problem. Various policies for recharging battery exhausted nodes have been proposed using special recharging vehicles. The focus in this paper is on a simple recharging policy that permits a recharging vehicle, stationed at the sink node, to move around and replenish any node's exhausted battery when a certain recharging threshold is violated. The minimization of the recharging distance covered by the recharging vehicle is shown to be a facility location problem, and particularly a 1-median one. Simulation results investigate various aspects of the recharging policy related to the recharging threshold and the level of the energy left in the network nodes' batteries. In addition, it is shown that when the sink's positioning is set to the solution of the particular facility location problem, then the recharging distance is minimized irrespectively of the recharging threshold.},
  author = {Tsoumanis, Georgios and Oikonomou, Konstantinos and A{\"i}ssa, Sonia and Stavrakakis, Ioannis},
  booktitle = {BalkanCom 2017, First International Balkan Conference on Communications and Networking, Tirana, Albania},
  comment = {[pdf]},
  date-modified = {2021-12-06 10:46:15 +0200},
  keywords = {own, sonia, refereed, R:FL:SL,R:ENERGY:FLP},
  month = {6},
  title = {Recharging Vehicle Distance Minimization in Wireless Sensor Networks},
  venue = {Tirana, Albania},
  year = {2017}}

• Skiadopoulos, K., Giannakis, K., & Oikonomou, K.. (2017). Random Walker Coverage Analysis for Information Dissemination in Wireless Sensor Networks. Technologies, 5(2), 33.
  [Bibtex]

  @article{skiadopoulos2017random,
  abstract = {The increasing technological progress in electronics provides network nodes with new and enhanced capabilities that allow the revisit of the traditional information dissemination (and collection) problem. The probabilistic nature of information dissemination using random walkers is exploited here to deal with challenges imposed by unconventional modern environments. In such systems, node operation is not deterministic (e.g., does not depend only on network nodes' battery), but it rather depends on the particulars of the ambient environment (e.g., in the case of energy harvesting: sunshine, wind). The mechanism of information dissemination using one random walker is studied and analyzed in this paper under a different and novel perspective. In particular, it takes into account the stochastic nature of random walks, enabling further understanding of network coverage. A novel and original analysis is presented, which reveals the evolution network coverage by a random walker with respect to time. The derived analytical results reveal certain additional interesting aspects regarding network coverage, thus shedding more light on the random walker mechanism. Further analytical results, regarding the walker's spatial movement and its associated neighborhood, are also confirmed through experimentation. Finally, simulation results considering random geometric graph topologies, which are suitable for modeling mobile environments, support and confirm the analytical findings.},
  author = {Skiadopoulos, Konstantinos and Giannakis, Konstantinos and Oikonomou, Konstantinos},
  date-modified = {2021-11-13 16:35:01 +0200},
  doi = {10.3390/technologies5020033},
  issn = {2227-7080},
  journal = {Technologies},
  keywords = {own, refereed, R:ID:RW},
  number = {2},
  pages = {33},
  title = {{{Random Walker Coverage Analysis for Information Dissemination in Wireless Sensor Networks}}},
  volume = {5},
  year = {2017},
  Bdsk-Url-1 = {https://doi.org/10.3390/technologies5020033}}

• Dragonas, V., Oikonomou, K., & Stavrakakis, I.. (2017). A Topology-Independent TDMA MAC Policy for Safety Applications in Vehicular Networks. Paper presented at the Balkancom 2017, first international balkan conference on communications and networking, tirana, albania.
  [Bibtex]

  @inproceedings{dragonas2017topology,
  abstract = {The problem of accessing the medium to support safety applications in vehicular networks is challenging, when vehicles' mobility increases and time constraints become tight. In such environments, and particularly for vehicular-to-vehicular communication where safety is the main concern, time delay bounded data packet delivery is a prerequisite. Consequently, topology-independent MAC policies that guarantee a number of successful transmissions independently of the underlying topology, can be employed as a suitable choice for the particular vehicular environment. One such policy is revisited in this paper and its performance is demonstrated against VeMAC -- a well-established MAC protocol in the area of vehicular networks -- using simulation results. As it is shown in this paper, throughput under the considered topology-independent policy remains comparable to that of VeMAC whereas the number of retransmissions are significantly reduced leading to a reduced time delay.},
  author = {Dragonas, Vasileios and Oikonomou, Konstantinos and Stavrakakis, Ioannis},
  booktitle = {BalkanCom 2017, First International Balkan Conference on Communications and Networking, Tirana, Albania},
  comment = {[pdf]},
  date-modified = {2021-12-06 10:41:48 +0200},
  keywords = {own, refereed, R:MAC:TI, R:IOT:VE},
  month = {6},
  title = {{{A Topology-Independent TDMA MAC Policy for Safety Applications in Vehicular Networks}}},
  venue = {Tirana, Albania},
  year = {2017}}

• Koutsoumpidis, E., Komianos, V., & Oikonomou, K.. (2017). Evaluation of Virtual Agents’ Effectiveness in History Class. The european journal of education and applied psychology(4), 14-29.
  [Bibtex]

  @article{komianos2017agents,
  abstract = {In this paper the effectiveness of virtual agents' application in educational process is examined. An approach for implementing virtual agents is presented and a methodology for their effectiveness' evaluation is introduced accompanied by an experiment that is conducted in order to provide results of their application in real class scenarios. This approach focuses on the effect of virtual agents on students' performance in history course, while taking into consideration their attitudes towards history course and towards the use of virtual agents. The research model, the research hypotheses and the applied experiment methodology are presented. The results show that the proposed approach has positive influence on students' performance in history course and provide insights into the effect of students' attitude regarding history course and use of virtual agents.},
  author = {Koutsoumpidis, Evangelos and Komianos, Vasileios and Oikonomou, Konstantinos},
  date-modified = {2021-11-13 16:43:56 +0200},
  issn = {2310-5704},
  journal = {The European Journal of Education and Applied Psychology},
  keywords = {own, refereed, iivw, R:VR},
  number = {4},
  pages = {14-29},
  publisher = {Premier Publishing},
  title = {{{Evaluation of Virtual Agents' Effectiveness in History Class}}},
  year = {2017}}

• Panos, C., Ntantogian, C., Malliaros, S., & Xenakis, C.. (2017). Analyzing, quantifying, and detecting the blackhole attack in infrastructure-less networks. Computer networks, 113, 94–110.
  [Bibtex]

  @article{panos2017analyzing,
  title={Analyzing, quantifying, and detecting the blackhole attack in infrastructure-less networks},
  author={Panos, Christoforos and Ntantogian, Chirstoforos and Malliaros, Stefanos and Xenakis, Christos},
  journal={Computer Networks},
  volume={113},
  pages={94--110},
  year={2017},
  publisher={Elsevier}
  }

• Panou, A., Ntantogian, C., & Xenakis, C.. (2017). Riski: a framework for modeling cyber threats to estimate risk for data breach insurance. Paper presented at the Proceedings of the 21st pan-hellenic conference on informatics.
  [Bibtex]

  @inproceedings{panou2017riski,
  title={RiSKi: A framework for modeling cyber threats to estimate risk for data breach insurance},
  author={Panou, Angeliki and Ntantogian, Christoforos and Xenakis, Christos},
  booktitle={Proceedings of the 21st Pan-Hellenic Conference on Informatics},
  pages={1--6},
  year={2017}
  }

• Panos, C., Malliaros, S., Ntantogian, C., Panou, A., & Xenakis, C.. (2017). A security evaluation of fido’s uaf protocol in mobile and embedded devices. Paper presented at the International tyrrhenian workshop on digital communication.
  [Bibtex]

  @inproceedings{panos2017security,
  title={A Security Evaluation of FIDO’s UAF Protocol in Mobile and Embedded Devices},
  author={Panos, Christoforos and Malliaros, Stefanos and Ntantogian, Christoforos and Panou, Angeliki and Xenakis, Christos},
  booktitle={International Tyrrhenian Workshop on Digital Communication},
  pages={127--142},
  year={2017},
  organization={Springer}
  }

• Karopoulos, G., Ntantogian, C., & Xenakis, C.. (2017). Privacy-preserving aggregation in the smart grid. In Security solutions and applied cryptography in smart grid communications (pp. 80–97). Igi global.
  [Bibtex]

  @incollection{karopoulos2017privacy,
  title={Privacy-Preserving Aggregation in the Smart Grid},
  author={Karopoulos, Georgios and Ntantogian, Christoforos and Xenakis, Christos},
  booktitle={Security Solutions and Applied Cryptography in Smart Grid Communications},
  pages={80--97},
  year={2017},
  publisher={IGI Global}
  }

• Tsohou, A., & Kosta, E.. (2017). Enabling valid informed consent for location tracking through privacy awareness of users: a process theory. Computer law & security review, 33(4), 434–457.
  [Bibtex]

  @article{tsohou2017enabling,
  title={Enabling valid informed consent for location tracking through privacy awareness of users: A process theory},
  author={Tsohou, Aggeliki and Kosta, Eleni},
  journal={Computer Law \& Security Review},
  volume={33},
  number={4},
  pages={434--457},
  year={2017},
  publisher={Elsevier Advanced Technology}
  }

• Diamantopoulou, V., Tsohou, A., Loukis, E. N., & Gritzalis, S.. (2017). Does the development of information systems resources lead to the development of information security resources? an empirical investigation. .
  [Bibtex]

  @article{diamantopoulou2017does,
  title={Does the Development of Information Systems Resources Lead to the Development of Information Security Resources? An Empirical Investigation},
  author={Diamantopoulou, Vasiliki and Tsohou, Aggeliki and Loukis, Euripidis N and Gritzalis, Stefanos},
  year={2017}
  }

• Kosyfaki, C., Angelova, N. P., Tsohou, A., & Magkos, E.. (2017). The privacy paradox in the context of online health data disclosure by users. Paper presented at the European, mediterranean, and middle eastern conference on information systems.
  [Bibtex]

  @inproceedings{kosyfaki2017privacy,
  title={The Privacy Paradox in the Context of Online Health Data Disclosure by Users},
  author={Kosyfaki, Chrysanthi and Angelova, Nelina P and Tsohou, Aggeliki and Magkos, Emmanouil},
  booktitle={European, Mediterranean, and Middle Eastern Conference on Information Systems},
  pages={421--428},
  year={2017},
  organization={Springer, Cham}
  }

• Grammenos, P., Syrengela, N., Magkos, E., & Tsohou, A.. (2017). Internet addiction of young greek adults: psychological aspects and information privacy. In Genedis 2016 (pp. 67–78). Springer, cham.
  [Bibtex]

  @incollection{grammenos2017internet,
  title={Internet addiction of young Greek adults: psychological aspects and information privacy},
  author={Grammenos, P and Syrengela, NA and Magkos, E and Tsohou, A},
  booktitle={GeNeDis 2016},
  pages={67--78},
  year={2017},
  publisher={Springer, Cham}
  }

• Gritzalis, A., Tsohou, A., & Lambrinoudakis, C.. (2017). Transparency-enabling systems for open governance: their impact on citizens’ trust and the role of information privacy. Paper presented at the International conference on e-democracy.
  [Bibtex]

  @inproceedings{gritzalis2017transparency,
  title={Transparency-Enabling Systems for Open Governance: Their Impact on Citizens’ Trust and the Role of Information Privacy},
  author={Gritzalis, Aristomenis and Tsohou, Aggeliki and Lambrinoudakis, Costas},
  booktitle={International Conference on e-Democracy},
  pages={47--63},
  year={2017},
  organization={Springer, Cham}
  }

• Lee, H., Tsohou, A., & Choi, Y.. (2017). Embedding persuasive features into policy issues: implications to designing public participation processes. Government information quarterly, 34(4), 591–600.
  [Bibtex]

  @article{lee2017embedding,
  title={Embedding persuasive features into policy issues: Implications to designing public participation processes},
  author={Lee, Habin and Tsohou, Aggeliki and Choi, Youngseok},
  journal={Government Information Quarterly},
  volume={34},
  number={4},
  pages={591--600},
  year={2017},
  publisher={JAI}
  }

• Ioannis Paspatis, I. P., Aggeliki Tsohou, A. T., & Spyros Kokolakis, S. K.. (2017). Mobile application privacy risks: viber users’ de-anonymization using public data. Paper presented at the Mediterranean conference on information systems (mcis).
  [Bibtex]

  @inproceedings{ioannis2017mobile,
  title={Mobile application privacy risks: Viber users’ de-anonymization using public data},
  author={Ioannis Paspatis, Ioannis Paspatis and Aggeliki Tsohou, Aggeliki Tsohou and Spyros Kokolakis, Spyros Kokolakis},
  booktitle={Mediterranean Conference on Information Systems (MCIS)},
  year={2017},
  organization={Association For Information Systems}
  }

• Karagiannis, S., & Magkos, E.. (2017). Decentralized internet privacy: towards a blockchain framework for healthcare. Paper presented at the Mcis2017.
  [Bibtex]

  @inproceedings{karagiannis2017decentralized,
  title={Decentralized Internet Privacy: Towards a Blockchain Framework for Healthcare},
  author={Karagiannis, S and Magkos, E},
  booktitle={MCIS2017},
  year={2017}
  }

2016

• Kotzanikolaou, P., Patsakis, C., Magkos, E., & Korakakis, M.. (2016). Lightweight private proximity testing for geospatial social networks. Computer communications, 73, 263–270.
  [Bibtex]

  @article{kotzanikolaou2016lightweight,
  title={Lightweight private proximity testing for geospatial social networks},
  author={Kotzanikolaou, Panayiotis and Patsakis, Constantinos and Magkos, Emmanouil and Korakakis, Michalis},
  journal={Computer Communications},
  volume={73},
  pages={263--270},
  year={2016},
  publisher={Elsevier}
  }

• Magkos, E.. (2016). National critical infrastructure protection: an identification and assessment methodology. .
  [Bibtex]

  @article{magkos2016national,
  title={National Critical Infrastructure Protection: An Identification and Assessment Methodology},
  author={Magkos, E},
  year={2016}
  }

• Karavaras, E., Magkos, E., & Tsohou, A.. (2016). Low user awareness against social malware: an empirical study and design of a security awareness application. Paper presented at the 13th european mediterranean and middle eastern conference on information systems.
  [Bibtex]

  @inproceedings{karavaras2016low,
  title={Low user awareness against social malware: An empirical study and design of a security awareness application},
  author={Karavaras, Eleftherios and Magkos, Emmanouil and Tsohou, Aggeliki},
  booktitle={13th European Mediterranean and Middle Eastern Conference on Information Systems},
  volume={13},
  pages={1--10},
  year={2016}
  }

• Gritzalis, D., Stergiopoulos, G., Kotzanikolaou, P., Magkos, E., & Lykou, G.. (2016). Critical infrastructure protection: a holistic methodology for greece. Paper presented at the International workshop on the security of industrial control systems and cyber-physical systems.
  [Bibtex]

  @inproceedings{gritzalis2016critical,
  title={Critical infrastructure protection: a holistic methodology for Greece},
  author={Gritzalis, Dimitris and Stergiopoulos, George and Kotzanikolaou, Panayiotis and Magkos, Emmanouil and Lykou, Georgia},
  booktitle={International Workshop on the Security of Industrial Control Systems and Cyber-Physical Systems},
  pages={19--34},
  year={2016},
  organization={Springer, Cham}
  }

• Demertzis, A., & Oikonomou, K.. (2016). Braided Routing Technique to Balance Traffic Load in Wireless Sensor Networks. International journal of monitoring and surveillance technologies research (ijmstr), 4(4), 1–19.
  [Bibtex]

  @article{demertzis2016braided,
  abstract = {Many-to-one wireless sensor networks suffer from an extreme variation of traffic load between nodes. Sensor nodes near the sink consume much more energy than distant ones, resulting in the energy hole problem (global variation of load). In addition, even nodes located at the same distance from the sink experience very different traffic load with each other (local variation). This uneven distribution of traffic load, both globally and locally, results in a severe shortening of the time until first node runs out of battery. This work focuses on balancing the load of equally-distant nodes from the sink by sharing each one's load among its next-hop neighbors. Eventually, packets are travelling from node to sink by following interlaced paths. The proposed routing mechanism, called braided routing, is a simple one and can be applied over any cost-based routing, incurring a negligible overhead. Simulation results show that the local variance of load is reduced nearly 20-60\% on average while the time until first death can be prolonged more than twice in many cases and the lifetime about 15\%.},
  author = {Demertzis, Apostolos and Oikonomou, Konstantinos},
  date-modified = {2021-11-13 20:44:13 +0200},
  doi = {10.4018/IJMSTR.2016100101},
  journal = {International Journal of Monitoring and Surveillance Technologies Research (IJMSTR)},
  keywords = {own, refereed,R:ENERGY:LR},
  number = {4},
  pages = {1--19},
  publisher = {IGI Global},
  title = {{{Braided Routing Technique to Balance Traffic Load in Wireless Sensor Networks}}},
  volume = {4},
  year = {2016},
  Bdsk-Url-1 = {https://doi.org/10.4018/IJMSTR.2016100101}}

• Komianos, V., Tsoumanis, G., Kavvadia, E., & Oikonomou, K.. (2016). A Framework for Cultural Heritage Content Organisation, Dissemination and Communication in Large-Scale Virtual Environments. International journal of computational intelligence studies, 5(1), 71–93.
  [Bibtex]

  @article{komianos2016framework,
  abstract = {Cultural heritage promotion is an emerging trend for cultural organisations which take advantage of informatics and virtual environments for this purpose. Virtual environments are an effective media for cultural content communication combining existing communication media and providing diverse interaction methods. In this paper, these methods are tested for their effectiveness and appropriateness under certain conditions while usability issues are addressed. In many cases, there is demand for the content to be organised and be available to other systems. Virtual environments do not provide content organisation and content dissemination functionality, thus, a framework providing them is proposed. A database (RDBMS) is used for keeping the content according to an appropriately designed information schema that further organises it. Dissemination requirements are taken into consideration and add-on mechanisms are designed to provide access to the content and dissemination services adapted to the modern World Wide Web technologies.},
  author = {Komianos, Vasileios and Tsoumanis, Georgios and Kavvadia, Eleni and Oikonomou, Konstantinos},
  date-modified = {2021-11-13 16:44:42 +0200},
  doi = {10.1504/IJCISTUDIES.2016.075985},
  journal = {International Journal of Computational Intelligence Studies},
  keywords = {own, refereed, iivw, R:VR},
  number = {1},
  pages = {71--93},
  title = {{{A Framework for Cultural Heritage Content Organisation, Dissemination and Communication in Large-Scale Virtual Environments}}},
  volume = {5},
  year = {2016},
  Bdsk-Url-1 = {https://doi.org/10.1504/IJCISTUDIES.2016.075985}}

• Xenakis, C., Ntantogian, C., & Panos, O.. (2016). (u) simmonitor: a mobile application for security evaluation of cellular networks. Computers & security, 60, 62–78.
  [Bibtex]

  @article{xenakis2016u,
  title={(U) SimMonitor: A mobile application for security evaluation of cellular networks},
  author={Xenakis, Christos and Ntantogian, Christoforos and Panos, Orestis},
  journal={Computers \& Security},
  volume={60},
  pages={62--78},
  year={2016},
  publisher={Elsevier}
  }

• Malliaros, S., Ntantogian, C., & Xenakis, C.. (2016). Protecting sensitive information in the volatile memory from disclosure attacks. Paper presented at the 2016 11th international conference on availability, reliability and security (ares).
  [Bibtex]

  @inproceedings{malliaros2016protecting,
  title={Protecting sensitive information in the volatile memory from disclosure attacks},
  author={Malliaros, Stefanos and Ntantogian, Christoforos and Xenakis, Christos},
  booktitle={2016 11th International Conference on Availability, Reliability and Security (ARES)},
  pages={687--693},
  year={2016},
  organization={IEEE}
  }

• Chatzikonstantinou, A., Ntantogian, C., Karopoulos, G., & Xenakis, C.. (2016). Evaluation of cryptography usage in android applications. Paper presented at the Proceedings of the 9th eai international conference on bio-inspired information and communications technologies (formerly bionetics).
  [Bibtex]

  @inproceedings{chatzikonstantinou2016evaluation,
  title={Evaluation of cryptography usage in android applications},
  author={Chatzikonstantinou, Alexia and Ntantogian, Christoforos and Karopoulos, Georgios and Xenakis, Christos},
  booktitle={Proceedings of the 9th EAI International Conference on Bio-inspired Information and Communications Technologies (formerly BIONETICS)},
  pages={83--90},
  year={2016},
  organization={ICST (Institute for Computer Sciences, Social-Informatics and~…}
  }

• Karavaras, E., Magkos, E., & Tsohou, A.. (2016). Low user awareness against social malware: an empirical study and design of a security awareness application. Paper presented at the European, mediterranean and middle eastern conference on information systems.
  [Bibtex]

  @inproceedings{karavaras2016low,
  title={LOW USER AWARENESS AGAINST SOCIAL MALWARE: AN EMPIRICAL STUDY AND DESIGN OF A SECURITY AWARENESS APPLICATION},
  author={Karavaras, Eleftherios and Magkos, Emmanouil and Tsohou, Aggeliki},
  booktitle={European, Mediterranean and Middle Eastern Conference on Information Systems},
  year={2016}
  }

2015

• Demertzis, A., & Oikonomou, K.. (2015). A Braided Routing Mechanism to Reduce Traffic Load’s Local Variance in Wireless Sensor Networks. Paper presented at the 2015 6th international conference on information, intelligence, systems and applications (iisa).
  [Bibtex]

  @inproceedings{demertzis2015braided,
  abstract = {Many-to-one wireless sensor networks suffer from an extreme variance of energy consumption due to diverse traffic load within the network nodes. Sensor nodes close to the sink consume significantly more energy than the farther ones, resulting in the energy hole problem (i.e., global variance). In addition, even nodes located at the same distance from the sink experience different traffic load with each other (i.e., local variance). The uneven distribution of traffic load, both globally and locally, results in a severe shortening of the time until the first node runs out of battery. This work focuses on balancing the traffic load of equally-distant from the sink nodes by sharing each one's load among its next-hop neighbors. Eventually, packets are traveling from a node to the sink by following interlaced paths. The proposed routing mechanism, called braided routing, is a simple one and can be applied over any least-cost routing policy, incurring a negligible overhead. Simulation results show that the local variance of energy consumption is reduced about 70-80\% on average while the time until the first nodal loss can be prolonged more than twice in many cases.},
  author = {Demertzis, Apostolos and Oikonomou, Konstantinos},
  booktitle = {2015 6th International Conference on Information, Intelligence, Systems and Applications (IISA)},
  date-modified = {2021-12-06 10:41:35 +0200},
  doi = {10.1109/IISA.2015.7388119},
  keywords = {own, refereed,R:ENERGY:LR},
  month = {7},
  pages = {1--6},
  title = {{{A Braided Routing Mechanism to Reduce Traffic Load's Local Variance in Wireless Sensor Networks}}},
  venue = {Corfu, Greece},
  year = {2015},
  Bdsk-Url-1 = {https://doi.org/10.1109/IISA.2015.7388119}}

• Kavvadia, E., Sagiadinos, S., Oikonomou, K., Tsioutsiouliklis, G., & Aïssa, S.. (2015). Elastic Virtual Machine Placement in Cloud Computing Network Environments. Computer networks, 93(Part 3), 435–447.
  [Bibtex]

  @article{kavvadia2015elastic,
  abstract = {The growth of cloud computing and the need to support the ever increasing number of applications introduces new challenges and gives rise to various optimization problems, such as calculating the number and location of virtual MAChines instantiating cloud services to minimize a well-defined cost function. This paper introduces a novel cloud computing network architecture that allows for the formulation of the optimization as an Uncapacitated Facility Location (UFL) problem, where a facility corresponds to an instantiation of a particular service (e.g. a virtual MAChine). Since UFL is not only difficult (NP-hard and requires global information), but also its centralized solution is non-scalable, the approach followed here is distributed and elastic, and relays local information to improve scalability. In particular, virtual MAChine replication and merging are proposed and analyzed ensuring overall cost reduction. In addition, a policy that employs virtual MAChine replication and merging along with migration is proposed to reduce the overall cost for using a service. The efficiency of this policy and its limitations are analyzed and discussed, with simulation results supporting the analytical findings and demonstrating a significant overall cost reduction when the proposed policy is implemented.},
  author = {Eleni Kavvadia and Spyros Sagiadinos and Konstantinos Oikonomou and Giorgos Tsioutsiouliklis and Sonia A{\"i}ssa},
  date-modified = {2021-11-13 16:15:30 +0200},
  doi = {10.1016/j.comnet.2015.09.038},
  issn = {1389-1286},
  journal = {Computer Networks},
  keywords = {own, sonia, refereed, R:FL:SL, R:CF:FL, R:CF:ARCH},
  note = {Cloud Networking and Communications II},
  number = {Part 3},
  pages = {435--447},
  publisher = {Elsevier},
  title = {{{Elastic Virtual Machine Placement in Cloud Computing Network Environments}}},
  volume = {93},
  year = {2015},
  Bdsk-Url-1 = {https://doi.org/10.1016/j.comnet.2015.09.038}}

• Komianos, V., Kavvadia, E., & Oikonomou, K.. (2015). Cultural Heritage Recommendations and User Navigation in Large Scale Virtual Environments. International journal of computational intelligence studies, 4(2), 151–172.
  [Bibtex]

  @article{komianos2015cultural,
  abstract = { In this article, an advanced large scale virtual environment aiming at cultural heritage promotion is presented. The advancements proposed are a set of methods and systems integrated into the virtual environment in order to turn it into an interactive cultural guide. The platform is designed to provide recommendations, navigation assistance and access to information resources. This work deals with important issues originating from the large scale factor which affects the process of making recommendations and users' navigation. Moreover, the plethora of entities of interest hosted in the presented virtual environment set the need of a flexible and descriptive information schema to keep and serve its content. The structure of the whole system is designed to enable interoperability and provides interfaces for third-party applications.},
  author = {Komianos, Vasileios and Kavvadia, Eleni and Oikonomou, Konstantinos},
  date-modified = {2021-11-13 16:44:30 +0200},
  doi = {10.1504/IJCISTUDIES.2015.071184},
  journal = {International Journal of Computational Intelligence Studies},
  keywords = {own, refereed, iivw, R:VR},
  number = {2},
  pages = {151--172},
  title = {{{Cultural Heritage Recommendations and User Navigation in Large Scale Virtual Environments}}},
  volume = {4},
  year = {2015},
  Bdsk-Url-1 = {https://doi.org/10.1504/IJCISTUDIES.2015.071184}}

• Tsoumanis, G., Kavvadia, E., & Oikonomou, K.. (2015). A v(irtual)-City Implementation for Promoting Cultural Heritage. International journal of computational intelligence studies, 4(2), 173-191.
  [Bibtex]

  @article{tsoumanis2015v,
  abstract = { In this paper, virtual city (v-City) is presented, i.e., a virtual world consisting of historical buildings, monuments and other sites of a city, transformed into virtual sites (v-Sites). Additionally, avatars enliven v-City by acting like real habitats. Possible ways of implementing v-City as an educational and promotional tool are explored here. This is achieved by creating: 1) an application called v-isit; 2) video-based virtual tours (v-tours) consisting of parts of v-City. Both of them improve teaching history and promoting cultural heritage of the particular city, by using the latter v-Sites and avatars. Both v-Sites and avatars have the capability, through special virtual assistants (v-Assistants), of providing the viewers with pieces of information related to the particular site or the person represented by the avatar. },
  author = {Tsoumanis, Georgios and Kavvadia, Eleni and Oikonomou, Konstantinos},
  date-modified = {2021-11-13 16:44:11 +0200},
  doi = {10.1504/IJCISTUDIES.2015.071185},
  journal = {International Journal of Computational Intelligence Studies},
  keywords = {own, refereed, iivw,R:VR},
  number = {2},
  pages = {173-191},
  title = {{{A v(irtual)-City Implementation for Promoting Cultural Heritage}}},
  volume = {4},
  year = {2015},
  Bdsk-Url-1 = {https://doi.org/10.1504/IJCISTUDIES.2015.071185}}

• Komianos, V., & Oikonomou, K.. (2015). Constrained Interest-Based Tour Recommendations in Large Scale Cultural Heritage Virtual Environments. Paper presented at the 2015 6th international conference on information, intelligence, systems and applications (iisa).
  [Bibtex]

  @inproceedings{komianos2015constrained,
  abstract = {Users of large scale cultural heritage virtual environments are exposed to information overload due to the plethora of represented entities of interest and the amount of the relevant information. Additional to the previous, users are exposed to route planning problems in which time should be considered as an important constraint. In this paper, the aim is to deal with these issues by providing users with constrained interest-based tour recommendations. A recommendation model is proposed to deal with the users information overload issue. A route planning algorithm supplied with recommendations by the recommendation model is designed to provide tour recommendations. The recommendation model as well as the route planning algorithm results are tested for various cases giving interesting outcomes. The recommendation model and the route planning algorithm are both integrated into the virtual environment and interoperating with navigation assistance methods to provide effective tour guide services applicable in virtual and physical environments.},
  author = {Komianos, Vasileios and Oikonomou, Konstantinos},
  booktitle = {2015 6th International Conference on Information, Intelligence, Systems and Applications (IISA)},
  date-modified = {2021-12-06 10:42:31 +0200},
  doi = {10.1109/IISA.2015.7387969},
  keywords = {own, refereed, iivw, R:VR},
  month = {7},
  pages = {1--6},
  title = {{{Constrained Interest-Based Tour Recommendations in Large Scale Cultural Heritage Virtual Environments}}},
  venue = {Corfu, Greece},
  year = {2015},
  Bdsk-Url-1 = {https://doi.org/10.1109/IISA.2015.7387969}}

• Ringas, D., Christopoulou, E., & Stefanidakis, M.. (2015). Field experience and user evaluation from a real-world internet application in an urban-scale environment. International journal of intelligent engineering informatics, 3(2-3), 144–165.
  [Bibtex]

  @article{ringas2015field,
  title={Field experience and user evaluation from a real-world internet application in an urban-scale environment},
  author={Ringas, Dimitrios and Christopoulou, Eleni and Stefanidakis, Michail},
  journal={International Journal of Intelligent Engineering Informatics},
  volume={3},
  number={2-3},
  pages={144--165},
  year={2015},
  publisher={Inderscience Publishers (IEL)}
  }

• Christopoulou, E., & Ringas, D.. (2015). Wild recommendations: presenting citizens relevant content based on use patterns and context. Paper presented at the 2015 6th international conference on information, intelligence, systems and applications (iisa).
  [Bibtex]

  @inproceedings{christopoulou2015wild,
  title={Wild recommendations: Presenting citizens relevant content based on use patterns and context},
  author={Christopoulou, Eleni and Ringas, Dimitrios},
  booktitle={2015 6th International Conference on Information, Intelligence, Systems and Applications (IISA)},
  pages={1--6},
  year={2015},
  organization={IEEE}
  }

• Ringas, D., Christopoulou, E., & Stefanidakis, M.. (2015). Content seeking strategies in urban computing applications. Paper presented at the 2015 6th international conference on information, intelligence, systems and applications (iisa).
  [Bibtex]

  @inproceedings{ringas2015content,
  title={Content seeking strategies in urban computing applications},
  author={Ringas, Dimitrios and Christopoulou, Eleni and Stefanidakis, Michail},
  booktitle={2015 6th International Conference on Information, Intelligence, Systems and Applications (IISA)},
  pages={1--6},
  year={2015},
  organization={IEEE}
  }

• Ntantogian, C., Valtas, G., Kapetanakis, N., Lalagiannis, F., Karopoulos, G., & Xenakis, C.. (2015). Attacking gsm networks as a script kiddie using commodity hardware and software. Paper presented at the International conference on trust and privacy in digital business.
  [Bibtex]

  @inproceedings{ntantogian2015attacking,
  title={Attacking GSM Networks as a Script Kiddie Using Commodity Hardware and Software},
  author={Ntantogian, Christoforos and Valtas, Grigoris and Kapetanakis, Nikos and Lalagiannis, Faidon and Karopoulos, Georgios and Xenakis, Christos},
  booktitle={International Conference on Trust and Privacy in Digital Business},
  pages={73--86},
  year={2015},
  organization={Springer}
  }

• Poulios, G., Ntantogian, C., & Xenakis, C.. (2015). Ropinjector: using return oriented programming for polymorphism and antivirus evasion. Blackhat usa.
  [Bibtex]

  @article{poulios2015ropinjector,
  title={Ropinjector: Using return oriented programming for polymorphism and antivirus evasion},
  author={Poulios, Giorgos and Ntantogian, Christoforos and Xenakis, Christos},
  journal={Blackhat USA},
  year={2015}
  }

• Xenakis, C., & Ntantogian, C.. (2015). Attacking the baseband modem of mobile phones to breach the users’ privacy and network security. Paper presented at the 2015 7th international conference on cyber conflict: architectures in cyberspace.
  [Bibtex]

  @inproceedings{xenakis2015attacking,
  title={Attacking the baseband modem of mobile phones to breach the users' privacy and network security},
  author={Xenakis, Christos and Ntantogian, Christoforos},
  booktitle={2015 7th International Conference on Cyber Conflict: Architectures in Cyberspace},
  pages={231--244},
  year={2015},
  organization={IEEE}
  }

• Stasinopoulos, A., Ntantogian, C., & Xenakis, C.. (2015). Commix: detecting and exploiting command injection flaws.. Department of digital systems, university of piraeus, blackhat europe, nov, 10–13.
  [Bibtex]

  @article{stasinopoulos2015commix,
  title={Commix: Detecting and exploiting command injection flaws.},
  author={Stasinopoulos, Anastasios and Ntantogian, Christoforos and Xenakis, Christos},
  journal={Department of Digital Systems, University of Piraeus, BlackHat Europe, Nov},
  pages={10--13},
  year={2015}
  }

• Ntantogian, C., Malliaros, S., & Xenakis, C.. (2015). Gaithashing: a two-factor authentication scheme based on gait features. Computers & security, 52, 17–32.
  [Bibtex]

  @article{ntantogian2015gaithashing,
  title={Gaithashing: a two-factor authentication scheme based on gait features},
  author={Ntantogian, Christoforos and Malliaros, Stefanos and Xenakis, Christos},
  journal={Computers \& Security},
  volume={52},
  pages={17--32},
  year={2015},
  publisher={Elsevier}
  }

• Tsohou, A., Karyda, M., Kokolakis, S., & Kiountouzis, E.. (2015). Managing the introduction of information security awareness programmes in organisations. European journal of information systems, 24(1), 38–58.
  [Bibtex]

  @article{tsohou2015managing,
  title={Managing the introduction of information security awareness programmes in organisations},
  author={Tsohou, Aggeliki and Karyda, Maria and Kokolakis, Spyros and Kiountouzis, Evangelos},
  journal={European Journal of Information Systems},
  volume={24},
  number={1},
  pages={38--58},
  year={2015},
  publisher={Taylor \& Francis}
  }

• Tsohou, A., Karyda, M., & Kokolakis, S.. (2015). Analyzing the role of cognitive and cultural biases in the internalization of information security policies: recommendations for information security awareness programs. Computers & security, 52, 128–141.
  [Bibtex]

  @article{tsohou2015analyzing,
  title={Analyzing the role of cognitive and cultural biases in the internalization of information security policies: Recommendations for information security awareness programs},
  author={Tsohou, Aggeliki and Karyda, Maria and Kokolakis, Spyros},
  journal={Computers \& security},
  volume={52},
  pages={128--141},
  year={2015},
  publisher={Elsevier Advanced Technology}
  }

• Jiang, H., & Tsohou, A.. (2015). The same antecedents do not fit all activities: an activity-specific model of personal internet use in workplace. .
  [Bibtex]

  @article{jiang2015same,
  title={The Same Antecedents Do Not Fit All Activities: An Activity-specific Model of Personal Internet Use in Workplace},
  author={Jiang, Hemin and Tsohou, Aggeliki},
  year={2015}
  }

• Moon, J. O., Lee, H., Kim, J. W., Aktas, E., Tsohou, A., & Choi, Y.. (2015). Customer satisfaction from open source software services in the presence of commercially licensed software. Asia pacific journal of information systems, 25(3), 473–499.
  [Bibtex]

  @article{moon2015customer,
  title={Customer satisfaction from open source software services in the presence of commercially licensed software},
  author={Moon, Jung Oh and Lee, Habin and Kim, Jong Woo and Aktas, Emel and Tsohou, Aggeliki and Choi, Youngseok},
  journal={Asia pacific journal of information systems},
  volume={25},
  number={3},
  pages={473--499},
  year={2015},
  publisher={The Korea Society of Management Information Systems}
  }

2014

• Magkos, E., Kotzanikolaou, P., Magioladitis, M., Sioutas, S., & Verykios, V. S.. (2014). Towards secure and practical location privacy through private equality testing. Paper presented at the International conference on privacy in statistical databases.
  [Bibtex]

  @inproceedings{magkos2014towards,
  title={Towards secure and practical location privacy through private equality testing},
  author={Magkos, Emmanouil and Kotzanikolaou, Panayiotis and Magioladitis, Marios and Sioutas, Spyros and Verykios, Vassilios S},
  booktitle={International Conference on Privacy in Statistical Databases},
  pages={312--325},
  year={2014},
  organization={Springer, Cham}
  }

• Fronimos, D., Magkos, E., & Chrissikopoulos, V.. (2014). Evaluating low interaction honeypots and on their use against advanced persistent threats. Paper presented at the Proceedings of the 18th panhellenic conference on informatics.
  [Bibtex]

  @inproceedings{fronimos2014evaluating,
  title={Evaluating low interaction honeypots and on their use against advanced persistent threats},
  author={Fronimos, D and Magkos, Emmanouil and Chrissikopoulos, Vassilios},
  booktitle={Proceedings of the 18th Panhellenic Conference on Informatics},
  pages={1--2},
  year={2014}
  }

• Magkos, E., Kleisiari, E., Chanias, P., & Giannakouris-Salalidis, V.. (2014). Parental control and children’s internet safety: the good, the bad and the ugly. Paper presented at the 6th international conference on information law and ethics (icil 2014).
  [Bibtex]

  @inproceedings{magkos2014parental,
  title={Parental Control and Children’s Internet Safety: The Good, the Bad and the Ugly},
  author={Magkos, Emmanouil and Kleisiari, Eleni and Chanias, Panagiotis and Giannakouris-Salalidis, Viktor},
  booktitle={6th International Conference on Information Law and Ethics (ICIL 2014)},
  year={2014}
  }

• Korakakis, M., Magkos, E., & Mylonas, P.. (2014). Automated captcha solving: an empirical comparison of selected techniques. Paper presented at the 2014 9th international workshop on semantic and social media adaptation and personalization.
  [Bibtex]

  @inproceedings{korakakis2014automated,
  title={Automated CAPTCHA solving: An empirical comparison of selected techniques},
  author={Korakakis, Michalis and Magkos, Emmanouil and Mylonas, Phivos},
  booktitle={2014 9th International Workshop on Semantic and Social Media Adaptation and Personalization},
  pages={44--47},
  year={2014},
  organization={IEEE}
  }

• Smaragdakis, G., Laoutaris, N., Oikonomou, K., Stavrakakis, I., & Bestavros, A.. (2014). Distributed Server Migration for Scalable Internet Service Deployment. Ieee/acm transactions on networking, 22(3), 917–930.
  [Bibtex]

  @article{smaragdakis2014distributed,
  abstract = {The effectiveness of service provisioning in large-scale networks is highly dependent on the number and location of service facilities deployed at various hosts. The classical, centralized approach to determining the latter would amount to formulating and solving the uncapacitated k-median (UKM) problem (if the requested number of facilities is fixed- k) or the uncapacitated facility location (UFL) problem (if the number of facilities is also to be optimized). Clearly, such centralized approaches require knowledge of global topological and demand information, and thus do not scale and are not practical for large networks. The key question posed and answered in this paper is the following: ``How can we determine in a distributed and scalable manner the number and location of service facilities?'' In this paper, we develop a scalable and distributed approach that answers our key question through an iterative reoptimization of the location and the number of facilities within network neighborhoods. We propose an innovative approach to migrate, add, or remove servers within limited-scope network neighborhoods by utilizing only local information about the topology and demand. We show that even with limited information about the network topology and demand, within one or two hops, our distributed approach achieves performance, under various synthetic and real Internet topologies and workloads, that is comparable to that of optimal, centralized approaches requiring full topology and demand information. We also show that it is responsive to volatile demand. Our approach leverages recent advances in virtualization technology toward an automated placement of services on the Internet.},
  author = {Smaragdakis, Georgios and Laoutaris, Nikolaos and Oikonomou, Konstantinos and Stavrakakis, Ioannis and Bestavros, Azer},
  date-added = {2022-06-20 20:28:32 +0300},
  date-modified = {2022-06-20 20:28:32 +0300},
  doi = {10.1109/TNET.2013.2270440},
  issn = {1063-6692},
  journal = {IEEE/ACM Transactions on Networking},
  keywords = {own, boston, exceptional, refereed, ana, R:FL:LI},
  month = {6},
  number = {3},
  pages = {917--930},
  title = {{{Distributed Server Migration for Scalable Internet Service Deployment}}},
  volume = {22},
  year = {2014},
  Bdsk-Url-1 = {https://doi.org/10.1109/TNET.2013.2270440}}

• Demertzis, A., & Oikonomou, K.. (2014). Avoiding Energy Holes in Wireless Sensor Networks with Non-Uniform Energy Distribution. Paper presented at the Iisa 2014, the 5th international conference on information, intelligence, systems and applications.
  [Bibtex]

  @inproceedings{demertzis2014avoiding,
  abstract = {This paper proposes a non-uniform solution to the energy hole problem. The network is formed by a large number of tiny sensors, randomly scattered over a circular area and the sink positioned at the center. The sensors produce data with the same rate and the data travels from the nodes to the sink in a multi-hop fashion, using a shortest path routing. The basic idea, in order to avoid the energy hole around the sink, is to equip each network area with so much energy as the traffic load of that area. Firstly, a pure analytical expression for the traffic load is derived and then, based on this expression, a non-uniform deployment is proposed, with variable surface density, for a certain number of dormant nodes. Each time an active node exhaust its battery, a near dormant node becomes active and takes its place. The proposed strategy improves the network lifetime by a factor of 50 and the energy utilization by a factor of 6, compared to a conventional network without dormant nodes.},
  author = {Demertzis, Apostolos and Oikonomou, Konstantinos},
  booktitle = {IISA 2014, The 5th International Conference on Information, Intelligence, Systems and Applications},
  date-modified = {2021-12-06 10:41:29 +0200},
  doi = {10.1109/IISA.2014.6878801},
  keywords = {own, refereed,R:ENERGY:LR},
  month = {7},
  pages = {138--143},
  title = {{{Avoiding Energy Holes in Wireless Sensor Networks with Non-Uniform Energy Distribution}}},
  venue = {Chania, Greece},
  year = {2014},
  Bdsk-Url-1 = {https://doi.org/10.1109/IISA.2014.6878801}}

• Tso, F. P., Oikonomou, K., Kavvadia, E., & Pezaros, D.. (2014). Scalable Traffic-Aware Virtual Machine Management for Cloud Data Centers. Paper presented at the 2014 ieee 34th international conference on distributed computing systems (icdcs).
  [Bibtex]

  @inproceedings{tso2014scalable,
  abstract = {Virtual MAChine (VM) management is a powerful mechanism for providing elastic services over Cloud Data Centers (DC)s. At the same time, the resulting network congestion has been repeatedly reported as the main bottleneck in DCs, even when the overall resource utilization of the infrastructure remains low. However, most current VM management strategies are traffic-agnostic, while the few that are traffic-aware only concern a static initial allocation, ignore bandwidth oversubscription, or do not scale. In this paper we present S-CORE, a scalable VM migration algorithm to dynamically reallocate VMs to servers while minimizing the overall communication footprint of active traffic flows. We formulate the aggregate VM communication as an optimization problem and we then define a novel distributed migration scheme that iteratively adapts to dynamic traffic changes. Through extensive simulation and implementation results, we show that S-CORE achieves significant (up to 87\%) communication cost reduction while incurring minimal overhead and downtime.},
  author = {Tso, Fung Po and Oikonomou, Konstantinos and Kavvadia, Eleni and Pezaros, Dimitrios},
  booktitle = {2014 IEEE 34th International Conference on Distributed Computing Systems (ICDCS)},
  date-modified = {2021-11-13 16:13:09 +0200},
  doi = {10.1109/ICDCS.2014.32},
  issn = {1063-6927},
  keywords = {own, pezaros, exceptional, refereed, R:CF:FL},
  month = {6},
  pages = {238--247},
  title = {{{Scalable Traffic-Aware Virtual Machine Management for Cloud Data Centers}}},
  venue = {Taminaldu, India},
  year = {2014},
  Bdsk-Url-1 = {https://doi.org/10.1109/ICDCS.2014.32}}

• Kavvadia, E., Koufoudakis, G., & Oikonomou, K.. (2014). Robust Probabilistic Information Dissemination in Energy Harvesting Wireless Sensor Networks. Paper presented at the 2014 13th annual mediterranean ad hoc networking workshop (med-hoc-net).
  [Bibtex]

  @inproceedings{kavvadia2014robust,
  abstract = {Modern network environments, like energy harvesting wireless sensor networks in which network lifetime can be prolonged due to ambient energy collection, necessitate the revisit of classical networking problems like information dissemination. However, as observed in this paper, flooding-based information dissemination mechanisms suffer certain limitations due to the idiosyncrasies of nodes' operational states in energy harvesting network environments. Certain observations motivate the introduction of Robust Probabilistic Flooding, i.e., a robust version of Probabilistic Flooding, capable of dealing with non-operating nodes due to exhausted batteries that later resume their operation due to successful ambient energy collection. A Markov chain model is also introduced to capture the qualitative aspects of such environments in which nodes may or may not operate. This Markov chain is simplified in the sequel, based on certain observations and assumptions presented here, and subsequently used for evaluating the proposed Robust Probabilistic Flooding through simulations. In particular, simulation results demonstrate the inefficiency of Probabilistic Flooding to achieve full coverage in energy harvesting environments. On the other hand, it is shown that Robust Probabilistic Flooding is capable of fully covering the network on the expense of increased termination time. Furthermore, no extra overhead is introduced with respect to the number of messages, thus avoiding extra transmissions and therefore, no additional energy is consumed.},
  author = {Kavvadia, Eleni and Koufoudakis, George and Oikonomou, Konstantinos},
  booktitle = {2014 13th Annual Mediterranean Ad Hoc Networking Workshop (MED-HOC-NET)},
  date-modified = {2021-12-06 10:42:08 +0200},
  doi = {10.1109/MedHocNet.2014.6849106},
  keywords = {own, refereed, R:ID:PF,R:ENERGY},
  month = {6},
  pages = {63--70},
  title = {{{Robust Probabilistic Information Dissemination in Energy Harvesting Wireless Sensor Networks}}},
  venue = {Piran, Slovenia},
  year = {2014},
  Bdsk-Url-1 = {https://doi.org/10.1109/MedHocNet.2014.6849106}}

• Skiadopoulos, K., & Oikonomou, K.. (2014). Probabilistic Information Dissemination Aspects in Wireless Sensor Networks Located in Historical Buildings. Paper presented at the 2014 s.m.art.buil.t international conference.
  [Bibtex]

  @inproceedings{skiadopoulos2014probabilistic,
  abstract = {A recent application of wireless sensor networks for monitoring ambient vibrations in historical buildings, has necessitated the need for efficient information dissemination in such environments in order to minimize the effects of the energyvorous wireless transmissions on the system's lifetime. In this paper, flooding is considered as the most suitable information diseemination mechanism, aiming to reduce the number of redundant transmissions for the
  particular historical buildings deployment. A simple but representative analytical model is
  introduced and along with simulation results it is possible to estimate the smallest transmission radius for minimizing energy consumption in the particular environment.},
  author = {Skiadopoulos, Konstantinos and Oikonomou, Konstantinos},
  booktitle = {2014 S.M.ART.BUIL.T International Conference},
  comment = {[pdf]},
  date-modified = {2021-12-06 10:51:03 +0200},
  keywords = {own, various, smartbuilt, R:ID:PF},
  month = {3},
  title = {{{Probabilistic Information Dissemination Aspects in Wireless Sensor Networks Located in Historical Buildings}}},
  venue = {Bari, Italy},
  year = {2014}}

• Koufoudakis, G., Skiadopoulos, N., Magkos, E., & Oikonomou, K.. (2014). Synchronization Issues in an Innovative Wireless Sensor Network Architecture Monitoring Ambient Vibrations in Historical Buildings. Key engineering materials, 628.
  [Bibtex]

  @article{koufoudakis2014synchronization,
  abstract = {The problem of bridging the gap between the traditional wired monitoring systems and the wireless ones, was the objective of an innovative network architecture that elegantly combined benefits from both approaches. The monitoring focus is on historical buildings in which installing wires maybe range from difficult (e.g., fragile constructions) to impossible (e.g., prohibitive legislation). However, this innovative approach is vulnerable with respect to synchronization issues. In particular, all data sensed by different sensors need to have the correct universal time stamp. Since under this approach there is no central entity to take a synchronization role, in this paper the use of a local NTP server is proposed and as it is shown here using experimental results, this approach suffices for the particular monitoring needs. Thus, the claim that the innovative system can efficiently support the required monitoring of ambient vibrations in historical buildings.},
  author = {Koufoudakis, George and Skiadopoulos, Nikos and Magkos, Emmanouel and Oikonomou, Konstantinos},
  comment = {[pdf]},
  date-modified = {2021-11-13 20:14:30 +0200},
  journal = {Key Engineering Materials},
  keywords = {own, various, smartbuilt,R:SYNC},
  title = {{{Synchronization Issues in an Innovative Wireless Sensor Network Architecture Monitoring Ambient Vibrations in Historical Buildings}}},
  volume = {628},
  year = {2014}}

• Oikonomou, K., Koufoudakis, G., Kavvadia, E., & Chrissikopoulos, V.. (2014). A Wireless Sensor Network Innovative Architecture for Ambient Vibrations Structural Monitoring. Key engineering materials, 628.
  [Bibtex]

  @article{oikonomou2014wireless,
  abstract = {Wireless sensor networks can be beneficial for monitoring ambient vibrations in historical buildings where the installation of traditionally wired system may be either difficult due to wiring difficulties or forbidden due to prohibitive legislation. In this paper, a novel wireless sensor network architecture is presented that is focusing on efficiently monitoring ambient vibrations in historical buildings. Traditional wired monitoring technologies are often difficult to be installed in historical buildings either to high costs for installing the wires or to prohibitive legislations. Employing a wireless system could be beneficial. However, as there is no wireless system of high resolution available in the market, an innovative network architecture is proposed that efficiently combines the benefits of both the wired and wireless systems. The problem of synchronization that this novel architecture introduces, is also discussed in this paper along with a possible solution.},
  author = {Oikonomou, Konstantinos and Koufoudakis, George and Kavvadia, Eleni and Chrissikopoulos, Vassilis},
  comment = {[pdf]},
  date-modified = {2021-11-13 20:14:35 +0200},
  journal = {Key Engineering Materials},
  keywords = {own, various, smartbuilt,R:SYNC},
  title = {{{A Wireless Sensor Network Innovative Architecture for Ambient Vibrations Structural Monitoring}}},
  volume = {628},
  year = {2014}}

• Tsoumanis, G., Kavvadia, E., & Oikonomou, K.. (2014). Changing the Look of a City: The v-Corfu Case. Paper presented at the Iisa 2014, the 5th international conference on information, intelligence, systems and applications.
  [Bibtex]

  @inproceedings{tsoumanis2014changing,
  abstract = {Virtual Worlds are becoming a valuable tool for teaching history and promoting cultural heritage in places like the city of Corfu, an Unesco monument. In this paper, virtual Corfu (v-Corfu) is presented, i.e., a virtual world consisting of historical buildings, monuments and other existing sites characteristic of the city of Corfu, transformed into virtual sites (v-sites). A possible way of implementing v-Corfu as an education enhancer tool is explored here, focusing on the ability to promote the study of the city's history, highlight its culture and increase its attractiveness to interested potential visitors (e.g., students, tourists) or even its inhabitants. By exploiting the fact that most of these sites represented in v-Corfu do exist in the city, the aim is to further improve education by playing in the duality of both worlds. This is achieved by (i) projecting movie-like virtual tours (v-tours) consisting of parts of v-Corfu next to the real ones; and (ii) by having avatars of important historical persons participating in v-Corfu and walking nearby places that used to be their whereabouts in times long past. Both v-sites and avatars have the capability, through special virtual assistants (v-assistants), to provide the viewers with pieces of information related with the particular site or the person represented by the avatar.},
  author = {Tsoumanis, Georgios and Kavvadia, Eleni and Oikonomou, Konstantinos},
  booktitle = {IISA 2014, The 5th International Conference on Information, Intelligence, Systems and Applications},
  date-modified = {2021-12-06 10:46:10 +0200},
  doi = {10.1109/IISA.2014.6878800},
  keywords = {own, refereed, iivw, R:VR},
  month = {7},
  pages = {419--424},
  title = {{{Changing the Look of a City: The v-Corfu Case}}},
  venue = {Chania, Greece},
  year = {2014},
  Bdsk-Url-1 = {https://doi.org/10.1109/IISA.2014.6878800}}

• Komianos, V., Kavvadia, E., & Oikonomou, K.. (2014). Efficient and Realistic Cultural Heritage Representation in Large Scale Virtual Environments. Paper presented at the Iisa 2014, the 5th international conference on information, intelligence, systems and applications.
  [Bibtex]

  @inproceedings{komianos2014efficient,
  abstract = {The implementation of a virtual environment is challenging when the area to be covered is of large scale with existing objects such as historical buildings, castles, city neighbors, traditional villages etc. The desire for high fidelity is compromised by the computer MAChine limitations thus imposing a certain trade-off between fidelity and performance being thoroughly investigated in this work. In particular, although fidelity has to be reduced to achieve better performance, there are certain limits as its reduction is totally perceived and negatively judged by the users in case of close observation. Furthermore, immersion of a user is one of the essential elements for efficiently experiencing the cultural aspects of the implemented virtual environment. In this paper, the various phases (requirements, design and implementation) for constructing a large scale virtual environment that highlights cultural heritage aspects are presented and the results are being evaluated by user tests. To enable the expansion of the virtual environment over an extended area, the integration of GIS mechanisms is also proposed to guide users and enhance their experience. Segmentation of the virtual environment is also proposed to make development manageable and improve performance.},
  author = {Komianos, Vasileios and Kavvadia, Eleni and Oikonomou, Konstantinos},
  booktitle = {IISA 2014, The 5th International Conference on Information, Intelligence, Systems and Applications},
  date-modified = {2021-12-06 10:42:25 +0200},
  doi = {10.1109/IISA.2014.6878758},
  keywords = {own, refereed, iivw,R:VR},
  month = {7},
  pages = {1--6},
  title = {{{Efficient and Realistic Cultural Heritage Representation in Large Scale Virtual Environments}}},
  venue = {Chania, Greece},
  year = {2014},
  Bdsk-Url-1 = {https://doi.org/10.1109/IISA.2014.6878758}}

• Christopoulou, E., Ringas, D., & Garofalakis, J.. (2014). The vision of the sociable smart city. Paper presented at the International conference on distributed, ambient, and pervasive interactions.
  [Bibtex]

  @inproceedings{christopoulou2014vision,
  title={The vision of the sociable smart city},
  author={Christopoulou, Eleni and Ringas, Dimitrios and Garofalakis, John},
  booktitle={International Conference on Distributed, Ambient, and Pervasive Interactions},
  pages={545--554},
  year={2014},
  organization={Springer, Cham}
  }

• Ntantogian, C., Apostolopoulos, D., Marinakis, G., & Xenakis, C.. (2014). Evaluating the privacy of android mobile applications under forensic analysis. Computers & security, 42, 66–76.
  [Bibtex]

  @article{ntantogian2014evaluating,
  title={Evaluating the privacy of Android mobile applications under forensic analysis},
  author={Ntantogian, Christoforos and Apostolopoulos, Dimitris and Marinakis, Giannis and Xenakis, Christos},
  journal={Computers \& Security},
  volume={42},
  pages={66--76},
  year={2014},
  publisher={Elsevier}
  }

• Stasinopoulos, A., Ntantogian, C., & Xenakis, C.. (2014). Bypassing xss auditor: taking advantage of badly written php code. Paper presented at the 2014 ieee international symposium on signal processing and information technology (isspit).
  [Bibtex]

  @inproceedings{stasinopoulos2014bypassing,
  title={Bypassing XSS Auditor: Taking advantage of badly written PHP code},
  author={Stasinopoulos, Anastasios and Ntantogian, Christoforos and Xenakis, Christos},
  booktitle={2014 IEEE International Symposium on Signal Processing and Information Technology (ISSPIT)},
  pages={000290--000295},
  year={2014},
  organization={IEEE}
  }

• Xenakis, C., & Ntantogian, C.. (2014). An advanced persistent threat in 3g networks: attacking the home network from roaming networks. Computers & security, 40, 84–94.
  [Bibtex]

  @article{xenakis2014advanced,
  title={An advanced persistent threat in 3G networks: Attacking the home network from roaming networks},
  author={Xenakis, Christos and Ntantogian, Christoforos},
  journal={Computers \& Security},
  volume={40},
  pages={84--94},
  year={2014},
  publisher={Elsevier}
  }

• Tsohou, A., Lee, H., & Irani, Z.. (2014). Innovative public governance through cloud computing. Transforming government: people, process and policy.
  [Bibtex]

  @article{tsohou2014innovative,
  title={Innovative public governance through cloud computing},
  author={Tsohou, Aggeliki and Lee, Habin and Irani, Zahir},
  journal={Transforming Government: People, Process and Policy},
  year={2014},
  publisher={Emerald Group Publishing Limited}
  }

• Jiang, H., & Tsohou, A.. (2014). Expressive or instrumental: the dual perspective model of personal web usage at workplace. .
  [Bibtex]

  @article{jiang2014expressive,
  title={EXPRESSIVE OR INSTRUMENTAL: THE DUAL PERSPECTIVE MODEL OF PERSONAL WEB USAGE AT WORKPLACE},
  author={Jiang, Hemin and Tsohou, Aggeliki},
  year={2014}
  }

• Jiang, H., & Tsohou, A.. (2014). The dual nature of personal web usage at workplace: impacts, antecedents and regulating policies. .
  [Bibtex]

  @article{jiang2014dual,
  title={The dual nature of personal web usage at workplace: impacts, antecedents and regulating policies},
  author={Jiang, Hemin and Tsohou, Aggeliki},
  year={2014}
  }

• Koufi, V., Malamateniou, F., Tsohou, A., & Vassilacopoulos, G.. (2014). A framework for privacy-preserving access to next-generation ehrs. In E-health–for continuity of care (pp. 740–744). Ios press.
  [Bibtex]

  @incollection{koufi2014framework,
  title={A framework for privacy-preserving access to next-generation EHRs},
  author={Koufi, Vassiliki and Malamateniou, Flora and Tsohou, Aggeliki and Vassilacopoulos, George},
  booktitle={e-Health--For Continuity of Care},
  pages={740--744},
  year={2014},
  publisher={IOS Press}
  }

2013

• Magkos, E., Avlonitis, M., Kotzanikolaou, P., & Stefanidakis, M.. (2013). Towards early warning against internet worms based on critical-sized networks. Security and communication networks, 6(1), 78–88.
  [Bibtex]

  @article{magkos2013towards,
  title={Towards Early Warning Against Internet Worms Based on Critical-Sized Networks},
  author={Magkos, Emmanouil and Avlonitis, Markos and Kotzanikolaou, Panayiotis and Stefanidakis, Michalis},
  journal={Security and Communication Networks},
  volume={6},
  number={1},
  pages={78--88},
  year={2013},
  publisher={Wiley Interscience}
  }

• Burmester, M., Magkos, E., & Chrissikopoulos, V.. (2013). T-abac: an attribute-based access control model for real-time availability in highly dynamic systems. Paper presented at the Ieee symposium on computers and communications – iscc 2013.
  [Bibtex]

  @inproceedings{burmester2013t,
  title={T-ABAC: An Attribute-Based Access Control Model for Real-Time Availability in Highly Dynamic Systems},
  author={Burmester, Mike and Magkos, Emmanouil and Chrissikopoulos, Vassilis},
  booktitle={IEEE Symposium on Computers and Communications - ISCC 2013},
  year={2013},
  organization={IEEE}
  }

• Tso, F. P., Hamilton, G., Oikonomou, K., & Pezaros, D.. (2013). Implementing Scalable, Network-Aware Virtual Machine Migration for Cloud Data Centers. Paper presented at the 2013 ieee sixth international conference on cloud computing.
  [Bibtex]

  @inproceedings{tso2013implementing,
  abstract = {Virtualization has been key to the success of Cloud Computing through the on-demand allocation of shared hardware resources to Virtual MAChines (VM)s. However, the network-agnostic placement of VMs over the underlying network topology can itself be a factor of performance degradation by causing congestion at the core layers of the infrastructure where bandwidth is heavily oversubscribed. In this paper, we design and implement S-CORE, a scalable live VM migration scheme to dynamically reallocate VMs to servers while minimizing the overall communication footprint of active traffic flows. We evaluate S-CORE over diverse aggregate load and coordination policies. Our results show that it can achieve up to a 87\% communication cost reduction with a limited number of migration rounds, and can be easily accommodated within commodity hardware and hypervisor architectures. The associated memory, CPU, and network overhead are also minimum under typical Cloud Data Center workloads.},
  author = {Tso, Fung Po and Hamilton, Gregg and Oikonomou, Konstantinos and Pezaros, Dimitrios},
  booktitle = {2013 IEEE Sixth International Conference on Cloud Computing},
  date-modified = {2021-11-13 16:13:14 +0200},
  doi = {10.1109/CLOUD.2013.82},
  issn = {2159-6182},
  keywords = {own, pezaros, refereed, R:CF:FL},
  month = {6},
  pages = {557--564},
  title = {{{Implementing Scalable, Network-Aware Virtual Machine Migration for Cloud Data Centers}}},
  venue = {Santa Clara, USA},
  year = {2013},
  Bdsk-Url-1 = {https://doi.org/10.1109/CLOUD.2013.82}}

• Ringas, D., & Christopoulou, E.. (2013). Collective city memory: field experience on the effect of urban computing on community. Paper presented at the Proceedings of the 6th international conference on communities and technologies.
  [Bibtex]

  @inproceedings{ringas2013collective,
  title={Collective city memory: field experience on the effect of urban computing on community},
  author={Ringas, Dimitrios and Christopoulou, Eleni},
  booktitle={Proceedings of the 6th International Conference on Communities and Technologies},
  pages={157--165},
  year={2013}
  }

• Christopoulou, E., & Ringas, D.. (2013). Learning activities in a sociable smart city.. Ixd&a, 17, 29–42.
  [Bibtex]

  @article{christopoulou2013learning,
  title={Learning Activities in a Sociable Smart City.},
  author={Christopoulou, Eleni and Ringas, Dimitris},
  journal={IxD\&A},
  volume={17},
  pages={29--42},
  year={2013}
  }

• Christopoulou, E., Ringas, D., & Garofalakis, J. D.. (2013). Introduction to the proceedings of the sociable smart city 2013 workshop.. Paper presented at the Intelligent environments (workshops).
  [Bibtex]

  @inproceedings{christopoulou2013introduction,
  title={Introduction to the Proceedings of the Sociable Smart City 2013 Workshop.},
  author={Christopoulou, Eleni and Ringas, Dimitris and Garofalakis, John D},
  booktitle={Intelligent Environments (Workshops)},
  pages={615--616},
  year={2013}
  }

• Christopoulou, E., & Ringas, D.. (2013). Towards the sociable smart city. Paper presented at the Workshop proceedings of the 9th international conference on intelligent environments.
  [Bibtex]

  @inproceedings{christopoulou2013towards,
  title={Towards the Sociable Smart City},
  author={Christopoulou, Eleni and Ringas, Dimitrios},
  booktitle={Workshop Proceedings of the 9th International Conference on Intelligent Environments},
  pages={673--677},
  year={2013},
  organization={IOS Press}
  }

• Ringas, D., Christopoulou, E., & Stefanidakis, M.. (2013). Infusing collective memory into the city landscape. Paper presented at the Proceedings of the hybrid city conference 2013: subtle revolutions.
  [Bibtex]

  @inproceedings{ringas2013infusing,
  title={Infusing Collective Memory into the City Landscape},
  author={Ringas, Dimitrios and Christopoulou, E and Stefanidakis, M},
  booktitle={Proceedings of the Hybrid City Conference 2013: Subtle rEvolutions},
  pages={23--25},
  year={2013}
  }

• Apostolopoulos, D., Marinakis, G., Ntantogian, C., & Xenakis, C.. (2013). Discovering authentication credentials in volatile memory of android mobile devices. Paper presented at the Conference on e-business, e-services and e-society.
  [Bibtex]

  @inproceedings{apostolopoulos2013discovering,
  title={Discovering authentication credentials in volatile memory of android mobile devices},
  author={Apostolopoulos, Dimitris and Marinakis, Giannis and Ntantogian, Christoforos and Xenakis, Christos},
  booktitle={Conference on e-Business, e-Services and e-Society},
  pages={178--185},
  year={2013},
  organization={Springer}
  }

• Stasinopoulos, A., Ntantogian, C., & Xenakis, C.. (2013). The weakest link on the network: exploiting adsl routers to perform cyber-attacks. Paper presented at the 2013 ieee international symposium on signal processing and information technology (isspit).
  [Bibtex]

  @inproceedings{stasinopoulos2013weakest,
  title={The weakest link on the network: exploiting ADSL routers to perform cyber-attacks},
  author={Stasinopoulos, Anastasios and Ntantogian, Christoforos and Xenakis, Christos},
  booktitle={2013 IEEE International Symposium on Signal Processing and Information Technology (ISSPIT)},
  pages={000135--000139},
  year={2013},
  organization={IEEE}
  }

• Xenakis, C., & Ntantogian, C.. (2013). Acquisition and analysis of android memory (cync 2013-cybercrime network conference-8th-10th december 2013 at the o’brien centre for science ucd dublin ireland). Department of digital systems, university of piraeus, greece.
  [Bibtex]

  @article{xenakis2013acquisition,
  title={Acquisition and Analysis of Android Memory (CyNC 2013-Cybercrime Network Conference-8th-10th December 2013 at the O'Brien Centre for Science UCD Dublin Ireland)},
  author={Xenakis, Christos and Ntantogian, Christoforos},
  journal={Department of Digital Systems, University of Piraeus, Greece},
  year={2013}
  }

• Petrou, C., Ntantogian, C., & Xenakis, C.. (2013). A better time approximation scheme for e-passports. Paper presented at the International conference on trust, privacy and security in digital business.
  [Bibtex]

  @inproceedings{petrou2013better,
  title={A better time approximation scheme for e-passports},
  author={Petrou, Charalampos and Ntantogian, Christoforos and Xenakis, Christos},
  booktitle={International Conference on Trust, Privacy and Security in Digital Business},
  pages={13--23},
  year={2013},
  organization={Springer}
  }

• Tsohou, A., Lee, H., Irani, Z., Weerakkody, V., Osman, I. H., Anouze, A. L., & Medeni, T.. (2013). Proposing a reference process model for the citizen-centric evaluation of e-government services. Transforming government: people, process and policy.
  [Bibtex]

  @article{tsohou2013proposing,
  title={Proposing a reference process model for the citizen-centric evaluation of e-government services},
  author={Tsohou, Aggeliki and Lee, Habin and Irani, Zahir and Weerakkody, Vishanth and Osman, Ibrahim H and Anouze, Abdel L and Medeni, Tunc},
  journal={Transforming Government: People, Process and Policy},
  year={2013},
  publisher={Emerald Group Publishing Limited}
  }

• Oh, J., Lee, H., & Tsohou, A.. (2013). Governance of it service procurement: relationship vs network based approach. Governance, 6, 18–2013.
  [Bibtex]

  @article{oh2013governance,
  title={Governance of IT Service Procurement: Relationship vs Network based Approach},
  author={Oh, Jaeyoun and Lee, Habin and Tsohou, Aggeliki},
  journal={Governance},
  volume={6},
  pages={18--2013},
  year={2013}
  }

2012

• Burmester, M., Magkos, E., & Chrissikopoulos, V.. (2012). Secure and privacy-preserving, timed vehicular communications. International journal of ad hoc and ubiquitous computing, 10(4), 219–229.
  [Bibtex]

  @article{burmester2012secure,
  title={Secure and Privacy-Preserving, Timed Vehicular Communications},
  author={Burmester, Mike and Magkos, Emmanouil and Chrissikopoulos, Vassilis},
  journal={International Journal of Ad Hoc and Ubiquitous Computing},
  volume={10},
  number={4},
  pages={219--229},
  year={2012},
  publisher={Inderscience Publishers}
  }

• Burmester, M., Magkos, E., & Chrissikopoulos, V.. (2012). Modeling security in cyber-physical systems. International journal of critical infrastructure protection, 5(3-4), 118–126.
  [Bibtex]

  @article{burmester2012modeling,
  title={Modeling Security in Cyber-Physical Systems},
  author={Burmester, Mike and Magkos, Emmanouil and Chrissikopoulos, Vassilis},
  journal={International Journal of Critical Infrastructure Protection},
  volume={5},
  number={3-4},
  pages={118--126},
  year={2012},
  publisher={Elsevier}
  }

• Magkos, E.. (2012). Cryptographic approaches for privacy preservation in location-based services: a survey. Systems approach applications for developments in information technology, 273–297.
  [Bibtex]

  @article{magkos2012cryptographic,
  title={Cryptographic approaches for privacy preservation in location-based services: a survey},
  author={Magkos, Emmanouil},
  journal={Systems approach applications for developments in information technology},
  pages={273--297},
  year={2012},
  publisher={IGI Global}
  }

• Kotzanikolaou, P., Magkos, E., Petrakos, N., Douligeris, C., & Chrissikopoulos, V.. (2012). Fair anonymous authentication for location based services. Paper presented at the Dpm 2012 – 7th international workshop on data privacy management.
  [Bibtex]

  @inproceedings{kotzanikolaou2012fair,
  title={Fair Anonymous Authentication for Location Based Services},
  author={Kotzanikolaou, Panayiotis and Magkos, Emmanouil and Petrakos, Nikolaos and Douligeris, Christos and Chrissikopoulos, Vassilis},
  booktitle={DPM 2012 - 7th International Workshop on Data Privacy Management},
  pages={13--14},
  year={2012},
  organization={Springer LNCS}
  }

• Vlachopoulos, K., Magkos, E., & Chrissikopoulos, V.. (2012). A model for hybrid evidence investigation. International journal of digital crime and forensics (ijdcf), 4(4), 47–62.
  [Bibtex]

  @article{vlachopoulos2012model,
  title={A model for hybrid evidence investigation},
  author={Vlachopoulos, Konstantinos and Magkos, Emmanouil and Chrissikopoulos, Vassileios},
  journal={International Journal of Digital Crime and Forensics (IJDCF)},
  volume={4},
  number={4},
  pages={47--62},
  year={2012},
  publisher={IGI Global}
  }

• Oikonomou, K., & Aïssa, S.. (2012). Dynamic Sink Assignment for Efficient Energy Consumption in Wireless Sensor Networks. Paper presented at the 2012 ieee wireless communications and networking conference (wcnc).
  [Bibtex]

  @inproceedings{oikonomou2012dynamic,
  abstract = {Efficient energy consumption is a challenging problem in wireless sensor networks (WSNs) and closely related to extending network lifetime. The usual way of tackling this issue for topologies with fixed link weight and fixed sink location, has been shown to be severely affected by the energy hole problem. In this paper, the energy consumption problem is initially studied for WSNs with fixed sink assignment and it is analytically shown that energy consumption is minimized when the sink is assigned to the node that is the solution of a suitably formulated 1-median problem. This motivates the introduction of a dynamic environment where link weights change based on the energy level and the aggregate traffic load of the adjacent nodes. Then, the sink is adaptively allowed to move among neighbor nodes, according to a scalable sink migration strategy. Simulation results support the analytical claims demonstrating energy consumption reduction and an additional network lifetime increment when migration is employed in the dynamic environment.},
  author = {Oikonomou, Konstantinos and A{\"i}ssa, Sonia},
  booktitle = {2012 IEEE Wireless Communications and Networking Conference (WCNC)},
  date-modified = {2021-11-13 20:39:01 +0200},
  doi = {10.1109/WCNC.2012.6214091},
  issn = {1525-3511},
  keywords = {own, sonia, refereed,R:ENERGY:FLP},
  month = {4},
  pages = {1876--1881},
  title = {{{Dynamic Sink Assignment for Efficient Energy Consumption in Wireless Sensor Networks}}},
  venue = {Paris, France},
  year = {2012},
  Bdsk-Url-1 = {https://doi.org/10.1109/WCNC.2012.6214091}}

• Oikonomou, K., Tsioutsiouliklis, G., & Aïssa, S.. (2012). Scalable Facility Placement for Communication Cost Reduction in Wireless Networks. Paper presented at the 2012 ieee international conference on communications (icc).
  [Bibtex]

  @inproceedings{oikonomou2012scalable,
  abstract = {Wireless network nodes, recently powerful enough to assume sophisticated roles, have changed the angle of studying service communication costs in modern, typically large-scale and inherently dynamic, network environments. Communication cost minimization for using a certain service, is one of the challenging issues in these environments. Its ensuing optimization problem is not only difficult (NP-hard and requires global information), but also its centralized solution is non-scalable. The approach followed in this paper is a distributed one based on local information. First, a facility replication method ensuring overall communication cost reduction is proposed and analyzed. No additional overhead is introduced and the cost of hosting a new facility is also taken into account. Second, and aiming at reducing the communication cost for using a service, a policy that employs facility replication in conjunction with facility migration, is introduced. This policy is easy to implement since it relies on information locally available at the facility node, and its efficiency and limitations are also analyzed and discussed here. Simulation results are presented, supporting the analytical findings and demonstrating a significant overall cost reduction when the proposed policy is implemented.},
  author = {Oikonomou, Konstantinos and Tsioutsiouliklis, Giorgos and A{\"i}ssa, Sonia},
  booktitle = {2012 IEEE International Conference on Communications (ICC)},
  date-modified = {2021-12-05 20:19:09 +0200},
  doi = {10.1109/ICC.2012.6364371},
  issn = {1550-3607},
  keywords = {own, sonia, refereed, R:FL:SL},
  month = {6},
  pages = {5118--5123},
  title = {{{Scalable Facility Placement for Communication Cost Reduction in Wireless Networks}}},
  venue = {Ottawa, Canada},
  year = {2012},
  Bdsk-Url-1 = {https://doi.org/10.1109/ICC.2012.6364371}}

• Oikonomou, K., Koufoudakis, G., & Aïssa, S.. (2012). Probabilistic Flooding Coverage Analysis in Large Scale Wireless Networks. Paper presented at the 2012 19th international conference on telecommunications (ict).
  [Bibtex]

  @inproceedings{oikonomou2012probabilistic,
  abstract = {Information dissemination is a challenging problem in modern wireless networks in which unnecessary transmissions waste valuable resources. Approaches like traditional flooding, are not suitable in these typically large scale and inherently dynamic environments due to the large number of messages transmitted in the network. Probabilistic flooding has been proposed as a suitable alternative, capable of pruning unnecessary transmissions, while at the same time maintaining a large proportion of the network nodes covered. In this approach, the main analysis objective is on the particular threshold probability, for which the number of messages is minimized and almost all network nodes receive the initial piece of information. The analysis proposed in this paper results in a tractable analytical expression regarding coverage, in the form of a polynomial. Studying its roots: (i) results existing in the open literature are confirmed; and (ii) new and tighter boundaries for the threshold probability are derived. Simulation results confirm the analytical findings and in addition, they demonstrate that the obtained boundaries are suitable for achieving high coverage when probabilistic flooding is employed.},
  author = {Oikonomou, Konstantinos and Koufoudakis, George and A{\"i}ssa, Sonia},
  booktitle = {2012 19th International Conference on Telecommunications (ICT)},
  date-modified = {2022-05-04 11:45:55 +0300},
  doi = {10.1109/ICTEL.2012.6221290},
  keywords = {own, sonia, refereed, R:ID:LE, R:SA},
  month = {4},
  pages = {1--6},
  title = {{{Probabilistic Flooding Coverage Analysis in Large Scale Wireless Networks}}},
  venue = {Jounieh, Lebanon},
  year = {2012},
  Bdsk-Url-1 = {https://doi.org/10.1109/ICTEL.2012.6221290}}

• Christopoulou, E., Ringas, D., & Stefanidakis, M.. (2012). Experiences from the urban computing impact on urban culture. Paper presented at the 2012 16th panhellenic conference on informatics.
  [Bibtex]

  @inproceedings{christopoulou2012experiences,
  title={Experiences from the urban computing impact on urban culture},
  author={Christopoulou, Eleni and Ringas, Dimitrios and Stefanidakis, Michail},
  booktitle={2012 16th Panhellenic Conference on Informatics},
  pages={56--61},
  year={2012},
  organization={IEEE}
  }

• Ntantogian, C., & Xenakis, C.. (2012). Questioning the feasibility of umts-gsm interworking attacks. Wireless personal communications, 65(1), 157–163.
  [Bibtex]

  @article{ntantogian2012questioning,
  title={Questioning the feasibility of UMTS-GSM interworking attacks},
  author={Ntantogian, Christoforos and Xenakis, Christos},
  journal={Wireless Personal Communications},
  volume={65},
  number={1},
  pages={157--163},
  year={2012},
  publisher={Springer}
  }

• Ntantogian, C., Xenakis, C., & Stavrakakis, I.. (2012). Analysis and modeling of false synchronizations in 3g-wlan integrated networks. Paper presented at the Ifip international information security conference.
  [Bibtex]

  @inproceedings{ntantogian2012analysis,
  title={Analysis and Modeling of False Synchronizations in 3G-WLAN Integrated Networks},
  author={Ntantogian, Christoforos and Xenakis, Christos and Stavrakakis, Ioannis},
  booktitle={IFIP International Information Security Conference},
  pages={475--488},
  year={2012},
  organization={Springer}
  }

• Tsohou, A., Karyda, M., Kokolakis, S., & Kiountouzis, E.. (2012). Analyzing trajectories of information security awareness. Information technology & people.
  [Bibtex]

  @article{tsohou2012analyzing,
  title={Analyzing trajectories of information security awareness},
  author={Tsohou, Aggeliki and Karyda, Maria and Kokolakis, Spyros and Kiountouzis, Evangelos},
  journal={Information Technology \& People},
  year={2012},
  publisher={Emerald Group Publishing Limited}
  }

• El-Haddadeh, R., Tsohou, A., & Karyda, M.. (2012). Implementation challenges for information security awareness initiatives in e-government. .
  [Bibtex]

  @article{el2012implementation,
  title={Implementation challenges for information security awareness initiatives in e-government},
  author={El-Haddadeh, Ramzi and Tsohou, Aggeliki and Karyda, Maria},
  year={2012}
  }

• Tsohou, A., Al-Yafi, K., & Lee, H.. (2012). Evaluating m-government applications: an elaboration likelihood model framework. .
  [Bibtex]

  @article{tsohou2012evaluating,
  title={Evaluating m-government applications: an elaboration likelihood model framework},
  author={Tsohou, Aggeliki and Al-Yafi, Karim and Lee, Habin},
  year={2012}
  }

• Tsohou, A., Lee, H., Irani, Z., Weerakkody, V., Osman, I., Latif, A. A., & Medeni, T.. (2012). Evaluating e-government services from a citizens’ prespective: a reference process model. .
  [Bibtex]

  @article{tsohou2012evaluating,
  title={Evaluating e-Government services from a citizens' prespective: A reference process model},
  author={Tsohou, Aggeliki and Lee, Habin and Irani, Zahir and Weerakkody, Vishanth and Osman, Ibrahim and Latif, Abdel Anuz and Medeni, Tunc},
  year={2012},
  publisher={Brunel University}
  }

• Tsohou, A., Lee, H., Al-Yafi, K., Weerakkody, V., El-Haddadeh, R., Irani, Z., Ko, A., Medeni, T. D., & Campos, L. M.. (2012). Supporting public policy making processes with workflow technology: lessons learned from cases in four european countries. International journal of electronic government research (ijegr), 8(3), 63–77.
  [Bibtex]

  @article{tsohou2012supporting,
  title={Supporting Public Policy Making Processes with Workflow Technology: Lessons Learned From Cases in Four European Countries},
  author={Tsohou, Aggeliki and Lee, Habin and Al-Yafi, Karim and Weerakkody, Vishanth and El-Haddadeh, Ramzi and Irani, Zahir and Ko, Andrea and Medeni, Tunc D and Campos, Luis Miguel},
  journal={International Journal of Electronic Government Research (IJEGR)},
  volume={8},
  number={3},
  pages={63--77},
  year={2012},
  publisher={IGI Global}
  }

• Tsohou, A., Lee, H., Rebahi, Y., Khalil, M., & Hohberg, S.. (2012). Ubiquitous participation platform for policy making (ubipol): security and identity management considerations. Paper presented at the International conference on trust, privacy and security in digital business.
  [Bibtex]

  @inproceedings{tsohou2012ubiquitous,
  title={Ubiquitous Participation Platform for POLicy Making (UbiPOL): Security and Identity Management Considerations},
  author={Tsohou, Aggeliki and Lee, Habin and Rebahi, Yacine and Khalil, Mateusz and Hohberg, Simon},
  booktitle={International Conference on Trust, Privacy and Security in Digital Business},
  pages={236--237},
  year={2012},
  organization={Springer, Berlin, Heidelberg}
  }

2011

• Magkos, E., & Kotzanikolaou, P.. (2011). Achieving privacy and access control in pervasive computing environments. Security and communication networks.
  [Bibtex]

  @article{magkos2011achieving,
  title={Achieving privacy and access control in pervasive computing environments},
  author={Magkos, Emmanouil and Kotzanikolaou, Panayiotis},
  journal={Security and Communication Networks},
  year={2011},
  publisher={John Wiley \& Sons, Ltd.}
  }

• Sioutas, S., Magkos, E., Karydis, I., & Verykios, V. S.. (2011). Uncertainty for privacy and 2-dimensional range query distortion. Journal of computing science and engineering, 5(3), 210–222.
  [Bibtex]

  @article{sioutas2011uncertainty,
  title={Uncertainty for Privacy and 2-Dimensional Range Query Distortion},
  author={Sioutas, Spyros and Magkos, Emmanouil and Karydis, Ioannis and Verykios, Vassilios S},
  journal={Journal of Computing Science and Engineering},
  volume={5},
  number={3},
  pages={210--222},
  year={2011},
  publisher={KIISE}
  }

• Tsolis, D., Sioutas, S., Panaretos, A., Karydis, I., & Oikonomou, K.. (2011). Decentralized Digital Content Exchange and Copyright Protection via P2P Networks. Paper presented at the 2011 ieee symposium on computers and communications (iscc).
  [Bibtex]

  @inproceedings{tsolis2011decentralized,
  abstract = {This paper presents the use of a novel Peer to Peer (P2P) infrastructure in order to provide rapid broad digital content exchange, digital rights protection and efficient transaction management through watermarking technologies. Copyright owners use digital watermarking techniques so as to encrypt copyright information to the content. This information is represented by multiple watermarking keys used, amongst other reasons, for proof of ownership, unique identification and transaction management. Especially for transaction management the watermarking keys used are constantly changing following the content's route from user to user. The challenges for this research are a) the use of P2P technologies for efficient Digital Rights Management (DRM), b) to apply a robust watermarking algorithm to digital content which successfully embeds and detects multiple keys for each use case and c) to successfully maintain consistent the P2P system when watermarking keys are changing during content's transaction. This paper concludes that DRM and P2P can be quite complementary and not always contradictory.},
  author = {Tsolis, Dimitrios and Sioutas, Spyros and Panaretos, Alexandros and Karydis, Ioannis and Oikonomou, Konstantinos},
  booktitle = {2011 IEEE Symposium on Computers and Communications (ISCC)},
  date-modified = {2021-12-06 10:46:05 +0200},
  doi = {10.1109/ISCC.2011.5983982},
  issn = {1530-1346},
  keywords = {own, refereed, R:VAR},
  month = {6},
  pages = {1056--1061},
  title = {{{Decentralized Digital Content Exchange and Copyright Protection via P2P Networks}}},
  venue = {Corfu, Greece},
  year = {2011},
  Bdsk-Url-1 = {https://doi.org/10.1109/ISCC.2011.5983982}}

• Oikonomou, K., Loukidou, A., & Sioutas, S.. (2011). A Study of a Time-Graph Friendship Model. Paper presented at the 2011 ieee international symposium on a world of wireless, mobile and multimedia networks.
  [Bibtex]

  @inproceedings{oikonomou2011study,
  abstract = {Modeling friendship is a challenging task in social networking given the opportunistic behavior of human relationships that is hard to model. In this paper a simple two-state markov chain model is introduced attempting to give further insight on friendship and particularly how relations evolve as time passes, given that the corresponding graph is a time evolving one with interesting properties. Based on this model four distinct behavioral categories are identified and studied. As it is analytically shown, and subsequently confirmed by simulations, any network of nodes having the same friendship characteristics (e.g., a network consisted exclusively of nodes of one of the behavioral categories characterized in this work) eventually results to a network with properties similar to that of random graphs. Since modern society is characterized by power-law distributions, it is shown by simulations that there exists a certain mix of the previously mentioned categories such that the resulting graph has similar to power-law distribution.},
  author = {Oikonomou, Konstantinos and Loukidou, Afroditi and Sioutas, Spyros},
  booktitle = {2011 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks},
  date-modified = {2021-12-06 10:44:55 +0200},
  doi = {10.1109/WoWMoM.2011.5986150},
  keywords = {own, refereed, R:VAR},
  month = {6},
  pages = {1-6},
  title = {{{A Study of a Time-Graph Friendship Model}}},
  venue = {Lucca, Italy},
  year = {2011},
  Bdsk-Url-1 = {https://doi.org/10.1109/WoWMoM.2011.5986150}}

• Ringas, D., Christopoulou, E., & Stefanidakis, M.. (2011). Clio: blending the collective memory with the urban landscape. Paper presented at the Proceedings of the 10th international conference on mobile and ubiquitous multimedia.
  [Bibtex]

  @inproceedings{ringas2011clio,
  title={CLIO: blending the collective memory with the urban landscape},
  author={Ringas, Dimitrios and Christopoulou, Eleni and Stefanidakis, Michail},
  booktitle={Proceedings of the 10th international conference on mobile and ubiquitous multimedia},
  pages={185--194},
  year={2011}
  }

• Christopoulou, E., & Ringas, D.. (2011). Clio: context supporting collective city memory. Paper presented at the 2011 fifth ftra international conference on multimedia and ubiquitous engineering.
  [Bibtex]

  @inproceedings{christopoulou2011clio,
  title={CLIO: context supporting collective city memory},
  author={Christopoulou, Eleni and Ringas, Dimitrios},
  booktitle={2011 Fifth FTRA International Conference on Multimedia and Ubiquitous Engineering},
  pages={6--11},
  year={2011},
  organization={IEEE}
  }

• Christopoulou, E., & Garofalakis, J.. (2011). Context-aware cultural heritage environments. In Handbook of research on technologies and cultural heritage: applications and environments (pp. 241–258). Igi global.
  [Bibtex]

  @incollection{christopoulou2011context,
  title={Context-Aware Cultural Heritage Environments},
  author={Christopoulou, Eleni and Garofalakis, John},
  booktitle={Handbook of Research on Technologies and Cultural Heritage: Applications and Environments},
  pages={241--258},
  year={2011},
  publisher={IGI Global}
  }

• Ringas, D., Christopoulou, E., & Stefanidakis, M.. (2011). Urban memory in space and time. In Handbook of research on technologies and cultural heritage: applications and environments (pp. 325–340). Igi global.
  [Bibtex]

  @incollection{ringas2011urban,
  title={Urban memory in space and time},
  author={Ringas, Dimitrios and Christopoulou, Eleni and Stefanidakis, Michalis},
  booktitle={Handbook of research on technologies and cultural heritage: applications and environments},
  pages={325--340},
  year={2011},
  publisher={IGI Global}
  }

• Darra, E., Ntantogian, C., Xenakis, C., & Katsikas, S.. (2011). A mobility and energy-aware hierarchical intrusion detection system for mobile ad hoc networks. Paper presented at the International conference on trust, privacy and security in digital business.
  [Bibtex]

  @inproceedings{darra2011mobility,
  title={A mobility and energy-aware hierarchical intrusion detection system for mobile ad hoc networks},
  author={Darra, Eleni and Ntantogian, Christoforos and Xenakis, Christos and Katsikas, Sokratis},
  booktitle={International Conference on Trust, Privacy and Security in Digital Business},
  pages={138--149},
  year={2011},
  organization={Springer}
  }

• Ntantogian, C., Xenakis, C., & Stavrakakis, I.. (2011). Reducing false synchronizations in 3g-wlan integrated networks. Ieee transactions on wireless communications, 10(11), 3765–3773.
  [Bibtex]

  @article{ntantogian2011reducing,
  title={Reducing false synchronizations in 3G-WLAN integrated networks},
  author={Ntantogian, Christoforos and Xenakis, Christos and Stavrakakis, Ioannis},
  journal={IEEE Transactions on Wireless Communications},
  volume={10},
  number={11},
  pages={3765--3773},
  year={2011},
  publisher={IEEE}
  }

• Tsohou, A., Kokolakis, S., Lambrinoudakis, C., & Gritzalis, S.. (2011). Unifying iso security standards practices into a single security framework. Paper presented at the Proceedings of the south african information security multi-conference: port elizabeth, south africa, 17-18 may 2010.
  [Bibtex]

  @inproceedings{tsohou2011unifying,
  title={Unifying ISO Security Standards Practices into a Single Security Framework},
  author={Tsohou, A and Kokolakis, S and Lambrinoudakis, C and Gritzalis, S},
  booktitle={Proceedings of the South African Information Security Multi-Conference: Port Elizabeth, South Africa, 17-18 May 2010},
  pages={188},
  year={2011},
  organization={Lulu. com}
  }

2010

• Magkos, E., Kotzanikolaou, P., Sioutas, S., & Oikonomou, K.. (2010). A distributed privacy-preserving scheme for location-based queries. Paper presented at the Aoc 2010 – ieee wowmom workshop on autonomic and opportunistic communications, 2010.
  [Bibtex]

  @inproceedings{magkos2010distributed,
  title={A distributed privacy-preserving scheme for location-based queries},
  author={Magkos, Emmanouil and Kotzanikolaou, Panayiotis and Sioutas, Spyros and Oikonomou, Konstantinos},
  booktitle={AOC 2010 - IEEE WoWMoM Workshop on Autonomic and Opportunistic Communications, 2010},
  pages={1--6},
  year={2010},
  organization={IEEE}
  }

• Magkos, E., & Kotzanikolaou, P.. (2010). Enhancing privacy-preserving access control for pervasive computing environments. Paper presented at the The second international icst conference on security and privacy in mobile information and communication systems – mobisec 2010.
  [Bibtex]

  @inproceedings{magkos2010enhancing,
  title={Enhancing Privacy-Preserving Access Control for Pervasive Computing Environments},
  author={Magkos, Emmanouil and Kotzanikolaou, Panayiotis},
  booktitle={The Second International ICST Conference on Security and Privacy in Mobile Information and Communication Systems - MOBISEC 2010},
  pages={53--64},
  year={2010},
  organization={LNICST, Springer}
  }

• Sioutas, S., Magkos, E., Karydis, I., & Verykios, V.. (2010). Uncertainty for anonymity and 2-dimensional range query distortion. Paper presented at the Privacy in statistical databases 2010 (psd 2010).
  [Bibtex]

  @inproceedings{sioutas2010uncertainty,
  title={Uncertainty for anonymity and 2-dimensional range query distortion},
  author={Sioutas, Spyros and Magkos, Emmanouil and Karydis, Ioannis and Verykios, Vassilios},
  booktitle={Privacy in Statistical Databases 2010 (PSD 2010)},
  pages={85--96},
  year={2010},
  organization={Springer Berlin/Heidelberg LNCS 6344}
  }

• Oikonomou, K., & Stavrakakis, I.. (2010). Scalable Service Migration in Autonomic Network Environments. Ieee journal on selected areas in communications, 28(1), 84–94.
  [Bibtex]

  @article{oikonomou2010scalable,
  abstract = {Service placement is a key problem in communication networks as it determines how efficiently the user service demands are supported. This problem has been traditionally approached through the formulation and resolution of large optimization problems requiring global knowledge and a continuous recalculation of the solution in case of network changes. Such approaches are not suitable for large-scale and dynamic network environments. In this paper, the problem of determining the optimal location of a service facility is revisited and addressed in a way that is both scalable and deals inherently with network dynamicity. In particular, service migration which enables service facilities to move between neighbor nodes towards more communication cost-effective positions, is based on local information. The migration policies proposed in this work are analytically shown to be capable of moving a service facility between neighbor nodes in a way that the cost of service provision is reduced and - under certain conditions - the service facility reaches the optimal (cost minimizing) location, and locks in there as long as the environment does not change; as network conditions change, the migration process is automatically resumed, thus, naturally responding to network dynamicity under certain conditions. The analytical findings of this work are also supported by simulation results that shed some additional light on the behavior and effectiveness of the proposed policies.},
  author = {Oikonomou, Konstantinos and Stavrakakis, Ioannis},
  date-modified = {2021-11-13 13:53:08 +0200},
  doi = {10.1109/JSAC.2010.100109},
  issn = {0733-8716},
  journal = {IEEE Journal on Selected Areas in Communications},
  keywords = {own, exceptional, refereed, ana, R:FL:SL},
  month = {1},
  number = {1},
  pages = {84--94},
  title = {{{Scalable Service Migration in Autonomic Network Environments}}},
  volume = {28},
  year = {2010},
  Bdsk-Url-1 = {https://doi.org/10.1109/JSAC.2010.100109}}

• Oikonomou, K., Kogias, D., & Stavrakakis, I.. (2010). Probabilistic Flooding for Efficient Information Dissemination in Random Graph Topologies. Computer networks, 54(10), 1615–1629.
  [Bibtex]

  @article{oikonomou2010probabilistic,
  abstract = {Probabilistic flooding has been frequently considered as a suitable dissemination information approach for limiting the large message overhead associated with traditional (full) flooding approaches that are used to disseminate globally information in unstructured peer-to-peer and other networks. A key challenge in using probabilistic flooding is the determination of the forwarding probability so that global network outreach is achieved while keeping the message overhead as low as possible. In this paper, by showing that a probabilistic flooding network, generated by applying probabilistic flooding to a connected random graph network, can be (asymptotically) ``bounded'' by properly parameterized random graph networks and by invoking random graph theory results, asymptotic values of the forwarding probability are derived guaranteeing (probabilistically) successful coverage, while significantly reducing the message overhead with respect to traditional flooding. Asymptotic expressions with respect to the average number of messages and the average time required to complete network coverage are also derived, illustrating the benefits of the properly parameterized probabilistic flooding scheme. Simulation results support the claims and expectations of the analytical results and reveal certain aspects of probabilistic flooding not covered by the analysis.},
  author = {Oikonomou, Konstantinos and Kogias, Dimitrios and Stavrakakis, Ioannis},
  date-modified = {2021-11-13 16:27:18 +0200},
  doi = {10.1016/j.comnet.2010.01.007},
  issn = {1389-1286},
  journal = {Computer Networks},
  keywords = {own, refereed, ana, R:ID:PF},
  number = {10},
  pages = {1615--1629},
  publisher = {Elsevier},
  title = {{{Probabilistic Flooding for Efficient Information Dissemination in Random Graph Topologies}}},
  volume = {54},
  year = {2010},
  Bdsk-Url-1 = {https://doi.org/10.1016/j.comnet.2010.01.007}}

• Tzevelekas, L., Oikonomou, K., & Stavrakakis, I.. (2010). Random Walk With Jumps in Large-Scale Random Geometric Graphs. Computer communications, 33(13), 1505–1514.
  [Bibtex]

  @article{tzevelekas2010random,
  abstract = {The information dissemination problem in large-scale networking environments like wireless sensor networks and ad hoc networks is studied here considering random geometric graphs and random walk based approaches. A new type of random walk based agent is proposed in this paper and an analytical expression with respect to coverage (i.e., the proportion of the network nodes visited by the random walk agent) as a function of the number of the agent movements is derived. It is observed that the cover time of many of already existing random walk based variants is large in random geometric graphs of low degree (as it is commonly the case is wireless environments). As this inefficiency is attributed (as discussed in the paper) to the inability of existing random walk based solutions to move away from already likely covered areas, a mechanism for directional movement (i.e., jumping) of the random walk based agent is proposed and studied, that allows the agent to jump to different network areas, most likely not covered yet. The proposed mechanism (Jumping Random Walk) is studied analytically and via simulations and the parameters (of the network topology and the mechanism) under which the proposed scheme outperforms existing random walk based variations are determined.},
  author = {Tzevelekas, Leonidas and Oikonomou, Konstantinos and Stavrakakis, Ioannis},
  date-modified = {2021-11-13 16:35:05 +0200},
  doi = {10.1016/j.comcom.2010.01.026},
  issn = {0140-3664},
  journal = {Computer Communications},
  keywords = {own, refereed, ana, R:ID:RW},
  number = {13},
  pages = {1505--1514},
  publisher = {Elsevier},
  title = {{{Random Walk With Jumps in Large-Scale Random Geometric Graphs}}},
  volume = {33},
  year = {2010},
  Bdsk-Url-1 = {https://doi.org/10.1016/j.comcom.2010.01.026}}

• Oikonomou, K., Kogias, D., & Stavrakakis, I.. (2010). A Study of Information Dissemination Under Multiple Random Walkers and Replication Mechanisms. Paper presented at the Proceedings of the second international workshop on mobile opportunistic networking, New York, NY, USA.
  [Bibtex]

  @inproceedings{oikonomou2010study,
  abstract = {Random walk-based approaches are suitable for information dissemination in mobile and opportunistic environments that are inherently dynamic and typically large-scale. Multiple random walkers have been proposed in the recent past as a suitable mechanism to significantly reduce termination time when covering a network topology. In this paper, the multiple random walkers mechanism is studied and analyzed under a different and novel perspective that allows for further understanding of network coverage when employing multiple random walkers in a network. Given that under this mechanism the number of movements is significantly increased (proportional to the number of random walkers) -- and sometimes not as effective as expected due to frequent revisits that do not improve coverage as shown in this paper -- a replication mechanism is introduced that is capable of reducing the number of movements by reducing initial revisits. Simulation results considering geometric random graph topologies -- which are suitable for modeling mobile environments -- are also presented supporting the analytical findings and shedding more light on various aspects of both the aforementioned mechanisms.},
  acmid = {1755765},
  address = {New York, NY, USA},
  author = {Oikonomou, Konstantinos and Kogias, Dimitrios and Stavrakakis, Ioannis},
  booktitle = {Proceedings of the Second International Workshop on Mobile Opportunistic Networking},
  date-modified = {2021-11-13 16:35:10 +0200},
  doi = {10.1145/1755743.1755765},
  isbn = {978-1-60558-925-1},
  keywords = {own, refereed, ana, R:ID:RW},
  numpages = {8},
  pages = {118--125},
  publisher = {ACM},
  series = {MobiOpp '10},
  title = {{{A Study of Information Dissemination Under Multiple Random Walkers and Replication Mechanisms}}},
  venue = {Pisa, Italy},
  year = {2010},
  Bdsk-Url-1 = {https://doi.org/10.1145/1755743.1755765}}

• Magkos, E., Kotzanikolaou, P., Sioutas, S., & Oikonomou, K.. (2010). A Distributed Privacy-Preserving Scheme for Location-Based Queries. Paper presented at the 2010 ieee international symposium on a world of wireless, mobile and multimedia networks (wowmom).
  [Bibtex]

  @inproceedings{magkos2010distributed,
  abstract = {In this paper we deal with security and historical privacy in Location Based Service (LBS) applications where users submit accurate location samples to an LBS provider. Specifically we propose a distributed scheme that establishes access control while protecting the privacy of a user in both sporadic and continuous LBS queries. Our solution employs a hybrid network architecture where LBS users: (a) are able to communicate with an LBS provider through a network (e.g., cellular) operator, and (b) they are also able to create wireless ad-hoc networks with other peers in order to obtain privacy against an adversary that performs traffic analysis. Our threat model considers the network operator, the LBS provider and other peers, as potential privacy adversaries. For historical privacy we adopt the generic approach of using multiple pseudonyms that are changed frequently. In order to establish untraceability against traffic analysis attacks, a message is not sent directly to the cellular operator, but it is distributed among mobile neighbors who act like mixes and re-encrypt a message before sending it to the LBS provider via the cellular operator. As an extension, we also discuss how to aggregate independent data from different mobile peers before sending them to the LBS provider. This approach may be suitable in applications where aggregate location data are useful (e.g., traffic monitoring and control)},
  author = {Magkos, Emmanouil and Kotzanikolaou, Panayiotis and Sioutas, Spyros and Oikonomou, Konstantinos},
  booktitle = {2010 IEEE International Symposium on A World of Wireless, Mobile and Multimedia Networks (WoWMoM)},
  date-modified = {2021-12-06 10:43:07 +0200},
  doi = {10.1109/WOWMOM.2010.5534928},
  keywords = {own, refereed, R:VAR},
  month = {6},
  pages = {1-6},
  title = {{{A Distributed Privacy-Preserving Scheme for Location-Based Queries}}},
  venue = {Montreal, Canada},
  year = {2010},
  Bdsk-Url-1 = {https://doi.org/10.1109/WOWMOM.2010.5534928}}

• Christopoulou, E., & Garofalakis, J.. (2010). Enabling the user to setup ubiquitous computing applications based on intelligent context. Paper presented at the 2010 international conference on complex, intelligent and software intensive systems.
  [Bibtex]

  @inproceedings{christopoulou2010enabling,
  title={Enabling the user to setup ubiquitous computing applications based on intelligent context},
  author={Christopoulou, Eleni and Garofalakis, John},
  booktitle={2010 International Conference on Complex, Intelligent and Software Intensive Systems},
  pages={87--92},
  year={2010},
  organization={IEEE}
  }

• Ntantogian, C., Xenakis, C., & Stavrakakis, I.. (2010). A generic mechanism for efficient authentication in b3g networks. Computers & security, 29(4), 460–475.
  [Bibtex]

  @article{ntantogian2010generic,
  title={A generic mechanism for efficient authentication in B3G networks},
  author={Ntantogian, Christoforos and Xenakis, Christos and Stavrakakis, Ioannis},
  journal={computers \& security},
  volume={29},
  number={4},
  pages={460--475},
  year={2010},
  publisher={Elsevier}
  }

• Chatzikonstantinou, A., Ntantogian, C., Xenakis, C., & Karopoulos, G.. (2010). An empirical evaluation of cryptography usage in android applications. .
  [Bibtex]

  @article{chatzikonstantinou2010empirical,
  title={An Empirical Evaluation of Cryptography Usage in Android Applications},
  author={Chatzikonstantinou, Alexia and Ntantogian, Christoforos and Xenakis, Christos and Karopoulos, Georgios},
  year={2010}
  }

• Evans, R., Tsohou, A., Tryfonas, T., & Morgan, T.. (2010). Engineering secure systems with iso 26702 and 27001. Paper presented at the 2010 5th international conference on system of systems engineering.
  [Bibtex]

  @inproceedings{evans2010engineering,
  title={Engineering secure systems with ISO 26702 and 27001},
  author={Evans, Rhys and Tsohou, Aggeliki and Tryfonas, Theo and Morgan, Thea},
  booktitle={2010 5th International Conference on System of Systems Engineering},
  pages={1--6},
  year={2010},
  organization={IEEE}
  }

• Vrakas, N., Kalloniatis, C., Tsohou, A., & Lambrinoudakis, C.. (2010). Privacy requirements engineering for trustworthy e-government services. Paper presented at the International conference on trust and trustworthy computing.
  [Bibtex]

  @inproceedings{vrakas2010privacy,
  title={Privacy requirements engineering for trustworthy e-government services},
  author={Vrakas, Nikos and Kalloniatis, Christos and Tsohou, Aggeliki and Lambrinoudakis, Costas},
  booktitle={International Conference on Trust and Trustworthy Computing},
  pages={298--307},
  year={2010},
  organization={Springer, Berlin, Heidelberg}
  }

• Tsohou, A., Karyda, M., Kokolakis, S., & Kiountouzis, E.. (2010). Analyzing information security awareness through networks of association. Paper presented at the International conference on trust, privacy and security in digital business.
  [Bibtex]

  @inproceedings{tsohou2010analyzing,
  title={Analyzing information security awareness through networks of association},
  author={Tsohou, Aggeliki and Karyda, Maria and Kokolakis, Spyros and Kiountouzis, Evangelos},
  booktitle={International Conference on Trust, Privacy and Security in Digital Business},
  pages={227--237},
  year={2010},
  organization={Springer, Berlin, Heidelberg}
  }

• Tsohou, A., Kokolakis, S., Lambrinoudakis, C., & Gritzalis, S.. (2010). A security standards’ framework to facilitate best practices’ awareness and conformity. Information management & computer security.
  [Bibtex]

  @article{tsohou2010security,
  title={A security standards' framework to facilitate best practices' awareness and conformity},
  author={Tsohou, Aggeliki and Kokolakis, Spyros and Lambrinoudakis, Costas and Gritzalis, Stefanos},
  journal={Information Management \& Computer Security},
  year={2010},
  publisher={Emerald Group Publishing Limited}
  }

• Tsohou, A., Lambrinoudakis, C., Kokolakis, S., & Gritzalis, S.. (2010). The importance of context-dependent privacy requirements and perceptions to the design of privacy-aware systems. Upgrade: the european journal for the informatics professional, 11, 32–37.
  [Bibtex]

  @article{tsohou2010importance,
  title={The importance of context-dependent privacy requirements and perceptions to the design of privacy-aware systems},
  author={Tsohou, Aggeliki and Lambrinoudakis, Costas and Kokolakis, Spyros and Gritzalis, Stefanos},
  journal={UPGRADE: The European Journal for the Informatics Professional},
  volume={11},
  pages={32--37},
  year={2010}
  }

• Tsohou, A., Lambrinoudakis, C., Kokolakis, S., & Gritzalis, S.. (2010). La importancia de los requerimientos de la privacidad dependiente del contexto y percepciones para el diseño de sistemas sensibles a la privacidad. Novática: revista de la asociación de técnicos de informática(205), 58–62.
  [Bibtex]

  @article{tsohou2010importancia,
  title={La importancia de los requerimientos de la privacidad dependiente del contexto y percepciones para el dise{\~n}o de sistemas sensibles a la privacidad},
  author={Tsohou, Aggeliki and Lambrinoudakis, Costas and Kokolakis, Spyros and Gritzalis, Stefanos},
  journal={Nov{\'a}tica: Revista de la Asociaci{\'o}n de T{\'e}cnicos de Inform{\'a}tica},
  number={205},
  pages={58--62},
  year={2010},
  publisher={Asociaci{\'o}n de T{\'e}cnicos de Inform{\'a}tica, ATI}
  }

2009

• Magkos, E., Maragoudakis, M., Chrissikopoulos, V., & Gritzalis, S.. (2009). Accurate and large-scale privacy-preserving data mining using the election paradigm. Data & knowledge engineering, 68(11), 1224–1236.
  [Bibtex]

  @article{magkos2009accurate,
  title={Accurate and large-scale privacy-preserving data mining using the election paradigm},
  author={Magkos, Emmanouil and Maragoudakis, Manolis and Chrissikopoulos, Vassilis and Gritzalis, Stefanos},
  journal={Data \& Knowledge Engineering},
  volume={68},
  number={11},
  pages={1224--1236},
  year={2009},
  publisher={North-Holland}
  }

• Kotzanikolaou, P., Magkos, E., Vergados, D., & Stefanidakis, M.. (2009). Secure and practical key establishment for distributed sensor networks. Security and communication networks, 2(6), 595–610.
  [Bibtex]

  @article{kotzanikolaou2009secure,
  title={Secure and practical key establishment for distributed sensor networks},
  author={Kotzanikolaou, Panayiotis and Magkos, Emmanouil and Vergados, Dimitrios and Stefanidakis, Michalis},
  journal={Security and Communication Networks},
  volume={2},
  number={6},
  pages={595--610},
  year={2009},
  publisher={John Wiley \& Sons, Ltd. Chichester, UK}
  }

• Kermanidis, K., & Magkos, E.. (2009). Empirical paraphrasing of modern greek text in two phases: an application to steganography. Paper presented at the 10th international conference on intelligent text processing and computational linguistics (cicling 2009).
  [Bibtex]

  @inproceedings{kermanidis2009empirical,
  title={Empirical paraphrasing of modern Greek text in two phases: an application to steganography},
  author={Kermanidis, Katia and Magkos, Emmanouil},
  booktitle={10th International Conference on Intelligent Text Processing and Computational Linguistics (CICLing 2009)},
  pages={535--546},
  year={2009},
  organization={Springer Berlin/Heidelberg LNCS 5449}
  }

• Avlonitis, M., Magkos, E., Stefanidakis, M., & Chrissikopoulos, V.. (2009). A novel stochastic approach for modeling random scanning worms. Paper presented at the 13th panhellenic conference on informatics (pci’09), 2009.
  [Bibtex]

  @inproceedings{avlonitis2009novel,
  title={A novel stochastic approach for modeling random scanning worms},
  author={Avlonitis, Markos and Magkos, Emmanouil and Stefanidakis, Michalis and Chrissikopoulos, Vassilis},
  booktitle={13th Panhellenic Conference on Informatics (PCI'09), 2009},
  pages={176--179},
  year={2009},
  organization={IEEE}
  }

• Avlonitis, M., Magkos, E., Stefanidakis, M., & Chrissikopoulos, V.. (2009). Treating scalability and modelling human countermeasures against local preference worms via gradient models. Journal in computer virology, 5(4), 357–364.
  [Bibtex]

  @article{avlonitis2009treating,
  title={Treating scalability and modelling human countermeasures against local preference worms via gradient models},
  author={Avlonitis, Markos and Magkos, Emmanouil and Stefanidakis, Michalis and Chrissikopoulos, Vassilis},
  journal={Journal in computer virology},
  volume={5},
  number={4},
  pages={357--364},
  year={2009},
  publisher={Springer-Verlag}
  }

• Sioutas, S., Oikonomou, K., Papaloukopoulos, G., Xenos, M., & Manolopoulos, Y.. (2009). Building an Efficient P2P Overlay for Energy-level Queries in Sensor Networks. Paper presented at the Proceedings of the international conference on management of emergent digital ecosystems.
  [Bibtex]

  @inproceedings{sioutas2009building,
  abstract = {After the debunking of some myths about why P2P overlays are not feasible in sensornets, many such solutions have been proposed. None of the existing P2P overlays for sensornets provide ``Energy-Level Application and Services''. On this purpose and based on the efficient P2P method presented in [16], we design a novel P2P overlay for Energy Level discovery in a sensornet, the so-called ELDT (Energy Level Distributed Tree). Sensor nodes are mapped to peers based on their energy level. As the energy levels change, the sensor nodes would have to move from one peer to another and this oparation is the most crucial for the efficient scalability of the proposed system. Similarly, as the energy level of a sensor node becomes extremelly low, that node may want to forward it's task to another node with the desired energy level. The adaptation of the P2P index presented in [16] quarantees the best-known query performance of the above operation. We experimentally verify this performance via an appropriate simulator we have designed for this purpose.},
  acmid = {1643890},
  articleno = {54},
  author = {Sioutas, Spyros and Oikonomou, Konstantinos and Papaloukopoulos, George and Xenos, M and Manolopoulos, Yannis},
  booktitle = {Proceedings of the International Conference on Management of Emergent Digital EcoSystems},
  date-modified = {2021-11-13 20:21:49 +0200},
  doi = {10.1145/1643823.1643890},
  isbn = {978-1-60558-829-2},
  keywords = {own, refereed,R:ENERGY},
  numpages = {8},
  pages = {54:361--54:368},
  publisher = {ACM},
  series = {MEDES '09},
  title = {{{Building an Efficient P2P Overlay for Energy-level Queries in Sensor Networks}}},
  venue = {Lyon, France},
  year = {2009},
  Bdsk-Url-1 = {https://doi.org/10.1145/1643823.1643890}}

• Oikonomou, K., Sioutas, S., & Stavrakakis, I.. (2009). Scalable Communication Cost Reduction: The Chord Case. Paper presented at the 2009 8th ifip annual mediterranean ad hoc networking workshop.
  [Bibtex]

  @inproceedings{oikonomou2009scalable,
  abstract = {In peer-to-peer (P2P) network system design a main focus is on efficient service discovery schemes, most frequently assuming permanent (or long-term stationary) positions for service facilities, neglecting communication costs due to the actual locations of the facilities. Since the problem of communication cost minimization is a large optimization problem (NP-hard) and requires global information (i.e., not scalable), in this paper the service migration philosophy is adopted which permits service facility movements and yields smaller communication cost in a scalable manner (i.e., based on local information). Service migration is incorporated in the Chord P2P system, imposing certain changes (e.g., the extension of the service discovery scheme of Chord) and introducing an extra system overhead (i.e., update messages) for the efficient operation of the (enhanced) system. As it is demonstrated here using simulation results, the communication cost corresponding to the extra system overhead is significantly small and more than enough compensated for by the communication cost reduction due to the introduction of service migration. As long as the network remains unchanged, the former communication cost is paid only once while the latter communication cost reduction is permanent.},
  author = {Oikonomou, Konstantinos and Sioutas, Spyros and Stavrakakis, Ioannis},
  booktitle = {2009 8th IFIP Annual Mediterranean Ad Hoc Networking Workshop},
  date-modified = {2021-12-06 10:44:51 +0200},
  doi = {10.1109/MEDHOCNET.2009.5205198},
  keywords = {own, refereed, ana, R:FL:SL},
  month = {6},
  pages = {42-47},
  title = {{{Scalable Communication Cost Reduction: The Chord Case}}},
  venue = {Haifa, Israel},
  year = {2009},
  Bdsk-Url-1 = {https://doi.org/10.1109/MEDHOCNET.2009.5205198}}

• Oikonomou, K., Kogias, D., Tzevelekas, L., & Stavrakakis, I.. (2009). Investigation of Information Dissemination Design Criteria in Large-Scale Network Environments. Paper presented at the 2009 13th panhellenic conference on informatics.
  [Bibtex]

  @inproceedings{oikonomou2009investigation,
  abstract = {The design of efficient information dissemination mechanism is a challenging problem in large-scale network with respect to the number of messages and termination time. In this paper, advertisement and searching -- the two basic ingredients of information dissemination -- are investigated and certain criteria are proposed with respect to the correctness, promptness and fairness of the approach. Based on the complementarity of both advertisement and searching, the aforementioned criteria can be satisfied under certain conditions, which form the baseline of design principles for efficient information dissemination, as analytically -- also using numerical results -- is investigated here.},
  author = {Oikonomou, Konstantinos and Kogias, Dimitrios and Tzevelekas, Leonidas and Stavrakakis, Ioannis},
  booktitle = {2009 13th Panhellenic Conference on Informatics},
  date-modified = {2021-12-06 10:44:45 +0200},
  doi = {10.1109/PCI.2009.16},
  keywords = {own, refereed, ana, R:ID:PF},
  month = {9},
  pages = {163--167},
  title = {{{Investigation of Information Dissemination Design Criteria in Large-Scale Network Environments}}},
  venue = {Corfu, Greece},
  year = {2009},
  Bdsk-Url-1 = {https://doi.org/10.1109/PCI.2009.16}}

• Kogias, D., Oikonomou, K., & Stavrakakis, I.. (2009). Study of Randomly Replicated Random Walks for Information Dissemination Over Various Network Topologies. Paper presented at the 2009 sixth international conference on wireless on-demand network systems and services.
  [Bibtex]

  @inproceedings{kogias2009study,
  abstract = {Flooding is well known to be the ldquofastestrdquo way to propagate information throughout a network (achieve 100\% coverage), at the expense of typically unacceptably large message-forwarding overhead; when the overhead is controlled or limited, then the achieved coverage is reduced. A Single Random Walker (SRW) is another popular mechanism for information dissemination that is very ldquoslowrdquo compared to flooding but utilizes less overhead and can potentially achieve better coverage than flooding. The latter may be attributed to the better ldquostretchingrdquo properties (ability to visit further away network regions) of the SRW and is particularly observed if coverage is defined as the set of network nodes which are at most L hops away from a network node which received the information (notion of L-coverage, L ges 0). Randomly Replicated Random Walkers (RRRWs) are considered in this paper as a broad class of information dissemination mechanisms whose members are defined by a given value of the (first) replication probability; clearly a SWR corresponds to the RRRWs with zero (first) replication probability, while for values of the (first) replication probability close to one a large number of information disseminating agents (RWs) are generated resembling the operation of flooding. By considering various performance metrics (such as the achieved coverage for a given message-forwarding budget and the time required to spend the available message-forwarding budget), and by considering various network topologies (such as Random Geometric, Erdos-Renyi and Clustered environments), we show that the class of RRRWs can ldquofillrdquo the performance space, between the performance induced by flooding and the SRW, thus offering a richer set of information dissemination strategies that can better match desirable performance constraints or objectives.},
  author = {Kogias, Dimitris and Oikonomou, Konstantinos and Stavrakakis, Ioannis},
  booktitle = {2009 Sixth International Conference on Wireless On-Demand Network Systems and Services},
  date-modified = {2021-12-06 10:42:20 +0200},
  doi = {10.1109/WONS.2009.4801834},
  keywords = {own, refereed, ana, R:ID:RW},
  month = {2},
  pages = {53--60},
  title = {{{Study of Randomly Replicated Random Walks for Information Dissemination Over Various Network Topologies}}},
  venue = {Snowbird, Utah, USA},
  year = {2009},
  Bdsk-Url-1 = {https://doi.org/10.1109/WONS.2009.4801834}}

• Christopoulou, E.. (2009). Context as a necessity in mobile applications. In Mobile computing: concepts, methodologies, tools, and applications (pp. 65–83). Igi global.
  [Bibtex]

  @incollection{christopoulou2009context,
  title={Context as a necessity in mobile applications},
  author={Christopoulou, Eleni},
  booktitle={Mobile computing: concepts, methodologies, tools, and applications},
  pages={65--83},
  year={2009},
  publisher={IGI Global}
  }

• Ntantogian, C., & Xenakis, C.. (2009). One-pass eap-aka authentication in 3g-wlan integrated networks. Wireless personal communications, 48(4), 569–584.
  [Bibtex]

  @article{ntantogian2009one,
  title={One-pass EAP-AKA authentication in 3G-WLAN integrated networks},
  author={Ntantogian, Christoforos and Xenakis, Christos},
  journal={Wireless personal communications},
  volume={48},
  number={4},
  pages={569--584},
  year={2009},
  publisher={Springer}
  }

• Ntantogian, C., & Xenakis, C.. (2009). Security architectures for b3g mobile networks. In Mobile computing: concepts, methodologies, tools, and applications (pp. 2674–2695). Igi global.
  [Bibtex]

  @incollection{ntantogian2009security,
  title={Security Architectures for B3G Mobile Networks},
  author={Ntantogian, Christoforos and Xenakis, Christos},
  booktitle={Mobile Computing: Concepts, Methodologies, Tools, and Applications},
  pages={2674--2695},
  year={2009},
  publisher={IGI Global}
  }

• Tsohou, A., Karyda, M., Kokolakis, S., & Kiountouzis, E. A.. (2009). Aligning security awareness with information systems security management.. Paper presented at the Mcis.
  [Bibtex]

  @inproceedings{tsohou2009aligning,
  title={Aligning Security Awareness With Information Systems Security Management.},
  author={Tsohou, Aggeliki and Karyda, Maria and Kokolakis, Spyros and Kiountouzis, Evangelos A},
  booktitle={MCIS},
  pages={73},
  year={2009}
  }

• Tsohou, A., Kokolakis, S., Lambrinoudakis, C., & Gritzalis, S.. (2009). Information systems security management: a review and a classification of the iso standards. Paper presented at the International conference on e-democracy.
  [Bibtex]

  @inproceedings{tsohou2009information,
  title={Information systems security management: a review and a classification of the ISO standards},
  author={Tsohou, Aggeliki and Kokolakis, Spyros and Lambrinoudakis, Costas and Gritzalis, Stefanos},
  booktitle={International Conference on e-Democracy},
  pages={220--235},
  year={2009},
  organization={Springer, Berlin, Heidelberg}
  }

• Rizomiliotis, P., Tsohou, A., Lambrinoudakis, C., & Gritzalis, S.. (2009). Security and privacy issues in bipolar disorder research. .
  [Bibtex]

  @article{rizomiliotis2009security,
  title={Security and Privacy Issues in Bipolar Disorder Research},
  author={Rizomiliotis, Panagiotis and Tsohou, Aggeliki and Lambrinoudakis, Costas and Gritzalis, Stefanos},
  year={2009}
  }

2008

• Burmester, M., Magkos, E., & Chrissikopoulos, V.. (2008). Strengthening privacy protection in vanets. Paper presented at the Wimob ’08 – ieee international conference on wireless and mobile computing, networking and communications, 2008..
  [Bibtex]

  @inproceedings{burmester2008strengthening,
  title={Strengthening privacy protection in VANETs},
  author={Burmester, Mike and Magkos, Emmanouil and Chrissikopoulos, Vassilis},
  booktitle={WIMOB '08 - IEEE International Conference on Wireless and Mobile Computing, Networking and Communications, 2008.},
  pages={508--513},
  year={2008},
  organization={IEEE}
  }

• Kotzanikolaou, P., Vergados, D. D., Stergiou, G., & Magkos, E.. (2008). Multilayer key establishment for large-scale sensor networks. International journal of security and networks, 3(1), 1–9.
  [Bibtex]

  @article{kotzanikolaou2008multilayer,
  title={Multilayer key establishment for large-scale sensor networks},
  author={Kotzanikolaou, Panayiotis and Vergados, Dimitris D and Stergiou, Giannis and Magkos, Emmanouil},
  journal={International Journal of Security and Networks},
  volume={3},
  number={1},
  pages={1--9},
  year={2008},
  publisher={Inderscience Publishers}
  }

• Stathopoulos, V., Kotzanikolaou, P., & Magkos, E.. (2008). Secure log management for privacy assurance in electronic communications. Computers & security, 27(7-8), 298–308.
  [Bibtex]

  @article{stathopoulos2008secure,
  title={Secure Log Management for Privacy Assurance in Electronic Communications},
  author={Stathopoulos, Vassilios and Kotzanikolaou, Panayiotis and Magkos, Emmanouil},
  journal={Computers \& Security},
  volume={27},
  number={7-8},
  pages={298--308},
  year={2008},
  publisher={Elsevier}
  }

• Magkos, E., Maragoudakis, M., Chrissikopoulos, V., & Gridzalis, S.. (2008). Accuracy in privacy-preserving data mining using the paradigm of cryptographic elections. Paper presented at the Privacy in statistical databases (psd 2008).
  [Bibtex]

  @inproceedings{magkos2008accuracy,
  title={Accuracy in privacy-preserving data mining using the paradigm of cryptographic elections},
  author={Magkos, Emmanouil and Maragoudakis, Manolis and Chrissikopoulos, Vassilis and Gridzalis, Stefanos},
  booktitle={Privacy in Statistical Databases (PSD 2008)},
  pages={284--297},
  year={2008},
  organization={Springer Berlin/Heidelberg LNCS 5262}
  }

• Pateli, A., Floros, A., Oikonomou, K., & Magkos, E.. (2008). Corfunet: a mesh network providing wireless services at metropolitan level. Paper presented at the Iadis international conference on wireless applications and computing 2008.
  [Bibtex]

  @inproceedings{pateli2008corfunet,
  title={Corfunet: A mesh network providing wireless services AT metropolitan level},
  author={Pateli, Adamantia and Floros, Andreas and Oikonomou, Konstantinos and Magkos, Emmanouil},
  booktitle={IADIS International Conference on Wireless Applications and Computing 2008},
  pages={22--24},
  year={2008}
  }

• Avlonitis, M., Magkos, E., Stefanidakis, M., & Chrissikopoulos, V.. (2008). Exploring scalability and fast spreading of local preference worms via gradient models. Paper presented at the 17th eicar annual conference, 3-6 may 2008, laval, france, 2008.
  [Bibtex]

  @inproceedings{avlonitis2008exploring,
  title={Exploring Scalability and Fast Spreading of Local Preference Worms via Gradient Models},
  author={Avlonitis, Markos and Magkos, Emmanouil and Stefanidakis, Michalis and Chrissikopoulos, Vassilis},
  booktitle={17th EICAR Annual Conference, 3-6 May 2008, Laval, France, 2008},
  year={2008}
  }

• Magkos, E., & Chrissikopoulos, V.. (2008). Towards efficient cryptography for privacy preserving data mining in distributed systems.. Paper presented at the Webist (1).
  [Bibtex]

  @inproceedings{magkos2008towards,
  title={Towards Efficient Cryptography for Privacy Preserving Data Mining in Distributed Systems.},
  author={Magkos, Emmanouil and Chrissikopoulos, Vassilios},
  booktitle={WEBIST (1)},
  pages={301--304},
  year={2008}
  }

• Lambrinoudakis, C., Magkos, E., & Chrissikopoulos, V.. (2008). Electronic voting systems. Chapter): j. lopez, s. furnell, a. patel, s. katsikas,(ed.),” securing information and communication systems: principles, technologies and applications”. artech house publishers, computer security series, 307–323.
  [Bibtex]

  @article{lambrinoudakis2008electronic,
  title={Electronic voting systems},
  author={Lambrinoudakis, C and Magkos, E and Chrissikopoulos, V},
  journal={Chapter): J. Lopez, S. Furnell, A. Patel, S. Katsikas,(Ed.),” Securing Information and Communication Systems: Principles, Technologies and Applications”. Artech House Publishers, Computer Security Series},
  pages={307--323},
  year={2008}
  }

• Oikonomou, K., Stavrakakis, I., & Xydias, A.. (2008). Scalable Service Migration in General Topologies. Paper presented at the 2008 international symposium on a world of wireless, mobile and multimedia networks.
  [Bibtex]

  @inproceedings{oikonomou2008scalable,
  abstract = {Service placement has typically been studied through the formulation and solution of a 1-median problem that is known to be complex and require global information. As such approaches are clearly not scalable in dynamic and large-scale environments, a more reasonable approach to service placement for large, ad hoc and autonomic environments would be through service migration. Such a migration policy has recently been proposed for tree topologies. The focus of the present paper is to devise effective service migration policies for general topologies with equal weight links. The proposed strategy - that incorporates a 2-phase polling mechanism of local scope and, consequently, induces in general a certain overhead - is shown to out-perform the previous one (i.e., getting closer to the optimal placement) for such general topologies. Finally, a hybrid migration policy (combining the present and the past ones) is considered and shown through simulations to be capable of reducing significantly the overhead effects of the afore-mentioned polling mechanism.},
  author = {Oikonomou, Konstantinos and Stavrakakis, Ioannis and Xydias, Alexios},
  booktitle = {2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks},
  date-modified = {2021-12-06 10:44:40 +0200},
  doi = {10.1109/WOWMOM.2008.4594891},
  keywords = {own, refereed, ana, R:FL:SL},
  month = {6},
  pages = {1-6},
  title = {{{Scalable Service Migration in General Topologies}}},
  venue = {Newport Beach, California},
  year = {2008},
  Bdsk-Url-1 = {https://doi.org/10.1109/WOWMOM.2008.4594891}}

• Kogias, D., Oikonomou, K., & Stavrakakis, I.. (2008). Replicated Random Walks for Service Advertising in Unstructured Environments. Paper presented at the Advances in ad hoc networking, ad hoc networking workshop (med-hoc-net), 2008 7th annual mediterranean.
  [Bibtex]

  @inproceedings{kogias2008replicated,
  abstract = {Service advertisement is a key design issue in modern dynamic and large- scale networking environments such as unstructured peer-to-peer networks. The intrinsic capability of a single random walker of stretching the information dissemination over widely spread network areas (compared to flooding), is explored and exploited in this paper, along with the introduction of random walkers which can replicate themselves. Two replication policies are also introduced in this paper: the Topology Independent Policy that creates replicas according to an exponentially decreasing probability (creating more replicas at the beginning of the advertising process), and the Topology Dependent Policy in which replication decisions are based on some locally available topological information (aiming at creating replicas at the dense network areas). The discussion and the results in this paper reveal intrinsic comparative properties of flooding and the single random walker, as well as the advantages that the random walker replication can bring in improving the overhead, speed and coverage of the advertising process.},
  author = {Kogias, Dimitris and Oikonomou, Konstantions and Stavrakakis, Ioannis},
  booktitle = {Advances in Ad Hoc Networking, Ad Hoc Networking Workshop (MED-HOC-NET), 2008 7th Annual Mediterranean},
  comment = {[pdf]},
  date-modified = {2021-12-06 10:42:13 +0200},
  keywords = {own, refereed, ana, R:ID:RW},
  month = {6},
  pages = {25--36},
  publisher = {Springer},
  title = {{{Replicated Random Walks for Service Advertising in Unstructured Environments}}},
  venue = {Palma de Mallorca, Spain},
  year = {2008}}

• Pateli, A., Floros, A., Oikonomou, K., & Magkos, E.. (2008). Corfunet: A Mesh Network Providing Wireless Services at Metropolitan Level. Paper presented at the Proceedings of the iadis international conference on wireless applications and computing 2008.
  [Bibtex]

  @inproceedings{pateli2008corfunet,
  abstract = {This paper discusses the technology and commercialization challenges of a research initiative intended to establish a wireless metropolitan network for the city of Corfu. Key wireless mesh networking issues are discussed and value for the potential service providers and users of the network is specified. The network development builds on advanced features of wireless mesh networks, like multi-channel and multi-radio operation, connectivity to a fixed network infrastructure through multiple links and general purpose applications support, which overcome many of the limitations that are currently imposed by wireless ad-hoc networks. The proposed network is designed to provide apart from broadband Internet access a number of sophisticated services to the citizens, tourists and business visitors of the island. To assure viability and expansion for the CorfuNet initiative, the present study discusses scenarios on two alternative business models, namely the collaborative and the single provider models, differentiated on the basis of the network's owner.},
  author = {Pateli, Adamantia and Floros, Andreas and Oikonomou, Konstantinos and Magkos, Emmanouil},
  booktitle = {Proceedings of the IADIS International Conference on Wireless Applications and Computing 2008},
  comment = {[pdf]},
  date-modified = {2021-12-06 10:45:19 +0200},
  keywords = {own, refereed, R:IOT:SC},
  month = {7},
  pages = {22--24},
  title = {{{Corfunet: A Mesh Network Providing Wireless Services at Metropolitan Level}}},
  venue = {Amsterdam, The Netherlands},
  year = {2008}}

• Xenakis, C., Ntantogian, C., & Stavrakakis, I.. (2008). A network-assisted mobile vpn for securing users data in umts. Computer communications, 31(14), 3315–3327.
  [Bibtex]

  @article{xenakis2008network,
  title={A network-assisted mobile VPN for securing users data in UMTS},
  author={Xenakis, Christos and Ntantogian, Christoforos and Stavrakakis, Ioannis},
  journal={Computer Communications},
  volume={31},
  number={14},
  pages={3315--3327},
  year={2008},
  publisher={Elsevier}
  }

• Ntantogian, C., Stavrakakis, I., & Xenakis, C.. (2008). Reducing the user authentication cost in next generation networks. Paper presented at the 2008 fifth annual conference on wireless on demand network systems and services.
  [Bibtex]

  @inproceedings{ntantogian2008reducing,
  title={Reducing the user authentication cost in next generation networks},
  author={Ntantogian, Christoforos and Stavrakakis, Ioannis and Xenakis, Christos},
  booktitle={2008 Fifth Annual Conference on Wireless on Demand Network Systems and Services},
  pages={65--72},
  year={2008},
  organization={IEEE}
  }

• Tsohou, A., Kokolakis, S., Karyda, M., & Kiountouzis, E.. (2008). Investigating information security awareness: research and practice gaps. Information security journal: a global perspective, 17(5-6), 207–227.
  [Bibtex]

  @article{tsohou2008investigating,
  title={Investigating information security awareness: research and practice gaps},
  author={Tsohou, Aggeliki and Kokolakis, Spyros and Karyda, Maria and Kiountouzis, Evangelos},
  journal={Information Security Journal: A Global Perspective},
  volume={17},
  number={5-6},
  pages={207--227},
  year={2008},
  publisher={Taylor \& Francis}
  }

• Tsohou, A., Kokolakis, S., Karyda, M., & Kiountouzis, E.. (2008). Process-variance models in information security awareness research. Information management & computer security.
  [Bibtex]

  @article{tsohou2008process,
  title={Process-variance models in information security awareness research},
  author={Tsohou, Aggeliki and Kokolakis, Spyros and Karyda, Maria and Kiountouzis, Evangelos},
  journal={Information Management \& Computer Security},
  year={2008},
  publisher={Emerald Group Publishing Limited}
  }

2007

• Magkos, E., Kotzanikolaou, P., & Douligeris, C.. (2007). Towards secure online elections: models, primitives and open issues. Electronic government, an international journal, 4(3), 249–268.
  [Bibtex]

  @article{magkos2007towards,
  title={Towards secure online elections: models, primitives and open issues},
  author={Magkos, Emmanouil and Kotzanikolaou, Panayiotis and Douligeris, Christos},
  journal={Electronic Government, an International Journal},
  volume={4},
  number={3},
  pages={249--268},
  year={2007},
  publisher={Inderscience Publishers}
  }

• Avlonitis, M., Magkos, E., Stefanidakis, M., & Chrissikopoulos, V.. (2007). A spatial stochastic model for worm propagation: scale effects. Journal in computer virology, 3(2), 87–92.
  [Bibtex]

  @article{avlonitis2007spatial,
  title={A spatial stochastic model for worm propagation: scale effects},
  author={Avlonitis, Markos and Magkos, Emmanouil and Stefanidakis, Michalis and Chrissikopoulos, Vassilis},
  journal={Journal in Computer Virology},
  volume={3},
  number={2},
  pages={87--92},
  year={2007},
  publisher={Springer-Verlag}
  }

• Avlonitis, M., Vlamos, P., & Oikonomou, K.. (2007). A space-time analytical model for energy consumption in wireless sensor networks. Paper presented at the The sixth annual mediterranean ad hoc networking workshop (med-hoc-net 2007), corfu, greece.
  [Bibtex]

  @inproceedings{avlonitis2007space,
  abstract = {Sensor network lifetime suffers from increased energy consumption especially for those nodes in close proximity to the sink node that undertake rather the role of forwarding other nodes' data packets than their own. In this paper, a space-time analytical model is proposed to characterize the energy consumed in a sensor network under a rather simple medium access control policy. The proposed analytical model is studied and analyzed in this work revealing a phase transition phenomenon as the offered traffic load increases. Simulation results presented here are in compliance with the aforementioned analytical results.},
  author = {Avlonitis, Markos and Vlamos, Panagiotis and Oikonomou, Konstantinos},
  booktitle = {The Sixth Annual Mediterranean Ad Hoc Networking Workshop (Med-Hoc-Net 2007), Corfu, Greece},
  comment = {[pdf]},
  date-modified = {2021-11-13 20:21:40 +0200},
  keywords = {own, refereed,R:ENERGY},
  title = {A Space-Time Analytical Model for Energy Consumption in Wireless Sensor Networks},
  year = {2007}}

• Laoutaris, N., Smaragdakis, G., Oikonomou, K., Stavrakakis, I., & Bestavros, A.. (2007). Distributed Placement of Service Facilities in Large-Scale Networks. Paper presented at the Ieee infocom 2007 – 26th ieee international conference on computer communications.
  [Bibtex]

  @inproceedings{laoutaris2007distributed,
  abstract = {The effectiveness of service provisioning in large-scale networks is highly dependent on the number and location of service facilities deployed at various hosts. The classical, centralized approach to determining the latter would amount to formulating and solving the uncapacitated k-median (UKM) problem (if the requested number of facilities is fixed), or the uncapacitated facility location (UFL) problem (if the number of facilities is also to be optimized). Clearly, such centralized approaches require knowledge of global topological and demand information, and thus do not scale and are not practical for large networks. The key question posed and answered in this paper is the following: ``How can we determine in a distributed and scalable manner the number and location of service facilities?'' We propose an innovative approach in which topology and demand information is limited to neighborhoods, or balls of small radius around selected facilities, whereas demand information is captured implicitly for the remaining (remote) clients outside these neighborhoods, by mapping them to clients on the edge of the neighborhood; the ball radius regulates the trade-off between scalability and performance. We develop a scalable, distributed approach that answers our key question through an iterative re-optimization of the location and the number of facilities within such balls. We show that even for small values of the radius (1 or 2), our distributed approach achieves performance under various synthetic and real Internet topologies that is comparable to that of optimal, centralized approaches requiring full topology and demand information.},
  author = {Laoutaris, Nikolaos and Smaragdakis, Georgios and Oikonomou, Konstantinos and Stavrakakis, Ioannis and Bestavros, Azer},
  booktitle = {IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications},
  date-modified = {2021-12-05 14:31:14 +0200},
  doi = {10.1109/INFCOM.2007.248},
  issn = {0743-166X},
  keywords = {own, boston, exceptional, refereed, ana, R:FL:LI},
  month = {5},
  pages = {2144-2152},
  title = {{{Distributed Placement of Service Facilities in Large-Scale Networks}}},
  venue = {Barcelona, Spain},
  year = {2007},
  Bdsk-Url-1 = {https://doi.org/10.1109/INFCOM.2007.248}}

• Oikonomou, K., & Stavrakakis, I.. (2007). Performance Analysis of Probabilistic Flooding Using Random Graphs. Paper presented at the 2007 ieee international symposium on a world of wireless, mobile and multimedia networks.
  [Bibtex]

  @inproceedings{oikonomou2007performance,
  abstract = {Probabilistic flooding (parameterized by a forwarding probability) has frequently been considered in the past, as a means of limiting the large message overhead associated with traditional (full) flooding approaches that are used to disseminate globally information in unstructured peer-to-peer and other networks. A key challenge in using probabilistic flooding is the determination of the forwarding probability so that global network outreach is achieved while keeping the message overhead as low as possible. By showing that a probabilistic flooding network generated by applying probabilistic flooding to a connected random graph network can be bounded by properly parameterized random graph networks and invoking random graph theory results, bounds on the value of the forwarding probability are derived guaranteeing global network outreach with high probability, while significantly reducing the message overhead. Bounds on the average number of messages - as well as asymptotic expressions - and on the average time required to complete network outreach are also derived, illustrating the benefits of the properly parameterized probabilistic flooding scheme.},
  author = {Oikonomou, Konstantinos and Stavrakakis, Ioannis},
  booktitle = {2007 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks},
  date-modified = {2021-12-06 10:44:35 +0200},
  doi = {10.1109/WOWMOM.2007.4351694},
  keywords = {own, refereed, ana, R:ID:PF},
  month = {6},
  pages = {1--6},
  title = {{{Performance Analysis of Probabilistic Flooding Using Random Graphs}}},
  venue = {Helsinki, Finland},
  year = {2007},
  Bdsk-Url-1 = {https://doi.org/10.1109/WOWMOM.2007.4351694}}

• Oikonomou, K., & Stavrakakis, I.. (2007). An Adaptive Time-spread Multiple-access Policy for Wireless Sensor Networks. Eurasip journal on wireless communications and networking, 2007(1), 24–24.
  [Bibtex]

  @article{oikonomou2007adaptive,
  abstract = {Sensor networks require a simple and efficient medium access control policy achieving high system throughput with no or limited control overhead in order to increase the network lifetime by minimizing the energy consumed during transmission attempts. Time-spread multiple-access (TSMA) policies that have been proposed for ad hoc network environments, can also be employed in sensor networks, since no control overhead is introduced. However, they do not take advantage of any cross-layer information in order to exploit the idiosyncrasies of the particular sensor network environment such as the presence of typically static nodes and a common destination for the forwarded data. An adaptive probabilistic TSMA-based policy, that is proposed and analyzed in this paper, exploits these idiosyncrasies and achieves higher system throughput than the existing TSMA-based policies without any need for extra control overhead. As it is analytically shown in this paper, the proposed policy always outperforms the existing TSMA-based policies, if certain parameter values are properly set; the analysis also provides for these proper values. It is also shown that the proposed policy is characterized by a certain convergence period and that high system throughput is achieved for long convergence periods. The claims and expectations of the provided analysis are supported by simulation results presented in this paper.},
  acmid = {1283644},
  address = {New York, NY, United States},
  author = {Oikonomou, Konstantinos and Stavrakakis, Ioannis},
  date-modified = {2021-12-06 10:44:30 +0200},
  doi = {10.1155/2007/64238},
  issn = {1687-1472},
  issue_date = {January 2007},
  journal = {EURASIP Journal on Wireless Communications and Networking},
  keywords = {own, refereed, R:MAC:TI},
  month = 1,
  number = {1},
  numpages = {1},
  pages = {24--24},
  publisher = {Hindawi Publishing Corp.},
  title = {{{An Adaptive Time-spread Multiple-access Policy for Wireless Sensor Networks}}},
  volume = {2007},
  year = {2007},
  Bdsk-Url-1 = {https://doi.org/10.1155/2007/64238}}

• Ntantogian, C., & Xenakis, C.. (2007). Reducing authentication traffic in 3g-wlan integrated networks. Paper presented at the 2007 ieee 18th international symposium on personal, indoor and mobile radio communications.
  [Bibtex]

  @inproceedings{ntantogian2007reducing,
  title={Reducing authentication traffic in 3G-WLAN integrated networks},
  author={Ntantogian, Christoforos and Xenakis, Christos},
  booktitle={2007 IEEE 18th International Symposium on Personal, Indoor and Mobile Radio Communications},
  pages={1--5},
  year={2007},
  organization={IEEE}
  }

• Xenakis, C., & Ntantogian, C.. (2007). Security architectures for b3g mobile networks. Telecommunication systems, 35(3), 123–139.
  [Bibtex]

  @article{xenakis2007security,
  title={Security architectures for B3G mobile networks},
  author={Xenakis, Christos and Ntantogian, Christoforos},
  journal={Telecommunication Systems},
  volume={35},
  number={3},
  pages={123--139},
  year={2007},
  publisher={Springer US}
  }

• Ntantogian, C., Xenakis, C., & Stavrakakis, I.. (2007). Efficient authentication for users autonomy in next generation all-ip networks. Paper presented at the 2007 2nd bio-inspired models of network, information and computing systems.
  [Bibtex]

  @inproceedings{ntantogian2007efficient,
  title={Efficient authentication for users autonomy in next generation all-ip networks},
  author={Ntantogian, Christoforos and Xenakis, Christos and Stavrakakis, Ioannis},
  booktitle={2007 2nd Bio-Inspired Models of Network, Information and Computing Systems},
  pages={295--300},
  year={2007},
  organization={IEEE}
  }

• Ntantogian, C., & Xenakis, C.. (2007). A security binding for efficient authentication in 3g-wlan heterogeneous networks. Paper presented at the Phd poster presented in the 6th annual mediterranean ad hoc networking workshop (med-hoc-net 2007), corfu, greece.
  [Bibtex]

  @inproceedings{ntantogian2007security,
  title={A Security Binding for Efficient Authentication in 3G-WLAN Heterogeneous Networks},
  author={Ntantogian, Christoforos and Xenakis, Christos},
  booktitle={PhD poster presented in the 6th Annual Mediterranean Ad Hoc Networking Workshop (Med-Hoc-Net 2007), Corfu, Greece},
  year={2007}
  }

• Ntantogian, C., & Xenakis, C.. (2007). A security protocol for mutual authentication and mobile vpn deployment in b3g networks. Paper presented at the 2007 ieee 18th international symposium on personal, indoor and mobile radio communications.
  [Bibtex]

  @inproceedings{ntantogian2007security,
  title={A security protocol for mutual authentication and mobile VPN deployment in B3G networks},
  author={Ntantogian, Christoforos and Xenakis, Christos},
  booktitle={2007 IEEE 18th International Symposium on Personal, Indoor and Mobile Radio Communications},
  pages={1--5},
  year={2007},
  organization={IEEE}
  }

• Tsohou, A., Theoharidou, M., Kokolakis, S., & Gritzalis, D.. (2007). Addressing cultural dissimilarity in the information security management outsourcing relationship. Paper presented at the International conference on trust, privacy and security in digital business.
  [Bibtex]

  @inproceedings{tsohou2007addressing,
  title={Addressing cultural dissimilarity in the information security management outsourcing relationship},
  author={Tsohou, Aggeliki and Theoharidou, Marianthi and Kokolakis, Spyros and Gritzalis, Dimitris},
  booktitle={International Conference on Trust, Privacy and Security in Digital Business},
  pages={24--33},
  year={2007},
  organization={Springer, Berlin, Heidelberg}
  }

• Tsohou, A., Theoharidou, M., Kokolakis, S., & Gritzalis, D.. (2007). Session 1-secure and trusted virtual organisations-addressing cultural dissimilarity in the information security management outsourcing relationship. Lecture notes in computer science, 4657, 24–33.
  [Bibtex]

  @article{tsohou2007session,
  title={Session 1-Secure and Trusted Virtual Organisations-Addressing Cultural Dissimilarity in the Information Security Management Outsourcing Relationship},
  author={Tsohou, Aggeliki and Theoharidou, Marianthi and Kokolakis, Spyros and Gritzalis, Dimitris},
  journal={Lecture Notes in Computer Science},
  volume={4657},
  pages={24--33},
  year={2007},
  publisher={Berlin: Springer-Verlag, 1973-}
  }

2006

• Stathopoulos, V., Kotzanikolaou, P., & Magkos, E.. (2006). A framework for secure and verifiable logging in public communication networks. Paper presented at the Critis’06 – 1st international workshop on critical information infrastructures security.
  [Bibtex]

  @inproceedings{stathopoulos2006framework,
  title={A framework for secure and verifiable logging in public communication networks},
  author={Stathopoulos, Vassilios and Kotzanikolaou, Panayiotis and Magkos, Emmanouil},
  booktitle={CRITIS'06 - 1st International Workshop on Critical Information Infrastructures Security},
  pages={273--284},
  year={2006},
  organization={Springer LNCS 434}
  }

• Magkos, E., Kotzanikolaou, P., Vergados, D. D., & Stefanidakis, M.. (2006). An asymmetric key establishment protocol for multiphase self-organized sensor networks. Paper presented at the 12th european wireless conference – enabling technologies for wireless multimedia communications (ew 2006).
  [Bibtex]

  @inproceedings{magkos2006asymmetric,
  title={An asymmetric key establishment protocol for multiphase self-organized sensor networks},
  author={Magkos, Emmanouil and Kotzanikolaou, Panayiotis and Vergados, Dimitris D and Stefanidakis, Michalis},
  booktitle={12th European Wireless Conference - Enabling Technologies for Wireless Multimedia Communications (EW 2006)},
  pages={1--6},
  year={2006},
  organization={IEEE}
  }

• Oikonomou, K., & Stavrakakis, I.. (2006). Scalable Service Migration: The Tree Topology Case. Paper presented at the 5th annual mediterranean ad hoc networking workshop.
  [Bibtex]

  @inproceedings{oikonomou2006scalable,
  abstract = {Scalable service placement is a challenging problem in dynamic environments such as ad hoc or autonomic networks. Existing approaches typically consider static and reduced size networking environments and try to determine the optimal service position (the node at which some cost is minimized) by solving the 1- median problem. Since such approaches are complex and are based on global information knowledge, they are non- scalable and cannot cope with dynamic environments. A more reasonable approach to service placement for large, ad hoc and autonomic environments would be through service migration. That is, instead of solving continuously a large optimization problem requiring global information, consider policies for moving the service position (one hop/node at a time) based on local information, towards more effective positions. Developing service migration policies with good properties is a major challenge, since such policies may be sub-optimal (that is, they never converge to the optimal position), follow a non-monotonically cost decreasing path to the optimal position, etc.
  In this paper, the aforementioned issues are discussed and a simple service migration policy is proposed for undirected tree topologies. For this case it is shown analytically that the information available at the current service node only is sufficient for determining the direction towards nodes with monotonically decreasing service provision costs. Consequently, the proposed policy moves the service continuously towards the optimal position in every step and reaches the optimal position through a shortest path migration trajectory. As the optimal position may change in a dynamic environment, the proposed policy adapts the service migration path continuously towards the currently optimal position. Although some of the main results are also applicable to general network topologies, future work will focus on the general network topology by borrowing ideas from the current work.},
  author = {Oikonomou, Konstantinos and Stavrakakis, Ioannis},
  booktitle = {5th Annual Mediterranean Ad Hoc Networking Workshop},
  comment = {[pdf]},
  date-modified = {2021-11-13 13:53:18 +0200},
  keywords = {own, refereed, ana, R:FL:SL},
  title = {{{Scalable Service Migration: The Tree Topology Case}}},
  venue = {Lipari, Italy},
  year = {2006}}

• Vaios, A., Oikonomou, K., & Stavrakakis, I.. (2006). Analysis of a Topology Control Paradigm in WLAN/WPAN Environments. Computer communications, 29(11), 2096–2108.
  [Bibtex]

  @article{vaios2006analysis,
  abstract = {The coordinated coexistence of WLANs and WPANs in a dual-mode network is a recently introduced idea and is expected to increase the overall system performance by allowing for the efficient cooperation of both WLANs and WPANs. Topology control (e.g., power control, smart antennas, and different frequency channels) needs to be employed to allow for the simultaneous operation of both modes. In this paper, different frequency channels that allow for high data rates within a small transmission range are considered in order to create multiple WPAN environments inside a WLAN cell. The latter environment requires the support of a second mode of operation which introduces additional overhead that may degrade the overall system performance. Certain conditions, under which system performance improvement is achievable, are established here. In particular, an analytical mobility model for WPAN environments is proposed and employed in the analytical studies. It is shown that the system may be effective when node mobility is low and the traffic load among nodes is high. The corresponding upper and lower bounds on mobility and traffic are also analytically derived. Simulation results for a variety of scenarios support the claims and expectations of the aforementioned analysis and demonstrate that performance improvement is possible when WLANs and WPANs coexist and cooperate in a network.},
  author = {Vaios, Athanasios and Oikonomou, Konstantinos and Stavrakakis, Ioannis},
  date-modified = {2021-11-13 13:41:36 +0200},
  doi = {10.1016/j.comcom.2006.01.006},
  issn = {0140-3664},
  journal = {Computer Communications},
  keywords = {own, refereed, broadway, R:MAC:DO},
  number = {11},
  pages = {2096--2108},
  publisher = {Elsevier},
  title = {{{Analysis of a Topology Control Paradigm in WLAN/WPAN Environments}}},
  volume = {29},
  year = {2006},
  Bdsk-Url-1 = {https://doi.org/10.1016/j.comcom.2006.01.006}}

• Oikonomou, K., & Stavrakakis, I.. (2006). Energy Considerations for Topology-Unaware TDMA MAC Protocols. Ad hoc networks, 4(3), 359–379.
  [Bibtex]

  @article{oikonomou2006energy,
  abstract = {Since the energy budget of mobile nodes is limited, the performance of a networking protocol for such users should be evaluated in terms of its energy efficiency, in addition to the more traditional metrics such as throughput. In this paper, two topology-unaware MAC protocols---in which the scheduling time slots are allocated irrespectively of the underline topology---are considered and their energy consumption is derived. It turns out that the per frame power consumption is lower for the less throughput-efficient protocol, suggesting that energy savings are achieved at the expense of throughput. A finer energy consumption study is carried out in the sequel, focusing on the amount of energy consumed to successfully transmit a certain number of packets, or equivalently, on the per successful transmission power consumption. It is shown that the more throughput-efficient protocol consumes less energy per successful transmission under certain conditions (which are derived), due to the lower number of transmission attempts before a data packet is successfully transmitted. The same energy-efficiency relation is observed under certain conditions (which are derived) when data packets are delay constrained and, thus, may become obsolete if not transmitted successfully within a specific time interval. The conditions under which the per successful transmission power consumption is minimized for delay-constrained packets, are also established in this work and it is observed that when the system throughput is maximized, the power consumed is close to the minimum. Simulation results support the claims and the expectations of the aforementioned analysis.},
  author = {Oikonomou, Konstantinos and Stavrakakis, Ioannis},
  date-modified = {2021-11-13 20:21:59 +0200},
  doi = {10.1016/j.adhoc.2004.10.003},
  issn = {1570-8705},
  journal = {Ad Hoc Networks},
  keywords = {own, exceptional, refereed, broadway, R:MAC:TI,R:ENERGY},
  number = {3},
  pages = {359--379},
  publisher = {Elsevier},
  title = {{{Energy Considerations for Topology-Unaware TDMA MAC Protocols}}},
  volume = {4},
  year = {2006},
  Bdsk-Url-1 = {https://doi.org/10.1016/j.adhoc.2004.10.003}}

• Ntantogian, C., Xenakis, C., & Merakos, L.. (2006). An enhanced eap-sim authentication scheme for securing wlan. 15th ist mobile & wireless communications, mykonos, greece.
  [Bibtex]

  @article{ntantogian2006enhanced,
  title={An enhanced EAP-SIM authentication scheme for securing WLAN},
  author={Ntantogian, Christoforos and Xenakis, Christos and Merakos, Lazaros},
  journal={15th IST Mobile \& Wireless Communications, Mykonos, Greece},
  year={2006}
  }

• Tsohou, A., Karyda, M., Kokolakis, S., & Kiountouzis, E.. (2006). Formulating information systems risk management strategies through cultural theory. Information management & computer security.
  [Bibtex]

  @article{tsohou2006formulating,
  title={Formulating information systems risk management strategies through cultural theory},
  author={Tsohou, Aggeliki and Karyda, Maria and Kokolakis, Spyros and Kiountouzis, Evangelos},
  journal={Information Management \& Computer Security},
  year={2006},
  publisher={Emerald Group Publishing Limited}
  }

2005

• Kotzanikolaou, P., & Magkos, E.. (2005). Hybrid key establishment for multiphase self-organized sensor networks. Paper presented at the Sixth ieee international symposium on a world of wireless mobile and multimedia networks (wowmom 2005), 2005.
  [Bibtex]

  @inproceedings{kotzanikolaou2005hybrid,
  title={Hybrid key establishment for multiphase self-organized sensor networks},
  author={Kotzanikolaou, Panayiotis and Magkos, Emmanouil},
  booktitle={Sixth IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks (WoWMoM 2005), 2005},
  pages={581--587},
  year={2005},
  organization={IEEE}
  }

• Oikonomou, K., Pronios, N., & Stavrakakis, I.. (2005). Performance Analysis of Topology-Unaware TDMA MAC Schemes for Ad Hoc Networks With Topology Control. Computer communications, 28(3), 313–324.
  [Bibtex]

  @article{oikonomou2005performance,
  abstract = {Traditional omni-directional antennas result in increased mutliuser interference and are known to limit the performance of Medium Access Control (MAC) protocols for ad hoc networks. Topology control is the capability of a node to control the set of neighbor nodes. In this paper, the impact of using smart antennas and/or power control for topology control is investigated and the performance of TDMA MAC schemes with common frame, for which the assignment of time slots to a node is not aware of the time slots assigned to the neighbor nodes (topology-unaware), is studied. A comparison based on analytical models reveals the advantages of topology control, as well as its dependence on the mobility of the nodes and its resolution. Simulation results support the claims and the expectations of the analysis and show how the performance under topology control can be increased and how mobility affects it.},
  author = {Oikonomou, Konstantinos and Pronios, Nikos and Stavrakakis, Ioannis},
  date-modified = {2021-11-13 12:52:14 +0200},
  doi = {10.1016/j.comcom.2004.10.004},
  issn = {0140-3664},
  journal = {Computer Communications},
  keywords = {own, refereed, broadway, R:MAC:TI},
  number = {3},
  pages = {313--324},
  publisher = {Elsevier},
  title = {{{Performance Analysis of Topology-Unaware TDMA MAC Schemes for Ad Hoc Networks With Topology Control}}},
  volume = {28},
  year = {2005},
  Bdsk-Url-1 = {https://doi.org/10.1016/j.comcom.2004.10.004}}

• Vaios, A., Oikonomou, K., Zinelis, N., & Stavrakakis, I.. (2005). Increasing Capacity in Dual-Band WLANs Through Ad-Hoc Networking. International journal of wireless and mobile computing (ijwmc), special issue on wireless ad hoc networking.
  [Bibtex]

  @article{vaios2005increasing,
  abstract = {The ad-hoc networking paradigm -- originally conceived to cope with infrastructureless military and emergency situations -- is also being considered to support the ever-evolving user requirements for higher data rates and enhance the capabilities of traditional networks. The Centralized Ad-Hoc Network Architecture (CANA) proposed in this article aims at increasing substantially the capacity of traditional Wireless Local Area Networks (WLANs). It is based on a dual frequency system in which the operation in the original WLAN frequency supports the centralization of some of the traditionally distributed and problematic ad- hoc functionalities enabled at the new frequency; higher- rate, shorter-range, peer-to-peer and multi-hop transmissions are possible at the new frequency, resulting in a significant increase of the WLAN capacity. In order to take advantage of the extra capacity, modifications are defined and described by exploring the HiperLAN/2 standard. The gain of the induced dual mode of operation depends on several parameters that define the performance of CANA. This article explores the performance issues that CANA arises by providing both analytical and simulation results. The overhead of CANA is rather low if one takes into account the profits of such architecture.},
  author = {Vaios, Athanasios and Oikonomou, Konstantinos and Zinelis, Nikolaos and Stavrakakis, Ioannis},
  comment = {[pdf]},
  date-modified = {2021-11-13 13:41:24 +0200},
  journal = {International Journal of Wireless and Mobile Computing (IJWMC), Special Issue on Wireless Ad Hoc Networking},
  keywords = {own, refereed, broadway, R:MAC:DO},
  title = {{{Increasing Capacity in Dual-Band WLANs Through Ad-Hoc Networking}}},
  year = {2005}}

• Oikonomou, K., & Stavrakakis, I.. (2005). Analysis of Topology-Unaware TDMA MAC Policies for Ad-Hoc Networks Under Diverse Traffic Loads. Sigmobile mob. comput. commun. rev., 9(4), 25–38.
  [Bibtex]

  @article{oikonomou2005analysis,
  abstract = {The ever-changing nature of the ad-hoc networks, makes the design of efficient Medium Access Control (MAC) policies challenging. Topology-unaware MAC policies, that allocate slots deterministically or probabilistically have been proposed in the past and evaluated under heavy traffic assumptions. In this paper, the heavy traffic assumption is relaxed and the system throughput achieved by these policies is derived as a function of the traffic load. The presented analysis establishes the conditions and determines the values of the access probability for which the system throughput under the probabilistic policy is not only higher than that under the deterministic policy but it is also close to the maximum achievable, provided that the traffic load and the topology density of the network are known. In case the traffic load and/or the topology density are not known (which is commonly the case in ad-hoc networks), alternative values for the access probability are also derived which, although not the optimal (maximizing the system throughput), they do lead to a system throughput higher than that under the Deterministic Policy. Simulation results for a variety of topologies with different characteristics support the claims and the expectations of the analysis and show the comparative advantage of the Probabilistic Policy over the Deterministic Policy.},
  acmid = {1096171},
  address = {New York, NY, USA},
  author = {Oikonomou, Konstantinos and Stavrakakis, Ioannis},
  date-modified = {2021-12-06 10:44:13 +0200},
  doi = {10.1145/1096166.1096171},
  issn = {1559-1662},
  issue_date = {October 2005},
  journal = {SIGMOBILE Mob. Comput. Commun. Rev.},
  keywords = {own, refereed, harmonics, R:MAC:TI},
  month = 10,
  number = {4},
  numpages = {14},
  pages = {25--38},
  publisher = {ACM},
  title = {{{Analysis of Topology-Unaware TDMA MAC Policies for Ad-Hoc Networks Under Diverse Traffic Loads}}},
  volume = {9},
  year = {2005},
  Bdsk-Url-1 = {https://doi.org/10.1145/1096166.1096171}}

• Oikonomou, K., & Stavrakakis, I.. (2005). Power Efficiency Analysis for Topology-Unaware TDMA MAC Policies in Ad-Hoc Networks. Paper presented at the Proceedings of the 38th annual hawaii international conference on system sciences (hicss 2005).
  [Bibtex]

  @inproceedings{oikonomou2005power,
  abstract = {Medium Access Control (MAC) policies, in which the scheduling time slots are allocated irrespectively of the underline topology (topology-unaware), are suitable for ad-hoc networks, where nodes can enter, leave or move inside the network at any time. Such topology-unaware MAC policies have been proposed in the past and it has been shown that under certain conditions the system throughput achieved under the Probabilistic Policy is higher than that achieved under the Deterministic Policy. However, as it is shown in this paper, the power consumption under the Probabilistic Policy is higher than that under the Deterministic Policy on a per frame basis. On the other hand, the power consumed per successful transmission is possible to be smaller under the Probabilistic Policy under certain conditions that are established here. For delay constrained packets, the power consumed per successful transmission may be higher when accounting for the wasted power previously consumed by obsolete packets. The conditions under which the power consumed per successful transmission of delay constrained packets under the Probabilistic Policy is smaller than that under the Deterministic Policy, are also established in this work. It is shown analytically that when the system throughput is maximized, the power consumed is close to the minimum. Simulation results support the claims and the expectations of the aforementioned analysis.},
  author = {Oikonomou, Konstantinos and Stavrakakis, Ioannis},
  booktitle = {Proceedings of the 38th Annual Hawaii International Conference on System Sciences (HICSS 2005)},
  date-modified = {2021-12-06 10:44:19 +0200},
  doi = {10.1109/HICSS.2005.498},
  issn = {1530-1605},
  keywords = {own, exceptional, refereed, harmonics,R:ENERGY},
  month = {1},
  pages = {287b--287b},
  title = {{{Power Efficiency Analysis for Topology-Unaware TDMA MAC Policies in Ad-Hoc Networks}}},
  venue = {Big Island, Hawaii},
  year = {2005},
  Bdsk-Url-1 = {https://doi.org/10.1109/HICSS.2005.498}}

• Oikonomou, K., & Stavrakakis, I.. (2005). Throughput Analysis of an Aloha-Based MAC Policy for Ad Hoc Networks. Paper presented at the Challenges in ad hoc networking: fourth annual mediterranean ad hoc networking workshop, june 21–24, 2005.
  [Bibtex]

  @inproceedings{oikonomou2005throughput,
  abstract = {Re-use of existing widely explored Medium Access Control (MAC) schemes, like the well-known Aloha scheme, is not applicable in ad hoc networks where the transmissions of the users can be normally sensed by only a fraction of the users present in the network. Therefore, estimations of the network traffic load are not possible anymore. Here, an adaptive probabilistic policy for medium access control in ad hoc networks, inspired by the Aloha paradigm, is proposed and analyzed. Simulation results show that this policy is capable of achieving higher system throughput when compared to other policies that have been proposed for ad hoc networks. It is also shown that mobility severely impacts the system throughput and therefore, an alternative approach is proposed that reduces the effects of mobility in the expense of the maximum achievable system throughput.},
  author = {Oikonomou, Konstantinos and Stavrakakis, Ioannis},
  booktitle = {Challenges in Ad Hoc Networking: Fourth Annual Mediterranean Ad Hoc Networking Workshop, June 21--24, 2005},
  date-modified = {2021-12-06 10:44:24 +0200},
  doi = {10.1007/0-387-31173-4_24},
  isbn = {978-0-387-31173-9},
  keywords = {own, refereed, broadway, R:MAC:TI},
  month = {6},
  pages = {219--223},
  publisher = {Springer},
  title = {{{Throughput Analysis of an Aloha-Based MAC Policy for Ad Hoc Networks}}},
  venue = {{\^I}le de Porquerolles, France},
  year = {2005},
  Bdsk-Url-1 = {https://doi.org/10.1007/0-387-31173-4_24}}

• Christopoulou, E., & Kameas, A.. (2005). Gas ontology: an ontology for collaboration among ubiquitous computing devices. International journal of human-computer studies, 62(5), 664–685.
  [Bibtex]

  @article{christopoulou2005gas,
  title={GAS Ontology: an ontology for collaboration among ubiquitous computing devices},
  author={Christopoulou, Eleni and Kameas, Achilles},
  journal={International Journal of Human-Computer Studies},
  volume={62},
  number={5},
  pages={664--685},
  year={2005},
  publisher={Academic Press}
  }

• Christopoulou, E., Goumopoulos, C., & Kameas, A.. (2005). An ontology-based context management and reasoning process for ubicomp applications. Paper presented at the Proceedings of the 2005 joint conference on smart objects and ambient intelligence: innovative context-aware services: usages and technologies.
  [Bibtex]

  @inproceedings{christopoulou2005ontology,
  title={An ontology-based context management and reasoning process for UbiComp applications},
  author={Christopoulou, Eleni and Goumopoulos, Christos and Kameas, Achilles},
  booktitle={Proceedings of the 2005 joint conference on Smart objects and ambient intelligence: innovative context-aware services: usages and technologies},
  pages={265--270},
  year={2005}
  }

• Drosos, N., Christopoulou, E., & Kameas, A.. (2005). Middleware for building ubiquitous computing applications using distributed objects. Paper presented at the Panhellenic conference on informatics.
  [Bibtex]

  @inproceedings{drosos2005middleware,
  title={Middleware for building ubiquitous computing applications using distributed objects},
  author={Drosos, Nicolas and Christopoulou, Eleni and Kameas, Achilles},
  booktitle={Panhellenic Conference on Informatics},
  pages={256--266},
  year={2005},
  organization={Springer, Berlin, Heidelberg}
  }

2004

• Burmester, M., Magkos, E., & Chrissikopoulos, V.. (2004). Uncoercible e-bidding games. Electronic commerce research, 4(1), 113–125.
  [Bibtex]

  @article{burmester2004uncoercible,
  title={Uncoercible e-bidding games},
  author={Burmester, Mike and Magkos, Emmanouil and Chrissikopoulos, Vassilios},
  journal={Electronic Commerce Research},
  volume={4},
  number={1},
  pages={113--125},
  year={2004},
  publisher={Kluwer Academic Publishers}
  }

• Oikonomou, K., & Stavrakakis, I.. (2004). Analysis of a Probabilistic Topology-Unaware TDMA MAC Policy for Ad Hoc Networks. Ieee journal on selected areas in communications, 22(7), 1286–1300.
  [Bibtex]

  @article{oikonomou2004analysis,
  abstract = {The design of an efficient medium access control (MAC) for ad hoc networks is challenging. Topology-unaware time-division multiple-access-based schemes, suitable for ad hoc networks, that guarantee a minimum throughput, have already been proposed. These schemes consider a deterministic policy for the utilization of the assigned scheduling time slots that never utilizes nonassigned slots although in such slots collision-free transmissions are possible even under heavy traffic conditions. A simple probabilistic policy, capable of utilizing the nonassigned slots according to an access probability, fixed for all users in the network, is introduced and analyzed here. The conditions under which the system throughput under the probabilistic policy is higher than that under the deterministic policy are derived analytically. Further analysis of the system throughput is shown to be difficult or impossible for the general case and certain approximations have been considered whose accuracy is also investigated. The approximate analysis determines the value for the access probability that maximizes the system throughput, as well as simplified lower and upper bounds that depend only on a topology density metric. Simulation results demonstrate the comparative advantage of the probabilistic policy over the deterministic policy and show that the approximate analysis successfully determines the range of values for the access probability for which the system throughput under the probabilistic policy is not only higher than that under the deterministic policy, but it is also close to the maximum.},
  author = {Oikonomou, Konstantinos and Stavrakakis, Ioannis},
  date-modified = {2021-11-17 15:15:34 +0200},
  doi = {10.1109/JSAC.2004.829345},
  issn = {0733-8716},
  journal = {IEEE Journal on Selected Areas in Communications},
  keywords = {own, exceptional, refereed, harmonics, R:MAC:TI, R:IOT:VE},
  month = {9},
  number = {7},
  pages = {1286--1300},
  title = {{{Analysis of a Probabilistic Topology-Unaware TDMA MAC Policy for Ad Hoc Networks}}},
  volume = {22},
  year = {2004},
  Bdsk-Url-1 = {https://doi.org/10.1109/JSAC.2004.829345}}

• Oikonomou, K., & Stavrakakis, I.. (2004). Load Analysis of Topology-Unaware TDMA MAC Policies for Ad Hoc Networks. Paper presented at the Quality of service in the emerging networking panorama.
  [Bibtex]

  @inproceedings{oikonomou2004load,
  abstract = {Medium Access Control (MAC) policies in which the scheduling time slots are allocated irrespectively of the underline topology are suitable for ad-hoc networks, where nodes can enter, leave or move inside the network at any time. Topology-unaware MAC policies, that allocate slots deterministically or probabilistically have been proposed in the past and evaluated under heavy traffic assumptions. In this paper, the heavy traffic assumption is relaxed and the system throughput achieved by these policies is derived as a function of the traffic load. The presented analysis establishes the conditions and determines the values of the access probability for which the system throughput under the probabilistic policy is not only higher than that under the deterministic policy but it is also close to the maximum achievable, provided that the traffic load and the topology density of the network are known. In case the traffic load and/or the topology density are not known (which is commonly the case in ad-hoc networks), alternative values for the access probability are also derived which, although not the optimal (maximizing the system throughput), they do lead to a system throughput higher than that under the Deterministic Policy. Simulation results for a variety of topologies with different characteristics support the claims and the expectations of the analysis and show the comparative advantage of the Probabilistic Policy over the Deterministic Policy.},
  author = {Oikonomou, Konstantinos and Stavrakakis, Ioannis},
  booktitle = {Quality of Service in the Emerging Networking Panorama},
  comment = {[pdf]},
  date-modified = {2021-12-06 10:43:53 +0200},
  keywords = {own, refereed, harmonics, R:MAC:TI},
  month = {9},
  pages = {84--93},
  publisher = {Springer},
  title = {{{Load Analysis of Topology-Unaware TDMA MAC Policies for Ad Hoc Networks}}},
  venue = {Barcelona, Spain},
  year = {2004}}

• Oikonomou, K., Pronios, N., & Stavrakakis, I.. (2004). Performance Analysis of TDMA MAC Schemes for Ad-Hoc Networks With Topology Control. Paper presented at the The third annual mediterranean ad hoc networking workshop (med-hoc-net 2004).
  [Bibtex]

  @inproceedings{oikonomou2004performance,
  abstract = {Traditional omni-directional antennas result in increased mutliuser interference and are known to limit the performance of Medium Access Control (MAC) protocols for ad-hoc networks. Topology control is the capability of a node to control the set of neighbor nodes and in this paper, the impact of using smart antennas and/or power control for topology control is investigated. The performance of TDMA MAC schemes with common frame for which the assignment of time slots to a node is not aware of the time slots assigned to the neighbor nodes (topology-unaware schemes like the Deterministic Policy and the Probabilistic Policy), is studied as well. A comparison based on analytical models reveals the advantages of topology control, as well as its dependence on the mobility of the nodes and its resolution. It is shown that topology control with ``high resolution'' in highly mobile environments may not be effective and conditions are established under which topology control is beneficial. Simulation results for a variety of network topologies support the claims and the expectations of the aforementioned analysis and show that the system throughput achieved under topology control can be higher under both policies and especially under the Probabilistic Policy. Simulation results also show how mobility affects system throughput and that topology control may not be suitable for highly mobile environments.},
  author = {Oikonomou, Konstantinos and Pronios, Nikos and Stavrakakis, Ioannis},
  booktitle = {The Third Annual Mediterranean Ad Hoc Networking Workshop (Med-Hoc-Net 2004)},
  comment = {[pdf]},
  date-modified = {2021-12-06 10:43:59 +0200},
  keywords = {own, refereed, harmonics, R:MAC:TI},
  month = {6},
  title = {{{Performance Analysis of TDMA MAC Schemes for Ad-Hoc Networks With Topology Control}}},
  venue = {Bodrum, Turkey},
  year = {2004}}

• Vaios, A., Oikonomou, K., Zinelis, N., Ntagkounakis, K., & Stavrakakis, I.. (2004). On Supporting Dual-Mode HiperLAN/2: Architecture and Overhead. Paper presented at the 13th ist mobile & wireless communications summit.
  [Bibtex]

  @inproceedings{vaios2004supporting,
  abstract = {The IST BroadWay project, [1], introduces the ad-hoc networking paradigm in the traditional 5 GHz HiperLAN/2. The ad-hoc networking paradigm is employed at the 60 GHz frequency band, which allows for a high transmission rate communication. The dual mode of operation primarily aims at offloading the 5 GHz HiperLAN/2 cell in very dense urban deployments (high traffic needs and number of users), while the peculiarities of the BroadWay environment induce modifications on the existing HiperLAN/2 system and make the development of a routing scheme a rather challenging task. The Centralized Ad-hoc Network Architecture (CANA) is an efficient way to support dual mode systems, [2], by implementing specific changes and algorithms in the standard HiperLAN/2 protocol stack. In this paper, the new enhanced protocol stack of dual-mode HiperLAN/2 is presented as well as the algorithms required for the efficient utilization of the system resources. Simulations provide insight into the performance issues regarding the dual mode of operation and the parameters that affect the efficiency of the described network model.},
  author = {Vaios, Athanasios and Oikonomou, Konstantinos and Zinelis, Nikolaos and Ntagkounakis, Konstantinos and Stavrakakis, Ioannis},
  booktitle = {13th IST Mobile \& Wireless Communications Summit},
  comment = {[pdf]},
  date-modified = {2021-12-06 10:46:44 +0200},
  keywords = {own, refereed, broadway, R:MAC:DO},
  month = {6},
  pages = {27--30},
  title = {{{On Supporting Dual-Mode HiperLAN/2: Architecture and Overhead}}},
  venue = {Lyon, France},
  year = {2004}}

• Oikonomou, K., Ntagkounakis, K., Vaios, A., Zinelis, N., & Stavrakakis, I.. (2004). Layered Architecture and Modules of CANA Supporting Dual Mode HiperLAN/2. Paper presented at the International workshop on wireless ad-hoc networks, 2004..
  [Bibtex]

  @inproceedings{oikonomou2004layered,
  abstract = {The centralized ad-hoc network architecture (CANA) is an efficient way to support dual mode systems, [Oikonomou, K, et al., Sept. 2003]. A dual mode of operation has been introduced in the traditional 5 GHz HiperLAN/2 to allow data off-loading by using resources of an ad-hoc network created at 60 GHz (the dual mode concept was introduced by the IST BroadWay project, IST-2001-32686). The off-loading is possible using CANA but certain changes in the standard HiperLAN/2 protocol stack are required and certain algorithms need to be incorporated. In this paper, the new enhanced protocol stack of HiperLAN/2 that supports CANA is presented as well as key algorithms that need to be developed and whose performance is crucial for the efficient utilization of the system resources. These algorithms can also be implemented for any other WLAN in order to support a second mode of operation. Simulations shed light into the trade-offs induced by the dual mode of operation and the way the network resources may efficiently be utilized under certain conditions.},
  author = {Oikonomou, Konstantinos and Ntagkounakis, Konstantinos and Vaios, Athanasios and Zinelis, Nikolaos and Stavrakakis, Ioannis},
  booktitle = {International Workshop on Wireless Ad-Hoc Networks, 2004.},
  date-modified = {2021-12-06 10:43:48 +0200},
  doi = {10.1109/IWWAN.2004.1525564},
  keywords = {own, refereed, broadway, R:MAC:DO},
  month = {5},
  pages = {172--176},
  title = {{{Layered Architecture and Modules of CANA Supporting Dual Mode HiperLAN/2}}},
  venue = {Oulu, Finland},
  year = {2004},
  Bdsk-Url-1 = {https://doi.org/10.1109/IWWAN.2004.1525564}}

• Vaios, A., Oikonornou, K., Pellati, P., Simoens, S., & Stavrakakis, I.. (2004). A Dual-Band HiperLAN/2-Based Architecture for Indoor Hotspot Applications. Paper presented at the International workshop on wireless ad-hoc networks, 2004..
  [Bibtex]

  @inproceedings{vaios2004dual,
  abstract = {The 1ST BroadWay project, [M. de Courville et al., June 2002], introduces the ad-hoc networking paradigm in the traditional 5 GHz HiperLAN/2. The ad-hoc networking paradigm is employed at the 60 GHz frequency band, which allows for a high transmission rate communication. The dual mode of operation primarily aims at offloading the 5 GHz HiperLAN/2 cell in very dense urban deployments (high traffic needs and number of users), while the peculiarities of the BroadWay system induce modifications on the existing HiperLAN/2 system and make the development of a routing scheme a rather challenging task. The centralized ad-hoc network architecture (CANA) is described as a means to efficiently support multimedia applications that require very high bit rates in low mobility environments; several ad-hoc specific functionalities are included such as neighborhood discovery, clustering and route selection. BroadWay introduces modifications to the MAC of HiperLAN/2 regarding new messages and framing considerations at both frequency bands to cater for the new requirements imposed by the dual mode of operation.},
  author = {Vaios, Athanasios and Oikonornou, K and Pellati, Pietro and Simoens, Sebastien and Stavrakakis, Ioannis},
  booktitle = {International Workshop on Wireless Ad-Hoc Networks, 2004.},
  date-modified = {2021-12-06 10:46:38 +0200},
  doi = {10.1109/IWWAN.2004.1525532},
  keywords = {own, refereed, broadway, R:MAC:DO},
  month = {5},
  pages = {6--10},
  title = {{{A Dual-Band HiperLAN/2-Based Architecture for Indoor Hotspot Applications}}},
  venue = {Oulu, Finland},
  year = {2004},
  Bdsk-Url-1 = {https://doi.org/10.1109/IWWAN.2004.1525532}}

• Oikonomou, K., & Pronios, N.. (2004). Transient Behavior of an Ad-Hoc Network Architecture Supporting an Enhanced Dual Mode HiperLAN/2 System. Paper presented at the International workshop on wireless ad-hoc networks, 2004..
  [Bibtex]

  @inproceedings{oikonomou2004transient,
  abstract = {Ad-hoc networks, where a node may enter, leave or move inside the network without any need for prior configuration, make the design of a suitable network architecture challenging. We consider as ``network architecture'' the behavioral model describing with logical consistency the rules determining the physical (or for other cases the network) connectivity. A network architecture is considered to be suitable if the performance metrics reveal such a network behavior or system performance that certain applications can be supported. While most of the research work focuses upon the steady state performance metrics, the transient performance metrics have not received the deserved attention. The primary focus of this work is on the transient behavior of an enhanced HiperLAN/2-based network that employs a dual mode of operation: the standard mode at 5 GHz and a second ad-hoc mode at 60 GHz. The centralized ad-hoc network architecture (CANA) describes the rules concerning the physical connectivity for this dual mode of operation. The values of the transient performance metrics are calculated here, and a qualitative evaluation process reveals the overhead required for the network's efficient operation.},
  author = {Oikonomou, Konstantinos and Pronios, Nikos},
  booktitle = {International Workshop on Wireless Ad-Hoc Networks, 2004.},
  date-modified = {2021-12-06 10:44:04 +0200},
  doi = {10.1109/IWWAN.2004.1525533},
  keywords = {own, refereed, R:MAC:DO},
  month = {5},
  pages = {11--15},
  title = {{{Transient Behavior of an Ad-Hoc Network Architecture Supporting an Enhanced Dual Mode HiperLAN/2 System}}},
  venue = {Oulu, Finland},
  year = {2004},
  Bdsk-Url-1 = {https://doi.org/10.1109/IWWAN.2004.1525533}}

• Christopoulou, E., Goumopoulos, C., Zaharakis, I., & Kameas, A.. (2004). An ontology-based conceptual model for composing context-aware applications. Research academic computer technology institute.
  [Bibtex]

  @article{christopoulou2004ontology,
  title={An ontology-based conceptual model for composing context-aware applications},
  author={Christopoulou, Eleni and Goumopoulos, Christos and Zaharakis, Ioannis and Kameas, Achilles},
  journal={Research Academic Computer Technology Institute},
  year={2004},
  publisher={Citeseer}
  }

• Goumopoulos, C., Christopoulou, E., Drossos, N., & Kameas, A.. (2004). The plants system: enabling mixed societies of communicating plants and artefacts. Paper presented at the European symposium on ambient intelligence.
  [Bibtex]

  @inproceedings{goumopoulos2004plants,
  title={The PLANTS system: enabling mixed societies of communicating plants and artefacts},
  author={Goumopoulos, Christos and Christopoulou, Eleni and Drossos, Nikos and Kameas, Achilles},
  booktitle={European Symposium on Ambient Intelligence},
  pages={184--195},
  year={2004},
  organization={Springer, Berlin, Heidelberg}
  }

• Christopoulou, E., & Kameas, A.. (2004). Using ontologies to address key issues in ubiquitous computing systems. Paper presented at the European symposium on ambient intelligence.
  [Bibtex]

  @inproceedings{christopoulou2004using,
  title={Using ontologies to address key issues in ubiquitous computing systems},
  author={Christopoulou, Eleni and Kameas, Achilles},
  booktitle={European Symposium on Ambient Intelligence},
  pages={13--24},
  year={2004},
  organization={Springer, Berlin, Heidelberg}
  }

• Christopoulou, E., & Kameas, A.. (2004). Ontology-driven composition of service-oriented ubiquitous computing applications. Paper presented at the Third international conference on adaptive hypermedia and adaptive web-based systems (ah2004), eindhoven, the netherlands.
  [Bibtex]

  @inproceedings{christopoulou2004ontology,
  title={Ontology-driven composition of service-oriented ubiquitous computing applications},
  author={Christopoulou, Eleni and Kameas, Achilles},
  booktitle={Third International Conference on Adaptive Hypermedia and Adaptive Web-Based Systems (AH2004), Eindhoven, the Netherlands},
  pages={23--26},
  year={2004}
  }

• Christopoulou, E., & Kameas, A.. (2004). Ubiquitous computing: software architectures, communication, and distribution-using ontologies to address key issues in ubiquitous computing systems. Lecture notes in computer science, 3295, 13–24.
  [Bibtex]

  @article{christopoulou2004ubiquitous,
  title={Ubiquitous Computing: Software Architectures, Communication, and Distribution-Using Ontologies to Address Key Issues in Ubiquitous Computing Systems},
  author={Christopoulou, Eleni and Kameas, Achilles},
  journal={Lecture Notes in Computer Science},
  volume={3295},
  pages={13--24},
  year={2004},
  publisher={Berlin: Springer-Verlag, 1973-}
  }

2003

• Burmester, M., & Magkos, E.. (2003). Towards secure and practical e-elections in the new era. In Advances in information security – secure electronic voting (pp. 63–76). Kluwer academic publishers (springer).
  [Bibtex]

  @incollection{burmester2003towards,
  title={Towards secure and practical e-elections in the new era},
  author={Burmester, Mike and Magkos, Emmanouil},
  booktitle={Advances in Information Security - Secure Electronic Voting},
  pages={63--76},
  year={2003},
  publisher={Kluwer Academic Publishers (Springer)}
  }

• Poulos, M., Magkos, E., Chrissikopoulos, V., & Alexandris, N.. (2003). Secure fingerprint verification based on image processing segmentation using computational geometry algorithms. Paper presented at the Sppra ‘2003 – iasted international conference on signal processing, pattern recognition, and applications.
  [Bibtex]

  @inproceedings{poulos2003secure,
  title={Secure fingerprint verification based on image processing segmentation using computational geometry algorithms},
  author={Poulos, M and Magkos, E and Chrissikopoulos, V and Alexandris, N},
  booktitle={SPPRA '2003 - IASTED International Conference on Signal Processing, Pattern Recognition, and Applications},
  year={2003}
  }

• Poulos, M., Papavlasopoulos, S., Chrissicopoulos, V., & Magkos, E.. (2003). Fingerprint verification based on image processing segmentation using an onion algorithm of computational geometry. Paper presented at the Sixth international workshop on mathematical methods in scattering theory and biomedical engineering.
  [Bibtex]

  @inproceedings{poulos2003fingerprint,
  title={Fingerprint verification based on image processing segmentation using an onion algorithm of computational geometry},
  author={Poulos, M and Papavlasopoulos, S and Chrissicopoulos, V and Magkos, E},
  booktitle={Sixth International Workshop on Mathematical Methods in Scattering Theory and Biomedical Engineering},
  pages={550--559},
  year={2003},
  organization={World Scientific publications}
  }

• Poulos, M., Alexandris, N., Belessioti, V., & Magkos, E.. (2003). Comparison between computational geometry and coherence methods applied to the eeg for medical diagnostic purposes. Proceedings of the 7th international multicoference on circuits, systems, communications and computers, 247–252.
  [Bibtex]

  @article{poulos2003comparison,
  title={Comparison between computational geometry and coherence methods applied to the EEG for medical diagnostic purposes},
  author={Poulos, M and Alexandris, N and Belessioti, V and Magkos, E},
  journal={Proceedings of the 7th International Multicoference on Circuits, Systems, Communications and Computers},
  pages={247--252},
  year={2003}
  }

• Magkos, E., Chrissikopoulos, V., Alexandris, N., & Poulos, M.. (2003). Secure key recovery for archived and communicated data in the corporate intranet. Paper presented at the 7th international conference on circuits, systems, communications and computers.
  [Bibtex]

  @inproceedings{magkos2003secure,
  title={Secure Key Recovery for Archived and Communicated Data in the Corporate Intranet},
  author={Magkos, Emmanouil and Chrissikopoulos, Vassilios and Alexandris, Nikos and Poulos, Marios},
  booktitle={7th International Conference on Circuits, Systems, Communications and Computers},
  pages={7--10},
  year={2003}
  }

• Oikonomou, K., & Stavrakakis, I.. (2003). Throughput Analysis of a Probabilistic Topology-Unaware TDMA MAC Policy for Ad-Hoc Networks. Paper presented at the Quality for all.
  [Bibtex]

  @inproceedings{oikonomou2003throughput,
  abstract = {The design of an efficient Medium Access Control (MAC) is challenging in ad-hoc networks where users can enter, leave or move inside the network without any need for prior configuration. The existing topology-unaware TDMA-based schemes are capable of providing a minimum guaranteed throughput by considering a deterministic policy for the utilization of the assigned scheduling time slots. In an earlier work, a probabilistic policy that utilizes the non-assigned slots according to an access probability, common for all nodes in the network, was proposed. The achievable throughput for a specific transmission under this policy was analyzed. In this work, the system throughput is studied and the conditions under which the system throughput under the probabilistic policy is higher than that under the deterministic policy are established. In addition, the value for the access probability that maximizes the system throughput is determined analytically, as well as simplified lower and upper bounds that depend only on a topology density metric. Since the analysis of the system throughput is shown to be difficult or impossible in the general case an approximation is introduced whose accuracy is investigated. Simulation results show that the approximate analysis successfully determines the range of values for the access probability for which the system throughput under the probabilistic policy is not only higher than that under the deterministic, but it is also close to the maximum.},
  author = {Oikonomou, Konstantinos and Stavrakakis, Ioannis},
  booktitle = {Quality for All},
  comment = {[pdf]},
  date-modified = {2021-12-06 10:43:42 +0200},
  keywords = {own, refereed, harmonics, R:MAC:TI},
  month = {10},
  pages = {172--181},
  publisher = {Springer},
  title = {{{Throughput Analysis of a Probabilistic Topology-Unaware TDMA MAC Policy for Ad-Hoc Networks}}},
  venue = {Stockholm, Sweden},
  year = {2003}}

• Oikonomou, K., & Stavrakakis, I.. (2003). A Probabilistic Topology Unaware TDMA Medium Access Control Policy for Ad Hoc Environments. Paper presented at the Personal wireless communications.
  [Bibtex]

  @inproceedings{oikonomou2003probabilistic,
  abstract = {The design of an efficient Medium Access Control (MAC) is challenging in ad-hoc networks where users can enter, leave or move inside the network without any need for prior configuration. Chlamtac and Farago have proposed a topology unaware TDMA-based scheme, suitable for ad-hoc networks, while Ju and Li have proposed an enhanced version that maximizes the minimum guaranteed throughput. Both approaches consider a deterministic policy for the utilization of the assigned scheduling time slots. In this work it is shown that this deterministic policy fails to utilize non-assigned slots that would result in collision-free transmissions even under heavy traffic conditions. A simple probabilistic policy is proposed, capable of utilizing the non-assigned slots according to an access probability, fixed for all users in the network. An analytical study establishes the conditions under which the probability of success for a specific transmission under the probabilistic policy, is higher than that under the deterministic. The dependence of both policies on the topology density is shown and a simple topology density metric is introduced as well. Simulation results show that there exists a suitable range of values for the access probability for which the probabilistic policy outperforms the deterministic and show how this range is affected by the variations of the topology density.},
  author = {Oikonomou, Konstantinos and Stavrakakis, Ioannis},
  booktitle = {Personal Wireless Communications},
  date-modified = {2021-12-06 10:43:36 +0200},
  doi = {10.1007/978-3-540-39867-7_30},
  isbn = {978-3-540-39867-7},
  keywords = {own, refereed, harmonics, R:MAC:TI},
  month = {9},
  organization = {Springer},
  pages = {291--305},
  title = {{{A Probabilistic Topology Unaware TDMA Medium Access Control Policy for Ad Hoc Environments}}},
  venue = {Venice, Italy},
  year = {2003},
  Bdsk-Url-1 = {https://doi.org/10.1007/978-3-540-39867-7_30}}

• Oikonomou, K., Vaios, A., Simoens, S., Pellati, P., & Stavrakakis, I.. (2003). A Centralized Ad-Hoc Network Architecture (CANA) Based on Enhanced HiperLAN/2. Paper presented at the 14th ieee proceedings on personal, indoor and mobile radio communications, 2003. pimrc 2003..
  [Bibtex]

  @inproceedings{oikonomou2003centralized,
  abstract = {In ad-hoc networks, where a user can enter, leave or move inside the network with no need for prior configuration, the support of multimedia applications that require very high bit-rates, is a challenging problem. Here, a centralized ad-hoc network architecture (CANA) is proposed, capable of efficiently supporting those applications in low mobility environments, while at the same time a standard wireless LAN environment is maintained for fast moving users. CANA is based on an enhanced HiperLAN/2 protocol architecture (even though this is not mandatory) that supports a dual mode of operation at 5 GHz and 60 GHz. In this system architecture, several ad-hoc specific functionalities are included, such as neighborhood discovery, clustering and routing. Among them, switching between different modes of operation has a large impact on the achievable performance of CANA.},
  author = {Oikonomou, Konstantinos and Vaios, Athanasios and Simoens, Sebastien and Pellati, Pietro and Stavrakakis, Ioannis},
  booktitle = {14th IEEE Proceedings on Personal, Indoor and Mobile Radio Communications, 2003. PIMRC 2003.},
  date-modified = {2021-12-06 10:43:30 +0200},
  doi = {10.1109/PIMRC.2003.1260330},
  keywords = {own, exceptional, refereed, broadway, R:MAC:DO},
  month = {9},
  pages = {1336--1340},
  title = {{{A Centralized Ad-Hoc Network Architecture (CANA) Based on Enhanced HiperLAN/2}}},
  venue = {Beijing, China},
  volume = {2},
  year = {2003},
  Bdsk-Url-1 = {https://doi.org/10.1109/PIMRC.2003.1260330}}

• Oikonomou, K., & Pronios, N. B.. (2003). Ad-Hoc Networking: A Unified Evaluation Framework. Paper presented at the Ist mobile & communications summit.
  [Bibtex]

  @inproceedings{oikonomou2003ad,
  abstract = {Ad-hoc networks have become the focus of an increasing research volume, mostly because of the advantages of their infrastructureless nature. The system performance of an ad-hoc network depends on numerous attributes and factors, such as the topology characteristics, the traffic scenarios and the node capabilities. In this work we present a framework for the comprehensive analysis of ad-hoc networks as well as a framework for their categorization, applicable to the on-going research in the area, along with definitions for the network performance metrics.},
  author = {Oikonomou, Konstantinos and Pronios, Nikos B},
  booktitle = {IST Mobile \& Communications Summit},
  comment = {[pdf]},
  date-modified = {2021-12-06 10:43:25 +0200},
  keywords = {own, refereed, R:MAC:DO},
  month = {6},
  title = {{{Ad-Hoc Networking: A Unified Evaluation Framework}}},
  venue = {Aveiro, Portugal},
  year = {2003}}

• Vaios, A., Oikonomou, K., & Stavrakakis, I.. (2003). A Centralized Routing Scheme Supporting Ad Hoc Networking in Dual Mode HiperLAN/2. Paper presented at the Ist mobile & communications summit.
  [Bibtex]

  @inproceedings{vaios2003centralized,
  abstract = {The IST project BroadWay introduces ad hoc functionality at 60 GHz in the traditional 5 GHz HIPERLAN/2. The dual mode of operation primarily aims at offloading the 5 GHz cell of HIPERLAN/2 in very dense urban deployments. The peculiarities of the BroadWay system make the development of a routing scheme a challenging task. This paper explores the routing perspectives of the BroadWay system and describes the centralized routing scheme for the dual mode HIPERLAN/2. Neighborhood discovery and route selection are the basic components of the centralized routing scheme, where the Access Point (AP) is responsible for allocating the resources and establishing the routes at both 5 and 60 GHz. BroadWay introduces modifications to the MAC of HIPERLAN/2 regarding new messages and framing considerations at both frequency bands in order to allow for the new routing functionalities.},
  author = {Vaios, Athanasios and Oikonomou, Konstantinos and Stavrakakis, Ioannis},
  booktitle = {IST Mobile \& Communications Summit},
  comment = {[pdf]},
  date-modified = {2021-12-06 10:46:33 +0200},
  keywords = {own, refereed, broadway, R:MAC:DO},
  month = {6},
  pages = {15--18},
  title = {{{A Centralized Routing Scheme Supporting Ad Hoc Networking in Dual Mode HiperLAN/2}}},
  venue = {Aveiro, Portugal},
  year = {2003}}

• Christopoulou, E., Garofalakis, J. D., Makris, C., Panagis, Y., Psaras-Chatzigeorgiou, A., Sakkopoulos, E., & Tsakalidis, A. K.. (2003). Techniques and metrics for improving website structure. J. web eng., 2(1-2), 90–114.
  [Bibtex]

  @article{christopoulou2003techniques,
  title={Techniques and metrics for improving website structure},
  author={Christopoulou, Eleni and Garofalakis, John D and Makris, Christos and Panagis, Yannis and Psaras-Chatzigeorgiou, Athanasios and Sakkopoulos, Evangelos and Tsakalidis, Athanasios K.},
  journal={J. Web Eng.},
  volume={2},
  number={1-2},
  pages={90--114},
  year={2003}
  }

2002

• Magkos, E., Burmester, M., & Chrissikopoulos, V.. (2002). Receipt-freeness in large-scale elections without untappable channels. Paper presented at the 1st ifip conference on e-commerce / e-business/ e-government.
  [Bibtex]

  @inproceedings{magkos2002receipt,
  title={Receipt-freeness in large-scale elections without untappable channels},
  author={Magkos, Emmanouil and Burmester, Mike and Chrissikopoulos, Vassilis},
  booktitle={1st IFIP Conference on E-Commerce / E-Business/ E-Government},
  pages={683--693},
  year={2002},
  organization={Kluwer Academic Publishers (Springer)}
  }

• Burmester, M., Chrissikopoulos, V., Kotzanikolaou, P., & Magkos, E.. (2002). Strong forward security. Paper presented at the Ifip-sec ’01 conference.
  [Bibtex]

  @inproceedings{burmester2002strong,
  title={Strong forward security},
  author={Burmester, Mike and Chrissikopoulos, Vassilios and Kotzanikolaou, Panayiotis and Magkos, Emmanouil},
  booktitle={IFIP-SEC '01 Conference},
  pages={109--119},
  year={2002},
  organization={Kluwer Academic Publishers (Springer)}
  }

• Magkos, E., & Chrissikopoulos, V.. (2002). Equitably fair internet voting. Journal of internet technology, 3(3), 187–193.
  [Bibtex]

  @article{magkos2002equitably,
  title={Equitably Fair Internet Voting},
  author={Magkos, Emmanouil and Chrissikopoulos, Vassilios},
  journal={Journal of Internet Technology},
  volume={3},
  number={3},
  pages={187--193},
  year={2002},
  publisher={Taiwan Academic Network}
  }

• Magkos, E., Alexandris, N., & Chrissikopoulos, V.. (2002). A common security model for conducting e-auctions and e-elections. Paper presented at the 6th international conference on communications.
  [Bibtex]

  @inproceedings{magkos2002common,
  title={A Common Security Model for Conducting e-Auctions and e-Elections},
  author={Magkos, Emmanouil and Alexandris, Nikos and Chrissikopoulos, Vassilis},
  booktitle={6th International Conference on Communications},
  pages={463--467},
  year={2002}
  }

• Christopoulou, E., Garofalakis, J., Makris, C., Panagis, Y., Sakkopoulos, E., & Tsakalidis, A.. (2002). Automating restructuring of web applications. Paper presented at the Acm hypertext.
  [Bibtex]

  @inproceedings{christopoulou2002automating,
  title={Automating restructuring of Web applications},
  author={Christopoulou, Eleni and Garofalakis, John and Makris, Christos and Panagis, Yannis and Sakkopoulos, Evangelos and Tsakalidis, Athanasios},
  booktitle={ACM Hypertext},
  pages={11--15},
  year={2002}
  }

• Christopoulou, E., Markellou, P., Markellos, K., Sirmakessis, S., Rigou, M., & Tsakalidis, A.. (2002). Learncom–a system for setting up an electronic learning community. Paper presented at the The 3rd international conference on information communication technologies in education.
  [Bibtex]

  @inproceedings{christopoulou2002learncom,
  title={Learncom--A System for Setting Up an Electronic Learning Community},
  author={Christopoulou, Eleni and Markellou, Penelope and Markellos, Konstantinos and Sirmakessis, Spiros and Rigou, Maria and Tsakalidis, Athanasios},
  booktitle={The 3rd International Conference on Information Communication Technologies in Education},
  pages={191--199},
  year={2002}
  }

2001

• Magkos, E., Kotzanikolaou, P., & Chrissikopoulos, V.. (2001). An asymmetric traceability scheme for copyright protection without trust assumptions. Paper presented at the Ec-web 2001 – 2nd international conference on electronic commerce and web technologies, 2001.
  [Bibtex]

  @inproceedings{magkos2001asymmetric,
  title={An asymmetric traceability scheme for copyright protection without trust assumptions},
  author={Magkos, Emmanouil and Kotzanikolaou, Panayiotis and Chrissikopoulos, Vassilios},
  booktitle={EC-WEB 2001 - 2nd International Conference on Electronic Commerce and Web technologies, 2001},
  pages={186--195},
  year={2001},
  organization={Springer-Verlag LNCS 2115}
  }

• Magkos, E., Chrissikopoulos, V., & Alexandris, N.. (2001). Software-based receipt-freeness in on-line elections. Paper presented at the Ifip tc11 wg11.4 1st annual working conference on network security.
  [Bibtex]

  @inproceedings{magkos2001software,
  title={Software-based Receipt-freeness in On-line Elections},
  author={Magkos, Emmanouil and Chrissikopoulos, Vassilios and Alexandris, Nikos},
  booktitle={IFIP TC11 WG11.4 1st Annual Working Conference on Network Security},
  pages={33--43},
  year={2001},
  organization={Kluwer Academic Publishers}
  }

• Alexandris, N., Magkos, E., & Chrissikopoulos, V.. (2001). Software-based receipt-freeness in on-line elections. Paper presented at the Proceedings of the ifip tc11 wg11. 4 first annual working conference on network security: advances in network and distributed systems security.
  [Bibtex]

  @inproceedings{alexandris2001software,
  title={Software-Based Receipt-Freeness in On-Line Elections},
  author={Alexandris, Nikos and Magkos, Emmanouil and Chrissikopoulos, Vassilios},
  booktitle={Proceedings of the IFIP TC11 WG11. 4 First Annual Working Conference on Network Security: Advances in Network and Distributed Systems Security},
  pages={33--44},
  year={2001}
  }

• Magkos, E., Kotzanikolaou, P., & Chrissikopoulos, V.. (2001). An asymmetric traceability scheme for copyright protection without trust. Paper presented at the Electronic commerce and web technologies:… international conference, ec-web…, proceedings.
  [Bibtex]

  @inproceedings{magkos2001asymmetric,
  title={An Asymmetric Traceability Scheme for Copyright Protection without Trust},
  author={Magkos, Emmanouil and Kotzanikolaou, Panayiotis and Chrissikopoulos, Vassilios},
  booktitle={Electronic Commerce and Web Technologies:... International Conference, EC-Web..., Proceedings},
  pages={186},
  year={2001},
  organization={Springer}
  }

• Oikonomou, K., Mas, C., & Tenidis, I.. (2001). On QoS Management of H/2 Bearer Service for 3G Telecommunication Systems. Paper presented at the 3g technologies and applications, eurescom summit.
  [Bibtex]

  @inproceedings{oikonomou2001qos,
  abstract = {3G telecommunication systems encompass a high-speed access network, which can provide high bit-rate bearer services for roaming users, as well as intelligent allocation of backbone network resources for end-to-end QoS maintenance. Emerging applications put extra demand for these features, which technologies such as HIPERLAN/2 (H/2) [1] are called to support. The ETSI BRAN [2] project has specified the basic mechanism for a generic wireless LAN bearer service that can accommodate a set of network layers (e.g. ATM, IP). We propose a mechanism on how to enhance the QoS capability handling of H/2 bearer for IP services, as well as provide the means to interconnect to oncoming 3G core networks.},
  author = {Oikonomou, Konstantinos and Mas, Carmen and Tenidis, Ioannis},
  booktitle = {3G Technologies and Applications, EURESCOM Summit},
  comment = {[pdf]},
  date-modified = {2021-12-06 10:43:18 +0200},
  keywords = {own, refereed, harmonics, R:MAC:DO},
  month = {11},
  pages = {12--15},
  title = {{{On QoS Management of H/2 Bearer Service for 3G Telecommunication Systems}}},
  venue = {Heidelberg, Germany},
  year = {2001}}

• Oikonomou, K., Tenidis, I., & Stavrakakis, I.. (2001). A Mechanism to Enable Differentiated Services QoS in HIPERLAN/2. Paper presented at the 8th ieee international conference on telecommunications, bucharest, romania.
  [Bibtex]

  @inproceedings{oikonomou2001mechanism,
  abstract = {HIPERLAN (HIgh PErformance Radio Local Area Network) type 2 platform (H/2) is a Wireless LAN and it considered as an in-door network where users would demand improved services in terms of data rates and quality. DiffServ (Differentiated Services) is a currently evolving approach to providing QoS over IP networks. Therefore, DiffServ QoS parameters of the IP layer need to be mapped to the H/2 specific QoS parameters. The DLC layer of H/2 has special features that can be used to support QoS. An effective mapping between DiffServ QoS and H/2 parameters is expected to increase the performance of the system while maintaining the QoS constraints. Consequently, a mechanism is needed in order to allow each application to request and reserve certain resources over H/2. So far there is no standard mechanism and the main focus of this paper is to propose one.},
  author = {Oikonomou, Konstantinos and Tenidis, Ioannis and Stavrakakis, Ioannis},
  booktitle = {8th IEEE International Conference on Telecommunications, Bucharest, Romania},
  comment = {[pdf]},
  date-modified = {2021-12-06 10:43:12 +0200},
  keywords = {own, refereed, harmonics, R:MAC:DO},
  month = {6},
  title = {{{A Mechanism to Enable Differentiated Services QoS in HIPERLAN/2}}},
  venue = {Bucharest, Romania},
  year = {2001}}

2000

• Magkos, E., Burmester, M., & Chrissikopoulos, V.. (2000). An equitably fair on-line auction scheme. Paper presented at the 1st international conference on electronic commerce and web technologies (ec-web 2000).
  [Bibtex]

  @inproceedings{magkos2000equitably,
  title={An equitably fair on-line auction scheme},
  author={Magkos, Emmanouil and Burmester, Mike and Chrissikopoulos, Vassilios},
  booktitle={1st International Conference on Electronic Commerce and Web technologies (EC-WEB 2000)},
  pages={72--84},
  year={2000},
  organization={Springer-Verlag, Berlin LNCS 1875}
  }

• Burmester, M., & Magkos, E.. Uncoercible e-bidding gameз. .
  [Bibtex]

  @article{burmesteruncoercible,
  title={Uncoercible e-Bidding Gameз},
  author={Burmester, M and Magkos, E}
  }

• Reggios, A., & Magkos, E.. Sociopolitical, ethical and technological factors in e-elections. .
  [Bibtex]

  @article{reggiossociopolitical,
  title={Sociopolitical, Ethical and Technological Factors in e-Elections},
  author={Reggios, A and Magkos, E}
  }

• Ntantogian, C., & Xenakis, C.. Book chapter for handbook of research on wireless security security architectures for b3g mobile networks. .
  [Bibtex]

  @article{ntantogianbook,
  title={Book Chapter for Handbook of Research on Wireless Security Security Architectures for B3G Mobile Networks},
  author={Ntantogian, Christoforos and Xenakis, Christos}
  }

• Ntantogian, C., Gkikakis, D., & Xenakis, C.. Pripay: a privacy preserving architecture for secure micropayments. .
  [Bibtex]

  @article{ntantogianpripay,
  title={PRIPAY: A Privacy Preserving Architecture for Secure Micropayments},
  author={Ntantogian, Christoforos and Gkikakis, Dimitris and Xenakis, Christos}
  }

• Ntantogian, C.. Performance analysis and analytical modeling for the optimization of the users’ authentication procedure in 4g mobile networks. .
  [Bibtex]

  @article{ntantogianperformance,
  title={Performance Analysis and Analytical Modeling for the Optimization of the Users’ Authentication Procedure in 4G Mobile Networks},
  author={Ntantogian, Christoforos}
  }

• Farao, A., Ntantogian, C., Istrate, C., Suciu, G., & Xenakis, C.. Sealedgrid: scalable, trusted, and interoperable platform for secured smart grid. .
  [Bibtex]

  @article{faraosealedgrid,
  title={SealedGRID: Scalable, trustEd, and interoperAble pLatform for sEcureD smart GRID},
  author={Farao, Aristeidis and Ntantogian, Christoforos and Istrate, Cristiana and Suciu, George and Xenakis, Christos}
  }

• Ntantogian, C., & Ribeiro, L. L.. Sandboxing the cyberspace for cybersecurity education and learning. .
  [Bibtex]

  @article{ntantogiansandboxing,
  title={Sandboxing the Cyberspace for Cybersecurity Education and Learning},
  author={Ntantogian, Christoforos and Ribeiro, Lu{\'\i}s L}
  }

• Medeni, T. D., Balc{i}lar, E., Yenice, S., Kökdemir, {. E., Torun, Y., Dalbay, Ö., Osman, I. H., Anouze, A. L., Tsohou, A., Irani, Z., & others. Improving e-government services in turkey: exploitation of cees project results. Қазэу хабаршысы\guillemotright–\guillemotleftвестник казэу, 41.
  [Bibtex]

  @article{medeniimproving,
  title={IMPROVING E-GOVERNMENT SERVICES IN TURKEY: EXPLOITATION OF CEES PROJECT RESULTS},
  author={Medeni, Tun{\c{c}} D and Balc{\i}lar, Emrah and Yenice, Sami and K{\"o}kdemir, {\.I}brahim Edib and Torun, Yavuz and Dalbay, {\"O}zkan and Osman, Ibrahim H and Anouze, Abdel Latef and Tsohou, Aggeliki and Irani, Zahir and others},
  journal={ҚазЭУ хабаршысы{\guillemotright}--{\guillemotleft}Вестник КазЭУ},
  pages={41}
  }

• Tsohou, A., Lee, H., Bataller, A., Forioso, I., Nedev, S., Unsal, H. O., Thuillier, B., & Massimino, M.. Deliverable d3.. .
  [Bibtex]

  @article{tsohoudeliverable,
  title={Deliverable D3.},
  author={Tsohou, Aggeliki and Lee, Habin and Bataller, Alfons and Forioso, Iskender and Nedev, Stoycho and Unsal, Huseyin Ozgur and Thuillier, Bruno and Massimino, Massimo}
  }

• Lee, H., Aktas, E., Tsohou, A., & Kim, J. W.. Customer satisfaction from open source software services in the presence of commercially licensed software. .
  [Bibtex]

  @article{leecustomer,
  title={Customer Satisfaction from Open Source Software Services in the Presence of Commercially Licensed Software},
  author={Lee, Habin and Aktas, Emel and Tsohou, Aggeliki and Kim, Jong Woo}
  }

• Karagiannis, S., Magkos, E., Chalavazis, G., & Nikiforos, M. N.. Analysis and evaluation of capture the flag challenges in secure mobile application development. .
  [Bibtex]

  @article{karagiannisanalysis,
  title={ANALYSIS AND EVALUATION OF CAPTURE THE FLAG CHALLENGES IN SECURE MOBILE APPLICATION DEVELOPMENT},
  author={Karagiannis, Stylianos and Magkos, Emmanouil and Chalavazis, George and Nikiforos, Maria Nefeli}
  }