Now showing items 1-5 of 5

    • Achieving data K-availability in intermittently connected sensor networks 

      Jaggi, Neeraj; Takahashi, Masaaki; Tang, Bin (2014-08-04)
      We consider the problem of preserving data in intermittently connected sensor networks wherein sensor nodes do not always have connected paths to the base stations. The generated data is first stored inside the network ...
    • Data caching for enhancing anonymity 

      Bagai, Rajiv; Tang, Bin (IEEE Computer Society, 2011-03-22)
      The benefits of caching for reducing access time to frequently needed data, in order to improve system performance, are already well-known. In this paper, a proposal for employing data caching for increasing the level of ...
    • Effectiveness of probabilistic attacks on anonymity of users communicating via multiple messages 

      Bagai, Rajiv; Tang, Bin; Kim, Euna (IEEE, 2013-06)
      A major objective of any system-wide attack on an anonymity system is to uncover the extent to which each user of the system communicated with each other user. A probabilistic attack attempts to achieve this objective by ...
    • Energy-efficient data redistribution in sensor networks 

      Tang, Bin; Jaggi, Neeraj; Wu, Haijie; Kurkal, Rohini (ASSOC COMPUTING MACHINERY, 2013-06-24)
      We address the energy-efficient data redistribution problem in data-intensive sensor networks (DISNs). In a DISN, a large volume of data gets generated, which is first stored in the network and is later collected for further ...
    • Maximizing data preservation in intermittently connected sensor networks 

      Hou, Xiang; Sumpter, Zane; Burson, Lucas; Xue, Xinyu; Tang, Bin (IEEE, 2012-10)
      In intermittently connected sensor networks, wherein sensor nodes do not always have connected paths to the base station, preserving generated data inside the network is a new and challenging problem. We propose to preserve ...