Please use this identifier to cite or link to this item:
|Title:||Base station selection strategy in multihop cellular networks: a new approach|
|Citation:||Proceedings of the International Conference on Signal Processing, Communications and Networking, Chennai, India, 4-6 January 2008, 401-404|
|Abstract:||Multihop cellular networks (MCN) have been proposed for quite a long time as of now. The major improvements these networks offer over the conventional cellular networks are increase in capacity and coverage area. However the congestion near the base station (BS) happens to be the bottleneck even in the approach of MCN. Therefore approach to reduce this congestion is a potential area of further research in this field. Our proposed architecture is one such attempt in this direction. In the proposed scheme instead of a single cell covered by a particular base station the entire coverage area of the cellular network consisting of many cells is considered as a whole and an attempt has been made to find out the direct links between the source and the destination of a connection without approaching any of the base stations. Since in MCN any mobile terminal (MT) can communicate with another MT directly; much importance should not be attached to the parent or associated base station. Rather the any suitable base station should be the last hop in this network only when an attempt to find out the direct links between the source and the destination of a connection fails. This failure may either because the path is too long or either of source and destination is outside the network. Out of the cluster of parent BS and six neighbouring BSs one base station is to be selected depending upon the distance and the channel occupancy. This approach distributes the traffic load almost uniformly over the entire region and overcomes the problem of localized congestion in an effective manner.|
|Appears in Collections:||Proceedings papers|
Files in This Item:
|Base station selection strategy .pdf||1.92 MB||Adobe PDF|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.