Secrecy Transfer
Suppose that n nodes with n 0 acquaintances per node are randomly deployed in a two-dimensional Euclidean space with the geographic restriction that each pair of nodes can exchange information between them directly only if the distance between them is at most r , the acquaintanceship between nodes f...
Saved in:
| Main Authors: | Zhihong Liu, Jianfeng Ma, Yong Zeng, Li Yang, YoungHo Park |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2012-07-01
|
| Series: | International Journal of Distributed Sensor Networks |
| Online Access: | https://doi.org/10.1155/2012/847805 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Cryptographic secrecy of steganographic matrix encoding
by: Jia-yong CHEN, et al.
Published: (2012-06-01) -
Spectral efficiency and secrecy enhancing scheme for IRS-aided SWIPT systems
by: Jianfeng Xu, et al.
Published: (2025-01-01) -
Information, Secrecy, and Falsehood
by: Pierre Le Morvan
Published: (2025-01-01) -
Trust Administration: Secrecy and Responsibility
by: Derek Davies
Published: (1995-01-01) -
On Secrecy Performance of Mixed RF-FSO Systems
by: Hongjiang Lei, et al.
Published: (2017-01-01)