Type Of Mobile Networks Research Articles

Bi‐LSTM model with time distribution for bandwidth prediction in mobile networks

AbstractWe propose a bandwidth prediction approach based on deep learning. The approach is intended to accurately predict the bandwidth of various types of mobile networks. We first use a machine learning technique, namely, the gradient boosting algorithm, to recognize the connected mobile network. Second, we apply a handover detection algorithm based on network recognition to account for vertical handover that causes the bandwidth variance. Third, as the communication performance offered by 3G, 4G, and 5G networks varies, we suggest a bidirectional long short‐term memory model with time distribution for bandwidth prediction per network. To increase the prediction accuracy, pretraining and fine‐tuning are applied for each type of network. We use a dataset collected at University College Cork for network recognition, handover detection, and bandwidth prediction. The performance evaluation indicates that the handover detection algorithm achieves 88.5% accuracy, and the bandwidth prediction model achieves a high accuracy, with a root‐mean‐square error of only 2.12%.

Geo-Oriented Protocol: Retransmissions and Hops Analysis

Vehicular networks are a promising type of mobile networks that allow communication among vehicles, roadside structures, and the Internet. Many of the applications in VANETs requires the network capacity of catch up many vehicles; a task called data dissemination. In this way, this work shows a solution to data dissemination in vehicular ad hoc networks with a local approach, multi-hop and geo-oriented. Several methods found in the literature depart from the choice of the best retransmitter vehicles as a strategy for a better performance in the data dissemination. Most of the time, these strategies are based on communication between vehicles for the election of the relay vehicles. This decision causes an overhead that can be avoided. In this work, we propose an approach that is also concerned with finding the best retransmitters, however, establishing parameters for purely local decision making. Taking into account the simulations with low-density ranging to high densities the approach presents a good delivery rate, keeping the transmission rate low, ensuring an excellent performance to the network. The geo-oriented approach shows good results when we compare with those similar without overhead.

Capacity of Heterogeneous Mobile Wireless Networks with D-Delay Transmission Strategy.

This paper investigates the capacity problem of heterogeneous wireless networks in mobility scenarios. A heterogeneous network model which consists of n normal nodes and m helping nodes is proposed. Moreover, we propose a D-delay transmission strategy to ensure that every packet can be delivered to its destination nodes with limited delay. Different from most existing network schemes, our network model has a novel two-tier architecture. The existence of helping nodes greatly improves the network capacity. Four types of mobile networks are studied in this paper: i.i.d. fast mobility model and slow mobility model in two-dimensional space, i.i.d. fast mobility model and slow mobility model in three-dimensional space. Using the virtual channel model, we present an intuitive analysis of the capacity of two-dimensional mobile networks and three-dimensional mobile networks, respectively. Given a delay constraint D, we derive the asymptotic expressions for the capacity of the four types of mobile networks. Furthermore, the impact of D and m to the capacity of the whole network is analyzed. Our findings provide great guidance for the future design of the next generation of networks.

An efficient and secure authentication for inter-roaming in wireless heterogeneous network

There has been a tremendous growth in wireless communications in the recent years. It allows a user to access telecommunication services at any wireless terminal based on unique user identity and security information. To enable users to utilize the services of various providers for such multimedia services, some kind of interaction is required between foreign provider and home provider of users. These inter-domain exchanges are subject to degradations such as packet loss and network delays, which increase the overall authentication time. In this paper, we develop an efficient and secure automated key management scheme that can securely inter-work among all types of mobile networks. The proposed protocol performs well in terms of computational and communication cost, and synchronization efficiency.

A Fuzzy-Based Management for Power-Aware Wireless Sensor Network

In recent years, Wireless Sensor Network (WSN) is one important type of mobile network that consists of many sensor nodes (SNs). The power consumption rate and bandwidth of each SN becomes an important issue and needs to be addressed. For increasing the reliability of WSN, this paper proposed a power-aware mechanism to select a stable manager from SNs by fuzzy based inference systems based on the factors of speed, power and location. Further, our mechanism can trigger a mobile agent to distribute the managerial workload.

Analyzing the Economic Effect of Mobile Network Sharing in Korea

As mobile markets in most developed countries are rapidly coming close to saturation, it is increasingly challenging to cover the cost of providing the network, as revenues are not growing. This has driven mobile operators, thus far mostly involved in facility-based competition, to turn their attention to network sharing. There exist various types of mobile network sharing (MNS), from passive to active sharing. In this paper, we propose a model, based on the supply-demand model, for evaluating the economic effects of using six types of MNS. Our study measures the economic effects of employing these six types of MNS, using actual WiBro-related data. Considering lower service price and expenditure reduction, the total economic effect from a year’s worth of MNS use is estimated to be between 513 million and 689 million USD, which is equal to three to four percent of the annual revenue of Korean mobile operators. The results of this study will be used to support the establishment of a MNS policy in Korea. In addition, the results can be used as a basic model for developing various network sharing models.

A location routing protocol based on smart antennas for ad hoc networks

Ad hoc networks are a type of mobile networks that function without any fixed infrastructure. One of the weaknesses of ad hoc networks is that route between a source and a destination is likely to break during communication. Location-based routing algorithms are promising in reducing routing overhead in ad hoc networks. Existing location-based routing algorithms employ the Global Positioning System (GPS) as their location information provider, and synchronize information network-wide. Nonetheless, these protocols have some limitations because the use of GPS is not realistic in certain circumstances. Since smart antenna is able to infer direction and ranging information between pairs of ad hoc node, the obtained local position information can be used to improve routing mechanism. This work proposes a novel Location-Enhanced On-Demand (LEOD) routing protocol which is based on smart antenna technique. The LEOD protocol utilizes local position instead of global position to discover routes and make routing decision for the ad hoc network. Theoretical computation and simulation results show that data packet loss rate decreased significantly compared to other methods well-documented in the literature. In addition, this protocol reduces the network control overheads and the power consumption. It also improves network average throughput.

A routing protocol based on node density for ad hoc networks

Ad hoc networks are a type of mobile network that functions without any fixed infrastructure. One of the weaknesses of ad hoc networks is that a route used between a source and a destination is likely to break during communication. To solve this problem, one approach consists of selecting routes whose nodes have the most stable behavior. Another strategy aims at improving the route repair procedure. This paper proposes a method for improving the success rate of local route repairs in mobile ad hoc networks. This method is based on the density of the nodes in the neighborhood of a route and on the availability of nodes in this neighborhood. Theoretical computation and simulation results show that the data packet loss rate decreased significantly compared to other methods which are well-documented in the literature. In addition, the time required to complete a local route repair following a failure was significantly reduced.