An Algorithmic Solution for Computing Circle Intersection Areas and its Applications to Wireless Communications

Details An Algorithmic Solution for Computing Circle Intersection Areas and its Applications to Wireless Communications An Algorithmic Solution for Computing Circle Intersection Areas and its Applications to Wireless Communications

2012-04-16

arxiv.org/abs/1204.3569v1

Computer Science

Computational Geometry

Scientific paper

A novel iterative algorithm for the efficient computation of the intersection areas of an arbitrary number of circles is presented. The algorithm, based on a trellis-structure, hinges on two geometric results which allow the existence-check and the computation of the area of the intersection regions generated by more than three circles by simple algebraic manipulations of the intersection areas of a smaller number of circles. The presented algorithm is a powerful tool for the performance analysis of wireless networks, and finds many applications, ranging from sensor to cellular networks. As an example of practical application, an insightful study of the uplink outage probability of in a wireless network with cooperative access points as a function of the transmission power and access point density is presented.

Affiliated with

Also associated with

No associations

Rating

An Algorithmic Solution for Computing Circle Intersection Areas and its Applications to Wireless Communications 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 An Algorithmic Solution for Computing Circle Intersection Areas and its Applications to Wireless Communications, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Algorithmic Solution for Computing Circle Intersection Areas and its Applications to Wireless Communications will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-7177