Results 1  10
of
26
ASCENT: Adaptive selfconfiguring sensor networks topologies
, 2004
"... Advances in microsensor and radio technology will enable small but smart sensors to be deployed for a wide range of environmental monitoring applications. The low pernode cost will allow these wireless networks of sensors and actuators to be densely distributed. The nodes in these dense networks w ..."
Abstract

Cited by 447 (15 self)
 Add to MetaCart
Advances in microsensor and radio technology will enable small but smart sensors to be deployed for a wide range of environmental monitoring applications. The low pernode cost will allow these wireless networks of sensors and actuators to be densely distributed. The nodes in these dense networks will coordinate to perform the distributed sensing and actuation tasks. Moreover, as described in this paper, the nodes can also coordinate to exploit the redundancy provided by high density so as to extend overall system lifetime. The large number of nodes deployed in these systems will preclude manual configuration, and the environmental dynamics will preclude designtime preconfiguration. Therefore, nodes will have to selfconfigure to establish a topology that provides communication under stringent energy constraints. ASCENT builds on the notion that, as density increases, only a subset of the nodes are necessary to establish a routing forwarding backbone. In ASCENT, each node assesses its connectivity and adapts its participation in the multihop network topology based on the measured operating region. This paper motivates and describes the ASCENT algorithm and presents analysis, simulation, and experimental measurements. We show that the system achieves linear increase in energy savings as a function of the density and the convergence time required in case of node failures while still providing adequate connectivity.
Geometric Spanners for Wireless Ad Hoc Networks
 IEEE Transactions on Parallel and Distributed Systems
, 2003
"... We propose a new geometric spanner for static wireless ad hoc networks, which can be constructed efficiently in a localized manner. It integrates the connected dominating set and the local Delaunay graph to form a backbone of the wireless network. ..."
Abstract

Cited by 95 (27 self)
 Add to MetaCart
(Show Context)
We propose a new geometric spanner for static wireless ad hoc networks, which can be constructed efficiently in a localized manner. It integrates the connected dominating set and the local Delaunay graph to form a backbone of the wireless network.
Localized construction of bounded degree and planar spanner for wireless ad hoc networks
 In DIALMPOMC
, 2003
"... We propose a novel localized algorithm that constructs a bounded degree and planar spanner for wireless ad hoc networks modeled by unit disk graph (UDG). Every node only has to know its 2hop neighbors to find the edges in this new structure. Our method applies the Yao structure on the local Delauna ..."
Abstract

Cited by 92 (19 self)
 Add to MetaCart
(Show Context)
We propose a novel localized algorithm that constructs a bounded degree and planar spanner for wireless ad hoc networks modeled by unit disk graph (UDG). Every node only has to know its 2hop neighbors to find the edges in this new structure. Our method applies the Yao structure on the local Delaunay graph [21] in an ordering that are computed locally. This new structure has the following attractive properties: (1) it is a planar graph; (2) its node degree is bounded from above by a positive constant 19 + ⌈ 2π α ⌉; (3) it is a tspanner (given any two nodes u and v, there is a path connecting them in the structure such that its length is no more than t ≤ max { π α,πsin 2 2 +1}·Cdel times of the shortest path in UDG); (4) it can be constructed locally and is easy to maintain when the nodes move around; (5) moreover, we show that the total communication cost is O(n), where n is the number of wireless nodes, and the computation cost of each node is at most O(d log d), where d is its 2hop neighbors in the original unit disk graph. Here Cdel is the spanning ratio of the Delaunay triangulation, which is at most 4 √ 3 9 π. And the adjustable parameter α satisfies 0 <α<π/3. In addition, experiments are conducted to show this topology is efficient in practice, compared with other wellknown topologies used in wireless ad hoc networks. Previously, only centralized method [5] of constructing bounded degree planar spanner is known, with degree bound 27 and spanning ratio t ≃ 10.02. The distributed implementation of their centralized method takes O(n 2) communications in the worst case. No localized methods were known previously for constructing bounded degree planar spanner.
Partial Delaunay Triangulation and Degree Limited Localized Bluetooth
, 2004
"... This paper addresses the problem of localized scatternet formation for multihop Bluetoothbased personal area ad hoc networks. Nodes are assumed to know their positions and are able to establish connections with any of their neighboring nodes, located within their transmission radius, in the neighbo ..."
Abstract

Cited by 56 (15 self)
 Add to MetaCart
(Show Context)
This paper addresses the problem of localized scatternet formation for multihop Bluetoothbased personal area ad hoc networks. Nodes are assumed to know their positions and are able to establish connections with any of their neighboring nodes, located within their transmission radius, in the neighbor discovery phase. The next phase of the proposed formation algorithm is optional and can be applied to construct a sparse geometric structure in a localized manner. We propose here a new sparse planar structure, namely, partial Delaunay triangulation (PDT), which can be constructed locally and is denser than other known localized planar structures. In the next mandatory phase, the degree of each node is limited to seven by applying the Yao structure, and the masterslave relations in piconets are formed in created subgraphs. This phase consists of several iterations. In each iteration, undecided nodes with higher keys than any of their undecided neighbors apply the Yao structure to bound the degrees, decide masterslave relations on the remaining edges, and inform all neighbors about either deleting edges or masterslave decisions. To the best of our knowledge, our schemes are the first schemes that construct degree limited (a node has at most seven slaves) and connected piconets in multihop networks, without parking any node. The creation and maintenance require small overhead in addition to maintaining accurate location information for onehop neighbors. The experiments confirm good functionality of created Bluetooth networks in addition to their fast creation and straightforward maintenance.
MONETARY AUTHORITY
, 1998
"... This is an Open Access article distributed under the terms of the Creative Commons Attribution License ..."
Abstract

Cited by 24 (0 self)
 Add to MetaCart
(Show Context)
This is an Open Access article distributed under the terms of the Creative Commons Attribution License
Distributed algorithms for coloring and domination in wireless ad hoc networks
 In Proc. of FSTTCS
, 2004
"... Abstract. We present fast distributed algorithms for coloring and (connected) dominating set construction in wireless ad hoc networks. We present our algorithms in the context of Unit Disk Graphs which are known to realistically model wireless networks. Our distributed algorithms take into account t ..."
Abstract

Cited by 17 (0 self)
 Add to MetaCart
(Show Context)
Abstract. We present fast distributed algorithms for coloring and (connected) dominating set construction in wireless ad hoc networks. We present our algorithms in the context of Unit Disk Graphs which are known to realistically model wireless networks. Our distributed algorithms take into account the loss of messages due to contention from simultaneous interfering transmissions in the wireless medium. We present randomized distributed algorithms for (conflictfree) Distance2 coloring, dominating set construction, and connected dominating set construction in Unit Disk Graphs. The coloring algorithm has a time complexity of O( ∆ log 2 n) and is guaranteed to use at most O(1) times the number of colors required by the optimal algorithm. We present two distributed algorithms for constructing the (connected) dominating set; the former runs in time O( ∆ log 2 n) and the latter runs in time O(log 2 n). The two algorithms differ in the amount of local topology information available to the network nodes. Our algorithms are geared at constructing Well Connected Dominating Sets (WCDS) which have certain powerful and useful structural properties such as low size, low stretch and low degree. In this work, we also explore the rich connections between WCDS and routing in ad hoc networks. Specifically, we combine the properties of WCDS with other ideas to obtain the following interesting applications: – An online distributed algorithm for collisionfree, low latency, low redundancy and high throughput broadcasting. – Distributed capacity preserving backbones for unicast routing and scheduling. 1
On the nodescheduling approach to topology control in ad hoc networks
 In Proc. 6 th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC
, 2005
"... In this paper, we analyze the node scheduling approach of topology control in the context of reliable packet delivery. In node scheduling, only a minimum set of nodes needed for routing purposes (usually determined by a minimum connected dominating set, MCDS) are kept active. However, a very low den ..."
Abstract

Cited by 16 (0 self)
 Add to MetaCart
(Show Context)
In this paper, we analyze the node scheduling approach of topology control in the context of reliable packet delivery. In node scheduling, only a minimum set of nodes needed for routing purposes (usually determined by a minimum connected dominating set, MCDS) are kept active. However, a very low density resulting from switching off nodes can adversely affect the performance of data delivery due to three factors. First, our analysis shows that at low density, the average path length increases by a factor more than previously thought. Second, protocols such as the HopByHop Broadcast (HHB) reliability scheme (which relies on high network degree for optimum performance) suffer. Third, with limited buffers at nodes, the overhead is more pronounced to the extent of making the network unstable. Using probabilistic models, we derive the relationship between network density and overhead based on the above factors and find the density conditions for minimum power consumption. We also propose a, fully distributed and messageoptimal node scheduling algorithm with a constant approximation bound based on the concept of Virtual Connected Dominating Sets. The scheme can asymptotically achieve optimal density conditions while adapting to different network parameters.
Fast Distributed Well Connected Dominating Sets for Ad Hoc Networks
, 2004
"... We present the first distributed algorithms for computing connected dominating sets (CDS) for ad hoc networks that break the lineartime barrier. We present two algorithms which require O(\Delta log^2 n)andO(log^2 n) running time respectively, where \Delta is the maximum node degree and n is the siz ..."
Abstract

Cited by 16 (0 self)
 Add to MetaCart
We present the first distributed algorithms for computing connected dominating sets (CDS) for ad hoc networks that break the lineartime barrier. We present two algorithms which require O(\Delta log^2 n)andO(log^2 n) running time respectively, where \Delta is the maximum node degree and n is the size of the network. This is a substantial improvement over existing implementations, all of which require \Omega(n) running time.
Proximity Structures for Geometric Graphs
 International Journal of Computational Geometry and Applications
, 2003
"... In this paper we study proximity structures like Delaunay triangulations based on geometric graphs, i.e. graphs which are subgraphs of the complete geometric graph. Given an arbitrary geometric graph G, we define several restricted Voronoi diagrams, restricted Delaunay triangulations, relative n ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
In this paper we study proximity structures like Delaunay triangulations based on geometric graphs, i.e. graphs which are subgraphs of the complete geometric graph. Given an arbitrary geometric graph G, we define several restricted Voronoi diagrams, restricted Delaunay triangulations, relative neighborhood graphs, Gabriel graphs and then study their complexities when G is a general geometric graph or G is some special graph derived from the application area of wireless networks. Besides being of fundamental interest these structures have applications in topology control for wireless networks.