DocumentCode
3320470
Title
Bootstrapping chord in ad hoc networks not going anywhere for a while
Author
Cramer, Curt ; Fuhrmann, Thomas
Author_Institution
Syst. Archit. Group, Univ. Karlsruhe
fYear
2006
fDate
13-17 March 2006
Lastpage
172
Abstract
With the growing prevalence of wireless devices, infrastructure-less ad hoc networking is coming closer to reality. Research in this field has mainly been concerned with routing. However, to justify the relevance of ad hoc networks, there have to be applications. Distributed applications require basic services such as naming. In an ad hoc network, these services have to be provided in a decentralized way. We believe that structured peer-to-peer overlays are a good basis for their design. Prior work has been focused on the long-run performance of virtual peer-to-peer overlays over ad hoc networks. In this paper, we consider a vital functionality of any peer-to-peer network: bootstrapping. We formally show that the self-configuration process of a spontaneously deployed chord network has a time complexity linear in the network size. In addition to that, its centralized bootstrapping procedure causes an unfavorable traffic load imbalance
Keywords
ad hoc networks; computational complexity; peer-to-peer computing; ad hoc networks; centralized bootstrapping; chord bootstrapping chord; distributed applications; infrastructure-less ad hoc networking; naming services; virtual peer-to-peer overlays; Ad hoc networks; Intelligent networks; Internet; Large-scale systems; Peer to peer computing; Protocols; Routing; Spread spectrum communication; Telecommunication traffic; Wireless networks;
fLanguage
English
Publisher
ieee
Conference_Titel
Pervasive Computing and Communications Workshops, 2006. PerCom Workshops 2006. Fourth Annual IEEE International Conference on
Conference_Location
Pisa
Print_ISBN
0-7695-2520-2
Type
conf
DOI
10.1109/PERCOMW.2006.28
Filename
1598961
Link To Document