Bharath Krishnamachari

Learn More
Location-based services, such as on-line maps, obtain the exact location of numerous mobile users. This information can be published for research or commercial purposes. However, privacy may be compromised if a user is in the proximity of a sensitive site (e.g., hospital). To preserve privacy, existing methods employ the K-anonymity paradigm to hide each(More)
The traditional heavy-tailed interpretation of congestion is challenged in this paper. A counter example shows that a network with uniform degree can have significant traffic congestion when the degree is larger than 6. A profound understanding of what causes congestion is reestablished, based on the network curvature theorem. A load balancing algorithm(More)
Asymmetric Wireless sensor network is dynamic in nature and completely operates on infrastructure less environment. It discovers routes dynamically to reach the destination. Securing a dynamic route which is not known before communication is always a challenge. Energy conservation and finding the shortest path is a key challenge. In this paper propose a(More)
We investigate the tradeoff between two mutually conflicting performance objectives-throughput and delay-for fast, periodic data collection in tree-based sensor networks arbitrarily deployed in 2-D. Two primary factors that affect the data collection rate (throughput) and timeliness (delay) are: 1) efficiency of the link scheduling protocol, and 2)(More)
The wireless sensor networks are highly constrained type of network having sensor nodes with more capabilities. The sensor networks are deployed in various regions to collect the data. The critical issue of wireless Sensor Networks (WSNs) are network life and latency incurred to report data, which is the main area of research nowadays. The proposed model is(More)
  • 1