首页 | 官方网站   微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   261篇
  国内免费   11篇
  完全免费   117篇
工业技术   389篇
  2018年   1篇
  2017年   1篇
  2015年   5篇
  2014年   5篇
  2013年   11篇
  2012年   16篇
  2011年   20篇
  2010年   13篇
  2009年   34篇
  2008年   32篇
  2007年   49篇
  2006年   39篇
  2005年   52篇
  2004年   39篇
  2003年   27篇
  2002年   18篇
  2001年   13篇
  2000年   12篇
  1999年   1篇
  1998年   1篇
排序方式: 共有389条查询结果,搜索用时 62 毫秒
1.
MANET环境下AODV协议的研究和改进   总被引:1,自引:0,他引:1  
王新生  张昕 《微机发展》2005,15(12):139-141,144
MANET网络就是移动Ad—Hoc网络,它是由若干节点所组成的一个移动自治系统,在一个无线Ad—Hoc网络中,节点之间通过多跳无线链路相互通信,所有的节点利用共享的无线媒质相互联系。这样节点之间路由问题就成为一个重点要解决的问题。目前,在这方面普遍采用DSR和AODV路由协议。但是,这两种路由协议对于要求QoS的网络来说还是力不从心的。文中主要讨论的是基于AODV路由协议的一些改进方案。  相似文献   
2.
The quality-of-service (QoS) communication that supports mobile applications to guarantee bandwidth utilization is an important issue for Bluetooth wireless personal area networks (WPANs). In this paper, we address the problem of on-demand QoS routing with interpiconet scheduling in Bluetooth WPANs. A credit-based QoS (CQ) routing protocol is developed which considers different Bluetooth packet types, because different types of Bluetooth packets have different bandwidth utilization levels. This work improves the bandwidth utilization of Bluetooth scatternets by providing a new interpiconet scheduling scheme. This paper mainly proposes a centralized algorithm to improve the bandwidth utilization for the on-demand QoS routing protocol. The centralized algorithm incurs the scalability problem. To alleviate the scalability problem, a distributed algorithm is also investigated in this work. The performance analysis illustrates that our credit-based QoS routing protocol achieves enhanced performance compared to existing QoS routing protocols.This work was supported by the National Science Council of the Republic of China under grant nos. NSC-92-2213-E-194-022 and NSC-93-2213-E-194-028. Yuh-Shyan Chen received the B.S. degree in computer science from Tamkang University, Taiwan, Republic of China, in June 1988 and the M.S. and Ph.D. degrees in Computer Science and Information Engineering from the National Central University, Taiwan, Republic of China, in June 1991 and January 1996, respectively. He joined the faculty of Department of Computer Science and Information Engineering at Chung-Hua University, Taiwan, Republic of China, as an associate professor in February 1996. He joined the Department of Statistic, National Taipei University in August 2000, and joined the Department of Computer Science and Information Engineering, National Chung Cheng University in August 2002. Dr. Chen served as Co-Editors-in-Chief of International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC), Editorial Board Member of Telecommunication System Journal, International Journal of Internet Protocol Technology (IJIPT) and The Journal of Information, Technology and Society (JITAS). He also served as Guest Editor of Telecommunication Systems, special issue on “Wireless Sensor Networks” (2004), and Guest Editor of Journal of Internet Technology, special issue on “Wireless Internet Applications and Systems” (2002) and special issue on “Wireless Ad Hoc Network and Sensor Networks” (2004). He was a Vice Co-Chair, Wireless IP Symposium of WirelressCOM2005, USA (2005) and a Workshop Co-Chair of the 2001 Mobile Computing Workshop, Taiwan. Dr. Chen also served as IASTED Technical Committee on Telecommunications for 2002–2005, WSEAS International Scientific Committee Member (from 2004), Program Committee Member of IEEE ICPP'2003, IEEE ICDCS'2004, IEEE ICPADS'2001, ICCCN'2001–2005, MSN'2005, IASTED CCN'2002–2005, IASTED CSA'2004–2005, IASTED NCS'2005, and MSEAT'2003–2005. His paper wins the 2001 IEEE 15th ICOIN-15 Best Paper Award. Dr. Chen was a recipient of the 2005 Young Scholar Research Award given by National Chung Cheng University to four young faculty members, 2005. His recent research topics include mobile ad-hoc network, wireless sensor network, mobile learning system, and 4G system. Dr. Chen is a member of the IEEE Computer Society, IEICE Society, and Phi Tau Phi Society. Keng-Shau Liu received the M.S. degree in Computer Science and Information Engineering from National Chung Cheng University, Taiwan, Republic of China, in July 2004. His research includes wireless LAN, Bluetooth, and mobile learning.  相似文献   
3.
Providing guaranteed quality of service (QoS) in wireless networks is a key issue for deploying multimedia applications. To support such a QoS, an arduous problem concerning how to find a feasible end to end path to satisfy multiple QoS constraints should be studied. In general, multi-constrained path selection, with or without optimization, is an NP-complete problem that cannot be exactly solved in polynomial time. Approximation algorithms and heuristics with polynomial and pseudo-polynomial time complexities are often used to deal with this problem. However, existing solutions suffer either from excessive computational complexities that cannot be used for multimedia applications in ad hoc networks characterized by mobility and performance constraints (e.g., limited energy, wireless medium, etc.). Recently a promising heuristic algorithm H_MCOP using a non linear Lagrange relaxation path functions has demonstrated an improvement in its success rate and in finding feasible paths. However, the H_MCOP is not suitable for ad hoc networks and has not exploited the full capability that a Lagrange relaxation could offer. In this paper, we propose an efficient multi-constrained path heuristic called E_MCP, which exploits efficiently the Lagrange relaxation and enhances the path search process to be adequate to mobile ad hoc networks. Using extensive simulations on random mobile network with correlated and uncorrelated link weights, we show that the same level of computational complexity, E_MCP can achieve a higher success ratio of finding feasible paths.  相似文献   
4.
Dynamic Adaptive Routing for a Heterogeneous Wireless Network   总被引:1,自引:0,他引:1  
This paper presents an integrated architecture of a Heterogeneous Wireless Network (HWN) and a dynamic adaptive routing protocol (DARP) for a HWN. To allow mobile users versatile communication with anyone or any device at any place and anytime, HWN integrates cellular network with an ad hoc network (independent Basic Service Set) in wireless local area network (WLAN) and reserves advantages of sizable coverage in a cellular network and high data rate in deployable ad hoc network. It also enlarges the scope of communication for ad hoc network and improves the throughput for cellular network. Consequently, nodes in HWN can communicate with each other or access Internet ubiquitously. We also address the routing issues for HWN, because the routing protocol for HWN is different from those used in cellular network or ad hoc network. The dynamic adaptive routing protocol establishes a better path for the source to arrive at the destination across multiple hops or cellular network and provides appropriate QoS (quality of service) in HWN.Through simulation, we will demonstrate the merit of the HWN, proposed routing performance on HWN and overhead of control traffic. A performance analysis of the proposed protocol is depicted. The results of the analysis, and simulations, are presented and discussed.  相似文献   
5.
QoS routing mechanisms allow users identify paths that can accommodate their performance requirements and reserve the necessary resources. An important problem is how to conduct such resource allocation efficiently, not only from the single-connection, but also from the network point of view. We propose the use of pricing mechanisms as a means to regulate the users' decisions in a networkwide efficient manner. Focusing on QoS architectures that employ rate-based schedulers, we formulate a congestion-based pricing scheme. We establish the structure of the corresponding user-optimal response, i.e., a path selection algorithm that satisfies the user's requirements at minimal cost. We show that the underlying noncooperative game among users has a unique equilibrium, for any particular choice of price functions. Then, we establish the existence of incentive compatible price functions, which drive the network into an equilibrium point that coincides with the optimum of a social function. Specifically, these price functions are the derivatives of the social function. We then extend our results to scenarios in which users can identify only sub-optimal paths, as is often the case with multi-constrained path optimization.  相似文献   
6.
Cross-Layer Design for Data Accessibility in Mobile Ad Hoc Networks   总被引:14,自引:0,他引:14  
Mobile ad hoc networks (MANET) are becoming an integral part of the ubiquitouscomputing and communication environment, providing new infrastructure formultimedia applications such as video phone, multimedia-on-demand, and others.In order to access multimedia information in MANET, Quality of Service (QoS)needs to be considered, such as high success rate to access multimedia data,bounded end-to-end delay, and others. In this paper, we present a dataaccessibility service for a group of mobile users to access desired data withhigh success rate. This accessibility service is only possible if we utilizeadvanced data advertising, lookup and replication services, as well as a novelpredictive location-based QoS routing protocol in an integrated fashion. Usingcross-layer design, we illustrate how the QoS routing protocol assists dataadvertising, lookup and replication services to achieve high data accesssuccess rate. Simulation results have shown that our design is successful ina dynamic MANET.  相似文献   
7.
A Multi-Path QoS Routing Protocol in a Wireless Mobile Ad Hoc Network   总被引:2,自引:0,他引:2  
A mobile ad hoc network (MANET) is one composed of a set of mobile hosts capable of communicating with each other without the assistance of base stations. This paper considers the QoS (quality-of-service) routing problem in a MANET, which is important for many real-time multimedia applications. We propose an on-demand protocol for searching for a multi-path QoS route from a source host to a destination host in a MANET, where a multi-path is a network with a source and a sink satisfying certain bandwidth requirement. Existing works all try to find a uni-path to the destination. The basic idea is to distribute a number of tickets from the source, which can be further partitioned into subtickets to search for a satisfactory multi-path. Through simulations, we justify that the value of our multi-path protocol is in its flexibility: (i) when the network bandwidth is very limited, it can offer a higher success rate to find a satisfactory QoS route than those protocols which try to find a uni-path, and (ii) when the network bandwidth is sufficient, it can perform almost the same as those protocols which try to find a uni-path (in both routing overhead and success rate).  相似文献   
8.
QoS Routing for Mesh-Based Wireless LANs   总被引:1,自引:0,他引:1  
Wireless LANs with their increased data rate become an attractive technology for connecting mobile users to the Internet. Efficient deployment of wireless LANs will require the ability to extend the wireless LANs coverage without the need to deploy a very large number of access points. Mesh-based wireless LANs are an attractive solution to this problem. These networks extend wireless LAN coverage by using each node in the network as a router, resulting in a multihop topology. In this paper we introduce a novel routing algorithm, wireless mesh routing (WMR), that provides quality-of-service (QoS) support and accounts for the characteristics of both infrastructure-based wireless LANs and ad hoc networks. The algorithm is validated using the OPNET modeler. The simulation results show that the mesh network using WMR protocol can provide QoS support and react dynamically to the network status changes with low control overheads. Using the proposed software architecture the proposed routing protocol can be implemented with any MAC protocol, resulting in easy implementation in existing wireless nodes.  相似文献   
9.
When an ATM node discovers that it cannot continue the setup of a virtual channel under the requested Quality of Service (QoS), it initiates a backtracking procedure called crankback. We propose a novel scheme, referred to as crankback prediction, that decreases the crankback overhead. Under the proposed scheme, nodes check during the connection admission control procedure whether the establishment of a virtual channel has a good chance to be admitted over the entire designated route. If this is not the case, crankback is initiated even before a particular QoS parameter is violated. The main idea behind the proposed scheme is to allocate a quota to the Peer Groups (PGs) along the message path, and then to suballocate this quota to the child PGs of these PGs. This process continues recursively until reaching the 1-level PG, which contains only physical nodes. The main advantage of the proposed scheme is that it lowers the setup delay and the processing and communication load imposed by signaling messages that establish unused portions of Virtual Channels (VCs)  相似文献   
10.
针对卫星网络链路时延长和拓扑时变的特点,给出一种可满足时延限制且在业务持续时间内尽可能不发生中断的时延受限最优寻路(SDCOP)算法,该算法通过预测拓扑链接情况来有效降低链路切换对网络QoS的影响,且具有计算复杂度低,可适应星上设备处理能力的要求等优点。仿真表明算法在计算复杂性、业务阻塞率以及业务中断率方面都优于同类算法。  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号