Improved Interference in Wireless Sensor Networks

Given a set

${\cal V}$

of

n

sensor nodes distributed on a 2-dimensional plane and a source node

$s \in{\cal V}$

, the

interference problem

deals with assigning transmission range to each

$v \in{\cal V}$

such that the members in

${\cal V}$

maintain connectivity predicate

${\cal P}$

, and the maximum/total interference of the network is minimum. We propose algorithm for both

minimizing maximum interference

and

minimizing total interference

of the networks. For minimizing maximum interference we present optimum solution with running time

$O(({\cal P}_n + n^2) \log n)$

for connectivity predicate

${\cal P}$

like strong connectivity, broadcast (

s

is the source),

k

-edge(vertex) connectivity, spanner, where

$O({\cal P}_n)$

is the time complexity for checking the connectivity predicate

${\cal P}$

. The running time of the previous best known solution was

$O({\cal P}_n \times n^2)$

[3].

For minimizing total interference we propose optimum algorithm for the connectivity predicate broadcast. The running time of the propose algorithm is

O

(

n

). For the same problem, the previous best known result was 2(1 + ln (

n

 − 1))-factor approximation algorithm [3]. We also propose two heuristics for minimizing total interference in the case of strongly connected predicate and compare our results with the best result available in the literature. Experimental results demonstrate that our heuristic outperforms existing results.