Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Discipline
- Keyword
-
- Security (13)
- Privacy (9)
- Sensor networks (8)
- XGSP (7)
- NaradaBrokering (6)
-
- Wireless sensor networks (6)
- HPF (5)
- Collaboration (4)
- Global-MMCS (4)
- Image fusion (4)
- Publish/subscribe (4)
- Algorithms (3)
- Broadcast authentication (3)
- C++ (3)
- Cheating (3)
- Concurrent computing (3)
- Genetic algorithms (3)
- Grid computing (3)
- Network computing (3)
- PASSION (3)
- Parallel And Scalable Software for Input-Output (3)
- Runtime support (3)
- Secure multi-party computation (3)
- Software support (3)
- VDCE (3)
- Android (2)
- Ant system (2)
- Application independent library technology (2)
- Artificial Intelligence (2)
- Attributed strings (2)
Articles 1 - 30 of 139
Full-Text Articles in Physical Sciences and Mathematics
Pinpoint: Efficient And Effective Resource Isolation For Mobile Security And Privacy, Paul Ratazzi, Ashok Bommisetti, Nian Ji, Wenliang Du
Pinpoint: Efficient And Effective Resource Isolation For Mobile Security And Privacy, Paul Ratazzi, Ashok Bommisetti, Nian Ji, Wenliang Du
Electrical Engineering and Computer Science - All Scholarship
Virtualization is frequently used to isolate untrusted processes and control their access to sensitive resources. However, isolation usually carries a price in terms of less resource sharing and reduced inter-process communication. In an open architecture such as Android, this price and its impact on performance, usability, and transparency must be carefully considered. Although previous efforts in developing general-purpose isolation solutions have shown that some of these negative sideeffects can be mitigated, doing so involves overcoming significant design challenges by incorporating numerous additional platform complexities not directly related to improved security. Thus, the general purpose solutions become inefficient and burdensome if …
A Systematic Security Evaluation Of Android’S Multi-User Framework, Edward Paul Ratazzi, Yousra Aafer, Amit Ahlawat, Hao Hao, Yifei Wang, Wenliang Du
A Systematic Security Evaluation Of Android’S Multi-User Framework, Edward Paul Ratazzi, Yousra Aafer, Amit Ahlawat, Hao Hao, Yifei Wang, Wenliang Du
Electrical Engineering and Computer Science - All Scholarship
Like many desktop operating systems in the 1990s, Android is now in the process of including support for multiuser scenarios. Because these scenarios introduce new threats to the system, we should have an understanding of how well the system design addresses them. Since the security implications of multi-user support are truly pervasive, we developed a systematic approach to studying the system and identifying problems. Unlike other approaches that focus on specific attacks or threat models, ours systematically identifies critical places where access controls are not present or do not properly identify the subject and object of a decision. Finding these …
Resilient Image Fusion, Tiranee Achalakul, Joohan Lee, Stephen Taylor
Resilient Image Fusion, Tiranee Achalakul, Joohan Lee, Stephen Taylor
Electrical Engineering and Computer Science - All Scholarship
The paper describes a distributed spectral-screening PCT algorithm for fusing hyper-spectral images in remote sensing applications. The algorithm provides intrusion tolerance from information warfare attacks using the notion of computational resiliency. This concept uses replication to achieve fault tolerance, but goes further to dynamically regenerate replication in response to an attack or failure. The concepts of resiliency are incorporated through library technology that is application independent. This library hides the details of communication protocols required to achieve dynamic replication and reconfiguration in distributed applications. The paper provides a status report on our progress in developing the concept and applying it …
A Concurrent Spectral-Screening Pct Algorithm For Remote Sensing Applications, Tiranee Achalakul, Stephen Taylor
A Concurrent Spectral-Screening Pct Algorithm For Remote Sensing Applications, Tiranee Achalakul, Stephen Taylor
Electrical Engineering and Computer Science - All Scholarship
The paper presents a concurrent algorithm for remote sensing applications that provides significant performance and image quality enhancements over conventional uniprocessor PCT techniques. The algorithm combines spectral angle classification, principal component transform, and human centered color mapping. It is evaluated from an image quality perspective using images collected with the Hyper-spectral Digital Imagery Collection Experiment (HYDICE) sensor, an airborne imaging spectrometer. These images correspond to foliated scenes taken from an altitude of 2000 to 7500 meters at wavelengths between 400nm and 2.5 micron. The scenes contain mechanized vehicles sitting in open fields as well as under camouflage. The algorithm operates …
Mathweb: A Concurrent Image Analysis Tool Suite For Multi-Spectral Data Fusion, Tiranee Achalakul, Peter D. Haaland, Stephen Taylor
Mathweb: A Concurrent Image Analysis Tool Suite For Multi-Spectral Data Fusion, Tiranee Achalakul, Peter D. Haaland, Stephen Taylor
Electrical Engineering and Computer Science - All Scholarship
This paper describes a preliminary approach to the fusion of multi-spectral image data for the analysis of cervical cancer. The long-term goal of this research is to define spectral signatures and automatically detect cancer cell structures. The approach combines a multi-spectral microscope with an image analysis tool suite, MathWeb. The tool suite incorporates a concurrent Principal Component Transform (PCT) that is used to fuse the multi-spectral data. This paper describes the general approach and the concurrent PCT algorithm. The algorithm is evaluated from both the perspective of image quality and performance scalability.
Resilient Image Fusion, Tiranee Achalakul, Joohan Lee, Stephen Taylor
Resilient Image Fusion, Tiranee Achalakul, Joohan Lee, Stephen Taylor
Electrical Engineering and Computer Science - All Scholarship
The paper describes a distributed spectral-screening PCT algorithm for fusing hyper-spectral images in remote sensing applications. The algorithm provides intrusion tolerance from information warfare attacks using the notion of computational resiliency. This concept uses replication to achieve fault tolerance, but goes further to dynamically regenerate replication in response to an attack or failure. The concepts of resiliency are incorporated through library technology that is application independent. This library hides the details of communication protocols required to achieve dynamic replication and reconfiguration in distributed applications. The paper provides a status report on our progress in developing the concept and applying it …
Reference Set Metrics For Multi-Objective Algorithms, Chilukuri K. Mohan, Kishan Mehrotra
Reference Set Metrics For Multi-Objective Algorithms, Chilukuri K. Mohan, Kishan Mehrotra
Electrical Engineering and Computer Science - All Scholarship
Several metrics and indicators have been suggested in the past to evaluate multi-objective evolutionary and non-evolutionary algo- rithms. However, these metrics are known to have many problems that make their application sometimes unsound, and sometimes infeasible. This paper proposes a new approach, in which metrics are parameter- ized with respect to a reference set, on which depend the properties of any metric.
Mitigating Dos Attacks Against Broadcast Authentication In Wireless Sensor Networks, Peng Ning, An Liu, Wenliang Du
Mitigating Dos Attacks Against Broadcast Authentication In Wireless Sensor Networks, Peng Ning, An Liu, Wenliang Du
Electrical Engineering and Computer Science - All Scholarship
Broadcast authentication is a critical security service in wireless sensor networks. There are two general approaches for broadcast authentication in wireless sensor networks: digital signatures and µTESLA-based techniques. However, both signature-based and µTESLA-based broadcast authentication are vulnerable to Denial of Services (DoS) attacks: An attacker can inject bogus broadcast packets to force sensor nodes to perform expensive signature verifications (in case of signature-based broadcast authentication) or packet forwarding (in case of µTESLA-based broadcast authentication), thus exhausting their limited battery power. This paper presents an efficient mechanism called message specific puzzle to mitigate such DoS attacks. In addition to signature-based or …
Optrr: Optimizing Randomized Response Schemes For Privacy-Preserving Data Mining, Zhengli Huang, Wenliang Du
Optrr: Optimizing Randomized Response Schemes For Privacy-Preserving Data Mining, Zhengli Huang, Wenliang Du
Electrical Engineering and Computer Science - All Scholarship
The randomized response (RR) technique is a promising technique to disguise private categorical data in Privacy-Preserving Data Mining (PPDM). Although a number of RR-based methods have been proposed for various data mining computations, no study has systematically compared them to find optimal RR schemes. The difficulty of comparison lies in the fact that to compare two PPDM schemes, one needs to consider two conflicting metrics: privacy and utility. An optimal scheme based on one metric is usually the worst based on the other metric. In this paper, we first describe a method to quantify privacy and utility. We formulate the …
Privacy-Maxent: Integrating Background Knowledge In Privacy Quantification, Wenliang Du, Zhouxuan Teng, Zutao Zhu
Privacy-Maxent: Integrating Background Knowledge In Privacy Quantification, Wenliang Du, Zhouxuan Teng, Zutao Zhu
Electrical Engineering and Computer Science - All Scholarship
Privacy-Preserving Data Publishing (PPDP) deals with the publication of microdata while preserving people’s private information in the data. To measure how much private information can be preserved, privacy metrics is needed. An essential element for privacy metrics is the measure of how much adversaries can know about an individual’s sensitive attributes (SA) if they know the individual’s quasi-identifiers (QI), i.e., we need to measure P(SA | QI). Such a measure is hard to derive when adversaries’ background knowledge has to be considered. We propose a systematic approach, Privacy-MaxEnt, to integrate background knowledge in privacy quantification. Our approach is based on …
Fusion For Component Based Face Recognition, Yanjun Yan, Lisa Ann Osadciw
Fusion For Component Based Face Recognition, Yanjun Yan, Lisa Ann Osadciw
Electrical Engineering and Computer Science - All Scholarship
This paper proposes a practical way to realize the diversity in face recognition system for performance improvement by fusing the classification results from the components (characteristic regions such as eyes, nose and mouth) and from the whole face image, instead of concatenating the face feature and the modular features for a single classifier. The extracted sub-images are not totally independent from the face image, but the experiments show that the fused result is improved from the recognition result based on the face or components alone. The fusion is implemented and compared at both score level and decision level. Communication resources …
A New Achievable Rate Region For Interference Channels With Common Information, Yi Cao, Biao Chen, Junshan Zhang
A New Achievable Rate Region For Interference Channels With Common Information, Yi Cao, Biao Chen, Junshan Zhang
Electrical Engineering and Computer Science - All Scholarship
In this paper, a new achievable rate region for general interference channels with common information is presented. Our result improves upon [1] by applying simultaneous superposition coding over sequential superposition coding. A detailed computation and comparison of the achievable rate region for the Gaussian case is conducted. The proposed achievable rate region is shown to coincide with the capacity region of the strong interference case [2].
Borg: Block-Reorganization And Self-Optimization In Storage Systems, Medha Bhadkamkar, Jorge Guerra, Luis Useche, Sam Burnett, Jason Liptak, Raju Rangaswami, Vagelis Hristidis
Borg: Block-Reorganization And Self-Optimization In Storage Systems, Medha Bhadkamkar, Jorge Guerra, Luis Useche, Sam Burnett, Jason Liptak, Raju Rangaswami, Vagelis Hristidis
Electrical Engineering and Computer Science - All Scholarship
This paper presents the design, implementation, and evaluation of BORG, a self-optimizing storage system that performs automatic block reorganization based on the observed I/O workload. BORG is motivated by three characteristics of I/O workloads: non-uniform access frequency distribution, temporal locality, and partial determinism in non-sequential accesses. To achieve its objective, BORG manages a small, dedicated partition on the disk drive, with the goal of servicing a majority of the I/O requests from within this partition with significantly reduced seek and rotational delays. BORG is transparent to the rest of the storage stack, including applications, file system(s), and I/O schedulers, thereby …
Stateful Ddos Attacks And Targeted Filtering, Shigang Chen, Yong Tang, Wenliang Du
Stateful Ddos Attacks And Targeted Filtering, Shigang Chen, Yong Tang, Wenliang Du
Electrical Engineering and Computer Science - All Scholarship
The goal of a DDoS (distributed denial of service) attack is to completely tie up certain resources so that legitimate users are not able to access a service. It has long been an open security problem of the Internet. In this paper, we identify a class of stateful DDoS attacks that defeat the existing cookie-based solutions. To counter these attacks, we propose a new defense mechanism, called targeted filtering, which establishes filters at a firewall and automatically converges the filters to the flooding sources while leaving the rest of the Internet unblocked. We prove the correctness of the proposed defense …
Containing Denial-Of-Service Attacks In Broadcast Authentication In Sensor Networks, Ronghua Wang, Wenliang Du, Peng Ning
Containing Denial-Of-Service Attacks In Broadcast Authentication In Sensor Networks, Ronghua Wang, Wenliang Du, Peng Ning
Electrical Engineering and Computer Science - All Scholarship
Broadcast authentication is an important application in sensor networks. Public Key Cryptography (PKC) is desirable for this application, but due to the resource constraints on sensor nodes, these operations are expensive, which means sensor networks using PKC are susceptible to Denial of Service (DoS) attacks: attackers keep broadcasting bogus messages, which will incur extra costs, thus exhaust the energy of the honest nodes. In addition, the long time to verify each message using PKC increases the response time of the nodes; it is impractical for the nodes to validate each incoming message before forwarding it. In this paper we discuss …
Containing Denial-Of-Service Attacks In Broadcast Authentication In Sensor Networks, Ronghua Wang, Wenliang Du, Peng Ning
Containing Denial-Of-Service Attacks In Broadcast Authentication In Sensor Networks, Ronghua Wang, Wenliang Du, Peng Ning
Electrical Engineering and Computer Science - All Scholarship
Broadcast authentication is an important application in sensor networks. Public Key Cryptography (PKC) is desirable for this application, but due to the resource constraints on sensor nodes, these operations are expensive, which means sensor networks using PKC are susceptible to Denial of Service (DoS) attacks: attackers keep broadcasting bogus messages, which will incur extra costs, thus exhaust the energy of the honest nodes. In addition, the long time to verify each message using PKC increases the response time of the nodes; it is impractical for the nodes to validate each incoming message before forwarding it. In this paper we discuss …
Data Aggregation Techniques In Sensor Networks: A Survey, Ramesh Rajagopalan, Pramod K. Varshney
Data Aggregation Techniques In Sensor Networks: A Survey, Ramesh Rajagopalan, Pramod K. Varshney
Electrical Engineering and Computer Science - All Scholarship
Wireless sensor networks consist of sensor nodes with sensing and communication capabilities. We focus on data aggregation problems in energy constrained sensor networks. The main goal of data aggregation algorithms is to gather and aggregate data in an energy efficient manner so that network lifetime is enhanced. In this paper, we present a survey of data aggregation algorithms in wireless sensor networks. We compare and contrast different algorithms on the basis of performance measures such as lifetime, latency and data accuracy. We conclude with possible future research directions.
A Key Predistribution Scheme For Sensor Networks Using Deployment Knowledge, Wenliang Du, Jing Deng, Yunghsiang S. Han, Pramod K. Varshney
A Key Predistribution Scheme For Sensor Networks Using Deployment Knowledge, Wenliang Du, Jing Deng, Yunghsiang S. Han, Pramod K. Varshney
Electrical Engineering and Computer Science - All Scholarship
To achieve security in wireless sensor networks, it is important to be able to encrypt messages sent among sensor nodes. Keys for encryption purposes must be agreed upon by communicating nodes. Due to resource constraints, achieving such key agreement in wireless sensor networks is non-trivial. Many key agreement schemes used in general networks, such as Diffie-Hellman and public-key based schemes, are not suitable for wireless sensor networks. Pre-distribution of secret keys for all pairs of nodes is not viable due to the large amount of memory used when the network size is large. Recently, a random key pre-distribution scheme and …
Comparisons Of K-Anonymization And Randomization Schemes Under Linking Attacks, Zhouxuan Teng, Wenliang Du
Comparisons Of K-Anonymization And Randomization Schemes Under Linking Attacks, Zhouxuan Teng, Wenliang Du
Electrical Engineering and Computer Science - All Scholarship
Recently K-anonymity has gained popularity as a privacy quantification against linking attacks, in which attackers try to identify a record with values of some identifying attributes. If attacks succeed, the identity of the record will be revealed and potential confidential information contained in other attributes of the record will be disclosed. Kanonymity counters this attack by requiring that each record must be indistinguishable from at least K − 1 other records with respect to the identifying attributes. Randomization can also be used for protection against linking attacks. In this paper, we compare the performance of K-anonymization and randomization schemes under …
Service Oriented Architecture For Voip Conferencing, Wenjun Wu, Geoffrey C. Fox, Hasan Bulut, Ahmet Uyar, Tao Huang
Service Oriented Architecture For Voip Conferencing, Wenjun Wu, Geoffrey C. Fox, Hasan Bulut, Ahmet Uyar, Tao Huang
Electrical Engineering and Computer Science - All Scholarship
Voice/Video over IP (VoIP) systems to date have been either highly centralized or dependent on the IP multicast in nature. Global Multimedia Collaboration System is a scalable, integrated and service-oriented VoIP conferencing system, based on the XGSP collaboration framework and NaradaBrokering messaging middleware. This system can provide media and session services to heterogeneous endpoints such as H.323, SIP, Access Grid, RealPlayer as well as cellular phone. In this paper, we address the challenges of scalability, interoperablity and heterogeneity in massive VoIP conferencing system. We believe that our approach opens up new opportunities for leveraging classic VoIP systems by using new …
Deriving Private Information From Randomized Data, Zhengli Huang, Wenliang Du, Biao Chen
Deriving Private Information From Randomized Data, Zhengli Huang, Wenliang Du, Biao Chen
Electrical Engineering and Computer Science - All Scholarship
Randomization has emerged as a useful technique for data disguising in privacy-preserving data mining. Its privacy properties have been studied in a number of papers. Kargupta et al. challenged the randomization schemes, and they pointed out that randomization might not be able to preserve privacy. However, it is still unclear what factors cause such a security breach, how they affect the privacy preserving property of the randomization, and what kinds of data have higher risk of disclosing their private contents even though they are randomized. We believe that the key factor is the correlations among attributes. We propose two data …
An Efficient Scheme For Authenticating Public Keys In Sensor Networks, Wenliang Du, Ronghua Wang, Peng Ning
An Efficient Scheme For Authenticating Public Keys In Sensor Networks, Wenliang Du, Ronghua Wang, Peng Ning
Electrical Engineering and Computer Science - All Scholarship
With the advance of technology, Public Key Cryptography (PKC) will sooner or later be widely used in wireless sensor networks. Recently, it has been shown that the performance of some public key algorithms, such as Elliptic Curve Cryptography (ECC), is already close to being practical on sensor nodes. However, the energy consumption of PKC is still expensive, especially compared to symmetric-key algorithms. To maximize the lifetime of batteries, we should minimize the use of PKC whenever possible in sensor networks. This paper investigates how to replace one of the important PKC operations–the public key authentication–with symmetric key operations that are …
Lad: Localization Anomaly Detection For Wireless Sensor Networks, Wenliang Du, Lei Fang, Peng Ning
Lad: Localization Anomaly Detection For Wireless Sensor Networks, Wenliang Du, Lei Fang, Peng Ning
Electrical Engineering and Computer Science - All Scholarship
In wireless sensor networks (WSNs), sensors ’ locations play a critical role in many applications. Having a GPS receiver on every sensor node is costly. In the past, a number of location discovery (localization) schemes have been proposed. Most of these schemes share a common feature: they use some special nodes, called beacon nodes, which are assumed to know their own locations (e.g., through GPS receivers or manual configuration). Other sensors discover their locations based on the reference information provided by these beacon nodes. Most of the beacon-based localization schemes assume a benign environment, where all beacon nodes are supposed …
Polymorphic Self-* Agents For Stigmergic Fault Mitigation In Large-Scale Real-Time Embedded Systems, Derek Messie, Jae C. Oh
Polymorphic Self-* Agents For Stigmergic Fault Mitigation In Large-Scale Real-Time Embedded Systems, Derek Messie, Jae C. Oh
Electrical Engineering and Computer Science - All Scholarship
Organization and coordination of agents within large-scale, complex, distributed environments is one of the primary challenges in the field of multi-agent systems. A lot of interest has surfaced recently around self-* (self-organizing, self-managing, self-optimizing, self-protecting) agents. This paper presents polymorphic self-* agents that evolve a core set of roles and behavior based on environmental cues. The agents adapt these roles based on the changing demands of the environment, and are directly implementable in computer systems applications. The design combines strategies from game theory, stigmergy, and other biologically inspired models to address fault mitigation in large-scale, real-time, distributed systems. The agents …
Global Multimedia Collaboration System, Geoffrey C. Fox, Wenjun Wu, Ahmet Uyar, Hasan Bulut, Shrideep Pallickard
Global Multimedia Collaboration System, Geoffrey C. Fox, Wenjun Wu, Ahmet Uyar, Hasan Bulut, Shrideep Pallickard
Electrical Engineering and Computer Science - All Scholarship
In order to build an integrated collaboration system over heterogeneous collaboration technologies, we propose a Global Multimedia Collaboration System (Global-MMCS) based on XGSP A/V Web-Services framework. This system can integrate multiple A/V services, and support various collaboration clients and communities. Now the prototype is being developed and deployed across many universities in USA and China.
Support For High Performance Real-Time Collaboration Within The Naradabrokering Substrate, Shrideep Pallickara, Hasan Bulut, Pete Burnap, Geoffrey C. Fox, Ahmet Uyar, David Walker
Support For High Performance Real-Time Collaboration Within The Naradabrokering Substrate, Shrideep Pallickara, Hasan Bulut, Pete Burnap, Geoffrey C. Fox, Ahmet Uyar, David Walker
Electrical Engineering and Computer Science - All Scholarship
The requirements for collaborative services, especially pertaining to order and delivery, are quite different compared to traditional distributed applications. The NaradaBrokering messaging substrate enables scalable, fault-tolerant, distributed interactions between entities, and is based on the publish/subscribe paradigm. The substrate also incorporates support for Grid and Web Service. More recently, we have incorporated services within the substrate which enable us to facilitate richer collaborative interactions. In this paper, we outline our rationale for incorporating these services and how these services interact with each other. We have conducted experiments related to profiling these services, and also on the performance and scaling of …
Grid Service Architecture For Videoconferencing, Wenjun Wu, Ahmet Uyar, Hasan Bulut, Sangyoon Oh, Geoffrey C. Fox
Grid Service Architecture For Videoconferencing, Wenjun Wu, Ahmet Uyar, Hasan Bulut, Sangyoon Oh, Geoffrey C. Fox
Electrical Engineering and Computer Science - All Scholarship
In this paper we present a scalable, integrated and service-oriented collaboration system, namely Global Multimedia Collaboration System, based on the XGSP collaboration framework and NaradaBrokering messaging middleware. This system can provide videoconferencing services to heterogeneous endpoints such as H.323, SIP, Access Grid, RealPlayer as well as cellular phone. This paper discusses the design principle, system architecture and implementation in detail. The extensive performance measurement has been made to evaluate the scalability of the system.
Privacy-Preserving Top-N Recommendation On Horizontally Partitioned Data, Huseyin Polat, Wenliang Du
Privacy-Preserving Top-N Recommendation On Horizontally Partitioned Data, Huseyin Polat, Wenliang Du
Electrical Engineering and Computer Science - All Scholarship
Collaborative filtering techniques are widely used by many E-commerce sites for recommendation purposes. Such techniques help customers by suggesting products to purchase using other users’ preferences. Today’s top-recommendation schemes are based on market basket data, which shows whether a customer bought an item or not. Data collected for recommendation purposes might be split between different parties. To provide better referrals and increase mutual advantages, such parties might want to share data. Due to privacy concerns, however, they do not want to disclose data. This paper presents a scheme for binary ratings-based top-N recommendation on horizontally partitioned data, in which two …
A State-Free Data Delivery Protocol For Multihop Wireless Sensor Networks, Dazhi Chen, Jing Deng, Pramod K. Varshney
A State-Free Data Delivery Protocol For Multihop Wireless Sensor Networks, Dazhi Chen, Jing Deng, Pramod K. Varshney
Electrical Engineering and Computer Science - All Scholarship
A novel, state-free, and competition-based data delivery protocol, called State-free Implicit Forwarding (SIF), is proposed for multihop wireless sensor networks. The SIF protocol assumes moderate node density and distance-to-sink awareness. The state-free feature of SIF makes it robust to high network dynamics. SIF also combines the tasks of routing and MAC, via cross-layer design, to simplify the complexity of the protocol stack in sensors and to save precious network resources. Simulation results are presented to show that SIF performs better than some previously proposed protocols for data delivery in terms of communication overhead, packet delivery ratio, and average packet delay.
Decision Fusion Rules In Multi-Hop Wireless Sensor Networks, Ying Lin, Biao Chen, Pramod K. Varshney
Decision Fusion Rules In Multi-Hop Wireless Sensor Networks, Ying Lin, Biao Chen, Pramod K. Varshney
Electrical Engineering and Computer Science - All Scholarship
We consider in this paper the decision fusion problem for a wireless sensor network (WSN) operating in a fading environment. In particular, we develop channel-aware decision fusion rules for a resource constrained WSN where decisions from local sensors may go through multi-hop transmission to reach a fusion center. Each relay node employs a binary relay scheme whereby the relay output is inferred from the channel impaired observation received from its source node. This estimated binary decision is subsequently transmitted to the next node until it reaches the fusion center. Under a flat fading channel model, we derive the optimum fusion …