14352341
Energy-Distortion-Authentication Optimized Resource Allocation for Secure Wireless Image Streaming
Joint consideration of energy efficiency, multimedia quality and media authenticity has largely been overlooked in the studies of secure wireless multimedia streaming. In this paper, we propose an authentication - resource allocation framework for secure transmission of multimedia streaming over energy constrained wireless networks. The contributions of this research can be summarized in three aspects. Firstly, a hash chain based stream level authentication scheme compatible for JPEG2000 compression standard is proposed. Secondly, link layer energy- distortion is modeled, and the energy-distortion convex hull is efficiently identified, which significantly reduces optimization complexity. Finally, an authentication oriented resource allocation scheme is proposed based on the proposed authentication scheme and link layer energy-distortion convex hull, where the authenticated image quality is optimized according to energy budget constraints.
12735466
Position Based Unequal Error Protection for Image Transmission with Energy Constraint over Multirate XPD MIMO Sensor Networks
Multimedia delivery over Wireless Sensor Networks (WSNs) is energy critical. In this paper, we study an energy constrained cross layer optimization scheme to improve digital image quality in cross polarization discrimination (XPD) based Multiple Input Multiple Output (MIMO) WSNs. The contribution of this research can be summarized in three parts. First, link layer energy consumption and packet loss ratio in multirate XPD based MIMO WSN are modeled. Secondly, XPD based modulation optimization cross link and physical layer is proposed, achieving considerable energy efficiency. Finally, a new Position-Value (P- V) based Unequal Error Protection (UEP) scheme is studied and discussed in XPD MIMO WSNs, with more efficient resource allocation compared to traditional approaches. Simulation results show the proposed modulation optimization scheme improves energy efficiency considerably, and position based UEP achieves significant distortion-energy gain compared with traditional layer based resource allocation schemes in XPD MIMO WSNs.
16514948
Interplay Between Routing and Distributed Source Coding in Wireless Sensor Network
Recent advances in distributed source coding (DSC) for mission-driven wireless sensor networks (WSN) are related to the coding for multiple correlated sensors in applications such as real time target tracking and environment monitoring. The characteristic of these DSC applications provides significant potential opportunities in the associated sensor network to utilize multirate transmissions for enhancing network performance. In this paper, we study a methodology for interplay optimization between routing and DSC in WSN, and propose a novel multirate based routing scheme for mission-driven DSC applications that considerably extends network lifetime. The proposed scheme adopts the rate assignment based on the residual energy, and employs a joint rate and energy scheduling mechanism to meet the end-to-end transmission rate constraint, information precision requirement, and the energy constraints in the network for DSC. Simulation results show that this multirate based routing scheme achieves significantly longer network lifetime compared to other existing research in WSN for DSC applications.
8653895
The Implementation of an Energy Balanced Routing Protocol with Dynamic Power Scaling in TinyOS
In this paper, we study an energy balanced routing protocol based on dynamic power scaling techniques for wireless sensor networks. In the proposed protocol, each node maintains a list of neighboring nodes and their corresponding statistical residual energy information. The energy balanced routing distributes the levels of residue energy evenly throughout the network, while the dynamic power scaling scheme achieves further energy savings by adjusting transmission power to meet signal strength requirement at the receiver. In order to demonstrate the increased energy efficiency of the proposed protocol, we have conducted an experimental study. The results of our experimental study clearly show that the proposed energy balanced routing scheme with dynamic power improves energy efficiency while achieving energy balance as well
21523302
Image Rate Based Cross Layer Optimizations for Image Delivery in Wireless Sensor Networks
37619733
Taming Underlying Design for Energy Efficient Distributed Source Coding in Multirate Wireless Sensor Network
Signal processing applications such as Distributed Source Coding (DSC) in Wireless Sensor Network (WSN) are often multirate in nature, which provide additional significant opportunities in WSN design for achieving energy efficiency. In this paper, we analyze the DSC traffic for signal processing applications in multirate WSN and propose a novel rate oriented approach with MAC and PHY cross layer utilization to achieve high energy efficiency. Simulation results show that the proposed approach achieves significant energy efficiency by a factor of three while maintaining the transmission quality in WSN. This approach can be easily extended to other WSN MAC and PHY designs, providing multirate service to application layer to allow achieving higher energy efficiency
1043853
Scalable mining of large disk-based graph databases
Mining frequent structural patterns from graph databases is an interesting problem with broad applications. Most of the previous studies focus on pruning unfruitful search subspaces effectively, but few of them address the mining on large, disk-based databases. As many graph databases in applications cannot be held into main memory, scalable mining of large, disk-based graph databases remains a challenging problem. In this paper, we develop an effective index structure, ADI (for <u>ad</u>jacency <u>i</u>ndex), to support mining various graph patterns over large databases that cannot be held into main memory. The index is simple and efficient to build. Moreover, the new index structure can be easily adopted in various existing graph pattern mining algorithms. As an example, we adapt the well-known gSpan algorithm by using the ADI structure. The experimental results show that the new index structure enables the scalable graph pattern mining over large databases. In one set of the experiments, the new disk-based method can mine graph databases with one million graphs, while the original gSpan algorithm can only handle databases of up to 300 thousand graphs. Moreover, our new method is faster than gSpan when both can run in main memory.
2197213
Reconstruction of ancestral gene order after segmental duplication and gene loss
As gene order evolves through a variety of chromosomal rearrangements, conserved segments provide important insight into evolutionary relationships and functional roles of genes. However, gene loss within otherwise conserved segments, as typically occurs following large-scale genome duplication, has received limited algorithmic study. This has been a major impediment to comparative genomics in certain taxa, such as plants and fish. We propose a heuristic algorithm/or the inference of ancestral gene order in a set of related genomes that have undergone large-scale duplication and gene loss. First, approximately conserved (i.e. homologous) segments are identified using pairwise local genome alignment. Second, homologous segments are iteratively clustered under the control of two parameters, (1) the minimal required number of shared genes between two clusters and (2) the maximal allowed number of rearrangement breakpoints along the lineage leading to each descendant segment. Finally, we compute an estimated ancestral gene order for each cluster that is optimal in some sense. We evaluate the performance of this algorithm on simulated data that models a genome evolving by large-scale duplication, duplicate gene loss, transposition, translocation, and inversion. The results suggest that long segments of ancestral gene order may be reconstructed following moderate levels of rearrangement with only minor loss of accuracy.
14570977
Energy-efficient Coverage for Target Detection in Wireless Sensor Networks
In this paper we consider the coverage problem for target detection applications in wireless sensor networks. Unlike conventional coverage problems which assume sensing regions are disks around sensors, we define the sensing region according to detection constraints in terms of false alarm probability and missing probability. We show that exploiting cooperation between sensors can extend the overall sensing region while maintain the same constraints on false alarm probability and missing probability. We then propose an energy efficient cooperative detection scheme and study the trade-offs on energy consumption between cooperative and non-cooperative schemes. The cooperative scheme can use half the number of sensors to monitor the whole field compared to disk model in networks deployed on grids. We also study the communication overheads incurred by the cooperative scheme, and show that only cooperation between limited number of nearby sensors is profitable in terms of energy consumption. In our simulations on randomly deployed networks, cooperation reduces the number of sensors to cover the area by 30% and nearly doubles the number of disjoint sensor sets where each can fully cover the area. Appropriately trading off energy consumption with coverage extension, our cooperative detection scheme can increase the network lifetime by nearly 70%.
3179831
RNS application for digital image processing
In this paper, we carry out a study on the RNS (residue number system) application in digital image processing and propose a RNS image coding scheme that offers high-speed and low-power VLSI implementation for secure image processing. The proposed scheme is more efficient than the RNS image coding scheme of Ammar et al. (2001) in that the proposed method encrypts the entire image and does not require any additional component other than a standard RNS system. Further, the proposed scheme is based on the modified CRT and its associated residue-to-binary conversion and moduli selection methods and is more efficient than the scheme by Ammar et al. (2001) in terms of VLSI implementation. The design of an encoder and decoder pair for the greyscale image is carried out using MATLAB tool and some VLSI tools. The preliminary results of the Matlab simulation demonstrate the security ability of the proposed image coding scheme.
33979500
Decentralized adaptive backstepping stabilization of interconnected systems with dynamic input and output interactions
So far there is still no result available for backstepping based decentralized adaptive stabilization of unknown systems with interactions directly depending on subsystem inputs, even though such interactions commonly exist in practice. In this paper, we provide a solution to this problem by considering both input and output dynamic interactions. To clearly illustrate our approaches, we will start with linear systems and then extend the results to nonlinear systems. Each local controller, designed simply based on the model of each subsystem by using the standard adaptive backstepping technique without any modification, only employs local information to generate control signals. It is shown that the designed decentralized adaptive backstepping controllers can globally stabilize the overall interconnected system asymptotically. The L"2 and L"~ norms of the system outputs are also established as functions of design parameters. This implies that the transient system performance can be adjusted by choosing suitable design parameters.