The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
A range assignment to the nodes in a wireless ad hoc network induces a topology in which there is an edge between two nodes if and only if both of them are within each other's transmission range. The critical transmission radius for k-connectivity is the smallest r such that if all nodes have the transmission radius r, the induced topology is k -connected. In this paper, we study the asymptotic critical...
We propose a generic routing table design principle for scalable routing on networks with bounded geometric growth. Given an inaccurate distance oracle that estimates the graph distance of any two nodes with constant factor upper and lower bounds, we augment it by storing the routing paths of pairs of nodes, selected in a spatial distribution, and show that the routing table enables 1 + epsiv stretch...
Topology Control (TC) is one of the most important techniques used in wireless ad hoc and sensor networks to reduce energy consumption and radio interference, The goal of this technique is to control the topology of the graph representing the communication links between network nodes with the purpose of maintaining some global graph property (e.g., connectivity), while reducing energy consumption...
Topology control in wireless ad hoc networks can be considered the task of given a network connectivity graph computing a sub graph with specific desired properties, such as connectivity, symmetry, sparsity, low interference. All previous approaches used for topology control have in common that they model wireless networks as purely geometric graphs, hence neglecting one of the most crucial aspects...
Topology control in ad-hoc networks tries to lower node energy consumption by reducing transmission power and by confining interference, collisions and consequently retransmissions. In other words, we are given the communication graph G obtained when all the nodes transmit at maximum power, the goal is to identify a sparse subgraph G (also called power spanner) of G such that only energy-efficient...
This paper studies the combinatorial properties of geometric structures, known as k-locally Delaunay graphs, introduced in the application of wireless ad hoc networks. Given a network that models the connections among its sensors as a k-locally Delaunay graph, we investigate which topologies are allowed for such a network. We show that the family of regular series-parallel graphs, a subfamily of two-terminal...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.