Fixed Communication Infrastructure Research Articles

Impact of Telecommunications Infrastructure Construction on Innovation and Development in China: A Panel Data Approach

This paper empirically studies the impact of telecommunications infrastructure construction on economic and social innovative development using panel data from 31 provinces in China spanning from 2009 to 2022. The research findings indicate that telecommunication infrastructure significantly promotes innovation in terms of R&D investment, knowledge output, and application output. In addition, at various stages of telecommunication technology development, the impact on innovative development varies. Iterative updates in telecommunication technology drive higher R&D expenditures, facilitating better utilization of innovation outcomes in industries. Moreover, there are regional disparities in the influence of telecommunications infrastructure on economic and social innovative development. In the eastern regions, telecommunications infrastructure construction primarily promotes mobile communication, with clear spillover effects. In contrast, in western regions, it mainly facilitates fixed communication networks. Thus, further strengthening telecommunications infrastructure construction provides a new impetus for social innovative development and long-term sustainability. It is essential to persistently advance the coordinated construction of mobile and fixed communication infrastructure to achieve regional development coordination.

Privacy and security issues surrounding vehicular Adhoc networks

Vehicular Ad-Hoc Networks (VANETs) is a type of mobile ad hoc network (MANET) specifically designed for communication among vehicles on the road. VANETs enable vehicles to communicate with each other and with roadside infrastructure, forming a dynamic and self-organizing network without the need for a fixed communication infrastructure. Security concerns in VANETs encompass a range of threats, including Authentication and Authorization attacks, Sybil attacks, Denial-of-Service incidents, Location spoofing, and Eavesdropping. Privacy, on the other hand, is a paramount concern in VANETs due to the sensitive nature of location-based data, Identity Disclosure, and user consent Control. The paper emphasizes the necessity for robust security mechanisms and outlines specific requirements for safeguarding VANETs. Proposed mitigation measures, including cryptographic techniques and authentication mechanisms, are critically assessed for their effectiveness and feasibility. The findings provide a comprehensive understanding of the complexities surrounding privacy and security in VANETs, contributing valuable insights for the development of resilient and privacy-preserving vehicular communication systems.

Collection of Data With Drones in Precision Agriculture: Analytical Model and LoRa Case Study

Unmanned aerial vehicles (UAVs) are autonomous devices employed as data collectors in precision agriculture to support a large number of applications. These UAVs gather data from on-the-ground wireless sensor networks, especially in scenarios that lack any kind of fixed communication infrastructure or where the available infrastructure does not fit the application requirements. Sensors on the ground can store sensing data, and in scenarios that do not require a real-time observation and analysis of the data, like in smart farming, a drone can be used maybe once or two times each day to collect and report the data to a command-and-control center that use them directly, without any other infrastructure (cloud or edges). In this article, we study analytically how close the drone, that uses a LoRa radio, needs to fly over the sensors to collect data with a given quality of data collection. This can be used to properly spacing the sensors on the field at deployment time, to select among different type of drones, and to properly solve some tradeoff related to field size vs autonomy of the drones and the path used by the latter when collecting the data.

Mobile Ad Hoc Network Routing Protocols for Intelligent Transportation Systems

Nowadays, the use of wireless technology has invaded the market of telecommunications networks. There are two main families of wireless networks: networks with infrastructure and networks without infrastructure or AdHoc. In the networks with infrastructure, communications are made via a fixed base station; however, communications in an AdHoc network occur in the absence of any fixed communication infrastructure. There are three types of AdHoc networks: mobile AdHoc networks, mesh networks, and sensor networks. This research applied the mobile AdHoc network to the intelligent transportation systems that improve the traditional transport system with reducing the risk of human errors and with the effective management of traffic congestion. The authors focus in the work especially on the routing protocols inside the MANETs to come out with four routing protocols (AODV, OLSR, DSR, and TORA), and this paper compared their performances in case of using HTTP application, FTP application, email application, voice application, and the rate of the routing control traffic.

Unmanned Aerial Vehicle-Aided Communications: Joint Transmit Power and Trajectory Optimization

This letter investigates the transmit power and trajectory optimization problem for unmanned aerial vehicle (UAV)-aided networks. Different from majority of the existing studies with fixed communication infrastructure, a dynamic scenario is considered where a flying UAV provides wireless services for multiple ground nodes simultaneously. To fully exploit the controllable channel variations provided by the UAV’s mobility, the UAV’s transmit power and trajectory are jointly optimized to maximize the minimum average throughput within a given time length. For the formulated non-convex optimization with power budget and trajectory constraints, this letter presents an efficient joint transmit power and trajectory optimization algorithm. Simulation results validate the effectiveness of the proposed algorithm and reveal that the optimized transmit power shows a water-filling characteristic in spatial domain.

QUACS: Routing Data Packets in Ad Hoc Networks on Buffer-Constrained Load Balancing Conditions During Emergency Rescue Crisis

Mobile wireless networks have been gaining popularity since the turn of the new millennium as they enable communication to take place without fixed communication infrastructure. This form of communication, which has been made possible by radio links proved its usefulness during emergency medical rescues such as an Ebola pandemic, battlefield communications or other emergency situations, where quick communication is of paramount importance. Nature-inspired algorithms such as AntHocNet, AntSense, among other ant inspired techniques, have been mimicked in solving the communication challenges in wireless networks, but they focus mostly on the ‘next-hop’ in determining routing of data packets from the source to the destination, which tends to suffer from congestion-related problems. Ant routing methods focus more on next-hop neighbours when choosing the shortest path which might have many data packets and are prone to congestion. Focusing on the next-hop neighbours poses a challenge of having other nodes that end up being congested. This problem of routes being heavily used, often decreases throughput rates, leading to the proposed Queuing Ant Colony System (QUACS) which is a bio-inspired, complementing the queuing optimisation approach in routing of data packets across the network. The results of simulations show that QUACS performs better in throughput, packet delivery ratio, end-to-end delay and communication overhead than other ant routing algorithms. This study is particularly beneficial in the ad hoc networks where the QUACS routing method can greatly assist in faster communication and evacuation in emergency for treatment of patients during emergency medical rescue operations.

Performance Evaluation of MANET Using Multi-Channel MAC Framework

Major modern day computing and communication rely upon the underlying network used for data transportation. A strong and robust network is a prerequisite for communication oriented applications. One kind of communication networks used for data transportation known as Mobile ad hoc Networks (MANET) have been discussed in this paper and work has been done on their capability enhancement. Mobile ad hoc networks have evolved at a fast pace and provide efficient communication solutions when fixed communication infrastructure is not available and are easily deployable. Traditional mobile ad hoc network works on single wireless communication channel which limits their capacity and capability to handle very large or voluminous data. This limitation can be resolved using multiple physical communication channels. Number of protocols and techniques has been invented to incorporate multi-channel communication capabilities in wireless mobile ad hoc networks each with some pros and cons. In this paper a novel multi-channel wireless communication framework has been presented together with associated techniques and mechanisms. The proposed framework and protocols have been rigorously tested, evaluated and compared with existing benchmarked multi-channel ad hoc network protocols to establish the credibility of the framework.

Long-Range and Broadband Aerial Communication Using Directional Antennas (ACDA): Design and Implementation

In this paper, we design and implement a long-range and broadband aerial communication system using directional antennas (ACDA). The system integrates Wi-Fi devices with aerial networks to quickly establish a Wi-Fi infrastructure in the air, which provides real-time communication capability for disasters where a fixed communication infrastructure does not exist. ACDA utilizes unmanned aerial vehicle (UAV)-carried directional antennas to extend communication range, increase throughput, and reduce interference. A GPS-based control algorithm is designed and implemented to automatically reject wind disturbance and align the directions of antennas in accordance with UAV movement. A received signal strength indicator-based decentralized initial scan algorithm is also designed and implemented to quickly establish initial connection between the UAVs. Simulation studies verify the effectiveness of the heading control and initial scan algorithm. Field tests are also conducted to evaluate the performance of overall system in terms of throughput and delay with respect to the increase of communication range. The ACDA prototype system achieves 48 Mb/s throughput at a distance of 300 m and 2 Mb/s at 5000 m, and proves the promising usage of directional antennas for long-distance Wi-Fi aerial communication. Practical use of this on-demand communication system to aid emergency response is also demonstrated through a case study in a real disaster drill.

Classification of node degree based on deep learning and routing method applied for virtual route assignment

In recent years, the importance of various wireless network technologies has increased. Specifically, in communication environments noted for severe conditions, such as disasters, war, and terrorism, collaboration between fixed communication infrastructure and wireless ad-hoc networks is indispensable. In this paper, the node degree of wireless communication is classified for disaster situations, and virtual routes are set according to the predetermined node degree. Then, the proposed routing method is employed with base stations as the infrastructure, such that a route may be assigned, maintained, and recovered. Our classification of wireless degree nodes uses deep learning, and virtual routes are created by employing the Viterbi algorithm. The proposed routing method is compared with existing methods (AODV, OLSR, and ZRP) from the viewpoint of route discovery times and reachability via simulations.

POSOP Routing Algorithm: A DTN Routing Scheme for Information Connectivity of Health Centres in Hilly State of North India

We explore the application of partitioned network for providing health services in difficult terrain where fixed communication infrastructure is not cost-effective due to low population density and very high cost of setting up a permanent infrastructure. We propose a hybrid routing which is persistent, on-demand, scheduled, opportunistic, and predicted (POSOP) routing algorithm, that exploits various types of contacts existing in a partitioned, hybrid, and sparse network. Such networks may be used to provide guidance from specialist doctors to junior doctors working in primary health centres. We present a scenario from Uttarakhand (a state in hilly region of North India), where POSOP routing algorithm may be used to provide improved health services. Using simulations, we evaluate the performance of POSOP routing algorithm on three metrics, messages delivered, average delay suffered by the delivered messages, and average message traffic. We compare the performance of POSOP routing algorithm with two routing schemes, namely, epidemic and spray and wait on the three metrics. Our approach outperforms both the routing schemes.

The impact of node velocity diversity on mobile opportunistic network performance

Mobile opportunistic network is a special kind of mobile ad hoc networks, in which nodes can communicate and interact with each other without a fixed communication infrastructure. Data dissemination between nodes utilizes a store-carry-forward paradigm. In this paper, we explore the impact of node velocity diversity on the performance of mobile opportunistic networks while keeping the average velocity of nodes consistent with each other. The numerical results indicate that greater node velocity diversity always implies longer average communication and the smaller number of communications within the constant total communication time. Thus, it is important to improve the performance of mobile opportunistic networks by adjusting the velocity diversity in response to the requirement of the network and in order to make full use of communication resources. In particular, we construct mathematical models to analyze node contact times and link numbers. Lastly, we verify the correctness of models and theories we proposed by using the Opportunistic Network Environment simulator.

Multimedia Caching Strategy Based on Popularity in Mobile Ad-Hoc Network

In this paper, we propose the caching technique to minimize the streaming for multimedia item and the service latency. As mobile ad-hoc network (MANET) has no fixed communication infrastructure, the route maintenance and the transmission management are important issues. Caching technique is used to improve the performance of data access. In the proposed caching scheme, mobile node stores the multimedia item passing through itself and the popular items delivered by the routing nodes located in 1 hop away from itself. We adopt caching policy based on LRU and the popularity and the block distance of multimedia items. In evaluation, we examined our proposed scheme in the view of the caching probability and the cache hit ratio as the function of the network size and the node density under the random waypoint mobility model. From simulation results, we confirm that the proposed scheme offers better performance substantially.

Privacy For Location Based System In Mobile P2P Environment

Advances in mobile communication,it creates a major privacy breach in current location-based services (LBS) where mobile users have to report their exact location information to an LBS provider in order to obtain their desired services. For example, a user who wants to issue a query asking about her nearest gas station has to report her exact location to an LBS provider. However, many recent research reports have indicated that revealing private location information to potentially untrusted LBS providers may lead to major privacy breaches. To preserve user location privacy, spatial cloaking is the most commonly used privacy-enhancing technique in LBS. The basic idea of the spatial cloaking technique is to blur a user's exact location into a cloaked area that satisfies the user specified privacy requirements. Unfortunately, existing spatial cloaking algorithms de-signed for LBS rely on fixed communication infrastructure, e.g., base stations, and centralized/distributed servers. Thus, these algorithms cannot be applied to a mobile peer-to-peer (P2P) environment where mobile users can only communicate with other peers through P2P multi-hop routing without any support of fixed communication infrastructure or servers. In this paper, we propose a spatial cloaking algorithm for mobile P2P environments. As mobile P2P environments have many unique limitations, e.g., user mobility, limited transmission range, multi-hop communication, scarce communication resources, and network partitions, we propose two key features to enhance our algorithm: (1) An information sharing scheme enables mobile users to share their gathered peer location information to reduce communication overhead; (2) A historical location scheme allows mobile users to utilize stale peer location information to overcome the network partition problem .thus our P2P spatial cloaking algorithm is scalable while guaranteeing the user's location privacy protection.

Condensation-Based Routing in Mobile Ad-Hoc Networks

The provision of efficient broadcast containment schemes that can dynamically cope with frequent topology changes and limited shared channel bandwidth, is one of the most challenging research topics in MANETs, and is crucial to the basic operations of networks serving fully mobile devices within areas having no fixed communication infrastructure. This problem particularly impacts the design of dynamic routing protocol that can efficiently establish routes to deliver data packets among mobile nodes with minimum communication overhead, and at the same time, ensure high throughput and low end-to-end delay. Accordingly, this work exploits and analyzes an adaptive probabilistic broadcast containment technique based on a particular condensation phenomenon borrowed from Quantum Mechanics and transposed in self-organizing random networks, that has the potential to effectively drive the on-demand route discovery process. Simulation-based performance analysis has shown that the proposed technique can introduce significant benefits on the general performance of broadcast-based reactive routing protocols in MANETs.

Condensation-Based Routing in Mobile Ad-Hoc Networks

The provision of efficient broadcast containment schemes that can dynamically cope with frequent topology changes and limited shared channel bandwidth, is one of the most challenging research topics in MANETs, and is crucial to the basic operations of networks serving fully mobile devices within areas having no fixed communication infrastructure. This problem particularly impacts the design of dynamic routing protocol that can efficiently establish routes to deliver data packets among mobile nodes with minimum communication overhead, and at the same time, ensure high throughput and low end-to-end delay. Accordingly, this work exploits and analyzes an adaptive probabilistic broadcast containment technique based on a particular condensation phenomenon borrowed from Quantum Mechanics and transposed in self-organizing random networks, that has the potential to effectively drive the on-demand route discovery process. Simulation-based performance analysis has shown that the proposed technique can introduce significant benefits on the general performance of broadcast-based reactive routing protocols in MANETs.

On Efficient and Scalable Support of Continuous Queries in Mobile Peer-to-Peer Environments

In this paper, we propose an efficient and scalable query processing framework for continuous spatial queries (range and k-nearest-neighbor queries) in mobile peer-to-peer (P2P) environments, where no fixed communication infrastructure or centralized/distributed servers are available. Due to the limitations in mobile P2P environments, for example, user mobility, limited battery power, limited communication range, and scarce communication bandwidth, it is costly to maintain the exact answer of continuous spatial queries. To this end, our framework enables the user to find an approximate answer with quality guarantees. In particular, we design two key features to adapt continuous spatial query processing to mobile P2P environments. 1) Each mobile user can specify his or her desired quality of services (QoS) for a query answer in a personalized QoS profile. The QoS profile consists of two parameters, namely, coverage and accuracy. The coverage parameter indicates the desired level of completeness of the available information for computing an approximate answer, and the accuracy parameter indicates the desired level of accuracy of the approximate answer. 2) We design a continuous answer maintenance scheme to enable the user to collaborate with other peers to continuously maintain a query answer. With these two features in our framework, the user can obtain a query answer from a local cache if the answer satisfies his or her QoS requirements. Otherwise, the user enlists neighbors for help to share their cached information to refine the answer. If the refined answer still cannot satisfy the QoS requirements, the user broadcasts the query to the peers residing within the required search area of the query to find the most accurate answer. Experiment results show that our framework is efficient and scalable and provides an effective trade-off between the communication overhead and the quality of query answers.

A routing layer-based hierarchical service advertisement and discovery for MANETs

The implementation of mobile ad hoc networks (MANETs) is steadily increasing. MANETs are especially popular in locations that lack a fixed communication infrastructure. To achieve zero-configuration MANETs, as well as quick and easy access to network resources, resources must be well managed by the network. This paper proposes a hierarchical service discovery and advertisement protocol (HSDAP) implemented in the routing layer. HSDAP queries services by piggybacking service REQuest (SREQ) packets on routing packets to reduce overhead and energy consumption. We extend the cluster-based routing protocol (CBRP) to improve service management hierarchy. Simulation results show that adding service discovery and advertisement (SDA) functions to CBRP does not significantly affect overhead. SDA overhead, routing overhead, energy consumption, and SDA delay are significantly less than the extended zone routing protocol. Furthermore, SDA hit ratio of the proposed protocol is greater than 86% for various levels of mobility. The proposed HSDAP is robust and scalable.

Ubiquitous and Secure Certificate Service for Wireless Ad Hoc Network

Wireless ad hoc network is one of the most suitable platforms for providing communication services to support mobile applications in public areas where no fixed communication infrastructure exists. However, due to the open nature of wireless links and lack of security infrastructure in an ad hoc network environment, applications operating on ad hoc network platforms are subjected to non-trivial security challenges. Asymmetric key management, which is widely adopted to be an effective basis for security services in an open network environment, typically plays a crucial role in meeting the security requirements of such applications. In this paper, we propose a secure asymmetric key management scheme, the Ubiquitous and Secure Certificate Service (USCS), which is based on a variant of the Distributed Certificate Authority (DCA) - the Fully Distributed Certificate Authority (FDCA). Similar to FDCA, USCS introduces the presence of 1-hop neighbors which hold shares of DCA's private signature key, and can collaborate to issue certificates, thereby providing asymmetric key management service. Both USCS and FDCA aim to achieve higher availability than the basic DCA scheme; however, USCS is more secure than FDCA in that the former achieves high availability by distributing existing shares to new members, rather than generating new shares as the FDCA scheme does. In order to realise the high availability potential of USCS, a share selection algorithm is also proposed. Experimental results demonstrated that USCS is a more secure approach of the DCA scheme in that it can achieve stronger security than FDCA while attaining high availability similar to that of FDCA. Experiments also showed that USCS incurs only moderate communication overheads.

Spatial cloaking for anonymous location-based services in mobile peer-to-peer environments

This paper tackles a privacy breach in current location-based services (LBS) where mobile users have to report their exact location information to an LBS provider in order to obtain their desired services. For example, a user who wants to issue a query asking about her nearest gas station has to report her exact location to an LBS provider. However, many recent research efforts have indicated that revealing private location information to potentially untrusted LBS providers may lead to major privacy breaches. To preserve user location privacy, spatial cloaking is the most commonly used privacy-enhancing technique in LBS. The basic idea of the spatial cloaking technique is to blur a user’s exact location into a cloaked area that satisfies the user specified privacy requirements. Unfortunately, existing spatial cloaking algorithms designed for LBS rely on fixed communication infrastructure, e.g., base stations, and centralized/distributed servers. Thus, these algorithms cannot be applied to a mobile peer-to-peer (P2P) environment where mobile users can only communicate with other peers through P2P multi-hop routing without any support of fixed communication infrastructure or servers. In this paper, we propose a spatial cloaking algorithm for mobile P2P environments. As mobile P2P environments have many unique limitations, e.g., user mobility, limited transmission range, multi-hop communication, scarce communication resources, and network partitions, we propose three key features to enhance our algorithm: (1) An information sharing scheme enables mobile users to share their gathered peer location information to reduce communication overhead; (2) A historical location scheme allows mobile users to utilize stale peer location information to overcome the network partition problem; and (3) A cloaked area adjustment scheme guarantees that our spatial cloaking algorithm is free from a “center-of-cloaked-area” privacy attack. Experimental results show that our P2P spatial cloaking algorithm is scalable while guaranteeing the user’s location privacy protection.

Locating sensor nodes on construction projects

Localization of randomly distributed wireless sensor nodes is a significant and fundamental problem in a broad range of emerging civil engineering applications. Densely deployed in physical environments, they are envisioned to form ad hoc communication networks and provide sensed data without relying on a fixed communications infrastructure. To establish ad hoc communication networks among wireless sensor nodes, it is useful and sometimes necessary to determine sensors' positions in static and dynamic sensor arrays. As well, the location of sensor nodes becomes of immediate use if construction resources, such as materials and components, are to be tracked. Tracking the location of construction resources enables effortless progress monitoring and supports real-time construction state sensing. This paper compares several models for localizing RFID nodes on construction job sites. They range from those based on triangulation with reference to transmission space maps, to roving RFID reader and tag systems using multiple proximity constraints, to approaches for processing uncertainty and imprecision in proximity measurements. They are compared qualitatively on the basis of cost, flexibility, scalability, computational complexity, ability to manage uncertainty and imprecision, and ability to handle dynamic sensor arrays. Results of field experiments and simulations are also presented where applicable.