Minimizing Interference for the Highway Model in Wireless Ad-Hoc and Sensor Networks

Tan, Haisheng; Lou, Tiancheng; Lau, Francis C. M.; Wang, Yuexuan; Chen, Shiteng

doi:10.1007/978-3-642-18381-2_43

“…Buchin [5] showed that finding an optimal solution (one whose maximum interference is exactly OPT(P )) is NPcomplete in the plane. Tan et al [29] gave an O(n 3 n O(OPT(P )) )-time algorithm for finding an optimal solution for any given set of points P on a line. Kranakis et al [19] showed that for any set of n points P selected uniformly at random from the unit interval, the maximum interference of the nearest-neighbour path (MST(P ) ) has maximum interference Θ( √ log n) with high probability.…”

Section: Related Workmentioning

confidence: 99%

“…In addition to results that examine the problem of minimizing the maximum interference, some work has addressed the problem of minimizing the average interference, e.g., Tan et al [29] and Moscibroda and Wattenhofer [24].…”

Section: Related Workmentioning

confidence: 99%

Bounding Interference in Wireless Ad Hoc Networks With Nodes in Random Position

Khabbazian

¹

,

Durocher

²

,

Haghnegahdar

³

et al. 2015

IEEE/ACM Trans. Networking

6

0

View full text Add to dashboard Cite

Abstract. Given a set of positions for wireless nodes, the interference minimization problem is to assign a transmission radius (equivalently, a power level) to each node such that the resulting communication graph is connected, while minimizing the maximum interference. We consider the model introduced by von Rickenbach et al. (2005), in which each transmission range is represented by a ball and edges in the communication graph are symmetric. The problem is NP-complete in two dimensions (Buchin 2008) and no polynomial-time approximation algorithm is known. In this paper we show how to solve the problem efficiently in settings typical for wireless ad hoc networks. We show that if node positions are represented by a set P of n points selected uniformly and independently at random over a d-dimensional rectangular region, for any fixed d, then the topology given by the closure of the Euclidean minimum spanning tree of P has maximum interference O(log n) with high probability. We extend this bound to a general class of communication graphs over a broad set of probability distributions. We present a local algorithm that constructs a graph from this class; this is the first local algorithm to provide an upper bound on the expected maximum interference. Finally, we analyze an empirical evaluation of our algorithm by simulation.

show abstract

“…Tan et al [12] studied minimization of the average interference and the maximum interference for the highway model, where all the nodes are arbitrarily distributed on a line. For the minimum average interference problem they proposed an exact algorithm, which runs in O(n 3 ∆ 3 ) time, where n is the number of nodes and ∆ is the maximum node degree in the communication graph for the equal range assigned to each nodes equal to the maximum consecutive distance between two nodes.…”

Section: Related Workmentioning

confidence: 99%

Improved Interference in Wireless Sensor Networks

Agrawal

¹

,

Das

²

2013

Distributed Computing and Internet Technology

View full text Add to dashboard Cite

Given a set V of n sensor node distributed on a 2-dimensional plane and a source node s ∈ V, the interference problem deals with assigning transmission range to each v ∈ V such that the members in V maintain connectivity predicate P, and the maximum/total interference 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((Pn + n 2 ) log n) for connectivity predicate P like strong connectivity, broadcast (s is the source), k-edge(vertex) connectivity, spanner, where O(Pn) is the time complexity for checking the connectivity predicate P. The running time of the previous best known solution was O(Pn × n 2 ) [3]. For the 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 a heuristic for minimizing total interference in the case of strongly connected predicate and compare our result with the best result available in the literature. Experimental results demonstrate that our heuristic outperform existing result.

show abstract

“…Buchin [5] showed that finding an optimal solution (one whose maximum interference is exactly OPT(P )) is NP-complete in the plane. Tan et al [29] gave an O(n 3 n O(OPT(P )) )-time algorithm for finding an optimal solution for any given set of points P on a line. Kranakis et al [20] showed that for any set of points P selected uniformly at random from the unit interval, the maximum interference of the nearest-neighbour path (MST) has maximum interference Θ( √ log n) with high probability.…”

Section: Bidirectional Interference Modelmentioning

confidence: 99%

Bounding Interference in Wireless Ad Hoc Networks with Nodes in Random Position

Khabbazian

¹

,

Durocher

²

,

Haghnegahdar

³

2012

Structural Information and Communication Complexity

View full text Add to dashboard Cite

Abstract. Given a set of positions for wireless nodes, the interference minimization problem is to assign a transmission radius (equivalently, a power level) to each node such that the resulting communication graph is connected, while minimizing the maximum interference. We consider the model introduced by von Rickenbach et al. (2005), in which each transmission range is represented by a ball and edges in the communication graph are symmetric. The problem is NP-complete in two dimensions (Buchin 2008) and no polynomial-time approximation algorithm is known. In this paper we show how to solve the problem efficiently in settings typical for wireless ad hoc networks. We show that if node positions are represented by a set P of n points selected uniformly and independently at random over a d-dimensional rectangular region, for any fixed d, then the topology given by the closure of the Euclidean minimum spanning tree of P has maximum interference O(log n) with high probability. We extend this bound to a general class of communication graphs over a broad set of probability distributions. We present a local algorithm that constructs a graph from this class; this is the first local algorithm to provide an upper bound on the expected maximum interference. Finally, we analyze an empirical evaluation of our algorithm by simulation.

show abstract

Minimizing Interference for the Highway Model in Wireless Ad-Hoc and Sensor Networks

Cited by 9 publications

References 13 publications

Bounding Interference in Wireless Ad Hoc Networks With Nodes in Random Position

Bounding Interference in Wireless Ad Hoc Networks With Nodes in Random Position

Improved Interference in Wireless Sensor Networks

Bounding Interference in Wireless Ad Hoc Networks with Nodes in Random Position

Contact Info

Product

Resources

About