17 citations · 29 across the 8 of their papers we have counts for
8 papers
Optimal and Heuristic Approaches for Platooning Systems with Deadlines
Thiago S. Gomides, Evangelos Kranakis, Ioannis Lambadaris +2
Efficient truck platooning is a key strategy for reducing freight costs, lowering fuel consumption, and mitigating emissions. Deadlines are critical in this context, as trucks must…
Optimal Task Offloading with Firm Deadlines for Mobile Edge Computing Systems
Khai Doan, Wesley Araujo, Evangelos Kranakis +3
Under a dramatic increase in mobile data traffic, a promising solution for edge computing systems to maintain their local service is the task migration that may be implemented by m…
Optimal Control for Platooning in Vehicular Networks
Thiago S. Gomides, Evangelos Kranakis, Ioannis Lambadaris +1
As the automotive industry is developing autonomous driving systems and vehicular networks, attention to truck platooning has increased as a way to reduce costs (fuel consumption)…
Optimal Task Offloading Policy in Edge Computing Systems with Firm Deadlines
Khai Doan, Wesley Araujo, Evangelos Kranakis +2
The recent drastic increase in mobile data traffic has pushed the mobile edge computing systems to the limit of their capacity. A promising solution to this problem is the task mig…
Mobility as an Alternative Communication Channel: A Survey
Benjamin Baron, Prométhée Spathis, Marcelo Dias de Amorim +2
We review the research literature investigating systems in which mobile entities can carry data while they move. These entities can be either mobile by nature (e.g., human beings a…
Analysis and Control of Beliefs in Social Networks
Tian Wang, Hamid Krim, Yannis Viniotis
In this paper, we investigate the problem of how beliefs diffuse among members of social networks. We propose an information flow model (IFM) of belief that captures how interactio…
Optimal Multi-Server Allocation to Parallel Queues With Independent Random Queue-Server Connectivity
Hussein Al-Zubaidy, Ioannis Lambadaris, Yannis Viniotis
We investigate an optimal scheduling problem in a discrete-time system of L parallel queues that are served by K identical, randomly connected servers. Each queue may be connected…
Share and Disperse: How to Resist Against Aggregator Compromises in Sensor Networks
Thomas Claveirole, Marcelo Dias de Amorim, Michel Abdalla +1
A common approach to overcome the limited nature of sensor networks is to aggregate data at intermediate nodes. A challenging issue in this context is to guarantee end-to-end secur…