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

A routing Algorithm for WiFi-Based Wireless Sensor Network and the Application in Automatic Meter Reading

MATHEMATICAL PROBLEMS IN ENGINEERING 2013年第1期2013卷 1-9页

作者： Li, Li Hu, Xiaoguang Zhang, Baochang BeiHang Univ Sch Automat Sci & Elect Engn Beijing 100191 Peoples R China BeiHang Univ Sch Automat Sci & Elect Engn Sci & Technol Aircraft Control Lab Beijing 100191 Peoples R China

The Automatic Meter Reading (AMR) network for the next generation Smart Grid is required to possess many essential functions, such as data reading and writing, intelligent power transmission, and line damage detection. However, the traditional AMR network cannot meet the previous requirement. With the development of the WiFi sensor node in the low power cost, a new kind of wireless sensor network based on the WiFi technology can be used in application. In this paper, we have designed a new architecture of WiFi-based wireless sensor network, which is suitable for the next generation AMR system. We have also proposed a new routing algorithm called Energy Saving-Based Hybrid Wireless Mesh Protocol (E-HWMP) on the premise of current algorithm, which can improve the energy saving of the HWMP and be suitable for the WiFi-based wireless sensor network. The simulation results show that the life cycle of network is extended.

关键词： routing algorithms WIRELESS Internet WIRELESS sensor networks APPLICATION software AUTOMATIC meter reading SMART power grids

来源：评论

学校读者我要写书评

暂无评论

Impact of the routing techniques on the wireless sensor networks performance

ELEKTROTEHNISKI VESTNIK-ELECTROCHEMICAL REVIEW

引用

ELEKTROTEHNISKI VESTNIK-ELECTROCHEMICAL REVIEW 2013年第4期80卷 153-158页

作者： Gogie, Asmir Mahmutbegovic, Amar Mujcic, Aljo Zajc, Matej Cavdar, Ismail Hakki Suljanovic, Nermin Univ Tuzla Fac Elect Engn Franjevacka 2 Tuzla 75000 Bosnia & Herceg Univ Ljubljana Fac Elect Engn Digital Signal Image & Video Proc Lab Ljubljana 1000 Slovenia Karadeniz Tech Univ Dept Elect Trabzon Turkey

The paper analyzes the performance of the wireless sensor network (WSN) from the standpoint of routing algorithm related tos battery-discharge process. Using an experimental WSN implemented with Arduino Uno and XBee modules, measurements are made, of the packet delay and battery-discharge rate. Measurement results are compared with the simulation results obtained in the OMNeT++ simulation environment. The paper provides a short overview of difficulties and challenges commonly encountered in WSN design. The measurement results show that Arduino in its native form is not suitable for the WSN processing unit because its high current value during the sleep mode.

关键词： Wireless sensor network routing algorithms medium access control battery-consumption estimation

来源：评论

学校读者我要写书评

暂无评论

Control of traffic driven epidemic spreading by specifying routing strategy

引用

ICIC Express Letters 2013年第11期7卷 2981-2986页

作者： Shao, Fei Jiangsu Information Analysis Engineering Laboratory Jinling Institute of Technology No. 99 Hongjing Rd. Nanjing 211169 China Center for Control and Intelligence Technology Nanjing University of Posts and Telecommunications No. 66 New Mofan Rd. Nanjing 210003 China

How traffic dynamics shape the process of epidemic spreading in many real world networks is of great interest. The propagation velocity and the epidemic threshold have been proven to have significant relationship with the node betweenness in traffic driven epidemic spreading model. A novel strategy to control the epidemic spreading in scale-free networks by specifying routing strategy to reshape the distribution of the node betweenness is proposed in this paper. Simulations on both computer-generated and real world networks show that our control strategy can reduce propagation velocity and enhance epidemic threshold in scale free network greatly which means it can restrain the traffic driven epidemic spreading. Furthermore the efficiency of our control strategy is affected by the node number and the average node degree in scale free network. © 2013 ISSN 1881-803X.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

BeesAnts: a new nature- inspired routing algorithm

引用

INTERNATIONAL JOURNAL OF COMMUNICATION NETWORKS AND DISTRIBUTED SYSTEMS 2013年第1期10卷 83-97页

作者： Al Maghayreh, Eslam Abu Al-Haija, Sallam Alkhateeb, Faisal Aljawarneh, Shadi Al-Shawakfa, Emad Yarmouk Univ Fac Informat Technol & Comp Sci Dept Comp Sci Irbid 21163 Jordan Isra Univ Sci & IT Fac Amman 11622 Jordan Yarmouk Univ Fac Informat Technol & Comp Sci Comp Informat Syst Dept Irbid 21163 Jordan

In this paper, we have introduced a new multi-agent nature-inspired routing algorithm. The algorithm is referred to as the BeesAnts algorithm. It is a combination of the ant colony-based routing algorithm (ARA) and the BeeHive-based routing algorithm. The proposed routing algorithm works effectively on networks consisting of two parts;one is a fixed network and the other is a mobile ad hoc network (MANET). It applies the ARA routing algorithm on the mobile part and the BeeHive routing algorithm on the fixed part. The experimental results and the statistical analysis have demonstrated that the BeesAnts routing algorithm outperforms its ancestor, the ARA routing algorithm, in terms of the propagation delay, the queue delay, and the number of hops.

关键词： mobile ad hoc networks MANETs routing algorithms swarm intelligence ant colony-based routing beehive-based routing

来源：评论

学校读者我要写书评

暂无评论

A routing algorithm with virtual optimal hop characteristics based on greedy forwarding

引用

BioTechnology: An Indian Journal 2013年第5期8卷 676-686页

作者： Jia, Xiaoqiang Ge, Chunping School of Mathematics and Information Science Institute of Applied Mathematics Weinan Normal University Weinan 714099 Shaanxi China School of Physics and Electrical Engineering Weinan Normal University Weinan 714099 Shaanxi China

In the modern wireless sensor networks, greedy forwarding is widely used in geographic routings. However, the "routing void problem" is always around. In order to solve the "routing void problem" in the modern wireless sensor networks, a routing algorithm based on greedy forwarding is proposed by introducing Virtual optimized hop nodes. In this algorithm, as long as the network topology allows, the greedy forwarding data packets (GF) for data packet transmission is used, which will make the routing path algorithm with very high robustness, as well as the final routing path has been generated as close as possible to the shortest path routing. If the greedy forwarding fails (when the routing void problem occurs), the virtual optimal hop method is used to find the next hop node, and to make the greedy forwarding recover work also. The algorithm is simulated in the Wireless network simulation platform based on Java. When routing void problem occurs, the performance of the algorithm is compared with "GEDIR2" and "GPSR", experiments show that on the premise of the energy consumption, virtual optimal algorithm is superior to "GEDIR2" and "GPSR" on lifetime, data transmission efficiency and stability;avoid using flat graph algorithm and the flooding technology in many traditional protocol, and solve routing void problem routing inside the node topology. © 2013 Trade Science Inc. - INDIA.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

An efficient low-delay routing algorithm for community-based opportunistic network

引用

Journal of Computational Information Systems 2013年第23期9卷 9447-9456页

作者： Zhou, Junhai Lin, Yaping Zhou, Siwang Qin, Zhen School of Information Science and Engineering Hunan University Changsha 410082 China

The mobile devices with short-range wireless communication interface and carried by social people, consist of opportunistic network whose nodes have the characteristics of the community. The prevalent multi-copy message routing algorithms in opportunistic network don't consider these characteristics adequately, it will lead to higher resource consumption, higher latency and lower delivery ratio when we deploy them directly in the community-based opportunistic network. To address these issues, we present an efficient low-delay routing algorithm (ELRA), it can control the number of message copies adaptively, and depend on nodes, which hit nodes of destination community more frequently, to delivery the message to the destination community. In the destination community, ELRA completes message transmission according to a transitive utility function, and sends messages on the final hop firstly, then reduces overhead and delivery delay. Simulations results show that, compared with the SF algorithm, ELRA algorithm may ensures the message delivery ratio and reduce the number of messages forwarding, at the same time it reduces the delivery delay of about 25% in community-based opportunistic network, effectively reducing the consumption of resources. Copyright © 2013 Binary Information Press.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Domain-epidemic spray and forward routing algorithm of opportunistic networks

引用

International Journal of Information and Communication Technology 2013年第3-4期5卷 332-342页

作者： Zhang, Deng-Yin Cui, Lei Key Lab of Broadband Wireless Communication and Sensor Network Technology Nanjing University of Posts and Telecommunications Ministry of Education Nanjing 210003 China

For the current opportunistic networks routing algorithms, their message arrival rate is not high and the delivery delay is large. This paper proposes a domain-epidemic spray and forward routing algorithm. The algorithm integrates redundancy and encounter prediction strategy. According to the probability of encounters between nodes, the nodes are divided into different domains. The spray and forward strategy is used between domains and the epidemic strategy is used to forward messages within a domain. Using the message confirmation mechanism and a list which is used to record the messages that have arrived to their destination, the new algorithm can effectively reduce redundant messages. Simulation results show our algorithm can effectively improve message arrival rate and reduce end-to-end delay to some extent. © 2013 Inderscience Enterprises Ltd.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Energy efficient least spanning routing tree algorithm based on virtual grid in wireless sensor networks

引用

Sensors and Transducers 2013年第11期158卷 113-119页

作者： Zhang, Jinxue Zhang, Ming College of Electronic Engineering Huaihai Institute of Technology Jiangsu 222005 China

Due to the limitation of energy resources, energy efficiency is a key issue in wireless sensor networks (WSNs). Clustering or shortest routing are proved to be an important way to improve the scalability and prolong the lifetime of wireless sensor networks, but rarely consider the energy efficient and the shortest path at the same time. In this paper, we propose an energy efficient least spanning routing tree algorithm (EELSRT) based on clustering and virtual grid ideas to prolong network lifetime and shorten path while emphasizing energy conservation at the same time. Selecting cluster head includes initialization stage, dynamic selecting active node and dynamic selecting head stage, namely, partitions the whole network to many cluster and divides each cluster into N×N grid which there is only one active node and others are sleeping, the active node is responsible for receiving, sending and updating table in its grid, the cluster head is dynamic generates from all active nodes, head is responsible for receiving, sending and maintaining information in its cluster. Then all cluster heads dynamic constructs a least spanning routing tree to prolong network lifetime, save energy and shorten path. Simulation results show that the performance of EELSR on lifetime and energy consumption have further improved by using clustering and least spanning tree, It is a promising approach and deserves more future research. © 2013 by IFSA.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

3D geographic routing algorithm for manufacturing sensor networks

引用

Journal of Computational Information Systems 2013年第13期9卷 5075-5083页

作者： Ren, Ping Liu, Dong Science and Technology on Electromagnetic Compatibility Laboratory China Ship Development and Design Center Wuhan 430064 China School of Information Engineering Wuhan University of Technology Wuhan 430070 China

WSN (Wireless Sensor Networks), due to its superiority and flexibility, has been widely used in the manufacturing field. Owing to the characteristic of multi-hop, routing algorithm can improve the real-time performance of WSN by reducing the hop number of routing, as well as prolong the life cycle of WSN through balancing the energy consumption between sensor nodes. With the development of positioning technology, geographic routing algorithm plays an important role in WSN, which not only decrease the cost of routing algorithm, but also make the network management simpler. However, most of them are proposed for two-dimensional coordinates and can not satisfy the increasing requirement of performance. A geographic routing algorithm based on three-dimensional precise coordinates was proposed in this paper, which has the characteristic of least-hop model and lowest-cost model. Matlab simulation experimental results show that, it has reduced the hop number, extended the life cycle, saved the energy consumption, especially reduced the network delay and enhanced the real-time performance, and this is of great importance to the manufacturing sensor network. © 2013 by Binary Information Press.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

ZigBee routing algorithm based on energy optimization

引用

Sensors and Transducers 2013年第10期157卷 223-228页

作者： Wang, Wangang Peng, Yong Peng, Yongyu Chongqing City Management College No. 151 Daxuecheng South Rd Shapingba Chongqing 401331 China

In wireless sensor networks which are mainly ZigBee routing Protocol based, energy consumption of node keeps high randomness in which energy consumption condition of each node could not be predicted in advance. This leads node's energy to consume too much, makes routing efficiency be low and results in long time delay of network. Aiming at these problems, this paper introduces ZigBee routing Algorithm based on energy optimization. During the process of network operation, one energy threshold is set. If minimum residual energy of node is higher than energy threshold, AODVjr Algorithm is utilized to fully give play to its routing function. While if it is lower than energy threshold, Cluster-Tree Algorithm would be applied to reduce energy consumption. Experiment simulation indicates that the improved algorithm effectively saves total energy consumption of network, realizes load balancing and maximizes its survival time. © 2013 IFSA.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：