Brendan Jennings
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Brendan Jennings has a total of 126 co-authors. Here are the top co-authors by number of shared publications:
- Alan Davy
Waterford Institute of Technology
21 shared publications - Sasitharan Balasubramaniam
University of Nebraska-Lincoln
14 shared publications - Steven Davy
Technological University (TU) Dublin
14 shared publications Dmitri Botvich
11 shared publicationsJohn Strassner
Pohang University of Science and Technology (POSTECH)
11 shared publications- Sven van der Meer
Ericsson Network Management Labs
11 shared publications
Latest Publications
- 10 May 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Services Computing
- Vol. 16 (2) , 1402-1416
Scaling and Placing Distributed Services on Vehicle Clusters in Urban Environments
Many vehicles spend a significant amount of time in urban traffic congestion. Due to the evolution of autonomous vehicles, driver assistance systems, and in-vehicle entertainment, these vehicles have plentiful computational and communication capacity. How can we deploy data collection and processing tasks on these (slowly) moving vehicles to productively use any spare resources To answer this question, we study the efficient placement of distributed services on a moving vehicle cluster. We present a macroscopic flow model for an intersection in Dublin, Ireland, using real vehicle density data. We show that such aggregate flows are highly predictable, making it viable to deploy services harnessing vehicles' sensing capabilities. After studying the feasibility of using these vehicle clusters as infrastructure, we introduce a detailed mathematical specification for a task-based, distributed service placement model. The distributed service scales according to the resource requirements and is robust to the changes caused by the mobility of the cluster. We formulate this as a constrained optimization problem, with the objective of minimizing overall processing and communication costs. Our results show that jointly scaling tasks and finding a mobility-aware, optimal placement results in reduced processing and communication costs compared to the two schemes in the literature.
- 10 May 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Services Computing
- Vol. 16 (2) , 1402-1416
Scaling and Placing Distributed Services on Vehicle Clusters in Urban Environments
Many vehicles spend a significant amount of time in urban traffic congestion. Due to the evolution of autonomous vehicles, driver assistance systems, and in-vehicle entertainment, these vehicles have plentiful computational and communication capacity. How can we deploy data collection and processing tasks on these (slowly) moving vehicles to productively use any spare resources To answer this question, we study the efficient placement of distributed services on a moving vehicle cluster. We present a macroscopic flow model for an intersection in Dublin, Ireland, using real vehicle density data. We show that such aggregate flows are highly predictable, making it viable to deploy services harnessing vehicles' sensing capabilities. After studying the feasibility of using these vehicle clusters as infrastructure, we introduce a detailed mathematical specification for a task-based, distributed service placement model. The distributed service scales according to the resource requirements and is robust to the changes caused by the mobility of the cluster. We formulate this as a constrained optimization problem, with the objective of minimizing overall processing and communication costs. Our results show that jointly scaling tasks and finding a mobility-aware, optimal placement results in reduced processing and communication costs compared to the two schemes in the literature.
- 9 May 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 19 (3) , 3076-3089
Graph-Based Heuristic Solution for Placing Distributed Video Processing Applications on Moving Vehicle Clusters
Vehicular fog computing (VFC) is envisioned as an extension of cloud and mobile edge computing to utilize the rich sensing and processing resources available in vehicles. We focus on slow-moving cars that spend a significant time in urban traffic congestion as a potential pool of onboard sensors, video cameras, and processing capacity. For leveraging the dynamic network and processing resources, we utilize a stochastic mobility model to select nodes with similar mobility patterns. We then design two distributed applications that are scaled in real-time and placed as multiple instances on selected vehicular fog nodes. We handle the unstable vehicular environment by a), Using real vehicle density data to build a realistic mobility model that helps in selecting nodes for service deployment b), Using community-detection algorithms for selecting a robust vehicular cluster using the predicted mobility behavior of vehicles. The stability of the chosen cluster is validated using a graph centrality measure, and c), Graph-based placement heuristics is developed to find the optimal placement of service graphs based on a multi-objective constrained optimization problem with the objective of efficient resource utilization. The heuristic solves an important problem of processing data generated from distributed devices by balancing the trade-off between increasing the number of service instances to have enough redundancy of processing instances to increase resilience in the service in case of node or link failure, versus reducing their number to minimize resource usage. We compare our heuristic to a mixed integer program (MIP) solution and a first-fit heuristic. Our approach performs better than these comparable schemes in terms of resource utilization and/or has a lesser service latency when compared to an edge computing-based service placement scheme.
- 9 May 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 19 (3) , 3076-3089
Graph-Based Heuristic Solution for Placing Distributed Video Processing Applications on Moving Vehicle Clusters
Vehicular fog computing (VFC) is envisioned as an extension of cloud and mobile edge computing to utilize the rich sensing and processing resources available in vehicles. We focus on slow-moving cars that spend a significant time in urban traffic congestion as a potential pool of onboard sensors, video cameras, and processing capacity. For leveraging the dynamic network and processing resources, we utilize a stochastic mobility model to select nodes with similar mobility patterns. We then design two distributed applications that are scaled in real-time and placed as multiple instances on selected vehicular fog nodes. We handle the unstable vehicular environment by a), Using real vehicle density data to build a realistic mobility model that helps in selecting nodes for service deployment b), Using community-detection algorithms for selecting a robust vehicular cluster using the predicted mobility behavior of vehicles. The stability of the chosen cluster is validated using a graph centrality measure, and c), Graph-based placement heuristics is developed to find the optimal placement of service graphs based on a multi-objective constrained optimization problem with the objective of efficient resource utilization. The heuristic solves an important problem of processing data generated from distributed devices by balancing the trade-off between increasing the number of service instances to have enough redundancy of processing instances to increase resilience in the service in case of node or link failure, versus reducing their number to minimize resource usage. We compare our heuristic to a mixed integer program (MIP) solution and a first-fit heuristic. Our approach performs better than these comparable schemes in terms of resource utilization and/or has a lesser service latency when compared to an edge computing-based service placement scheme.
- Open Access
Scaling and Placing Distributed Services on Vehicle Clusters in Urban Environments
Many vehicles spend a significant amount of time in urban traffic congestion. Due to the evolution of autonomous cars, driver assistance systems, and in-vehicle entertainment, many vehicles have plentiful computational and communication capacity. How can we deploy data collection and processing tasks on these (slowly) moving vehicles to productively use any spare resources? To answer this question, we study the efficient placement of distributed services on a moving vehicle cluster. We present a macroscopic flow model for an intersection in Dublin, Ireland, using real vehicle density data. We show that such aggregate flows are highly predictable (even though the paths of individual vehicles are not known in advance), making it viable to deploy services harnessing vehicles' sensing capabilities. Our main contribution is a detailed mathematical specification for a task-based, distributed service placement model that scales according to the resource requirements and is robust to the changes caused by the mobility of the cluster. We formulate this as a constrained optimization problem, with the objective of minimizing overall processing and communication costs. Our results show that jointly scaling tasks and finding a mobility-aware, optimal placement results in reduced processing and communication costs compared to an autonomous vehicular edge computing-based na\"{i}ve solution.
Open AccessScaling and Placing Distributed Services on Vehicle Clusters in Urban Environments
Many vehicles spend a significant amount of time in urban traffic congestion. Due to the evolution of autonomous cars, driver assistance systems, and in-vehicle entertainment, many vehicles have plentiful computational and communication capacity. How can we deploy data collection and processing tasks on these (slowly) moving vehicles to productively use any spare resources? To answer this question, we study the efficient placement of distributed services on a moving vehicle cluster. We present a macroscopic flow model for an intersection in Dublin, Ireland, using real vehicle density data. We show that such aggregate flows are highly predictable (even though the paths of individual vehicles are not known in advance), making it viable to deploy services harnessing vehicles' sensing capabilities. Our main contribution is a detailed mathematical specification for a task-based, distributed service placement model that scales according to the resource requirements and is robust to the changes caused by the mobility of the cluster. We formulate this as a constrained optimization problem, with the objective of minimizing overall processing and communication costs. Our results show that jointly scaling tasks and finding a mobility-aware, optimal placement results in reduced processing and communication costs compared to an autonomous vehicular edge computing-based na\"{i}ve solution.
- Top Cited Papers
- 29 March 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Surveys & Tutorials
- Vol. 21 (3) , 2637-2670
Software Defined Networks-Based Smart Grid Communication: A Comprehensive Survey
- 29 March 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Surveys & Tutorials
- Vol. 21 (3) , 2637-2670
Top Cited PapersSoftware Defined Networks-Based Smart Grid Communication: A Comprehensive Survey
- Open Access
Software Defined Networks based Smart Grid Communication: A Comprehensive Survey
The current power grid is no longer a feasible solution due to ever-increasing user demand of electricity, old infrastructure, and reliability issues and thus require transformation to a better grid a.k.a., smart grid (SG). The key features that distinguish SG from the conventional electrical power grid are its capability to perform two-way communication, demand side management, and real time pricing. Despite all these advantages that SG will bring, there are certain issues which are specific to SG communication system. For instance, network management of current SG systems is complex, time consuming, and done manually. Moreover, SG communication (SGC) system is built on different vendor specific devices and protocols. Therefore, the current SG systems are not protocol independent, thus leading to interoperability issue. Software defined network (SDN) has been proposed to monitor and manage the communication networks globally. This article serves as a comprehensive survey on SDN-based SGC. In this article, we first discuss taxonomy of advantages of SDNbased SGC.We then discuss SDN-based SGC architectures, along with case studies. Our article provides an in-depth discussion on routing schemes for SDN-based SGC. We also provide detailed survey of security and privacy schemes applied to SDN-based SGC. We furthermore present challenges, open issues, and future research directions related to SDN-based SGC.
Open AccessSoftware Defined Networks based Smart Grid Communication: A Comprehensive Survey
The current power grid is no longer a feasible solution due to ever-increasing user demand of electricity, old infrastructure, and reliability issues and thus require transformation to a better grid a.k.a., smart grid (SG). The key features that distinguish SG from the conventional electrical power grid are its capability to perform two-way communication, demand side management, and real time pricing. Despite all these advantages that SG will bring, there are certain issues which are specific to SG communication system. For instance, network management of current SG systems is complex, time consuming, and done manually. Moreover, SG communication (SGC) system is built on different vendor specific devices and protocols. Therefore, the current SG systems are not protocol independent, thus leading to interoperability issue. Software defined network (SDN) has been proposed to monitor and manage the communication networks globally. This article serves as a comprehensive survey on SDN-based SGC. In this article, we first discuss taxonomy of advantages of SDNbased SGC.We then discuss SDN-based SGC architectures, along with case studies. Our article provides an in-depth discussion on routing schemes for SDN-based SGC. We also provide detailed survey of security and privacy schemes applied to SDN-based SGC. We furthermore present challenges, open issues, and future research directions related to SDN-based SGC.
- 19 September 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 67 (1) , 154-164
Capacity Analysis of a Peripheral Nerve Using Modulated Compound Action Potential Pulses
Artificial neural stimulation of a peripheral nerve can create an in-body data communications channel. We propose the stimulation of a peripheral nerve using energy-harvesting arrays of nanodevices, embedded in biocompatible tissue patches. The resulting extracellular compound action potential (CAP) pulse can provide a data bit-stream for communicating with an embedded receiver. Our objective is to determine the maximum achievable transmission range of a CAP along a nerve and the maximum sustainable bit rate.We model the generation of a CAP and then compute the reduction in amplitude and the spreading of the pulse with propagation distance. The channel capacity is calculated for on-off keying (OOK) and digital pulse interval modulation (DPIM). We show that the transmission range depends on the number and diameters of the activated neurons contributing to the CAP amplitude and width. Our modulation analysis demonstrates the effects of attenuation, background noise, the neural refractory period and pulse broadening on the achievable bit-rate. We show how a maximum OOK bit rate of 200 bit/s can be sustained over transmission distances greater than 100 mm. The proposed approach provides a low bit-rate, unidirectional asynchronous transmission system that could, for example, deliver simple instructions to an embedded drug-delivery system.
- 19 September 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 67 (1) , 154-164
Capacity Analysis of a Peripheral Nerve Using Modulated Compound Action Potential Pulses
Artificial neural stimulation of a peripheral nerve can create an in-body data communications channel. We propose the stimulation of a peripheral nerve using energy-harvesting arrays of nanodevices, embedded in biocompatible tissue patches. The resulting extracellular compound action potential (CAP) pulse can provide a data bit-stream for communicating with an embedded receiver. Our objective is to determine the maximum achievable transmission range of a CAP along a nerve and the maximum sustainable bit rate.We model the generation of a CAP and then compute the reduction in amplitude and the spreading of the pulse with propagation distance. The channel capacity is calculated for on-off keying (OOK) and digital pulse interval modulation (DPIM). We show that the transmission range depends on the number and diameters of the activated neurons contributing to the CAP amplitude and width. Our modulation analysis demonstrates the effects of attenuation, background noise, the neural refractory period and pulse broadening on the achievable bit-rate. We show how a maximum OOK bit rate of 200 bit/s can be sustained over transmission distances greater than 100 mm. The proposed approach provides a low bit-rate, unidirectional asynchronous transmission system that could, for example, deliver simple instructions to an embedded drug-delivery system.
- 1 June 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 366-371
Achieving Resilience in SDN-Based Smart Grid: A Multi-Armed Bandit Approach
With the advancement in electrical power systems, control engineering, and information and communication technologies (ICT), remarkable efforts have been made to improve the current electrical power grid, resulting in the so-called intelligent grid or the smart grid (SG). The envisioned smart grid heavily relies on ICT to support two-way communication, demand side management, and other critical smart grid operations. In case of an attack in the SG environment, communication link failures may occur. Moreover, an attacker may also compromise the switch within the SG communication network, thus leading to the breakdown of several communication links. Consequently, important information will not be communicated to and from the SG entities like relays, and remote terminal units (RTUs), As a result, cascading failures or blackouts may occur. Identification of these link failures and choosing alternative communication paths at run-time is indispensable. Thus, to deal with this issue, we consider an SDN-based smart grid setting in which the SDN controller in coordination with the network switches, is capable of learning about the link failures inside the network and then adapt to the changing network conditions dynamically. We model this problem as Multi-armed bandit problem and propose a link failure learning (LFL-MAB) algorithm. The proposed algorithm has the capability to learn the strategy adopted by the attacker and select those communication links which are reliable. Simulation results show that the proposed algorithm outperform other approaches and ensure reliable communication and resiliency within the smart grid network.
- 1 June 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 366-371
Achieving Resilience in SDN-Based Smart Grid: A Multi-Armed Bandit Approach
With the advancement in electrical power systems, control engineering, and information and communication technologies (ICT), remarkable efforts have been made to improve the current electrical power grid, resulting in the so-called intelligent grid or the smart grid (SG). The envisioned smart grid heavily relies on ICT to support two-way communication, demand side management, and other critical smart grid operations. In case of an attack in the SG environment, communication link failures may occur. Moreover, an attacker may also compromise the switch within the SG communication network, thus leading to the breakdown of several communication links. Consequently, important information will not be communicated to and from the SG entities like relays, and remote terminal units (RTUs), As a result, cascading failures or blackouts may occur. Identification of these link failures and choosing alternative communication paths at run-time is indispensable. Thus, to deal with this issue, we consider an SDN-based smart grid setting in which the SDN controller in coordination with the network switches, is capable of learning about the link failures inside the network and then adapt to the changing network conditions dynamically. We model this problem as Multi-armed bandit problem and propose a link failure learning (LFL-MAB) algorithm. The proposed algorithm has the capability to learn the strategy adopted by the attacker and select those communication links which are reliable. Simulation results show that the proposed algorithm outperform other approaches and ensure reliable communication and resiliency within the smart grid network.
- 1 June 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 177-181
Domain Federation via MPLS and SDN for Dynamic, Real-time End-to-end QoS Support
We explore Domain federation using SDN as a means of provisioning in real-time, end-to-end QoS. This can be achieved by having a holistic SDN control plane that takes care of dynamically provisioning application QoS needs per domain, and a federation of the domain controllers so as to enable secure and manageable grounds for deploying an RSVP-like service-request protocol between domains. Such a federation should be straight-forward to create and be able to preserve the privacy of each domain. In this paper, we design, implement and evaluate an End-to-end MPLS-as-a-Service (EMPLaaS) framework. EMPLaaS is an evolution of MPLS in which SDN is used to provide a dynamic control plane so as to have an application-centric QoS framework. The end result is a scalable and privacy-aware multi-domain control plane for dynamically setting up resource reserved label-switched tunnels. The framework proposes payloading the MPLS service requests onto the widely deployed BGP so as to ensure inter-operability. It also derives responsive end-to-end network behavior by enabling application-delegated traffic engineering. Through an implementation, the proposed framework has been evaluated in terms of ability to setup QoS-aware paths dynamically and adaptively.
- 1 June 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 177-181
Domain Federation via MPLS and SDN for Dynamic, Real-time End-to-end QoS Support
We explore Domain federation using SDN as a means of provisioning in real-time, end-to-end QoS. This can be achieved by having a holistic SDN control plane that takes care of dynamically provisioning application QoS needs per domain, and a federation of the domain controllers so as to enable secure and manageable grounds for deploying an RSVP-like service-request protocol between domains. Such a federation should be straight-forward to create and be able to preserve the privacy of each domain. In this paper, we design, implement and evaluate an End-to-end MPLS-as-a-Service (EMPLaaS) framework. EMPLaaS is an evolution of MPLS in which SDN is used to provide a dynamic control plane so as to have an application-centric QoS framework. The end result is a scalable and privacy-aware multi-domain control plane for dynamically setting up resource reserved label-switched tunnels. The framework proposes payloading the MPLS service requests onto the widely deployed BGP so as to ensure inter-operability. It also derives responsive end-to-end network behavior by enabling application-delegated traffic engineering. Through an implementation, the proposed framework has been evaluated in terms of ability to setup QoS-aware paths dynamically and adaptively.
- 5 July 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Nanotechnology
- Vol. 16 (6) , 919-930
Nanodevice Arrays for Peripheral Nerve Fascicle Activation Using Ultrasound Energy-Harvesting
We propose the use of wireless, energy harvesting, implanted nanodevice arrays with electrodes for selective stimulation of peripheral nerves in the human body. We calculate the input ultrasound energy and harvested power for single fixed-size nanowire-based nanodevices at different tissue depths and compare these with the current and voltage levels required for peripheral neural stimulation. We model the dimensioning of arrays of nanodevices, embedded in biocompatible tissue patches, to meet these neural stimulation requirements. Selectivity of activation of particular nerve bundles requires that the output voltage and current of the array can be varied to increase or decrease penetration into the neural tissue. This variation can be achieved by changing the energized area of the array and/or by decreasing the incident ultrasound power. However, the array must be implanted horizontally relative to the incident ultrasound as any tilting of the nanodevices will reduce the harvested energy. The proposed approach provides a longer-term implant solution for nerve stimulation that allows the patient greater freedom of movement than with embedded tethered eelectrodeslectrodes.
- 5 July 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Nanotechnology
- Vol. 16 (6) , 919-930
Nanodevice Arrays for Peripheral Nerve Fascicle Activation Using Ultrasound Energy-Harvesting
We propose the use of wireless, energy harvesting, implanted nanodevice arrays with electrodes for selective stimulation of peripheral nerves in the human body. We calculate the input ultrasound energy and harvested power for single fixed-size nanowire-based nanodevices at different tissue depths and compare these with the current and voltage levels required for peripheral neural stimulation. We model the dimensioning of arrays of nanodevices, embedded in biocompatible tissue patches, to meet these neural stimulation requirements. Selectivity of activation of particular nerve bundles requires that the output voltage and current of the array can be varied to increase or decrease penetration into the neural tissue. This variation can be achieved by changing the energized area of the array and/or by decreasing the incident ultrasound power. However, the array must be implanted horizontally relative to the incident ultrasound as any tilting of the nanodevices will reduce the harvested energy. The proposed approach provides a longer-term implant solution for nerve stimulation that allows the patient greater freedom of movement than with embedded tethered eelectrodeslectrodes.