By Topic

Interference Minimization in Wireless 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
$33 $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

2 Author(s)
Aslanyan, H. ; Comput. Sci. Dept., Univ. of Geneva, Geneva, Switzerland ; Rolim, J.

Interference minimization problem in wireless sensor and ad-hoc networks are considered. That is to assign a transmission radius to each node of a network, to make it connected and at the same time to minimize the maximum number of overlapping transmission ranges on each node of a network. Additional means of topology control besides the connectivity is blocking the long line connections at the receiver level. We propose a polynomial time approximation algorithm which finds a connected network with at most O((opt In n)2) interference where opt is the minimal interference of the given network of n nodes. The lower bound for this problem, where a general distance function is considered, has been proven to be O(ln n). The algorithm is known which finds a network where the maximum interference is bounded by O(√n).

Published in:

Embedded and Ubiquitous Computing (EUC), 2010 IEEE/IFIP 8th International Conference on

Date of Conference:

11-13 Dec. 2010