A guided tour of Chernoff bounds
Information Processing Letters
Percolation theory and computing with faulty arrays of processors
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
The official PGP user's guide
Derandomizing algorithms for routing and sorting on meshes
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
The quest for security in mobile ad hoc networks
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
A key-management scheme for distributed sensor networks
Proceedings of the 9th ACM conference on Computer and communications security
Block Gossiping on Grids and Tori: Deterministic Sorting and Routing Match the Bisection Bound
ESA '93 Proceedings of the First Annual European Symposium on Algorithms
Self-Organized Public-Key Management for Mobile Ad Hoc Networks
IEEE Transactions on Mobile Computing
Random Key Predistribution Schemes for Sensor Networks
SP '03 Proceedings of the 2003 IEEE Symposium on Security and Privacy
A pairwise key pre-distribution scheme for wireless sensor networks
Proceedings of the 10th ACM conference on Computer and communications security
Degenerate delay-capacity tradeoffs in ad-hoc networks with Brownian mobility
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Securing Mobile Ad Hoc Networks with Certificateless Public Keys
IEEE Transactions on Dependable and Secure Computing
Capacity of multi-channel wireless networks with random (c, f) assignment
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Modeling pairwise key establishment for random key predistribution in large-scale sensor networks
IEEE/ACM Transactions on Networking (TON)
State of multi-hop wireless networking
Proceedings of the third ACM workshop on Challenged networks
The capacity of wireless networks
IEEE Transactions on Information Theory
A deterministic approach to throughput scaling in wireless networks
IEEE Transactions on Information Theory
Capacity and delay tradeoffs for ad hoc mobile networks
IEEE Transactions on Information Theory
Optimal throughput-delay scaling in wireless networks - part I: the fluid model
IEEE Transactions on Information Theory
Optimal Throughput–Delay Scaling in Wireless Networks—Part II: Constant-Size Packets
IEEE Transactions on Information Theory
Closing the Gap in the Capacity of Wireless Networks Via Percolation Theory
IEEE Transactions on Information Theory
Asymptotic Analysis on Secrecy Capacity in Large-Scale Wireless Networks
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.00 |
Security always comes with a price in terms of performance degradation, which should be carefully quantified. This is especially the case for wireless ad hoc networks (WANETs), which offer communications over a shared wireless channel without any preexisting infrastructure. Forming end-to-end secure paths in such WANETs is more challenging than in conventional networks due to the lack of central authorities, and its impact on network performance is largely untouched in the literature. In this paper, based on a general random network model, the asymptotic behaviors of secure throughput and delay with the common transmission range rn and the probability pf of neighboring nodes having a primary security association are quantified when the network size n is sufficiently large. The costs and benefits of secure-link-augmentation operations on the secure throughput and delay are also analyzed. In general, security has a cost: Since we require all the communications operate on secure links, there is a degradation in the network performance when pf pf is Ω(1/log n), the secure throughput remains at the Gupta and Kumar bound of Θ(1/√n log n) packets/time slot, wherein no security requirements are enforced on WANETs. This implies that even when the pf goes to zero as the network size becomes arbitrarily large, it is still possible to build throughput-order-optimal secure WANETs, which is of practical interest since pf is very small in many practical large-scale WANETs.