Distributed wireless channel allocation in networks with mobile base stations

作者: S. Nesargi , R. Prakash

DOI: 10.1109/INFCOM.1999.751394

关键词: ScalabilityBase stationWirelessMobile computingDistributed computingComputer networkDistributed algorithmChannel allocation schemesComputer scienceCommunication channelRobustness (computer science)

摘要: A mobile computing system with no fixed nodes is presented. In traditional cellular systems base stations the channel reuse pattern static and deterministic. When cell layout dynamic, due to mobility of stations, cluster cells within co-channel interference range changes time. Consequently, highly Moreover, also need wireless channels communicate amongst themselves. communication session between a pair may have switch movement other into neighborhood. Hence, there for new allocation algorithms virtual stations. this paper, principles mutual exclusion pertaining distributed are employed develop such an algorithm. The inter-base station links referred as backbone while station-mobile node short-hop links. proposed algorithm distributed, dynamic deadlock free. Disjoint sets used nature scheme leads robustness responsibility longer centralized at MTSO. Instead, it shared among all This makes scalable.

参考文章(20)
L. J. Cimini, G. J. Foschini, C.-L. I, Distributed Dynamic Channel Allocation Algorithms for Microcellular Systems Springer US. pp. 219- 241 ,(1993) , 10.1007/978-1-4615-3144-9_13
Charles Shields, Vikas Jain, Simeon Ntafos, Ravi Prakash, S. Venkatesan, Fault tolerant mobility planning for rapidly deployable wireless networks international parallel processing symposium. pp. 770- 789 ,(1998) , 10.1007/3-540-64359-1_741
R. Prakash, R. Baldoni, Architecture for group communication in mobile systems symposium on reliable distributed systems. pp. 235- 242 ,(1998) , 10.1109/RELDIS.1998.740505
W.C.Y. Lee, New cellular schemes for spectral efficiency IEEE Transactions on Vehicular Technology. ,vol. 36, pp. 188- 192 ,(1987) , 10.1109/T-VT.1987.24118
K. M. Chandy, J. Misra, The drinking philosophers problem ACM Transactions on Programming Languages and Systems. ,vol. 6, pp. 632- 646 ,(1984) , 10.1145/1780.1804
Ming Zhang, T.-S.P. Yum, Comparisons of channel-assignment strategies in cellular mobile telephone systems IEEE Transactions on Vehicular Technology. ,vol. 38, pp. 211- 215 ,(1989) , 10.1109/25.45483
T. Kahwa, N. Georganas, A Hybrid Channel Assignment Scheme in Large-Scale, Cellular-Structured Mobile Communication Systems IEEE Transactions on Communications. ,vol. 26, pp. 432- 438 ,(1978) , 10.1109/TCOM.1978.1094082
J.C.-I. Chuang, Performance issues and algorithms for dynamic channel assignment IEEE Journal on Selected Areas in Communications. ,vol. 11, pp. 955- 963 ,(1993) , 10.1109/49.232306
Mamoru Maekawa, A √N algorithm for mutual exclusion in decentralized systems ACM Transactions on Computer Systems. ,vol. 3, pp. 145- 159 ,(1985) , 10.1145/214438.214445