2015 IEEE 35th International Conference on Distributed Computing Systems 2015
DOI: 10.1109/icdcs.2015.77
|View full text |Cite
|
Sign up to set email alerts
|

Multi-path Based Avoidance Routing in Wireless Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2017
2017
2021
2021

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 9 publications
(1 citation statement)
references
References 20 publications
0
1
0
Order By: Relevance
“…Here, ⊕ denotes the XOR operation. 15 Then, each message piece is encrypted by a lightweight encryption method (such as data encryption standard [DES] 25 ) and an encryption key which is randomly selected from  available encryption keys e 1 , e 2 , … , e n , … , e  . The  encryption keys are reserved by OUSN nodes, and the eavesdroppers are assumed to decipher a captured message piece (encrypted by the nth encryption key) with the probability p n .…”
Section: Message Piecesmentioning
confidence: 99%
“…Here, ⊕ denotes the XOR operation. 15 Then, each message piece is encrypted by a lightweight encryption method (such as data encryption standard [DES] 25 ) and an encryption key which is randomly selected from  available encryption keys e 1 , e 2 , … , e n , … , e  . The  encryption keys are reserved by OUSN nodes, and the eavesdroppers are assumed to decipher a captured message piece (encrypted by the nth encryption key) with the probability p n .…”
Section: Message Piecesmentioning
confidence: 99%