全文获取类型
收费全文 | 1819篇 |
免费 | 154篇 |
国内免费 | 4篇 |
专业分类
化学 | 42篇 |
晶体学 | 1篇 |
力学 | 4篇 |
综合类 | 3篇 |
数学 | 95篇 |
物理学 | 58篇 |
无线电 | 1774篇 |
出版年
2024年 | 11篇 |
2023年 | 38篇 |
2022年 | 35篇 |
2021年 | 48篇 |
2020年 | 46篇 |
2019年 | 51篇 |
2018年 | 48篇 |
2017年 | 70篇 |
2016年 | 70篇 |
2015年 | 75篇 |
2014年 | 116篇 |
2013年 | 95篇 |
2012年 | 95篇 |
2011年 | 115篇 |
2010年 | 99篇 |
2009年 | 121篇 |
2008年 | 112篇 |
2007年 | 156篇 |
2006年 | 149篇 |
2005年 | 119篇 |
2004年 | 83篇 |
2003年 | 71篇 |
2002年 | 64篇 |
2001年 | 42篇 |
2000年 | 21篇 |
1999年 | 3篇 |
1998年 | 2篇 |
1997年 | 6篇 |
1996年 | 8篇 |
1995年 | 3篇 |
1994年 | 2篇 |
1993年 | 3篇 |
排序方式: 共有1977条查询结果,搜索用时 15 毫秒
81.
针对飞行自组网(FANET)中无人机(UAVs)快速移动造成的网络拓扑管理困难问题,考虑实际场景中无人机位置变化引起的可用信道差异,该文提出一种自适应蜂鸟算法对网络拓扑进行优化。首先,建立一个针对分簇结构的无人机拓扑模型,并且形成一个以最小化簇数量、负载偏差和簇移动度为目标的优化问题。其次,通过调节人工蜂鸟的觅食动作、加入扰动变异的方式,提出寻优能力更强的自适应蜂鸟算法(ADHA)。然后,设计合理的蜂鸟个体编码方式,将拓扑优化的决策过程转化为自适应蜂鸟算法的寻优过程。最后,通过仿真验证所提算法的收敛性,并与基于其他群智能优化算法的拓扑优化方法进行对比。实验结果表明,所提算法得到的拓扑优化策略不仅能够有效减少网络拓扑的簇数量,而且能够得到负载均衡、结构稳定的簇群。 相似文献
82.
Christian Stephan Bernd 《AEUE-International Journal of Electronics and Communications》2006,60(1):20-24
Security for ad hoc network environments has received a lot of attention as of today. Previous work has mainly been focussing on secure routing, fairness issues, and malicious node detection. However, the issue of introducing and conserving trust relationships has received considerably less attention. In this article, we present a scalable method for the use of public key certificates and their revocation in mobile ad hoc networks (MANETs). With the LKN-ad hoc security framework (LKN-ASF) a certificate management protocol has been introduced, bringing PKI technology to MANETs. In addition a performance analysis of two different revocation approaches for MANETs will be presented. 相似文献
83.
84.
85.
86.
Salim Bitam Abdelhamid Mellouk Scott Fowler 《Wireless Communications and Mobile Computing》2015,15(9):1391-1404
Vehicular ad hoc networks (VANETs) are witnessing in recent years a rapid development for road transmissions and are considered as one of the most important types of next generation networks, in which drivers can have access anywhere and anytime to information. However, vehicles have to deal with many challenges such as the links failures due to their frequent mobility as well as limited degrees of freedom in their mobility patterns. In this paper, we propose a new quality of service multicast and multipath routing protocol for VANETs, based on the paradigm of bee's communication, called multicast quality of service swarm bee routing for VANETs (MQBV). The MQBV finds and maintains robust routes between the source node and all multicast group members. Therefore, the average end‐to‐end delay and the normalized overhead load should be reduced, while at the same time increasing the average bandwidth and the packet delivery ratio. Extensive simulation results were obtained using ns‐2 simulator in a realistic VANET settings and demonstrated the efficiency of the proposed protocol. Copyright © 2013 John Wiley & Sons, Ltd. 相似文献
87.
Jiann‐Liang Chen Shih‐Wei Liu Szu‐Lin Wu Ming‐Chiao Chen 《International Journal of Communication Systems》2011,24(9):1150-1162
Owing to limited wireless network resources, network applications must provide an adaptive quality‐guaranteed service to satisfy user requirements. Different applications are associated with different quality of service (QoS) concerns, as well as different QoS control parameters. This work presents an adaptive QoS algorithm by discussing the QoS specifications of three wireless access technologies, i.e. 3G, WiMAX and WiFi. Based on cross‐layer and cognition concepts, these environmental parameters are integrated with the sensing of spectral and received signal strength from a cognitive radio paradigm. An adaptive QoS algorithm is then proposed to select the optimal access network for services. Simulation results indicate that the proposed adaptive QoS algorithm outperforms available ones in real‐time applications. Compared with traditional algorithms, the proposed algorithm reduces not only the average delay time and jitter for VoIP services to 0.16 s and 0.09 ms, respectively, but also the packet loss ratio for high‐definition video streaming by 3.4%. Copyright © 2011 John Wiley & Sons, Ltd. 相似文献
88.
89.
Characteristics of Mobile Ad hoc Networks such as shared broadcast channel, bandwidth and battery power limitations, highly dynamic topology, and location dependent errors, make provisioning of quality of service (QoS) in such networks very difficult. The Medium Access Control (MAC) layer plays a very important role as far as QoS is concerned. The MAC layer is responsible for selecting the next packet to be transmitted and the timing of its transmission. We have proposed a new MAC layer protocol that includes a laxity-based priority scheduling scheme and an associated back-off scheme, for supporting time-sensitive traffic. In the proposed scheduling scheme, we select the next packet to be transmitted, based on its priority value which takes into consideration the uniform laxity budget of the packet, the current packet delivery ratio of the flow to which the packet belongs, and the packet delivery ratio desired by the user. The back-off mechanism devised by us grants a node access to the channel, based on the rank of its highest priority packet in comparison to other such packets queued at nodes in the neighborhood of the current node. We have studied the performance of our protocol that combines a packet scheduling scheme and a channel access scheme through simulation experiments, and the simulation results show that our protocol exhibits a significant improvement in packet delivery ratio under bounded end-to-end delay requirements, compared to the existing 802.11 DCF and the Distributed Priority Scheduling scheme proposed recently in [ACM Wireless Networks Journal 8 (5) (2002) 455–466; Proceedings of ACM MOBICOM '01, July 2001, pp. 200–209]. 相似文献
90.
The mobile ad hoc network (MANET) has recently been recognized as an attractive network architecture for wireless communication. Reliable broadcast is an important operation in MANET (e.g., giving orders, searching routes, and notifying important signals). However, using a naive flooding to achieve reliable broadcasting may be very costly, causing a lot of contention, collision, and congestion, to which we refer as the broadcast storm problem. This paper proposes an efficient reliable broadcasting protocol by taking care of the potential broadcast storm problem that could occur in the medium-access level. Existing protocols are either unreliable, or reliable but based on a too costly approach. Our protocol differs from existing protocols by adopting a low-cost broadcast, which does not guarantee reliability, as a basic operation. The reliability is ensured by additional acknowledgement and handshaking. Simulation results do justify the efficiency of the proposed protocol. 相似文献