4 research outputs found

    Bounded-Angle Spanning Tree: Modeling Networks with Angular Constraints

    Full text link
    We introduce a new structure for a set of points in the plane and an angle α\alpha, which is similar in flavor to a bounded-degree MST. We name this structure α\alpha-MST. Let PP be a set of points in the plane and let 0<α≤2π0 < \alpha \le 2\pi be an angle. An α\alpha-ST of PP is a spanning tree of the complete Euclidean graph induced by PP, with the additional property that for each point p∈Pp \in P, the smallest angle around pp containing all the edges adjacent to pp is at most α\alpha. An α\alpha-MST of PP is then an α\alpha-ST of PP of minimum weight. For α<π/3\alpha < \pi/3, an α\alpha-ST does not always exist, and, for α≥π/3\alpha \ge \pi/3, it always exists. In this paper, we study the problem of computing an α\alpha-MST for several common values of α\alpha. Motivated by wireless networks, we formulate the problem in terms of directional antennas. With each point p∈Pp \in P, we associate a wedge WpW_p of angle α\alpha and apex pp. The goal is to assign an orientation and a radius rpr_p to each wedge WpW_p, such that the resulting graph is connected and its MST is an α\alpha-MST. (We draw an edge between pp and qq if p∈Wqp \in W_q, q∈Wpq \in W_p, and ∣pq∣≤rp,rq|pq| \le r_p, r_q.) Unsurprisingly, the problem of computing an α\alpha-MST is NP-hard, at least for α=π\alpha=\pi and α=2π/3\alpha=2\pi/3. We present constant-factor approximation algorithms for α=π/2,2π/3,π\alpha = \pi/2, 2\pi/3, \pi. One of our major results is a surprising theorem for α=2π/3\alpha = 2\pi/3, which, besides being interesting from a geometric point of view, has important applications. For example, the theorem guarantees that given any set PP of 3n3n points in the plane and any partitioning of the points into nn triplets, one can orient the wedges of each triplet {\em independently}, such that the graph induced by PP is connected. We apply the theorem to the {\em antenna conversion} problem

    Impact of directional antennas on routing and neighbor discovery in wireless ad-hoc networks

    Get PDF
    Wireless ad-hoc networks are data networks that are deployed without a fixed infrastructure nor central controllers such as access points or base stations. In these networks, data packets are forwarded directly to the destination node if they are within the transmission range of the sender or sent through a multi-hop path of intermediary nodes that act as relays. This paradigm where a fixed infrastructure is not needed, is tolerant to topology changes and allows a fast deployment have been considered as a promissory technology that is suitable for a large number of network implementations, such as mobile hand-held devices, wireless sensors, disaster recovery networks, etc. Recently, smart directional antennas have been identified as a robust technology that can boost the performance of wireless ad-hoc networks in terms of coverage, connectivity, and capacity. Contrary to omnidirectional antennas, which can radiate energy in all directions, directional antennas can focus the energy in a specific direction, extending the coverage range for the same power level. Longer ranges provide shorter paths to destination nodes and also improve connectivity. Moreover, directional antennas can reduce the number of collisions in a contention-based access scheme as they can steer the main lobe in the desired direction and set nulls in all the others, thereby they minimize the co-channel interference and reduce the noise level. Connections are more reliable due to the increased link stability and spatial diversity. Shorter paths, as well as alternative paths, are also available as a consequence of the use of directional antennas. All these features combined results in a higher network capacity. Most of the previous research has focused on adapting the existing medium access control and routing protocols to utilize directional communications. This research work is novel because it improves the neighbor discovery process as it allows to discover nodes in the second neighborhood of a given node using a gossip based procedure and by sharing the relative position information obtained during this stage with the routing protocol with the aim of reducing the number of hops between source and destination. We have also developed a model to evaluate the energy consumed by the nodes when smart directional antennas are used in the ad-hoc network. This study has demonstrated that by adapting the beamwidth of the antennas nodes are able to reach furthest nodes and consequently, reduce the number of hops between source and destination. This fact not only reduces the end-to-end delay and improves the network throughput but also reduces the average energy consumed by the whole network
    corecore