Koushik Sinha

Koushik Sinha

Auto-generated profile, based on publicly available information

Koushik Sinha

School of Computing, Southern Illinois University, Carbondale, USA

Research Focus & Metrics

Academic Career Length

25Years (2002-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
3 May 2011 in Wireless Communications and Mobile Computing
Verified
Journal Article
Closed access
GAGoutam K. Audhya
Goutam K. Audhya
KSKoushik Sinha
Koushik Sinha
SGSasthi C. Ghosh
Sasthi C. Ghosh
BSBhabani P. Sinha
Bhabani P. Sinha

17 January 2012 in IEEE Transactions on Computers
Verified
Journal Article
Closed access
SGSourav Sen Gupta
Sourav Sen Gupta
ACAnupam Chattopadhyay
Anupam Chattopadhyay
KSKoushik Sinha
Koushik Sinha
SMSubhamoy Maitra
Subhamoy Maitra
BSBhabani P. Sinha
Bhabani P. Sinha
RC4 is the most popular stream cipher in the domain of cryptology. In this paper, we present a systematic study of the hardware implementation of RC4, and propose the fastest known architecture for the cipher. We combine the ideas of hardware pipeline and loop unrolling to design an architecture that produces 2 RC4 keystream bytes per clock cycle. We have optimized and implemented our proposed design using VHDL description, synthesized with 130, 90, and 65 nm fabrication technologies at clock frequencies 625 MHz, 1.37 GHz, and 1.92 GHz, respectively, to obtain a final RC4 keystream throughput of 10, 21.92, and 30.72 Gbps in the respective technologies.

13 December 2010 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
KSKoushik Sinha
Koushik Sinha
BSBhabani P. Sinha
Bhabani P. Sinha
DDDebasish Datta
Debasish Datta
We propose a redundant radix based number (RBN) representation for encoding and transmitting data for applications which typically utilize low cost devices and demand low power operations with simple modulation techniques like ASK, OOK and FSK. Coupled with silent periods for communicating the digit zero, this encoded communication scheme, called as RBNSiZeComm, provides a highly energy-efficient technique for data transmission. Considering an n-bit data representation and assuming that each of the 2n binary strings is equally likely to occur, theoretically obtainable fraction of energy savings by using our proposed RBNSiZeComm transmission protocol is, on an average, 1 - n+2/4n. A hybrid modulation scheme using FSK and ASK with non-coherent detection based receiver for the RBNSiZeComm protocol has been presented. Assuming equal likelihood of all possible binary strings of a given length, there is nearly 53% savings in energy on an average at the transmitter relative to binary FSK, over additive white gaussian noise (AWGN) channels. Simulation results demonstrate that compared to binary FSK, our proposed implementation can extend the battery life of devices from about 33% to 62% on an average in applications like remote healthcare and wireless sensor networks for agriculture.

1 November 2009 in Computers & Mathematics with Applications
Verified
Journal Article
Closed access
KSKoushik Sinha
Koushik Sinha
BSBhabani P. Sinha
Bhabani P. Sinha

19 July 2012 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
GAGoutam K. Audhya
Goutam K. Audhya
KSKoushik Sinha
Koushik Sinha
KMKalikinkar Mandal
Kalikinkar Mandal
RDRana Dattagupta
Rana Dattagupta
SGSasthi C. Ghosh
Sasthi C. Ghosh
BSBhabani P. Sinha
Bhabani P. Sinha
This paper presents a novel method for solving channel assignment problems (CAPs) in hexagonal cellular networks with nonhomogeneous demands in a 2-band buffering system (where channel interference does not extend beyond two cells). The CAP with nonhomogeneous demand is first partitioned into a sequence of smaller subproblems, each of which has a homogeneous demand from a subset of the nodes of the original network. Solution to such a subproblem constitutes an assignment phase, where multiple homogeneous demands are assigned to the nodes corresponding to the subproblem, satisfying all the frequency separation constraints. The whole assignment process for the original network consists of a succession of multiple homogeneous assignments for all the subproblems. Based on this concept, we present a polynomial time approximation algorithm for solving the CAP for cellular networks having nonhomogeneous demands. Our proposed assignment algorithm, when executed on well-known benchmark instances, comes up with an assignment which is always within about 6 percent more than the optimal bandwidth, but requires a very small execution time (less than 5 millisecond on a HPxw8400 workstation). The proposed algorithm is very much suitable for real-life situations, where fast channel assignment is of primary importance, tolerating, however, a marginal deviation (6 percent) from the optimal bandwidth.

3 April 2010 in Wireless Networks
Verified
Journal Article
Closed access
PDF file
KSKoushik Sinha
Koushik Sinha
BSBhabani P. Sinha
Bhabani P. Sinha
DDDebasish Datta
Debasish Datta