On Broadcasting in Radio Networks--Problem Analysis and Protocol Design

Chlamtac, I.; Kutten, Shay

doi:10.1109/tcom.1985.1096245

Cited by 308 publications

(201 citation statements)

References 5 publications

Supporting

Mentioning

201

Contrasting

Order By: Relevance

“…The reliable broadcast problem has been shown to be N PComplete using this communication model [20]. When each node has full knowledge of the network topology, [21] proves that any broadcast protocol requires Ω(D + log 2 n) slots of transmission.…”

Section: Integrating Csma-dcr Into Reliable Broadcastmentioning

confidence: 95%

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

Section: Integrating Csma-dcr Into Reliable Broadcastmentioning

confidence: 95%

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

show abstract

“…For broadcast scheduling, Chlamtac and Kutten [3] proved the NP-hardness of finding a minimum makespan collision-free broadcast scheduling for general graphs, even in the absence of wireless interference. Gandhi et al [4] studied the broadcast scheduling problem for multi-hop wireless networks with bounded transmission range.…”

Section: Related Workmentioning

confidence: 99%

Fast Group Communication Scheduling in Duty-Cycled Multihop Wireless Sensor Networks

Cao

Wan

2012

Wireless Algorithms, Systems, and Applications

View full text Add to dashboard Cite

Abstract. We study group communication scheduling in duty-cycled multi-hop wireless sensor networks. Assume that time is divided into time-slots and we group multiple consecutive time-slots into periods. Each node can transmit data at any time-slot while it only wakes up at its active time-slot of every period and thus be allowed to receive data. Under the protocol interference model, we investigate four group communication patterns, i.e., broadcast, data aggregation, data gathering, and gossiping. For each pattern, we develop a delay efficient scheduling algorithm which greatly improve the current state-of-the-art algorithm. Additionally, we propose a novel and efficient design to coherently couple the wireless interference requirement and duty cycle requirement.

show abstract

“…Chlamtac and Kutten [1] proved that finding a time-optimal broadcast schedule is an NP-hard problem. This has led to the development of approximation algorithms and global bounds for minimum-time broadcast scheduling problem [2].…”

Section: Related Workmentioning

confidence: 99%

Minimal Time Broadcasting in Cognitive Radio Networks

Arachchige

Venkatesan

Chandrasekaran

et al. 2011

Distributed Computing and Networking

View full text Add to dashboard Cite

Abstract. This paper addresses time-efficient broadcast scheduling problem in Cognitive Radio (CR) Networks. Cognitive Radio is a promising technology that enables the use of unused spectrum in an opportunistic manner. Because of the unique characteristics of CR technology, the broadcast scheduling problem in CR networks needs unique solutions. Even for single channel wireless networks, finding a minimum-length broadcast schedule is an NP-hard problem. In addition, the multi-channel nature of the CR networks, especially the nonuniform channel availability, makes it a more complex problem to solve. In this paper, we first present an Integer Linear Programming formulation (ILP) to determine the minimum broadcast schedule length for a CR network. We then present two heuristics to construct minimal length broadcast schedules. Comparison of optimal results (found by solving the ILP formulation) with the result of the heuristics through simulation shows that both heuristics produce schedules of either optimal or very closer to optimal lengths.

show abstract

On Broadcasting in Radio Networks--Problem Analysis and Protocol Design

Cited by 308 publications

References 5 publications

Reliable Broadcast in Wireless Mobile Ad Hoc Networks

Reliable Broadcast in Wireless Mobile Ad Hoc Networks

Fast Group Communication Scheduling in Duty-Cycled Multihop Wireless Sensor Networks

Minimal Time Broadcasting in Cognitive Radio Networks

Contact Info

Product

Resources

About