Showing 321 - 340 results of 628 for search '"At the Hop"', query time: 0.06s Refine Results
  1. 321

    Highly reliable access algorithm for PD-NOMA based IoT with delay guarantee by Chaonong XU, Jianxiong WU, Yongjun XU

    Published 2020-09-01
    “…A single-hop PD-NOMA network supporting k-successive interference cancellation (k-SIC) was considered.Given the real-time performance requirements,how to maximize the average reliability of uplink transmissions by the joint users grouping and power allocation was studied.A heuristic algorithm with complexity of O(nlogn) was presented,where n was the number of users.The algorithm was also proved to be the optimal if k=2.The performance evaluations reveal that the transmission reliability will increase exponentially with the linear degradation of the real-time performance guarantee.Besides,the transmission reliability is enhanced with respect to the random users grouping algorithm.…”
    Get full text
    Article
  2. 322

    Coordinated caching scheme based on popular content awareness and tracking by Guo ZHANG, Yu-xiang HU, Wan-wei HUANG, Bin-qiang WANG, Lu-jia CAO

    Published 2017-02-01
    “…To overcome the problems of the on-path caching schemes in the content centric networking,a coordinated caching scheme based on the node with the max betweenness value and edge node was designed.According to the topol-ogy characteristics,the popular content was identified at the node with the max betweenness value and tracked at the edge node.The on-path caching location was given by the popularity and the cache size.Simulation results show that,com-pared with the classical schemes,this scheme promotes the cache hit ratio and decreases the average hop ratio,thus en-hancing the efficiency of the cache system.…”
    Get full text
    Article
  3. 323

    Energy-efficient data gathering scheme based on Kalman prediction and compressed sensing by Ying ZHOU, Lihua YANG, Longxiang YANG, Meng NI

    Published 2019-01-01
    “…In the inter-cluster transmission, the cluster heads leveraged the hybrid compressed sensing to transfer the data to the sink via multi-hop links. Moreover, the communication cost was derived to verify the efficiency of the proposed method. …”
    Get full text
    Article
  4. 324

    Edge-first-based cooperative caching strategy in information centric networking by Jiang ZHI, Jun LI, Hai-bo WU, Yong-mao REN

    Published 2017-03-01
    “…In order to optimize the replica placement in information centric networking,an edge-first-based cooperative caching strategy (ECCS) was proposed.According to the strategy,cache decision was made during the interest forwarding stage.The decision result and statistic information would been forwarded to upstream routers step by step.Utilizing the information,upstream nodes could update their cache information table immediately to achieve cooperative caching.The experimental results indicate ECCS can achieve salient performance gain in terms of server load reduction ratio,average hop reduction ratio,average cache hit ratio,compared with current strategies.…”
    Get full text
    Article
  5. 325

    Rimes de malandrins : du narcocorrido au narco rap by Enrique Flores

    Published 2016-05-01
    “…The former genealogy of popular ballads and of the printed sheets of bandits and smugglers is founded on the culture of the hip-hop –heaps, rhythm, street language, graffiti and urban inscriptions, dance, body in a transe, visceral politics. …”
    Get full text
    Article
  6. 326

    L’alternance codique dans le rap algérien et tunisien by Felix Wiedemann

    Published 2016-06-01
    “…Hip-hop culture in general and especially rap music are important ways of expression for urban Algerian and Tunisian youths. …”
    Get full text
    Article
  7. 327

    Intelligent routing strategy in the Internet of things based on deep reinforcement learning by Ruijin DING, Feifei GAO, Ling XING

    Published 2019-06-01
    “…At the era of the Internet of things,networking mode that connects everything would bring tremendous increase in the data volume and challenge the traditional routing protocols.The limitations of the existing routing protocols was analyzed when facing the data explosion and then the routing selection problem was re-modeled as a Markov decision process.On this basis,the deep reinforcement learning technique was utilized to choose the next-hop router for data transmission task in order to shorten the transmission path length while network congestion was avoided.The simulation results demonstrate that the congestion probability can be reduced significantly and the network throughput can be enhanced by the proposed strategy.…”
    Get full text
    Article
  8. 328

    End-to-end deterministic networking architecture and key technologies by Peng LIU, Zongpeng DU, Yongjing LI, Lu LU, Xiaodong DUAN

    Published 2021-09-01
    “…New services such as remote control and cloud AR/VR, have put forward higher bandwidth and latency requirements than traditional network.6G-oriented network evolution needs end-to-end deterministic networking technology support.In view of the lack of global consideration of end-to-end latency guarantee in current technical standard research, it was pointed out that deterministic networking needs to solve the problem of single hop and global latency at the same time.An end-to-end deterministic networking architecture was built, as well as deterministic networking technical schemes across networking domain and protocol layer was proposed.Finally, according to the current difficulties of deterministic networking development, the corresponding promotion suggestions were put forward.…”
    Get full text
    Article
  9. 329

    Migration of primordial germline cells is negatively regulated by surrounding somatic cells during early embryogenesis in Drosophila melanogaster by N. V. Dorogova, A. S. Khruscheva, Iu. A. Galimova, D. Yu. Oshchepkov, D. E. Maslov, E. D. Shvedkina, K. A. Akhmetova, S. A. Fedorova

    Published 2020-08-01
    “…We identified the myc, Hph, stat92E, Tre-1, and hop genes, whose RNA interference leads to premature active PGC migration at stages 4–7 of embryogenesis. …”
    Get full text
    Article
  10. 330

    Return to Play Assessment After Lateral Ankle Sprains – German Male Elite Youth Football (Soccer) Academy Baseline Data by Zacharias Flore, Götz Welsch, Hendrik Bloch

    Published 2024-07-01
    “… # Study Design Observational Cohort study # Methods Baseline data of performance tests (Y-Balance \[YBT-LQ], Heel Rise \[HRT]; Singe Leg Squat \[SLST]; Single Leg Drop Jump \[SLDJ]; Side Hop \[SHT]; Figure of 8 Hop \[F-8]; Modified Agility T-Test \[MAT]) were assessed in 20 elite youth football players, aged 16-21 years. …”
    Get full text
    Article
  11. 331

    Target sampling based on routing behavior analysis in network topology measurement by ZHANG Yu, FANG Bin-xing, ZHANG Hong-li

    Published 2009-01-01
    “…In order to investigate the insufficiency of target sampling in current network topology measurement practice and the distortion of measurement models,a sort of target sampling methods based on routing behavior analysis were pre-sented,namely,the uniform random sampling as a benchmark method,the minimum cover sampling as an optimal method,the last-hop sampling for the path diversity,and the bisection sampling for the destination prefix diversity.Ex-periments based on real measurement data show that a half of topology information can be missed in the traditional ‘1 per /24’ random sampling,of which 10% of missed information is caused by the path diversity and the rest is caused by des-tination prefix diversity.The minimum cover sampling is robust to the routing dynamics and performs better than the uniform random sampling at the long-term practice.…”
    Get full text
    Article
  12. 332

    Dynamic deployment algorithm for multi-controllers based on bidirectional matching in software defined networking by Tao HU, Jianhui ZHANG, Weigong KONG, Sen YANG, Lujia CAO

    Published 2018-01-01
    “…Aiming at the controller load imbalance problem in distributed SDN,a multi-controller dynamic deployment algorithm based on bidirectional matching was proposed.Through collecting hop counts,delay and flow information in the network periodically,match lists of switch and controller was built respectively.According to the principle of optimal queuing,switches and controllers were selected from two match lists for implementing bidirectional matching,and the relationship of matching with the help of simulated annealing algorithm was optimized,which achieved dynamic deployment for multi-controller in distributed network.Results show that,compared with the existing approaches,this algorithm can match the connections between switches and controllers reasonably,and reduce the queue delay of flow request effectively.Moreover,and the controller load balancing rate has increased by 17.9% at least.…”
    Get full text
    Article
  13. 333

    Study on capacity analytical model for multi-channel wireless sensor networks by WANG Ming-fei1, CI Lin-lin1, ZHAN Ping2, XU Yong-jun3

    Published 2008-01-01
    “…The model can describe the path capacity, the network capacity, and the contention relation of the flows in multi-hop multi-channel network. The model is simple, and it can di- rect the network deployment and the design of network protocols.…”
    Get full text
    Article
  14. 334

    Pilot based channel estimation in amplify-and-forward MIMO relay networks by Jian ZHOU, Bao-yu ZHENG

    Published 2014-09-01
    “…A channel estimation method in two time slots for two-hop amplify-and-forward MIMO relay channels is pro-posed.An algorithm for computing the optimal pair of source pilot and relay amplify matrix is developed,which mini-mizes the mean square error of the source-to-relay channel estimation subject to both power constraints at the source and the relay.The signal matrices are decomposed into unitary components and diagonal components.Then the bisection method is used to obtain the optimal diagonal components of the source pilot and the relay amplified matrix.The simula-tion results show that the proposed method has no ambiguity in the channel estimates.The effects of the channel correla-tion and the number of antennas on the performance of channel estimation are also analyed.…”
    Get full text
    Article
  15. 335

    Distributed energy efficient unequal clustering algorithm for wireless sensor networks by SHANG Feng-jun1, Mehran Abolhasan2, Tadeusz Wysocki3

    Published 2009-01-01
    “…Finally, an unequal clustering algorithm was proposed for single-hop homogeneous networks. Through both theoretical analysis and numerical results, it is shown that DEEUC prolongs the network lifetime significantly against the other clustering protocols such as LEACH-C and EECS. …”
    Get full text
    Article
  16. 336

    Bridge monitoring system based on Internet of things technology by Zheng LI, Sheng ZHANG, Luyu ZHANG, Yang ZHANG

    Published 2018-09-01
    “…The Internet of everything is the trend of today’s smart cities.With the rapid development of Internet of things technology,a good opportunity is provided to obtain real-time status information on important infrastructures.Aiming at the problem such as low monitoring efficiency,poor flexibility and rigorous testing results with traditional artificial bridge monitoring methods a bridge monitoring system based on the Internet of things technology was designed.A variety of sensors and cameras were used in the system to collect the data of bridge’s dynamic status in real-time,and the wireless multi-hop network was used to transfer the perception data to the bridge health monitoring cloud platform for further processing and analysis.Real-time monitoring,early warning,analysis and assessment of bridge safety conditions could be realized by the system,and is very important to the bridge safety engineering.…”
    Get full text
    Article
  17. 337

    Research on networking troubleshooting method based on software defined network by Jia-wei LI, Zhi-ju YANG, Xi-jun LIN, UHai-peng Q

    Published 2016-12-01
    “…Based on the reaserch status of networking troubleshooting in software defined network,a new net-working troubleshooting method was proposed.A TCP packet marked in head field was sent and detailed forward information in every hop would be written in its data filed once the test packet was matched.Taking advantages of the programmable feature of the controller and OpenFlow extensible match,special flow table was designed for matching test-used packet.The analysis module extracted and split the forward information,and thus printed the suspicious network problem which can be used to track and located the problematic network node.The experiment results indicate that the proposed method is fairy efficient.…”
    Get full text
    Article
  18. 338

    Performance analysis of amplify-and-forward cooperative communication systems with imperfect channel estimation by WANG Lei, CAI Yue-ming, YANG Wei-wei, TU Jia

    Published 2011-01-01
    “…The impact of channel estimation errors on the performance for two-hop multi-relays assisted am-plify-and-forward(AF) cooperative communication systems was investigated.Closed-form expressions of the average symbol error rate,as well as the diversity gain under different channel estimation quality orders for both opportunistic re-laying(OPR) and all-participate relaying(APR) schemes were derived.Average signal-to-noise-ratio(SNR) gap ratio is investigated for the two types of cooperative communication systems,which lead to a conclusion that the OPR scheme is more susceptible to channel estimation errors than the APR scheme.Numerical results verify the theoretical analysis.…”
    Get full text
    Article
  19. 339

    Delay and energy minimization for MEC-based secure communication by Pinyi REN, Qian XU

    Published 2020-11-01
    “…Considering a physical-layer-security-aided confidential document transmission problem,a secure transmission strategy was proposed where the base station equipped with a mobile edge computing (MEC) server served as a relay to help compress,forward,and decompress.First,the Poisson point process was used to calculate the secure transmission probability for the scenario with multiple potential eavesdroppers.Then,a delay and energy minimization problem was formulated under a constraint on the two-hop secure transmission probability.The optimal compression and decompression scheme was obtained using the one-dimensional search combined with linear programming.Simulation results show that the document compression is necessary for the link with small achievable secrecy rate under a given secure transmission probability; otherwise,the document should be directly transmitted without compression.…”
    Get full text
    Article
  20. 340

    Node characteristics based LR-WPAN routing algorithm research for network energy optimization by QIAN Zhi-hong, ZHANG Xiao-fan, WANG Yi-jun, GUAN Ting-yan

    Published 2010-01-01
    “…An enhanced algorithm named F-ZBR was proposed considering the weakness of ZigBee hybrid routing algorithms and the energy consumption in LR-WPAN network.The proposed scheme reduced overall energy consumption of network by the definition of minimum routing energy and controlling the direction of RREQ packet as well as the number of hop,besides the introduction of energy flag in RREQ packet.The analysis on simulation result indicated that F-ZBR performs significantly better than ZBR in packet delivery ratio,available nodes ratio as well as remaining energy ratio.By the algorithm,therefore,it may be depleted that huge data transmission gives rise to over-consuming energy of RN+ nodes or even collapse in ZigBee network.And the algorithm also prolongs the life span of network.…”
    Get full text
    Article