Maximizing the number of accepted flows in TDMA-based wireless ad hoc networks is APX-complete

Details Maximizing the number of accepted flows in TDMA-based wireless ad hoc networks is APX-complete Maximizing the number of accepted flows in TDMA-based wireless ad hoc networks is APX-complete

2009-04-08

arxiv.org/abs/0904.1243v1

Computer Science

Networking and Internet Architecture

Scientific paper

Full exploitation of the bandwidth resources of Wireless Networks is challenging because of the sharing of the radio medium among neighboring nodes. Practical algorithms and distributed schemes that tries to optimising the use of the network radio resources. In this technical report we present the proof that maximising the network capacity is is an APX Complete problem (not approximable within 1/(1 - 2^(-k)) - eps for eps > 0).

Affiliated with

Also associated with

No associations

Rating

Maximizing the number of accepted flows in TDMA-based wireless ad hoc networks is APX-complete 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 Maximizing the number of accepted flows in TDMA-based wireless ad hoc networks is APX-complete, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Maximizing the number of accepted flows in TDMA-based wireless ad hoc networks is APX-complete will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-213816