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.
| Original language | English (US) |
|---|---|
| Title of host publication | Proceedings - IEEE INFOCOM |
| Publisher | IEEE |
| Pages | 1116-1124 |
| Number of pages | 9 |
| Volume | 3 |
| State | Published - 1996 |
| Event | Proceedings of the 1996 15th Annual Joint Conference of the IEEE Computer and Communications Societies, INFOCOM'96. Part 1 (of 3) - San Francisco, CA, USA Duration: Mar 24 1996 → Mar 28 1996 |
Other
| Other | Proceedings of the 1996 15th Annual Joint Conference of the IEEE Computer and Communications Societies, INFOCOM'96. Part 1 (of 3) |
|---|---|
| City | San Francisco, CA, USA |
| Period | 3/24/96 → 3/28/96 |
ASJC Scopus subject areas
- Hardware and Architecture
- Electrical and Electronic Engineering