## Efficient Communication Strategies for Ad-Hoc Wireless Networks (2000)

### Cached

### Download Links

Citations: | 34 - 3 self |

### BibTeX

@MISC{Adler00efficientcommunication,

author = {Micah Adler and Christian Scheideler},

title = {Efficient Communication Strategies for Ad-Hoc Wireless Networks},

year = {2000}

}

### Years of Citing Articles

### OpenURL

### Abstract

An ad-hoc wireless network is a collection of wireless mobile hosts forming a temporary network without the aid of any established infrastructure or centralized administration. This type of network is of great importance in situations where it is very difficult to provide the necessary infrastructure, but it is a challenging task to enable fast and reliable communication within such a network. In this paper, we model and analyze the performance of so-called power-controlled ad-hoc wireless networks: networks where the mobile hosts are able to change their transmission power. We concentrate on finding schemes for routing arbitrary permutations in these networks. In general, it is NP-hard even to find a n 1 -approximation for any constant to the fastest possible strategy for routing a given permutation problem on n mobile hosts. However, we here demonstrate that if we allow ourselves to consider slightly less general problems, efficient solutions can be found. We first demonstrate that there is a natural class of distributed schemes for handling nodeto-node communication on top of which online route selection and scheduling strategies can be constructed such that the performance of this class of schemes can be exploited in a nearly optimal way for routing permutations in any static power-controlled ad-hoc network. We then demonstrate

### Citations

279 | Probabilistic construction of deterministic algorithms: Approximating packing integer programs - Raghavan - 1988 |

206 | A scheme for fast parallel communication - Valiant - 1982 |

197 | Aloha packet system with and without slots and capture - Roberts - 1975 |

167 | A Perspective on Multiaccess Channels - Gallager - 1985 |

134 | A lower bound for radio broadcast - ALON, BAR-NOY, et al. - 1991 |

122 | Making transmission schedules immune to topology changes in multi-hop packet radio networks - Chlamtac, Farago - 1994 |

113 | consumption in packet radionetworks - Kirousis, Krizanc, et al. - 2000 |

111 | On the time-complexity of broadcast in multi-hop radio networks: an exponential gap between determinism and randomization - BAR-YEHUDA, GOLDREICH, et al. - 1992 |

107 | Distributed assignment algorithms for multihop packet radio networks - Cidon, Sidi - 1989 |

101 | The wave expansion approach to broadcasting in multi-hop radio networks - CHLAMTAC, WEINSTEIN - 1991 |

91 | Stochastic power control for cellular radio systems - Ulukus, Yates - 1998 |

89 | On broadcasting in radio networks problem analysis and protocol design - Chlamtac, Kutten - 1985 |

89 |
L.: A New Model for Scheduling Packet Radio Networks
- Sen, Huson
- 1996
(Show Context)
Citation Context ...eless communication problems, such as the problem of finding an optimal broadcast schedule [9] or scheduling transmissions in the case where every node wants to send a message to one of its neighbors =-=[36]-=-. With a similar reduction from Chromatic Number, the following result can be shown. Remark 1.2 Given a transmission graph and a collection of n routes, even finding a schedule with a runtime that is ... |

80 | Protocols for Adaptive Wireless and Mobile Networking - Johnson, Maltz - 1996 |

75 | Universal packet routing algorithms - Leighton, Maggs, et al. - 1988 |

69 | Medium Access Control of Wireless LANs for Mobile Computing - Chen - 1994 |

65 | Multiple communication in multihop radio networks - Bar-Yehuda, Israeli, et al. - 1993 |

57 | A mobile host protocol supporting route optimization and authentication - Myles, Johnson, et al. - 1995 |

52 | Broadcast in radio networks - Gaber, Mansour - 1995 |

50 | Distributed nodes organization algorithm for channel access in a multihop dynamic radio network - Chlamtac, Pinter - 1987 |

49 |
Lower bounds for the broadcast problem in mobile radio networks
- Bruschi, Pinto
- 1997
(Show Context)
Citation Context ...se that a conflict can be detected and the case that it cannot be detected. Studies of multi-hop PRNs have mainly concentrated on broadcasting problems. Lower bounds on this problem are considered in =-=[1, 26, 3, 20, 6]-=-. A number of papers also deal with constructing efficient broadcast protocols [9, 39, 11, 3, 17, 34]. Let n denote the size, D denote the diameter, and \Delta denote the maximum degree of a given PRN... |

48 |
Routing in Ad Hoc Networks Using a Virtual Backbone
- Das, Sivakumar, et al.
(Show Context)
Citation Context ...rmation. For early work, see e.g. [10, 12, 31]. Recent results can be found in [8, 5]. Also, the problem of selecting routes and updating routes when mobile hosts move has been considered. See, e.g., =-=[28, 23, 16]-=- for different route selection strategies and further references. Similar problems have been studied for various dynamic network models. See Dolev et al. [15] for a survey of results in this area. 1.2... |

36 | Routing permutations on graphs via matching
- Alon, Chung, et al.
- 1994
(Show Context)
Citation Context ...mes for the other two layers that almost optimally exploit the power of the MAC layer protocols for any transmission graph. For this we introduce a parameter R(G; S), similar to the routing number of =-=[2, 29]-=-, that represents a lower bound on the expected time required to route a random permutation in G using the MAC scheme S. We present online strategies for the route selection layer and scheduling layer... |

34 | Universal algorithms for store-and-forward and wormhole routing - Cypher, Heide, et al. - 1996 |

34 | On the Connectivity of Radio Networks - Piret - 1991 |

34 | Distributed packet switching in arbitrary networks
- Rabani, Tardos
- 1996
(Show Context)
Citation Context ...ing packets along an arbitrary path collection of size n with dilationsD, congestion C and edge latency L in time O(C + D log n), w.h.p. With a more involved proof that combines the ideas in [14] and =-=[32]-=- with Theorem 2.9, the following result can be shown. Theorem 2.13 There is an online protocol for sending packets along an arbitrary simple path collection of size n with dilation D, congestion C, ma... |

32 | Asymptotically tight bounds for computing with faulty arrays of processors
- Kaklamanis, Karlin, et al.
- 1990
(Show Context)
Citation Context ...n space is exactly a square. In this case, we take advantage of the considerable similarity between randomly distributed nodes in such a domain space and existing work on computing with faulty arrays =-=[33, 24, 13]-=-. Let a Z-partition of a square domain space be a partition of the domain space into exactly Z equal sized square regions and let r ij denote the region in the i th row and the j th column, counting f... |

24 | Bubbles: adaptive routing scheme for high-speed dynamic networks - Dolev, Kranakis, et al. - 1999 |

15 |
Robust algorithms for packet routing in a mesh
- Raghavan
- 1989
(Show Context)
Citation Context ...n space is exactly a square. In this case, we take advantage of the considerable similarity between randomly distributed nodes in such a domain space and existing work on computing with faulty arrays =-=[33, 24, 13]-=-. Let a Z-partition of a square domain space be a partition of the domain space into exactly Z equal sized square regions and let r ij denote the region in the i th row and the j th column, counting f... |

14 | A distributed evolutionary algorithm for reorganizing network communications - Post, Kershenbaum, et al. - 1985 |

7 | The time complexity of deterministic broadcast radio networks - Hwang - 1995 |

7 | Asymptotically optimal gossiping in radio networks - Ravishankar, Singh - 1995 |

6 | Congestion relief on power-controlled CDMA networks - Jacobsmeyer - 1996 |

3 | Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols. To appear at - Heide, Scheideler - 1996 |

3 | Distributed packet switching in arbitrary networks - Tardos - 1996 |

3 | An \Omega\Gamma D log(N=D)) lower bound for broadcast in radio networks
- Kushilevitz, Mansour
- 1993
(Show Context)
Citation Context ...se that a conflict can be detected and the case that it cannot be detected. Studies of multi-hop PRNs have mainly concentrated on broadcasting problems. Lower bounds on this problem are considered in =-=[1, 26, 3, 20, 6]-=-. A number of papers also deal with constructing efficient broadcast protocols [9, 39, 11, 3, 17, 34]. Let n denote the size, D denote the diameter, and \Delta denote the maximum degree of a given PRN... |

2 | A robust multi-priority topology-independent transmission schedule for packet radio networks - Boztas - 1995 |

2 | Deterministic routing with bounded bu ers: turning o ine into onlines protocols - Heide, Scheideler - 1996 |

1 | Recon arrays with random faults - Cole, Maggs, et al. - 1997 |

1 |
Reconfiguringarrays with random faults
- Cole, Maggs, et al.
- 1997
(Show Context)
Citation Context ...n space is exactly a square. In this case, we take advantage of the considerable similarity between randomly distributed nodes in such a domain space and existing work on computing with faulty arrays =-=[33, 24, 13]-=-. Let a Z-partition of a square domain space be a partition of the domain space into exactly Z equal sized square regions and let r ij denote the region in the i th row and the j th column, counting f... |

1 |
Asymptoticallyoptimal gossiping in radio networks
- Ravishankar, Singh
- 1995
(Show Context)
Citation Context ... PRNs have mainly concentrated on broadcasting problems. Lower bounds on this problem are considered in [1, 26, 3, 20, 6]. A number of papers also deal with constructing efficient broadcast protocols =-=[9, 39, 11, 3, 17, 34]-=-. Let n denote the size, D denote the diameter, and \Delta denote the maximum degree of a given PRN. Bar-Yehuda et al. [3], for instance, present a randomized distributed broadcast protocol that compl... |