Worst case time requirement to cover a secure ad-hoc wireless network under full visibility
Worst case time requirement to cover a secure ad-hoc wireless network under full visibility
- Author(s): B. Gupta and S.S. Lamba
- DOI: 10.1049/cp.2014.1394
For access to this article, please select a purchase option:
Buy conference paper PDF
Buy Knowledge Pack
IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.
International Conference on Frontiers of Communications, Networks and Applications (ICFCNA 2014 - Malaysia) — Recommend this title to your library
Thank you
Your recommendation has been sent to your librarian.
- Author(s): B. Gupta and S.S. Lamba Source: International Conference on Frontiers of Communications, Networks and Applications (ICFCNA 2014 - Malaysia), 2014 page ()
- Conference: International Conference on Frontiers of Communications, Networks and Applications (ICFCNA 2014 - Malaysia)
- DOI: 10.1049/cp.2014.1394
- ISBN: 978-1-78561-072-1
- Location: Kuala Lumpur, Malaysia
- Conference date: 3-5 Nov. 2014
- Format: PDF
In this work our focus is on the cover time analysis of a secure ad-hoc wireless network, when the nodes are allowed to move within a compact space. We consider a secure wireless random network in 2-dimensional space, and a sequence Xn = {X1, X2,…Xn}, with n nodes distributed uniformly over a compact space C ⊂ R2. We derive a strong law result for the cover time of the network and proved that for key pool of order of n log n and key ring of order of log n, the cover time of the network is of order of n5/2/(log n)2 almost surely.
Inspec keywords: ad hoc networks
Subjects: Radio links and equipment
Related content
content/conferences/10.1049/cp.2014.1394
pub_keyword,iet_inspecKeyword,pub_concept
6
6