http://dspace.ewubd.edu:8080/handle/123456789/2530 Sat, 04 Apr 2026 15:14:24 GMT 2026-04-04T15:14:24Z http://dspace.ewubd.edu:8080/handle/123456789/2532 Study on Access Point and Bandwidth Management in Overcrowded WLANs by Matching Algorithm and Game Theory Sultana, Sadia; Sarkar, Anirban Wireless Local Area Networks (WLANs) have been widely developed during this decade, due to their mobility and flexibility. As WLANs have become popular in many sectors, so we have to manage it efficiently. In a typical deployment of WLANs, the coverage areas of nearby access-points(APs) usually overlap with one another and a host may detect signals from multiple APs which degrade the network performance. The main purpose of our work to minimize the number of active APs in a overcrowded WLAS and to develop a bandwidth sharing techniques to reduce the wastage of bandwidth. This study represents the management of APs in overcrowded WLANs. In this thesis, firstly, we analyze the relationship of number of access point (AP) and achieved throughput for a given scenario. In the scenario we consider a number of parameters, i.e. given area, topology, number of users, expected rate and channel allocation vector. We find that in general with the increase of AP the performance of overall network improve. However after a certain number of deployed APs, further increase of AP does not bring substantial improvement in the network performance. More specially, performance deteriorates after a threshold value of number of APs due to increasing interference between adjacent channel (or co-channel) interference. We verify the throughput increasing rate with proper management of APs by simulation results using WIMNET (Wireless Internet-access Mesh Network) simulator. Most of the cases we see that in an overcrowded WLAN, the host does not get their expected bandwidth. By using an effective bandwidth sharing techniques, this problem can be solved. In this research work, we‟ve also proposed about the bandwidth sharing techniques for a given scenario where the different operators can share their bandwidth with each other by applying matching algorithm and game theory model. This thesis submitted in partial fulfillment of the requirements for the degree of Masters of Science in Telecommunication Engineering of East West University, Dhaka, Bangladesh Sun, 01 Jan 0008 00:00:00 GMT http://dspace.ewubd.edu:8080/handle/123456789/2532 0008-01-01T00:00:00Z http://dspace.ewubd.edu:8080/handle/123456789/2531 Integrated Caching and Routing Strategy for Information-Centric Networks Tuli, Naheed Nazneen Besides Off-path caching in Information Centric Networking (ICN), On-path caching is an integrated caching solution with-in an Autonomous System's (AS) local network. However, it is seen that in On-path caching, the content is cached en-route in the reverse path towards the Interest generator. Thus, local Rendezvous Network (RENE)[29] /Name Resolution System (NRS) [15] (in routing through name resolution) or FIB [2] (in name-based routing) is not conscious of the cached data. As a result the most extensively deployed intra-domain routing protocol and their forwarding strategy is not capable of addressing all available temporary cached copies of content. This leads on-path caching strategy to experience from two major downsides: numerous replicas of same content within AS which do not add significant value in terms of cache resource utilization and a trial taken to minimize redundancy ends up with the cost of fetching more copy of similar content from the repository (i.e., the closest cache copy is unknown/not enroute). In this paper we introduce an integrated caching and forwarding solution which minimizes the caching redundancy and maximizes the probability of finding nearby cached content, which causes utilization of available cache resources of AS‟s as a whole to be productive. We propose novel concepts of naming the content router and caching the content‟s cache-route to address the issue. We leverage Name Data Networking (NDN) node architecture and its forwarding plane/strategy (of routing) to attain our goal. Mathematical analysis to determine load balance and cache hit ratio, and simulation results considering average hop-distance and server hit ratio authenticate the efficiency of our proposed scheme. This thesis submitted in partial fulfillment of the requirements for the degree of Masters of Science in Telecommunication Engineering of East West University, Dhaka, Bangladesh Tue, 01 Jan 0009 00:00:00 GMT http://dspace.ewubd.edu:8080/handle/123456789/2531 0009-01-01T00:00:00Z