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.

A Multi-Token Sector Antenna Neighbor Discovery Protocol for Directional Ad Hoc Networks

In this paper,we propose a Multi-token Sector Antenna Neighbor Discovery(M-SAND)protocol to enhance the efficiency of neighbor discovery in asynchronous directional ad hoc networks.The central concept of our work involves maintaining multiple tokens across the network.To prevent mutual interference among multi-token holders,we introduce the time and space non-interference theorems.Furthermore,we propose a master-slave strategy between tokens.When the master token holder(MTH)performs the neighbor discovery,it decides which 1-hop neighbor is the next MTH and which 2-hop neighbors can be the new slave token holders(STHs).Using this approach,the MTH and multiple STHs can simultaneously discover their neighbors without causing interference with each other.Building on this foundation,we provide a comprehensive procedure for the M-SAND protocol.We also conduct theoretical analyses on the maximum number of STHs and the lower bound of multi-token generation probability.Finally,simulation results demonstrate the time efficiency of the M-SAND protocol.When compared to the QSAND protocol,which uses only one token,the total neighbor discovery time is reduced by 28% when 6beams and 112 nodes are employed.

A CSMA/CA based MAC protocol for hybrid Power-line/Visible-light communication networks:Design and analysis

Hybrid Power-line/Visible-light Communication(HPVC)network has been one of the most promising Cooperative Communication(CC)technologies for constructing Smart Home due to its superior communication reliability and hardware efficiency.Current research on HPVC networks focuses on the performance analysis and optimization of the Physical(PHY)layer,where the Power Line Communication(PLC)component only serves as the backbone to provide power to light Emitting Diode(LED)devices.So designing a Media Access Control(MAC)protocol remains a great challenge because it allows both PLC and Visible Light Communication(VLC)components to operate data transmission,i.e.,to achieve a true HPVC network CC.To solve this problem,we propose a new HPC network MAC protocol(HPVC MAC)based on Carrier Sense Multiple Access/Collision Avoidance(CSMA/CA)by combining IEEE 802.15.7 and IEEE 1901 standards.Firstly,we add an Additional Assistance(AA)layer to provide the channel selection strategies for sensor stations,so that they can complete data transmission on the selected channel via the specified CSMA/CA mechanism,respectively.Based on this,we give a detailed working principle of the HPVC MAC,followed by the construction of a joint analytical model for mathematicalmathematical validation of the HPVC MAC.In the modeling process,the impacts of PHY layer settings(including channel fading types and additive noise feature),CSMA/CA mechanisms of 802.15.7 and 1901,and practical configurations(such as traffic rate,transit buffer size)are comprehensively taken into consideration.Moreover,we prove the proposed analytical model has the solvability.Finally,through extensive simulations,we characterize the HPVC MAC performance under different system parameters and verify the correctness of the corresponding analytical model with an average error rate of 4.62%between the simulation and analytical results.

Priority Based Energy Efficient MAC Protocol by Varying Data Ratefor Wireless Body Area Network

Wireless Body Area Network(WBAN)is a cutting-edge technology that is being used in healthcare applications to monitor critical events in the human body.WBAN is a collection of in-body and on-body sensors that monitor human physical parameters such as temperature,blood pressure,pulse rate,oxygen level,body motion,and so on.They sense the data and communicate it to the Body Area Network(BAN)Coordinator.The main challenge for the WBAN is energy consumption.These issues can be addressed by implementing an effective Medium Access Control(MAC)protocol that reduces energy consumption and increases network lifetime.The purpose of the study is to minimize the energy consumption and minimize the delay using IEEE 802.15.4 standard.In our proposed work,if any critical events have occurred the proposed work is to classify and prioritize the data.We gave priority to the highly critical data to get the Guarantee Tine Slots(GTS)in IEEE 802.15.4 standard superframe to achieve greater energy efficiency.The proposed MAC provides higher data rates for critical data based on the history and current condition and also provides the best reliable service to high critical data and critical data by predicting node similarity.As an outcome,we proposed a MAC protocol for Variable Data Rates(MVDR).When compared to existing MAC protocols,the MVDR performed very well with low energy intake,less interruption,and an enhanced packet-sharing ratio.

LOA-RPL:Novel Energy-Efficient Routing Protocol for the Internet of Things Using Lion Optimization Algorithm to Maximize Network Lifetime

Energy conservation is a significant task in the Internet of Things(IoT)because IoT involves highly resource-constrained devices.Clustering is an effective technique for saving energy by reducing duplicate data.In a clustering protocol,the selection of a cluster head(CH)plays a key role in prolonging the lifetime of a network.However,most cluster-based protocols,including routing protocols for low-power and lossy networks(RPLs),have used fuzzy logic and probabilistic approaches to select the CH node.Consequently,early battery depletion is produced near the sink.To overcome this issue,a lion optimization algorithm(LOA)for selecting CH in RPL is proposed in this study.LOA-RPL comprises three processes:cluster formation,CH selection,and route establishment.A cluster is formed using the Euclidean distance.CH selection is performed using LOA.Route establishment is implemented using residual energy information.An extensive simulation is conducted in the network simulator ns-3 on various parameters,such as network lifetime,power consumption,packet delivery ratio(PDR),and throughput.The performance of LOA-RPL is also compared with those of RPL,fuzzy rule-based energyefficient clustering and immune-inspired routing(FEEC-IIR),and the routing scheme for IoT that uses shuffled frog-leaping optimization algorithm(RISARPL).The performance evaluation metrics used in this study are network lifetime,power consumption,PDR,and throughput.The proposed LOARPL increases network lifetime by 20%and PDR by 5%–10%compared with RPL,FEEC-IIR,and RISA-RPL.LOA-RPL is also highly energy-efficient compared with other similar routing protocols.

A Transport Protocol and Its Formal Description for Local Networks

This paper discusses a transport protocol and its formal description techniques for local network. The transport layer function, the transport services and a transport protocol design in a local network architecture model are presented. A transport protocol specification using the finite state automata (FSA) is given. The correctness of the protocol is verified by using the reachability tree technique with respect to the protocol properties of completeness, deadlock and livelock freeness, termination and reachability.

Mathematical Model Validation of Search Protocols in MP2P Networks

Broadcasting is a basic technique in Mobile ad-hoc network(MANET),and it refers to sending a packet from one node to every other node within the transmission range.Flooding is a type of broadcast where the received packet is retransmitted once by every node.The naive flooding technique,floods the network with query messages,while the random walk technique operates by contacting the subsets of every node’s neighbors at each step,thereby restricting the search space.One of the key challenges in an ad-hoc network is the resource or content discovery problem which is about locating the queried resource.Many earlier works have mainly focused on the simulation-based analysis of flooding,and its variants under a wired network.Although,there have been some empirical studies in peer-to-peer(P2P)networks,the analytical results are still lacking,especially in the context of P2P systems running over MANET.In this paper,we describe how P2P resource discovery protocols perform badly over MANETs.To address the limitations,we propose a new protocol named ABRW(Address Broadcast Random Walk),which is a lightweight search approach,designed considering the underlay topology aimed to better suit the unstructured architecture.We provide the mathematical model,measuring the performance of our proposed search scheme with different widely popular benchmarked search techniques.Further,we also derive three relevant search performance metrics,i.e.,mean no.of steps needed to find a resource,the probability of finding a resource,and the mean no.of message overhead.We validated the analytical expressions through simulations.The simulation results closely matched with our analyticalmodel,justifying our findings.Our proposed search algorithm under such highly dynamic self-evolving networks performed better,as it reduced the search latency,decreased the overall message overhead,and still equally had a good success rate.

Practical network coding-aware routing protocol for multi-hop wireless networks

Network coding has been considered as one of the effective strategies that improve the throughput of multi- hop wireless networks. In order to effectively apply network coding techniques to the real multi-hop wireless networks, a practical network coding aware routing protocol is proposed in this paper, for unicast sessions in multi- hop wireless networks. The protocol is based on a novel routing metric design that captures the characteristics of network coding and unicast sessions. To ensure the novel routing mettle can operate with practical and widely available path calculation algorithms, a unique mapping process is used to map a real wireless network to a virtual network. The mapping process ensures that the paths with the biggest coding opportunities will be selected by commonly used path calculation algorithms. Simulation results show that the proposed routing protocol is effective to improve the network throughput.

Performance Evaluation of an Internet Protocol Security (IPSec) Based Multiprotocol Label Switching (MPLS) Virtual Private Network

This paper evaluates the performance of Internet Protocol Security (IPSec) based Multiprotocol Label Switching (MPLS) virtual private network (VPN) in a small to medium sized organization. The demand for security in data networks has been increasing owing to the high cyber attacks and potential risks associated with networks spread over distant geographical locations. The MPLS networks ride on the public network backbone that is porous and highly susceptible to attacks and so the need for reliable security mechanisms to be part of the deployment plan. The evaluation criteria concentrated on Voice over Internet Protocol (VoIP) and Video conferencing with keen interest in jitter, end to end delivery and general data flow. This study used both structured questionnaire and observation methods. The structured questionnaire was administered to a group of 70 VPN users in a company. This provided the study with precise responses. The observation method was used in data simulations using OPNET Version 14.5 Simulation software. The results show that the IPSec features increase the size of data packets by approximately 9.98% translating into approximately 90.02% effectiveness. The tests showed that the performance metrics are all well within the recommended standards. The IPSec Based MPLS Virtual private network is more stable and secure than one without IPSec.

A Dynamic Resource-Aware Routing Protocol in Resource-Constrained Opportunistic Networks

Recently,Opportunistic Networks(OppNets)are considered to be one of the most attractive developments of Mobile Ad Hoc Networks that have arisen thanks to the development of intelligent devices.OppNets are characterized by a rough and dynamic topology as well as unpredictable contacts and contact times.Data is forwarded and stored in intermediate nodes until the next opportunity occurs.Therefore,achieving a high delivery ratio in OppNets is a challenging issue.It is imperative that any routing protocol use network resources,as far as they are available,in order to achieve higher network performance.In this article,we introduce the Resource-Aware Routing(ReAR)protocol which dynamically controls the buffer usage with the aim of balancing the load in resource-constrained,stateless and non-social OppNets.The ReAR protocol invokes our recently introduced mutual informationbased weighting approach to estimate the impact of the buffer size on the network performance and ultimately to regulate the buffer consumption in real time.The proposed routing protocol is proofed conceptually and simulated using the Opportunistic Network Environment simulator.Experiments show that the ReAR protocol outperforms a set of well-known routing protocols such as EBR,Epidemic MaxProp,energy-aware Spray and Wait and energy-aware PRoPHETin terms of message delivery ratio and overhead ratio.

Light-Weight Simple Network Management Protocol in Wireless Sensor Networks

A Light-Weight Simple Network Management Protocol (LW-SNMP) for the wireless sensor network is proposed, which is a kind of hierarchical network management system including a sink manager, cluster proxies, and node agents. Considering the resource limitations on the sensor nodes, we design new management messages, new data types and new management information base completely. The management messages between the cluster proxy and node agents are delivered as normal data packets. The experiment results show that LW-SNMP can meet the management demands in the resource-limited wireless sensor networks and has a good performance in stability, effectiveness of memory, extensibility than the traditional Simple Network Management Protocol (SNMP).

Network Evaluation and Protocol Deployment for Complex Deep-Space Networks Based on DTN

Previous research on deep-space networks based on delay-tolerant networking(DTN)has mainly focused on the performance of DTN protocols in simple networks;hence,research on complex networks is lacking.In this paper,we focus on network evaluation and protocol deployment for complex DTNbased deep-space networks and apply the results to a novel complex deep-space network based on the Universal Interplanetary Communication Network(UNICON-CDSN)proposed by the National Space Science Center(NSSC)for simulation and verification.A network evaluation method based on network capacity and memory analysis is proposed.Based on a performance comparison between the Licklider Transmission Protocol(LTP)and the Transmission Control Protocol(TCP)with the Bundle Protocol(BP)in various communication scenarios,a transport protocol configuration proposal is developed and used to construct an LTP deployment scheme for UNICON-CDSN.For the LTP deployment scheme,a theoretical model of file delivery time over complex deep-space networks is built.A network evaluation with the method proposed in this paper proves that UNICONCDSN satisfies the requirements for the 2020 Mars exploration mission Curiosity.Moreover,simulation results from a universal space communication network testbed(USCNT)designed by us show that the LTP deployment scheme is suitable for UNICON-CDSN.

An Energy Based Dynamic AODV Routing Protocol in Wireless Ad Hoc Networks

In recent years,with the rapid development of the Internet and wireless communication technology,wireless Ad hoc networks have received more attention.Due to the limited transmission range and energy of nodes in Ad hoc networks,it is important to establish a reliable and energy-balanced transmission path in Ad hoc networks.This paper proposes an energy-based dynamic routing protocol based on the existing AODV routing protocol,which has the following two aspects of improvement:(1)In the route discovery process,a node selects a suitable route from the minimum energy consumption route and the energy-balanced route designed in this paper according to a“Mark”bit that representing remaining energy of a node.(2)Based on(1),a route interruption update strategy was proposed to restart the route discovery process when node energy was used excessively.Simulation results demonstrate that compared with AODV and other existing routing protocols,proposed algorithm can reduce network energy consumption and balance node energy,thus extending the network lifetime.

Self-organization of Reconfigurable Protocol Stack for Networked Control Systems

In networked control systems （NCS）,the control performance depends on not only the control algorithm but also the communication protocol stack.The performance degradation introduced by the heterogeneous and dynamic communication environment has intensified the need for the reconfigurable protocol stack.In this paper,a novel architecture for the reconfigurable protocol stack is proposed,which is a unified specification of the protocol components and service interfaces supporting both static and dynamic reconfiguration for existing industrial communication standards.Within the architecture,a triple-level self-organization structure is designed to manage the dynamic reconfiguration procedure based on information exchanges inside and outside the protocol stack.Especially,the protocol stack can be self-adaptive to various environment and system requirements through the reconfiguration of working mode,routing and scheduling table.Finally,the study on the protocol of dynamic address management is conducted for the system of controller area network （CAN）.The results show the efficiency of our self-organizing architecture for the implementation of a reconfigurable protocol stack.

A Practical Quantum Network Coding Protocol Based on Non-Maximally Entangled State

In many earlier works,perfect quantum state transmission over the butterfly network can be achieved via quantum network coding protocols with the assist of maximally entangled states.However,in actual quantum networks,a maximally entangled state as auxiliary resource is hard to be obtained or easily turned into a non-maximally entangled state subject to all kinds of environmental noises.Therefore,we propose a more practical quantum network coding scheme with the assist of non-maximally entangled states.In this paper,a practical quantum network coding protocol over grail network is proposed,in which the non-maximally entangled resource is assisted and even the desired quantum state can be perfectly transmitted.The achievable rate region,security and practicability of the proposed protocol are discussed and analyzed.This practical quantum network coding protocol proposed over the grail network can be regarded as a useful attempt to help move the theory of quantum network coding towards practicability.

A reliable and high throughput hybrid routing protocol for vehicular ad-hoc network

Due to highly dynamic topology caused by fast moving nodes the Vehicular ad-hoc network (VANET) results in the existence of transient communication links, which degrade the performance of developed protocols. Established routes frequently become stale, and existing communication flows are interrupted, incurring delay and additional overhead. In this paper we propose a novel hybrid routing protocol, which is the combined between of the table-driven routing and on-demand routing in VANET. It makes fast convergence in routing process, minimal drop links, making more reliable links, and adaptive with changing of VANET topology. With neighbor table is updated instantaneously, and using strong neighbor for routing process makes route discovery process start whenever it received requirement, and through using route mechanism appropriately it reduces significantly route overhead at each node. The simulation results illustrate the outstanding properties of our proposed routing protocol.

Analysis and Improvement on Routing Protocols for Wireless Sensor Networks

Routing protocols are perceived to be growing hotspots and required to devote more time and work to studying it. Research on routing protocols of wireless sensor networks is significantly important to accurately guide the application. Theoretical analysis and comparison are one of the key steps in the protocol research. Restricted by irreversible factors of power and others, lifetime of wireless sensor networks is very short. In this paper, we analyze and compare the characteristics and application fields of existing protocols. On the basis of that, this paper mainly proposes an improved directed diffusion exploring the phase of reinforcing path, which chooses the way to strengthen the path after evaluating the critical factors. It was determined by simulation that improved directed diffusion has a higher transmission rate, and it satisfies the requirements, which balancing the energy consumption and prolonging the lifetime.

Multihop Deterministic Energy Efficient Routing Protocol for Wireless Sensor Networks MDR

The inception of Wireless Sensor Networks (WSN) has brought convenience into many lives with uninterrupted wireless network. The nodes that transmit data consist of heterogeneous and battery equipped sensor nodes (SNs) that are deployed randomly for network surveillance. To manage the random deployment of nodes, clustering algorithms are used with efficient routing protocols. This results in aggregation and dropping of redundant data packets that enables flawless data transmission from cluster nodes to Base Station (BS) via Cluster Heads (CHs). In this paper, a dynamic and multi-hop clustering and routing protocol for thorough behavior analysis is proposed, taking distance and energy into consideration. This forms a smooth routing path from the cluster nodes, CHs, Sub-CHs to the BS. On comparing proposed process with the existing system, experimental analysis shows a significant enhancement in the performance of network lifetime, with improved data aggregation, throughput, as the protocol showing deterministic behavior while traversing the network for data transmission, we name this protocol as Multi-hop Deterministic energy efficient Routing protocol (MDR).

Design of Out-of-Band Protocols to Transmit UHDTV Contents in the CATV Network

The goal of an UHDTV is to broadcast digital video contents which is 16 times the pixel resolution of HDTV. As the resolution is increased, the UHDTV requires a transmission technology to support very high data transfer rate. In this paper, we propose two out-of-band protocols to transmit UHDTV contents in a CATV network: an OOB-based protocol and a DSG-based protocol. The former may be a short term solution which is well suitable for a traditional CATV network and the letter may be a long term solution which is adoptable for a CATV network equipped with DOCSIS functionalities. In order to transfer 200 Mbps UHDTV contents, proposed protocols use a channel bonding mechanism which combines several QAM channels. We propose CATV network architectures to support an UHDTV service with a channel bonding mechanism, and design the format of messages to share the information of bonded channels between a headend and a STB. We develop an OPNET simulator and ascertain successful transmission of UHDTV contents.

Adaptive Multi-Cost Routing Protocol to Enhance Lifetime for Wireless Body Area Network

Wireless Body Area Network(WBAN)technologies are emerging with extensive applications in several domains.Health is a fascinating domain of WBAN for smart monitoring of a patient’s condition.An important factor to consider in WBAN is a node’s lifetime.Improving the lifetime of nodes is critical to address many issues,such as utility and reliability.Existing routing protocols have addressed the energy conservation problem but considered only a few parameters,thus affecting their performance.Moreover,most of the existing schemes did not consider traffic prioritization which is critical in WBANs.In this paper,an adaptive multi-cost routing protocol is proposed with a multi-objective cost function considering minimum distance from sink,temperature of sensor nodes,priority of sensed data,and maximum residual energy on sensor nodes.The performance of the proposed protocol is compared with the existing schemes for the parameters:network lifetime,stability period,throughput,energy consumption,and path loss.It is evident from the obtained results that the proposed protocol improves network lifetime and stability period by 30%and 15%,respectively,as well as outperforms the existing protocols in terms of throughput,energy consumption,and path loss.