Performance Analysis of Stealth DHT with Mobile Nodes

Computing and Communications

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Conference contribution/Paper › peer-review

Published

Standard

Performance Analysis of Stealth DHT with Mobile Nodes. / MacQuire, Andrew; Brampton, Andrew; Rai, Idris et al.
PERCOMW '06 Proceedings of the 4th annual IEEE international conference on Pervasive Computing and Communications Workshops. 2006. p. 184-189.

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Conference contribution/Paper › peer-review

Harvard

MacQuire, A, Brampton, A, Rai, I & Mathy, L 2006, Performance Analysis of Stealth DHT with Mobile Nodes. in PERCOMW '06 Proceedings of the 4th annual IEEE international conference on Pervasive Computing and Communications Workshops. pp. 184-189, 3rd International Workshop on Mobile Peer-to-Peer Computing (MP2P'06), Pisa, Italy, 17/03/06. https://doi.org/10.1109/PERCOMW.2006.109

APA

MacQuire, A., Brampton, A., Rai, I., & Mathy, L. (2006). Performance Analysis of Stealth DHT with Mobile Nodes. In PERCOMW '06 Proceedings of the 4th annual IEEE international conference on Pervasive Computing and Communications Workshops (pp. 184-189) https://doi.org/10.1109/PERCOMW.2006.109

Vancouver

MacQuire A, Brampton A, Rai I, Mathy L. Performance Analysis of Stealth DHT with Mobile Nodes. In PERCOMW '06 Proceedings of the 4th annual IEEE international conference on Pervasive Computing and Communications Workshops. 2006. p. 184-189 doi: 10.1109/PERCOMW.2006.109

Author

MacQuire, Andrew ; Brampton, Andrew ; Rai, Idris et al. / Performance Analysis of Stealth DHT with Mobile Nodes. PERCOMW '06 Proceedings of the 4th annual IEEE international conference on Pervasive Computing and Communications Workshops. 2006. pp. 184-189

Bibtex

@inproceedings{6e26216fe0514520b37978434ddf8ec7,

title = "Performance Analysis of Stealth DHT with Mobile Nodes",

abstract = "The advances in wireless networking and the consequent emergence of new applications that wireless networks increasingly support inevitably leads to low capability mobile nodes connecting to peer-to-peer networks. However, the characteristics of mobile nodes and limitations of access point coverage often cause mobile nodes to lose connectivity, which can cause many mobile nodes to simultaneously rejoin the network. Continuous departures and joins due to the mobility of nodes leads to mobility churn, which can often degrade the performance of the underlying peer-topeer network significantly. In this paper, we use simulations to demonstrate that the Stealth Distributed Hash Table (Stealth DHT) algorithm is ideally suited for networks with mobile nodes. By avoiding storing state in unreliable nodes, a Stealth DHT prevents mobile nodes from being used by other nodes to provide services. Consequently, Stealth DHTs eliminate the mobility churn effect and significantly reduce the amount of overhead as compared to a generic DHT. This paper demonstrates this using simulation results that compare the performance of Stealth DHTs to a generic DHT, Pastry.",

keywords = "cs_eprint_id, 1248 cs_uid, 1",

author = "Andrew MacQuire and Andrew Brampton and Idris Rai and Laurent Mathy",

year = "2006",

month = mar,

doi = "10.1109/PERCOMW.2006.109",

language = "English",

pages = "184--189",

booktitle = "PERCOMW '06 Proceedings of the 4th annual IEEE international conference on Pervasive Computing and Communications Workshops",

note = "3rd International Workshop on Mobile Peer-to-Peer Computing (MP2P'06) ; Conference date: 17-03-2006",

}

RIS

TY - GEN

T1 - Performance Analysis of Stealth DHT with Mobile Nodes

AU - MacQuire, Andrew

AU - Brampton, Andrew

AU - Rai, Idris

AU - Mathy, Laurent

PY - 2006/3

Y1 - 2006/3

N2 - The advances in wireless networking and the consequent emergence of new applications that wireless networks increasingly support inevitably leads to low capability mobile nodes connecting to peer-to-peer networks. However, the characteristics of mobile nodes and limitations of access point coverage often cause mobile nodes to lose connectivity, which can cause many mobile nodes to simultaneously rejoin the network. Continuous departures and joins due to the mobility of nodes leads to mobility churn, which can often degrade the performance of the underlying peer-topeer network significantly. In this paper, we use simulations to demonstrate that the Stealth Distributed Hash Table (Stealth DHT) algorithm is ideally suited for networks with mobile nodes. By avoiding storing state in unreliable nodes, a Stealth DHT prevents mobile nodes from being used by other nodes to provide services. Consequently, Stealth DHTs eliminate the mobility churn effect and significantly reduce the amount of overhead as compared to a generic DHT. This paper demonstrates this using simulation results that compare the performance of Stealth DHTs to a generic DHT, Pastry.

AB - The advances in wireless networking and the consequent emergence of new applications that wireless networks increasingly support inevitably leads to low capability mobile nodes connecting to peer-to-peer networks. However, the characteristics of mobile nodes and limitations of access point coverage often cause mobile nodes to lose connectivity, which can cause many mobile nodes to simultaneously rejoin the network. Continuous departures and joins due to the mobility of nodes leads to mobility churn, which can often degrade the performance of the underlying peer-topeer network significantly. In this paper, we use simulations to demonstrate that the Stealth Distributed Hash Table (Stealth DHT) algorithm is ideally suited for networks with mobile nodes. By avoiding storing state in unreliable nodes, a Stealth DHT prevents mobile nodes from being used by other nodes to provide services. Consequently, Stealth DHTs eliminate the mobility churn effect and significantly reduce the amount of overhead as compared to a generic DHT. This paper demonstrates this using simulation results that compare the performance of Stealth DHTs to a generic DHT, Pastry.

KW - cs_eprint_id

KW - 1248 cs_uid

KW - 1

U2 - 10.1109/PERCOMW.2006.109

DO - 10.1109/PERCOMW.2006.109

M3 - Conference contribution/Paper

SP - 184

EP - 189

BT - PERCOMW '06 Proceedings of the 4th annual IEEE international conference on Pervasive Computing and Communications Workshops

T2 - 3rd International Workshop on Mobile Peer-to-Peer Computing (MP2P'06)

Y2 - 17 March 2006

ER -

Research

Electronic data

Text available via DOI:

Keywords