scholarly journals Raspberry PI based advanced communication for disaster management

2018 ◽  
Vol 7 (2.31) ◽  
pp. 74
Author(s):  
Dr Su. Suganthi ◽  
S Aishwarya ◽  
S Keerthana ◽  
B R. Sandhya
Keyword(s):  
Cellular Networks ◽  
Base Stations ◽  
Raspberry Pi ◽  
Frequency Range ◽  
Good Communication ◽  
Fm Radio ◽  
Transceiver Module ◽  
Radio Transceiver ◽  
Rescue And Relief ◽  
To Receive

When a natural disaster occurs one of the major crisis is communication. This is mainly because when a calamity occurs all the cellular networks, towers and other contemporary means of network goes down making it impossible to communicate with others. Thus in this paper we propose an alternative solution for communication during disaster which can be achieved using a Long range radio transceiver module, which can operate without the help of any towers or base stations. The proposed transceiver model is a standalone device which can transmit and receive voice signals which operates on ISM band of frequency range 902 to 928 MHz, providing a hinderance free good communication, and as an additional feature is made to receive FM station signals using FM radio module, to keep us updated with the news, rescue and relief activities. 

scholarly journals Machine Learning for the Dynamic Positioning of UAVs for Extended Connectivity

Sensors ◽  
2021 ◽  
Vol 21 (13) ◽  
pp. 4618
Author(s):  
Francisco Oliveira ◽  
Miguel Luís ◽  
Susana Sargento
Keyword(s):  
Machine Learning ◽  
Cellular Networks ◽  
Real Data ◽  
Emerging Technology ◽  
Machine Learning Algorithms ◽  
Base Stations ◽  
Aerial Vehicle ◽  
Positioning Algorithm ◽  
The Military ◽  
Better Than

Unmanned Aerial Vehicle (UAV) networks are an emerging technology, useful not only for the military, but also for public and civil purposes. Their versatility provides advantages in situations where an existing network cannot support all requirements of its users, either because of an exceptionally big number of users, or because of the failure of one or more ground base stations. Networks of UAVs can reinforce these cellular networks where needed, redirecting the traffic to available ground stations. Using machine learning algorithms to predict overloaded traffic areas, we propose a UAV positioning algorithm responsible for determining suitable positions for the UAVs, with the objective of a more balanced redistribution of traffic, to avoid saturated base stations and decrease the number of users without a connection. The tests performed with real data of user connections through base stations show that, in less restrictive network conditions, the algorithm to dynamically place the UAVs performs significantly better than in more restrictive conditions, reducing significantly the number of users without a connection. We also conclude that the accuracy of the prediction is a very important factor, not only in the reduction of users without a connection, but also on the number of UAVs deployed.

scholarly journals Adaptive offloading in mobile-edge computing for ultra-dense cellular networks based on genetic algorithm

2021 ◽  
Vol 10 (1) ◽  
Author(s):  
Zhuofan Liao ◽  
Jingsheng Peng ◽  
Bing Xiong ◽  
Jiawei Huang
Keyword(s):  
Genetic Algorithm ◽  
Energy Consumption ◽  
Cellular Networks ◽  
Physical Distance ◽  
Edge Computing ◽  
Base Stations ◽  
Mobile Edge Computing ◽  
Total Energy Consumption ◽  
Average Delay ◽  
Server Selection

AbstractWith the combination of Mobile Edge Computing (MEC) and the next generation cellular networks, computation requests from end devices can be offloaded promptly and accurately by edge servers equipped on Base Stations (BSs). However, due to the densified heterogeneous deployment of BSs, the end device may be covered by more than one BS, which brings new challenges for offloading decision, that is whether and where to offload computing tasks for low latency and energy cost. This paper formulates a multi-user-to-multi-servers (MUMS) edge computing problem in ultra-dense cellular networks. The MUMS problem is divided and conquered by two phases, which are server selection and offloading decision. For the server selection phases, mobile users are grouped to one BS considering both physical distance and workload. After the grouping, the original problem is divided into parallel multi-user-to-one-server offloading decision subproblems. To get fast and near-optimal solutions for these subproblems, a distributed offloading strategy based on a binary-coded genetic algorithm is designed to get an adaptive offloading decision. Convergence analysis of the genetic algorithm is given and extensive simulations show that the proposed strategy significantly reduces the average latency and energy consumption of mobile devices. Compared with the state-of-the-art offloading researches, our strategy reduces the average delay by 56% and total energy consumption by 14% in the ultra-dense cellular networks.

scholarly journals Latency optimization for D2D-enabled parallel mobile edge computing in cellular networks

2021 ◽  
Vol 2021 (1) ◽  
Author(s):  
Yan Cai ◽  
Liang Ran ◽  
Jun Zhang ◽  
Hongbo Zhu
Keyword(s):  
Cellular Networks ◽  
Optimal Solution ◽  
Vital Role ◽  
Base Stations ◽  
Low Latency ◽  
Mobile Edge Computing ◽  
System Delay ◽  
Simulation Results ◽  
And Task ◽  
Parallel Communication

AbstractEdge offloading, including offloading to edge base stations (BS) via cellular links and to idle mobile users (MUs) via device-to-device (D2D) links, has played a vital role in achieving ultra-low latency characteristics in 5G wireless networks. This paper studies an offloading method of parallel communication and computation to minimize the delay in multi-user systems. Three different scenarios are explored, i.e., full offloading, partial offloading, and D2D-enabled partial offloading. In the full offloading scenario, we find a serving order for the MUs. Then, we jointly optimize the serving order and task segment in the partial offloading scenario. For the D2D-enabled partial offloading scenario, we decompose the problem into two subproblems and then find the sub-optimal solution based on the results of the two subproblems. Finally, the simulation results demonstrate that the offloading method of parallel communication and computing can significantly reduce the system delay, and the D2D-enabled partial offloading can further reduce the latency.

scholarly journals Securing the wireless emergency alerts system

2021 ◽  
Vol 64 (10) ◽  
pp. 85-93
Author(s):  
Jihoon Lee ◽  
Gyuhong Lee ◽  
Jinsung Lee ◽  
Youngbin Im ◽  
Max Hollingsworth ◽  
...  
Keyword(s):  
Open Source ◽  
Open Source Software ◽  
Software Defined Radio ◽  
Severe Weather ◽  
Base Stations ◽  
The Public ◽  
Software Libraries ◽  
Amber Alerts ◽  
Almost All ◽  
To Receive

Modern cell phones are required to receive and display alerts via the Wireless Emergency Alert (WEA) program, under the mandate of the Warning, Alert, and Response Act of 2006. These alerts include AMBER alerts, severe weather alerts, and (unblockable) Presidential Alerts, intended to inform the public of imminent threats. Recently, a test Presidential Alert was sent to all capable phones in the U.S., prompting concerns about how the underlying WEA protocol could be misused or attacked. In this paper, we investigate the details of this system and develop and demonstrate the first practical spoofing attack on Presidential Alerts, using commercially available hardware and modified open source software. Our attack can be performed using a commercially available software-defined radio, and our modifications to the open source software libraries. We find that with only four malicious portable base stations of a single Watt of transmit power each, almost all of a 50,000-seat stadium can be attacked with a 90% success rate. The real impact of such an attack would, of course, depend on the density of cellphones in range; fake alerts in crowded cities or stadiums could potentially result in cascades of panic. Fixing this problem will require a large collaborative effort between carriers, government stakeholders, and cellphone manufacturers. To seed this effort, we also propose three mitigation solutions to address this threat.

Formation and development of the Ukrainian network of meteor radio observations

2021 ◽  
Vol 27 (3) ◽  
pp. 85-92
Author(s):  
F.I. Bushuev ◽  
◽  
M.P. Kaliuzhnyi ◽  
N.A. Kulichenko ◽  
A.V. Shulga ◽  
...  
Keyword(s):  
Remote Access ◽  
Frequency Range ◽  
Kinematic Parameters ◽  
Radio Range ◽  
Continuous Registration ◽  
Radio Signals ◽  
Current Monitoring ◽  
To Receive ◽  
E Mail ◽  
Meteor Radio

During the decade of research, the Research Institute “Mykolaiv Astronomical Observatory” (RI “MAO”) developed hardware and software for monitoring, extracting, and calculating the parameters of meteor phenomena using the forward scattering by meteor ionized trail of the signals of over-the-horizon FM-stations broadcasted in the frequency range of 88—108 MHz. This allowed creating a network of observations of meteor phenomena in the radio range, which consists of six stations located in Mykolaiv (three stations), Rivne, Lviv, and Hlukhiv. The stations have identical hardware and software. Yagi-Uda antennas with six or eight horizontal vibrators and SDR receivers based at RTR2832U microchip are used to receive radio signals. The station software performs continuous registration and analysis of received radio signals at the output of quadrature detectors of the receivers, automatic detection of moments of appearances of meteor reflections, formation, and sending by e-mail daily reports on detected meteor phenomena. Equipment setup and current monitoring of stations operations are carried out by the RI «MAO» using remote access to station computers via the Internet. Monthly reports on the number of meteor events recorded by each station are posted on the site of Radio Meteor Observation Bulletin (RMOB). The article presents the results, obtained by the network in 2017—2019, confirming a correspondence of daily variations in the number of meteors registered by network stations, to the known dependence (observation of meteors in the apex and antapex), as well as a correspondence between the expected characteristics (in time and intensity) of three meteor showers (Perseids, Geminids and Quadrantids) and that had been obtained by the network. Recommendations are also given in the article for additional research aimed at achieving the main goal, namely, expanding information about meteor phenomena, including the estimating of kinematic parameters (velocities, radiants) of meteoroids and their relationship with potentially hazardous asteroids.

Formal Verification of Secure Payment Framework in MANET for Disaster Areas

2018 ◽  
pp. 68-101
Author(s):  
Shaik Shakeel Ahamad ◽  
V. N. Sastry ◽  
Siba K. Udgata
Keyword(s):  
Cellular Networks ◽  
Mobile Agent ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Base Stations ◽  
Payment Systems ◽  
Wired Networks ◽  
Disaster Area ◽  
Message Recovery ◽  
Hoc Networks

In this chapter, the authors propose a secure payment framework in mobile ad hoc network for disaster areas. In order to enable transactions in a disaster area using existing payment systems, we need infrastructure to communicate such as wired networks and base stations for cellular networks which are damaged by natural disasters. The authors propose to use mobile agent technology and digital signature with message recovery (DSMR) mechanism based on ECDSA mechanism to enable transactions in a disaster area using ad hoc networks.

scholarly journals Degrees-Of-Freedom in Multi-Cloud Based Sectored Cellular Networks

Entropy ◽  
2020 ◽  
Vol 22 (6) ◽  
pp. 668
Author(s):  
Samet Gelincik ◽  
Ghaya Rekaya-Ben Othman
Keyword(s):  
Cellular Networks ◽  
Degrees Of Freedom ◽  
Signal To Noise Ratio ◽  
Base Stations ◽  
Processing Capacity ◽  
Coding Schemes ◽  
Minimum Number ◽  
Cut Set ◽  
Base Band ◽  
Multi Cloud

This paper investigates the achievable per-user degrees-of-freedom (DoF) in multi-cloud based sectored hexagonal cellular networks (M-CRAN) at uplink. The network consists of N base stations (BS) and K ≤ N base band unit pools (BBUP), which function as independent cloud centers. The communication between BSs and BBUPs occurs by means of finite-capacity fronthaul links of capacities C F = μ F · 1 2 log ( 1 + P ) with P denoting transmit power. In the system model, BBUPs have limited processing capacity C BBU = μ BBU · 1 2 log ( 1 + P ) . We propose two different achievability schemes based on dividing the network into non-interfering parallelogram and hexagonal clusters, respectively. The minimum number of users in a cluster is determined by the ratio of BBUPs to BSs, r = K / N . Both of the parallelogram and hexagonal schemes are based on practically implementable beamforming and adapt the way of forming clusters to the sectorization of the cells. Proposed coding schemes improve the sum-rate over naive approaches that ignore cell sectorization, both at finite signal-to-noise ratio (SNR) and in the high-SNR limit. We derive a lower bound on per-user DoF which is a function of μ BBU , μ F , and r. We show that cut-set bound are attained for several cases, the achievability gap between lower and cut-set bounds decreases with the inverse of BBUP-BS ratio 1 r for μ F ≤ 2 M irrespective of μ BBU , and that per-user DoF achieved through hexagonal clustering can not exceed the per-user DoF of parallelogram clustering for any value of μ BBU and r as long as μ F ≤ 2 M . Since the achievability gap decreases with inverse of the BBUP-BS ratio for small and moderate fronthaul capacities, the cut-set bound is almost achieved even for small cluster sizes for this range of fronthaul capacities. For higher fronthaul capacities, the achievability gap is not always tight but decreases with processing capacity. However, the cut-set bound, e.g., at 5 M 6 , can be achieved with a moderate clustering size.

Sign in / Sign up

Export Citation Format

Share Document