Indian Institute of Technology Palakkad&nbsp;(IIT Palakkad or IIT PKD) is a public autonomous&nbsp;engineering&nbsp;and&nbsp;research&nbsp;institute located in&nbsp;Palakkad,&nbsp;Kerala. It was&nbsp;one of the five new&nbsp;IITs&nbsp;proposed in the&nbsp;2014 Union budget of India. The campus was inaugurated on 3 August 2015. The institute has 94 faculty, 978 students, and 63 non-teaching staffs.

IT Palakkad currently offers four-year Bachelor of Technology (B.Tech) and two years MS programmes in 8 different engineering disciplines including&nbsp;Computer Science, Electrical, Mechanical, Civil among others.

&nbsp;

IIT Palakkad

The structural properties of temporal networks often influence the dynamical processes that occur on these networks, e.g., bursty interaction patterns have been shown to slow down epidemics. In this paper, we investigate the effect of link lifetimes on the spread of history-dependent epidemics. We formulate an analytically tractable activity-driven temporal network model that explicitly incorporates link lifetimes. For Markovian link lifetimes, we use mean-field analysis for computing the epidemic threshold, while the effect of non-Markovian link lifetimes is studied using simulations. Furthermore, we also study the effect of negative correlation between the number of links spawned by an individual and the lifetimes of those links. Such negative correlations may arise due to the finite cognitive capacity of the individuals. Our investigations reveal that heavy-tailed link lifetimes slow down the epidemic, while negative correlations can reduce epidemic prevalence. We believe that our results help shed light on the role of link lifetimes in modulating diffusion processes on temporal networks. © 2015 American Physical Society.

Department of Computer Science and Engineering

World University root node

Physical Review E - Statistical, Nonlinear, and Soft Matter Physics

Dynamics of history-dependent epidemics in temporal networks

Interference management (RF management) remains one of the main challenges facing the design and deployment of large-scale WLAN. RF management involves the detection, estimation and control of power level, channel allocations and link schedules, to improve the performance of the wireless network. Among interfering links, one can find different types of dependencies. While some of these types can be predicted with relatively low overheads, observing and inferring other types can be a challenging task. In this paper, we ask the question - in WLANs, what is the probability of different types of pair-wise link dependencies? We answer this question by deriving analytical expressions for various types of link dependencies seen in IEEE 802.11 WLANs, numerically evaluating them, and comparing them against simulations. © 2015 IFIP.

2015 13th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOpt 2015

Link dependence probabilities in IEEE 802.11 infrastructure WLANs

In this document, we are primarily interested in computing the probabilities of various types of dependencies that can occur in a multi-cell infrastructure network.

arXiv preprint arXiv:1304.

An Analysis on the Inter-Cell Station Dependency Probability in an IEEE 802.11 Infrastructure WLANs

arXiv preprint arXiv:1111.

Approximate Aggregate Utility Maximization in Multi-Hop Wireless Networks using Distributed Greedy Scheduling

Distributed Wireless Networks : Link Scheduling and Application Delay Modelling

In this paper, we consider the problem of modelling the average delay in an IEEE 802.11 DCF wireless mesh network with a single root node under light traffic. We derive expression for mean delay for a co-located wireless mesh network, when packet generation is homogeneous Poisson process with rate . We also show how our analysis can be extended for non-homogeneous Poisson packet generation. We model mean delay by decoupling queues into independent M/M/1 queues. Extensive simulations are conducted to verify the analytical results. © 2011 IEEE.

ICCSP 2011 - 2011 International Conference on Communications and Signal Processing

Delay modelling for a single-hop wireless mesh network under light aggregate traffic

In this paper, we consider the problem of modelling the average delay experienced by an application packets of variable length in a single cell IEEE 802.11 DCF wireless local area network. The packet arrival process at each node i is assumed to be a stationary and independent increment random process with mean ai and second moment ai (2). The packet lengths at node i are assumed to be i.i.d random variables Pi with finite mean and second moment. A closed form expression has been derived for the same. We assume the input arrival process across queues to be uncorrelated Poison processes. As the nodes share a single channel, they have to contend with one another for a successful transmission. The mean delay for a packet has been approximated by modelling the system as a 1-limited Random Polling system with zero switchover times. Extensive simulations are conducted to verify the analytical results. © 2011 IEEE.

2011 National Conference on Communications, NCC 2011

Application delay modelling for variable length packets in single cell IEEE 802.11 WLANs

In this paper, we consider the problem of scheduling in multihop wireless networks subject to interference constraints. We consider a graph based representation of wireless networks, where scheduled links adhere to the K-hop link interference model. We develop a distributed greedy heuristic for this scheduling problem. Further, we show that this distributed greedy heuristic computes the exact same schedule as the centralized greedy heuristic. ©2010 IEEE.

2010 IEEE 7th International Conference on Mobile Adhoc and Sensor Systems, MASS 2010

Distributed greedy scheduling for multihop wireless networks

In this paper, we consider the problem of modelling the average delay experienced by a packet in a single cell IEEE 802.11 DCF wireless local area network. The packet arrival process at each node i is assumed to be Poisson with rate parameter $\lambda$_i. Since the nodes are sharing a single channel, they have to contend with one another for a successful transmission. The mean delay for a packet has been approximated by modelling the system as a 1-limited Random Polling system with zero switchover time. We show that even for non-homogeneous packet arrival processes, the mean delay of packets across the queues are same and depends on the system utilization factor and the aggregate throughput of the MAC. Extensive simulations are conducted to verify the analytical results.