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.
16642996
Implementation and performance evaluation of Selective Repeat ARQ for WiMAX NS-2 model
With the steady development of WiMAX based broadband wireless access networks, complete and accurate simulation studies become crucial. In an effort to further improve our ns-2 simulation model for mobile WiMAX, we have implemented a selective repeat automatic retransmission request (SR-ARQ) mechanism into our model and evaluated its performance and accuracy. In this paper, we present the design and implementation methodology of the WiMAX SR-ARQ simulation model in ns-2 and discuss its accuracy via extensive simulation studies. Our evaluation clearly shows that SR-ARQ achieves increased successful packet delivery ratio and goodput, which is true for both non-saturated channels and saturated channels. In each case a cost of increased bandwidth consumption and latency overhead for received packets is also quantitatively analyzed. We believe the implementation of SR-ARQ in the ns-2 simulation model and its evaluation studies will provide profound empirical values to WiMAX field test studies.
19598296
Type I HARQ performance modeling and evaluation of mobile WiMAX for network simulators
While the development of Mobile WiMAX devices is still an ongoing process, complete and accurate simulations become more important in order to study the performance of Mobile WiMAX based broadband wireless access networks. To further improve network simulation models for Mobile WiMAX, we have theoretically modeled the Hybrid Automatic Retransmission reQuest (HARQ) mechanism and evaluated its performance and accuracy. In this paper, we present the design and implementation methodology of the Mobile WiMAX HARQ simulation model in system-level network simulators in order to gain the benefit of link quality improved by enabling HARQ. Our results show that HARQ achieves higher throughput even at low signal strength which can be considered as non-line-of-sight (NLOS) environments. We believe the implementation of HARQ in the network simulation model and its evaluation studies will provide profound understanding to Mobile WiMAX field test studies.
26957943
Matching Stream Authentication and Resource Allocation to Multimedia Codec Dependency with Position-Value Partitioning in Wireless Multimedia Sensor Networks
A cross layer Unequal Error Protection (UEP) scheme based upon the multimedia position-value (P-V) partitioning has been recently proposed to only improve energy-distortion performance in Wireless Multimedia Sensor Networks (WMSN). There is also a great potential to adapt this UEP scheme into multimedia stream integrity protection. However, performance gains in multimedia transmissions with considerations of energy, distortion, and authentication in WMSN is a challenge. This difficulty results from the media codec dependency on both the content of multimedia stream authentication and protection on the integrity process itself. In this article, we propose a novel scheme which optimally matches the application layer multimedia codec dependency to both lower layer resource allocation requirements and the upper layer stream authentication. The goal of this scheme is to optimize the integrity and quality performance gain within energy constraint. The contribution of the proposed approach is two folds. Firstly, a stream authentication scheme matched with P-V codec dependency is proposed which significantly reduces additional authentication dependency overhead. Secondly, a new resource allocation scheme is proposed to improve energy-distortion-authentication performance with regard to codec dependency. Simulation studies demonstrate that the proposed scheme significantly impacts achieving multimedia transmission quality with energy efficiency and authentication assurance.
3288707
Performance Study of a Mobile Multi-hop 802.11a/b Railway Network Using Passive Measurement
In this paper, we study the performance of IEEE 802.11a/b in a large-scale mobile railway networks and introduce our developed passive measurement approach. To provide a comprehensive evaluation, we built an outdoor multi-hop multi-interface railroad testbed (UNL-FRA Testbed), which consists of eight access points deployed along 3.5 mile of railroad track. We propose a novel large-scale passive measurement approach that synchronizes the system clocks of our monitoring systems, merges packet traces collected from multiple wireless channels across a multi-hop network, and enables a global performance view for the entire monitored network and across multiple layers. Based on the testing data collected from 15 field experiments carried out using BNSF locomotives and HyRail vehicles over a period of 18 months we conclude that in typical outdoor 802.11 railway environments the wireless link quality, the channel assignment scheme, and the handoff latency have much more significant impacts on the performance than the velocity. Furthermore, we discuss the implications of our conclusions on guaranteeing the quality of mobile services. We believe this is the first analysis on such a scale for 802.11-family railway networks.
518796
Performance Analysis of Multi-hop IEEE 802.11 DCF Backhaul Networks
Because of the wide deployment of 802.11 equipments in the past decade, current applications are not limited anymore to only single access points (AP) deployments for indoor usage, but have been extended to multi-hop networks to fulfill the need of high speed connectivity in mobile environments, where the analysis of multi-hop networks is extremely complicated. The behavior of an AP is dependent not only on its neighborspsila behavior, but also on the behavior of other hidden nodes. In this paper, we provide an accurate and verified multi-hop wireless backhaul analysis for performance of IEEE 802.11 DCF in terms of the channel throughput using a static channel error rate. The model is based on analysis of a single hop communications for evaluating the multi-hop wireless backhaul networks. We utilized our existing 3.5-mile Federal Railroad Administration (FRA) test bed on the BNSF railroad track in Nebraska to validate the model. Our field measurements and simulation results show that our proposed model is accurate.
9097817
Reasoning and Merging in XML Data Integration
In this paper, we study the problem of making use of target constraints to integrate XML data from different sources under a target schema. We recognize that target constraints are necessary in data integration, as the constraints are essential part of data semantics, and should be satisfied by integrated data. When integrating data from multiple data sources with overlapping data, constraints can express data merging rules at the target as well. We give a general constraint model for XML to express target constraints, which extends the relational equality-generating and tuple- generating dependencies. We provide a chase method to reason about data in the integrated XML document based on target constraints, by inferring data values not given explicitly, and inserting new subtrees as necessary. Singleton and key constraints are used to uniquely specify a certain entity, as a rule for data merging in the integration.
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%.
34121335
Data-Aware Clustering Hierarchy for Wireless Sensor Networks
In recent years, the wireless sensor network (WSN) is employed a wide range of applications. But existing communication protocols for WSN ignore the characteristics of collected data and set routes only according to the mutual distance and residual energy of sensors. In this paper we propose a Data-Aware Clustering Hierarchy (DACH), which organizes the sensors based on both distance information and data distribution in the network Furthermore, we also present a multi-granularity query processing method based on DACH, which can estimate the query result more efficiently. Our empirical study shows that DACH has higher energy efficiency than Low-Energy Adaptive Clustering Hierarchy (LEACH), and the multi-granularity query processing method based on DACH brings more accurate results than a random access system using same cost of energy.
3069611
A General Framework for Fast Co-clustering on Large Datasets Using Matrix Decomposition
Simultaneously clustering columns and rows (co- clustering) of large data matrix is an important problem with wide applications, such as document mining, microarray analysis, and recommendation systems. Several co-clustering algorithms have been shown effective in discovering hidden clustering structures in the data matrix. For a data matrix of m rows and n columns, the time complexity of these methods is usually in the order of mtimesn (if not higher). This limits their applicability to data matrices involving a large number of columns and rows. Moreover, an implicit assumption made by existing co-clustering methods is that the whole data matrix needs to be held in the main memory. In this paper, we propose a general framework, CRD, for co-clustering large datasets utilizing recently developed sampling- based matrix decomposition methods. The time complexity of our approach is linear in m and n. And it does not require the whole data matrix be in the main memory. Experimental results show that CRD achieves competitive accuracy to existing co-clustering methods but with much less computational cost.
28126425
Privacy-Preserving Frequent Pattern Sharing
Some of the knowledge discovered by data mining may contain sensitive information, which should be hidden before sharing the result of data mining. In this paper, we consider that the knowledge for sharing is discovered by frequent pattern mining, and some of the frequent patterns are private, which cannot be shared. Our problem of privacy-preserving frequent pattern sharing is to hide these private patterns before sharing the result of frequent pattern mining, and at the same time maximize the number of non-private frequent patterns to be shared. We show that this problem is NP-hard, and present three item-based pattern sanitization algorithms for transforming the result of frequent pattern mining into a privacy-free frequent pattern set.