Community Radio Stations are short range FM radio stations that attempt to meet the information needs of communities situated around them. While the concept of community radio is not new, the widespread proliferation of mobile phones has generated renewed interest in using phones in conjunction with radio for closer community engagement. Radio stations in developing regions are keenly looking for solutions to do this efficiently, as well as solve several other ICT challenges including content management, fault diagnosis, and reduced cost of setup. We have designed the Gramin Radio Inter Networking System (GRINS) to address these issues. In this paper, we describe the GRINS architecture, experimental setups to evaluate audio performance on lowcost commodity hardware, and a formally expressible framework to describe and diagnose radio station configurations. Our techniques and insights can serve to help other technological interventions meant for developing regions.

No abstract

We introduce hierarchical neighbor graphs, a new topology control mechanism for wireless sensor networks. This mechanism is a randomized one that takes a single parameter, 0 < p < 1, and uses it to build a structure that is fully distributed in the sense that it requires only local knowledge at each node to be formed and repaired, and moreover requires minimal computation in this process. Hierarchical neighbor graphs naturally account for differences in the battery power of nodes and are able to use energy efficiently by reorganizing dynamically when the battery power of heavily utilized nodes decreases, without any global coordination or communication. In this paper we study the lifetime and delay of hierarchical neighbor graphs, giving analytical characterizations of both. We present the results of extensive simulations that demonstrate how the lifetime and delay vary with various network parameters and the parameter p, also studying the effects of applicationspecific data aggregation policies. Through this simulation study we compare hierarchical neighbor graphs against other leading proposals for data collection in wireless sensor networks and demonstrate that in general our structure provides better lifetime values, and, importantly, is able to deal with heterogeneous distributions of initial battery power much better than previous proposals.

No abstract

The rapid growth of machine-to-machine communications in cellular networks poses the challenge of meeting the various Quality-of-Service requirements of massive number of machine to machine communications devices with limited radio resources. In this study, we discuss the minimum resource allocation problem for M2M communications through 5G and beyond the cellular networks. Then, in 5G mobile networks we propose a TYDER based algorithm for allocation the radio resource. The next-generation network environment, associated with heterogeneous performance, is expected to include the networks of diverse types. This paper introduces the network Traffic Type-based Differentiated Reputation (TYDER) solution, which differentiates the data delivery process according to its type.This approach however requires creativity in the reduction of hardware and cost decrease in the plan of little cell base station.