sensors-logo

Journal Browser

Journal Browser

Selected Papers from CyberC 2018

A special issue of Sensors (ISSN 1424-8220). This special issue belongs to the section "Internet of Things".

Deadline for manuscript submissions: closed (31 December 2018) | Viewed by 13849

Special Issue Editors

InfoBeyond Technology LLC, 320 Whittington PKWY, Louisville, KY STE 117, USA
Interests: wireless communications; sensor networks; cybersecurity; AI & reasoning; optimization; mobile computing
Special Issues, Collections and Topics in MDPI journals

E-Mail Website
Guest Editor
Computer Engineering and Computer Science Department, University of Louisville, Louisville, KY 40292, USA
Interests: mobile computing; IoT; smart sensors; sensor clouds; big data in sensory systems
Special Issues, Collections and Topics in MDPI journals

E-Mail Website
Guest Editor
School of Information Engineering, Zhengzhou University, Zhengzhou 450001, China
Interests: resource allocation and security designs of wireless networks; signal processing for wireless communications; AI-enabled wireless communications
Special Issues, Collections and Topics in MDPI journals

Special Issue Information

Dear Colleagues,

The 10th International Conference on Cyber-Enabled Distributed Computing and Knowledge (CyberC 2018), will be held 18–20 October, 2018, in Zhengzhou, China (http://www.cyberc.org/).

Smart sensor networks are fulfilling an important role and serve as the interfaces for Internet of Things (IoT) systems to monitor and interact with the physical world. This Special Issue aims to gather the latest research breakthroughs in the area of sensor networks development, especially for its applications in smart cities, industry sensor communications, power distribution systems, intelligent public transport services, pervasive health technologies, and sensor social networks. Papers should present the most recent advances in different aspects of smart sensor networks.

This CyberC 2018 Special Issue has a particular interest in smart sensors and relevant topics. Some of the topics are smart cities, the Internet of Things (IoT), sensor-aided smart grids, vehicular sensor networks, video sensor networks, sensor-aided social networks, cognitive radio sensor networks, robot-aided sensor networks, body sensor networks, sensor–cloud applications, data fusion in smart sensor networks, big data in sensory systems, human–sensor interactions, bio-inspired sensor networks, resource management, cross-layer design and optimization, and network security.

All CyberC 2018 authors are invited to submit their extended papers (30% minimum, 50% or more is desirable) to this Special Issue. Final recommendations will be made based on the paper’s quality.

Dr. Bin Xie
Prof. Anup Kumar
Prof. Ning Wang
Guest Editors

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All submissions that pass pre-check are peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Sensors is an international peer-reviewed open access semimonthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 2600 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

Keywords

  • Smart Sensors
  • Sensor Networks
  • Sensor Security
  • Sensor and Machine Learning
  • Sensor Communications

Published Papers (3 papers)

Order results
Result details
Select all
Export citation of selected articles as:

Research

17 pages, 1068 KiB  
Article
Iterative Trajectory Optimization for Physical-Layer Secure Buffer-Aided UAV Mobile Relaying
by Lingfeng Shen, Ning Wang, Xiang Ji, Xiaomin Mu and Lin Cai
Sensors 2019, 19(15), 3442; https://doi.org/10.3390/s19153442 - 06 Aug 2019
Cited by 14 | Viewed by 3574
Abstract
With the fast development of commercial unmanned aerial vehicle (UAV) technology, there are increasing research interests on UAV communications. In this work, the mobility and deployment flexibility of UAVs are exploited to form a buffer-aided relaying system assisting terrestrial communication that is blocked. [...] Read more.
With the fast development of commercial unmanned aerial vehicle (UAV) technology, there are increasing research interests on UAV communications. In this work, the mobility and deployment flexibility of UAVs are exploited to form a buffer-aided relaying system assisting terrestrial communication that is blocked. Optimal UAV trajectory design of the UAV-enabled mobile relaying system with a randomly located eavesdropper is investigated from the physical-layer security perspective to improve the overall secrecy rate. Based on the mobility of the UAV relay, a wireless channel model that changes with the trajectory and is exploited for improved secrecy is established. The secrecy rate is maximized by optimizing the discretized trajectory anchor points based on the information causality and UAV mobility constraints. However, the problem is non-convex and therefore difficult to solve. To make the problem tractable, we alternatively optimize the increments of the trajectory anchor points iteratively in a two-dimensional space and decompose the problem into progressive convex approximate problems through the iterative procedure. Convergence of the proposed iterative trajectory optimization technique is proved analytically by the squeeze principle. Simulation results show that finding the optimal trajectory by iteratively updating the displacements is effective and fast converging. It is also shown by the simulation results that the distribution of the eavesdropper location influences the security performance of the system. Specifically, an eavesdropper further away from the destination is beneficial to the system’s overall secrecy rate. Furthermore, it is observed that eavesdropper being further away from the destination also results in shorter trajectories, which implies it being energy-efficient as well. Full article
(This article belongs to the Special Issue Selected Papers from CyberC 2018)
Show Figures

Figure 1

21 pages, 5270 KiB  
Article
3D Path Planning for the Ground Robot with Improved Ant Colony Optimization
by Lanfei Wang, Jiangming Kan, Jun Guo and Chao Wang
Sensors 2019, 19(4), 815; https://doi.org/10.3390/s19040815 - 16 Feb 2019
Cited by 37 | Viewed by 6571
Abstract
Path planning is a fundamental issue in the aspect of robot navigation. As robots work in 3D environments, it is meaningful to study 3D path planning. To solve general problems of easily falling into local optimum and long search times in 3D path [...] Read more.
Path planning is a fundamental issue in the aspect of robot navigation. As robots work in 3D environments, it is meaningful to study 3D path planning. To solve general problems of easily falling into local optimum and long search times in 3D path planning based on the ant colony algorithm, we proposed an improved the pheromone update and a heuristic function by introducing a safety value. We also designed two methods to calculate safety values. Concerning the path search, we designed a search mode combining the plane and visual fields and limited the search range of the robot. With regard to the deadlock problem, we adopted a 3D deadlock-free mechanism to enable ants to get out of the predicaments. With respect to simulations, we used a number of 3D terrains to carry out simulations and set different starting and end points in each terrain under the same external settings. According to the results of the improved ant colony algorithm and the basic ant colony algorithm, paths planned by the improved ant colony algorithm can effectively avoid obstacles, and their trajectories are smoother than that of the basic ant colony algorithm. The shortest path length is reduced by 8.164%, on average, compared with the results of the basic ant colony algorithm. We also compared the results of two methods for calculating safety values under the same terrain and external settings. Results show that by calculating the safety value in the environmental modeling stage in advance, and invoking the safety value directly in the path planning stage, the average running time is reduced by 91.56%, compared with calculating the safety value while path planning. Full article
(This article belongs to the Special Issue Selected Papers from CyberC 2018)
Show Figures

Figure 1

9 pages, 751 KiB  
Article
On Metric Dimension in Some Hex Derived Networks
by Zehui Shao, Pu Wu, Enqiang Zhu and Lanxiang Chen
Sensors 2019, 19(1), 94; https://doi.org/10.3390/s19010094 - 28 Dec 2018
Cited by 19 | Viewed by 2982
Abstract
The concept of a metric dimension was proposed to model robot navigation where the places of navigating agents can change among nodes. The metric dimension m d ( G ) of a graph G is the smallest number k for which G contains [...] Read more.
The concept of a metric dimension was proposed to model robot navigation where the places of navigating agents can change among nodes. The metric dimension m d ( G ) of a graph G is the smallest number k for which G contains a vertex set W, such that | W | = k and every pair of vertices of G possess different distances to at least one vertex in W. In this paper, we demonstrate that m d ( H D N 1 ( n ) ) = 4 for n 2 . This indicates that in these types of hex derived sensor networks, the least number of nodes needed for locating any other node is four. Full article
(This article belongs to the Special Issue Selected Papers from CyberC 2018)
Show Figures

Figure 1

Back to TopTop