DocumentCode
456186
Title
Compact routing discovery protocol with lower communication complexity
Author
Zhu, Huafei ; Bao, Feng ; Chigan, Chunxiao Tricia
Author_Institution
Inst. for Infocomm Res.
Volume
1
fYear
2006
fDate
3-6 April 2006
Firstpage
307
Lastpage
310
Abstract
In this paper, we first propose almost optimal sequential aggregate signatures in the simulation-based paradigm. We then provide an immediate application of the new primitive to construct compact routing discovery protocols
Keywords
communication complexity; routing protocols; communication complexity; compact routing discovery protocol; optimal sequential aggregate signatures; simulation-based paradigm; Aggregates; Application software; Communication system security; Complexity theory; Computational modeling; Computer simulation; Cryptographic protocols; Drives; Mobile ad hoc networks; Routing protocols;
fLanguage
English
Publisher
ieee
Conference_Titel
Wireless Communications and Networking Conference, 2006. WCNC 2006. IEEE
Conference_Location
Las Vegas, NV
ISSN
1525-3511
Print_ISBN
1-4244-0269-7
Electronic_ISBN
1525-3511
Type
conf
DOI
10.1109/WCNC.2006.1683482
Filename
1683482
Link To Document