CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

A Distributed Approach for Frequency allocation using Graph Coloring in Mobile Networks

by Vinod Maan, G. N. Purohit
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 58 - Number 6
Year of Publication: 2012
Authors: Vinod Maan, G. N. Purohit
10.5120/9284-3476

Vinod Maan, G. N. Purohit . A Distributed Approach for Frequency allocation using Graph Coloring in Mobile Networks. International Journal of Computer Applications. 58, 6 ( November 2012), 9-13. DOI=10.5120/9284-3476

@article{ 10.5120/9284-3476,
author = { Vinod Maan, G. N. Purohit },
title = { A Distributed Approach for Frequency allocation using Graph Coloring in Mobile Networks },
journal = { International Journal of Computer Applications },
issue_date = { November 2012 },
volume = { 58 },
number = { 6 },
month = { November },
year = { 2012 },
issn = { 0975-8887 },
pages = { 9-13 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume58/number6/9284-3476/ },
doi = { 10.5120/9284-3476 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:01:44.136842+05:30
%A Vinod Maan
%A G. N. Purohit
%T A Distributed Approach for Frequency allocation using Graph Coloring in Mobile Networks
%J International Journal of Computer Applications
%@ 0975-8887
%V 58
%N 6
%P 9-13
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

The proposed technique explores a general framework for studying distributed frequency allocation in mobile cellular network. The problem can be abstracted as a multicoloring problem on a cellular graph. This paper concerns a algorithmic problem for solving Maximal independent set of a graph in a distributed fashion and then reducing independent set to graph coloring. The objective of frequency allocation is to assign required number of frequency to each cell such that efficient frequency spectrum utilization is provided and interference effects are minimized [1].

References
  1. Hale, W. K. , "Frequency Assignment: Theory and Applications", Proc. IEEE, 68, 1980, pp. 1497-1514.
  2. L. Narayanan and S. Shende, "Static Frequency Assignments in Cellular Networks", Algorithmica , 29 , 2001,pp. 396-409.
  3. Lynch, N. : Distributed algorithms , Morgan Kaufman,1996
  4. Marek Kubale and Lukasz Kuszner, "A better practical algorithm for distributed graph coloring", Proc . International Conference on Parallel Computing in Electrical Engineering, 2002
  5. Linial N. , Locality in distributed graph algorithms, SIAM J. on computing, 20, 1992, pp. 193-201.
  6. Colin McDiarmid and Bruce Reed, " Channel Assignment and Weighted Coloring, Networks,36,2000, pp. 114-117
  7. Irene Finocchi ,Alessandro Panconesi , Riccardo Silvestri ,"Experimental analysis of simple, distributed vertex coloring algorithms", SODA '02 Proc. Thirteenth annual ACM-SIAM symposium on Discrete algorithms ,2002
  8. Madhav V. Marathe, Alessandro Pansonesi, Larry D. Risinger Jr, "An Experimental study of a Simple ,Distributed Edge Coloring Algorithm", ACM Journal of Experimental Algorithmics 9, 2004
  9. V. Maan and D. sangwan " A Genetic Implementation of graph Coloring for cellular networks" International Journal of electronics and engineering 2(1) , 2010, pp. 183-187
  10. Luby M. ,"A simple parallel algorithm for the maximal independent set problem", Proc. Of ACM Symposium on theory of computing, (1985)1-10.
  11. Sunita Choudhary, G. N. Purohit, " Optimized Channel Assignment in Distributed Environment", Proceedings of the World Congress on Engineering Vol I ,2010
Index Terms

Computer Science
Information Sciences

Keywords

Frequency Maximal independent set Graph Coloring Neighbors Set Vertex Edge

Powered by PhDFocusTM