EFFICIENT FAULT-TOLERANT DISTRIBUTED ALLOCATION ALGORITHM FOR CELLULAR NETWORK

Overview
Cite Work

ABSTRACT

A channel allocation algorithm in a cellular network consists of two parts: a channel acquisition algorithm and a channel selection algorithm. Some of the previous works in this field focused on centralized approaches to allocating channels. But, centralized approaches are neither scalable nor reliable. Recently, distributed dynamic channel allocation algorithms have been proposed, and they have gained a lot of attention due to their high reliability and scalability. But, in most of the algorithms, the cell that wants to borrow a channel has to wait for replies from all its interference neighbors and, hence, is not fault-tolerant. In this paper, we propose a new algorithm that is fault-tolerant and makes full use of the available channels. It can tolerate the failure of mobile nodes as well as static nodes without any significant degradation in service.

TABLE OF CONTENT

TITLE PAGE

CERTIFICATION

APPROVAL

DEDICATION

ACKNOWLEDGEMENT

ABSTRACT

TABLE OF CONTENT

CHAPTER ONE

1.0 INTRODUCTION

1.1 STATEMENT OF PROBLEM

1.2 PURPOSE OF STUDY

1.3 AIMS AND OBJECTIVES

1.4 SCOPE/DELIMITATIONS

1.5 LIMITATIONS/CONSTRAINTS

1.6 DEFINITION OF TERMS

CHAPTER TWO

2.0 LITERATURE REVIEW

CHAPTER THREE

3.0 METHODS FOR FACT FINDING AND DETAILED DISCUSSIONS OF THE SYSTEM

3.1 METHODOLOGIES FOR FACT-FINDING

3.2 DISCUSSIONS

CHAPTER FOUR

4.0 FUTURES, IMPLICATIONS AND CHALLENGES OF THE SYSTEM

4.1 FUTURES

4.2 IMPLICATIONS

4.3 CHALLENGES

CHAPTER FIVE

5.0 RECOMMENDATIONS, SUMMARY AND CONCLUSION

5.1 RECOMMENDATION

5.2 SUMMARY

5.3 CONCLUSION

5.4 REFERENCES

Read Download

EFFICIENT FAULT-TOLERANT DISTRIBUTED ALLOCATION ALGORITHM FOR CELLULAR NETWORK

Related Works