Computer Science – Networking and Internet Architecture
Scientific paper
2009-02-25
Computer Science
Networking and Internet Architecture
Scientific paper
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.
Kong Zhenning
Yeh Edmund M.
No associations
LandOfFree
Percolation Processes and Wireless Network Resilience to Degree-Dependent and Cascading Node Failures does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Percolation Processes and Wireless Network Resilience to Degree-Dependent and Cascading Node Failures, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Percolation Processes and Wireless Network Resilience to Degree-Dependent and Cascading Node Failures will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-158372