A new model for scheduling packet radio networks

Sen, Arunabha; Huson, M.L.

doi:10.1109/infcom.1996.493055

Cited by 102 publications

(99 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…For general networks, however, it is known that the computation of an optimal (radio) broadcast schedule is NP-hard, even if the underlying graph is embedded in the plane [4,21].…”

Section: Communication In Radio Network With Known Topologymentioning

confidence: 99%

Faster communication in known topology radio networks

2006

View full text Add to dashboard Cite

This paper concerns the communication primitives of broadcasting (one-to-all communication) and gossiping (all-to-all communication) in radio networks with known topology, i.e., where for each primitive the schedule of transmissions is precomputed based on full knowledge about the size and the topology of the network.The first part of the paper examines the two communication primitives in general graphs. In particular, it proposes a new (efficiently computable) deterministic schedule that uses O(D + ∆ log n) time units to complete the gossiping task in any radio network with size n, diameter D and max-degree ∆. Our new schedule improves and simplifies the currently best known gossiping schedule, requiring time O(D + i+2 √ D∆ log i+1 n), for any network with the diameter D = Ω(log i+4 n), where i is an arbitrary integer constant i ≥ 0, see [17]. For the broadcast task we deliver two new results: a deterministic efficient algorithm for computing a radio schedule of length D + O(log 3 n), and a randomized algorithm for computing a radio schedule of length D + O(log 2 n). These results improve on the best currently known D + O(log 4 n) time schedule due to Elkin and Kortsarz [12].The second part of the paper focuses on radio communication in planar graphs, devising a new broadcasting schedule using fewer than 3D time slots. This result improves, for small values of D, on currently best known D + O(log 3 n) time schedule proposed by Elkin and Kortsarz in [12]. Our new algorithm should be also seen as the separation result between the planar and the general graphs with a small diameter due to the polylogarithmic inapproximability result in general graphs due to Elkin and Kortsarz, see [11].

show abstract

“…For general networks, however, it is known that the computation of an optimal (radio) broadcast schedule is NP-hard, even if the underlying graph is embedded in the plane [4,21].…”

Section: Communication In Radio Network With Known Topologymentioning

confidence: 99%

Faster communication in known topology radio networks

2006

View full text Add to dashboard Cite

show abstract

“…We consider a one-dimensional grid-based network consisting of n nodes. A grid-based network has been previously considered by various researchers [5], [6], [7], [8], [9], [10]. It helps us abstract node mobility to a tractable form.…”

Section: System Modelmentioning

confidence: 99%

“…Sen et al consider a simplified model where nodes are static and located at only grid points [9]. They prove that even under this restricted model achieving reliable broadcast is N PComplete.…”

Section: Integrating Csma-dcr Into Reliable Broadcastmentioning

confidence: 99%

Reliable Broadcast in Wireless Mobile Ad Hoc Networks

Mohsin

Cavin

Sasson

et al. 2006

Proceedings of the 39th Annual Hawaii International Conference on System Sciences (HICSS'06)

View full text Add to dashboard Cite

Abstract-We propose a single source reliable broadcasting algorithm for linear grid-based networks where a message is guaranteed to be delivered to all the nodes of the network. The nodes are mobile and can move from one grid point to another. The solution does not require the nodes to know the network size or its diameter. The only information a node has is its identity and its position. On average, only a subset of nodes transmit and they transmit only once to achieve reliable broadcast. The protocol is contention-free and energy-efficient. We show that reliable broadcast can be achieved in O(D log n) time-slots despite node mobility, where D is the diameter of the network and n the number of nodes.

show abstract

“…Distance-2 coloring is a basic primitive used in wireless networks and is well studied in the context of broadcast scheduling and channel assignment [28,27,25]. In [28], it was shown that even in the case of UDGs, it is NP-hard to minimize the number of colors used in the D2-coloring.…”

Section: Related Workmentioning

confidence: 99%

Distributed Algorithms for Coloring and Domination in Wireless Ad Hoc Networks

Parthasarathy

Gandhi

2004

FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science

View full text Add to dashboard Cite

Abstract. We present fast distributed algorithms for coloring and (connected) dominating set construction in wireless ad hoc networks. We present our algorithms in the context of Unit Disk Graphs which are known to realistically model wireless networks. Our distributed algorithms take into account the loss of messages due to contention from simultaneous interfering transmissions in the wireless medium. We present randomized distributed algorithms for (conflict-free) Distance-2 coloring, dominating set construction, and connected dominating set construction in Unit Disk Graphs. The coloring algorithm has a time complexity of O(∆ log 2 n) and is guaranteed to use at most O(1) times the number of colors required by the optimal algorithm. We present two distributed algorithms for constructing the (connected) dominating set; the former runs in time O(∆ log 2 n) and the latter runs in time O(log 2 n). The two algorithms differ in the amount of local topology information available to the network nodes. Our algorithms are geared at constructing Well Connected Dominating Sets (WCDS) which have certain powerful and useful structural properties such as low size, low stretch and low degree. In this work, we also explore the rich connections between WCDS and routing in ad hoc networks. Specifically, we combine the properties of WCDS with other ideas to obtain the following interesting applications:-An online distributed algorithm for collision-free, low latency, low redundancy and high throughput broadcasting. -Distributed capacity preserving backbones for unicast routing and scheduling.

show abstract

A new model for scheduling packet radio networks

Cited by 102 publications

References 9 publications

Faster communication in known topology radio networks

Faster communication in known topology radio networks

Reliable Broadcast in Wireless Mobile Ad Hoc Networks

Distributed Algorithms for Coloring and Domination in Wireless Ad Hoc Networks

Contact Info

Product

Resources

About