Chunyu Ai

ORCID: 0000-0002-8516-907X
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Energy Efficient Wireless Sensor Networks
  • Mobile Ad Hoc Networks
  • Security in Wireless Sensor Networks
  • Complex Network Analysis Techniques
  • Context-Aware Activity Recognition Systems
  • Privacy-Preserving Technologies in Data
  • Indoor and Outdoor Localization Technologies
  • Opportunistic and Delay-Tolerant Networks
  • Human Mobility and Location-Based Analysis
  • Network Security and Intrusion Detection
  • Data Management and Algorithms
  • Water Quality Monitoring Technologies
  • Cooperative Communication and Network Coding
  • Graph Theory and Algorithms
  • Caching and Content Delivery
  • Cryptography and Data Security
  • Flood Risk Assessment and Management
  • Wireless Networks and Protocols
  • Neural Networks and Applications
  • Algorithms and Data Compression
  • Data Stream Mining Techniques
  • Opinion Dynamics and Social Influence
  • Peer-to-Peer Network Technologies
  • Meteorological Phenomena and Simulations
  • Distributed Sensor Networks and Detection Algorithms

University of South Carolina Upstate
2013-2023

Troy University
2010-2012

Georgia State University
2007-2010

Heilongjiang University of Science and Technology
2005-2009

Heilongjiang University
2005-2009

With vast amounts of data being generated daily and the ever increasing interconnectivity world's internet infrastructures, a machine learning based Intrusion Detection Systems (IDS) has become vital component to protect our economic national security. Previous shallow deep strategies adopt single model approach for intrusion detection. The may experience problems understand increasingly complicated distribution patterns. Particularly, not be effective capture unique patterns from intrusive...

10.26599/bdma.2020.9020003 article EN cc-by Big Data Mining and Analytics 2020-07-16

The complete area coverage problem in Wireless Sensor Networks (WSNs) has been extensively studied the literature. However, many applications do not require all time. For such applications, one effective method to save energy and prolong network lifetime is partially cover area. This for prolonging recently attracts much attention. due hardness of verifying ratio, existing centralized or distributed but nonparallel algorithms partial have very high time complexities. In this work, we propose...

10.1109/tpds.2010.124 article EN IEEE Transactions on Parallel and Distributed Systems 2010-06-14

Wireless sensor networks can be used for event warning applications. Till date, in most of the proposed schemes, raw or aggregated sensed data are periodically sent to a consuming center. However, with those occurrence an emergency such as fire is hardly reported timely, which strict requirement In wireless networks, it also highly desired conserve energy so that network lifetime maximized. Furthermore, ensure quality surveillance, some applications require if occurs, needs detected by at...

10.1109/tpds.2009.129 article EN IEEE Transactions on Parallel and Distributed Systems 2009-08-21

Area query processing is significant for various applications of wireless sensor networks. No previous study has specifically addressed this issue. We can adopt a naive method, which to send all data base station centralized processing. However, method wastes large amount energy reporting useless data. This motivates us propose an energy-efficient in-network area scheme. In our scheme, the whole monitored partitioned into grids, and gray code used represent grid ID (GID), smart way describe...

10.1109/msn.2009.72 article EN 2009-01-01

In many applications, transaction data arrive in the form of high speed streams. These contain a lot information about customers that needs to be carefully managed protect customerspsila privacy. this paper, we consider problem preserving customerpsilas privacy on sliding window This is challenging because updated frequently and rapidly. We propose novel approach, SWAF (sliding anonymization framework), solve by continuously facilitating k-anonymity window. Three advantages make practical:...

10.1109/colcom.2007.4553832 article EN 2007-11-01

Data mining in wireless sensor networks (WSNs) is a new emerging research area. This paper investigates the problem of real time clustering sensory data WSNs. The objective to cluster collected by nodes according similarity d-dimensional space. To perform in-network efficiently, Hilbert Curves based mapping algorithm, HilbertMap, proposed convert space into two-dimensional area covered network. Based on this mapping, distributed algorithm for data, H-Cluster, proposed. It guarantees that...

10.1109/pccc.2009.5403841 article EN 2009-12-01

Wireless sensor networks (WSNs) are employed in many applications order to collect data. One key challenge is minimize energy consumption prolong network lifetime. A scheme of making some nodes asleep and estimating their values according the other active nodespsila readings has been proved energy-efficient. For purpose improving precision estimation, we propose two powerful estimation models, data using physical model (DEPM) statistical (DESM). DEPM estimates sleeping by characteristics...

10.1109/icdcs.2008.22 article EN 2008-06-01

A lot of people prefer to attend activities or do daily workout with partners, friends, even strangers instead solo, however, it is not easy have partners friends as companies all the time since everyone has different schedule. With rapid growth using smart devices and social network applications in our life, more start establishing connections through network. Therefore, designing a framework for organizing events based on collected historical data an efficient way encourage enjoy they like...

10.1109/bdcloud-socialcom-sustaincom.2016.44 article EN 2016-10-01

Transitional Region Phenomenon leads to the existence of lossy links in wireless networks, which results a transmission between two users who are theoretically connected under Deterministic Network Model cannot be guaranteed. Therefore, we focus on more practical network model - Probabilistic (PNM) can better characterize networks. To specific, investigation accelerating data aggregation process probabilistic networks with cognitive radio technology. By involving technology, seek extra...

10.1109/glocom.2016.7841716 article EN 2015 IEEE Global Communications Conference (GLOBECOM) 2016-12-01

While location based services (LBS) are facilitating our daily life, the privacy issues including and query also arising. Existing efforts aiming to preserving rely on third party servers or fail provide guaranteed degree. In this paper we combine concepts of differential k-anonymity establish a novel notion differentially private (DPkA) for in LBS. The sufficient necessary condition availability 0-DPkA is recognized mechanism M0 achieve given. For other cases that impossible, presents an...

10.1109/iiki.2016.67 article EN 2016-10-01

The reliability of wireless sensor networks is significant in certain applications, especially the reliable routing. Most existing routing protocols use multi-paths to improve reliability. However, waste a large amount energy obtain redundancy. This not an optimal option for nodes with limited energy. In this paper, novel clustering-based multi-hop algorithm ( CRMR ) proposed. adopts mechanism multiple backup cluster heads efficiently extend time stable period clusters and decrease...

10.4304/jcm.5.9.654-664 article EN Journal of Communications 2010-10-01

Wireless sensor networks (WSNs) have many applications that handle sensitive information such as surveillance, reconnaissance, and target tracking. Therefore, a WSN deployed in hostile region should be resilient to attacks. The current approach defending against malicious threats is develop deploy specific defense mechanism for attack. However, the problem with this traditional solution jamming attack does not defend other attacks (e.g., sybil, selective forwarding, wormhole attacks). In...

10.1109/milcom.2010.5679559 article EN 2010-10-01

The new generation of social networks contains billions nodes and edges. Managing mining this data is a academic industrial challenge. Influence maximization the problem finding set in network that result highest amount influence diffusion. Many research works have been developed, which focus exclusively on efficiency algorithms, but overlook some features such as time sensitivity practicality large scale. Furthermore, era 'big data' changing dramatically right before our eyes - increase big...

10.1504/ijcse.2017.10008085 article EN International Journal of Computational Science and Engineering 2017-01-01

A lot of daily activities require more than one person to participate and collaborate with each other; however, for many people, it is not easy find good partners engage in another. With the rapid growth social network applications, people get used creating connections on network. Therefore, designing framework partner-matching significant helping easily partners. In this paper, we proposed a which can match an active community. order improve matching performance, all users are divided into...

10.1186/s40649-014-0005-0 article EN cc-by Computational Social Networks 2014-12-01

In mobile opportunistic networks (MONs), a large number of intelligent devices carried by moving people can conduct message transmission without the support communication infrastructures. Routing is one concerning and challenging research hotspots in MONs because nodes’ mobility, intermittent connectivity, limited energy, dynamic changing quality wireless channel. However, only or several above factors are considered most current routing methods. Moreover, owing to high mobility nodes, it...

10.1186/s13638-018-1277-0 article EN cc-by EURASIP Journal on Wireless Communications and Networking 2018-11-16

The new generation of social networks contains billions nodes and edges. Managing mining this data is a academic industrial challenge. Influence maximization the problem finding set in network that result highest amount influence diffusion. Many research works have been developed, which focus exclusively on efficiency algorithms, but overlook some features such as time sensitivity practicality large scale. Furthermore, era 'big data' changing dramatically right before our eyes - increase big...

10.1504/ijcse.2017.087401 article EN International Journal of Computational Science and Engineering 2017-01-01

Modern social networks bring people together and help facilitate the organization of various group activities. Inspired by recent work Ai et al. [2], we design a smart private activity invitation framework based on historical data from devices. Our paradigm aims at helping us

10.4108/eai.13-7-2017.2270271 article EN 2017-01-01
Coming Soon ...