Results 1  10
of
193
Routing with Guaranteed Delivery in ad hoc Wireless Networks
 WIRELESS NETWORKS
, 2001
"... We consider routing problems in ad hoc wireless networks modeled as unit graphs in which nodes are points in the plane and two nodes can communicate if the distance between them is less than some fixed unit. We describe the first distributed algorithms for routing that do not require duplication of ..."
Abstract

Cited by 648 (74 self)
 Add to MetaCart
We consider routing problems in ad hoc wireless networks modeled as unit graphs in which nodes are points in the plane and two nodes can communicate if the distance between them is less than some fixed unit. We describe the first distributed algorithms for routing that do not require duplication of packets or memory at the nodes and yet guarantee that a packet is delivered to its destination. These algorithms can be extended to yield algorithms for broadcasting and geocasting that do not require packet duplication. A byproduct of our results is a simple distributed protocol for extracting a planar subgraph of a unit graph. We also present simulation results on the performance of our algorithms.
A Survey on PositionBased Routing in Mobile AdHoc Networks
 IEEE Network
, 2001
"... We present an overview of adhoc routing protocols that make forwarding decisions based on the geographical position of a packet's destination. Other than the destination 's position, each node needs to know only its own position and the position of its onehop neighbors in order to forward packets. ..."
Abstract

Cited by 356 (14 self)
 Add to MetaCart
We present an overview of adhoc routing protocols that make forwarding decisions based on the geographical position of a packet's destination. Other than the destination 's position, each node needs to know only its own position and the position of its onehop neighbors in order to forward packets. Since it is not necessary to maintain explicit routes, positionbased routing does scale well even if the network is highly dynamic. This is a major advantage in a mobile adhoc network where the topology may change frequently. The main prerequisite for positionbased routing is that a sender can obtain the current position of the destination. Therefore, recently proposed location services are discussed in addition to positionbased packet forwarding strategies. We provide a qualitative comparison of the approaches in both areas and investigate opportunities for future research.
Geometric AdHoc Routing: Of Theory and Practice
, 2003
"... All too often a seemingly insurmountable divide between theory and practice can be witnessed. In this paper we try to contribute to narrowing this gap in the field of adhoc routing. In particular we consider two aspects: We propose a new geometric routing algorithm which is outstandingly e#cient on ..."
Abstract

Cited by 235 (11 self)
 Add to MetaCart
All too often a seemingly insurmountable divide between theory and practice can be witnessed. In this paper we try to contribute to narrowing this gap in the field of adhoc routing. In particular we consider two aspects: We propose a new geometric routing algorithm which is outstandingly e#cient on practical averagecase networks, however is also in theory asymptotically worstcase optimal. On the other hand we are able to drop the formerly necessary assumption that the distance between network nodes may not fall below a constant value, an assumption that cannot be maintained for practical networks. Abandoning this assumption we identify from a theoretical point of view two fundamentamentally di#erent classes of cost metrics for routing in adhoc networks.
PowerAware Localized Routing in Wireless Networks
, 2000
"... Recently, a cost aware metric for wireless networks based on remaining battery power at nodes was proposed for shortestcost routing algorithms, assuming constant transmission power. Power aware metrics where transmission power depends on distance between nodes, and corresponding shortestpower algo ..."
Abstract

Cited by 206 (32 self)
 Add to MetaCart
Recently, a cost aware metric for wireless networks based on remaining battery power at nodes was proposed for shortestcost routing algorithms, assuming constant transmission power. Power aware metrics where transmission power depends on distance between nodes, and corresponding shortestpower algorithms were also recently proposed. We define a new powercost metric based on the combination of both node's lifetime and distance based power metrics. We investigate some properties of power adjusted transmissions, and show that, if additional nodes can be placed at desired locations between two nodes at distance d, the transmission power can be made linear in d as opposed to d a dependence for a2. This provides basis for power, cost, and powercost localized routing algorithms, where nodes make routing decisions solely on the basis of location of their neighbors and destination. Power aware routing algorithm attempts to minimize the total power needed to route a message between a source...
WorstCase Optimal and AverageCase Efficient Geometric AdHoc Routing
, 2003
"... In this paper we present GOAFR, a new geometric adhoc routing algorithm combining greedy and face routing. We evaluate this algorithm by both rigorous analysis and comprehensive simulation. GOAFR is the first adhoc algorithm to be both asymptotically optimal and averagecase e#cient. For our simul ..."
Abstract

Cited by 180 (13 self)
 Add to MetaCart
In this paper we present GOAFR, a new geometric adhoc routing algorithm combining greedy and face routing. We evaluate this algorithm by both rigorous analysis and comprehensive simulation. GOAFR is the first adhoc algorithm to be both asymptotically optimal and averagecase e#cient. For our simulations we identify a network density range critical for any routing algorithm. We study a dozen of routing algorithms and show that GOAFR outperforms other prominent algorithms, such as GPSR or AFR.
Mobile ad hoc networking: imperatives and challenges
, 2003
"... Mobile ad hoc networks (MANETs) represent complex distributed systems that comprise wireless mobile nodes that can freely and dynamically selforganize into arbitrary and temporary, "adhoc" network topologies, allowing people and devices to seamlessly internetwork in areas with no preexisting comm ..."
Abstract

Cited by 170 (7 self)
 Add to MetaCart
Mobile ad hoc networks (MANETs) represent complex distributed systems that comprise wireless mobile nodes that can freely and dynamically selforganize into arbitrary and temporary, "adhoc" network topologies, allowing people and devices to seamlessly internetwork in areas with no preexisting communication infrastructure, e.g., disaster recovery environments. Ad hoc networking concept is not a new one, having been around in various forms for over 20 years. Traditionally, tactical networks have been the only communication networking application that followed the ad hoc paradigm. Recently, the introduction of new technologies such as the Bluetooth, IEEE 802.11 and Hyperlan are helping enable eventual commercial MANET deployments outside the military domain. These recent evolutions have been generating a renewed and growing interest in the research and development of MANET. This paper attempts to provide a comprehensive overview of this dynamic field. It first explains the important role that mobile ad hoc networks play in the evolution of future wireless technologies. Then, it reviews the latest research activities in these areas, including a summary of MANET's characteristics, capabilities, applications, and design constraints. The paper concludes by presenting a set of challenges and problems requiring further research in the future.
Applicationlayer multicast with Delaunay triangulations
 IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS
, 2002
"... Applicationlayer multicast supports group applications without the need for a networklayer multicast protocol. Here, applications arrange themselves in a logical overlay network and transfer data within the overlay. In this paper, we present an applicationlayer multicast solution that uses a Del ..."
Abstract

Cited by 145 (3 self)
 Add to MetaCart
Applicationlayer multicast supports group applications without the need for a networklayer multicast protocol. Here, applications arrange themselves in a logical overlay network and transfer data within the overlay. In this paper, we present an applicationlayer multicast solution that uses a Delaunay triangulation as an overlay network topology. An advantage of using a Delaunay triangulation is that it allows each application to locally derive nexthop routing information without requiring a routing protocol in the overlay. A disadvantage of using a Delaunay triangulation is that the mapping of the overlay to the network topology at the network and data link layer may be suboptimal. We present a protocol, called Delaunay triangulation (DT protocol), which constructs Delaunay triangulation overlay networks. We present measurement experiments of the DT protocol for overlay networks with up to 10 000 members, that are running on a local PC cluster with 100 Linux PCs. The results show that the protocol stabilizes quickly, e.g., an overlay network with 10 000 nodes can be built in just over 30 s. The traffic measurements indicate that the average overhead of a node is only a few kilobits per second if the overlay network is in a steady state. Results of throughput experiments of multicast transmissions (using TCP unicast connections between neighbors in the overlay network) show an achievable throughput of approximately 15 Mb/s in an overlay with 100 nodes and 2 Mb/s in an overlay with 1000 nodes.
Minimum energy mobile wireless networks revisited
 In IEEE International Conference on Communications (ICC
, 2001
"... Energy conservation is a critical issue in designing wireless ad hoc networks, as the nodes are powered by batteries only. Given a set of wireless network nodes, the directed weighted transmission graph Gt has an edge uv if and only if node v is in the transmission range of node u and the weight of ..."
Abstract

Cited by 119 (8 self)
 Add to MetaCart
Energy conservation is a critical issue in designing wireless ad hoc networks, as the nodes are powered by batteries only. Given a set of wireless network nodes, the directed weighted transmission graph Gt has an edge uv if and only if node v is in the transmission range of node u and the weight of uv is typically defined as II,,vll + c for a constant 2 <_ t ~ < 5 and c> O. The minimum power topology Gm is the smallest subgraph of Gt that contains the shortest paths between all pairs of nodes, i.e., the union of all shortest paths. In this paper, we described a distributed positionbased networking protocol to construct an enclosure graph G~, which is an approximation of Gin. The time complexity of each node u is O(min(dG ~ (u)dG ~ (u), dG ~ (u) log dG ~ (u))), where dc(u) is the degree of node u in a graph G. The space required at each node to compute the minimum power topology is O(dG ~ (u)). This improves the previous result that computes Gm in O(dG, (u) a) time using O(dGt(U) 2) spaces. We also show that the average degree dG,(u) is usually a constant, which is at most 6. Our result is first developed for stationary network and then extended to mobile networks. I.
Distributed Construction of a Planar Spanner and Routing for Ad Hoc Wireless Networks
, 2002
"... Several localized routing protocols [1] guarantee the delivery of the packets when the underlying network topology is the Delaunay triangulation of all wireless nodes. However, it is expensive to construct the Delaunay triangulation in a distributed manner. Given a set of wireless nodes, we more acc ..."
Abstract

Cited by 110 (21 self)
 Add to MetaCart
Several localized routing protocols [1] guarantee the delivery of the packets when the underlying network topology is the Delaunay triangulation of all wireless nodes. However, it is expensive to construct the Delaunay triangulation in a distributed manner. Given a set of wireless nodes, we more accurately model the network as a unitdisk graph UDG , in which a link in between two nodes exist only if the distance in between them is at most the maximum transmission range.
Online Routing in Triangulations
 IN PROC. OF THE 10 TH ANNUAL INT. SYMP. ON ALGORITHMS AND COMPUTATION ISAAC
, 1999
"... We consider online routing strategies for routing between the vertices of embedded planar straight line graphs. Our results include (1) two deterministic memoryless routing strategies, one that works for all Delaunay triangulations and the other that works for all regular triangulations, (2) a ..."
Abstract

Cited by 107 (11 self)
 Add to MetaCart
We consider online routing strategies for routing between the vertices of embedded planar straight line graphs. Our results include (1) two deterministic memoryless routing strategies, one that works for all Delaunay triangulations and the other that works for all regular triangulations, (2) a randomized memoryless strategy that works for all triangulations, (3) an O(1) memory strategy that works for all convex subdivisions, (4) an O(1) memory strategy that approximates the shortest path in Delaunay triangulations, and (5) theoretical and experimental results on the competitiveness of these strategies.