XCP is a serious candidate to replace TCP congestion control in the internet. TCP, despite perfor... more XCP is a serious candidate to replace TCP congestion control in the internet. TCP, despite performing end-to-end congestion remarkably well degrades network performance due to unstable throughput, limited fairness and limited fairness. In XCP the routers provides the explicit feedback about the link capacity to the source. In time varying capacity media such as IEEE 802.11 knowing this value is difficult as it depends on many variables. We explore three algorithms for time varying capacity media which maintain efficiency under such conditions. Finally we compare our proposal with TCP new Reno and how such algorithm outperforms in terms of efficiency.
ACM Transactions on Information and System Security, 2005
To achieve security in wireless sensor networks, it is important to be able to encrypt and authen... more To achieve security in wireless sensor networks, it is important to be able to encrypt and authenticate messages sent between sensor nodes. Before doing so, keys for performing encryption and authentication must be agreed upon by the communicating parties. Due to resource constraints, however, achieving key agreement in wireless sensor networks is nontrivial. Many key agreement schemes used in general networks, such as Diffie-Hellman and other public-key based schemes, are not suitable for wireless sensor networks due to the limited computational abilities of the sensor nodes. Predistribution of secret keys for all pairs of nodes is not viable due to the large amount of memory this requires when the network size is large.In this paper, we provide a framework in which to study the security of key predistribution schemes, propose a new key predistribution scheme which substantially improves the resilience of the network compared to previous schemes, and give an in-depth analysis of ou...
XCP is a serious candidate to replace TCP congestion control in the internet. TCP, despite perfor... more XCP is a serious candidate to replace TCP congestion control in the internet. TCP, despite performing end-to-end congestion remarkably well degrades network performance due to unstable throughput, limited fairness and limited fairness. In XCP the routers provides the explicit feedback about the link capacity to the source. In time varying capacity media such as IEEE 802.11 knowing this value is difficult as it depends on many variables. We explore three algorithms for time varying capacity media which maintain efficiency under such conditions. Finally we compare our proposal with TCP new Reno and how such algorithm outperforms in terms of efficiency.
ACM Transactions on Information and System Security, 2005
To achieve security in wireless sensor networks, it is important to be able to encrypt and authen... more To achieve security in wireless sensor networks, it is important to be able to encrypt and authenticate messages sent between sensor nodes. Before doing so, keys for performing encryption and authentication must be agreed upon by the communicating parties. Due to resource constraints, however, achieving key agreement in wireless sensor networks is nontrivial. Many key agreement schemes used in general networks, such as Diffie-Hellman and other public-key based schemes, are not suitable for wireless sensor networks due to the limited computational abilities of the sensor nodes. Predistribution of secret keys for all pairs of nodes is not viable due to the large amount of memory this requires when the network size is large.In this paper, we provide a framework in which to study the security of key predistribution schemes, propose a new key predistribution scheme which substantially improves the resilience of the network compared to previous schemes, and give an in-depth analysis of ou...
Uploads
Papers by Sowmya Gowda