Results 1 
3 of
3
An Ω(D log(N/D)) Lower Bound for Broadcast in Radio Networks
 SIAM Journal on Computing
, 1998
"... Abstract. We show that for any randomized broadcast protocol for radio networks, there exists a network in which the expected time to broadcast a message is Ω(D log(N/D)), where D is the diameter of the network and N is the number of nodes. This implies a tight lower bound of Ω(D log N) for any D ≤ ..."
Abstract

Cited by 126 (4 self)
 Add to MetaCart
Abstract. We show that for any randomized broadcast protocol for radio networks, there exists a network in which the expected time to broadcast a message is Ω(D log(N/D)), where D is the diameter of the network and N is the number of nodes. This implies a tight lower bound of Ω(D log N) for any D ≤ N 1−ε, where ε>0 is any constant.
Efficient Communication Strategies for AdHoc Wireless Networks
, 2000
"... An adhoc 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 infrastructur ..."
Abstract

Cited by 37 (3 self)
 Add to MetaCart
(Show Context)
An adhoc 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 socalled powercontrolled adhoc 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 NPhard 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 nodetonode 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 powercontrolled adhoc network. We then demonstrate
An Omega(D log(N/D)) Lower Bound for Broadcast in Radio Networks
 12th ACM Symp. on Principles of Distributed Computing
, 1996
"... We show that for any randomized broadcast protocol for radio networks, there exists a network in which the expected time to broadcast a message is \Omega\Gamma D log(N=D)), where D is the diameter of the network and N is the number of nodes. This implies a tight lower bound of \Omega\Gamma D log N) ..."
Abstract

Cited by 14 (0 self)
 Add to MetaCart
We show that for any randomized broadcast protocol for radio networks, there exists a network in which the expected time to broadcast a message is \Omega\Gamma D log(N=D)), where D is the diameter of the network and N is the number of nodes. This implies a tight lower bound of \Omega\Gamma D log N) for any D N 1\Gamma" , where " ? 0 is any constant. 1 Introduction Traditionally, radio networks received a considerable attention due to their military significance. The growing interest in cellular telephones and wireless communication networks has reinforced the interest in radio networks. The basic feature of radio networks, that distinguishes them from other networks, is that a processor can receive a message only from a single neighbor at a certain time. If two (or more) neighbors of a processor transmit concurrently, then the processor would not receive either messages. In many applications, the users of the radio network are mobile, and therefore the topology is unstable. For th...