Showing 361 - 380 results of 628 for search '"At the Hop"', query time: 0.04s Refine Results
  1. 361

    Resource Allocation for Two-Way Relay Network Based on Cognitive Radio by Shuang Liang, Shouyi Yang, Wanming Hao

    Published 2015-03-01
    “…The resource allocation issue for sensing-based spectrum opportunistic access and sensing-based spectrum sharing access in two-way relay cognitive network with imperfect spectrum sensing was discussed.Different from the traditional resource allocation methods for two-way relay network,new algorithm jointly considering sensing time and transmission power in secondary system.Under the condition of the sensing time and the transmission power,the maximal throughput of the secondary system can be obtained.To protect the primary user effectively from interference,the average interference power constraint in each hop was considered.The total transmission power constraint of the secondary system is also considered.The proposed algorithms can acquire the optimal sensing time and power allocation under imperfect spectrum sensing for the sensing-based spectrum opportunistic access and sensing-based spectrum sharing access.Finally,the performance of the two schemes was compared and the effectiveness of the proposed algorithm was verified.…”
    Get full text
    Article
  2. 362

    Time-variant interest community based query message routing algorithm in opportunity social network by Junlei BI, Zhiyuan LI

    Published 2019-09-01
    “…To solve the problem that the successful rate of resource query is low in opportunity social network,a query message routing algorithm based on time-variant interest community was proposed.Two well-known mobile social datasets were firstly analyzed,and then the temporal and spatial correlations of users were found.The time-variant interest communities based on temporal and spatial correlations of users were constructed.Next,a dynamic query routing on the constructed time-variant interest communities was proposed.Theoretical analysis shows that the proposed routing can run in O (nlog n) time.The comparisons between the proposed routing and state-of-the-art message delivery algorithms show that the proposed routing can keep high query success rate,reduce the average query latency and the hop count of a query and maintain low system overhead.…”
    Get full text
    Article
  3. 363

    Hurricane Toads by Steve A Johnson, Candace D Furhmann

    Published 2020-06-01
    “…In as little as 14 days, hordes of raisin-sized froglets emerge and hop away in all directions from the pond or puddle where they were born. …”
    Get full text
    Article
  4. 364

    Routing algorithm for MPLS traffic engineering in satellite network by XIAO Fu1, SUN Li-juan1, YE Xiao-guo1, WANG Ru-chuan1

    Published 2011-01-01
    “…With regard to long transmission delay and dynamic topology characters in satellite network,a novel routing algorithm was proposed in multi-protocol label switching satellite network.The algorithm uses the prior knowledge of source-destination pairs,and link propagation delay is also considered.Based on time-varying topology snapshot of satellite network,initial link weight is defined as function of transmission delay and residual bandwidth.Both current request and future requests are in account when calculate critical degree.Thus traffic engineering is realized by link weight dynamic adjustment and critical links extension loaded,which guarantee resource utilized better.Simulation results demonstrate the algorithm performs better in terms of request reject ratio,total available flow,average hop and transmission delay of least interference paths.…”
    Get full text
    Article
  5. 365

    Full-duplex device-to-device communications:key technologies and prospects by Jiaxin DING, Daquan FENG, Gongbin QIAN, Nan ZHANG

    Published 2018-05-01
    “…Due to the physical proximity,D2D communications can bring proximity gain,reusing gain and hop gain,and thus can potentially increase system spectral-efficiency and energy-efficiency.Full-duplex D2D communications,which enable the transceiver to simultaneously transmit and receive in the same band,can further improve the system performance.Therefore,full-duplex D2D communications has being considered as one of the key techniques in the next generation cellular networks.The features of full-duplex D2D communications and the significance in 5G systems were briefly introduced as well as its applications.Then,the state-of-art research on full-duplex D2D resource allocation was presented and discussed.Finally,some research topics that deserve further study was outlined and concluded.…”
    Get full text
    Article
  6. 366

    Culturas juveniles y trabajo social con jóvenes by GLADYS CASTIBLANCO-LEMUS, MARÍA ISABEL SERRANO-PIRAQUIVE, ANDRÉS EDUARDO SUÁREZ-CRUZ

    Published 2008-01-01
    “…Etnografía de agrupaciones Rave y hip hop rap en Bogotá y un conjunto de premisas conceptuales del trabajo social con jóvenes. …”
    Get full text
    Article
  7. 367

    Reliability routing protocol based on vehicle density in VANET by Rong CAI, Guoan ZHANG, Li JIN

    Published 2016-09-01
    “…A reliability routing protocol based on vehicle density in vehicular Ad Hoc network was proposed to reduce the complexity of finding an optimal or sub-optimal node of the forwarding node in forwarding range,reducing the average number of hops and enhancing the reliability of the link.Firstly,the size of the unite block was set by the forwarding node according to the vehicle density in the road.And the forwarding range was cut into several equal blocks.Then the farthest block away from the forwarding node was selected.In the selected block,the neighbor node which had the longest link time was chosen as a relay node to forward according to the principle of reliability finally.Compared with EG-RAODV,the simulated results of the proposed routing protocol show that the average number of hops is less and the average distance of one-hop progress is lager,which means the proposed routing protocol can transmit the data packet to destination node more quickly.…”
    Get full text
    Article
  8. 368

    Caching strategy based on node’s importance to community in information-centric networks by Jun CAI, Shun-zheng YU, Wai-xi LIU

    Published 2015-06-01
    “…In-network caching is one of the most important features of ICN (information-centric networks).A caching strategy based on node’s importance to community was proposed to make content objects cached more reasonable in temporal and spatial distribution.Within each community,the strategy not only caches content objects in those nodes where users are easy to access the content,but also makes different popularity of content objects more reasonable in temporal distribution.The CSNIC strategy was implemented under a variety of experimental conditions,and compare it with the previous strategies CEE-LRU,Betw-LFU and Opportunistic.The simulation results show that the strategy can yield a significant performance improvement,such as,cache hit ratio,hop reduction ratio,content diversity ratio and number of replacement.Furthermore,the additional overhead of CSNIC is small.…”
    Get full text
    Article
  9. 369

    Future architecture and evolution of communication network by Sheng ZHANG, Wei RONG

    Published 2018-07-01
    “…With the rapid development of the internet,the network bearer content is gradually transformed from a service based on connection-based information interaction to a service based on content sharing (video).The network transmits a large amount of redundant information,resulting in abnormal large-scale investment.And the quality of the service is difficult to guarantee,and it is urgent to study and construct a network that matches the business development.The content sharing connection relationship and the communication network architecture connection relationship were studied,and the two-dimensional poor time distribution or three-dimensional distribution and other implementation methods were explored.CDN was constructed to construct the content edge node,and the core network,wireless network,bearer network architecture and network element deployment were optimized.And space-based network such as satellite was considered to introduce to build a scale-free small hop network on the existing communication network to achieve matching of network architecture and content distribution.…”
    Get full text
    Article
  10. 370

    Balance Transmission Mechanism in Underwater Acoustic Sensor Networks by Jiabao Cao, Jinfeng Dou, Shunle Dong

    Published 2015-03-01
    “…The algorithm determines one-hop or multihop data transmission of the node to underwater sink according to the current energy level of adjacent nodes. …”
    Get full text
    Article
  11. 371

    Multiple targets localization via compressive sensing from mere connectivity by Lei LIU, Jian-jun ZHANG, Yang LU, Xing WEI, Jiang-hong HAN

    Published 2016-05-01
    “…A multiple targets localization method was proposed from mere connectivity,and the multiple targets posi-tioning problem was converted to sparse vector resolving by compressive sensing theory,which was applied to the indoor localization of intensive references distribution.The connectivity to the references was collected as the only measurement data,and targets locations were figured out by minimum l<sub>1</sub>-norm algorithm.When measurement data was compressed tol 1 bit,the fixed point iteration algorithm combined with semi-definite relax was proposed to figure out targets locations.As for the simulation results,compared with MDS-MAP,DV-Hop and RSS-CS algorithms,the average location error is less than 1 grid by the mere connectivity of N -bit and 1-bit quantization CS localization,of which the occupied bit quan-tity are reduced to less than 4 times and 16 times of RSS localization observation value respectively.…”
    Get full text
    Article
  12. 372

    Path assessment based network admission control algorithm by QIU Gong-an1, XU Chen1, ZHANG Guo-an1, BAO Zhi-hua1

    Published 2010-01-01
    “…The local link state metrics were measured by scheduler.At the same time,the stale path state metrics could be got from the router.The basic probability assignment functions of above metrics were described by the fuzzy state variableness.The path situation and the corresponding probability could be computed through data fusion based on Dempster rule.Then the path situation with the maximum probability would be regarded as the quasi-real-time path state.Network admission decision was made based on the estimated path state.Simulations show that the link utility of proposed policy has twice as the budget based network admission control under the similar blocking rate.And the complexity of network mechanism can be decreased by adding pre-computed at the edge to achieve coreless status in multi-hop networks.…”
    Get full text
    Article
  13. 373

    Hurricane Toads by Steve A Johnson, Candace D Furhmann

    Published 2020-06-01
    “…In as little as 14 days, hordes of raisin-sized froglets emerge and hop away in all directions from the pond or puddle where they were born. …”
    Get full text
    Article
  14. 374

    Routing metric based on interference measurement for multi-radio multi-channel wireless mesh networks by Wen-jiang JI, Jian-feng MA, Jun-wei ZHANG, Zhuo MA

    Published 2013-04-01
    “…An interference sensing based(ISB)routing metric which mainly depend on the estimation of signal power was introduced for the multi-radio multi-channel wireless mesh networks.The existing metric such like WCETT and iAWARE all have their drawbacks were shown.As shown in the equations of iAWARE,it could be proved that worse background noise corresponds to a better metric value which was imprecise.The iAWARE to make it suited for the environment with background noise was improved,and the isotonic property was regained that the Bellman-Ford and Dijkstra algorithm could be deployed in ISB.The simulation results prove the novel algorithm takes the advantages of higher efficiency both in throughput and end to end delays,compared with the traditional ones HopCount,ETT,WCETT and iAWARE.…”
    Get full text
    Article
  15. 375

    D3D-MDS: A Distributed 3D Localization Scheme for an Irregular Wireless Sensor Network Using Multidimensional Scaling by Jin Fan, Baohui Zhang, Guojun Dai

    Published 2015-02-01
    “…The simulation and performance analysis results show that the localization accuracy of the D3D-MDS algorithm increases by 49.1% compared with 3D-DV-HOP and 38.6% compared with 3D-MDS-MAP. This distributed localization scheme also demonstrates a low computational complexity compared with other centralized localization algorithms.…”
    Get full text
    Article
  16. 376

    Energy efficient resource allocation scheme for AF relay downlink system by Yu CHEN, Xu-ming FANG, Bo HUANG

    Published 2014-09-01
    “…In order to maximize the total energy efficiency of amplify-and-forward relay downlink system,a joint scheme of relay selection and power allocation was proposed with the circuit power of the system.For reducing the computa-tional complexity,a step-by-step suboptimal allocation scheme was provided.Firstly,the virtual direct channel gains were adopted to select appropriate transmission link.Meanwhile,relay system was converted to the single hop system.Then,the power allocation could be solved by convex optimization.Besides,in order to accommodate different user distribu-tions,a resource allocation scheme based on cell zooming was also proposed.Simulations demonstrated that the solution of the proposed suboptimal scheme approaches the optimal solution.Additionally,the scheme with cell zooming is adaptable to different user distributions and further improves the total system energy efficiency.…”
    Get full text
    Article
  17. 377

    Secure and high throughput routing protocol with QoS constraints in cognitive wireless Mesh networks by Zhu-fang KUANG, Zhi-gang CHEN, Guo-jun WANG, Hui LIU

    Published 2014-11-01
    “…A routing metric SIEB which includes link security,link conflict,link reliability and link available bandwidth was proposed.The SIEB includes link security and link performance two aspects.In order to resist various hole attack,the link trust value based on two hop neighbor feedback is computed in link security weight computing of SIEB.On this basis,a link security weight computing algorithm LSWC and a link performance weight computing algorithm LSPC were proposed,and a distributed routing protocol SIEBP with QoS constraints in cognitive wireless Mesh network was proposed.Finding safety routing path and maximizing the network throughput are the objective of SIEBP.Simulation results show that SIEBP routing protocol can achieve expectation goal.It can not only find safety routing path which can resist black hole attack,gray hole attack and worm hole attack,but also obtain a higher network throughput.…”
    Get full text
    Article
  18. 378

    Connectivity Analysis for Free-Flow Traffic in VANETs: A Statistical Approach by Chen Chen, Xiaobo Du, Qingqi Pei, Yanan Jin

    Published 2013-10-01
    “…In addition, relying only on the direct connectivity in most of the previous works, say broadcasting which provides one-hop connections between nodes is far from the continuously growing application demands in VANETs, such as inter-vehicle entertainments, cooperative collision avoidances, and inter-vehicle emergency notifications. …”
    Get full text
    Article
  19. 379

    Can’t Help Lovin’:David Chidester’s Pop Culture Colonialism by Kathryn Lofton

    Published 2018-07-01
    “… This article examines the likability ofhip-hop star Kanye West and The Voicechampion Jordan Smith to explain the colonial terms for our pop culture taste. …”
    Get full text
    Article
  20. 380

    Research on electromagnetic relay forwarding bidirectional transmission technology while drilling by LI Shiyin, ZHANG Bowen, ZHANG Guanjie, ZHANG Zhi, QI Huayan, WANG Bo

    Published 2024-10-01
    “…Field test results demonstrate that the proposed scheme achieves reliable relay-assisted bidirectional transmission of electromagnetic signals, with a single-hop transmission distance of 30 m and relay transmission distance exceeding 100 m. …”
    Get full text
    Article