ppxscal/embedding_network huggingface dataset:
Loss-aware geographic routing for unreliable wireless sensor networks
Authors: Euhanna Ghadimi, Ahmad Khonsari, Mohammad S. Talebi, Nasser Yazdani
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

The research community has recently witnessed the emergence of densely deployed Wireless Sensor Networks (WSNs) consisting of a large number of battery-operated sensor nodes. As a candidate for monitoring remote faulty regions, WSNs may suffer from hardware and software faults which may cause misbehavior of a portion of network. Geographic routing algorithms aims at traversing data packets in such environments with admissible communication complexity. In this paper, we propose a novel region routing algorithm that addresses message loss tolerability in harsh and hostile environments by assigning higher weights to higher harsh regions. Finally, we present extensive simulation experiments to validate the accuracy of the proposed algorithm.
L1 prior majorization in Bayesian image restoration
Authors: Miguel Vega, Rafael Molina, Aggelos K. Katsaggelos
Venue: Proceedings of the 16th international conference on Digital Signal Processing (2009)

Bayesian methods rely on image priors that encapsulate prior image knowledge and avoid the ill-posedness of image restoration problems. In this paper a new prior based on the 11 norm of vertical and horizontal first order differences of image pixel values is introduced and its parameters are estimated. The results obtained from its application studied and compared with the ones provided by other methods in the literature.
Quantum error correction via codes over GF (2)
Authors: Arijit Chowdhury, B. Sundar Rajan
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2 (2009)

It is well known that n-Iength stabilizer quantum error correcting codes (QECCs) can be obtained via n-Iength classical error correction codes (CECCs) over GF(4), that are additive and self-orthogonal with respect to the trace Hermitian inner product. But, most of the CECCs have been studied with respect to the Euclidean inner product. In this paper, it is shown that n-length stabilizer QECCs can be constructed via 3n-length linear CECCs over GF(2) that are self-orthogonal with respect to the Euclidean inner product. This facilitates usage of the widely studied self-orthogonal CECCs to construct stabilizer QECCs. Moreover, classical, binary, self-orthogonal cyclic codes have been used to obtain stabilizer QECCs with guaranteed quantum error correcting capability. This is facilitated by the fact that (i) self-orthogonal, binary cyclic codes are easily identified using transform approach and (ii) for such codes lower bounds on the minimum Hamming distance are known. Several explicit codes are constructed including two pure MDS QECCs.
An algebraic watchdog for wireless network coding
Authors: MinJi Kim, Muriel Médard, João Barros, Ralf Kötter
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2 (2009)

In this paper, we propose a scheme, called the algebraic watchdog for wireless network coding, in which nodes can detect malicious behaviors probabilistically, police their downstream neighbors locally using overheard messages, and, thus, provide a secure global self-checking network. Unlike traditional Byzantine detection protocols which are receiver-based, this protocol gives the senders an active role in checking the node downstream. This work is inspired by Marti et al.'s watchdog-pathrater, which attempts to detect and mitigate the effects of routing misbehavior. As the first building block of a such system, we focus on a two-hop network. We present a graphical model to understand the inference process nodes execute to police their downstream neighbors; as well as to compute, analyze, and approximate the probabilities of misdetection and false detection. In addition, we present an algebraic analysis of the performance using an hypothesis testing framework, that provides exact formulae for probabilities of false detection and misdetection.
Noisy feedback linear precoding: a Bayesian Cramér-Rao bound
Authors: Alon Shalev Housfater, Teng Joon Lim
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3 (2009)

Transmitter precoding strategies in broadcast systems generally assume perfect knowledge of channel state information (CSI) at the transmitter. In this paper, we study linear precoding with arbitrary error in the CSI from an estimation theoretic point of view. We derive a Bayesian Cramér-Rao type bound on the sum mean squared error (SMSE) achievable at the receiver for any linear precoding scheme for arbitrary feedback noise and channel fading. We next specialize this result to power constrained precoders. It is shown that the regularity conditions of the bound may be significantly weakened for power constrained precoders. Interestingly, we obtain a bound whose validity depends on rather weak conditions of continuity and differentiability on the joint distribution of the channel and feedback. We demonstrate the bound by applying it to Gaussian, Nakagami-m and Weibull fading models, with the assumption of feedback corrupted by additive Gaussian noise.
Amplify-and-forward two-way relay channels: error exponents
Authors: Hien Quoc Ngo, Tony Q. S. Quek, Hyundong Shin
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3 (2009)

In a two-way relay network, two terminals exchange information over a shared wireless half-duplex channel with the help of a relay. Due to its fundamental and practical importance, there has been an increasing interest in this channel. However, surprisingly, there has been little work that characterizes the fundamental tradeoff between the communication reliability and transmission rate across all signal-to-noise ratio (SNR) ratios. In this paper, we consider amplify-and-forward (AF) two-way relaying due to its simplicity. We first derive the random coding error exponent for the link in each direction. From the exponent expression, the capacity and cutoff rate for each link are also deduced. We then put forth the notion of the bottleneck error exponent, which is the worst exponent decay between the two links, to give us insight into the fundamental tradeoff between the rate pair and information-exchange reliability of the two terminals.
Toward improving scheduling strategies in pull-based live P2P streaming systems
Authors: Anis Ouali, Brigitte Kerherve, Brigitte Jaumard
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

Several recent P2P streaming systems have adopted mesh overlays to disseminate content to participating peers because this topology appears to be more resilient to churns. To cope with inferred problems, such as data redundancy, these systems opt for data-driven content retrieval mechanisms (pull mechanisms). Each node has a list of neighbors with whom it periodically exchanges buffer information and requests content fragments. One of the drawbacks of such a mechanism is that it does not offer intelligent selection of sending neighbors based on their characteristics. This is mainly because the most important criteria used to select nodes is the content availability. This can result in some performance degradation, for instance, due to peers that are sending very small or big parts of the needed data. Resiliency may then be weakened and overhead increased. In this paper we propose to study how the integration of some end nodes characteristics can improve the performance of a typical pull mechanism with random scheduling. We show that the improvement in performance is significant enough despite the fact that the room for improvement is bounded by the limitations of the pull mechanism. Hence we believe that the awareness of end characteristics is an important block upon which we can build more efficient content retrieval mechanisms. The gain in performance can also be amplified by proposing an alternative to the pull mechanism such as a combined pull-push approach.
Anisotropic behaviour of breast tissue for large compressions
Authors: C. Tanner, M. White, S. Guarino, M. A. Hall-Craggs, M. Douek, D. J. Hawkes
Venue: Proceedings of the Sixth IEEE international conference on Symposium on Biomedical Imaging: From Nano to Macro (2009)

Several methods have been proposed to simulate large breast compressions such as those occurring during X-ray mammography. However evaluation of these methods against real data is rare. We acquired magnetic resonance images of eleven breasts before and after applying a relatively large in-vivo compression in the medial direction. Using non-rigid registration we observed an anisotropic deformation behaviour, with a reduced elongation in the anterior-posterior direction and an increased stretch in inferior-superior direction for all but one subject. Higher anisotropy was observed for larger compressions and in the central breast region. Using finite element simulations, we assessed the optimum performance of isotropic and transverse isotropic material models to predict the displacement of internal landmarks. We found that isotropic materials reduced the mean displacement error from 23.3mm to 4.3mm on average. Smaller errors were achieved with transverse isotropic materials (3.8mm). For large compressions (>35%) the difference (5.2mm vs. 4.1mm) was statistically significant (p=0.04). Of the parameters varied, the amount of skin stiffness and anisotropy had the greatest influence on the results.
Waterfall region performance of punctured LDPC codes over the BEC
Authors: Iryna Andriyanova, Rudiger Urbanke
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4 (2009)

This paper is devoted to the analysis of finite-length iterative performance of punctured LDPC ensembles in the waterfall region, assuming the transmission over the binary erasure channel (BEC). The analysis is carried out using the scaling approach proposed in [1]. Two punctured ensembles are considered: (a) randomly punctured ensembles, in the sense that each bit of a codeword is punctured with some puncturing probability; (b) ensembles with a fixed puncturing fraction of bits of each degree. In both cases, parameters of the scaling approximation are completely determined in terms of the ensemble parameters such as left, right and puncturing degree distributions.
Noisy feedback improves the BSC reliability function
Authors: Marat V. Burnashev, Hirosuke Yamamoto
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3 (2009)

For the information transmission a binary symmetric channel is used. There is also another noisy binary symmetric channel (feedback channel), and the transmitter observes without delay all the outputs of the forward channel via that feedback channel. The overall transmission time is fixed. The transmission of a exponential number of messages (i.e. the transmission rate is positive) is considered. The achievable decoding error exponent for such a combination of channels is investigated. It is shown that if the crossover probability of the feedback channel is less than a certain positive value, then the achievable error exponent is better than the best known lower bound for the error exponent of the no-feedback channel.
A SIP security testing framework
Authors: Hemanth Srinivasan, Kamil Sarac
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

Session Initiation Protocol (SIP) has emerged as the predominant protocol for setting up, maintaining, and terminating Voice over Internet Protocol (VoIP) sessions. In spite of the security mechanisms that it offers, several attacks are being made on the SIP architecture. In this paper we take a proactive approach and highlight the importance of testing SIP from a security perspective. We first give a brief introduction to some of the most common attacks on SIP. We then describe a framework to effectively test several security aspects of a SIP network and thereby help mitigate such attacks. We also present a genetic algorithm that we developed and used to generate data in our fuzz testing. Finally, we present the results of some tests performed on popular SIP devices using our framework.
Connected consumption: the hidden networks of consumption
Authors: Kwan Hong Lee, Dawei Shen, Andrew Lippman, David Reed, Hans D. Schumacher
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

In this paper, we present the Connected Consumption Network (CCN) that allows a community of consumers to collaboratively sense the market from a mobile device, enabling more informed financial decisions in geo-local context. The mobile application allows one to log one's wish list and itemized list of transactions to form a social network around the list of interests. Individuals can share this data to inform and guide others in a timely, personal and contextual manner when they are shopping for a product or seeking a service. It can also help people connect opportunistically in a local area to make group purchases, to pick up an item for a friend, and to perform reverse auctions. We present the design, architecture and concept prototype. We simulate a social network with three months of existing credit/debit card transaction data in various geographical areas to analyze the mutual information and recommendations that can be shared among networked consumers.
Feasible alphabets for communicating the sum of sources over a network
Authors: Brijesh Kumar Rai, Bikash Kumar Dey
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2 (2009)

We consider directed acyclic sum-networks with m sources and n terminals where the sources generate symbols from an arbitrary alphabet field F, and the terminals need to recover the sum of the sources over F. We show that for any co-finite set of primes, there is a sum-network which is linearly solvable only over fields of characteristics belonging to that set. We further construct a sum-network where a scalar linear solution exists over all fields other than the binary field F2. We also show that a sum-network is linearly solvable over a field if and only if its reverse network is linearly solvable over the same field.
Coding along Hermite polynomials for Gaussian noise channels
Authors: Emmanuel A. Abbe, Lizhong Zheng
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3 (2009)

This paper shows that the capacity achieving input distribution for a fading Gaussian broadcast channel is not Gaussian in general. The construction of non-Gaussian distributions that strictly outperform Gaussian ones, for certain characterized fading distributions, is provided. The ability of analyzing non-Gaussian input distributions with closed form expressions is made possible in a local setting. It is shown that there exists a specific coordinate system, based on Hermite polynomials, which parametrizes Gaussian neighborhoods and which is particularly suitable to study the entropic operators encountered with Gaussian noise.
IPTV service delivery over SP-driven P2P networks: a framework for linear to non-linear service distribution
Authors: Mubashar Mushtaq, Toufik Ahmed
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

P2P-based IPTV service delivery is considered as the next killer application over the Internet. P2P systems address the issues of scalability and are considered most suitable architecture for the real-time content distribution/sharing. On the other hand, P2P applications show greedy behavior in the consumption of available network bandwidth and leads to the problems of inefficient utilization of network resources and poor interactions with other applications. These problems are due to the lack of coordination among service providers (SPs) and P2P applications. Thus, in this paper, we present a SP-driven P2P framework for the IPTV Service delivery to facilitate the service delivery mechanism with improved Quality of Services (QoS). The proposed mechanism is assisted by the explicit communications among SPs and P2P applications for efficient utilization of available resources. The proposed mechanism also addresses the issues related to QoS provisioning and the non-linear service distribution.
Location awareness for everyday smart computing
Authors: Ferit Ozan Akgül, Kaveh Pahlavan
Venue: Proceedings of the 16th international conference on Telecommunications (2009)

Rapid advances in the area of digital systems is an enabler for ubiquitous computing making devices smaller and smarter and paving the way for an interconnected digital world. The most influential digital technology that has changed the lives of so many people and made the interconnected world a possibility is undoubtedly the development of wireless cellular communications. In the early stages of cellular wireless telephony development there was only one idea in mind: communication between people without the need for wires. The hexagonal cellular principles laid out by Ring and Young at AT&T Bell Labs in 1947 were the initial steps towards realizing the goal of ubiquitous communication. Global ceUular networks, now serving more than 4 billion people around the world is a true testimony to the visions of many computer pioneers sucb as Mark Weiser, past CTO of Xerox PARC, who first coined the term, ubiquitous. Thus internetworking of "things" gains particular importance with tbe wide availability of smart devices capable of performing tasks well beyond voice communication. One key component of ubiquitous computing is "location awareness" and is a field of intensive research for various applications requiring varying levels of accuracy. This paper briefly discusses the basics of common location technologies and focuses on cellular based positioning and its practicality for location awareness for everyday smart gadgets.
On a class of doubly-generalized LDPC codes with single parity-check variable nodes
Authors: Enrico Paolini, Mark F. Flanagan, Marco Chiani, Marc P. C. Fossorier
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3 (2009)

A class of doubly-generalized low-density parity-check (D-GLDPC) codes, where single parity-check (SPC) codes are used as variable nodes (VNs), is investigated. An expression for the growth rate of the weight distribution of any D-GLDPC ensem ble with a uniform check node (CN) set is presented at first, together with an analytical technique for its efficient evaluation. These tools are then used for detailed analysis of a case study, namely, a rate-1/2 D-GLDPC ensemble where all the CNs are (7,4) Hamming codes and all the VNs are length-7 SPC codes. It is illustrated how the VN representations can heavily affect the code properties and how different VN representations can be combined within the same graph to enhance some of the code parameters. The analysis is conducted over the binary erasure channel. Interesting features of the new codes include the capability of achieving a good compromise between waterfall and error floor performance while preserving graphical regularity, and values of threshold outperforming LDPC counterparts.
Localizing the dermis/epidermis boundary in reflectance confocal microscopy images with a hybrid classification algorithm
Authors: Sila Kurugol, Jennifer G. Dy, Milind Rajadhyaksha, Dana H. Brooks
Venue: Proceedings of the Sixth IEEE international conference on Symposium on Biomedical Imaging: From Nano to Macro (2009)

Confocal reflectance microscopy is an emerging modality, for dermatology applications, especially for in-situ and bedside detection of skin cancers. As this technology gains acceptance, automated processing methods become increasingly important to develop. Since the dominant internal feature of the skin is the epidermis/dermis boundary, it has been chosen as the initial target for this development. This boundary is a complex corrugated 3D layer marked by optically subtle changes and features. Indeed, even trained clinicians in an attempt at validation of our early work, were unable to precisely and reliably locate the boundary within optical resolution. Thus here we propose to detect two boundaries, a lower boundary for the epidermis and an upper boundary for the dermis thus trapping the epidermis/dermis boundary. We use a novel combined segmentation/classification approach applied to z-sequences of tiles in the 3D stack. The approach employs a sequential classification on texture features, selected via on-line feature selection, to minimize the labeling required and to cope with high inter- and intra-subject variability and low optical contrast. Initial results indicate the ability of our approach to find these two boundaries successfully for most of the z-sequences from the stack.
Performance bounds on compressed sensing with Poisson noise
Authors: Rebecca M. Willett, Maxim Raginsky
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1 (2009)

This paper describes performance bounds for compressed sensing in the presence of Poisson noise when the underlying signal, a vector of Poisson intensities, is sparse or compressible (admits a sparse approximation). The signal-independent and bounded noise models used in the literature to analyze the performance of compressed sensing do not accurately model the effects of Poisson noise. However, Poisson noise is an appropriate noise model for a variety of applications, including low-light imaging, where sensing hardware is large or expensive, and limiting the number of measurements collected is important. In this paper, we describe how a feasible positivity-preserving sensing matrix can be constructed, and then analyze the performance of a compressed sensing reconstruction approach for Poisson data that minimizes an objective function consisting of a negative Poisson log likelihood term and a penalty term which could be used as a measure of signal sparsity.
Pricing based power control game for cognitive radio networks
Authors: Li Jiandong, Yang Chungang, Li Weiying, Chen Dong, Chen Dan
Venue: Proceedings of the 16th international conference on Telecommunications (2009)

Cognitive Radio has been recently been proposed as a promising technology to improve the spectrum utilization efficiency by intelligently sensing and opportunely spectrum accessing some vacant bands of the primary users. In this paper, the power control problem in secondary system is modeled as a non-cooperative game model. To improve the secondary system's performance, a pricing function based on Signal-to-Interference and Noise Ratio (SINR) is incorporated into the non-cooperative power control game model, which referred as NPCGP in this paper. The existence, uniqueness and Pareto optimality of Nash Equilibrium (NE) for the proposed NPCGP model are proved. An iterative power allocation algorithm based on NPCGP mode is proposed in this paper. Simulation results show that the algorithm is robust and it converges rapidly. By setting appropriate parameters, our algorithm will converge to a NE after about 3-5 iterative operations which can satisfy the real-time requirement. The effect of the parameters (e.g. punishment factor, the constant factor c) on the performance is discussed. It is shown that the network throughput with our algorithm is 1-4 times greater than the traditional algorithm.