全文获取类型
收费全文 | 1779篇 |
免费 | 161篇 |
国内免费 | 4篇 |
专业分类
化学 | 37篇 |
晶体学 | 1篇 |
力学 | 4篇 |
综合类 | 3篇 |
数学 | 95篇 |
物理学 | 56篇 |
无线电 | 1748篇 |
出版年
2024年 | 8篇 |
2023年 | 33篇 |
2022年 | 29篇 |
2021年 | 46篇 |
2020年 | 43篇 |
2019年 | 51篇 |
2018年 | 45篇 |
2017年 | 67篇 |
2016年 | 69篇 |
2015年 | 74篇 |
2014年 | 115篇 |
2013年 | 93篇 |
2012年 | 95篇 |
2011年 | 114篇 |
2010年 | 99篇 |
2009年 | 121篇 |
2008年 | 112篇 |
2007年 | 155篇 |
2006年 | 149篇 |
2005年 | 119篇 |
2004年 | 83篇 |
2003年 | 71篇 |
2002年 | 64篇 |
2001年 | 42篇 |
2000年 | 21篇 |
1999年 | 3篇 |
1998年 | 2篇 |
1997年 | 5篇 |
1996年 | 8篇 |
1995年 | 3篇 |
1994年 | 2篇 |
1993年 | 3篇 |
排序方式: 共有1944条查询结果,搜索用时 296 毫秒
1.
Information‐Centric Networking (ICN) has been accepted to overcome some weaknesses of the current Internet architecture, showing that “what is being exchanged” is more important than “who are exchanging information.” Given the inadequate considerations on Quality of Service (QoS) and energy saving in ICN routing, we propose in this paper a routing algorithm to enhance the two aspects. At first, on one hand, Cauchy distribution is used as a fuzzy model to evaluate users' QoS requirements, such as bandwidth, delay, and error rate; on the other hand, we formulate energy saving problem to evaluate the green quality of routing algorithm. Then, we design a link selection approach by considering QoS and energy saving, which belongs to a multi‐objective decision problem resolved by intelligent drops algorithm. Finally, we implement the proposed algorithm and compare it with the famous adaptive forwarding mechanism in terms of some significant metrics, and the experimental results reveal that the proposed algorithm is more efficient. 相似文献
2.
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. 相似文献
3.
This paper addresses the problem of power control in a multihop wireless network supporting multicast traffic. We face the problem of forwarding packet traffic to multicast group members while meeting constraints on the signal-to-interference-plus-noise ratio (SINR) at the intended receivers. First, we present a distributed algorithm which, given the set of multicast senders and their corresponding receivers, provides an optimal solution when it exists, which minimizes the total transmit power. When no optimal solution can be found for the given set of multicast senders and receivers, we introduce a distributed, joint scheduling and power control algorithm which eliminates the weak connections and tries to maximize the number of successful multicast transmissions. The algorithm allows the other senders to solve the power control problem and minimize the total transmit power. We show that our distributed algorithm converges to the optimal solution when it exists, and performs close to centralized, heuristic algorithms that have been proposed to address the joint scheduling and power control problem. 相似文献
4.
In recent years, constructing a virtual backbone by nodes in a connected dominating set (CDS) has been proposed to improve the performance of ad hoc wireless networks. In general, a dominating set satisfies that every vertex in the graph is either in the set or adjacent to a vertex in the set. A CDS is a dominating set that also induces a connected sub‐graph. However, finding the minimum connected dominating set (MCDS) is a well‐known NP‐hard problem in graph theory. Approximation algorithms for MCDS have been proposed in the literature. Most of these algorithms suffer from a poor approximation ratio, and from high time complexity and message complexity. In this paper, we present a new distributed approximation algorithm that constructs a MCDS for wireless ad hoc networks based on a maximal independent set (MIS). Our algorithm, which is fully localized, has a constant approximation ratio, and O(n) time and O(n) message complexity. In this algorithm, each node only requires the knowledge of its one‐hop neighbours and there is only one shortest path connecting two dominators that are at most three hops away. We not only give theoretical performance analysis for our algorithm, but also conduct extensive simulation to compare our algorithm with other algorithms in the literature. Simulation results and theoretical analysis show that our algorithm has better efficiency and performance than others. Copyright © 2005 John Wiley & Sons, Ltd. 相似文献
5.
We propose in this paper a self-organized monitoring architecture for mobile ad-hoc networks based on a selective scheme where
subsets of nodes are managed. These nodes are determined based on their network behavior in order to favor subsets of well-connected
nodes. The key idea is to relax the requirements of the management plane, and to use these manageable subsets to monitor the
performance of the overall network. We therefore propose a new performance metric to be monitored, in order to estimate the
capability of ad-hoc nodes to communicate end-to-end in the network. Extensive simulations show how different parameters affect
this metric. 相似文献
6.
基于多信道预约可冲突避免的多址接入协议 总被引:3,自引:0,他引:3
本文为多跳分布多无线网络提出了一套灵活而有效的自适应获取冲突避免(AACA)的多址接入协议。在该协议中,各节点竞争公共信道,利用RTS/CTS对话形式来预约各业务信道,成功预约后的分组传输不会受到其他节点的干扰。它使用任意确定数目信道,以异步方式工作,并且使得各节点利用半双工无线电台就可以灵活、简便地实现资源预约。分析和比较结果说明,所提出的多信道预约协议可以有效地解决隐藏终端、暴露终端以及侵入终端的问题。 相似文献
7.
This paper studies a fluid queue with coupled input and output. Flows arrive according to a Poisson process, and when n flows are present, each of them transmits traffic into the queue at a rate c/(n+1), where the remaining c/(n+1) is used to serve the queue. We assume exponentially distributed flow sizes, so that the queue under consideration can
be regarded as a system with Markov fluid input. The rationale behind studying this queue lies in ad hoc networks: bottleneck
links have roughly this type of sharing policy. We consider four performance metrics: (i) the stationary workload of the queue,
(ii) the queueing delay, i.e., the delay of a ‘packet’ (a fluid particle) that arrives at the queue at an arbitrary point
in time, (iii) the flow transfer delay, i.e., the time elapsed between arrival of a flow and the epoch that all its traffic
has been put into the queue, and (iv) the sojourn time, i.e., the flow transfer time increased by the time it takes before
the last fluid particle of the flow is served. For each of these random variables we compute the Laplace transform. The corresponding
tail probabilities decay exponentially, as is shown by a large-deviations analysis.
F. Roijers’ work has been carried out partly in the SENTER-NOVEM funded project Easy Wireless. 相似文献
8.
Performance analysis of IEEE 802.11 ad hoc networks in the presence of exposed terminals 总被引:1,自引:0,他引:1
The paper evaluates the performance effects of exposed terminals in IEEE 802.11 ad hoc networks in finite load conditions. It derives analytical models for the estimation of channel utilization and media access delay for IEEE 802.11 ad hoc networks in finite load conditions with and without exposed terminals. The simulation results show that the analytical estimated channel utilization and media access delay metrics are fairly accurate. 相似文献
9.
Huayi Wu Xiaohua Jia Yanxiang He Chuanhe Huang 《International Journal of Communication Systems》2005,18(9):803-816
This paper investigates the issues of QoS routing in CDMA/TDMA ad hoc networks. Since the available bandwidth is very limited in ad hoc networks, a QoS request between two nodes will be blocked if there does not exist a path that can meet the QoS requirements, even though there is enough free bandwidth in the whole system. In this paper, we propose a new scheme of using multiple paths between two nodes as the route for a QoS call. The aggregate bandwidth of the multiple paths can meet the bandwidth requirement of the call and the delays of these paths are within the required bound of the call. We also propose three strategies by which to choose a set of paths as the route, namely, shortest path first (SPF), largest bandwidth first (LBF), and largest hop‐bandwidth first (LHBF). Extensive simulations have been conducted to evaluate the performance of the three strategies in comparison with a traditional single path routing algorithm. The simulation results show that the proposed multiple paths routing scheme significantly reduces the system blocking rates in various network environments, especially when the network load is heavy. Copyright © 2005 John Wiley & Sons, Ltd. 相似文献
10.