By Topic

On the two-dimensional coverage area in broadcast ad hoc networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Xianbo Chen ; BroadCom, San Diego, CA, USA ; Oorjitham, J. ; Xiaomin Ma

First, we observe that several analyses of two-dimensional (2-D) broadcast ad hoc networks, such as hidden (exposed) terminal analysis and multi-hop broadcast coverage etc., require computation of an extended coverge area. The coverage area computation is not straightforward or trivial given nodes distributed in a 2-D area. In this paper, we define and formulate a geometric two-dimensional coverage area computation problem that is critical to three types of network analyses. Then, an effective algorithm is proposed to solve the problem. Given positions of the nodes, the defined coverage area can be derived through addressing intersection points of any two contour functions, finding the outmost intersection points, determining the outmost contour, and calculating the coverage area. Effectiveness and complexity of this proposed algorithm are verified and analyzed.

Published in:

Wireless Days (WD), 2011 IFIP

Date of Conference:

10-12 Oct. 2011