Bogdan Ghita

University of Plymouth

Author Statistics

Papers

Citation

H-Index

i-10 index

Research Trends

Author Order

Document Type

Co-Authors

Ulrich Trick

Frankfurt University of Applied Sciences

Woldemar Fuhrmann

University of Plymouth

Stavros Shiaeles

University of Portsmouth

Ievgeniia Kuzminykh

King's College London

Taimur Bakhshi

University of Plymouth

Armin Lehmann

Frankfurt University of Applied Sciences

Besfort Shala

Frankfurt University of Applied Sciences

Steven Furnell

University of Nottingham

Nathan Clarke

University of Michigan–Ann Arbor

Jims Marchang

Sheffield Hallam University

Cooperative Institutions

University of Plymouth

Frankfurt University of Applied Sciences

Goethe University Frankfurt

King's College London

Dalian University of Technology

University of Portsmouth

Université de Toulouse

Universitatea Națională de Știință și Tehnologie Politehnica București

Sheffield Hallam University

Democritus University of Thrace

Author Statistics

Papers

Citation

H-Index

i-10 index

Research Field

Hop-Based dynamic fair scheduler for wireless Ad-Hoc networks

Jims Marchang Bogdan Ghita David Lancaster

In a typical multihop Ad-Hoc network, interference and contention increase when flows transit each node towards destination, particularly in the presence of cross-traffic. This paper observes the relationship between throughput and path length, self-contention and interference and it investigates the effect of multiple data rates over multiple data flows in the network. Drawing from the limitations of the 802.11 specification, the paper proposes a scheduler named Hop Based Multi Queue (HBMQ), which is designed to prioritise traffic based on the hop count of packets in order to provide fairness across different data flows. The simulation results demonstrate that HBMQ performs better than a Single Drop Tail Queue (SDTQ) scheduler in terms of providing fairness. Finally, the paper concludes with a number of possible directions for further research, focusing on cross-layer implementation to ensure the fairness is also provided at the MAC layer.

Network scheduler

Fairness measure

10.1109/ants.2013.6802873

Cite

Citations (10)

P2p-based community concept for M2M applications

Michael Steinheimer Ulrich Trick Woldemar Fuhrmann Michael Steinheimer Bogdan Ghita

This publication presents a novel concept to provide and use services in a Peer-to-Peer (P2P) connected Machine-To-Machine (M2M) community. Service compositions are presented that address several application fields like Ambient Assisted Living, traffic, energy, electro mobility, logistic or surveil-lance. The successfully implemented concept for optimisation of energy management in the local grid with P2P connected households became more generalised. Now it can be part of M2M application fields of 2 ^nd and 3 ^rd generation. The concept provides an overall solution for information exchange, extended by community mechanism, for convenient networking of peers to use and provide optimised services. Inside the community, the peers can operate as a single peer or operate as a cluster of peers to provide and use the services.

10.1109/fgct.2013.6767198

Cite

Citations (15)

Novel trust consensus protocol and blockchain-based trust evaluation system for M2M application services

Internet of Things (2019)

Besfort Shala Ulrich Trick Armin Lehmann Bogdan Ghita Stavros Shiaeles

The increasing number of intelligent Machine-to-Machine Communication (M2M) devices in the end-user domain provide good resources for creating and sharing M2M application services. Therefore, transferring the role of a traditional centralized service provider to decentralized peers (end-users) acting as service providers is very promising. However, the future of decentralized M2M application services which are independently provided or consumed by several end-users in the M2M community depends on trust. Untrustworthy peers trying to deploy malfunctioning services for others mitigate the benefits of decentralized systems. Nowadays, the concept of distributed ledger and blockchain has an increased popularity regarding trustless computing among communities operating without centralized authorities. This research publication provides a comprehensive analysis and approach merging the concepts of M2M application services, trust and distributed ledger technologies. Moreover, this publication presents an optimized Trust Evaluation System which is used to ensure trustworthiness among peers in a M2M community. To improve the Trust Evaluation System the integration of blockchain for data storage is introduced. Additionally, blockchain technology is used to extend the existing trust model of the Trust Evaluation System to enable tamper-proof data and detection of untrustworthy peers. This publication reviews several existing approaches in the academic and industry sector to highlight the limitations of the blockchain regarding the consensus and proposes a novel Trust Consensus Protocol. This research publication also provides a practical evaluation of the proposed protocol.

Popularity

Distributed ledger

10.1016/j.iot.2019.100058

Cite

Citations (68)

Public BI benchmark - part 2 & results

Zenodo (CERN European Organization for Nuclear Research) (2019)

Bogdan Ghita Peter Boncz Diego Tomé

Originally published on: https://github.com/cwida/public_bi_benchmark Originally compressed with bzip2. Compressed here with gzip. "User generated benchmark derived from the DBTest'18 paper [1] by Tableau. It contains real data and queries from 46 public workbooks in Tableau Public [2]. We downloaded 46 of the biggest workbooks and converted the data to .csv files and collected the SQL queries that appear in the Tableau log when the workbooks are visualized. We processed the .csv files and queries with the purpose of making them load and run on different database systems. Each directory is associated with a workbook and contains:

samples: a sample of each .csv file (first 20 rows) tables: .sql files containing the schema of each .csv file queries: .sql files containing the queries data-urls.txt: links for downloading the full .csv.bz2 compressed files

There are 46 workbooks containing 206 tables (.csv files) with the total size of 41 GB compressed and 386 GB uncompressed. Multiple .csv files may overlap but are not identical. This is because Tableau extracts the same workbook in multiple different ways for different queries."

Benchmark (surveying)

10.5281/zenodo.6344716

Cite

Citations (0)

M2M Application Service Provision: An Autonomous and Decentralised Approach

Journal of Communications (2017)

Michael Steinheimer Ulrich Trick Woldemar Fuhrmann Bogdan Ghita Gregor Frick

Abstract-This publication presents a novel concept for autonomous and decentralised M2M application service provision.The functional architecture of the approach is introduced as well as a detailed description of the system structure and process for application creation.Furthermore, this publication describes details about the proposed process for decentralised M2M application service management and formal description of M2M application services as well as independent validation of M2M application service configurations.Finally, the prototype M2M system realising the proposed concept is introduced and several scenarios are evaluated.

10.12720/jcm.12.9.489-499

Cite

Citations (4)

User-Centric Network Provisioning in Software Defined Data Center Environment

Taimur Bakhshi Bogdan Ghita

Present data center (DC) network provisioning schemes primarily utilize conventional load-balancing technologies, offering individual application performance improvement. Diversity in application usage however, makes isolated application prioritization a performance caveat for users with varying application trends. The present paper proposes a user profiling approach to capture application trends based on generic flow measurements (NetFlow) and employs the extracted profiles to create DC traffic forwarding policies. The scheme allows operators to define a global profile and application hierarchy based on extracted profiles to prioritize traffic for individual user classes. The proposed design was tested by extracting user profiles from a realistic enterprise network, and further simulated to dynamically manage DC traffic using the software defined networking paradigm. Compared to conventional traffic management schemes, the frame delivery ratio and effective throughput of our design was significantly higher for high priority north-south user traffic as well as the inter-server east-west application traffic.

NetFlow

Provisioning

Profiling (computer programming)

Data center

10.1109/lcn.2016.57

Cite

Citations (3)

Selected Papers from the 12th International Networking Conference

Lecture notes in networks and systems (2021)

Bogdan Ghita Stavros Shiaeles

10.1007/978-3-030-64758-2

Cite

Citations (14)

Entropy-Based Metrics for Occupancy Detection Using Energy Demand

Entropy (2020)

Denis Hock Martin Kappes Bogdan Ghita

Smart Meters provide detailed energy consumption data and rich contextual information that can be utilized to assist electricity providers and consumers in understanding and managing energy use. The detection of human activity in residential households is a valuable extension for applications, such as home automation, demand side management, or non-intrusive load monitoring, but it usually requires the installation of dedicated sensors. In this paper, we propose and evaluate two new metrics, namely the sliding window entropy and the interval entropy, inspired by Shannon’s entropy in order to obtain information regarding human activity from smart meter readings. We emphasise on the application of the entropy and analyse the effect of input parameters, in order to lay the foundation for future work. We compare our method to other methods, including the Page–Hinkley test and geometric moving average, which have been used for occupancy detection on the same dataset by other authors. Our experimental results, using the power measurements of the publicly available ECO dataset, indicate that the accuracy and area under the curve of our method can keep up with other well-known statistical methods, stressing the practical relevance of our approach.

Smart meter

Occupancy

10.3390/e22070731

Cite

Citations (3)

Assay of IP mobility management in SDN based mobile network architecture

Muhammad Dawood Woldemar Fuhrmann Bogdan Ghita

The evolution towards mobile networks flat architecture entreat a key-role for IP mobility management in providing the ubiquitous always-on network access services. This paper provides prospects for efficient mobility management in SDN plus mobile network architecture and describe important call control flows in inter system handover scenario. Distribution of gateway function approach has been followed and evolved with SDN technology. Key improvements with proposed architecture are to support seamless mobility in heterogeneous access environments, remove the chains of IP preservation and optimal data path management according to application needs. The paper assays the proposed evolution in terms of numbers of signaling messages processed by control entities for an inter system handover procedure relative to current mobile network architecture.

Mobility management

10.1109/itecha.2017.8101913

Cite

Citations (2)

Brainwave-based authentication using features fusion

Computers & Security (2023)

Mahyar TajDini Volodymyr Sokolov Ievgeniia Kuzminykh Bogdan Ghita

This article investigates the use of human brainwaves for user authentication. We used data collected from 50 volunteers and leveraged the Support Vector Machine (SVM) as a classification algorithm for the case study. User recognition patterns are taken from a combination of blinking, attention concentration, and picture recognition emotion sequences. These actions impact alpha, beta, gamma, and theta brain waves, which are measured using several electrodes. Ten different electrode placement patterns are explored, with varied positioning on the head. For each placement position, four features are examined, for a total of 40 extracts in the learning model. Features are: 1) spectral information, 2) coherence, 3) mutual correlation coefficient, and 4) mutual information. Each feature type is trained by the SVM algorithm, and the 40 weak classifier candidates. Adaptive Boosting (AdaBoost), a type of machine learning, is then used to generate a robust classifier, which is subsequently used to create a model, and select features, used to accurately identify individuals for authentication purposes. Upon verifying the proposed method using 32 legitimate users and 18 intruders, we obtained an authentication error rate (ERR) of 0.52%, and a classification rate of 99.06%.

AdaBoost

Boosting

Word error rate

10.1016/j.cose.2023.103198

Cite

Citations (8)