#### DMCA

## Mobility control and its applications in mobile ad hoc networks (2004)

### Cached

### Download Links

- [www.cse.fau.edu]
- [www.cse.fau.edu]
- [www.ece.ndsu.nodak.edu]
- [venus.ece.ndsu.nodak.edu]
- DBLP

### Other Repositories/Bibliography

Venue: | IEEE Network |

Citations: | 7 - 0 self |

### Citations

1199 | Mobility increases the capacity of ad hoc wireless networks
- Grossglauser, Tse
- 2002
(Show Context)
Citation Context ...ach other within their mutual transmission range, these two nodes will exchange data (based on a probabilistic model) that does not appear in the other node. This scheme extends the Infostation model =-=[15, 17, 34]-=-, where one or several neighbors are selected as intermediate nodes to store the data received from the source and to relay the data when they eventually roam into the transmission range of the destin... |

1199 | The broadcast storm problem in a mobile ad hoc network
- Tseng, Ni, et al.
- 2002
(Show Context)
Citation Context ...herefore, an adaptive approach is desirable that has low redundancy under low mobility, and increases redundancy only when the mobility level rises. Although several probabilistic broadcast protocols =-=[18, 39]-=- have been proposed by trading between efficiency with delivery ratio, it is difficult to establish a direct connection between forwarding probability and node mobility. It was shown in [24] that conn... |

928 | Span: An energyefficient coordination algorithm for topology maintenance in ad hoc wireless networks
- Chen, Jamieson, et al.
- 2001
(Show Context)
Citation Context ...r-based algorithms and localized algorithms. Cluster-based algorithms [2, 5, 14, 23] have a constant approximation ratio in unit disk graphs and relatively slow convergence. In localized algorithms 4s=-=[1, 9, 26, 28, 32, 33, 46, 49]-=-, the status of each node depends on its 2- or 3-hop information only. A localized algorithm takes constant steps to converge, produces a small CDS on average, but has no constant approximation ratio.... |

730 | Minimum energy mobile wireless networks
- Rodoplu, Meng
- 1999
(Show Context)
Citation Context ...the localized algorithm are (1) determining a connected dominating set (CDS) for efficient routing [1, 3, 5, 10], and (2) selecting an appropriate transmission range of each node for topology control =-=[2, 4, 6, 7]-=-. A connected dominating set (CDS) is a subset such that each node in the system is either in the set or the neighbor of a node in the set. The CDS has been used widely to support the notion of virtua... |

715 |
Epidemic routing for partially connected ad hoc networks
- Vahdat, Becker
- 2000
(Show Context)
Citation Context ...c networks is constrained by the mutual interference of concurrent transmissions between nodes. The mobility of nodes adds another dimension of complexity in the mutual interference. Epidemic routing =-=[40]-=- is a scheme to provide eventual delivery in occasionally partitioned networks. It exploits rather than overcomes mobility to achieve a certain degree of connectivity. Basically, when two nodes are mo... |

673 | Topology Control of Multihop Wireless Networks using Transmit Power Adjustment
- Ramanathan, Rosales-Hain
- 2000
(Show Context)
Citation Context ...l Many topology control schemes have been proposed to use a small actual transmission range to conserve energy and bandwidth consumption while maintaining network connectivity. Centralized algorithms =-=[25, 27, 44]-=- construct optimized solutions based on global information and, therefore, are not suitable in MANETs. Probabilistic algorithms [7, 24, 27] adjust transmission range to maintain an optimal number of n... |

549 | Adaptive Clustering for Mobile Wireless Networks - Lin, Gerla - 1997 |

546 | On the construction of energy-efficient broadcast and multicast trees in wireless networks
- Wieselthier, Nguyen, et al.
(Show Context)
Citation Context ...l Many topology control schemes have been proposed to use a small actual transmission range to conserve energy and bandwidth consumption while maintaining network connectivity. Centralized algorithms =-=[25, 27, 44]-=- construct optimized solutions based on global information and, therefore, are not suitable in MANETs. Probabilistic algorithms [7, 24, 27] adjust transmission range to maintain an optimal number of n... |

503 | Comparison of broadcasting techniques for mobile ad hoc networks
- Williams, Camp
- 2002
(Show Context)
Citation Context ...bility issue. Locally formed CDS are frequently used in efficient broadcast protocols, where dominators become forward nodes to rely the broadcast packet. In their simulation study, Williams and Camp =-=[45]-=- showed that localized broadcast protocols suffer low delivery ratio in mobile and congested networks. In a later simulation study [11], Dai and Wu concluded that the major cause of the low delivery r... |

392 | CEDAR: A Core-Extraction Distributed Ad Hoc Routing Algorithm
- Sinha, Sivakumar, et al.
- 1999
(Show Context)
Citation Context ...r-based algorithms and localized algorithms. Cluster-based algorithms [2, 5, 14, 23] have a constant approximation ratio in unit disk graphs and relatively slow convergence. In localized algorithms 4s=-=[1, 9, 26, 28, 32, 33, 46, 49]-=-, the status of each node depends on its 2- or 3-hop information only. A localized algorithm takes constant steps to converge, produces a small CDS on average, but has no constant approximation ratio.... |

373 | Distributed topology control for power efficient operation in multihop wireless ad hoc networks
- Wattenhofer, Li, et al.
(Show Context)
Citation Context ...the localized algorithm are (1) determining a connected dominating set (CDS) for efficient routing [1, 3, 5, 10], and (2) selecting an appropriate transmission range of each node for topology control =-=[2, 4, 6, 7]-=-. A connected dominating set (CDS) is a subset such that each node in the system is either in the set or the neighbor of a node in the set. The CDS has been used widely to support the notion of virtua... |

373 | On calculating connected dominating set for efficient routing in ad hoc wireless networks
- Wu, Li
- 1999
(Show Context)
Citation Context ...ng the localized algorithm achieve some desirable global objectives. Two widely-used applications of the localized algorithm are (1) determining a connected dominating set (CDS) for efficient routing =-=[1, 3, 5, 10]-=-, and (2) selecting an appropriate transmission range of each node for topology control [2, 4, 6, 7]. A connected dominating set (CDS) is a subset such that each node in the system is either in the se... |

367 | Gossip-based ad hoc routing
- Haas, Halpern, et al.
- 2002
(Show Context)
Citation Context ...herefore, an adaptive approach is desirable that has low redundancy under low mobility, and increases redundancy only when the mobility level rises. Although several probabilistic broadcast protocols =-=[18, 39]-=- have been proposed by trading between efficiency with delivery ratio, it is difficult to establish a direct connection between forwarding probability and node mobility. It was shown in [24] that conn... |

341 |
A new statistical approach to geographic variation analysis
- Gabriel, Sokal
- 1969
(Show Context)
Citation Context ...ocols [8, 31], each node determines its logical neighbor set based on positions of 1-hop neighbors. Two nodes u and v are logical neighbors if and only if edge (u, v) exists in RNG. The Gabriel graph =-=[16]-=- is a special case of RNG, where the third node w is restricted to the disk with diameter uv. Rodoplu and Meng [29] gave another method of reducing the number of edges while maintaining network connec... |

327 | Distributed clustering for ad hoc networks
- Basagni
- 1999
(Show Context)
Citation Context ...ms, but their application is limited due to the high maintenance cost. Decentralized algorithms can be further divided into cluster-based algorithms and localized algorithms. Cluster-based algorithms =-=[2, 5, 14, 23]-=- have a constant approximation ratio in unit disk graphs and relatively slow convergence. In localized algorithms 4s[1, 9, 26, 28, 32, 33, 46, 49], the status of each node depends on its 2- or 3-hop i... |

293 |
A design concept for reliable mobile radio networks with frequency hopping signaling
- Ephremides, Wieselthier, et al.
- 1987
(Show Context)
Citation Context ...ms, but their application is limited due to the high maintenance cost. Decentralized algorithms can be further divided into cluster-based algorithms and localized algorithms. Cluster-based algorithms =-=[2, 5, 14, 23]-=- have a constant approximation ratio in unit disk graphs and relatively slow convergence. In localized algorithms 4s[1, 9, 26, 28, 32, 33, 46, 49], the status of each node depends on its 2- or 3-hop i... |

286 |
The relative neighborhood graph of a finite planar set
- TOUSSAINT
- 1980
(Show Context)
Citation Context ...ctual transmission ranges computed from 1-hop location information. Here the 1-hop neighborhood refers to physical neighbors under the normal transmission range. The relative neighborhood graph (RNG) =-=[38]-=- is a geometrical graph used to remove edges (i.e., reduce the number of neighbors) while maintaining network connectivity. An edge (u, v) is removed if there exists a third node w such that d(u, v) >... |

272 | Design and analysis of an MST-based topology control algorithm
- Li, Hou, et al.
- 2005
(Show Context)
Citation Context ...the localized algorithm are (1) determining a connected dominating set (CDS) for efficient routing [1, 3, 5, 10], and (2) selecting an appropriate transmission range of each node for topology control =-=[2, 4, 6, 7]-=-. A connected dominating set (CDS) is a subset such that each node in the system is either in the set or the neighbor of a node in the set. The CDS has been used widely to support the notion of virtua... |

269 | Distributed construction of connected dominating set in wireless ad hoc networks
- Wang, Alzoubi, et al.
- 2002
(Show Context)
Citation Context ...n also examines some preliminary work on the mobility control issue. 3.1 CDS formation Both centralized and decentralized algorithms have been proposed to form a CDS in MANETs. Centralized algorithms =-=[12, 41]-=- usually yield a smaller CDS than decentralized algorithms, but their application is limited due to the high maintenance cost. Decentralized algorithms can be further divided into cluster-based algori... |

263 |
Associativity-based routing for ad hoc mobile networks
- Toh
- 1997
(Show Context)
Citation Context ...veral papers [6] addressed the issue of how long two nodes will remain in close enough proximity for a link between them to remain active. Several routing protocols, associativity-based routing (ABR) =-=[37]-=- and signal stability-based adaptive routing (SSA) [13], have been proposed that select stable links to construct a route. In [36], GPS information is used to estimate the expiration time of the link ... |

261 | Max–min d-cluster formation in wireless ad hoc networks
- Amis, Prakash, et al.
- 2000
(Show Context)
Citation Context ...g set, but not necessarily a CDS. To get a connected dominating set, each core designates several gateway nodes to connect neighboring cores within 3 hops [33]. This scheme was extended by Amis et al =-=[3]-=- to form a d hop dominating set. 5s3.2 Topology control Many topology control schemes have been proposed to use a small actual transmission range to conserve energy and bandwidth consumption while mai... |

224 | The shared wireless infostation model - a new ad hoc networking paradigm (or where there is a whale, there is a way
- Small, Haas
- 2003
(Show Context)
Citation Context ...ach other within their mutual transmission range, these two nodes will exchange data (based on a probabilistic model) that does not appear in the other node. This scheme extends the Infostation model =-=[15, 17, 34]-=-, where one or several neighbors are selected as intermediate nodes to store the data received from the source and to relay the data when they eventually roam into the transmission range of the destin... |

206 | Multipoint relaying for flooding broadcast messages in mobile wireless networks
- Qayyum, Viennot, et al.
- 2002
(Show Context)
Citation Context ...unning the localized algorithm achieve some desirable global objectives. Two popular applications of the localized algorithm are (1) determining a connected dominating set (CDS) for efficient routing =-=[10, 26, 35, 49]-=-, and (2) selecting an appropriate transmission range of each node for topology control [22, 29, 42, 43]. A CDS is a subset such that each node in the system is either in the set or the neighbor of a ... |

170 | Analysis of A Cone-based Distributed Topology Control Algorithm for Wireless Multi-hop Networks
- Li, Halpern, et al.
- 2001
(Show Context)
Citation Context ..., the Li and Halpern’s algorithm is equivalent to constructing a local shortest path tree (SPT) where only neighbors of the root in SPT become logical neighbors. In cone-based topology control (CBTC) =-=[21, 43]-=-, the logical neighbor set {w1, w2, . . . , wk} of node v is selected to satisfy the following condition: if a disk centered at v is divided into k cones by lines vwi 6s(1 ≤ i ≤ k), the angle of the m... |

165 |
Dominating sets and neighbor elimination based broadcasting algorithms in wireless networks
- Stojmenovic, Seddigh, et al.
- 2002
(Show Context)
Citation Context ...ng the localized algorithm achieve some desirable global objectives. Two widely-used applications of the localized algorithm are (1) determining a connected dominating set (CDS) for efficient routing =-=[1, 3, 5, 10]-=-, and (2) selecting an appropriate transmission range of each node for topology control [2, 4, 6, 7]. A connected dominating set (CDS) is a subset such that each node in the system is either in the se... |

164 | Constructing minimum energy mobile wireless networks
- Li, Wan
- 2001
(Show Context)
Citation Context ..., using transmission power as edge cost. An edge (u, v) can be removed if there exists another node w, such that the 2-hop path (u, w, v) consumes less energy than direct transmission. Li and Halpern =-=[20]-=- extended this scheme by using k-hop (k ≥ 2) paths to remove more edges and, at the same time, reduce the computation overhead. In both protocols [20] and [29], instead of selecting logical neighbors ... |

163 | Signal stability based adaptive routing (SSA) for ad hoc mobile networks
- Dube, Rais, et al.
- 1997
(Show Context)
Citation Context ...des will remain in close enough proximity for a link between them to remain active. Several routing protocols, associativity-based routing (ABR) [37] and signal stability-based adaptive routing (SSA) =-=[13]-=-, have been proposed that select stable links to construct a route. In [36], GPS information is used to estimate the expiration time of the link between two adjacent hosts. Recently, several studies h... |

138 | Mobility prediction and routing in ad hoc wireless networks
- Su, Lee, et al.
- 2001
(Show Context)
Citation Context ... active. Several routing protocols, associativity-based routing (ABR) [37] and signal stability-based adaptive routing (SSA) [13], have been proposed that select stable links to construct a route. In =-=[36]-=-, GPS information is used to estimate the expiration time of the link between two adjacent hosts. Recently, several studies have been done on the effect of mobility on routing path [30]. However, no b... |

121 | I.: Localized minimum-energy broadcasting in adhoc networks
- Cartigny, Simplot, et al.
- 2003
(Show Context)
Citation Context ...ge (u, v) is removed if there exists a third node w such that d(u, v) > d(u, w) and d(u, v) > d(v, w), where d(u, v) is the Euclidean distance between u and v. In localized topology control protocols =-=[8, 31]-=-, each node determines its logical neighbor set based on positions of 1-hop neighbors. Two nodes u and v are logical neighbors if and only if edge (u, v) exists in RNG. The Gabriel graph [16] is a spe... |

118 | Routing in Ad-Hoc Networks Using a Spine
- Das, Sivakumar, et al.
- 1997
(Show Context)
Citation Context ...n also examines some preliminary work on the mobility control issue. 3.1 CDS formation Both centralized and decentralized algorithms have been proposed to form a CDS in MANETs. Centralized algorithms =-=[12, 41]-=- usually yield a smaller CDS than decentralized algorithms, but their application is limited due to the high maintenance cost. Decentralized algorithms can be further divided into cluster-based algori... |

118 | S.: Algorithmic aspects of topology control problems for ad hoc networks. Mobile Networks and Applications
- Lloyd, Liu, et al.
- 2005
(Show Context)
Citation Context ...l Many topology control schemes have been proposed to use a small actual transmission range to conserve energy and bandwidth consumption while maintaining network connectivity. Centralized algorithms =-=[25, 27, 44]-=- construct optimized solutions based on global information and, therefore, are not suitable in MANETs. Probabilistic algorithms [7, 24, 27] adjust transmission range to maintain an optimal number of n... |

97 | Enhancing Ad Hoc Routing with Dynamic Virtual Infrastructures
- Sinha, Sivakumar, et al.
- 2001
(Show Context)
Citation Context ...r-based algorithms and localized algorithms. Cluster-based algorithms [2, 5, 14, 23] have a constant approximation ratio in unit disk graphs and relatively slow convergence. In localized algorithms 4s=-=[1, 9, 26, 28, 32, 33, 46, 49]-=-, the status of each node depends on its 2- or 3-hop information only. A localized algorithm takes constant steps to converge, produces a small CDS on average, but has no constant approximation ratio.... |

91 | The infostations challenge: balancing cost and ubiquity in delivering wireless data
- Frenkiel, Badrinath, et al.
- 2000
(Show Context)
Citation Context ...ach other within their mutual transmission range, these two nodes will exchange data (based on a probabilistic model) that does not appear in the other node. This scheme extends the Infostation model =-=[15, 17, 34]-=-, where one or several neighbors are selected as intermediate nodes to store the data received from the source and to relay the data when they eventually roam into the transmission range of the destin... |

84 | Distributed heuristic for connected dominating sets in wireless ad hoc networks
- Alzoubi, Wan, et al.
- 2002
(Show Context)
Citation Context ...ms, but their application is limited due to the high maintenance cost. Decentralized algorithms can be further divided into cluster-based algorithms and localized algorithms. Cluster-based algorithms =-=[2, 5, 14, 23]-=- have a constant approximation ratio in unit disk graphs and relatively slow convergence. In localized algorithms 4s[1, 9, 26, 28, 32, 33, 46, 49], the status of each node depends on its 2- or 3-hop i... |

83 | The k-neigh protocol for symmetric topology control in ad hoc networks
- Blough, Leoncini, et al.
- 2003
(Show Context)
Citation Context ...le maintaining network connectivity. Centralized algorithms [25, 27, 44] construct optimized solutions based on global information and, therefore, are not suitable in MANETs. Probabilistic algorithms =-=[7, 24, 27]-=- adjust transmission range to maintain an optimal number of neighbors, which balances energy consumption, contention level, and connectivity. However, they do not provide hard guarantees on network co... |

80 | Fault-tolerant and 3-dimensional distributed topology control algorithms in wireless multi-hop networks
- Bahramgiri, Hajiaghayi, et al.
- 2006
(Show Context)
Citation Context ...graph after removing all unidirectional edges) is connected. Several optimizations are also proposed in [21] to further reduce the number of logical neighbors and transmission range. Bahramgiri et al =-=[4]-=- extended CBTC to provide k-connectivity with α ≤ 2π/3k. Similar to the minimum-energy algorithms, CBTC uses dynamic search regions to reduce control overhead. Furthermore, CBTC requires only directio... |

77 | Paths: analysis of path duration statistics and their impact on reactive manet routing protocols
- Sadagopan, Bai, et al.
- 2003
(Show Context)
Citation Context ...ct a route. In [36], GPS information is used to estimate the expiration time of the link between two adjacent hosts. Recently, several studies have been done on the effect of mobility on routing path =-=[30]-=-. However, no broadcast protocol uses the notion of stable link to evaluate the stability of neighbor set in order to better decide the forwarding status of each node. In general, the capacity of ad h... |

77 | Extended dominating-set-based routing in ad hoc wireless networks with unidirectional links
- Wu
(Show Context)
Citation Context |

74 | Computing Connected Dominated Sets with Multipoint Relays
- Adjih, Jacquet, et al.
- 2005
(Show Context)
Citation Context |

45 |
Distributed dominant pruning in ad hoc wireless networks
- Dai, Wu
- 2003
(Show Context)
Citation Context ...ng the localized algorithm achieve some desirable global objectives. Two widely-used applications of the localized algorithm are (1) determining a connected dominating set (CDS) for efficient routing =-=[1, 3, 5, 10]-=-, and (2) selecting an appropriate transmission range of each node for topology control [2, 4, 6, 7]. A connected dominating set (CDS) is a subset such that each node in the system is either in the se... |

43 | Distributed Spanner with Bounded Degree for Wireless Networks
- Wang, Li, et al.
- 2003
(Show Context)
Citation Context |

32 | Mobility-sensitive topology control in mobile ad hoc networks
- Wu, Dai
- 2004
(Show Context)
Citation Context ...tain degree of internode synchronization, which introduces extra overhead. When maintaining consistent local views becomes too expensive or impossible, another approach called conservative local view =-=[9]-=- can be applied, which makes conservative decisions based on inconsistent views. No synchronization is necessary. A conservative decision is one 8sthat maintains the global property with the penalty o... |

27 | Mobility management and its applications in efficient broadcasting in mobile ad hoc networks
- Wu, Dai
- 2004
(Show Context)
Citation Context ...ay and mobility management: How protocols deal with imprecise neighborhood information caused by node mobility and various delays introduced at different stages of protocol handshake. One solution in =-=[8]-=-, as will be discussed later in detail, uses two transmission ranges to address the link availability issue. First, a transmission range r is determined based on the selected protocol. This transmissi... |

24 |
Mobilegrid: Capacity-aware topology control in mobile ad hoc networks
- Liu, Li
(Show Context)
Citation Context ...le maintaining network connectivity. Centralized algorithms [25, 27, 44] construct optimized solutions based on global information and, therefore, are not suitable in MANETs. Probabilistic algorithms =-=[7, 24, 27]-=- adjust transmission range to maintain an optimal number of neighbors, which balances energy consumption, contention level, and connectivity. However, they do not provide hard guarantees on network co... |

13 | Distributed routing algorithm for wireless ad hoc networks using d-hop connected dominating sets
- Rieck, Pai, et al.
- 2002
(Show Context)
Citation Context |

7 |
A reliable route selection algorithm using global positioning systems in mobile ad-hoc networks
- Kim, Kwon, et al.
- 2001
(Show Context)
Citation Context ...not clear whether the resultant topology is still resilient to mobility after optimization. Very little work has been done in maintaining an accurate neighbor set in ad hoc networks. One exception is =-=[19]-=-, where a stable zone and a caution zone of each node has been defined based on a node’s position, speed, and direction information obtained from GPS. Specifically, stable zone is the area in which a ... |

6 |
Route selection in mobile multimedia ad hoc networks
- Basagni, Chlamtac, et al.
- 1999
(Show Context)
Citation Context ...S-based, which comes with a cost, as will be discussed in the next subsection. In addition, there is no rigorous analysis on the impact of mobility on the selection of these two zones. Several papers =-=[6]-=- addressed the issue of how long two nodes will remain in close enough proximity for a link between them to remain active. Several routing protocols, associativity-based routing (ABR) [37] and signal ... |

6 |
RNG and internal node based broadcasting in one-to-one wireless networks
- Seddigh, Solano, et al.
- 2001
(Show Context)
Citation Context ...ge (u, v) is removed if there exists a third node w such that d(u, v) > d(u, w) and d(u, v) > d(v, w), where d(u, v) is the Euclidean distance between u and v. In localized topology control protocols =-=[8, 31]-=-, each node determines its logical neighbor set based on positions of 1-hop neighbors. Two nodes u and v are logical neighbors if and only if edge (u, v) exists in RNG. The Gabriel graph [16] is a spe... |

4 | Performance comparison of broadcast protocols for ad hoc networks based on self-pruning - Dai, Wu - 2004 |