计算一类有向网络可靠性的线性时间算法

该文使用的可靠性保护缩减的方法计算有向网络 ST可靠性 (存在从源点到汇点正常运行道路的概率 )是计算网络可靠性的常用方法之一 ,而且人们非常关心怎样的网络计算其可靠性存在线性时间算法 .作者提出了两类新的可靠性保护缩减——源桥缩减和惠斯通桥缩减和一类有向无圈网络 ,称之为 WST网络 ,该类网络是对以前的

Routing Protocol Based on Grover’s Searching Algorithm for Mobile Ad-hoc Networks

In Mobile Ad-hoc Networks (MANETs), routing protocols directly affect various indices of network Quality of Service (QoS), so they play an important role in network performance. To address the drawbacks associated with traditional routing protocols in MANETs, such as poor anti-fading performance and slow convergence rate, for basic Dynamic Source Routing (DSR), we propose a new routing model based on Grover's searching algorithm. With this new routing model, each node maintains a node vector function, and all the nodes can obtain a node probability vector using Grover's algorithm, and then select an optimal routing according to node probability. Simulation results show that compared with DSR, this new routing protocol can effectively extend the network lifetime, as well as reduce the network delay and the number of routing hops. It can also significantly improve the anti-jamming capability of the network.

Quantitative and qualitative correlation analysis of optimal route discovery for vehicular ad-hoc networks

Vehicular ad-hoc networks （VANETs） are a significant field in the intelligent transportation system （ITS） for improving road security. The interaction among the vehicles is enclosed under VANETs. Many experiments have been performed in the region of VANET improvement. A familiar challenge that occurs is obtaining various constrained quality of service （QoS） metrics. For resolving this issue, this study obtains a cost design for the vehicle routing issue by focusing on the QoS metrics such as collision, travel cost, awareness, and congestion. The awareness of QoS is fuzzified into a price design that comprises the entire cost of routing. As the genetic algorithm （GA） endures from the most significant challenges such as complexity, unassisted issues in mutation, detecting slow convergence, global maxima, multifaceted features under genetic coding, and better fitting, the currently established lion algorithm （LA） is employed. The computation is analyzed by deploying three well-known studies such as cost analysis, convergence analysis, and complexity investigations. A numerical analysis with quantitative outcome has also been studied based on the obtained correlation analysis among various cost functions. It is found that LA performs better than GA with a reduction in complexity and routing cost.

Performance Analysis under MAC Layer Misbehavior Attack in Mobile Ad-Hoc Networks

This work presents a multi-criteria analysis of the MAC （media access control） layer misbehavior of the IEEE （Institute of Electrical and Electronics Engineers） 802.11 standard, whose principle is to cheat at the protocol to increase the transmission rate by greedy nodes at the expense of the other honest nodes. In fact, IEEE 802.11 forces nodes for access to the channel to wait for a back off interval, randomly selected from a specified range, before initiating a transmission. Greedy nodes may wait for smaller back-off intervals than honest nodes, and then obtaining an unfair assignment. In the first of our works a state of art on the research on IEEE 802.11 MAC layer misbehavior are presented. Then the impact of this misbehavior at the reception is given, and we will generalize this impact on a large scale. An analysis of the correlation between the throughput and the inter-packets time is given. Afterwards, we will define a new metric for measuring the performance and capability of the network.

Least-mean-square routing with load-balancing for wireless ad hoc networks

Routing algorithm is a challenge for a mobile ad hoc network （MANET）, but current routing protocols for MANETs consider the path with minimum number of hops as the optimal path to a given destination. This strategy does not balance the traffic load over a MANET, and may result in some disadvantages such as creating congested area, depleting power faster and enlarging time delay in the nodes with heavy duties. In this paper, we propose a routing scheme that balances the load over the network by selecting a path based on its mean load-square, the proposed routing metric can reflect not only the load of the path, but also the load distribution along the path. Simulation results show effectiveness of this routing scheme on balancing the load over all nodes in the network.

Survivability modeling and analysis on 3D mobile ad-hoc networks

Most existing work on survivability in mobile ad-hoc networks(MANETs) focuses on two dimensional(2D) networks.However,many real applications run in three dimensional(3D) networks,e.g.,climate and ocean monitoring,and air defense systems.The impact on network survivability due to node behaviors was presented,and a quantitative analysis method on survivability was developed in 3D MANETs by modeling node behaviors and analyzing 3D network connectivity.Node behaviors were modeled by using a semi-Markov process.The node minimum degree of 3D MANETs was discussed.An effective approach to derive the survivability of k-connected networks was proposed through analyzing the connectivity of 3D MANETs caused by node misbehaviors,based on the model of node isolation.The quantitative analysis of node misbehaviors on the survivability in 3D MANETs is obtained through mathematical description,and the effectiveness and rationality of the proposed approach are verified through numerical analysis.The analytical results show that the effect from black and gray attack on network survivability is much severer than other misbehaviors.

A distributed on-demand bandwidth-constrained multicast routing protocol for wireless ad hoc networks

To meet the bandwidth requirement for the multicasting data flow in ad hoc networks, a distributed on- demand bandwidth-constrained multicast routing （BCMR） protocol for wireless ad hoc networks is proposed. With this protocol, the resource reservation table of each node will record the bandwidth requirements of data flows, which access itself, its neighbor nodes and hidden nodes, and every node calculates the remaining available bandwidth by deducting the bandwidth reserved in the resource reservation table from the total available bandwidth of the node. Moreover, the BCMR searches in a distributed manner for the paths with the shortest delay conditioned by the bandwidth constraint. Simulation results demonstrate the good performance of BCMR in terms of packet delivery reliability and the delay. BCMR can meet the requirements of real time communication and can be used in the multicast applications with low mobility in wireless ad hoc networks.

Performance enhancement of IEEE 802.11 distributed coordination function for MANET

The medium access control (MAC) issue was discussed in mobile Ad Hoc networks (MANETs). Based on the IEEE 802.11 MAC protocol, this paper proposed two schemes, the forward-packet-first (FPF) scheme based on the adaptive backoff contention window and multihop forward chain transmission by invitation (MFCTI) scheme. In the FPF scheme, the contention window was adjusted adaptively according to the traffic priority. Route information and the broadcast characteristic of radio were utilized in MFCTI scheme. The performance of these schemes was studied in multihop environments by simulations. The results showed that the proposed schemes could improve the network throughput, reduce the end-to-end average delay, and mitigate local congestion effectively. Another attractive feature was that the schemes could be implemented with minor modifications to the IEEE 802.11 MAC.

An Overview of Internet of Vehicles

The new era of the Internet of Things is driving the evolution of conventional Vehicle Ad-hoc Networks into the lnternet of Vehicles （IoV）. With the rapid development of computation and communication technologies, loV promises huge commercial interest and research value, thereby attracting a large number of companies and researchers. This paper proposes an abstract network model of the IoV, discusses the technologies required to create the IoV, presents different applications based on certain currently existing technologies, provides several open research challenges and describes essential future research in the area of loV.

Cooperative Spectrum Allocation with QoS Support in Cognitive Cooperative Vehicular Ad Hoc Networks

To solve the contradiction between the increasing demand of diverse vehicular wireless applications and the shortage of spectrum resource, a novel cognitive cooperative vehicular ad-hoc network （CC- VANET） framework is proposed in this paper. Firstly, we develop an adaptive cognitive spectrum sensing （ACSS） mechanism which can help to trigger and adjust the spectrum sensing window according to network traffic load status and communication quality. And then, Generalized Nash Bargaining SoLution （GNBS）, which can achieve a good tradeoff between efficiency and weighted fairness, is proposed to formulate the asymmetric inter- cell resource allocation. Finally, GNBS- Safety （GNBS-S） scheme is developed to enhance the Quality of Service （QoS） of safety applications, especially in the heavy load status, where the bandwidth demanded and supplied cannot be matched well. Furthermore, the primary user activity （PUA） which can cause rate loss to secondary users, is also considered to alleviate its influence to fairness. Simulation results indicate that the proposed CC-VANET scheme can greatly improve the spectrum efficiency and reduce the transmission delay and packet loss rate on the heavy contention status. And GNBS spectrum allocation scheme outperforms both the Max-rain and Max-rate schemes, and canenhance the communication reliability of safety service considerably in CC-VANET.

Optimal congestion control algorithm for ad hoc networks: Penalty function-based approach

In this paper, based on the inherent characteristic of the contention relation between flows in ad hoc networks, we introduce the notion of the link＇s interference set, extend the utility maximization problem representing congestion control in wireline networks to ad hoc networks, apply the penalty function approach and the subgradient method to solve this problem, and propose the congestion control algorithm Penalty function-based Optical Congestion Control （POCC） which is implemented in NS2- simulator. Specifically, each link transmits periodically the information on its congestion state to its interference set; the set ; the sermon at each source adjusts the transmission rate based on the optimal tradeoffbetween the utility value and the congestion level which the interference set of the links that this session goes though suffers from. MATLAB-based simulation results showed that POCC can approach the globally optimal solution. The NS2-based simulation results showed that POCC outperforms default TCP and ATCP to achieve efficient and fair resource allocation in ad hoc networks.

A Composite Service Provision Method Based on Novel Node Model in Mobile Ad Hoc Networks

Composite service provision in mobile ad hoc networks encounters great challenges and its success rate is not satisfactory because the nodes' locations are dynamic and the nodes maybe unavailable at any time.Composite service is built through the service composition.In mobile ad hoc networks,the factors influencing the success rate of service composition are mainly the number of nodes and the time spent for the composition.The node's failure probability is proportional to the length of time the node exist in the networks.In order to improve the success rate of service composition,we take several measures.First,we split the service requirement into several segments and cluster the nodes,so that the nodes' waiting time for service composition can be reduced.Second,we propose a new node model of "one node contains multiple services" in mobile ad hoc networks.Using this type of nodes model,the number of nodes required for service composition can be reduced.These means can increase the success rate of service composition.

Toward an RSU-unavailable Lightweight Certificateless Key Agreement Scheme for VANETs

Vehicle ad-hoc networks have developed rapidly these years,whose security and privacy issues are always concerned widely.In spite of a remarkable research on their security solutions,but in which there still lacks considerations on how to secure vehicleto-vehicle communications,particularly when infrastructure is unavailable.In this paper,we propose a lightweight certificateless and oneround key agreement scheme without pairing,and further prove the security of the proposed scheme in the random oracle model.The proposed scheme is expected to not only resist known attacks with less computation cost,but also as an efficient way to relieve the workload of vehicle-to-vehicle authentication,especially in no available infrastructure circumstance.A comprehensive evaluation,including security analysis,efficiency analysis and simulation evaluation,is presented to confirm the security and feasibility of the proposed scheme.

A Trusted Routing Protocol Based on GeoDTN＋Nav in VANET

Because the node of vehicular ad-hoc networks has the characteristics of high mobility and encounter temporary, a trust management between the nodes in the routing process becomes more difficult. To solve this problem, this paper proposes a new trusted routing protocol in VANET based on GeoDTN＋Nav by using trust management model of Bayesian and the three opportunistic routing forwarding models, which includes four steps of the routing initialization, the routing discovery, the trusted routing establishment and the routing deletion. The proposed protocol not only improves the security of routing, but also has the lower time complexity. Besides, experimental results and analysis show that the protocol has achieved good performance in the removal ratio of malicious nodes, correct reception ratio of packet and the message payload.

On service differentiation in mobile Ad Hoc networks

A network model is proposed to support service differentiation for mobile Ad Hoc networks by combining a fully distributed admission control approach and the DIFS based differentiation mechanism of IEEE802.11. It can provide different kinds of QoS (Quality of Service) for various applications. Admission controllers determine a committed bandwidth based on the reserved bandwidth of flows and the source utilization of networks. Packets are marked when entering into networks by markers according to the committed rate. By the mark in the packet header, intermediate nodes handle the received packets in different manners to provide applications with the QoS corresponding to the pre-negotiated profile. Extensive simulation experiments showed that the proposed mechanism can provide QoS guarantee to assured service traffic and increase the channel utilization of networks.

Clustering in mobile ad hoc network based on neural network

An on-demand distributed clustering algorithm based on neural network was proposed. The system parameters and the combined weight for each node were computed, and cluster-heads were chosen using the weighted clustering algorithm, then a training set was created and a neural network was trained. In this algorithm, several system parameters were taken into account, such as the ideal node-degree, the transmission power, the mobility and the battery power of the nodes. The algorithm can be used directly to test whether a node is a cluster-head or not. Moreover, the clusters recreation can be speeded up.

Molecular Biological Mechanisms of Yuan Zhi Powder in the Treatment of Alzheimer's Disease: an Analysis Based on Network Pharmacology

Objective To predict the main active ingredients,potential targets and molecular mechanisms of Yuan Zhi powder in treatment of dementia by using network pharmacology.Methods A database of chemical constituents of Yuan Zhi powder was constructed by using databases and literatures.Potential targets were predicted by reverse molecular docking,and then a component-target network was constructed.The target network of Alzheimer's disease(AD)was mapped and analyzed to obtain the“active ingredient-AD target”network.The key targets were screened through network analysis.Finally,the rationality of the prediction was analyzed by comparing with the target reported in the literatures.Results There were180chemical constituents acting on the AD target,and the targets included three key targets(cyclooxygenase-2,muscarinic acetylcholine receptor M1,and muscarinic acetylcholine receptor M2)and an important target(acetylcholine esterase).Alzheimer's disease may be treated by regulating the activity of acetylcholine receptors and the binding toβ-amyloid protein,and its biological process may be concentrated in the acetylcholine receptor signal pathway,negative regulation of synaptic transmission and so on.Conclusion The fact that Yuan Zhi powder can treat AD is consistent with the characteristics of multi-components-multitargets-multiple pathways of traditional Chinese medicine.The important targets obtained from network analysis have a large proportion in literature research,so network analysis have some rationality.

Secure and efficient multi-message and multi-receiver ID-based signcryption for rekeying in ad hoc networks

In this paper, the security technology of ad hoc networks is studied.To improve the previous multi-receiver signcryption schemes, an ID-based multi-message and multi-receiver signcryption scheme for rekeying in ad hoc networks is proposed.In this scheme, a sender can simultaneously signcrypt n messeges for n receivers, and a receiver can unsigncrypt the ciphertext to get his message with his own private key.An analysis of this scheme indicates that it achieves authenticity and confidentiality in the random oracle model while being of lower computation and communication overhead.Finally, for the application of our scheme in ad hoc, a threshold key updating protocol for ad hoc networks is given.

CROSS LAYER COORDINATED ENERGY SAVING STRATEGY IN MANET

Mobile Ad hoc NETwork (MANET) consists of a set of mobile hosts which can operate independently without infrastructure base stations. Energy saving is a critical issue for MANET since most mobile hosts will operate on battery powers. A cross layer coordinated framework for energy saving is proposed in this letter. On-demand power management, physical layer and medium access control layer dialogue based multi-packet reception, mobile agent based topology discovery and topology control based transmit power-aware and battery power-aware dynamic source routing are some of new ideas in this framework.

An effective connected dominating set based mobility management algorithm in MANETs

This paper proposes a connected dominating set (CDS) based mobility management algorithm, CMMA, to solve the problems of node entering, exiting and movement in mobile ad hoc networks (MANETs), which ensures the connectivity and efficiency of the CDS. Compared with Wu's algorithm, the proposed algorithm can make full use of present network conditions and involves fewer nodes. Also it has better performance with regard to the approximation factor, message complexity, and time complexity.