《Table1 Notations and definitions》
提示：宽带有限、当前游客访问压缩模式
本系列图表出处文件名：随高清版一同展现
《Study on key management scheme for heterogeneous wireless sensor networks》
Assume that there is no shared-key between node u and 1-d-hop neighbor nodes，where d is a system parameter.A request message containing node u’s ID will be sent to BS by CH；then，BS sends a corresponding key encrypted by KHto CH.After acquiring the key from BS，for each pair of neighbor nodes u and v，a pair-wise key Ku，vwill be generated and unicasted to u and v，noted as CH→u:{Ku，v}Ku，CH→v:{Ku，v}Kv，so that node u and v will acquire the sharedkey Ku，vand can communicate securely.
| 图表编号 | XD0020604600 严禁用于非法目的 |
|---|---|
| 绘制时间 | 2018.12.01 |
| 作者 | 秦丹阳、Ma Jingya、Zhang Yan、Yang Songxiang、Ji Ping、Feng Pan |
| 绘制单位 | Key Lab of Electronic and Communication Engineering,Heilongjiang University、Key Lab of Electronic and Communication Engineering,Heilongjiang University、Key Lab of Electronic and Communication Engineering,Heilongjiang University、Key Lab of Electronic and C |
| 更多格式 | 高清、无水印（增值服务） |
