Arunabha Sen, Mark L. Huson  Home/Search
Context Related
| asu.edu/~halla/papers/WINET.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: asu.edu/~csedept/people...senpub (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
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... (Update)
Similar documents based on text: More All
1.1: Scheduling In Packet Radio Networks - A New Approach - Sen, Capone (Correct)
0.3: Throughput-Delay Characteristics of Some Slotted-ALOHA.. - Takagi, Kleinrock (1985) (Correct)
0.3: Graph Clustering Using Distance-k Cliques - Edachery, Sen, Brandenburg (1999) (Correct)
BibTeX entry: (Update)
A. Sen, M. Huson. A new model for scheduling packet radio networks. In Proc. of the 15th Ann. Joint Conf. of the IEEE Computer and Communication Societies INFOCOM, pp. 1116-1124, 1996. http://citeseer.ist.psu.edu/sen96new.html More
@inproceedings{ sen96new,
author = "Arunabha Sen and Mark L. Huson",
title = "A New Model for Scheduling Packet Radio Networks",
booktitle = "{INFOCOM} (3)",
pages = "1116-1124",
year = "1996",
url = "citeseer.ist.psu.edu/sen96new.html" }
Citations (may not include all citations):4212 Computers and Intractability: A Guide to the Theory of NP-Co.. (context) - Garey, Johnson - 1979
144 The np-completeness column: An ongoing guide (context) - Johnson - 1982
83 Unit disk graphs (context) - Clark, Colbourn et al. - 1990
67 Scheduling broadcasts in multihop radio networks (context) - Ephremides, Truong - 1990
61 A better heuristic for orthogonal graph drawing - Biedl, Kant - 1994
44 Universality considerations in vlsi circuits (context) - Valiant - 1981
36 Scheduling algorithms for multi--hop radio networks (context) - Ramanathan, Lloyd - 1992
36 Scheduling algorithms for multi-hop radio networks (context) - Ramanathan, Lloyd - 1993
34 Link scheduling in polynomial time (context) - Hajek, Sasaki - 1988
33 Distributed scheduling of broadcasts in a radio network (context) - Ramaswami, Parhi - 1989
26 Some complexity results about packet radio networks (context) - Arikan - 1984
21 An optimal solution for the channel-- assignment problem (context) - Gupta, Lee et al. - 1979
19 Optimal approximation of sparse hessians and its equivalence.. (context) - McCormick - 1981
18 Multiple communication in multi-hop radio networks (context) - Bar-Yehuda, Israeli et al. - 1989
18 the np--completeness of certain network testing problems (context) - Even, Goldreich et al. - 1984
[Article contains additional citations not shown here]
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.eas.asu.edu/~csedept/people/faculty/../../people/faculty/sen-pub.html): More
Graph Clustering Using Multiway Ratio Cut - Tom Roxborough And (1997) (Correct)
On New Architectures for Lightwave Networks - Department (Correct)
Analysis of Low Earth Orbit Satellite Networks with.. - Sen, Jost, al. (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC