A Socio-inspired CALM Approach to Channel Assignment Performance Prediction and WMN Capacity Estimation

A significant amount of research literature is dedicated to interference mitigation in Wireless Mesh Networks (WMNs), with a special emphasis on designing channel allocation (CA) schemes which alleviate the impact of interference on WMN performance. But having countless CA schemes at one's disposal makes the task of choosing a suitable CA for a given WMN extremely tedious and time consuming. In this work, we propose a new interference estimation and CA performance prediction algorithm called CALM, which is inspired by social theory. We borrow the sociological idea of a "sui generis" social reality, and apply it to WMNs with significant success. To achieve this, we devise a novel Sociological Idea Borrowing Mechanism that facilitates easy operationalization of sociological concepts in other domains. Further, we formulate a heuristic Mixed Integer Programming (MIP) model called NETCAP which makes use of link quality estimates generated by CALM to offer a reliable framework for network capacity prediction. We demonstrate the efficacy of CALM by evaluating its theoretical estimates against experimental data obtained through exhaustive simulations on ns-3 802.11g environment, for a comprehensive CA test-set of forty CA schemes. We compare CALM with three existing interference estimation metrics, and demonstrate that it is consistently more reliable. CALM boasts of accuracy of over 90% in performance testing, and in stress testing too it achieves an accuracy of 88%, while the accuracy of other metrics drops to under 75%. It reduces errors in CA performance prediction by as much as 75% when compared to other metrics. Finally, we validate the expected network capacity estimates generated by NETCAP, and show that they are quite accurate, deviating by as low as 6.4% on an average when compared to experimentally recorded results in performance testing

Spatial interactions in agent-based modeling

Agent Based Modeling (ABM) has become a widespread approach to model complex interactions. In this chapter after briefly summarizing some features of ABM the different approaches in modeling spatial interactions are discussed. It is stressed that agents can interact either indirectly through a shared environment and/or directly with each other. In such an approach, higher-order variables such as commodity prices, population dynamics or even institutions, are not exogenously specified but instead are seen as the results of interactions. It is highlighted in the chapter that the understanding of patterns emerging from such spatial interaction between agents is a key problem as much as their description through analytical or simulation means. The chapter reviews different approaches for modeling agents' behavior, taking into account either explicit spatial (lattice based) structures or networks. Some emphasis is placed on recent ABM as applied to the description of the dynamics of the geographical distribution of economic activities, - out of equilibrium. The Eurace@Unibi Model, an agent-based macroeconomic model with spatial structure, is used to illustrate the potential of such an approach for spatial policy analysis.Comment: 26 pages, 5 figures, 105 references; a chapter prepared for the book "Complexity and Geographical Economics - Topics and Tools", P. Commendatore, S.S. Kayam and I. Kubin, Eds. (Springer, in press, 2014

European studies: Taking stock and looking ahead

This essay is an attempt to generalize experiences of Central and Eastern European universities in the field of European Studies over the past 20 years. The paper follows the logic of business analysis in order to come up with proposals for future action

Mobility entropy and message routing in community-structured delay tolerant networks

Many message routing schemes have been proposed in the context of delay tolerant networks (DTN) and intermittently connected mobile networks (ICMN). Those routing schemes are tested on specific environments that involve particular mobility complexity whether they are random-based or soci-ologically organized. We, in this paper, propose community structured environment (CSE) and mobility entropy to dis-cuss the effect of node mobility complexity on message rout-ing performance. We also propose potential-based entropy adaptive routing (PEAR) that adaptively carries messages over the change of mobility entropy. According to our simu-lation, PEAR has achieved high delivery rate on wide range of mobility entropy, while link-state routing has worked well only at small entropy scenarios and controlled replication-based routing only at large entropy environments