Stability of Random Admissible-Set Scheduling in Spatial Wireless Systems

Details Stability of Random Admissible-Set Scheduling in Spatial Wireless Systems Stability of Random Admissible-Set Scheduling in Spatial Wireless Systems

2010-12-15

arxiv.org/abs/1012.3364v1

Mathematics

Probability

Scientific paper

We examine the stability of wireless networks whose users are distributed over a compact space. Users arrive at spatially uniform locations with intensity l and each user has a random number of packets to transmit with mean b. In each time slot, an admissible subset of users is selected uniformly at random to transmit one packet. A subset of users is called admissible when their simultaneous activity obeys the prevailing interference constraints. We consider a wide class of interference constraints, including the SINR model and the protocol model. Denote by m the maximum number of users in an admissible subset for the model under consideration. We will show that the necessary condition l*b

Affiliated with

Also associated with

No associations

Rating

Stability of Random Admissible-Set Scheduling in Spatial Wireless Systems 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 Stability of Random Admissible-Set Scheduling in Spatial Wireless Systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Stability of Random Admissible-Set Scheduling in Spatial Wireless Systems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-14144