检索结果-内蒙古大学图书馆

2nd International Conference on Information Technology and Management Innovation (ICITMI 2013)

作者： Feng Weijun Yu Songsen S China Normal Univ Dept Elect Informat Engn Foshan Peoples R China South China Normal Univ Dept Comp Foshan Peoples R China

ISBN: (纸本)9783037858646

We have put forward a RFID routing algorithm based on virtual coordinates, on the basis of the differences and similarities between the RFID route and the WSN route. In order to solve the RFID routing problem under the environment of mobile node, this method has specified physical environment with virtual coordinates, and has found the optimal path between the source node and destination node by using scanning calculation. In the eclipse environment, the results of the experiment show that this method is more efficient and has less communication overhead.

关键词： RFID Virtual coordinates locate routing algorithm

来源：评论

学校读者我要写书评

暂无评论

A Congestion-adaptive Fault-tolerant routing algorithm on HNoC 9

A Congestion-adaptive Fault-tolerant Routing Algorithm on HN...

引用

9th IEEE Annual International Conference on Cyber Technology in Automation, Control, and Intelligent Systems (IEEE-CYBER)

作者： Fang, Juan Cheng, Yanjin Zhao, Hui Beijing Univ Technol Fac Informat Technol Beijing 100124 Peoples R China Univ North Texas Comp Sci & Engn Dept Denton TX 76203 USA

ISBN: (纸本)9781728107707

The Heterogeneous Network on Chip (HNoC) integrates CPU cores and GPU cores, as well as other components, such as Last Level Cache and Memory Controller. The various components on the chip work together. The quality of communication between components becomes critical. The GPUs have a large amount of computing resources in parallel, so it has a large number of threads. This feature makes the communication between the GPUs and the last level cache and the memory controller more frequent. The communication of each link in the traditional network on-chip is relatively average. However, the congestion near the GPU node in the heterogeneous on-chip network is serious, which affects the performance of the on-chip network. Therefore, we propose a fault-tolerant routing algorithm based on congestion awareness on HNoC. We also monitor the traffic of the network by implementing the local congestion monitor module. Heuristically determine the node and direction of the on-chip network application turning mode. In order to accurately evaluate the impact of the experimental scheme on system performance, this paper selects the Noxim NoC simulator as the basic experimental platform. Experimental comparison the proposed algorithm with the traditional fault-tolerant algorithm, in the heterogeneous network with failure rates of 5%, 10%, 15% and 20%, the average latency is reduced by 35%, 22%, 25% and 24 respectively. The average throughput saturation decreased by 12.5%, 41.7%, 23.7% and 26.3%, respectively. It has a significant improvement in performance.

关键词： Heterogeneous Network-on-Chip routing algorithm congestion-adaptive

来源：评论

学校读者我要写书评

暂无评论

A Thermal-aware Shortest Hop routing algorithm for in vivo Biomedical Sensor Networks

A Thermal-aware Shortest Hop Routing Algorithm for in vivo B...

引用

6th International Conference on Information Technology - New Generations (ITNG 2009)

作者： Tabandeh, M. Jahed, M. Ahourai, F. Moradi, S. Sharif Univ Technol Dept Elect Engn Tehran Iran

ISBN: (纸本)9781424437702

Implanted biomedical sensor networks provide a major application of sensor networks in the near future. Their high temperature due to wireless communication, might damage the surrounding tissues. This paper presents an efficient thermal-aware routing. Our proposed protocol states that when some nodes in the shortest path have a high temperature, ignores this path. The simulation results indicate the superiority of the proposed method compared to other thermal-aware routing protocols in terms of reducing temperature without a significant increase in packet delivery delay and power consumption of nodes.

关键词： biomedical Sensors routing algorithm Wireless Sensor Network (WSN)

来源：评论

学校读者我要写书评

暂无评论

A New Structure and routing algorithm for Optimizing Energy Consumption in Wireless Sensor Network for Disaster Management

A New Structure and Routing Algorithm for Optimizing Energy ...

引用

4th International Conference on Intelligent Systems, Modelling and Simulation (ISMS)

作者： Rasaneh, Setareh Banirostam, Touraj Islamic Azad Univ Cent Tehran Branch Dept Comp Engn Tehran Iran

ISBN: (纸本)9780769549637;9781467356534

By considering the benefits of using Wireless Sensor Network in Disaster Management, an appropriate structure for Wireless Sensor Network based on clustered and hierarchical models will be proposed. By applying different policies in each layer of proposed structure, energy consumption will be decreased. Furthermore, by studying the characteristics of the Wireless Sensor Network for Disaster Management, a new proper routing algorithm for using in the proposed Wireless Sensor Network will be presented. The proposed algorithm is based on some wildly used routing algorithm that adapted for the proposed structure for disaster management. By applying the proposed routing algorithm in the proposed structure energy consumption will be decreased and the time limitation for real-time data will be guaranteed. Increasing data transfer reliability is another benefit of proposed structure.

关键词： Disaster Management Energy Consumption Optimization Node routing algorithm Wireless Sensor Network

来源：评论

学校读者我要写书评

暂无评论

routing algorithm for supporting data-differentiated service in hybrid wireless mesh networks in underground mines

引用

INTERNATIONAL JOURNAL OF DISTRIBUTED SENSOR NETWORKS 2018年第11期14卷 1-1页

作者： Jiang, Haifeng Lu, Liansheng Han, Guangzhi Wang, He Ma, Shanshan Sun, Renke China Univ Min & Technol Sch Comp Sci & Technol Xuzhou 221116 Jiangsu Peoples R China

Hybrid wireless mesh networks are more suitable to tunnels in underground mines because mesh clients can perform the routing functionality and provide end-user applications. Types of data transmitted among hybrid wireless mesh networks in underground mines are diverse and power supply of clients is limited. Using virtual potential field, a routing algorithm is proposed to support data-differentiated service in hybrid wireless mesh networks. Based on network parameters, the hybrid wireless mesh networks are abstracted as potential fields. The hop count is used to build the depth potential field. The residual energy of nodes is converted into penalty factor to symbolize the used buffer spaces of nodes, which is used to construct resource potential field to support different types of data. According to the different demands of data transmission, the proportion of these two potential fields is adjusted by a regulatory factor to form a hybrid potential field. The data packets are driven to move toward the gateway in the hybrid potential field at the same time to achieve high quality of service. Simulation results demonstrate that the proposed routing algorithm has shown better performance on end-to-end delay, delivery ratio, and network lifetime, compared with similar algorithms.

关键词： Hybrid wireless mesh networks routing algorithm data-differentiated service underground mine quality of service

来源：评论

学校读者我要写书评

暂无评论

Overview of routing algorithm in Pocket Switched Networks 9

Overview of Routing Algorithm in Pocket Switched Networks

引用

International Conference on Broadband and Wireless Computing, Communication and Applications (BWCCA)

作者： Ma, Chuang Yang, Yongjian Du, Zhanwei Zhang, Chijun Jilin Univ Coll Comp Sci & Technol Changchun Peoples R China Jilin Univ Finance & Econ Coll Management Sci & Informat Engn Changchun Peoples R China

ISBN: (纸本)9781479941735

Pocket Switched Networks represent one particular intermittent communication network for handheld mobile devices. It is an important branch of delay tolerant network with broad application areas, taken as a necessary technology for human-centered pervasive computing. Compared with traditional networks, pocket switched networks have no stable topology structure. As for the other types of delay tolerant network, the nodes in pocket switched networks follow the mobility module as human society. Thus, the routing problem of pocket switched networks is more complex, and the existing works also focus their attention in this area. Technological advances of social networks are leading to a few routing protocols for pocket switched networks. A survey of current routing solutions is presented. The development of social network for pocket switched networks is introduced as three stages. Then the routing protocols for pocket switched networks are classified based on these three stages. The details of these routing protocols are shown in this paper. At last, the article discusses the trend of social based routing protocols. This work is hopefully beneficial to the researchers from the communities of pocket switched network analysis, social network mining, and pattern matching.

关键词： Delay tolerant network Pocket switched network Social network routing algorithm

来源：评论

学校读者我要写书评

暂无评论

An Optimal Power Conservation Cluster based routing algorithm using Fuzzy Verdict Mechanism for Wireless Sensor Networks

An Optimal Power Conservation Cluster based Routing Algorith...

引用

International Conference on Electrical, Electronics, Signals, Communication and Optimization (EESCO)

作者： Daniel, Ravuri Rao, Kuda Nageswara Jawaharlal Nehru Technol Univ Kakinada Vignans Inst Informat Technol Dept Informat Technol Visakhapatnam Andhra Pradesh India Andhra Univ Coll Engn A Dept Comp Sci & Syst Engn Visakhapatnam Andhra Pradesh India

ISBN: (纸本)9781479976782

Wireless Sensor Networks have found thousands of applications duo to new era of technologies like Internet of Things and Cloud to simplify the management of complex problems. Energy conservation in wireless sensor nodes is important concern to most of its applications. Duo to inherent issue of power limitation of sensor nodes, enhancing the specified network life time is the prime requirement. Therefore, an efficient routing protocol is needed to construct any real time applications of wireless sensor networks. The proposed, Fuzzy Verdict Mechanism Cluster Protocol (FVMCP) is used to construct knowledge based system effectively for the eligibility of the sensor node to be elected as a Cluster Header(CH). The eligibility of CH nodes based on their respective sensor nodes has important characteristics like duty cycle, energy level, geographical position, and number of hops. The simulation of FVMCP algorithm carried out in Mat Lab which shows enhancement of the performance accuracy up to 17 to 21 % in compassion with hard clustering methods.

关键词： Clustering Wireless Sensor Network Power Conservation Fuzzy Logic Fuzzy Verdict Mechanism routing algorithm

来源：评论

学校读者我要写书评

暂无评论

Delay Bound Multicast routing algorithm Using Evolutionary Programming

Delay Bound Multicast Routing Algorithm Using Evolutionary P...

引用

16th IEEE International Conference on Networks

作者： Jain, Sushma Sharma, Jaydev Thapar Univ Dept Comp Sci & Engn Patiala Punjab India Indian Inst Technol Dept Elect Engn Roorkee Uttar Pradesh India

ISBN: (纸本)9781424438051

The real time communication networks are designed to support multimedia applications requiring quality of services (QoS). The multicasting is needed when number of users want to communicate simultaneously. This paper present an approach based on evolutionary programming to solve the QoS constrained multicast routing problem, which is a NP complete problem. The multicast tree is obtained corresponding to optimum (minimum) routing cost subjected to end-to-end delay constraints. The algorithm is tested to obtain optimum multicast trees for different sets of source and destinations on 8-node undirected and 10-node directed networks. The convergence of the proposed algorithm is fast because it relies on mutation and selection and the optimum solution is obtained for both undirected and directed graphs.

关键词： Stainer tree Multicast routing routing algorithm Evolutionary programming

来源：评论

学校读者我要写书评

暂无评论

An Efficient History-Based routing algorithm for Interconnection Networks

An Efficient History-Based Routing Algorithm for Interconnec...

引用

International SoC Design Conference (ISOCC)

作者： Moosavi, Sanaz Rahimi Chang, Chia-Yuan Rahmani, Amir-Mohammad Plosila, Juha Man, Ka Lok Jeong, Taikyeong T. Lim, Eng Gee Univ Turku Dept Informat Technol Turku Finland Turku Ctr Comp Sci TUCS Turku Finland Xian Jiaotong Liverpool Univ Suzhou Peoples R China Myongji Univ Seoul South Korea Balt Inst Adv Technol Vilnius Lithuania

ISBN: (纸本)9781467329880;9781467329897

Network-on-chip (NoC) approach has been proposed as a solution to the complex on-chip communication problems by scaling down the concepts of macro- and tele-networks, and applying them to the system-on-chip domain. In this paper, an efficient routing algorithm for two-dimensional mesh network-on-chips is presented. The algorithm, which is based on Odd-Even turn model, is called History-Based Odd-Even (HB-OE). It is more fair and efficient in load balancing compared to the typical Odd-Even turn model algorithm. In this routing, based on the location of the current node, the network is divided into four sub-networks and the history of each sub-network regarding the direction of the last forwarded packet is saved using a flag register. We further enhance this routing by using a technique named Free-Channel to check the availability of the output ports as well as their history. To assess the latency of the proposed algorithm, transpose traffic profile for packet injection is used. The simulation results reveal that the HB-OE + Free-Channel routing policy can achieve lower latency compared to the conventional Odd-Even turn model with negligible area overhead.

关键词： Network-on-chip routing algorithm Odd-Even turn model Low latency routing

来源：评论

学校读者我要写书评

暂无评论

An Efficient routing algorithm Based on Interest Similarity and Trust Relationship Between Users in Opportunistic Networks 11th

An Efficient Routing Algorithm Based on Interest Similarity ...

引用

11th China Wireless Sensor Network Conference (CWSN)

作者： Qin, Xueyang Wang, Xiaoming Lin, Yaguang Wang, Liang Zhang, Lichen Minist Educ Key Lab Modern Teaching Technol Xian 710062 Shaanxi Peoples R China Shaanxi Normal Univ Sch Comp Sci Xian 710119 Shaanxi Peoples R China

ISBN: (纸本)9789811081231;9789811081224

In opportunistic networks, due to the randomness of node moving and the uncertainty of network topology, it's a challenging issue to establish a complete communication link between the source and the destination node. Fortunately, the "store-carry-forward" strategy can be used to solve this problem. However, such forwarding strategy heavily relies on the cooperation among nodes. Thus, the selection of a proper relay node has a great impact on the performance of the whole network. In this paper, considering the differences between users' interest and the variability of interest with the change of time, firstly, we propose a dynamic update and calculation method of the value of interests, and then establish a calculation model of interest. Secondly, according to the Ebbinghaus forgetting curve and the ability of users to forward messages, we propose a dynamic calculation method of the trust value of users and establish a model for computing trust relationships. Finally, we propose an efficient routing algorithm based on interest similarity and trust relationship (BIST) between users. The simulation results show that our proposed algorithm has better routing performance, and it validates the correctness and validity of our proposed models and algorithm.

关键词： Interest similarity Opportunistic network routing algorithm Trust relationship

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：