A new model for scheduling packet radio networks

Authors:
Arunabha Sen;Mark L. Huson
Affiliations:
Department of Computer Science and Engineering, Arizona State University, Tempe, AZ;Department of Computer Science and Engineering, Arizona State University, Tempe, AZ
Venue:
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 3
Year:
1996

Citing 6
Cited 43

Unit disk graphs

Discrete Mathematics - Topics on domination
Scheduling algorithms for multi-hop radio networks

SIGCOMM '92 Conference proceedings on Communications architectures & protocols
Scheduling algorithms for multihop radio networks

IEEE/ACM Transactions on Networking (TON)
A new model for scheduling radio networks

A new model for scheduling radio networks
A Better Heuristic for Orthogonal Graph Drawings

ESA '94 Proceedings of the Second Annual European Symposium on Algorithms
An Optimal Solution for the Channel-Assignment Problem

IEEE Transactions on Computers

Efficient communication strategies for ad-hoc wireless networks (extended abstract)

Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
A unified framework and algorithm for channel assignment in wireless networks

Wireless Networks
Tradeoffs between knowledge and time of communication in geometric radio networks

Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Oblivious gossiping in ad-hoc radio networks

DIALM '01 Proceedings of the 5th international workshop on Discrete algorithms and methods for mobile computing and communications
A Five-Phase Reservation Protocol (FPRP) for Mobile Ad Hoc Networks

Wireless Networks
A probabilistic analysis for the range assignment problem in ad hoc networks

MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Broadcasting in radio networks

Handbook of wireless networks and mobile computing
Fast broadcasting and gossiping in radio networks

Journal of Algorithms
The impact of information on broadcasting time in linear radio networks

Theoretical Computer Science
Deterministic Radio Broadcasting

ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
A Randomized Algorithm for Gossiping in Radio Networks

COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
The Impact of Knowledge on Broadcasting Time in Radio Networks

ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
The Critical Transmitting Range for Connectivity in Sparse Wireless Ad Hoc Networks

IEEE Transactions on Mobile Computing
Deterministic broadcasting in ad hoc radio networks

Distributed Computing
Scheduling of broadcasts in multihop wireless networks

The handbook of ad hoc wireless networks
WaveScheduling: energy-efficient data dissemination for sensor networks

DMSN '04 Proceeedings of the 1st international workshop on Data management for sensor networks: in conjunction with VLDB 2004
Faster communication in known topology radio networks

Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Radio communication in random graphs: extended abstract

Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Topology control in wireless ad hoc and sensor networks

ACM Computing Surveys (CSUR)
Radio communication in random graphs

Journal of Computer and System Sciences - Special issue on network algorithms 2005
Wave scheduling and routing in sensor networks

ACM Transactions on Sensor Networks (TOSN)
Deterministic M2M multicast in radio networks

Theoretical Computer Science
Broadcasting in geometric radio networks

Journal of Discrete Algorithms
Broadcasting in udg radio networks with unknown topology

Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Time efficient centralized gossiping in radio networks

Theoretical Computer Science
MAC protocols over wireless mesh networks: problems and perspective

Journal of Parallel and Distributed Computing
Fast Radio Broadcasting with Advice

SIROCCO '08 Proceedings of the 15th international colloquium on Structural Information and Communication Complexity
On Radio Broadcasting in Random Geometric Graphs

DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Broadcasting in UDG Radio Networks with Missing and Inaccurate Information

DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Efficient Broadcasting in Known Geometric Radio Networks with Non-uniform Ranges

DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Impact of Information on the Complexity of Asynchronous Radio Broadcasting

OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Fast radio broadcasting with advice

Theoretical Computer Science
Time-efficient broadcasting in radio networks: a review

ICDCIT'07 Proceedings of the 4th international conference on Distributed computing and internet technology
Impact of region-based faults on the connectivity of wireless networks

Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Latency-optimal communication in wireless mesh networks

APCC'09 Proceedings of the 15th Asia-Pacific conference on Communications
Minimum-latency gossiping in multi-hop wireless mesh networks

ICC'09 Proceedings of the 2009 IEEE international conference on Communications
LiT MAC: addressing the challenges of effective voice communication in a low cost, low power wireless mesh network

Proceedings of the First ACM Symposium on Computing for Development
Channel, capacity, and flow assignment in wireless mesh networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
Two sides approximation algorithms for channel assignments in wireless network

WASA'11 Proceedings of the 6th international conference on Wireless algorithms, systems, and applications
Optimal gossiping with unit size messages in known topology radio networks

CAAN'06 Proceedings of the Third international conference on Combinatorial and Algorithmic Aspects of Networking
Faster centralized communication in radio networks

ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Almost optimal distributed M2M multicasting in wireless mesh networks

Theoretical Computer Science
Distributed deterministic broadcasting in uniform-power ad hoc wireless networks

FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

Packet radio networks are modeled as arbitrary graphs by most researchers. In this paper we show that an arbitrary graph is an inaccurate model of the radio networks. This is true because there exists a large class of graphs which will not model the radio networks. Radio networks can be modeled accurately by a restricted class of graphs called the planar point graphs. Since the radio networks can accurately be modeled only by a restricted class of graphs, the NP-completeness results for scheduling using an arbitrary graph as the model, do not correctly reflect the complexity of the problem. In this paper we study the broadcast scheduling problem using the restricted class as the model. We show that the problem remains NP- Complete even in this restricted domain. We give an O(nlogn) algorithm when all the transceivers are located on a line.