閱讀全文 | |
篇名 |
Disjoint Multipath based Secure Routing in Opportunistic Networks
|
---|---|
並列篇名 | Disjoint Multipath based Secure Routing in Opportunistic Networks |
作者 | Sanjay K. Dhurandher、Jagdeep Singh、Isaac Woungang、Joel J. P. C. Rodrigues |
英文摘要 | Opportunistic Networks (OppNets) are composed of wireless nodes opportunistically communicating with each other. These networks are designed to operate in a challenging environment characterized by high delay, intermittent connectivity, and no-guarantee of fixed path between the sender and destination nodes. One of the most vital issues in designing such a network is the security of the messages flowing in it. This paper proposes a new method called Disjoint Multipath based Secure Routing in Opportunistic Networks, called as DMUST, which relays the message to the destination through four disjoint paths; each applying a softencryption technique to prevent message fabrication attacks. Simulations are conducted using the HAGGLE INFOCOM 2006 real mobility data traces, showing that when time-to-live is varied, (1) the proposed D-MUST scheme outperforms RSASec by 15.05%, 8.4%, 5.81% 2.16% respectively in terms of delivery probability, hop count, messages dropped and average latency; (2) it also outperforms SHBPR by 16.17%, 9.2%, 6.85%, 3.95% respectively in terms of delivery probability, hop count, messages dropped and average latency. |
起訖頁 | 1683-1692 |
關鍵詞 | Opportunistic Networks (OppNets)、Security、Routing、Disjoint Path、Real Mobility Data Traces |
刊名 | 網際網路技術學刊 |
期數 | 201911 (20:6期) |
出版單位 | 台灣學術網路管理委員會 |
DOI |
|
QR Code | |
該期刊 下一篇
| A Novel Solution for Simultaneously Finding the Shortest and Possible Paths in Complex Networks |