Power-aware routing in mobile ad hoc networks
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Secure group communications using key graphs
IEEE/ACM Transactions on Networking (TON)
Key management for restricted multicast using broadcast encryption
IEEE/ACM Transactions on Networking (TON)
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Cryptography: Theory and Practice
Cryptography: Theory and Practice
Mobility increases the capacity of ad hoc wireless networks
IEEE/ACM Transactions on Networking (TON)
A key-management scheme for distributed sensor networks
Proceedings of the 9th ACM conference on Computer and communications security
Self-Organized Public-Key Management for Mobile Ad Hoc Networks
IEEE Transactions on Mobile Computing
ANODR: anonymous on demand routing with untraceable routes for mobile ad-hoc networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Random Key Predistribution Schemes for Sensor Networks
SP '03 Proceedings of the 2003 IEEE Symposium on Security and Privacy
Security in wireless sensor networks
Communications of the ACM - Wireless sensor networks
IEEE Security and Privacy
Multiple Access Protocol for Power-Controlled Wireless Access Nets
IEEE Transactions on Mobile Computing
Anonymous Secure Routing in Mobile Ad-Hoc Networks
LCN '04 Proceedings of the 29th Annual IEEE International Conference on Local Computer Networks
SDAR: A Secure Distributed Anonymous Routing Protocol for Wireless and Mobile Ad Hoc Networks
LCN '04 Proceedings of the 29th Annual IEEE International Conference on Local Computer Networks
AO2P: Ad Hoc On-Demand Position-Based Private Routing Protocol
IEEE Transactions on Mobile Computing
Location-Aware Combinatorial Key Management Scheme for Clustered Sensor Networks
IEEE Transactions on Parallel and Distributed Systems
JET: dynamic join-exit-tree amortization and scheduling for contributory key management
IEEE/ACM Transactions on Networking (TON)
Power-controlled matiple access schemes for next-generation wireless packet networks
IEEE Wireless Communications
Joint scheduling and power control for wireless ad hoc networks
IEEE Transactions on Wireless Communications
The capacity of wireless networks
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Capacity and delay tradeoffs for ad hoc mobile networks
IEEE Transactions on Information Theory
Energy optimal control for time-varying wireless networks
IEEE Transactions on Information Theory
Toward self-organized mobile ad hoc networks: the terminodes project
IEEE Communications Magazine
Dynamic power allocation and routing for time-varying wireless networks
IEEE Journal on Selected Areas in Communications
Optimum power allocation against information leakage in wireless network
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Optimum routing protection against cumulative eavesdropping in multihop wireless networks
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
Ensuring security and availability through model-based cross-layer adaptation
UIC'11 Proceedings of the 8th international conference on Ubiquitous intelligence and computing
Literature Survey on Power Control Algorithms for Mobile Ad-hoc Network
Wireless Personal Communications: An International Journal
A dynamic TDMA based scheme for securing query processing in WSN
Wireless Networks
Maximizing availability of content in disruptive environments by cross-layer optimization
Proceedings of the 28th Annual ACM Symposium on Applied Computing
| Hi-index | 14.98 |
To defend against reconnaissance activity in ad hoc wireless networks, we propose transmission power control as an effective mechanism for minimizing the eavesdropping risk. Our main contributions are given as follows. First, we cast the wth-order eavesdropping risk as the maximum probability of packets being eavesdropped when there are w adversarial nodes in the network. Second, we derive the closed-form solution of the first-order eavesdropping risk as a polynomial function of the normalized transmission radius. This derivation assumes a uniform distribution of user nodes. Then, we generalize the model to allow arbitrary user nodes distribution and prove that the uniform user distribution minimizes the first-order eavesdropping risk. This result plays an essential role in deriving analytical bounds for the eavesdropping risk given arbitrary user distributions. Our simulation results show that, for a wide range of nonuniform traffic patterns, the difference in their eavesdropping risk values from the corresponding lower bounds is 3 dB or less.