Search Results - "Sankarasubramaniam, Y."

Wireless sensor networks: a survey by Akyildiz, I.F., Su, W., Sankarasubramaniam, Y., Cayirci, E.

“…This paper describes the concept of sensor networks which has been made viable by the convergence of micro-electro-mechanical systems technology, wireless…”
Get full text

Fixed-Rate Maximum-Runlength-Limited Codes From Variable-Rate Bit Stuffing by Sankarasubramaniam, Y., McLaughlin, S.W.

“…We introduce the fixed-rate bit stuff (FRB) algorithm for efficiently encoding and decoding maximum-runlength-limited (MRL) sequences. Our approach is based on…”
Get full text

Capacity achieving code constructions for two classes of (d,k) constraints by Sankarasubramaniam, Y., McLaughlin, S.W.

“…This correspondence presents two variable-rate encoding algorithms that achieve capacity for the (d,k) constraint when k=2d+1, or when k-d+1 is not prime. The…”
Get full text

Energy efficiency based packet size optimization in wireless sensor networks by Sankarasubramaniam, Y., Akyildiz, I.F., McLaughlin, S.W.

“…This paper addresses the question of optimal packet size for data communication in energy constrained wireless sensor networks. Unlike previous work on packet…”
Get full text

Random-access scheduling with service differentiation in wireless networks by Gupta, P., Sankarasubramaniam, Y., Stolyar, A.

“…Recent years have seen tremendous growth in the deployment of wireless local area networks (WLANs). An important design issue in such networks is that of…”
Get full text

Distributed scheduling in wireless data networks with service differentiation by Gupta, P., Sankarasubramaniam, Y., Stolyar, A.

“…A class of distributed scheduling algorithms, Regulated Contention Medium Access Control (RCMAC), which provides dynamic prioritized access to users for…”
Get full text

A survey on sensor networks by Akyildiz, I.F., Weilian Su, Sankarasubramaniam, Y., Cayirci, E.

“…The advancement in wireless communications and electronics has enabled the development of low-cost sensor networks. The sensor networks can be used for various…”
Get full text

A fixed-rate bit stuffing approach for high efficiency k-constrained codes by Sankarasubramaniam, Y., McLaughlin, S.W.

“…Binary sequences where successive ones are separated by at most k consecutive zeros, are said to be k-constrained. We introduce a new fixed-rate algorithm for…”
Get full text

Fault-tolerant secret key generation by Tyagi, H., Kashyap, N., Sankarasubramaniam, Y., Viswanathan, K.

“…Mobile nodes observing correlated data communicate using an insecure bidirectional switch to generate a secret key, which must remain concealed from the…”
Get full text

Jamming to foil an eavesdropper by Kashyap, N., Sankarasubramaniam, Y., Thangaraj, A.

“…We consider key-less secure communication against a passive adversary, by allowing the legitimate receiver to selectively jam transmitted bits. The channel…”
Get full text

Finite-state wiretap channels: Secrecy under memory constraints by Sankarasubramaniam, Y., Thangaraj, A., Viswanathan, K.

“…Information-theoretic security offered by the wiretap channel model has been extensively studied for various scenarios recently. One scenario that has not…”
Get full text

NLHB : A light-weight, provably-secure variant of the HB protocol using simple non-linear functions by Madhavan, M., Thangaraj, A., Viswanathan, K., Sankarasubramaniam, Y.

“…In this paper, we propose a light-weight provably-secure authentication protocol called the NLHB protocol, which is a variant of the HB protocol. The HB…”
Get full text

Bit Stuff Encoding for (0, G/I) Constraints by Sankarasubramaniam, Y., McLaughlin, S.W.

“…(0,G/I) constraints arise in magnetic recording systems that use partial-response equalization with maximum-likelihood sequence detection (PRML). In this…”
Get full text

A convolution interpretation of (M,d,k) run-length-limited capacity by Sankarasubramanian, Y., McLaughlin, S.W.

“…This paper considers the problem of capacity equivalence for a general class of (M,d,k) run-length-limited constraints, namely we look for pairs (M,d,k) and…”
Get full text