Showing 781 - 800 results of 1,116 for search 'Node average', query time: 0.10s Refine Results
  1. 781

    Efficient communication protocol of group negotiation in VANET by Mu HAN, Lei HUA, Liangmin WANG, Haobin JIANG, Shidian MA

    Published 2018-01-01
    “…An efficient communication protocol of group negotiation was proposed.The protocol adopted self-checking authentication in group to avoid the nodes sending certificates to the authentication center which improved the efficiency of identification.At the same time,the group establishment among nodes which through negotiation ensured the communication confidentiality and prevented the phenomenon of single-point failure.Besides,a group key transmission scheme was proposed to reduce the frequency of authentication for legal vehicles and improve the speed of joining in the group.At the end,theoretical analysis and simulation results demonstrate that the proposed protocol not only meets the security requirements of communication in VANET,but also shows much better performance than previous reported schemes on verification delay,transmission overhead and average delay.…”
    Get full text
    Article
  2. 782

    Hierarchical division-based cache storage strategy in content-centric networking by Jun LI, ming FENGZong, bo WUHai, Jiang ZHI

    Published 2016-01-01
    “…Experimental results indicate that the scheme has good performance in reducing access hops, increasing the average cache hit ratio and reducing the server load.…”
    Get full text
    Article
  3. 783

    An Improved Directional Broadcast Algorithm Based on Brownian Motion by Shibao Li, Linlin Lou, Yu Wang, Lu Sun, Li Hong

    Published 2014-07-01
    “…Simulation results indicate that DBB-AODV saves up to 20% of average routing overhead compared to the probabilistic protocol and about 80% of the blind flooding.…”
    Get full text
    Article
  4. 784

    A new data transmission mechanism between air vehicles by Dong Zhong, Yining Wang, Yi’an Zhu

    Published 2017-12-01
    “…High-speed nodes in Aeronautical Ad Hoc Network lead to dynamic changes in the network topology, thus increasing the frequency of re-routing and decreasing the performance of network communication. …”
    Get full text
    Article
  5. 785

    Energy management system for PV-based distributed generators in AC microgrids using an adapted JAYA optimizer to minimize operational costs, energy losses, and CO2 emissions by Nicolás Ignacio Labra-Cáceres, Luis Fernando Grisales-Noreña, Rubén Iván Bolaños, Jhony Andrés Guzmán-Henao, Oscar Danilo Montoya

    Published 2025-03-01
    “…The analysis was conducted using two test microgrids: one with 33 nodes operating in grid-connected mode and another with 27 nodes operating in islanded mode, utilizing generation and demand data from Medellín and Capurganá, Colombia. …”
    Get full text
    Article
  6. 786

    Data transmission algorithm of vehicle Ad Hoc network based on channel switching by Tiaojuan REN, Jinhao WAN, Yourong CHEN, Siyi LU, Banteng LIU

    Published 2018-10-01
    “…A data transmission algorithm of vehicle Ad Hoc network based on channel switching (DTA) was proposed.In the DTA,three network layers were considered,such as vehicle nodes,relay nodes and sink nodes.The vehicle nodes were classified by the information of vehicle’s driving direction.The vehicle nodes channel distribution and switching mechanism was proposed to reduce the interference of communication.Then a rapid transmission of relay nodes was proposed.A priority transmission method for emergency information was proposed to classify data with different queues and send data as their queues’ priority.Simulation results show that DTA can effectively achieve the rapid transmission of useful information,reduce unnecessary losses of energy,improve the data received rate of sink nodes,reduce the average hop number of data packets and improve coverage rate of data transmission.Under certain conditions,DTA is better than AODV and AODV-L algorithm,and is more suitable for vehicle driving environment of rapid change.…”
    Get full text
    Article
  7. 787
  8. 788

    A novel measuring system enables the noncontact real-time monitoring of very low net concentrations of plant-emitted ions in the air that may serve for plant ion homeostasis resear... by Toshiro Kawaguchi, Katsuya Mukae, Yoshihiro Takahashi, Hirofumi Ichiki

    Published 2025-08-01
    “…Consequently, the system precisely measured very low background ion charge-subtracted, net, and average net concentrations of the relevant concentrations and separately collected cation and anion aggregates. …”
    Get full text
    Article
  9. 789

    Epidemic Dynamics in Temporal Clustered Networks with Local-World Structure by Wenjun Jing, Juping Zhang, Xiaoqin Zhang

    Published 2023-01-01
    “…Furthermore, if the average degree is fixed, increasing the probability of triad formation p enlarges the clustering coefficient of a network, which reduces the initial growth rate and steady density of infectious nodes in the network. …”
    Get full text
    Article
  10. 790

    Outage probability for cooperative communication system with asymmetric channel by CHUAI Gang1, LIU Sheng1, WEN Xiao-jun1

    Published 2010-01-01
    “…And then the effect of the relay nodes location for the optimal power allocation ratio was studied based on the mathematical model. …”
    Get full text
    Article
  11. 791

    Where to Split in Hybrid Genetic Search for the Capacitated Vehicle Routing Problem by Lars Magnus Hvattum

    Published 2025-03-01
    “…A critical component of the search is a splitting procedure, where a solution encoded as a giant tour of nodes is optimally split into vehicle routes using dynamic programming. …”
    Get full text
    Article
  12. 792

    Tunable Energy-Efficient Approximate Circuits for Self-Powered AI and Autonomous Edge Computing Systems by Shubham Garg, Kanika Monga, Nitin Chaturvedi, S. Gurunarayanan

    Published 2025-01-01
    “…We validated and verified the design of the proposed approximate circuit at 7nm and 55nm technology nodes. The simulation result for the tunable compressor shows an average reduction of 49 % in energy consumption, and 30 % in delay compared to the state-of-the-art compressor. …”
    Get full text
    Article
  13. 793

    Chemotherapy For Elderly Patients With Gastric Cancer: Experience Of A Brazilian Center by Pedro Aguiar Jr., Gustavo Stock, Katia Barão, Nora Forones

    Published 2024-11-01
    “…Most of the patients (85.7%) were treated with combination regimens (4.6 cycles on average). Patients with better nutritional status had a non-statistically significant better tolerance to the treatment (p = 0.17). …”
    Get full text
    Article
  14. 794

    Influence diffusion model based on affinity of dynamic social network by Yun-fang CHEN, Tao XIA, Wei ZHANG, Jin LI

    Published 2016-10-01
    “…Recently,influence maximization model is a hot issue in the field of social network influence,while the traditional independent cascade model is generally based on static network with a fixed value of activation probability.DDIC model,which was a dynamic network influence diffusion model with attenuation factor was proposed.It calculated the activation probability between nodes via affinity propagation,and according with dynamic segmentation of social network time slice,calculation of influence on proliferation of next time slice with the current time slice of activation probability performance decay.The experimental results show that the nodes in the DDIC model have more chances to active the neighbor and the average probability of activing of the DDIC model is higher.Further experiments show that influence value via computing with affinity propagation can reflect the process of the spread model more accurately.…”
    Get full text
    Article
  15. 795

    Outage probability for cooperative communication system with asymmetric channel by CHUAI Gang1, LIU Sheng1, WEN Xiao-jun1

    Published 2010-01-01
    “…And then the effect of the relay nodes location for the optimal power allocation ratio was studied based on the mathematical model. …”
    Get full text
    Article
  16. 796

    Optimal coalition structure generation strategy in multi-task concurrent edge computing environment by Shuxu ZHAO, Ping WEI, Xiaolong WANG

    Published 2023-02-01
    “…A discrete recent past-position updating strategy based m-ary discrete particle swarm optimization (MDPSO-DRPPUS) algorithm was proposed for the problem of large search space and low efficiency when solving the optimal coalition structure.First, the coalition structure with index-based was coded.Then, the multi-objective optimization problem was transformed into an eigenvalue function of the coalition structure.Finally, the optimal coalition structure was searched by using the MDPSO-DRPPUS algorithm.Experiments show that compared with the m-ary discrete particle swarm optimization (MDPSO) algorithm and genetic algorithm (GA), the proposed algorithm dramatically reduces the average running time, and improves the efficiency and equilibrium of the coalition structure and task completion efficiency of edge nodes.…”
    Get full text
    Article
  17. 797

    Cache replacement strategy based on content value by Dan HUANG, Rongfang SONG

    Published 2018-11-01
    “…The cache replacement mechanism is one of the important research issues of the content center network.Considering the limited cache space,the reasonable replacement of the cache content becomes a key factor affecting the overall performance of the network.Therefore,a cache replacement scheme based on content value was designed.Considering the dynamic popularity of content,the cost of caching,and the time of the most recently requested,a more realistic content value function was built,and an effective content storage and replacement scheme was designed based on the content value function.Specifically,when the cache space was insufficient,the existing cache contents were replaced according to the value from small to large.Simulation results show that compared with the traditional replacement algorithms LRU,LFU and FIFO,the proposed scheme effectively improves the content cache hit rate of network nodes and reduces the average hops of users’ content acquisition.…”
    Get full text
    Article
  18. 798

    Joint optimization of edge computing and caching in NDN by Yu ZHANG, Min CHENG

    Published 2022-08-01
    “…Named data networking (NDN) is architecturally easier to integrate with edge computing as its routing is based on content names and its nodes have caching capabilities.Firstly, an integrated framework was proposed for implementing dynamic coordination of networking, computing and caching in NDN.Then, considering the variability of content popularity in different regions, a matrix factorization-based algorithm was proposed to predict local content popularity, and deep reinforcement learning was used to solve the the problem of joint optimization for computing and caching resource allocation and cache placement policy with the goal of maximizing system operating profit.Finally, the simulation environment was built in ndnSIM.The simulation results show that the proposed scheme has significant advantages in improving cache hit rate, reducing the average delay and the load on the remote servers.…”
    Get full text
    Article
  19. 799

    PUAR: Performance and Usage Aware Routing Algorithm for Long and Linear Wireless Sensor Networks by Bin He, Gang Li

    Published 2014-08-01
    “…PUAR realizes uneven clusters by a designed cluster radius related to the distance and the labor cost, with consideration of the residual energy and spatial layout of sensor nodes in the cluster head selection. With QoS support, PUAR uses the quality of link to reduce the packet loss and shortens the total transmitting distance to reduce the average delivery delay in multihop transmission. …”
    Get full text
    Article
  20. 800

    Variational Approaches for Drug-Disease-Gene Links in Periodontal Inflammation by Pradeep Kumar Yadalam, Prabhu Manickam Natarajan, Musab Hamed Saeed, Carlos M. Ardila

    Published 2025-02-01
    “…Results: The analysis revealed an extensive network comprising 1738 nodes and 1498 edges, averaging 1.992 neighbors per node. …”
    Get full text
    Article