Results 1  10
of
94
Geometric Spanner for Routing in Mobile Networks
, 2001
"... Abstract—We propose a new routing graph, the restricted Delaunay graph (RDG), for mobile ad hoc networks. Combined with a node clustering algorithm, the RDG can be used as an underlying graph for geographic routing protocols. This graph has the following attractive properties: 1) it is planar; 2) be ..."
Abstract

Cited by 189 (19 self)
 Add to MetaCart
(Show Context)
Abstract—We propose a new routing graph, the restricted Delaunay graph (RDG), for mobile ad hoc networks. Combined with a node clustering algorithm, the RDG can be used as an underlying graph for geographic routing protocols. This graph has the following attractive properties: 1) it is planar; 2) between any two graph nodes there exists a path whose length, whether measured in terms of topological or Euclidean distance, is only a constant times the minimum length possible; and 3) the graph can be maintained efficiently in a distributed manner when the nodes move around. Furthermore, each node only needs constant time to make routing decisions. We show by simulation that the RDG outperforms previously proposed routing graphs in the context of the Greedy perimeter stateless routing (GPSR) protocol. Finally, we investigate theoretical bounds on the quality of paths discovered using GPSR. Index Terms—Geographical routing, spanners, wireless ad hoc networks. I.
A LogStar Distributed Maximal Independent Set Algorithm . . .
 PODC'08
, 2008
"... We present a novel distributed algorithm for the maximal independent set (MIS) problem. On growthbounded graphs (GBG) our deterministic algorithm finishes in O(log ∗ n) time, n being the number of nodes. In light of Linial’s Ω(log ∗ n) lower bound our algorithm is asymptotically optimal. Our algori ..."
Abstract

Cited by 76 (15 self)
 Add to MetaCart
We present a novel distributed algorithm for the maximal independent set (MIS) problem. On growthbounded graphs (GBG) our deterministic algorithm finishes in O(log ∗ n) time, n being the number of nodes. In light of Linial’s Ω(log ∗ n) lower bound our algorithm is asymptotically optimal. Our algorithm answers prominent open problems in the ad hoc/sensor network domain. For instance, it solves the connected dominating set problem for unit disk graphs in O(log ∗ n) time, exponentially faster than the stateoftheart algorithm. With a new extension our algorithm also computes a δ + 1 coloring in O(log ∗ n) time, where δ is the maximum degree of the graph.
Multicast capacity for large scale wireless ad hoc networks
 In ACM Mobicom
, 2007
"... In this paper, we study the capacity of a largescale random wireless network for multicast. Assume that n wireless nodes are randomly deployed in a square region with sidelength a and all nodes have the uniform transmission range r and uniform interference range R> r. We further assume that eac ..."
Abstract

Cited by 69 (22 self)
 Add to MetaCart
(Show Context)
In this paper, we study the capacity of a largescale random wireless network for multicast. Assume that n wireless nodes are randomly deployed in a square region with sidelength a and all nodes have the uniform transmission range r and uniform interference range R> r. We further assume that each wireless node can transmit/receive at W bits/second over a common wireless channel. For each node vi, we randomly pick k − 1 nodes from the other n − 1 nodes as the receivers of the multicast session rooted at node vi. The aggregated multicast capacity is defined as the total data rate of all multicast sessions in the network. In this paper we derive matching asymptotic upper bounds and lower bounds on multicast capacity of random wireless networks. We show that the total multicast capacity is Θ( � n log n · W √ k) when k = O ( n log n
Efficient distributed lowcost backbone formation for wireless networks
 IEEE Transactions on Parallel and Distributed Systems
, 2006
"... Backbone has been used extensively in various aspects (e.g., routing, route maintenance, broadcast, scheduling) for wireless networks. Previous methods are mostly designed to minimize the backbone size. However, in many applications, it is desirable to construct a backbone with small cost when eac ..."
Abstract

Cited by 54 (8 self)
 Add to MetaCart
(Show Context)
Backbone has been used extensively in various aspects (e.g., routing, route maintenance, broadcast, scheduling) for wireless networks. Previous methods are mostly designed to minimize the backbone size. However, in many applications, it is desirable to construct a backbone with small cost when each wireless node has a cost of being in the backbone. In this paper, we first show that previous methods specifically designed to minimize the backbone size may produce a backbone with a large cost. We then propose an efficient distributed method to construct a weighted sparse backbone with low cost. We prove that the total cost of the constructed backbone is within a small constant factor of the optimum for homogeneous networks when either the nodes ’ costs are smooth or the network maximum node degree is bounded. We also show that with a small modification the constructed backbone is efficient for unicast: the total cost (or hop) of the least cost (or hop) path connecting any two nodes using backbone is no more than 3 (or 4) times of the least cost (or hop) path in the original communication graph. As a side product, we give an efficient overlay based multicast structure whose total cost is no more than 10 times of the minimum when the network is modeled by UDG. Our theoretical results are corroborated by our simulation studies.
Extended Multipoint Relays to Determine Connected Dominating Sets in MANETs
 IEEE Trans. Comput
, 2006
"... ..."
On connected multiple point coverage in wireless sensor networks
 Journal of Wireless Information Networks
, 2006
"... Abstract — We consider a wireless sensor network consisting of a set of sensors deployed randomly. A point in the monitored area is covered if it is within the sensing range of a sensor. In some applications, when the network is sufficiently dense, area coverage can be approximated by guaranteeing ..."
Abstract

Cited by 29 (0 self)
 Add to MetaCart
(Show Context)
Abstract — We consider a wireless sensor network consisting of a set of sensors deployed randomly. A point in the monitored area is covered if it is within the sensing range of a sensor. In some applications, when the network is sufficiently dense, area coverage can be approximated by guaranteeing point coverage. In this case, all the points of wireless devices could be used to represent the whole area, and the working sensors are supposed to cover all the sensors. Many applications related to security and reliability require guaranteed kcoverage of the area at all times. In this paper, we formalize the k(Connected) Coverage Set (kCCS/kCS) problems, develop a linear programming algorithm, and design two nonglobal solutions for them. Some theoretical analysis is also provided followed by simulation results. Index Terms — Coverage problem, linear programming, localized algorithms, reliability, wireless sensor networks.
EnergyAware Wakeup Scheduling for Data Collection and Aggregation
"... Abstract—A sensor in wireless sensor networks (WSNs) periodically produces data as it monitors its vicinity. The basic operation in such a network is the systematic gathering (with or without innetwork aggregation) and transmitting of sensed data to a base station for further processing. A key chal ..."
Abstract

Cited by 28 (5 self)
 Add to MetaCart
(Show Context)
Abstract—A sensor in wireless sensor networks (WSNs) periodically produces data as it monitors its vicinity. The basic operation in such a network is the systematic gathering (with or without innetwork aggregation) and transmitting of sensed data to a base station for further processing. A key challenging question in WSNs is to schedule nodes ’ activities to reduce energy consumption. In this paper, we focus on designing energy efficient protocols for lowdatarate WSNs, where sensors consume different energy in different radio states (transmitting, receiving, listening, sleeping, and being idle) and also consume energy for statetransition. We design both centralized and distributed energy efficient and interferenceaware algorithms for homogeneous networks and heterogeneous networks. We use TDMA as the MAC layer protocol and schedule the sensor nodes with consecutive timeslots at different radio states while reducing the number of state transitions. We prove that the energy consumption by our scheduling for homogeneous network is at most a constant times that of the optimum and the energy consumption by our scheduling for heterogeneous network is at most Θ(log Rmax Rmin times of the optimum. We also propose efficient algorithms to construct data gathering tree such that the energy consumption and the network throughput is within a constant factor of the optimum. Extensive simulation studies show that our algorithms do reduce considerable energy consumption. Index Terms—Wireless sensor networks, energy consumption, MAC, scheduling, routing, optimization I.
Extended Dominating Set and Its Applications in Ad Hoc Networks Using Cooperative Communication
 IEEE TRANS. PARALLEL AND DISTRIBUTED SYSTEMS, ACCEPTED FOR PUBLICATION
, 2005
"... We propose a notion of extended dominating set where each node in an ad hoc network is covered by either a dominating neighbor or several 2hop dominating neighbors. This work is motivated by cooperative communication in ad hoc networks whereby transmitting independent copies of a packet generates d ..."
Abstract

Cited by 25 (5 self)
 Add to MetaCart
We propose a notion of extended dominating set where each node in an ad hoc network is covered by either a dominating neighbor or several 2hop dominating neighbors. This work is motivated by cooperative communication in ad hoc networks whereby transmitting independent copies of a packet generates diversity and combats the effects of fading. We first show the NPcompleteness of the minimum extended dominating set problem. Then, several heuristic algorithms, global and local, for constructing a small extended dominating set are proposed. These are nontrivial extensions of the existing algorithms for the regular dominating set problem. The application of the extended dominating set in efficient broadcasting is also discussed. The performance analysis includes an analytical study in terms of approximation ratio and a simulation study of the average size of the extended dominating set derived from the proposed algorithms.
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
This is an Open Access article distributed under the terms of the Creative Commons Attribution License
2004b. Applications of klocal MST for topology control and broadcasting in wireless ad hoc networks
 IEEE Trans. Parall. Distrib. Syst
"... Abstract—In this paper, we propose a family of structures, namely, klocalized minimum spanning tree (LMSTk) for topology control and broadcasting in wireless ad hoc networks. We give an efficient localized method to construct LMSTk using only OðnÞ messages under the localbroadcast communication mo ..."
Abstract

Cited by 22 (9 self)
 Add to MetaCart
Abstract—In this paper, we propose a family of structures, namely, klocalized minimum spanning tree (LMSTk) for topology control and broadcasting in wireless ad hoc networks. We give an efficient localized method to construct LMSTk using only OðnÞ messages under the localbroadcast communication model, i.e., the signal sent by each node will be received by all nodes within the node’s transmission range. We also analytically prove that the node degree of the structure LMSTk is at most 6, LMSTk is connected and planar and, more importantly, the total edge length of the LMSTk is within a constant factor of that of the minimum spanning tree when k 2 (called low weighted hereafter). We then propose another low weighted structure, called Incident MST and RNG Graph (IMRG), that can be locally constructed using at most 13n messages under the local broadcast communication model. Test results are corroborated in the simulation study. We study the performance of our structures in terms of the total power consumption for broadcasting, the maximum node power needed to maintain the network connectivity. We theoretically prove that our structures are asymptotically the best possible for broadcasting among all locally constructed structures. Our simulations show that our new structures outperform previous locally constructed structures in terms of broadcasting and power assignment for connectivity. Index Terms—Localized algorithms, broadcasting, topology control, minimum spanning tree, wireless ad hoc networks. 1