Channel Assignment Algorithms Satisfying Cochannel and Adjacent Channel Reuse Constraints in Cellular Mobile Networks

Simple item page
dc.contributor.authorSarkar, Saswati
dc.contributor.authorSivarajan, Kumar N
dc.date2023-05-16T21:41:46.000
dc.date.accessioned2023-05-22T19:08:11Z
dc.date.available2023-05-22T19:08:11Z
dc.date.issued2002-09-01
dc.date.submitted2004-11-10T17:09:49-08:00
dc.description.abstractImproved channel assignment algorithms for cellular networks were designed by modeling the interference constraints in terms of a hypergraph [1]. However, these algorithms only considered cochannel reuse constraints. Receiver filter responses impose restrictions on simultaneous adjacent channel usage in the same cell or in neighboring cells. We first present some heuristics for designing fixed channel assignment algorithms with a minimum number of channels satisfying both cochannel and adjacent channel reuse constraints. An asymptotically tight upper bound for the traffic carried by the system in the presence of arbitrary cochannel and adjacent channel use constraints was developed in [2]. However, this bound is computationally intractable even for small systems like a regular hexagonal cellular system of 19 cells. We have obtained approximations to this bound using the optimal solutions for cochannel reuse constraints only and a further graph theoretic approach. Our approximations are computationally much more efficient and have turned out to track very closely the exact performance bounds in most cases of interest.
dc.description.commentsCopyright 2002 IEEE. Reprinted from IEEE Transactions on Vehicular Technology, Volume 51, Issue 5, September 2002, pages 954-967. Publisher URL: http://ieeexplore.ieee.org/xpl/tocresult.jsp?isNumber=24316&puNumber=25 This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of the University of Pennsylvania's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to pubs-permissions@ieee.org. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.
dc.identifier.urihttps://repository.upenn.edu/handle/20.500.14332/33561
dc.legacy.articleid1037
dc.legacy.fulltexturlhttps://repository.upenn.edu/cgi/viewcontent.cgi?article=1037&context=ese_papers&unstamped=1
dc.source.issue36
dc.source.journalDepartmental Papers (ESE)
dc.source.peerreviewedtrue
dc.source.statuspublished
dc.subject.otherAdjacent channel interference
dc.subject.othercellular systems
dc.subject.otherchannel assignment algorithms
dc.subject.othercochannel interference
dc.subject.othergraph models
dc.subject.otherhypergraph models
dc.titleChannel Assignment Algorithms Satisfying Cochannel and Adjacent Channel Reuse Constraints in Cellular Mobile Networks
dc.typeArticle
digcom.identifierese_papers/36
digcom.identifier.contextkey32399
digcom.identifier.submissionpathese_papers/36
digcom.typearticle
dspace.entity.typePublication
relation.isAuthorOfPublicationdfa31675-e4a1-4db2-b698-4f7113283983
relation.isAuthorOfPublication.latestForDiscoverydfa31675-e4a1-4db2-b698-4f7113283983
upenn.schoolDepartmentCenterDepartmental Papers (ESE)
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
ieeeMax24.pdf
Size:
1011.05 KB
Format:
Adobe Portable Document Format
Download
Collection
Articles