Efficient Broadcasting for a Mobile Ad-hoc Network based Peer-to-peer Community Radio Service

Ad-hoc networks consisting entirely of simple mobile phones can be used to deploy village level telephony. We investigate a novel application for such networks – a peer-to peer community radio service. We envision a system, where any user in the network is equally empowered to generate and distribute audio content to the entire network, using his or her mobile phone. This study concentrates on a critical aspect of this service – the choice of the network-wide broadcast protocol. Using extensive simulations, we evaluate the suitability of various broadcast techniques for a rural peer-to-peer mobile adhoc network. Our simulations identify the best choice of protocols under various village network conditions while simultaneously identifying limitations of the current protocols.

Modified extended tanh-function method and nonlinear dynamics of microtubules

We here present a model of nonlinear dynamics of microtubules (MT) in the context of modified extended tanh-function (METHF) method. We rely on the ferroelectric model of MTs published earlier by Satari\'c et al [1] where the motion of MT subunits is reduced to a single longitudinal degree of freedom per dimer. It is shown that such nonlinear model can lead to existence of kink solitons moving along the MTs. An analytical solution of the basic equation, describing MT dynamics, was compared with the numerical one and a perfect agreement was demonstrated. It is now clearer how the values of the basic parameters of the model, proportional to viscosity and internal electric field, impact MT dynamics. Finally, we offer a possible scenario of how living cells utilize these kinks as signaling tools for regulation of cellular traffic as well as MT depolymerisation.Comment: 20 pages, 6 figure

An Adaptive Probabilistic Model for Broadcasting in Mobile Ad Hoc Networks

Ad hoc peer-to-peer mobile phone networks (phone MANETs) enable cheap village level telephony for cash-strapped, off-the-grid communities. Broadcasting is a fundamental operation in such manets and is used for route discovery. This paper proposed a new broadcast technique that is lightweight, efficient and incurs low latency. Using extensive simulations, we compare our proposed technique to existing lightweight protocols. The results show that our technique is successful in outperforming existing lightweight techniques on the criteria that are critical for a phone-MANET.

Popular Matchings in Complete Graphs

Our input is a complete graph $G = (V,E)$ on $n$ vertices where each vertex has a strict ranking of all other vertices in $G$. Our goal is to construct a matching in $G$ that is popular. A matching $M$ is popular if $M$ does not lose a head-to-head election against any matching $M'$, where each vertex casts a vote for the matching in $\{M,M'\}$ where it gets assigned a better partner. The popular matching problem is to decide whether a popular matching exists or not. The popular matching problem in $G$ is easy to solve for odd $n$. Surprisingly, the problem becomes NP-hard for even $n$, as we show here.Comment: Appeared at FSTTCS 201

Mixed Polling with Rerouting and Applications

Queueing systems with a single server in which customers wait to be served at a finite number of distinct locations (buffers/queues) are called discrete polling systems. Polling systems in which arrivals of users occur anywhere in a continuum are called continuous polling systems. Often one encounters a combination of the two systems: the users can either arrive in a continuum or wait in a finite set (i.e. wait at a finite number of queues). We call these systems mixed polling systems. Also, in some applications, customers are rerouted to a new location (for another service) after their service is completed. In this work, we study mixed polling systems with rerouting. We obtain their steady state performance by discretization using the known pseudo conservation laws of discrete polling systems. Their stationary expected workload is obtained as a limit of the stationary expected workload of a discrete system. The main tools for our analysis are: a) the fixed point analysis of infinite dimensional operators and; b) the convergence of Riemann sums to an integral. We analyze two applications using our results on mixed polling systems and discuss the optimal system design. We consider a local area network, in which a moving ferry facilitates communication (data transfer) using a wireless link. We also consider a distributed waste collection system and derive the optimal collection point. In both examples, the service requests can arrive anywhere in a subset of the two dimensional plane. Namely, some users arrive in a continuous set while others wait for their service in a finite set. The only polling systems that can model these applications are mixed systems with rerouting as introduced in this manuscript.Comment: to appear in Performance Evaluatio