4.5 Article

Efficient Data Gathering with Mobile Collectors and Space-Division Multiple Access Technique in Wireless Sensor Networks

Journal

IEEE TRANSACTIONS ON COMPUTERS
Volume 60, Issue 3, Pages 400-417

Publisher

IEEE COMPUTER SOC
DOI: 10.1109/TC.2010.140

Keywords

Wireless sensor networks; mobile data gathering; space-division multiple access (SDMA); maximum matching

Funding

  1. US National Science Foundation [ECS-0427345, ECCS-0801438]
  2. US Army Research Office [W911NF-09-1-0154]
  3. Directorate For Engineering
  4. Div Of Electrical, Commun & Cyber Sys [0801438] Funding Source: National Science Foundation

Ask authors/readers for more resources

Recent years have witnessed a surge of interest in efficient data gathering schemes in wireless sensor networks (WSNs). In this paper, we address this issue by adopting mobility and space-division multiple access (SDMA) technique. Specifically, mobile collectors, called SenCars in this paper, work like mobile base stations and collect data from associated sensors via single-hop transmissions so as to achieve uniform energy consumption. We also apply SDMA technique to data gathering by equipping each SenCar with multiple antennas such that distinct compatible sensors may successfully make concurrent data uploading to a SenCar. To investigate the utility of the joint design of controlled mobility and SDMA technique, we consider two cases, where a single SenCar and multiple SenCars are deployed in a WSN, respectively. For the single SenCar case, we aim to minimize the total data gathering time, which consists of the moving time of the SenCar and the data uploading time of sensors, by exploring the trade-off between the shortest moving tour and the full utilization of SDMA. We refer to this problem as mobile data gathering with SDMA, or MDG-SDMA for short. We formalize it into an integer linear program (ILP) and propose three heuristic algorithms for it. In the multi-SenCar case, the sensing field is divided into several regions, each having a SenCar. We focus on minimizing the maximum data gathering time among different regions and refer to it as mobile data gathering with multiple SenCars and SDMA (MDG-MS) problem. Accordingly, we propose a region-division and tour-planning (RDTP) algorithm in which data gathering time is balanced among different regions. We carry out extensive simulations and the results demonstrate that our proposed algorithms significantly outperform single SenCar and non-SDMA schemes.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.5
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

Article Computer Science, Information Systems

Deep Reinforcement Learning Based Approach for Online Service Placement and Computation Resource Allocation in Edge Computing

Tong Liu, Shenggang Ni, Xiaoqiang Li, Yanmin Zhu, Linghe Kong, Yuanyuan Yang

Summary: Due to the emergence of computation-intensive intelligent applications, edge computing has been proposed to satisfy the low-latency requirements. Services need to be placed in advance on edge nodes to process heterogenous computation tasks, considering the limited storage space and computation resources. This joint service placement and computation resource allocation problem is complicated, and a novel approach based on parameterized deep Q networks is proposed to minimize the total latency of tasks. Extensive simulations are conducted to evaluate the performance of the proposed approach.

IEEE TRANSACTIONS ON MOBILE COMPUTING (2023)

Article Computer Science, Theory & Methods

Online Pricing and Trading of Private Data in Correlated Queries

Hui Cai, Fan Ye, Yuanyuan Yang, Yanmin Zhu, Jie Li, Fu Xiao

Summary: This paper investigates the trading and pricing of multiple correlated queries on private web browsing history data. The proposed CTRADE framework includes a modified matrix mechanism and an ellipsoid-based query pricing mechanism. Experimental results demonstrate that CTRADE achieves a good balance between error and privacy preferences and satisfies desired economic properties.

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS (2022)

Article Computer Science, Theory & Methods

VQL: Efficient and Verifiable Cloud Query Services for Blockchain Systems

Haotian Wu, Zhe Peng, Songtao Guo, Yuanyuan Yang, Bin Xiao

Summary: This paper addresses the issues of efficiency and authenticity in data queries for blockchain systems. It proposes a Verifiable Query Layer (VQL) deployed in the cloud to provide efficient and verifiable data query services. A middleware layer is used to extract and reorganize data from the blockchain system, while preventing falsified data through cryptographic fingerprinting. The authenticity of the databases can be verified by miners and public users. Experimental results demonstrate the effectiveness of VQL in supporting various data query services and ensuring query result authenticity.

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS (2022)

Article Computer Science, Software Engineering

A coarse-to-fine ghost removal scheme for HDR imaging

Shufang Xia, Songtao Guo, Zhong Qu, Yuanyuan Yang

Summary: This paper proposes an effective coarse-to-fine deghosting method combining registration and matching, which can effectively remove ghost artifacts in high dynamic range imaging.

VISUAL COMPUTER (2023)

Article Computer Science, Information Systems

Consortium Blockchain-Based Public Integrity Verification in Cloud Storage for IoT

Yangfei Lin, Jie Li, Shigetomo Kimura, Yuanyuan Yang, Yusheng Ji, Yangjie Cao

Summary: The applications of IoT have had a significant impact on various aspects of people's lives, creating a large volume of data. To ensure the integrity of cloud-stored data, a consortium blockchain-based public integrity verification system is proposed, in which the behaviors of third-party auditors are recorded on the blockchain for auditing purposes.

IEEE INTERNET OF THINGS JOURNAL (2022)

Article Computer Science, Information Systems

Characterizing the Multicast Nature of Malicious Flows in CCN via SIS Epidemic Model

Weihong Yang, Yang Qin, Yuanyuan Yang

Summary: This article analyzes the influence of CCN's multicast nature on malicious spread, proposes a multicast-based model, and discusses optimal strategies for epidemic control and immunization. Simulation results demonstrate the effectiveness of targeted immunization in reducing infection rates.

IEEE SYSTEMS JOURNAL (2022)

Article Computer Science, Hardware & Architecture

k-Level Truthful Incentivizing Mechanism and Generalized k-MAB Problem

Pengzhan Zhou, Xin Wei, Cong Wang, Yuanyuan Yang

Summary: This paper investigates incentive mechanisms in the sharing economy by considering systems with different levels of difficulty, proposing two incentivizing strategies and deriving their utility ratios. The problem is further extended to a generalized k-MAB problem, and a regret-minimizing mechanism is proposed.

IEEE TRANSACTIONS ON COMPUTERS (2022)

Article Computer Science, Information Systems

A Near-Optimal Approach for Online Task Offloading and Resource Allocation in Edge-Cloud Orchestrated Computing

Tong Liu, Lu Fang, Yanmin Zhu, Weiqin Tong, Yuanyuan Yang

Summary: In this paper, an online task offloading and resource allocation approach is proposed for edge-cloud orchestrated computing. By leveraging the cooperation between edge computing and cloud computing, the approach aims to reduce the latency of computation tasks and minimize the average latency over time. The approach decomposes the problem into subproblems using Lyapunov optimization and duality theory, and can achieve near-optimal performance.

IEEE TRANSACTIONS ON MOBILE COMPUTING (2022)

Article Computer Science, Information Systems

Distributed Pricing and Bandwidth Allocation in Crowdsourced Wireless Community Networks

Yongmin Zhang, Cenchen Ji, Nan Qiao, Ju Ren, Yaoxue Zhang, Yuanyuan Yang

Summary: With the rapid growth of global mobile data traffic, Wi-Fi plays an increasingly important role in expanding network capacity. To overcome the geographical coverage limit of Wi-Fi APs, the crowdsourced wireless community network has emerged as a cost-effcient way for providing Internet access services. Therefore, a distributed pricing and bandwidth allocation scheme is proposed to maximize the profit of Wi-Fi providers and provide better Internet services to mobile users.

IEEE TRANSACTIONS ON MOBILE COMPUTING (2023)

Proceedings Paper Computer Science, Hardware & Architecture

Provably Efficient Algorithms for Traffic-sensitive SFC Placement and Flow Routing

Yingling Mao, Xiaojun Shang, Yuanyuan Yang

Summary: This paper addresses the deployment problem of service function chain in network function virtualization (NFV) and proposes a two-stage scheme and dynamic segmental packing algorithm to efficiently solve it. In extensive simulations, the proposed scheme demonstrates outstanding performance compared to the optimal solutions and benchmark tests.

IEEE CONFERENCE ON COMPUTER COMMUNICATIONS (IEEE INFOCOM 2022) (2022)

Proceedings Paper Computer Science, Hardware & Architecture

Enabling QoE Support for Interactive Applications over Mobile Edge with High User Mobility

Xiaojun Shang, Yaodong Huang, Yingling Mao, Zhenhua Liu, Yuanyuan Yang

Summary: The fast development of mobile edge computing and service virtualization brings new opportunities for deploying interactive applications at the network edge. However, existing mobile edge networks often fail to meet the quality of experience (QoE) requirements due to user mobility and network volatility. In this paper, a novel scheme is proposed to reduce delay and adjust data throughput rate for QoE enhancement by migrating virtual services and tuning their throughput rates based on real-time bandwidth fluctuation.

IEEE CONFERENCE ON COMPUTER COMMUNICATIONS (IEEE INFOCOM 2022) (2022)

Proceedings Paper Computer Science, Hardware & Architecture

Multi-Entanglement Routing Design over Quantum Networks

Yiming Zeng, Jiarui Zhang, Ji Liu, Zhenhua Liu, Yuanyuan Yang

Summary: This paper investigates the quantum entanglement routing problem and proposes efficient routing algorithms through two sequential integer programming steps. The evaluation results demonstrate that the proposed approach outperforms existing solutions in terms of the number of served quantum-user pairs and the network expected throughput.

IEEE CONFERENCE ON COMPUTER COMMUNICATIONS (IEEE INFOCOM 2022) (2022)

Proceedings Paper Computer Science, Hardware & Architecture

Blockchain Based Non-repudiable IoT Data Trading: Simpler, Faster, and Cheaper

Fei Chen, Jiahao Wang, Changkun Jiang, Tao Xiang, Yuanyuan Yang

Summary: This paper proposes a blockchain-based IoT data trading scheme to address the issues of credibility and real-time requirement. The scheme consists of a trading scheme and an arbitration scheme, utilizing divide-and-conquer approach and commitment methods for efficient trading, and resolving disputes through on-chain and off-line arbitration.

IEEE CONFERENCE ON COMPUTER COMMUNICATIONS (IEEE INFOCOM 2022) (2022)

Proceedings Paper Telecommunications

Coalition Formation Game for Task Offloading in Edge Computing with Considering Individual Rationality and Collective Rationality of Users

Yubin Zhou, Tong Liu, Yanmin Zhu, Honghao Gao, Yuanyuan Yang

Summary: This paper proposes a task offloading strategy for end users, considering both individual rationality and collective rationality. By reformulating the problem as a coalition formation game and introducing a decentralized decision-making algorithm, the conflicts between individual utility and collective utility are addressed.

IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC 2022) (2022)

Proceedings Paper Telecommunications

CFLMEC: Cooperative Federated Learning for Mobile Edge Computing

Xinghan Wang, Xiaoxiong Zhong, Yuanyuan Yang, Tingting Yang, Nan Cheng

Summary: This study proposes a cooperative federated learning framework called CFLMEC for mobile edge computing, which addresses the communication resource allocation issue and maximizes device throughput through optimization algorithms.

IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC 2022) (2022)

No Data Available