Showing papers by "Devendra Jalihal published in 2014"
01 Aug 2014
TL;DR: This work addresses the problem of designing a communication system for deploying under disaster situations where the pre-disaster communication infrastructure has been uprooted by providing text, voice, and video communication links between the field worker and the operation center.
Abstract: We address the problem of designing a communication system for deploying under disaster situations where the pre-disaster communication infrastructure has been uprooted. The disaster communication system is required to aid in rescue effort by providing text, voice, and video communication links between the field worker and the operation center. It is also required to provide some communication services to the affected citizens so that the overwhelming demands made on the communication infrastructure during the times of disaster are mitigated to some extent. The other highlights of the design are (i) its low-cost nature achieved by exploiting the economies of scale, (ii) constant communication between the field worker and manager, (iii) the use of basic mobile phones with text-only features for gathering victim data and populating the victim database in real-time, and (iv) web-based applications for managing victim data.
4 citations
1 citations
17 Feb 2014
TL;DR: The exact closed-form expression of the diversity multiplexing tradeoff (DMT) for a modified nonorthogonal decode and forward cooperative protocol with unequal duration of broadcast and cooperation phases at finite signal-to-noise ratio in fading relay channels is computed.
Abstract: We compute the exact closed-form expression of the diversity multiplexing tradeoff (DMT) for a modified nonorthogonal decode and forward cooperative protocol with unequal duration of broadcast and cooperation phases at finite signal-to-noise ratio in fading relay channels. We show that the modified protocol provides a better DMT when compared with the standard protocol in certain scenarios.
08 May 2014
TL;DR: This paper analytically obtain the value of threshold for arrival rate to decide which videos to cache and derive lower and upper bounds for caching size and show that the optimal caching size lies between these bounds.
Abstract: Video caching provides an effective solution to the problem of increasing power consumption due to Internet infrastructure. The present work is the extension of [1] where we provided an approximate solution for optimal caching size. In this paper, we classify videos in N sets based on estimated arrival rate and analyze the power consumption of the video service. We analytically obtain the value of threshold for arrival rate to decide which videos to cache. We derive lower and upper bounds for caching size and show that the optimal caching size lies between these bounds. Further, we obtain a condition for the existence of lower and upper bounds. We perform simulations to analyze the performance of these bounds with optimal caching size.