Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Engineering (440)
- Electrical and Computer Engineering (335)
- Numerical Analysis and Scientific Computing (104)
- Operations Research, Systems Engineering and Industrial Engineering (87)
- Physics (50)
-
- Artificial Intelligence and Robotics (47)
- Mechanical Engineering (45)
- Business (40)
- Statistics and Probability (36)
- Mathematics (34)
- Aerospace Engineering (33)
- Medicine and Health Sciences (28)
- Earth Sciences (22)
- Geology (20)
- Chemistry (18)
- Databases and Information Systems (17)
- Life Sciences (17)
- Systems Architecture (17)
- Other Computer Sciences (16)
- Power and Energy (16)
- Mining Engineering (15)
- Computer Engineering (14)
- Civil and Environmental Engineering (12)
- Social and Behavioral Sciences (12)
- Biology (11)
- Systems Engineering (11)
- Materials Science and Engineering (10)
- Psychology (8)
- Keyword
-
- Security (30)
- Clustering (19)
- Deep learning (19)
- Deep Learning (16)
- Machine Learning (16)
-
- Neural networks (16)
- Optimal control (16)
- Reinforcement learning (16)
- Federated learning (15)
- IoT (15)
- Neurocontrollers (15)
- Impact Ionization (14)
- Neural Networks (14)
- Optimization (13)
- Adaptive Control (12)
- Algorithms (12)
- Artificial Intelligence (11)
- Cloud computing (11)
- Edge computing (11)
- Internet (11)
- Wireless sensor networks (11)
- Closed Loop Systems (10)
- Lyapunov Methods (10)
- Optimal Control (10)
- Routing (10)
- Sensor networks (10)
- Anomaly detection (9)
- Ionization (9)
- Neural Network (9)
- Privacy (9)
- Publication Year
- Publication
-
- Computer Science Faculty Research & Creative Works (919)
- Electrical and Computer Engineering Faculty Research & Creative Works (282)
- Masters Theses (220)
- Computer Science Technical Reports (196)
- Doctoral Dissertations (106)
-
- Physics Faculty Research & Creative Works (44)
- Business and Information Technology Faculty Research & Creative Works (24)
- Geosciences and Geological and Petroleum Engineering Faculty Research & Creative Works (20)
- Mechanical and Aerospace Engineering Faculty Research & Creative Works (17)
- Miners Solving for Tomorrow Research Conference (16)
- Chemistry Faculty Research & Creative Works (15)
- Engineering Management and Systems Engineering Faculty Research & Creative Works (12)
- Opportunities for Undergraduate Research Experience Program (OURE) (12)
- Missouri S&T’s Peer to Peer (11)
- Undergraduate Research Conference at Missouri S&T (10)
- Materials Science and Engineering Faculty Research & Creative Works (7)
- Mathematics and Statistics Faculty Research & Creative Works (7)
- Civil, Architectural and Environmental Engineering Faculty Research & Creative Works (4)
- Mining Engineering Faculty Research & Creative Works (4)
- Biological Sciences Faculty Research & Creative Works (3)
- Chemical and Biochemical Engineering Faculty Research & Creative Works (2)
- Economics Faculty Research & Creative Works (2)
- Graduate Student Research & Creative Works (2)
- AOER Course Materials (1)
- Capstone Projects (1)
- Psychological Science Faculty Research & Creative Works (1)
- Publication Type
Articles 1411 - 1440 of 1938
Full-Text Articles in Computer Sciences
Adaptive Neural Network Control And Wireless Sensor Network Based Localization For Uav Formation, H. Wu, Jagannathan Sarangapani
Adaptive Neural Network Control And Wireless Sensor Network Based Localization For Uav Formation, H. Wu, Jagannathan Sarangapani
Electrical and Computer Engineering Faculty Research & Creative Works
We consider a team of unmanned aerial vehicles (UAV's) equipped with sensors and motes for wireless communication for the task of navigating to a desired location in a formation. First a neural network (NN)-based control scheme is presented that allows the UAVs to track a desired position and orientation with reference to the neighboring UAVs or obstacles in the environment. Second, we discuss a graph theory-based scheme for discovery, localization and cooperative control. The purpose of the NN cooperative controller is to achieve and maintain the desired formation shape in the presence of unmodeled dynamics and bounded unknown disturbances. Numerical …
2nd Annual Undergraduate Research Conference Abstract Book, University Of Missouri--Rolla
2nd Annual Undergraduate Research Conference Abstract Book, University Of Missouri--Rolla
Undergraduate Research Conference at Missouri S&T
No abstract provided.
Journal Of Combinatorial Optimization: Editorial, Maggie Xiaoyan Cheng
Journal Of Combinatorial Optimization: Editorial, Maggie Xiaoyan Cheng
Computer Science Faculty Research & Creative Works
No abstract provided.
Energy And Communication Efficient Group Key Management Protocol For Hierarchical Sensor Networks, Biswajit Panja, Sanjay Kumar Madria, Bharat Bhargava
Energy And Communication Efficient Group Key Management Protocol For Hierarchical Sensor Networks, Biswajit Panja, Sanjay Kumar Madria, Bharat Bhargava
Computer Science Faculty Research & Creative Works
In this paper, we describe group key management protocosl for hierarchical sensor networks where instead of using pre-deployed keys, each sensor node generates a partial key dynamically using a function. The function takes partial keys of its children as input. The design of the protocol is motivated by the fact that traditional cryptographic techniques are impractical in sensor networks because of high energy and computational overheads. The group key management protocol supports the establishment of two types of group keys; one for the sensor nodes within a group, and the other in a group of cluster heads. The protocol handles …
Window Query Processing With Proxy Cache, Gao Xing, John Sustersic, A. R. Hurson
Window Query Processing With Proxy Cache, Gao Xing, John Sustersic, A. R. Hurson
Computer Science Faculty Research & Creative Works
A location dependent query (LDQ) result set is valid only in a specific region called the validity region (VR). While limiting the validity of a particular result set to a given area, the VR may also be used in caching implementations to determine if cached results satisfy semantically equivalent queries. Existing LDQ caching schemes rely on the database servers to provide the VR at a cost of high computational overhead. Alternatively, a LDQ proxy cache, which approximates the VR can be employed, freeing the database servers from the high cost of calculating the VR. A LDQ proxy cache architecture is …
A Mathematical Formulation Of Dna Computation, Mingjun Zhang, Maggie Xiaoyan Cheng, Tzyh-Jong Tarn
A Mathematical Formulation Of Dna Computation, Mingjun Zhang, Maggie Xiaoyan Cheng, Tzyh-Jong Tarn
Computer Science Faculty Research & Creative Works
DNA computation is to use DNA molecules for information storing and processing. The task is accomplished by encoding and interpreting DNA molecules in suspended solutions before and after the complementary binding reactions. DNA computation is attractive, due to its fast parallel information processing, remarkable energy efficiency, and high storing capacity. Challenges currently faced by DNA computation are (1) lack of theoretical computational models for applications, and (2) high error rate for implementation. This paper attempts to address these problems from mathematical modeling and genetic coding aspects. The first part of this paper presents a mathematical formulation of DNA computation. The …
Multimedia Correlation Analysis In Unstructured Peer-To-Peer Network, Bo Yang, A. R. Hurson, Yu Jiao, Thomas E. Potok
Multimedia Correlation Analysis In Unstructured Peer-To-Peer Network, Bo Yang, A. R. Hurson, Yu Jiao, Thomas E. Potok
Computer Science Faculty Research & Creative Works
Recent years saw the rapid development of peer-topeer (P2P) networks in a great variety of applications. However, similarity-based k-nearest-neighbor retrieval (k-NN) is still a challenging task in P2P networks due to the multiple constraints such as the dynamic topologies and the unpredictable data updates. Caching is an attractive solution that reduces network traffic and hence could remedy the technological constraints of P2P networks. However, traditional caching techniques have some major shortcomings that make them unsuitable for similarity search, such as the lack of semantic locality representation and the rigidness of exact matching on data objects. To facilitate the efficient similarity …
Data Replication For Improving Data Accessibility In Ad Hoc Networks, Sanjay Kumar Madria, Takahiro Hara
Data Replication For Improving Data Accessibility In Ad Hoc Networks, Sanjay Kumar Madria, Takahiro Hara
Computer Science Faculty Research & Creative Works
In ad hoc networks, due to frequent network partition, data accessibility is lower than that in conventional fixed networks. In this paper, we solve this problem by replicating data items on mobile hosts. First, we propose three replica allocation methods assuming that each data item is not updated. In these three methods, we take into account the access frequency from mobile hosts to each data item and the status of the network connection. Then, we extend the proposed methods by considering aperiodic updates and integrating user profiles consisting of mobile users'' schedules, access behavior, and read/write patterns. We also show …
Generalized Distance Metric As A Robust Similarity Measure For Mobile Object Trajectories, Garima Pathak, Sanjay Kumar Madria, Spandan Tiwari
Generalized Distance Metric As A Robust Similarity Measure For Mobile Object Trajectories, Garima Pathak, Sanjay Kumar Madria, Spandan Tiwari
Computer Science Faculty Research & Creative Works
In this paper, we propose a novel generalized distance metric based on a model that incorporates the time axis explicitly. The proposed metric is based fundamentally on the Mahalanobis distance metric, which eliminates the correlation and scaling errors in similarity searches on trajectory databases. We propose the incorporation of a weight matrix in the proposed distance metric, which allows for easy manipulation of the degree of significance of the different spatial and or temporal dimensions.
Improving Channel Throughput Of Wlans And Ad Hoc Networks Using Explicit Denial Of Requests, Maggie Xiaoyan Cheng, Yadi Ma, Yi Wang
Improving Channel Throughput Of Wlans And Ad Hoc Networks Using Explicit Denial Of Requests, Maggie Xiaoyan Cheng, Yadi Ma, Yi Wang
Computer Science Faculty Research & Creative Works
A new Multiple Access Control scheme for wireless ad hoc networks and WLANs is proposed. This scheme uses explicit denial of channel requests and a busy tone to improve channel throughput. Performance analysis shows significant improvement when the network is under heavy traffic load.
Model Checking Control Communication Of A Facts Device, Bruce M. Mcmillin, J. K. Townsend, David Cape
Model Checking Control Communication Of A Facts Device, Bruce M. Mcmillin, J. K. Townsend, David Cape
Computer Science Faculty Research & Creative Works
This paper concerns the design and verification of a realtime communication protocol for sensor data collection and processing between an embedded computer and a DSP. In such systems, a certain amount of data loss without recovery may be tolerated. The key issue is to define and verify the correctness in the presence of these lost data frames under real-time constraints. This paper describes a temporal verification that if the end processes do not detect that too many frames are lost, defined by comparison of error counters against given threshold values, then there will be a bounded delay between transmission of …
A Hierarchical Secure Routing Protocol Against Black Hole Attacks In Sensor Networks, Jian Yin, Sanjay Kumar Madria
A Hierarchical Secure Routing Protocol Against Black Hole Attacks In Sensor Networks, Jian Yin, Sanjay Kumar Madria
Computer Science Faculty Research & Creative Works
A black hole attack is a severe attack that can be easily employed against routing in sensor networks. In a black hole attack, a malicious node spuriously announces a short route to the sink node (the destination) to attract additional traffic to the malicious node and then drops them. In this paper, we propose a hierarchical secure routing protocol for detecting and defending against black hole attacks. The proposed protocol uses only symmetric key cryptography to discover a safe route against black hole attacks. The comparison of the proposed protocol with two other existing approaches proves that the proposed scheme …
Secrout: A Secure Routing Protocol For Sensor Networks, Jian Yin, Sanjay Kumar Madria
Secrout: A Secure Routing Protocol For Sensor Networks, Jian Yin, Sanjay Kumar Madria
Computer Science Faculty Research & Creative Works
In this paper, we present a secure routing protocol for sensor networks (SecRout) to safeguard sensor networks under different types of attacks. The SecRout protocol uses the symmetric cryptography to secure messages, and uses a small cache in sensor nodes to record the partial routing path (previous and next nodes) to the destination. It guarantees that the destination will be able to identify and discard the tampered messages and ensure that the messages received are not tampered. Comparing the performance with non-secure routing protocol AODV (ad hoc on demand distance vector routing), the SecRout protocol only has a small byte …
Neural Network-Based Output Feedback Controller For Lean Operation Of Spark Ignition Engines, Brian C. Kaul, Jagannathan Sarangapani, J. A. Drallmeier, Jonathan B. Vance, Pingan He
Neural Network-Based Output Feedback Controller For Lean Operation Of Spark Ignition Engines, Brian C. Kaul, Jagannathan Sarangapani, J. A. Drallmeier, Jonathan B. Vance, Pingan He
Electrical and Computer Engineering Faculty Research & Creative Works
Spark ignition (SI) engines running at very lean conditions demonstrate significant nonlinear behavior by exhibiting cycle-to-cycle dispersion of heat release even though such operation can significantly reduce NOx emissions and improve fuel efficiency by as much as 5-10%. A suite of neural network (NN) controller without and with reinforcement learning employing output feedback has shown ability to reduce the nonlinear cyclic dispersion observed under lean operating conditions. The neural network controllers consists of three NN: a) A NN observer to estimate the states of the engine such as total fuel and air; b) a second NN for generating virtual input; …
Practical Experiences In Using Model-Driven Engineering To Develop Trustworthy Computing Systems, Thomas Weigert, Frank Weil
Practical Experiences In Using Model-Driven Engineering To Develop Trustworthy Computing Systems, Thomas Weigert, Frank Weil
Computer Science Faculty Research & Creative Works
In this paper, we describe how Motorola has deployed model-driven engineering in product development, in particular for the development of trustworthy and highly reliable telecommunications systems, and outline the benefits obtained. Model-driven engineering has dramatically increased both the quality and the reliability of software developed in our organization, as well as the productivity of our software engineers. Our experience demonstrates that model-driven engineering significantly improves the development process for trustworthy computing systems.
Cadre: A Collaborative Replica Allocation And Deallocation Approach For Mobile-P2p Networks, Anirban Mondal, Sanjay Kumar Madria, Masaru Kitsuregawa
Cadre: A Collaborative Replica Allocation And Deallocation Approach For Mobile-P2p Networks, Anirban Mondal, Sanjay Kumar Madria, Masaru Kitsuregawa
Computer Science Faculty Research & Creative Works
This paper proposes CADRE (Collaborative Allocation and Deallocation of Replicas with Efficiency), a dynamic replication scheme for improving the typically low data availability in mobile ad-hoc peer-to-peer (M-P2P) networks. The main contributions of CADRE are two-fold. First, it collaboratively performs both replica allocation and deallocation in tandem to facilitate optimal replication and to avoid 'thrashing' conditions. Second, it addresses fair replica allocation across the MHs. CADRE deploys a hybrid super-peer architecture in which some of the MHs act as the 'gateway nodes' (GNs) in a given region. GNs facilitate both search and replication. Our performance study indicates that CADRE indeed …
Decentralized Power Control With Implementation For Rfid Networks, Kainan Cha, Anil Ramachandran, David Pommerenke, Jagannathan Sarangapani
Decentralized Power Control With Implementation For Rfid Networks, Kainan Cha, Anil Ramachandran, David Pommerenke, Jagannathan Sarangapani
Electrical and Computer Engineering Faculty Research & Creative Works
In radio frequency identification (RFID) systems, the detection range and read rates will suffer from interference among high power reading devices. This problem grows severely and degrades system performance in dense RFID networks. In this paper, we investigate a suite of feasible power control schemes to ensure overall coverage area of the system while maintaining a desired read rate. The power control scheme and MAC protocol dynamically adjusts the RFID reader power output in response to the interference level seen locally during tag reading for an acceptable signal-to-noise ratio (SNR). We present novel distributed adaptive power control (DAPC) and probabilistic …
Distributed Power Control For Cellular Networks In The Presence Of Channel Uncertainties, Maciej Jan Zawodniok, Q. Shang, Jagannathan Sarangapani
Distributed Power Control For Cellular Networks In The Presence Of Channel Uncertainties, Maciej Jan Zawodniok, Q. Shang, Jagannathan Sarangapani
Electrical and Computer Engineering Faculty Research & Creative Works
In this paper, a novel distributed power control (DPC) scheme for cellular network in the presence of radio channel uncertainties such as path loss, shadowing, and Rayleigh fading is presented. Since these uncertainties can attenuate the received signal strength and can cause variations in the received Signal-to-Interference ratio (SIR), a new DPC scheme, which can estimate the slowly varying channel uncertainty, is proposed so that a target SIR at the receiver can be maintained. Further, the standard assumption of a constant interference during a link's power update used in other works in the literature is relaxed. A CDMA-based cellular network …
An Internet Based Intelligent Argumentation System For Collaborative Engineering Design, Xiaoqing Frank Liu, Samir Raorane, Man Zheng, Ming-Chuan Leu
An Internet Based Intelligent Argumentation System For Collaborative Engineering Design, Xiaoqing Frank Liu, Samir Raorane, Man Zheng, Ming-Chuan Leu
Computer Science Faculty Research & Creative Works
Modern product design is a very complicated process which involves groups of designers, manufacturers, suppliers, and customer representatives. Conflicts are unavoidable in collaboration among multiple stakeholders, who have different objectives, requirements, and priorities. Unfortunately, current web-based collaborative engineering design systems do not support collaborative conflict resolution. In this paper, we will develop an intelligent computational argumentation model to enable management of a large scale argumentation network, and resolution of conflicts based on argumentation from many participants. A web-based intelligent argumentation tool is developed as a part of a web-based collaborative engineering design system based on the above model to resolve …
The Antecedents Of M-Commerce Adoption, Morris Kalliny, Michael S. Minor
The Antecedents Of M-Commerce Adoption, Morris Kalliny, Michael S. Minor
Business and Information Technology Faculty Research & Creative Works
The growth of Internet shopping has been attributed to rapid advances in technology and other influences such as convenience. We empirically investigate the relationship between demographics, ease of use, convenience, usefulness and enjoyment and intention to use m-commerce and attitude toward m-commerce. Two studies were conducted where a student and a non student sample was used. Data analysis revealed age, gender and educational level of customers do not play a role in influencing intention to use m-commerce. However, convenience, ease of use, usefulness and enjoyment all play a role in the customer's intention to use m-commerce.
Adaptive And Probabilistic Power Control Algorithms For Dense Rfid Reader Network, Kainan Cha, Anil Ramachandran, Jagannathan Sarangapani
Adaptive And Probabilistic Power Control Algorithms For Dense Rfid Reader Network, Kainan Cha, Anil Ramachandran, Jagannathan Sarangapani
Electrical and Computer Engineering Faculty Research & Creative Works
In radio frequency identification (RFID) systems, the detection range and read rates may suffer from interferences between high power devices such as readers. In dense networks, this problem grows severely and degrades system performance. In this paper, we investigate feasible power control schemes to ensure overall coverage area of the system while maintaining a desired data rate. The power control should dynamically adjust the output power of a RFID reader by adapting to the noise level seen during tag reading and acceptable signal-to-noise ratio (SNR). We present a novel distributed adaptive power control (DAPC) and probabilistic power control (PPC) as …
Neuro Control Of Nonlinear Discrete Time Systems With Deadzone And Input Constraints, Pingan He, Wenzhi Gao, Jagannathan Sarangapani
Neuro Control Of Nonlinear Discrete Time Systems With Deadzone And Input Constraints, Pingan He, Wenzhi Gao, Jagannathan Sarangapani
Electrical and Computer Engineering Faculty Research & Creative Works
A neural network (NN) controller in discrete time is designed to deliver a desired tracking performance for a class of uncertain nonlinear systems with unknown deadzones and magnitude constraints on the input. The NN controller consists of two NNs: the first NN for compensating the unknown deadzones; and the second NN for compensating the uncertain nonlinear system dynamics. The magnitude constraints on the input are modeled as saturation nonlinearities and they are dealt with in the Lyapunov-based controller design. The uniformly ultimate boundedness (UUB) of the closed-loop tracking errors and the neural network weights estimation errors is demonstrated via Lyapunov …
Development And Implementation Of Optimized Energy-Delay Sub-Network Routing Protocol For Wireless Sensor Networks, Maciej Jan Zawodniok, Jagannathan Sarangapani, Steve Eugene Watkins, James W. Fonda
Development And Implementation Of Optimized Energy-Delay Sub-Network Routing Protocol For Wireless Sensor Networks, Maciej Jan Zawodniok, Jagannathan Sarangapani, Steve Eugene Watkins, James W. Fonda
Electrical and Computer Engineering Faculty Research & Creative Works
The development and implementation of the optimized energy-delay sub-network routing (OEDSR) protocol for wireless sensor networks (WSN) is presented. This ondemand routing protocol minimizes a novel link cost factor which is defined using available energy, end-to-end (E2E) delay and distance from a node to the base station (BS), along with clustering, to effectively route information to the BS. Initially, the nodes are either in idle or sleep mode, but once an event is detected, the nodes near the event become active and start forming sub-networks. Formation of the inactive network into a sub-network saves energy because only a portion of …
Adaptive Distributed Fair Scheduling And Its Implementation In Wireless Sensor Networks, Maciej Jan Zawodniok, Jagannathan Sarangapani, Steve Eugene Watkins, James W. Fonda
Adaptive Distributed Fair Scheduling And Its Implementation In Wireless Sensor Networks, Maciej Jan Zawodniok, Jagannathan Sarangapani, Steve Eugene Watkins, James W. Fonda
Electrical and Computer Engineering Faculty Research & Creative Works
A novel adaptive and distributed fair scheduling (ADFS) scheme for wireless sensor networks is shown through hardware implementation. In contrast to simulation, hardware evaluation provides valuable feedback to protocol and hardware development process. The proposed protocol focuses on quality-of-service (QoS) issues to address flow prioritization. Thus, when nodes access a shared channel, the proposed ADFS allocates the channel bandwidth proportionally to the weight, or priority, of the packet flows. Moreover, ADFS allows for dynamic allocation of network resources with little added overhead. Weights are initially assigned using user specified QoS criteria. These weights are subsequently updated as a function of …
Model Checking Control Communication Of A Facts Device, David Andrew Cape
Model Checking Control Communication Of A Facts Device, David Andrew Cape
Masters Theses
"This thesis concerns the design and verification of a real-time communication protocol for sensor data collection and processing between an embedded computer and a DSP. In such systems, a certain amount of data loss without recovery may be tolerated. The key issue is to design and verify the correctness in the presence of these lost data frames under real-time constraints. This thesis describes a temporal verification that if the end processes do not detect that too many frames are lost, defined by comparison of error counters against given threshold values, then there will be a bounded delay between transmission of …
Use Of A Classroom Response System To Enhance Classroom Interactivity, Keng Siau, Hong Sheng, Fiona Fui-Hoon Nah
Use Of A Classroom Response System To Enhance Classroom Interactivity, Keng Siau, Hong Sheng, Fiona Fui-Hoon Nah
Business and Information Technology Faculty Research & Creative Works
Classroom interactivity is a critical component of teaching and learning. This paper reports on the use of a classroom response system to enhance classroom interactivity in a systems analysis and design course. The success of the project was assessed using both quantitative and qualitative data. A pretest/posttest design was used to examine the effects of a classroom response system on interactivity. The results show that a classroom response system can significantly improve classroom interactivity. Qualitative data was also collected to identify the strengths and weaknesses of using a classroom response system to enhance classroom interaction. Based on the quantitative and …
New Graph Model For Channel Assignment In Ad Hoc Wireless Networks, Maggie Xiaoyan Cheng, S. C. Huang, X. Huang, Weili Wu
New Graph Model For Channel Assignment In Ad Hoc Wireless Networks, Maggie Xiaoyan Cheng, S. C. Huang, X. Huang, Weili Wu
Computer Science Faculty Research & Creative Works
The channel assignment problem in ad hoc wireless networks is investigated. The problem is to assign channels to hosts in such a way that interference among hosts is eliminated and the total number of channels is minimised. Interference is caused by direct collisions from hosts that can hear each other or indirect collisions from hosts that cannot hear each other, but simultaneously transmit to the same destination. A new class of disk graphs (FDD: interFerence Double Disk graphs) is proposed that include both kinds of interference edges. Channel assignment in wireless networks is a vertex colouring problem in FDD graphs. …
A Scalable Correlation Aware Aggregation Strategy For Wireless Sensor Networks, Yujie Zhu, Ramanuja Vedantham, Seung Jong Park, Raghupathy Sivakumar
A Scalable Correlation Aware Aggregation Strategy For Wireless Sensor Networks, Yujie Zhu, Ramanuja Vedantham, Seung Jong Park, Raghupathy Sivakumar
Computer Science Faculty Research & Creative Works
Sensors-to-sink data in wireless sensor networks (WSNs) are typically correlated with each other. Exploiting such correlation when performing data aggregation can result in considerable improvements in the bandwidth and energy performance of WSNs. In order to exploit such correlation, we present a scalable and distributed correlation-aware aggregation structure that addresses the practical challenges in the context of aggregation in WSNs. Through simulations and analysis, we evaluate the performance of the proposed approach with centralized and distributed correlation aware and unaware structures.
Marketing Military Service Benefits Segmentation Based On Generalized And Restricted Exchange, Caroline Fisher, Kimball P. Marshall
Marketing Military Service Benefits Segmentation Based On Generalized And Restricted Exchange, Caroline Fisher, Kimball P. Marshall
Business and Information Technology Faculty Research & Creative Works
Willingness to engage in exchange is based on desired benefits. In typical commercial transactions, restricted exchange benefits dominate. However, public policy, social marketing situations might require consideration of both restricted and generalized exchange benefits. Applying factor analysis, cluster analysis and cross-tabulation, this paper reports research that has successfully segmented a young adult target market regarding interest in military service based on considerations of generalized and restricted exchange motivations. This research contributes to a growing body of literature on generalized exchange as a key conceptual element for social marketing. Results demonstrate the utility of the generalized exchange concept in identifying amarket …
Location Management In Mobile Ad Hoc Wireless Networks Using Quorums And Clusters, Maggie Xiaoyan Cheng, David H.-C. Du, Ding-Zhu Du
Location Management In Mobile Ad Hoc Wireless Networks Using Quorums And Clusters, Maggie Xiaoyan Cheng, David H.-C. Du, Ding-Zhu Du
Computer Science Faculty Research & Creative Works
Position-based reactive routing is a scalable solution for routing in mobile ad hoc networks. The route discovery algorithm in position-based routing can be efficiently implemented only if the source knows the current address of the destination. In this paper, a quorum-based location management scheme is proposed. Location servers are selected using the minimum dominating set (MDS) approach, and are further organized into quorums for location update and location query. when a mobile node moves, it updates its location servers in the update quorum; when a node requests the location information of another node, it will send a query message to …