Wireless Communication Protocols for Distributed Computing Environments
Romano Fantacci,Daniele Tarchi,Andrea Tassi +2 more
- 17 Feb 2011
TL;DR: The aim of this chapter is to present the most important challenges for the communication point of view when forming a distributed network for performing parallel and distributed computing by considering their capabilities in terms of reliability and adaptation when facing with heterogeneous computing requests.
read more
Abstract: The distributed computing is an approach relying on the presence of multiple devices that can interact among them in order to perform a pervasive and parallel computing. This chapter deals with the communication protocol aiming to be used in a distributed computing scenario; in particular the considered computing infrastructure is composed by elements (nodes) able to consider specific application requests for the implementation of a service in a distributed manner according to the pervasive grid computing principle (Priol & Vanneschi, 2008; Vanneschi & Veraldi, 2007). In the classical grid computing paradigm, the processing nodes are high performance computers or multicore workstations, usually organized in clusters and interconnected through broadband wired communication networks with small delay (e.g., fiber optic, DSL lines). The pervasive grid computing paradigm overcomes these limitations allowing the development of distributed applications that can perform parallel computations using heterogeneous devices interconnected by different types of communication technologies. In this way, we can resort to a computing environment composed by fixed ormobile devices (e.g., smartphones, PDAs, laptops) interconnected through broadband wireless or wired networks where the devices are able to take part to a grid computing process. Suitable techniques for the pervasive grid computing should be able to discover and organize heterogeneous resources, to allow scaling an application according to the computing power, and to guarantee specific QoS profiles (Darby III & Tzeng, 2010; Roy & Das, 2009). In particular, aim of this chapter is to present the most important challenges for the communication point of view when forming a distributed network for performing parallel and distributed computing. The focus will be mainly on the resource discovery and computation scheduling on wireless not infrastructured networks by considering their capabilities in terms of reliability and adaptation when facing with heterogeneous computing requests.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Reinforcement learning based routing in wireless mesh networks
TL;DR: Simulation results show that RLBDR can significantly improve the overall network performance compared to schemes using either Metric of Interference and Channel switching, Best Path to Best Gateway, Expected Transmission count, nearest gateway or load at gateways as a metric for path selection.
23
A Fully Reconfigurable Approach to Emergency Management
TL;DR: This paper focuses on the consideration of both cognitive and autonomic networking approaches when deploying an emergency management system, and the future trend is to expand their influence toward the global optimization of the ICT infrastructure.
8
SGRL-Selective Gateway and Reinforcement Learning-based routing for WMN
Mustapha Boushaba,Abdelhakim Hafid,Abdelilah Maach,Driss Elghanami +3 more
- 01 Nov 2015
TL;DR: Simulation results show that SGRL can significantly improve the overall network performance compared to interference and channel switching, Reinforcement Learning-based Distributed Routing (RLBDR), Expected Transmission count (ETX), load at gateways as routing metrics.
6
A joint communication and computing resource management scheme for pervasive grid networks
Daniele Tarchi,Daniele Tarchi,Andrea Tassi,Romano Fantacci +3 more
- 10 Oct 2013
TL;DR: This paper deals with the proposal of a suitable resource management scheme relying on a routing algorithm able to perform jointly the resource discovery and task scheduling for implementing an efficient pervasive grid infrastructure in a wireless ad hoc scenario.
2
•Proceedings Article
Enablin replication in the ASSISTANT programming model
Carlo Bertolli,Bruno Ciciani,Francesco Quaglia,Marco Vanneschi +3 more
- 01 Jan 2010
TL;DR: This work extends the ASSISTANT programming model as a support for easy and effective development of pervasive Grid applications by providing constructs enabling and controlling replication and reports some experimental results showing reduced performance overheads for the classical case of replica consistency.
1
References
Ad-hoc on-demand distance vector routing
C.E. Perkins,E.M. Royer +1 more
- 25 Feb 1999
TL;DR: An ad-hoc network is the cooperative engagement of a collection of mobile nodes without the required intervention of any centralized access point or existing infrastructure and the proposed routing algorithm is quite suitable for a dynamic self starting network, as required by users wishing to utilize ad- hoc networks.
Optimized Link State Routing Protocol (OLSR)
Thomas Clausen,Philippe Jacquet +1 more
- 01 Oct 2003
TL;DR: The Optimized Link State Routing protocol is an optimization of the classical link state algorithm tailored to the requirements of a mobile wireless LAN and provides optimal routes (in terms of number of hops).
6K
Cloud Computing and Grid Computing 360-Degree Compared
Ian Foster,Yong Zhao,Ioan Raicu,Shiyong Lu +3 more
- 01 Nov 2008
TL;DR: In this article, the authors compare and contrast cloud computing with grid computing from various angles and give insights into the essential characteristics of both the two technologies, and compare the advantages of grid computing and cloud computing.
Optimized Link State Routing Protocol
Philippe Jacquet,Paul Muhlethaler,Amir Qayyum,Anis Laouiti,Laurent Viennot,Thomas Clausen +5 more
- 01 Jan 2000
TL;DR: Urethane prepolymer compositions are made from 1- isocyanato-3-isocyanatomethyl-3,5,5-trimethyl cyclohexane and polyols at a total NCO to OH ratio of at least 1.2:1, and the prepolymers are reacted with cycloaliphatic polyamines to give urea-urethanes.
2.1K
The node distribution of the random waypoint mobility model for wireless ad hoc networks
TL;DR: In this paper, the authors presented a detailed analytical study of the spatial node distribution generated by random waypoint mobility and derived an exact equation of the asymptotically stationary distribution for movement on a line segment and an accurate approximation for a square area.
1.2K