Pub Date : 2009-02-25DOI: 10.1109/WIOPT.2009.5291573
Z. Kong, E. Yeh
We study the problem of wireless network resilience to node failures from a percolation-based perspective. In practical wireless networks, it is often the case that the failure probability of a node depends on its degree (number of neighbors). We model this phenomenon as a degree-dependent site percolation process on random geometric graphs. In particular, we obtain analytical conditions for the existence of phase transitions within this model. Furthermore, in networks carrying traffic load, the failure of one node can result in redistribution of the load onto other nearby nodes. If these nodes fail due to excessive load, then this process can result in a cascading failure. Using a simple but descriptive model, we show that the cascading failure problem for large-scale wireless networks is equivalent to a degree-dependent site percolation on random geometric graphs. We obtain analytical conditions for cascades in this model. This work represents the first investigation of cascading phenomena in networks with geometric constraints.
{"title":"Wireless network resilience to degree-dependent and cascading node failures","authors":"Z. Kong, E. Yeh","doi":"10.1109/WIOPT.2009.5291573","DOIUrl":"https://doi.org/10.1109/WIOPT.2009.5291573","url":null,"abstract":"We study the problem of wireless network resilience to node failures from a percolation-based perspective. In practical wireless networks, it is often the case that the failure probability of a node depends on its degree (number of neighbors). We model this phenomenon as a degree-dependent site percolation process on random geometric graphs. In particular, we obtain analytical conditions for the existence of phase transitions within this model. Furthermore, in networks carrying traffic load, the failure of one node can result in redistribution of the load onto other nearby nodes. If these nodes fail due to excessive load, then this process can result in a cascading failure. Using a simple but descriptive model, we show that the cascading failure problem for large-scale wireless networks is equivalent to a degree-dependent site percolation on random geometric graphs. We obtain analytical conditions for cascades in this model. This work represents the first investigation of cascading phenomena in networks with geometric constraints.","PeriodicalId":143632,"journal":{"name":"2009 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks","volume":"01 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-02-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130725221","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-08-15DOI: 10.1109/WIOPT.2009.5291646
Kaibin Huang, V. Lau, Yan Chen
Spectrum sharing between wireless networks improves the usage efficiency of radio spectrums. This paper addresses spectrum sharing between a cellular uplink and a mobile ad hoc networks. These networks use either all uplink frequency subchannels or their disjoint subsets, called spectrum underlay and spectrum overlay, respectively. Given these methods, the capacity tradeoff between the coexisting networks is analyzed in terms of transmission capacity. For a network with Poisson distributed transmitters, this metric is defined as the maximum density of transmitters subject to an outage constraint for a given signal-to-interference ratio (SIR). Using stochastic geometry, the transmission-capacity tradeoff between the coexisting networks is derived, where both spectrum overlay and underlay as well as successive interference cancelation (SIC) are considered. In particular, for small target outage probability, the transmission capacities of the coexisting networks are proved to satisfy a linear equation. Its coefficients depend on the spectrum sharing method and whether SIC is applied. This linear equation shows that spectrum overlay is more efficient than spectrum underlay.
{"title":"Spectrum sharing between cellular and mobile ad hoc networks: Transmission-capacity tradeoff","authors":"Kaibin Huang, V. Lau, Yan Chen","doi":"10.1109/WIOPT.2009.5291646","DOIUrl":"https://doi.org/10.1109/WIOPT.2009.5291646","url":null,"abstract":"Spectrum sharing between wireless networks improves the usage efficiency of radio spectrums. This paper addresses spectrum sharing between a cellular uplink and a mobile ad hoc networks. These networks use either all uplink frequency subchannels or their disjoint subsets, called spectrum underlay and spectrum overlay, respectively. Given these methods, the capacity tradeoff between the coexisting networks is analyzed in terms of transmission capacity. For a network with Poisson distributed transmitters, this metric is defined as the maximum density of transmitters subject to an outage constraint for a given signal-to-interference ratio (SIR). Using stochastic geometry, the transmission-capacity tradeoff between the coexisting networks is derived, where both spectrum overlay and underlay as well as successive interference cancelation (SIC) are considered. In particular, for small target outage probability, the transmission capacities of the coexisting networks are proved to satisfy a linear equation. Its coefficients depend on the spectrum sharing method and whether SIC is applied. This linear equation shows that spectrum overlay is more efficient than spectrum underlay.","PeriodicalId":143632,"journal":{"name":"2009 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134629380","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：