Falcon Optimization Algorithm-Based Energy Efficient Communication Protocol for Cluster-Based Vehicular Networks

Rapid development in Information Technology(IT)has allowed several novel application regions like large outdoor vehicular networks for Vehicle-to-Vehicle(V2V)transmission.Vehicular networks give a safe and more effective driving experience by presenting time-sensitive and location-aware data.The communication occurs directly between V2V and Base Station(BS)units such as the Road Side Unit(RSU),named as a Vehicle to Infrastructure(V2I).However,the frequent topology alterations in VANETs generate several problems with data transmission as the vehicle velocity differs with time.Therefore,the scheme of an effectual routing protocol for reliable and stable communications is significant.Current research demonstrates that clustering is an intelligent method for effectual routing in a mobile environment.Therefore,this article presents a Falcon Optimization Algorithm-based Energy Efficient Communication Protocol for Cluster-based Routing(FOA-EECPCR)technique in VANETS.The FOA-EECPCR technique intends to group the vehicles and determine the shortest route in the VANET.To accomplish this,the FOA-EECPCR technique initially clusters the vehicles using FOA with fitness functions comprising energy,distance,and trust level.For the routing process,the Sparrow Search Algorithm(SSA)is derived with a fitness function that encompasses two variables,namely,energy and distance.A series of experiments have been conducted to exhibit the enhanced performance of the FOA-EECPCR method.The experimental outcomes demonstrate the enhanced performance of the FOA-EECPCR approach over other current methods.

Trust-based co-operative routing for secure communication in mobile ad hoc networks

The working of a Mobile Ad hoc NETwork(MANET)relies on the supportive cooperation among the network nodes.But due to its intrinsic features,a misbehaving node can easily lead to a routing disorder.This paper presents two trust-based routing schemes,namely Trust-based Self-Detection Routing(TSDR)and Trust-based Cooperative Routing(TCOR)designed with an Ad hoc On-demand Distance Vector(AODV)protocol.The proposed work covers a wide range of security challenges,including malicious node identification and prevention,accurate trust quantification,secure trust data sharing,and trusted route maintenance.This brings a prominent solution for mitigating misbehaving nodes and establishing efficient communication in MANET.It is empirically validated based on a performance comparison with the current Evolutionary Self-Cooperative Trust(ESCT)scheme,Generalized Trust Model(GTM),and the conventional AODV protocol.The extensive simulations are conducted against three different varying network scenarios.The results affirm the improved values of eight popular performance metrics overcoming the existing routing schemes.Among the two proposed works,TCOR is more suitable for highly scalable networks;TSDR suits,however,the MANET application better with its small size.This work thus makes a significant contribution to the research community,in contrast to many previous works focusing solely on specific security aspects,and results in a trade-off in the expected values of evaluation parameters and asserts their efficiency.

Improvisation of Node Mobility Using Cluster Routing-based Group Adaptive in MANET

In today's Internet routing infrastructure,designers have addressed scal-ing concerns in routing constrained multiobjective optimization problems examining latency and mobility concerns as a secondary constrain.In tactical Mobile Ad-hoc Network(MANET),hubs can function based on the work plan in various social affairs and the internally connected hubs are almost having the related moving standards where the topology between one and the other are tightly coupled in steady support by considering the touchstone of hubs such as a self-sorted out,self-mending and self-administration.Clustering in the routing process is one of the key aspects to increase MANET performance by coordinat-ing the pathways using multiple criteria and analytics.We present a Group Adaptive Hybrid Routing Algorithm(GAHRA)for gathering portability,which pursues table-driven directing methodology in stable accumulations and on-request steering strategy for versatile situations.Based on this aspect,the research demonstrates an adjustable framework for commuting between the table-driven approach and the on-request approach,with the objectives of enhancing the out-put of MANET routing computation in each hub.Simulation analysis and replication results reveal that the proposed method is promising than a single well-known existing routing approach and is well-suited for sensitive MANET applications.

Algorithmof communication network reliability combining links,nodes and capacity

The conception of the normalized reliability index weighted by capacity is introduced, which combing the communication capacity, the reliability probability of exchange nodes and the reliability probability of the transmission links, in order to estimate the reliability performance of communication network comprehensively and objectively. To realize the full algebraic calculation, the key problem should be resolved, which is to find an algorithm to calculate all the routes between nodes of a network. A kind of logic algebraic algorithm of network routes is studied and based on this algorithm, the full algebraic algorithm of normalized reliability index weighted by capacity is studied. For this algorithm, it is easy to design program and the calculation of reliability index is finished, which is the foundation of the comprehensive and objective estimation of communication networks. The calculation procedure of the algorithm is introduced through typical examples and the results verify the algorithm.

Load Balancing-Based Routing Optimization Mechanism for Power Communication Networks

In power communication networks, it is a challenge to decrease the risk of different services efficiently to improve operation reliability. One of the important factor in reflecting communication risk is service route distribution. However, existing routing algorithms do not take into account the degree of importance of services, thereby leading to load unbalancing and increasing the risks of services and networks. A routing optimization mechanism based on load balancing for power communication networks is proposed to address the abovementioned problems. First, the mechanism constructs an evaluation model to evaluate the service and network risk degree using combination of devices, service load, and service characteristics. Second, service weights are determined with modified relative entropy TOPSIS method, and a balanced service routing determination algorithm is proposed. Results of simulations on practical network topology show that the mechanism can optimize the network risk degree and load balancing degree efficiently.

Distributed wireless quantum communication networks with partially entangled pairs

Wireless quantum communication networks transfer quantum state by teleportation. Existing research focuses on maximal entangled pairs. In this paper, we analyse the distributed wireless quantum communication networks with partially entangled pairs. A quantum routing scheme with multi-hop teleportation is proposed. With the proposed scheme, is not necessary for the quantum path to be consistent with the classical path. The quantum path and its associated classical path are established in a distributed way. Direct multi-hop teleportation is conducted on the selected path to transfer a quantum state from the source to the destination. Based on the feature of multi-hop teleportation using partially entangled pairs, if the node number of the quantum path is even, the destination node will add another teleportation at itself. We simulated the performance of distributed wireless quantum communication networks with a partially entangled state. The probability of transferring the quantum state successfully is statistically analyzed. Our work shows that multi-hop teleportation on distributed wireless quantum networks with partially entangled pairs is feasible.

Adaptive swarm-based routing in communication networks

Swarm intelligence inspired by the social behavior of ants boasts a number of attractive features, including adaptation, robustness and distributed, decentralized nature, which are well suited for routing in modern communication networks. This paper describes an adaptive swarm-based routing algorithm that increases convergence speed, reduces routing instabilities and oscillations by using a novel variation of reinforcement learning and a technique called momentum.Experiment on the dynamic network showed that adaptive swarm-based routing learns the optimum routing in terms of convergence speed and average packet latency.

AFAR:adaptive fuzzy ant-based routing for communication networks

We propose a novel approach called adaptive fuzzy ant-based routing (AFAR), where a group of intelligent agents (or ants) builds paths between a pair of nodes, exploring the network concurrently and exchanging obtained information to up-date the routing tables. Routing decisions can be made by the fuzzy logic technique based on local information about the current network state and the knowledge constructed by a previous set of behaviors of other agents. The fuzzy logic technique allows multiple constraints such as path delay and path utilization to be considered in a simple and intuitive way. Simulation tests show that AFAR outperforms OSPF, AntNet and ASR, three of the currently most important state-of-the-art algorithms, in terms of end-to-end delay, packet delivery, and packet drop ratio. AFAR is a promising alternative for routing of data in next generation networks.

Performance comparison of multicast routing protocols based on NS-2

The electronic system in a comprehensive shipboard has a extremely wide bandwidth. It supports synchronized and asynchronous data transmission, muhimedia correspondence, and videophone conferencing. In order to guarantee the security and correspondent real time of the communication, choosing a multicast routing protocol based on different applications is a key problem in terms of the complexity of the system. A simulation model was first designed for existing multicast routing protocols in NS-2 and analysis was performed on their corresponding application environments. The experiments proved that PIM-DM based on the shortest-path tree protocol is suitable for communication in the field of comprehensive shipboard. Further work that is necessary is also discussed.

Use of wireless system in healthcare for developing countries

Healthcare is one of the major applications of wireless systems that possess crucial issues. Specifically developing countries require a tow cost and reliable network with efficient protocols. The most challenging concern of Body Area Network （BAN） is heterogeneity, which requires fairness with reliability among all the network nodes. Solutions proposed for these networks either do not provide fair packet transmission or consume high energy and introduce delays. In this paper, we propose a cross layer protocol for healthcare applications meeting the requirements and challenges of the heterogeneous BAN. The protocol is also feasible for developing countries as it can be implemented over existing wireless infrastructure and provides high network reliability with energy efficiency through cooperation and adaptability. Results show that the proposed scheme improves reliability, throughput, Packet Delivery Ratio （PDR）, and energy consumption for scalable and mobile networks over conventional BAN protocols.

Routing and scheduling co-design for holistic software-defined deterministic network

As a result of the growing complexity of industrial Internet applications,traditional hardware-based network designs are encountering challenges in terms of programmability and dynamic adaptability as they struggle to meet the real-time,high-reliability transmission requirements for the vast quantities of data generated in industrial environments.This paper proposes a holistic software-defined deterministic network(HSDDN)design solution.This solution uses a centralized controller to implement a comprehensive software definition,ranging from the network layer down to the physical layer.Within the wireless access domain,we decouple the standard radio-frequency modules from baseband processing to realize a software-defined physical layer,which then allows us to adjust the data transmission cycles and tag the trigger rates to meet demand for low-power,high-concurrency transmission.Within the wired network domain,we integrate software-defined networking with time-sensitive networking and propose a coordinated design strategy to address routing and the deterministic scheduling problem.We define a set of constraints to ensure collaborative transmission of the periodic and aperiodic data flows.To guarantee load balancing across all paths and timeslots,we introduce the Jain’s fairness index as the optimization objective and then construct a nondeterministic polynomial-time(NP)-hard joint optimization problem.Furthermore,an algorithm called Tabu search for routing and scheduling with dual-stages(TSRS-DS)is proposed.Simulation experiments demonstrate the effectiveness of the proposed HSDDN architecture.

无线传感网LEACH协议的改进方法

为解决传统LEACH(Low Energy Adaptive Clustering Hierarchy)协议网络节点能量消耗高、存活数量少和生存寿命短等问题,提出了一种LEACH-AD改进方案。该算法引入最优簇头比率P值、加入距离因子、剩余能量因子和密度因子等因素更新的阈值公式进行分簇以及簇间的传输。实验结果表明,改进后的LEACH-AD协议在首个死亡节点、10%死亡节点以及全部死亡节点分别比原LEACH协议延长138轮、195轮、628轮。在能量消耗方面比原LEACH协议多持续了631轮,改进后的路由协议减少了网络节点的能量消耗量,从而有效延长了无线网络与传感节点的工作时间,这对无线监测系统的研究与开发意义重大。

An Adaptive Routing Algorithm for Integrated Information Networks

The integrated information network is a large capacity information network that integrates various communication platforms on the ground, at sea, in the air and in the deep air through the inter-satellite and satellite-ground links to acquire information accurately, process it quickly, and transmit it efficiently. The satellite communication, as an important part of integrated information networks, is one of main approaches to acquire, process and distribute communication information and resources. In this paper, based on current researches of the satellite communication network, we put forward a 3-layer satellite communication network model based on the Software Defined Network (SDN). Meanwhile, to improve current routing policies of the Low Earth Orbit (LEO) satellite communication network, we put forward an Adaptive Routing Algorithm (ARA) to sustain the shortest satellite communication link. Experiment results show that the proposed method can effectively reduce link distance and communication delay, and realize adaptive path planning.

Immune Algorithm for Solving the Optimization Problems of Computer Communication Networks

The basic problem in optimizing communication networks is to assign a proper circuit for each origin destination pair in networks so as to minimize the average network delay, and the network optimal route selection model is a multi constrained 0 1 nonlinear programming problem. In this paper, a new stochastic optimization algorithm, Immune Algorithm, is applied to solve the optimization problem in communication networks. And the backbone network vBNS is chosen to illustrate the technique of evaluating delay in a virtual network. At last, IA is compared with the optimization method in communication networks based on Genetic Algorithm, and the result shows that IA is better than GA in global optimum finding.

An Improved Immune Genetic Algorithm for Solving the Optimization Problems of Computer Communication Networks

Obtaining the average delay and selecting a route in a communication networkare multi-constrained nonlinear optimization problems . In this paper, based on the immune geneticalgorithm, a new fuzzy self-adaptive mutation operator and a new upside-down code operator areproposed. This improved IGA is further successfully applied to solve optimal problems of computercommunication nets.

A Survey on Underwater Acoustic Sensor Networks: Perspectives on Protocol Design for Signaling, MAC and Routing

Underwater acoustic sensor networks (UASNs) are often used for environmental and industrial sensing in undersea/ocean space, therefore, these networks are also named underwater wireless sensor networks (UWSNs). Underwater sensor networks are different from other sensor networks due to the acoustic channel used in their physical layer, thus we should discuss about the specific features of these underwater networks such as acoustic channel modeling and protocol design for different layers of open system interconnection (OSI) model. Each node of these networks as a sensor needs to exchange data with other nodes;however, complexity of the acoustic channel makes some challenges in practice, especially when we are designing the network protocols. Therefore based on the mentioned cases, we are going to review general issues of the design of an UASN in this paper. In this regard, we firstly describe the network architecture for a typical 3D UASN, then we review the characteristics of the acoustic channel and the corresponding challenges of it and finally, we discuss about the different layers e.g. MAC protocols, routing protocols, and signal processing for the application layer of UASNs.

A Routing Algorithm in WDM Mesh Networks with Grooming Capacities

Most of the work in traffic grooming has been in the area of providing efficient network designs in Wavelength division multiplexing （WDM）. The objective of these traffic grooming algorithms is to reduce the cost of overall networks. In this paper, a routing algorithm based on transiently chaotic neural network is proposed to solve the problem in WDM logical topology. The objectives of the routing algorithm are ac commodating all traffic requirements and using less network resource. The simulation shows that the proposed algorithm is efficient in the routing selection, meanwhile the algorithm can use less network resource.

号码可携性NP(Number Portability)业务的研究

介绍“号码可携性NP(Number Portability)”业务的含义、几种可能的实施方法及其有关的问题。

Angle-Based Interference-Aware Routing Algorithm for Multicast over Wireless D2D Networks

Wireless devicetodevice （D2D） communications sharing the spectrum of cellular networks is important for improving spec trum efficiency. Furthermore, introducing multicast and multi hop communications to D2D networks can expand D2D ser vice functions. In this paper, we propose an anglebased inter ferenceaware routing algorithm for D2D multicast communica tions. This algorithm reuses the uplink cellular spectrum. Our proposed algorithm aims to reduce the outage probability and minimize the average hop count over all multicast destina tions （i.e., multicast receivers）, while limiting interference to cellular users to a tolerable level. In particular, our algorithm integrates two design principles for hopbyhop route selec tion. First, we minimize the distance ratio of the candidateto destination link to the candidatetobasestation link, such that the selected route advances closer to a subset of multi cast receivers. Second, we design the anglethreshold based merging strategy to divide multicast receivers into subsets with geographically close destinations. By applying the two principles for selection of each hop and further deriving an adaptive powerallocation strategy, the message can be more effieiently delivered to destinations with fewer branches when constructing the multicast tree. This means fewer duplicated data transmissions. Analyses and simulations are presented to show the impact of system parameters on the routing perfor mances. Simulation results also demonstrate the superiority of our algorithm over baseline schemes in terms of outage proba bility and average hop count.

An Improved AOMDV Routing Protocol for Airspace Communication Network

The airspace communication network based on spacecraft has a wide range of applications in regional information enhancement and emergency communication. In this paper, a routing algorithm for congestion degree detection of multipath routing (CD_AOMDV) is proposed. The method of combining the whole congestion degree detection and local congestion degree detection before service initiation is adopted. Timely and accurate judgment of the congestion degree reduced the loss rate of the hot nodes, so the average packet loss rate reduced. Simulation results show that compared with the traditional AOMDV protocol, the CD_AOMDV proposed in this paper has reduced the packet loss and improved delay performance, which is more suitable for the airspace communication network.