Some simple optimization techniques for self-organized public key management in mobile ad hoc networks

DOI10.1016/J.DAM.2005.12.002MaRDI QIDQ2495903zbMATH OpenOpenAlexFDO

Authors T. Bornand-Jaccard, David Schindl, Dominique De Werra

Publication date 30 June 2006

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2005.12.002

zbMATH Keywords

centercomplete graphsidentification in mobile networksstrongly connected graphs

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Cryptographic techniques for mobile ad-hoc networks
• Robust self-keying mobile ad hoc networks
• Complexity of increasing the secure connectivity in wireless ad hoc networks
• Modified autonomous key management scheme with reduced communication/computation costs in MANET
• Efficient and robust key management for large mobile ad hoc networks

Cites work

• Future paths for integer programming and links to artificial intelligence
• Tabu Search—Part I
• Tabu Search—Part II

Cited in

(2)

• Cryptographic techniques for mobile ad-hoc networks
• Complexity of increasing the secure connectivity in wireless ad hoc networks

This page was built for publication: Some simple optimization techniques for self-organized public key management in mobile ad hoc networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2495903)