#### DMCA

## On Minimum-Energy Broadcasting

Venue: | in All Wireless Networks, in the proc. of IEEE LCN'2001 |

Citations: | 4 - 2 self |

### Citations

10432 | Introduction to Algorithms
- Cormen, Leiserson, et al.
- 1990
(Show Context)
Citation Context ...s different from the conventional link-based minimum spanning tree (MST) problem. Indeed, while the MST can be solved in polynomial time by algorithms such as Prim’s algorithm and Kruskal’s algorithm =-=[37]-=-, the minimum-energy broadcast routing problem cannot be solved in polynomial time unless P=NP [26]. In its general graph version, the minimum-energy broadcast routing can be shown to be NP-hard [38],... |

2274 | Directed diffusion: a scalable and robust communication paradigm for sensor networks
- Intanagonwiwat, Govindan, et al.
- 2000
(Show Context)
Citation Context ... of a reliable broadcast form a connected dominating set (CDS). If the power consumed at each node is adjustable, we assume that the power consumed by a relay node u is �uv� β , where real number β ∈ =-=[2, 5]-=- depends on transmission environment and v is the farthest neighbor of u in the broadcast tree. For both models, we reviewed several centralized methods that compute broadcast trees consuming the ener... |

1199 | The broadcast storm problem in a mobile ad hoc network
- Tseng, Ni, et al.
- 2002
(Show Context)
Citation Context ...efficient broadcast algorithms for such networks since wireless devises are often powered by batteries only. Recently, a number of research groups have proposed more efficient broadcasting techniques =-=[8, 9, 10, 11, 12, 13, 14]-=- with various goals such as minimizing the number of retransmissions, minimizing the total power used by all transmitting nodes, minimizing the overall delay of the broadcasting, and so on. Williams a... |

1088 | Next century challenges: scalable coordination in sensor networks
- Estrin, Govindan, et al.
- 1999
(Show Context)
Citation Context ...3 1 1 Introduction Wireless Ad Hoc Networks: Due to its potential applications in various situations such as battlefield, emergency relief, environment monitoring, and so on, wireless ad hoc networks =-=[1, 2, 3, 4]-=- have recently emerged as a premier research topic. Wireless networks consist of a set of wireless nodes which are spread over a geographical area. These nodes are able to perform processing as well a... |

1019 | Geography-informed energy conservation for ad hoc routing
- Xu, Heidemann, et al.
- 2001
(Show Context)
Citation Context ...d method that requires all nodes to remain active in all the rounds. In [85], the key for deciding dominating set status is a combination of remained energy and node degree. Xu, Heidemann, and Estrin =-=[86]-=- discuss the following sensor sleep node schedule. The tradeoff between network lifetime and density for this cell-based schedule was investigated in [87]. The given 2-D space is partitioned into a se... |

930 |
Wireless integrated network sensors
- Pottie, Kaiser
- 2000
(Show Context)
Citation Context ...3 1 1 Introduction Wireless Ad Hoc Networks: Due to its potential applications in various situations such as battlefield, emergency relief, environment monitoring, and so on, wireless ad hoc networks =-=[1, 2, 3, 4]-=- have recently emerged as a premier research topic. Wireless networks consist of a set of wireless nodes which are spread over a geographical area. These nodes are able to perform processing as well a... |

928 | Span: An energyefficient coordination algorithm for topology maintenance in ad hoc wireless networks
- Chen, Jamieson, et al.
- 2001
(Show Context)
Citation Context ...here has smaller size and is chosen without using any parameter (size of square, which has to be carefully selected and propagated with node relative positioning in solution [86]). The Span algorithm =-=[88]-=- selects some nodes as coordinators. These nodes form dominating set. A node becomes coordinator if it discovers that two of its neighbors cannot communicate with each other directly or through one or... |

652 |
Ad hoc on demand distance vector (AODV) routing, IETF Internet Draft. Available from: txt/aodvid.txt
- Perkins, Belding-Royer, et al.
- 2002
(Show Context)
Citation Context ...efficient broadcast algorithms for such networks since wireless devises are often powered by batteries only. Recently, a number of research groups have proposed more efficient broadcasting techniques =-=[8, 9, 10, 11, 12, 13, 14]-=- with various goals such as minimizing the number of retransmissions, minimizing the total power used by all transmitting nodes, minimizing the overall delay of the broadcasting, and so on. Williams a... |

649 | Investigating the energy consumption of a wireless network interface in an ad hoc networking environment
- Feeney, Nilsson
- 2001
(Show Context)
Citation Context ...osed method in prolonging the life span of the network is confirmed through simulation. Source dependent forwarding sets appear to be more energy balanced. However, it was experimentally confirmed in =-=[84]-=- that the difference in energy consumption between an idle node and a transmitting node is not major, while the major difference exists between idle and sleep states of nodes. Therefore the most energ... |

610 | Next century challenges: mobile networking for Smart Dust
- Kahn, Katz, et al.
- 1999
(Show Context)
Citation Context ... of a reliable broadcast form a connected dominating set (CDS). If the power consumed at each node is adjustable, we assume that the power consumed by a relay node u is �uv� β , where real number β ∈ =-=[2, 5]-=- depends on transmission environment and v is the farthest neighbor of u in the broadcast tree. For both models, we reviewed several centralized methods that compute broadcast trees consuming the ener... |

549 | Adaptive Clustering for Mobile Wireless Networks
- Lin, Gerla
- 1997
(Show Context)
Citation Context ... Methods 3.1 Based on Distributed CDS A natural structure for broadcasting is connected dominating set. Many distributed clustering (or dominating set) algorithms have been proposed in the literature =-=[48, 49, 50, 51, 52, 53]-=-. All algorithms assume that the nodes have distinctive identities (denoted by ID hereafter). In the rest of section, we will interchange the terms cluster-head and dominator. The node that is not a c... |

546 | On the construction of energy-efficient broadcast and multicast trees in wireless networks
- Wieselthier, Nguyen, et al.
(Show Context)
Citation Context ...disk graph. 2.1 Assumptions We first study the adjustable power model. Minimumenergy broadcast/multicast routing in a simple ad hoc networking environment has been addressed by the pioneering work in =-=[26, 27, 28, 29]-=-. To assess the complexities one at a time, the nodes in the network are assumed to be randomly distributed in a two-dimensional plane and there is no mobility. Nevertheless, as argued in [29], the im... |

503 | Comparison of broadcasting techniques for mobile ad hoc networks - Williams, Camp - 2002 |

491 |
A greedy heuristic for the set-covering problem
- Chvatal
- 1979
(Show Context)
Citation Context ...e stars are formed by connecting each dominatee node to one of its dominators. The approximation method of MDS is essentially a distributed variation of the the centralized Chvatal’s greedy algorithm =-=[36]-=- for set cover. Notice that the dominating set problem is essentially the set cover problem which is wellstudied. It is then not surprise that the method by Das et al. [55, 56] guarantees a H(∆) for t... |

456 | GPS-free positioning in mobile ad-hoc networks
- CAPKUN, HAMDI, et al.
- 2001
(Show Context)
Citation Context ...tance between neighboring nodes can be estimated on the basis of incoming signal strengths. Relative co-ordinates of neighboring nodes can be obtained by exchanging such information between neighbors =-=[7]-=-. With the position information, we can apply computational geometry techniques to solve some challenging questions in wireless networks. Power-Attenuation Model: Energy conservation is a critical iss... |

327 | Distributed clustering for ad hoc networks
- Basagni
- 1999
(Show Context)
Citation Context ...ting MIS is well-known. The following rankings of a node are used in various methods: the ID only [50, 49], the ordered pair of degree and ID [61], and an ordered pair of degree and location [60]. In =-=[62, 63]-=-, Basagni et al., used a general weight as a ranking criterion for selecting the node as the clusterhead, where the weight is a combination of mentioned criteria and some new ones, such as mobility or... |

293 | Routing in Ad-hoc Networks Using Minimum Connected Dominating Sets
- Das, Bharghavan
- 1997
(Show Context)
Citation Context ...und. The computed dominating set is within O(log ∆) in expectation and within O(log n) with high probability. Their algorithm works for weighted dominating set also. The method proposed by Das et al. =-=[55, 56]-=- contains three stages: approximating the minimum dominating set, constructing a spanning forest of stars, expanding the spanning forest to a spanning tree. Here the stars are formed by connecting eac... |

286 |
The relative neighborhood graph of a finite planar set
- TOUSSAINT
- 1980
(Show Context)
Citation Context ...sing O(n log n) messages. Localized minimum energy broadcast algorithms are based on the use of a locally defined geometric structure, such as RNG (relative neighborhood graph), proposed by Toussaint =-=[90]-=-. RNG consists of all edges uv such that uv is not the longest edge in any triangle uvw. That is, uv belongs to RNG if there is no node w such that uw < uv and vw < uv. Cartigny et al. [72] proposed a... |

272 | Design and analysis of an MST-based topology control algorithm
- Li, Hou, et al.
- 2005
(Show Context)
Citation Context ...s. Li and Hou [71], and Cartigny et al. [96] proposed another localized algorithms, which applies LMST (localized minimal spanning tree) instead of RNG as the broadcast topology. In LMST, proposed in =-=[75]-=-, each node calculates local minimum spanning tree of itself and its 1-hop neighbors. A node uv is in LMST if and only if u and v select each other in their respective trees. The simulations [71, 96] ... |

261 | Max–min d-cluster formation in wireless ad hoc networks
- Amis, Prakash, et al.
- 2000
(Show Context)
Citation Context ... Methods 3.1 Based on Distributed CDS A natural structure for broadcasting is connected dominating set. Many distributed clustering (or dominating set) algorithms have been proposed in the literature =-=[48, 49, 50, 51, 52, 53]-=-. All algorithms assume that the nodes have distinctive identities (denoted by ID hereafter). In the rest of section, we will interchange the terms cluster-head and dominator. The node that is not a c... |

243 | Approximation schemes for covering and packing problems in image processing and VLSI
- Hochbaum, Maass
- 1985
(Show Context)
Citation Context ... enumerate all sets with size at most C in time Θ(n C ). Among these enumerated sets, the smallest dominating set is the minimum dominating set. Then, using the shifting strategy proposed by Hochbaum =-=[43]-=-, they derived a PTAS for the minimum dominating set problem. Since we have PTAS for minimum dominating set and the graph V irtG connecting every pair of dominators within at most 3 hops is connected ... |

234 | On the reduction of broadcast redundancy in mobile ad hoc networks
- Peng, Lu
- 2000
(Show Context)
Citation Context ...es, assuming their location, or existence of their link to a previous transmitting node, are known. The basic method was independently and almost simultaneously (August 2000) proposed in two articles =-=[81, 82]-=-. The methods were called Neighbor Elimination by Stojmenovic and Seddigh [82], while a similar method, called Scalable Broadcast Algorithm, was proposed by Peng and Lu [81]. Two-hop neighbors informa... |

220 | Improved steiner tree approximation in graphs
- Robins, Zelikovsky
- 2000
(Show Context)
Citation Context ... method gives approximation ratio c(H(∆) + 1), where c is the approximation ratio for the unweighted Steiner tree ln 3 problem. Currently, the best ratio is 1 + 2 � 1.55, due to Robins and Zelikovsky =-=[40]-=-. By definition, any algorithm generating a maximal independent set is a clustering method. We first review the methods that approximates the maximum independent set, the minimum dominating set, and t... |

219 | Multipoint Relaying: An Efficient Technique for Flooding
- Qayyum, Viennot, et al.
- 2000
(Show Context)
Citation Context ...ion may not be practical. Santivanez et al. [65] show that flooding is a good solution for the sake of scalability and simplicity. Several flooding techniques for wireless networks have been proposed =-=[66, 67, 60]-=-, each with respect to certain optimization criterion. However, none of them takes advantage of the feature that the transmission power of a node can be adjusted. Some distributed heuristics are propo... |

177 |
Multicast tree construction and flooding in wireless ad hoc networks
- Lim, Kim
- 2000
(Show Context)
Citation Context ...e-hop neighbors who together can cover the two-hop neighbors. In other words, when a node retransmits a message to its neighbors, it explicitly asks a subset of its neighbors to relay the message. In =-=[79]-=-, Lim and Kim proposed a broadcasting scheme that chooses some or all of its one-hop neighbors as rebroadcasting node. When a node receives a broadcast packet, it uses a Greedy Set Cover algorithm to ... |

174 | C.: Minimum-energy broadcast in all-wireless networks: NP-completeness and distribution issues
- Cagalj, Hubaux, et al.
- 2002
(Show Context)
Citation Context ...ect to certain optimization criterion. However, none of them takes advantage of the feature that the transmission power of a node can be adjusted. Some distributed heuristics are proposed, such as 10 =-=[68, 69, 70]-=-. Most of them are based on distributed MST method. A possible drawback of these distributed method is that it may not perform well under frequent topological changes as it relies on information that ... |

173 | Flooding for reliable multicast in multi-hop ad hoc networks
- Obraczka, Viswanath, et al.
- 2001
(Show Context)
Citation Context ...ion may not be practical. Santivanez et al. [65] show that flooding is a good solution for the sake of scalability and simplicity. Several flooding techniques for wireless networks have been proposed =-=[66, 67, 60]-=-, each with respect to certain optimization criterion. However, none of them takes advantage of the feature that the transmission power of a node can be adjusted. Some distributed heuristics are propo... |

159 | AMRoute: ad-hoc multicast routing protocol,” Internet Draft, work in progress
- Bommaiah, Liu, et al.
- 1998
(Show Context)
Citation Context ...efficient broadcast algorithms for such networks since wireless devises are often powered by batteries only. Recently, a number of research groups have proposed more efficient broadcasting techniques =-=[8, 9, 10, 11, 12, 13, 14]-=- with various goals such as minimizing the number of retransmissions, minimizing the total power used by all transmitting nodes, minimizing the overall delay of the broadcasting, and so on. Williams a... |

158 |
Ad hoc multicast routing protocol utilizing increasing id-numbers (AMRIS) functional specification,” Internet Draft, work in progress
- Wu, Tay, et al.
- 1998
(Show Context)
Citation Context |

150 | Simple heuristics for unit disk graphs
- Marathe, Breu, et al.
- 1995
(Show Context)
Citation Context ...clustering method. We first review the methods that approximates the maximum independent set, the minimum dominating set, and the minimum connected dominating set. Hunt et al. [41]sand Marathe et al. =-=[42]-=- studied the approximation of the maximum independent set and the minimum dominating set for unit disk graphs. They gave the first PTASs for MDS in UDG. The method is based on the following observatio... |

137 | Investigating Upper Bounds on Network Lifetime Extenstion for Cell-based Energy Conservation Techniques
- Blough, Santi
- 2002
(Show Context)
Citation Context ...gy and node degree. Xu, Heidemann, and Estrin [86] discuss the following sensor sleep node schedule. The tradeoff between network lifetime and density for this cell-based schedule was investigated in =-=[87]-=-. The given 2-D space is partitioned into a set of squares (called cells), such as any node within a square can directly communicate with any nodes in an adjacent square. Therefore, one representative... |

133 | Power consumption in packet radio networks, in
- Kirousis, Kranakis, et al.
- 1997
(Show Context)
Citation Context ...disk graph. 2.1 Assumptions We first study the adjustable power model. Minimumenergy broadcast/multicast routing in a simple ad hoc networking environment has been addressed by the pioneering work in =-=[26, 27, 28, 29]-=-. To assess the complexities one at a time, the nodes in the network are assumed to be randomly distributed in a two-dimensional plane and there is no mobility. Nevertheless, as argued in [29], the im... |

121 | I.: Localized minimum-energy broadcasting in adhoc networks
- Cartigny, Simplot, et al.
- 2003
(Show Context)
Citation Context ... Toussaint [90]. RNG consists of all edges uv such that uv is not the longest edge in any triangle uvw. That is, uv belongs to RNG if there is no node w such that uw < uv and vw < uv. Cartigny et al. =-=[72]-=- proposed a localized algorithm, called RBOP [72] that is built upon the notion of relative neighborhood graph (RNG). In RBOP, the broadcast is initiated at the source and propagated, following the ru... |

118 | Constructing minimum-energy broadcast trees in wireless ad hoc networks - Liang - 2002 |

110 | On the complexity of computing minimum energy consumption broadcast subgraphs
- Clementi, Crescenzi, et al.
(Show Context)
Citation Context ...disk graph. 2.1 Assumptions We first study the adjustable power model. Minimumenergy broadcast/multicast routing in a simple ad hoc networking environment has been addressed by the pioneering work in =-=[26, 27, 28, 29]-=-. To assess the complexities one at a time, the nodes in the network are assumed to be randomly distributed in a two-dimensional plane and there is no mobility. Nevertheless, as argued in [29], the im... |

92 | A dominating-set-based routing scheme in ad hoc wireless networks
- Wu, Li
(Show Context)
Citation Context ...tion and ∆ is the maximum node degree. While the algorithm proposed by Das et al. [55, 56] finds a dominating set and then grows it to a connecting dominating set, the algorithm proposed by Wu and Li =-=[57, 58]-=- takes an opposite approach. They first find a connecting dominating set and then prune out certain redundant nodes from the CDS. The initial CDS C contains all nodes that have at least two non-adjace... |

85 | Localized delaunay triangulation with application in ad hoc wireless networks
- Li, Calinescu, et al.
(Show Context)
Citation Context ...rithms are difficult to design or impossible sometimes. For example, we cannot construct the minimum spanning tree (MST) locally. Recently, Li et al. successfully solved several challenging questions =-=[17, 18, 19, 20, 21, 24, 25]-=- by giving efficient localized algorithms. In all these algorithms, we proved that the total communication cost of all nodes constructing the structure together is O(n log n) bits. MAC Specification: ... |

83 | Load-balancing clusters in wireless ad hoc networks
- Amis, Prakash
- 2000
(Show Context)
Citation Context ... Methods 3.1 Based on Distributed CDS A natural structure for broadcasting is connected dominating set. Many distributed clustering (or dominating set) algorithms have been proposed in the literature =-=[48, 49, 50, 51, 52, 53]-=-. All algorithms assume that the nodes have distinctive identities (denoted by ID hereafter). In the rest of section, we will interchange the terms cluster-head and dominator. The node that is not a c... |

74 | Zelikovsky, “Selecting forwarding neighbors in wireless ad hoc networks
- Calinescu, Mandoiu, et al.
- 2004
(Show Context)
Citation Context ...oadcast. The Greedy Set Cover algorithm recursively chooses 1-hop neighbors which cover the most 2-hop neighbors and recalculates the cover set until all 2-hop neighbors are covered. Cǎlinescu et al. =-=[80]-=- gave two practical heuristics for this problem (they called selecting forwarding neighbors). The first algorithm runs in time O(n log n) and returns a subset with size at most 6 times of the minimum.... |

71 | RNG and Internal Node Based Broadcasting Algorithms for Wireless Oneto-One Networks
- Seddigh, Gonzalez, et al.
- 2002
(Show Context)
Citation Context ...v (then edge uv is removed in both configurations), then the structure constructed for another configuration is disconnected. 3.3 Combining Clustering and Low Weight Seddigh, Gonzalez and Stojmenovic =-=[77]-=- specify two more location based broadcasting algorithms that combine RNG and internal node concept (connected dominating set) as follows. PI-broadcast algorithm applies the planar subgraph constructi... |

66 | Border node retransmission based probalistic broadcast protocols in ad-hoc networks
- Cartigny, Simplot
- 2003
(Show Context)
Citation Context ...wont receive all the broadcast packets with the Probabilistic scheme unless the probability parameter is high. When the probability is 100%, this scheme is identical to Flooding. Cartigny and Simplot =-=[94]-=- applied probability which is a function of the distance to the transmitting neighbor. Counter-Based Scheme: Tseng et al. [12] show an inverse relationship between the number of times a packet is rece... |

63 | On the power assignment problem in radio networks
- Clementi, Penna, et al.
(Show Context)
Citation Context |

61 |
A Simple Protocol for Multicast and Broadcast in Mobile Ad Hoc Networks
- Jetcheva, Hu, et al.
- 2001
(Show Context)
Citation Context |

60 | Forward-node-set-based broadcast in clustered mobile ad hoc networks
- Wu, Lou
- 2003
(Show Context)
Citation Context ...dcasting, and so on. Williams and Camp [13] classified the broadcast protocols into four categories: simple (blind) flooding, probability based, area based, and neighbor knowledge methods. Wu and Lou =-=[15]-=- classified broadcasting protocols based on neighbor knowledge information: global, quasi-global, quasi-local, and local. The global broadcast protocol, centralized or distributed, is based on global ... |

59 | Minimum power broadcast trees for wireless networks: optimizing using the viability lemma
- Das, El-Sharkawi, et al.
- 2002
(Show Context)
Citation Context ... and tracking. In addition, as assumed in [29], there are sufficient bandwidth and transceiver resources. Under these assumptions, centralized (as opposed to distributed) algorithms were presented by =-=[29, 30, 31, 32]-=- for minimum-energy broadcast/multicast routing. These centralized algorithms, in this simple networking environment, are expected to serve as the basis for further studies on distributed algorithms i... |

59 | On the scalability of ad hoc routing protocols - Santiváñez, McDonald, et al. - 2002 |

55 | Partial delaunay triangulation and degree limited localized bluetooth scatternet formation," 2002, AdHocNow
- Li, Stojmenovic
(Show Context)
Citation Context ...oint node’s ID. If this is also same, then the ternary key resolves the comparison (otherwise we are comparing edge against itself). This simple method for making distinct edge length was proposed in =-=[23, 75]-=-. The edge lengths, so defined, are then used in the regular definition of RNG. It is easy to show that two RNG edges uv and uw going out of the same node must have angle between them at least π/6, ot... |

54 | a generalized clustering algorithm for peer-topeer networks”. ”Workshop on Algorithmic Aspects of Communication
- Basagni, Farago
- 1997
(Show Context)
Citation Context ...ting MIS is well-known. The following rankings of a node are used in various methods: the ID only [50, 49], the ordered pair of degree and ID [61], and an ordered pair of degree and location [60]. In =-=[62, 63]-=-, Basagni et al., used a general weight as a ranking criterion for selecting the node as the clusterhead, where the weight is a combination of mentioned criteria and some new ones, such as mobility or... |

46 | Geometric spanners for wireless ad hoc networks
- Wang, Li
- 2002
(Show Context)
Citation Context ..., they derived a PTAS for the minimum dominating set problem. Since we have PTAS for minimum dominating set and the graph V irtG connecting every pair of dominators within at most 3 hops is connected =-=[44]-=-, we have an approximation algorithm (constructing a minimum spanning tree V irtG) for MCDS with approximation ratio 3+ɛ. Notice that, Berman et al. [45] gave an 4 approximation method to connect a do... |

43 | On-demand multicast in mobile wireless networks
- Chiang, Gerla
- 1998
(Show Context)
Citation Context |

43 | Connectivity based k-hop clustering in wireless networks - Chen, Garcia, et al. - 2002 |

43 | A new way to weigh malnourished euclidean graphs - Das, Narasimhan, et al. - 1995 |

42 | Computing 2-hop neighborhoods in ad hoc wireless networks
- Calinescu
(Show Context)
Citation Context ...algorithm. Algorithm 2 Construct Low Weight Structure LMST2 by 2-hop Neighbors 12 1. Each node u collects its two hop neighbors information N2(u) using a communication efficient protocol described in =-=[76]-=-. 2. Each node u computes the Euclidean minimum spanning tree MST (N2(u)) of all nodes N2(u), including u itself. 3. For each edge uv ∈ MST (N2(u)), node u tells node v about this directed edge. 4. No... |

41 |
An Improved Spine-based Infrastructure for Routing
- Sivakumar, Das, et al.
- 1998
(Show Context)
Citation Context ...und. The computed dominating set is within O(log ∆) in expectation and within O(log n) with high probability. Their algorithm works for weighted dominating set also. The method proposed by Das et al. =-=[55, 56]-=- contains three stages: approximating the minimum dominating set, constructing a spanning forest of stars, expanding the spanning forest to a spanning tree. Here the stars are formed by connecting eac... |

40 |
Localized LMST and RNG based minimum energy broadcast protocols in ad hoc networks
- Cartigny, Ingelrest, et al.
- 2005
(Show Context)
Citation Context ...[71, 96] show that the performance of LMST based schemes is significantly better than the performance of RBOP, and with about 50% more energy consumption than BIP in static scenarios. Cartigny et al. =-=[92]-=- demonstrated that, when c > 0 in power-attenuation model where energy consumption for transmitting over an edge uv is �uv� β + c, there exists an optimal ’target’ transmission radius, so that further... |

39 | Power-aware broadcasting and activity scheduling in ad hoc wireless networks using connected dominating sets. Wireless Communications and Mobile Computing, 4(1):425 438, June 2003. INRIA Unité de recherche INRIA Futurs Parc Club Orsay Université - ZAC de
- Wu, Wu, et al.
(Show Context)
Citation Context ... set. Therefore, a static selection of dominating nodes will result in a shorter life span for certain nodes, which in turn result in a shorter life span of the whole network. Wu, Wu, and Stojmenovic =-=[83]-=- study dynamic selection of dominating nodes, also called activity scheduling. Activity scheduling deals with the way to rotate the role of each node among a set of given operation modes. For example,... |

36 | On the Complexity and Distributed Construction of Energy-Efficient Broadcast Trees in Wireless Ad Hoc Widest Spanning Tree (with time fractions) 2: 1 6: 1 9: 1 t0 t1 t2 t3 t4 t5 t6 t7 t8 t9 t10 t11 Number of NICs at each node 2: 1 6: 1 9
- Ahluwalia, Modiano
(Show Context)
Citation Context ...ect to certain optimization criterion. However, none of them takes advantage of the feature that the transmission power of a node can be adjusted. Some distributed heuristics are proposed, such as 10 =-=[68, 69, 70]-=-. Most of them are based on distributed MST method. A possible drawback of these distributed method is that it may not perform well under frequent topological changes as it relies on information that ... |

34 |
A ., AND FRIEDER, O. Distributed construction of connected dominating set in wireless ad hoc networks
- WAN, K
- 2002
(Show Context)
Citation Context ...ion, some connectors (also called gateways) are found among all the dominatees to connect the dominators. Then the connectors and the dominators form a connected dominating set. Recently, Wan, et al. =-=[64]-=- and Wu and Lou [15] proposed a communication efficient algorithm to find connectors based on the fact that there are only a constant number of dominators within k-hops of any node. The following obse... |

28 |
Broadcasting Algorithms in Wireless Networks
- Stojmenovic, Seddigh
- 2000
(Show Context)
Citation Context ...es, assuming their location, or existence of their link to a previous transmitting node, are known. The basic method was independently and almost simultaneously (August 2000) proposed in two articles =-=[81, 82]-=-. The methods were called Neighbor Elimination by Stojmenovic and Seddigh [82], while a similar method, called Scalable Broadcast Algorithm, was proposed by Peng and Lu [81]. Two-hop neighbors informa... |

21 | Domination and its applications in ad hoc wireless networks with unidirectional links
- Wu, Li
(Show Context)
Citation Context ...tion and ∆ is the maximum node degree. While the algorithm proposed by Das et al. [55, 56] finds a dominating set and then grows it to a connecting dominating set, the algorithm proposed by Wu and Li =-=[57, 58]-=- takes an opposite approach. They first find a connecting dominating set and then prune out certain redundant nodes from the CDS. The initial CDS C contains all nodes that have at least two non-adjace... |

21 | New metrics for dominating set based energy efficient activity scheduling in ad hoc networks
- Shaikh, Solano-Gonzalez, et al.
- 2003
(Show Context)
Citation Context ...ernal nodes based dominating sets provide static selection for a given round and more energy efficiency than forwarding set based method that requires all nodes to remain active in all the rounds. In =-=[85]-=-, the key for deciding dominating set status is a combination of remained energy and node degree. Xu, Heidemann, and Estrin [86] discuss the following sensor sleep node schedule. The tradeoff between ... |

20 | Localized energy efficient broadcast for wireless networks with directional antennas
- Cartigny, Simplot, et al.
- 2002
(Show Context)
Citation Context ...e distance to its furthest RNG neighbor, excluding the neighbor from which the message came from. Localized energy efficient broadcast for wireless networks with directional antennas are described in =-=[91]-=-, and are also based on RNG. Messages are sent only along RNG edges, requiring about 50% more energy than BIP based [29] globalized solution. However, when the communication overhead for maintenance i... |

16 | Approximate MST for UDG Locally
- Li
- 2003
(Show Context)
Citation Context ...rithms are difficult to design or impossible sometimes. For example, we cannot construct the minimum spanning tree (MST) locally. Recently, Li et al. successfully solved several challenging questions =-=[17, 18, 19, 20, 21, 24, 25]-=- by giving efficient localized algorithms. In all these algorithms, we proved that the total communication cost of all nodes constructing the structure together is O(n log n) bits. MAC Specification: ... |

16 |
A new approach to design and analysis of peer to peer mobile networks
- Chlamtac, Farago
- 1999
(Show Context)
Citation Context |

16 |
The energy efficiency of distributed algorithms for broadcasting in ad hoc networks
- Wieselthier, Nguyen, et al.
- 2002
(Show Context)
Citation Context ...ect to certain optimization criterion. However, none of them takes advantage of the feature that the transmission power of a node can be adjusted. Some distributed heuristics are proposed, such as 10 =-=[68, 69, 70]-=-. Most of them are based on distributed MST method. A possible drawback of these distributed method is that it may not perform well under frequent topological changes as it relies on information that ... |

16 | Target transmission radius over LMST for energy efficient broadcast protocol in ad hoc networks - Ingelrest, Simplot, et al. - 2004 |

14 |
Ophir Frieder. “Coverage in Wireless Ad Hoc Sensor Networks
- Li, Wan
- 2003
(Show Context)
Citation Context ...rithms are difficult to design or impossible sometimes. For example, we cannot construct the minimum spanning tree (MST) locally. Recently, Li et al. successfully solved several challenging questions =-=[17, 18, 19, 20, 21, 24, 25]-=- by giving efficient localized algorithms. In all these algorithms, we proved that the total communication cost of all nodes constructing the structure together is O(n log n) bits. MAC Specification: ... |

14 |
Xiang-Yang Li, and Ophir Frieder, “Minimum-energy broadcast routing in static ad hoc wireless networks
- Wan, Calinescu
- 2001
(Show Context)
Citation Context ...scence generated by this heuristic to the least necessary energy by any arborescence for any set of points. For a pure illustration purpose, another slightsvariation of BIP was discussed in detail in =-=[35]-=-. This greedy heuristic is similar to the Chvatal’s algorithm [36] for the set cover problem and is a variation of BIP. Like BIP, an arborescence, which starts with the source node, is maintained thro... |

14 |
BLMST: A scalable, power-efficient broadcast algorithm for wireless sensor networks
- Li, Hou
- 2003
(Show Context)
Citation Context ... possible drawback of these distributed method is that it may not perform well under frequent topological changes as it relies on information that is multiple hops away to construct the MST. Refer to =-=[71]-=- for more detail. The relative neighborhood graph, the Gabriel graph and the Yao graph all have O(n) edges and contain the Euclidean minimum spanning tree. This implies that we can construct the minim... |

13 |
Ophir Frieder, \New distributed algorithm for connected dominating set in wireless ad hoc networks
- Alzoubi, Wan
- 2002
(Show Context)
Citation Context |

12 |
Ophir Frieder, \Message-optimal connected-dominating-set construction for routing in mobile ad hoc networks
- Alzoubi, Wan
- 2002
(Show Context)
Citation Context ...ized or distributed, is based on global state information. In quasi-global broadcasting, a broadcast protocol is based on partial global state information. For example, the approximation algorithm in =-=[16]-=- is based on building a global spanning tree (a form of partial global state information) that is constructed in a sequence of sequential propagations. In quasi-local broadcasting, a distributed broad... |

12 |
Virtual backbone in wireless ad hoc networks
- Alzoubi
- 2002
(Show Context)
Citation Context ...nnect a dominating 3 set and Robins et al. [40] gave an 4 3 approximation method to connect an independent set. Thus, we can easily have an 8 3 approximation algorithm for MCDS, which was reported in =-=[46]-=-. Recently, Cheng et al. [47] designed a PTAS for MCDS in UDG. However, it is difficult to distributize their method efficiently. 3 Localized Methods 3.1 Based on Distributed CDS A natural structure f... |

11 |
Ophir Frieder. Geometric spanners for wireless ad hoc networks
- Alzoubi, Li, et al.
(Show Context)
Citation Context |

11 | dBBlue: low diameter and self-routing bluetooth scatternet
- Song, Li, et al.
- 2005
(Show Context)
Citation Context |

9 |
Jovisa Zunic, \Dominating sets and neighbor elimination based broadcasting algorithms in wireless networks
- Stojmenovic, Seddigh
- 2002
(Show Context)
Citation Context ...er than those needed to maintain neighborhood information. The neighborhood information needed is either 2-hop neighbors knowledge, or 1-hop neighbor knowledge with their position. Stojmenovic et al. =-=[60]-=- observed that distributed constructions of connecting dominating set can be obtained following the clustering scheme of Lin and Gerla [49]. Connecting dominating set consists of two types of nodes: c... |

8 |
Rajmohan Rajaraman, and Torsten Suel. An efficient distributed algorithm for constructing small dominating sets
- Jia
- 2002
(Show Context)
Citation Context ...tributed methods that approximates the minimum dominating set and the minimum connected dominating set for unit disk graph. 8 3.1.1 Clustering without Geometry Property For general graphs, Jia et al. =-=[54]-=- described and analyzed some randomized distributed algorithms for the minimum dominating set problem that run in polylogarithmic time, independent of the diameter of the network, and that return a do... |

8 |
On the Complexity of Some Arborescences Finding Problems on a Multihop Radio
- Huang, Huang
- 1989
(Show Context)
Citation Context ... order to minimize total energy consumption but still enable a message originated from a source node to reach all the other nodes in an ad-hoc wireless network. The problem is known to be NP-complete =-=[89]-=-. There exist a number of approximate solutions in literature where each node requires global network information (including distances between any two neighboring nodes in the network) in order to dec... |

7 |
Xiang-Yang Li. Localized construction of bounded degree and planar spanner for wireless ad hoc networks
- Wang
- 2003
(Show Context)
Citation Context |

7 |
NC-approximation schemes for NP- and PSPACE -hard problems for geometric graphs
- Stearns
- 1999
(Show Context)
Citation Context ...al independent set is a clustering method. We first review the methods that approximates the maximum independent set, the minimum dominating set, and the minimum connected dominating set. Hunt et al. =-=[41]-=-sand Marathe et al. [42] studied the approximation of the maximum independent set and the minimum dominating set for unit disk graphs. They gave the first PTASs for MDS in UDG. The method is based on ... |

7 | Applications of matroid parity problem to approximating steiner trees
- Berman, Furer, et al.
- 1998
(Show Context)
Citation Context ... dominators within at most 3 hops is connected [44], we have an approximation algorithm (constructing a minimum spanning tree V irtG) for MCDS with approximation ratio 3+ɛ. Notice that, Berman et al. =-=[45]-=- gave an 4 approximation method to connect a dominating 3 set and Robins et al. [40] gave an 4 3 approximation method to connect an independent set. Thus, we can easily have an 8 3 approximation algor... |

7 |
Ophir Frieder; "Localized LowWeight Graph and Its Applications in Wireless Ad Hoc Networks
- Li, Wang, et al.
- 2004
(Show Context)
Citation Context ...1(MST ) and ω1(LMST ) = Θ(n) · ω1(MST ).su 1 u i u n Figure 1: An instance of wireless nodes that every network structures described previously (except MST) have an arbitrarily large total weight. In =-=[21, 73]-=-, we described three low weight planar structures that can be constructed by localized methods with total communication costs O(n). The energy consumption of broadcast based on those structures are wi... |

6 |
An eÆcient distributed algorithm for minimal connected dominating set problem
- Lin, Yang, et al.
- 1991
(Show Context)
Citation Context |

6 |
Distributed Dominant Pruning
- Dai, Wu
(Show Context)
Citation Context ...tio. However, it was shown by Alzoubi et al. [48] that the approximation ratio of this algorithm could be as large as n 2 . Recently, Dai and Wu have proposed a distributed dominant pruning algorithm =-=[59]-=-. Each node has a priority which can be simply its unique identifier or a combination of remaining battery, degree or identifier. A node u is “fully covered” by a subset S of its neighboring nodes if... |

5 |
A polynomial time approximation algorithm for connected dominating set problem in wireless ad hoc networks
- Cheng
- 2002
(Show Context)
Citation Context ...Robins et al. [40] gave an 4 3 approximation method to connect an independent set. Thus, we can easily have an 8 3 approximation algorithm for MCDS, which was reported in [46]. Recently, Cheng et al. =-=[47]-=- designed a PTAS for MCDS in UDG. However, it is difficult to distributize their method efficiently. 3 Localized Methods 3.1 Based on Distributed CDS A natural structure for broadcasting is connected ... |

5 | Efficient and scalable information dissemination in mobile ad hoc networks
- Lipman, Boustead, et al.
(Show Context)
Citation Context ...til either the RAD expires and the packet is then sent, or the packet is dropped (when all its neighbors are already covered by the broadcasts of some of its neighbors). 16 Lipman, Boustead and Judge =-=[95]-=- described the following broadcasting protocol. Upon receiving a broadcast message(s) from a node h, each node i (that was determined by h as a forwarding node) determines which of its one-hop neighbo... |

4 |
Farinaz Koushanfar, Miodrag Potkonjak, and Mani Srivastava, “Coverage problems in wireless ad-hoc sensor network
- Meguerdichian
- 2001
(Show Context)
Citation Context ... and the expected dynamics in these environments present unique challenges in the design of wireless sensor networks. Many excellent researches have been conducted to study problems in this new field =-=[1, 2, 5, 3, 6, 4]-=-. In this chapter, we consider a wireless ad hoc network consisting of a set V of n wireless nodes distributed in a two-dimensional plane. Each wireless node has an omni-directional antenna. This is a... |

3 |
Efficient topology control for wireless networks with non-uniform transmission ranges
- Song, Wang, et al.
(Show Context)
Citation Context |

3 |
Ioanis Nikolaidis, “On minimumenergy broadcasting in all-wireless networks
- Li
- 2001
(Show Context)
Citation Context ... and tracking. In addition, as assumed in [29], there are sufficient bandwidth and transceiver resources. Under these assumptions, centralized (as opposed to distributed) algorithms were presented by =-=[29, 30, 31, 32]-=- for minimum-energy broadcast/multicast routing. These centralized algorithms, in this simple networking environment, are expected to serve as the basis for further studies on distributed algorithms i... |

3 |
Area coverage based beaconless broadcasting in adhoc networks
- Carle, Simplot, et al.
- 2003
(Show Context)
Citation Context ...the communication overhead due to mobility and changes in activity status in BIP are not considered, therefore RBOP is superior to BIP in dynamic ad hoc networks. Li and Hou [71], and Cartigny et al. =-=[96]-=- proposed another localized algorithms, which applies LMST (localized minimal spanning tree) instead of RNG as the broadcast topology. In LMST, proposed in [75], each node calculates local minimum spa... |

2 |
Degree limited RNG
- Stojmenovic
(Show Context)
Citation Context ...f the two edges becomes the longest in the triangle and consequently could not be in RNG. Li denoted modified RNG structure by RNG’. Obviously, RNG’ is a subgraph of traditional RNG. It was proved in =-=[21, 22]-=- that RNG’ still contains a MST as a subgraph. However, RNG’ is still not a low weight structure. Notice that it is well-known that the communication complexity of constructing a minimum spanning tree... |

2 |
Low weighted structures and internal node based broadcasting schemes for wireless ad hoc networks
- Li, Moaveninejad, et al.
- 2003
(Show Context)
Citation Context ...s) is further reduced to planar one by the RNG construction. The solution in [77] is for one-to-one communication model, where message sent from one node is received by only the targeted neighbor. In =-=[78]-=-, Li et al. combine the low-weighted structures and the connected dominating set for energy efficient broadcasting in traditional one-to-many (omnidirectional antenna) networks. Similarly, they propos... |