Learn More
Unlike wired networks, wireless networks do not come with links. Rather, links have to be fashioned out of the ether by nodes choosing neighbors to connect to. Moreover the location of the nodes may be random. The question that we resolve is: How many neighbors should each node be connected to in order that the overall network is connected in a multi-hop(More)
In recent years there has been significant and increasing interest in ad hoc wireless networks. The design, analysis and deployment of such wireless networks necessitate a fundamental understanding of how much information transfer they can support, as well as what the appropriate architectures and protocols are for operating them. This monograph addresses(More)
— We consider networks consisting of nodes with radios, and without any wired infrastructure, thus necessitating all communication to take place only over the shared wireless medium. The main focus of this paper is on the effect of fading in such wireless networks. We examine the attenuation regime where either the medium is absorptive, a situation which(More)
—Network coding for two-way relaying in a three-node network is considered. The achievable rate regions under both traditional four-slot multi-hopping (FSMH) and network coding (MAC-XOR) are characterized, showing a combination between the two is needed for a larger region. This is accomplished by an opportunistic network coding scheduling which requires(More)
—The problem of characterizing the capacity region for Gaussian broadcast channels with receiver message side information appears difficult and remains open for N ≥ 3 receivers. This paper proposes a joint network and Gelfand-Pinsker coding method for 3-receiver cases. Using the method, we establish a unified inner bound on the capacity region of 3-receiver(More)
In this paper, we propose a novel deconvolution algorithm based on the minimization of a regularized Stein's unbiased risk estimate (SURE), which is a good estimate of the mean squared error. We linearly parametrize the deconvolution process by using multiple Wiener filters as elementary functions, followed by undecimated Haar-wavelet thresholding. Due to(More)
This paper details the results of a Face Authentica-tion Test (FAT2004) [2] held in conjunction with the 17th International Conference on Pattern Recognition. The contest was held on the publicly available BANCA database [1] according to a defined protocol [7]. The competition also had a sequestered part in which institutions had to submit their algorithms(More)