Bhaswar Majumder

Bio: Bhaswar Majumder is an academic researcher from Indian Institute of Technology Madras. The author has contributed to research in topics: Random access & Wireless network. The author has an hindex of 1, co-authored 2 publications receiving 2 citations.

Wireless MAC Protocol based on Crowd-Anticrowd Theory

Abstract: In the domain of wireless networking, there have been several attempts to design, and analyze resource allocation problems using Game theoretic techniques (such as, random access game for contention control). In the current paper, a Medium Access Control (MAC) protocol based on Minority Game(MG) theory is proposed for channel supporting Multipacket Reception (MPR). Several performance metrics of the protocol (like, mean of Attendance, Volatility, System Throughput and Energy Expenditure) are studied through extensive simulation. The behaviour of the protocol is also analyzed from the perspective of Crowd-Anticrowd Theory, a popular tool from econophysics literature.

Traffic Modeling & Characterization of Software Defined Networks

Abstract: Software Defined Networking (SDN) is a trending technology and its popularity can be attributed to its speed and agility in deploying new applications. Realistic modeling of SDN traffic is crucial in designing control algorithms and in provisioning network resources. The purpose of this paper is to model and characterize the SDN traffic. To this end, we have created an SDN environment using the mininet emulator and OpenDayLight (ODL) controller using which we have collected the SDN traffic data traces. The quantiles of inter-arrival times of SDN data traffic have been plotted against the quantiles of theoretical distributions. Then the Kolmogorov Smirnov (KS) test has been applied to model the SDN traffic and to capture its distribution characteristics effectively. From the KS test, it has been inferred that the inter arrival times of SDN traffic follows the Generalized Extreme Value (GEV) distribution. These findings indicate that traditional Poisson models for SDN traffic may not be suitable for evaluating the performance of Software Defined Networks.

Minority game with arbitrary cutoffs

Abstract: We study a model of a competing population of N adaptive agents, with similar capabilities, repeatedly deciding whether to attend a bar with an arbitrary cutoff L. Decisions are based upon past outcomes. The agents are only told whether the actual attendance is above or below L. For L-> N/2, the game reproduces the main features of Challet and Zhang's minority game. As L is lowered, however, the mean attendances in different runs tend to divide into two groups. The corresponding standard deviations for these two groups are very different. This grouping effect results from the dynamical feedback governing the game's time-evolution, and is not reproduced if the agents are fed a random history.

Modeling & analysis of software defined networks under non-stationary conditions

Abstract: Software Defined Networking (SDN) has been preferred over traditional networking due to its dynamic nature in adapting the network structure This agile nature of SDN imparts non-stationarity in traffic In this work, we characterize the SDN traffic and study its behavior under dynamic conditions using Augmented Dickey Fuller (ADF) test Later, we model the SDN under non-stationary conditions using queueing model and solve for average queue length at both controller and switch using Pointwise Stationary Fluid Flow Approximation (PSFFA) The analytical results have been validated through simulations We develop congestion control algorithm based on (a) Proportional Integral Derivative (PID) control mechanism and (b) Dynamic Random Early Detection (DRED) control mechanism for SDN controller using the fluid flow model Finally we demonstrate their effectiveness in stabilizing the queue length at the switch and controller under non-stationary conditions In nut shell our work brings out the importance of the non-stationary behaviour of the traffic in the design and analysis of SDN and its control algorithms

Incentive-Based Schema Using Game Theory in 5/6G Cellular Network for Sustainable Communication System

Abstract: Due to the technological advancement in cellular networks, massive data traffic appends to the existing digital technologies. These emerging digital technologies face quality of service (QoS) challenges, particularly when it comes to maintaining the tradeoffs between customers and service providers. The cellular service providers are trying to meet the needs of end users by handling four substantially different types of data, i.e., Real Time, Video, Audio, and Text, with each type having its own requirements. To achieves an efficient QoS, different incentive-based algorithms were proposed. However, these schemes do not ensure a fair distribution of profit among the mobile network operator and access points. Furthermore, these schemes do not provide efficient QoS to the end user and cannot ensure a fair distribution of channels in crowning time. We propose an incentive-based scheme using game theory and two-stage Stackelberg approach for integrated data, offloading the decision-making process in a heterogeneous network. A single mobile base station and some integrated access points in a crowded metropolitan area are modeled in our proposed scheme. This station offers an economic incentive based on traffic types, and access points compete with each other to earn incentives for offload traffic. A mathematical game is derived to analyze the real-world scenario through simulation. The experimental method is applied to validate the numerical outcomes by comparing the results with other models.

Blockchain-Enabled NextGen Service Architecture for Mobile Internet Offload

Abstract: The amalgamation of heterogeneous generations of mobile cellular networks around the globe has resulted in diverse data speed experiences for end users. At present, there are no defined mechanisms in place for subscribers of a mobile network operator (MNO) to use the services of third-party WiFi providers. MNOs also have no standardized procedures to securely interact with each other, and allow their subscribers to use third-party services on a pay-as-you-go basis. This paper proposes a blockchain-enabled offloading framework that allows a subscriber of a mobile operator to temporarily use another MNO or WiFi provider’s higher-speed network. A smart contract is employed to allow diverse entities, such as MNOs, brokers and WiFi providers, to automatically execute mutual agreements, to enable the utilization of third-party infrastructure in a secure and controlled manner. The proposed framework is tested using Ethereum’s testnet on the Goerli network using Alchemy and Hardhat. The analysis of the results obtained shows that the proposed technique helps mobile operators to offer improved user experience in the form of average speed and latency. The experiments show that the average time taken to deliver a 500 MB file is reduced from 10.23 s to 0.91 s for the global average scenario, from 6.09 s to 0.50 s for 5G, from 13.50 s to 0.50 s for 4G-LTE, from 41.11 s to 0.49 s for 4G, and from 339.11 s to 0.49 s for the 3G scenario. The results also show that, with WiFi offloading, users from all cellular generations can enjoy a similar quality of services, because delivery time ranges from 0.49 s to 0.91 s for offloaded experiments whereas for the non-offloaded scenario it ranges from 6.09 s to 339.11 s.