Home > Research > Publications & Outputs > A novel routing algorithm for mobile pervasive ...

Keywords

View graph of relations

A novel routing algorithm for mobile pervasive computing

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSNConference contribution/Paperpeer-review

Published

Standard

A novel routing algorithm for mobile pervasive computing. / Fantacci, Romano; Tarchi, Daniele; Tassi, Andrea.
2010 IEEE Global Telecommunications Conference (GLOBECOM 2010). New York: IEEE, 2010. p. 1-5.

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSNConference contribution/Paperpeer-review

Harvard

Fantacci, R, Tarchi, D & Tassi, A 2010, A novel routing algorithm for mobile pervasive computing. in 2010 IEEE Global Telecommunications Conference (GLOBECOM 2010). IEEE, New York, pp. 1-5, IEEE Global Telecommunications Conference (GLOBECOM 2010), United Kingdom, 6/12/10. https://doi.org/10.1109/GLOCOM.2010.5683765

APA

Fantacci, R., Tarchi, D., & Tassi, A. (2010). A novel routing algorithm for mobile pervasive computing. In 2010 IEEE Global Telecommunications Conference (GLOBECOM 2010) (pp. 1-5). IEEE. https://doi.org/10.1109/GLOCOM.2010.5683765

Vancouver

Fantacci R, Tarchi D, Tassi A. A novel routing algorithm for mobile pervasive computing. In 2010 IEEE Global Telecommunications Conference (GLOBECOM 2010). New York: IEEE. 2010. p. 1-5 doi: 10.1109/GLOCOM.2010.5683765

Author

Fantacci, Romano ; Tarchi, Daniele ; Tassi, Andrea. / A novel routing algorithm for mobile pervasive computing. 2010 IEEE Global Telecommunications Conference (GLOBECOM 2010). New York : IEEE, 2010. pp. 1-5

Bibtex

@inproceedings{c0c2a3c8909846e78f55211339bcde4c,
title = "A novel routing algorithm for mobile pervasive computing",
abstract = "The interest towards real-time computing has lead an even more interest in grid computing. While in the past the implementation of grid computing has been done on high performance computers, in the recent years there is an increasing interest in the pervasive grid scenarios, where multiple devices can be used for a distributed computing. The most challenging idea is to use mobile devices connected among them with wireless connections for setting up pervasive grid environments. In this context, it is a crucial problem the optimization of the routing algorithms among the processing nodes, in order to satisfy the performance requirements of a distributed computing. Aim of this paper is the design of specific routing algorithms for different pervasive grid applications with a particular attention to time sensitive scenarios.",
keywords = "NETWORKS",
author = "Romano Fantacci and Daniele Tarchi and Andrea Tassi",
year = "2010",
doi = "10.1109/GLOCOM.2010.5683765",
language = "English",
isbn = "9781424456369",
pages = "1--5",
booktitle = "2010 IEEE Global Telecommunications Conference (GLOBECOM 2010)",
publisher = "IEEE",
note = "IEEE Global Telecommunications Conference (GLOBECOM 2010) ; Conference date: 06-12-2010 Through 10-12-2010",

}

RIS

TY - GEN

T1 - A novel routing algorithm for mobile pervasive computing

AU - Fantacci, Romano

AU - Tarchi, Daniele

AU - Tassi, Andrea

PY - 2010

Y1 - 2010

N2 - The interest towards real-time computing has lead an even more interest in grid computing. While in the past the implementation of grid computing has been done on high performance computers, in the recent years there is an increasing interest in the pervasive grid scenarios, where multiple devices can be used for a distributed computing. The most challenging idea is to use mobile devices connected among them with wireless connections for setting up pervasive grid environments. In this context, it is a crucial problem the optimization of the routing algorithms among the processing nodes, in order to satisfy the performance requirements of a distributed computing. Aim of this paper is the design of specific routing algorithms for different pervasive grid applications with a particular attention to time sensitive scenarios.

AB - The interest towards real-time computing has lead an even more interest in grid computing. While in the past the implementation of grid computing has been done on high performance computers, in the recent years there is an increasing interest in the pervasive grid scenarios, where multiple devices can be used for a distributed computing. The most challenging idea is to use mobile devices connected among them with wireless connections for setting up pervasive grid environments. In this context, it is a crucial problem the optimization of the routing algorithms among the processing nodes, in order to satisfy the performance requirements of a distributed computing. Aim of this paper is the design of specific routing algorithms for different pervasive grid applications with a particular attention to time sensitive scenarios.

KW - NETWORKS

U2 - 10.1109/GLOCOM.2010.5683765

DO - 10.1109/GLOCOM.2010.5683765

M3 - Conference contribution/Paper

SN - 9781424456369

SP - 1

EP - 5

BT - 2010 IEEE Global Telecommunications Conference (GLOBECOM 2010)

PB - IEEE

CY - New York

T2 - IEEE Global Telecommunications Conference (GLOBECOM 2010)

Y2 - 6 December 2010 through 10 December 2010

ER -