Shyam Kapadia

Learn More
Advances in wireless communication, storage and processing are realizing next-generation in-vehicle entertainment systems. Even if hundreds of different video or audio titles are stored among several vehicles in an area, only a subset of these titles might be available to a given vehicle depending on its current location, intended path, and the dynamics of(More)
— We present a comparative mathematical analysis of two important distinct approaches to hybrid push-pull querying in wireless sensor networks: structured hash-based data-centric storage (DCS) and the unstructured comb-needle (CN) rendezvous mechanism. Our analysis, which is based on a single-sink square-grid deployment, yields several interesting insights.(More)
— Advances in communication and processing have made ad-hoc networks of wireless devices a reality. One application is home entertainment systems where multiple Home-to-Home (H2O) devices collaborate as peers to stream audio and video clips to a household. In this study, we investigate the feasibility of IEEE 802.11a protocol in combination with both TCP(More)
This study investigates alternative continuous media replication techniques and their impact on content availability in a mobile car-to-car peer-to-peer (C2P2) network of devices. Using aggregate availability latency as a metric, we compare a simple random replication mechanism with a family of techniques that compute the degree of replication for each(More)
Introduction :We study the effects of mobility on packet loss in mobile ad-hoc networks (MANETs). Mobility is generally accepted as a cause of packet loss. Other broad causes of loss in MANETs are losses in the wireless channel and losses due to congestion. While there exist many models for wireless channel and congestion losses, mobility-related losses(More)
In the last few years, several studies have analyzed the performance of flooding and random walks as querying mechanisms for unstructured wireless sensor networks. However, most of the work is theoretical in nature and while providing insights into the asymptotic behavior of these querying mechanisms, does not account for the non-idealities faced by the(More)
  • David Kempe, Farnoush Banaei-Kashani, Shishir Bharathi, Fang Bian, Yuriy Brun, Iftikhar Burhanuddin +17 others
  • 2011
Preface The present notes are derived from a course taught at the University of Southern California. The focus of the course is on the mathematical and algorithmic theory underpinning the connections between networks and information. These connections take two predominant forms: • Network structure itself encodes a lot of information. For instance,(More)
This study investigates replication strategies for reducing latency to desired content in a vehicular peer-to-peer network. We provide a general constrained optimization formulation for efficient replication and study it via analysis and simulations employing a discrete random walk mobility model for the vehicles. Our solution space comprises of a family of(More)
We study the process of the spread of an infection among mobile nodes moving on a finite, grid based map. A random walk and a novel adversarial model are considered as two extreme cases of node mobility. With <i>N</i> nodes, we present analytical and simulation results for both mobility models for a square grid map with size &#8730;<i>G</i> &#215;(More)
  • Shahram Ghandeharizadeh, Tooraj Helmi, Taehee Jung, Shyam Kapadia, Shahin Shayandeh
  • 2006
This paper focuses on a greedy data placement strategy for a mesh network of peer-to-peer devices that collaborate to stream continuous media, audio and video clips. The greedy placement strategy, termed Simple, strives to maximize the number of references served by the local storage of a peer. We analyze two policies to realize this placement:(More)