Please use this identifier to cite or link to this item: http://localhost/handle/Hannan/660834
Full metadata record
DC FieldValueLanguage
dc.contributor.authorXuanyu Caoen_US
dc.contributor.authorJinbei Zhangen_US
dc.contributor.authorLuoyi Fuen_US
dc.contributor.authorWeijie Wuen_US
dc.contributor.authorXinbing Wangen_US
dc.date.accessioned2020-05-20T10:41:10Z-
dc.date.available2020-05-20T10:41:10Z-
dc.date.issued2016en_US
dc.identifier.issn1063-6692en_US
dc.identifier.issn1558-2566en_US
dc.identifier.other10.1109/TNET.2015.2405793en_US
dc.identifier.urihttp://localhost/handle/Hannan/154683en_US
dc.identifier.urihttp://localhost/handle/Hannan/660834-
dc.description.abstractIn this paper, we investigate the impact of information-theoretic secrecy constraint on the capacity and delay of mobile ad hoc networks (MANETs) with mobile legitimate nodes and static eavesdroppers whose location and channel state information (CSI) are both unknown. We assume n legitimate nodes move according to the fast i.i.d. mobility pattern and each desires to communicate with one randomly selected destination node. There are also nν static eavesdroppers located uniformly in the network and we assume the number of eavesdroppers is much larger than that of legitimate nodes, i.e., ν > 1. We propose a novel simple secure communication model, i.e., the secure protocol model, and prove its equivalence to the widely accepted secure physical model under a few technical assumptions. Based on the proposed model, a framework of analyzing the secrecy capacity and delay in MANETs is established. Given a delay constraint D, we find that the optimal secrecy throughput capacity is ~Θ(W((D/n))(2/3) ), where W is the data rate of each link. We observe that: 1) the capacity-delay tradeoff is independent of the number of eavesdroppers, which indicates that adding more eavesdroppers will not degenerate the performance of the legitimate network as long as ν > 1; 2) the capacity-delay tradeoff of our paper outperforms the previous result Θ((1/nψe)) in , where ψe=nν-1 =ω(1) is the density of the eavesdroppers. Throughout this paper, for functions f and g, we denote f=o(g) if limn→∞(f/g)=0; f=ω(g) if g=o(f); f=O(g) if there is a positive constant c such that f ≤ cg for sufficiently large n; f=Ω(g) if g=O(f); f=Θ(g) if both f=O(g) and f=Ω(g) hold. Besides, the order notation ~Θ omits the polylogarithmic factors for better readability.en_US
dc.publisherIEEEen_US
dc.relation.haspart7076660.pdfen_US
dc.subjectsecrecy constrainten_US
dc.subjectmobile ad hoc networks (MANETs)en_US
dc.subjectCapacity–delay tradeoffen_US
dc.titleOptimal Secrecy Capacity-Delay Tradeoff in Large-Scale Mobile Ad Hoc Networksen_US
dc.typeArticleen_US
dc.journal.volume24en_US
dc.journal.issue2en_US
dc.journal.titleIEEE/ACM Transactions on Networkingen_US
Appears in Collections:2016

Files in This Item:
File Description SizeFormat 
7076660.pdf2.57 MBAdobe PDFThumbnail
Preview File
Full metadata record
DC FieldValueLanguage
dc.contributor.authorXuanyu Caoen_US
dc.contributor.authorJinbei Zhangen_US
dc.contributor.authorLuoyi Fuen_US
dc.contributor.authorWeijie Wuen_US
dc.contributor.authorXinbing Wangen_US
dc.date.accessioned2020-05-20T10:41:10Z-
dc.date.available2020-05-20T10:41:10Z-
dc.date.issued2016en_US
dc.identifier.issn1063-6692en_US
dc.identifier.issn1558-2566en_US
dc.identifier.other10.1109/TNET.2015.2405793en_US
dc.identifier.urihttp://localhost/handle/Hannan/154683en_US
dc.identifier.urihttp://localhost/handle/Hannan/660834-
dc.description.abstractIn this paper, we investigate the impact of information-theoretic secrecy constraint on the capacity and delay of mobile ad hoc networks (MANETs) with mobile legitimate nodes and static eavesdroppers whose location and channel state information (CSI) are both unknown. We assume n legitimate nodes move according to the fast i.i.d. mobility pattern and each desires to communicate with one randomly selected destination node. There are also nν static eavesdroppers located uniformly in the network and we assume the number of eavesdroppers is much larger than that of legitimate nodes, i.e., ν > 1. We propose a novel simple secure communication model, i.e., the secure protocol model, and prove its equivalence to the widely accepted secure physical model under a few technical assumptions. Based on the proposed model, a framework of analyzing the secrecy capacity and delay in MANETs is established. Given a delay constraint D, we find that the optimal secrecy throughput capacity is ~Θ(W((D/n))(2/3) ), where W is the data rate of each link. We observe that: 1) the capacity-delay tradeoff is independent of the number of eavesdroppers, which indicates that adding more eavesdroppers will not degenerate the performance of the legitimate network as long as ν > 1; 2) the capacity-delay tradeoff of our paper outperforms the previous result Θ((1/nψe)) in , where ψe=nν-1 =ω(1) is the density of the eavesdroppers. Throughout this paper, for functions f and g, we denote f=o(g) if limn→∞(f/g)=0; f=ω(g) if g=o(f); f=O(g) if there is a positive constant c such that f ≤ cg for sufficiently large n; f=Ω(g) if g=O(f); f=Θ(g) if both f=O(g) and f=Ω(g) hold. Besides, the order notation ~Θ omits the polylogarithmic factors for better readability.en_US
dc.publisherIEEEen_US
dc.relation.haspart7076660.pdfen_US
dc.subjectsecrecy constrainten_US
dc.subjectmobile ad hoc networks (MANETs)en_US
dc.subjectCapacity–delay tradeoffen_US
dc.titleOptimal Secrecy Capacity-Delay Tradeoff in Large-Scale Mobile Ad Hoc Networksen_US
dc.typeArticleen_US
dc.journal.volume24en_US
dc.journal.issue2en_US
dc.journal.titleIEEE/ACM Transactions on Networkingen_US
Appears in Collections:2016

Files in This Item:
File Description SizeFormat 
7076660.pdf2.57 MBAdobe PDFThumbnail
Preview File
Full metadata record
DC FieldValueLanguage
dc.contributor.authorXuanyu Caoen_US
dc.contributor.authorJinbei Zhangen_US
dc.contributor.authorLuoyi Fuen_US
dc.contributor.authorWeijie Wuen_US
dc.contributor.authorXinbing Wangen_US
dc.date.accessioned2020-05-20T10:41:10Z-
dc.date.available2020-05-20T10:41:10Z-
dc.date.issued2016en_US
dc.identifier.issn1063-6692en_US
dc.identifier.issn1558-2566en_US
dc.identifier.other10.1109/TNET.2015.2405793en_US
dc.identifier.urihttp://localhost/handle/Hannan/154683en_US
dc.identifier.urihttp://localhost/handle/Hannan/660834-
dc.description.abstractIn this paper, we investigate the impact of information-theoretic secrecy constraint on the capacity and delay of mobile ad hoc networks (MANETs) with mobile legitimate nodes and static eavesdroppers whose location and channel state information (CSI) are both unknown. We assume n legitimate nodes move according to the fast i.i.d. mobility pattern and each desires to communicate with one randomly selected destination node. There are also nν static eavesdroppers located uniformly in the network and we assume the number of eavesdroppers is much larger than that of legitimate nodes, i.e., ν > 1. We propose a novel simple secure communication model, i.e., the secure protocol model, and prove its equivalence to the widely accepted secure physical model under a few technical assumptions. Based on the proposed model, a framework of analyzing the secrecy capacity and delay in MANETs is established. Given a delay constraint D, we find that the optimal secrecy throughput capacity is ~Θ(W((D/n))(2/3) ), where W is the data rate of each link. We observe that: 1) the capacity-delay tradeoff is independent of the number of eavesdroppers, which indicates that adding more eavesdroppers will not degenerate the performance of the legitimate network as long as ν > 1; 2) the capacity-delay tradeoff of our paper outperforms the previous result Θ((1/nψe)) in , where ψe=nν-1 =ω(1) is the density of the eavesdroppers. Throughout this paper, for functions f and g, we denote f=o(g) if limn→∞(f/g)=0; f=ω(g) if g=o(f); f=O(g) if there is a positive constant c such that f ≤ cg for sufficiently large n; f=Ω(g) if g=O(f); f=Θ(g) if both f=O(g) and f=Ω(g) hold. Besides, the order notation ~Θ omits the polylogarithmic factors for better readability.en_US
dc.publisherIEEEen_US
dc.relation.haspart7076660.pdfen_US
dc.subjectsecrecy constrainten_US
dc.subjectmobile ad hoc networks (MANETs)en_US
dc.subjectCapacity–delay tradeoffen_US
dc.titleOptimal Secrecy Capacity-Delay Tradeoff in Large-Scale Mobile Ad Hoc Networksen_US
dc.typeArticleen_US
dc.journal.volume24en_US
dc.journal.issue2en_US
dc.journal.titleIEEE/ACM Transactions on Networkingen_US
Appears in Collections:2016

Files in This Item:
File Description SizeFormat 
7076660.pdf2.57 MBAdobe PDFThumbnail
Preview File