AODV routing overhead analysis based on link failure probability in MANET

This article puts forward an Ad-hoc on-demand distance vector routing （AODV） routing overhead analysis method in mobile Ad-hoc network （MANET）.Although multiple routing protocols have been proposed to improve the performance,scarcely any paper analyzed the routing overhead caused by routing setup and maintenance processes in mathematical way.Routing overhead consumes part of network resources and limits the supported traffic in the network.For on-demand routing protocols like AODV,the routing overhead depends on the link failure probability to a great extent.This article analyzes the collision probability caused by hidden-node problem and the impact on link failure probability.In chain and rectangle scenarios,it presents a mathematical analysis of the theoretical routing overhead of AODV protocol based on link failure probability.Simulations on OPNET 14.5 platform match well with the theoretical derivation which confirms the effectiveness of the analysis method.

Mobility Support for Content Source in Content-Centric Networking

Content-centric networking(CCN) is rising to solve the problems suffered by traditional networks,especially in terms of content delivery.One of the critical issues for basic CCN is supporting mobility.Handoff of Mobile Content Source(MCS) will result in a large scale routing update,which generates huge amount of routing overhead and leads to service interruption.Most of the existing CCN mobility mechanisms are transplanted from the IP mobility solutions,which are unnaturally integrated with CCN.Different from previous works,a mobility strategy from the perspective of CCN architecture is proposed to support the handoff of MCS in this paper.Especially,we define the critical network routers that can limit the routing update scale effectively when MCS handoff is conducted.Based on the defined critical network routers,the proposed scheme can provide lower routing update overhead,faster routing convergence and shorter service interruption time.Finally,series of simulations are conducted to validate the effectiveness of our proposed scheme.

Vector Segment Routing for Large-Scale Multilayer Satellite Network

With the expansion of satellite constellation,routing techniques for small-scale satellite networks have problems in routing overhead and forwarding efficiency.This paper proposes a vector segment routing method for large-scale multi layer satellite networks.A vector forwarding path is built based on the location between the source and the destination.Data packets are forwarded along this vector path,shielding the influence of satellite motion on routing forwarding.Then,a dynamic route maintenance strategy is suggested.In a multi layer satellite network,the low-orbit satellites are in charge of computing the routing tables for one area,and the routing paths are dynamically adjusted in the area in accordance with the network.The medium-orbit satellites maintain the connectivity of vector paths in multiple segmented areas.The forwarding mode based on the source and destination location improves the forwarding efficiency,and the segmented route maintenance mode decreases the routing overhead.The simulation results indicate that vector segment routing has significant performance advantages in end-to-end delay,packet loss rate,and throughput in a multi layer satellite network.We also simulate the impact of routing table update mechanism on network performance and overhead and give the performance of segmented vector routing in multi layer low-orbit satellite networks.

Semi Markov process inspired selfish aware co-operative scheme for wireless sensor networks(SMPISCS)

In Wireless Sensor Network(WSN),energy and packet forwarding tendencies of sensor nodes plays a potential role in ensuring a maximum degree of co-operation under data delivery.This quantified level of co-operation signifies the performance of the network in terms of increased throughput,packet delivery rate and decreased delay depending on the data being aggregated and level of control overhead.The performance of a sensor network is highly inclined by the selfish behaving nature of sensor nodes that gets revealed when the residual energy ranges below a bearable level of activeness in packet forwarding.The selfish sensor node needs to be identified in future through reliable forecasting mechanism for improving the lifetime and packet delivery rate.Semi Markov Process Inspired Selfish aware Co-operative Scheme(SMPISCS)is propounded for making an attempt to mitigate selfish nodes for prolonging the lifetime of the network and balancing energy consumptions of the network.SMPISCS model provides a kind of sensor node’s behavior for quantifying and future forecasting the probability with which the node could turn into selfish.Simulation experiments are carried out through Network Simulator 2 and the performance are analyzed based on varying the number of selfish sensor nodes,number of sensor nodes and range of detection threshold.

Semi Markov process inspired selfish aware co-operative scheme for wireless sensor networks(SMPISCS)

In Wireless Sensor Network(WSN),energy and packet forwarding tendencies of sensor nodes plays a potential role in ensuring a maximum degree of co-operation under data delivery.This quantified level of co-operation signifies the performance of the network in terms of increased throughput,packet delivery rate and decreased delay depending on the data being aggregated and level of control overhead.The performance of a sensor network is highly inclined by the selfish behaving nature of sensor nodes that gets revealed when the residual energy ranges below a bearable level of activeness in packet forwarding.The selfish sensor node needs to be identified in future through reliable forecasting mechanism for improving the lifetime and packet delivery rate.Semi Markov Process Inspired Selfish aware Co-operative Scheme(SMPISCS)is propounded for making an attempt to mitigate selfish nodes for prolonging the lifetime of the network and balancing energy consumptions of the network.SMPISCS model provides a kind of sensor node’s behavior for quantifying and future forecasting the probability with which the node could turn into selfish.Simulation experiments are carried out through Network Simulator 2 and the performance are analyzed based on varying the number of selfish sensor nodes,number of sensor nodes and range of detection threshold.