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

Design and Optimization of Hierarchical routing Protocol for 6LoWPAN

INTERNATIONAL JOURNAL OF DISTRIBUTED SENSOR NETWORKS 2015年第5期11卷 10-10页

作者： Liu, Ming Xu, Yang Wu, Shuai Lan, Tian Univ Elect Sci & Technol China Sch Engn & Comp Sci Chengdu 611731 Sichuan Peoples R China

To build scalable and lightweight wireless sensor networks with energy saving devices, 6LoWPAN-based protocols become emergent technologies that successfully constructed ubiquitous networks and seamlessly connected the traditional Internet with WSNs. However, the existing researches cannot effectively maintain the routing and the network topology for the problems of low cost sensors' malfunctions. In this paper, we improved the HiLow protocol in aspects of interconnection between the Internet and 6LoWPAN and designed a network routing path recovery approach. In addition, we designed and modified the address mapping table in gateway to store and map nodes' EUI-64 address and 16-bit short address. Nodes from the Internet can access the 6LoWPAN nodes by an IPv6 address, which is generated by the EUI-64 address and IPv6 prefix. Due to the benefits of additional data structure and our designs, the simulation results manifested that our protocol improves the routing efficiency and can effectively reduce the cost for network reorganization caused by node failures and mobiles.

关键词： SYSTEMS design MATHEMATICAL optimization routing algorithms COMPUTER network protocols ENERGY conservation

来源：评论

学校读者我要写书评

暂无评论

Energy Optimized routing Algorithm for Hybrid Wireless Mesh Networks in Coal Mine

引用

INTERNATIONAL JOURNAL OF DISTRIBUTED SENSOR NETWORKS 2015年第10期11卷

作者： Jiang, Haifeng Sun, Renke Ma, Shanshan China Univ Min & Technol Sch Comp Sci & Technol Xuzhou 221116 Peoples R China

Mesh clients in hybrid wireless mesh networks can participate in networking and routing. When the backbone transmission network is broken, the mesh client can route and forward the data, which will eliminate the absolute dependence on the backbone network of traditional infrastructure wireless mesh networks in mine emergency rescue. However, the energy of mesh clients is limited. Based on the comprehensive consideration of the efficiency and balance of energy consumption of mesh clients for data transmission, a new energy cost criterion is designed. Energy optimized and fault recovered routing algorithm is proposed on account of different network states. At last, the simulation analysis on the performance of routing algorithm is conducted and compared with typical routing algorithms. Simulation results show that the algorithm has effectively extended the network lifetime and achieved optimized combination of energy efficiency and energy balance. When mesh routers in the backbone network are failed, this algorithm can rapidly rebuild the route and shows strong capacity of routing recovery.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Congestion free vehicle scheduling using a route reservation strategy 18

Congestion free vehicle scheduling using a route reservation...

引用

18th IEEE International Conference on Intelligent Transportation Systems

作者： Menelaou, C. Kolios, P. Timotheou, S. Panayiotou, C. G. Univ Cyprus KIOS Res Ctr Intelligent Syst & Networks CY-1678 Nicosia Cyprus Univ Cyprus Dept Elect & Comp Engn CY-1678 Nicosia Cyprus

ISBN: (纸本)9781467365963

Traffic congestion in big cities has been proven to be a difficult problem with adverse effects in terms of driver delay and frustration, cost and impact to the environment. Motivated by the approaches used in air-traffic control, this work investigates a method for controlling traffic congestion using time-dependent route reservation. The advances in information, communication and computation technologies has made such a reservation strategy feasible. This paper illustrates that the new reservation strategy is scalable and can be applied even to large metropolitan areas. To do so, we decompose the road network spatially and temporarily and propose a vehicle scheduling and routing algorithm which completely eliminate congestion. Simulation results show that the proposed approach is very promising.

关键词： road traffic scheduling vehicle routing time-dependent route reservation strategy traffic congestion free vehicle scheduling vehicle routing algorithm Delays Junctions Roads routing US Department of Transportation Vehicle dynamics Vehicles vehicle Vehicle dynamics US Department of Transportation Vehicle routing Road traffic Junction Device Component Road Network routing traffic congestion metropolitan areas delay dispatching vehicle routing algorithms metropolis

来源：评论

学校读者我要写书评

暂无评论

引用

INTERNATIONAL JOURNAL OF DISTRIBUTED SENSOR NETWORKS 2015年第6期2015卷 16-16页

作者： Liu, Yao Huang, Jiawei Wang, Weiping Zhou, Hongjing An, Ying Wang, Jianxin Cent S Univ Sch Informat Sci & Engn Changsha 410083 Hunan Peoples R China Hunan Univ Commerce Sch Comp & Informat Engn Changsha 410205 Hunan Peoples R China Sci & Technol Informat Transmiss & Disseminat Com Shijiazhuang 050081 Hebei Peoples R China

In delay tolerant networks (DTNs), multiple-copy routing is often adopted to improve the probability of successful message delivery but causes more traffic loads. The excessive increase in multiple messages copies often exhausts the network resources and deteriorates its performance significantly. To solve this problem, a mobility similarity-based routing (SBR) algorithm is proposed in this paper. On one hand, destination similarity is used to help the message carrier node find the appropriate relay nodes with the higher opportunity to meet the destination node in order to improve the delivery ratio. On the other hand, carrier similarity is adopted to avoid sending the same copy to the nodes with mobility similarity so as to reduce the number of message copies. Furthermore, inspired by the law of diminishing marginal utility in economics, a buffer management scheme based on the message transmission status is proposed. Experimental results show that the proposed SBR routing algorithm combined with the buffer management scheme can improve the delivery ratio and has the lower overhead ratio compared to other routing algorithms.

关键词： DELAY-tolerant networks routing algorithms NETWORK performance (Telecommunication) EMAIL routing (Computer network management) PROBLEM solving

来源：评论

学校读者我要写书评

暂无评论

Efficient Multicast algorithms for Scalable Video Coding in Software-Defined Networking 26

Efficient Multicast Algorithms for Scalable Video Coding in ...

引用

26th IEEE Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)

作者： Sheu, Jang-Ping Chang, Che-Wei Chang, Yeh-Cheng Natl Tsing Hua Univ Dept Comp Sci Hsinchu 30013 Taiwan

ISBN: (纸本)9781467367820

Software-Defined Networking (SDN) is a new approach to design, build and manage computer networks. Multicast is used to transmit the same video file to different users. In this paper, we propose two multicast algorithms to solve the multicast problem in SDN environment. Both algorithms consider the balance of bandwidth utilization and communication delay between the source and clients. Simulation results show that our algorithms can improve the network bandwidth utilization and successful rate of the multicast requests than the previous works.

关键词： Bandwidth utilization multicast routing algorithms software-defined networking

来源：评论

学校读者我要写书评

暂无评论

A Consensus routing Algorithm for Mobile Distributed Systems

引用

INTERNATIONAL JOURNAL OF DISTRIBUTED SENSOR NETWORKS 2015年第10期11卷

作者： Arellano-Vazquez, Magali Benitez-Perez, Hector Ortega-Arjona, J. Univ Nacl Autonoma Mexico Posgrad Ciencia & Ingn Comp Mexico City 04510 DF Mexico Univ Nacl Autonoma Mexico IIMAS Dept Ingn Sistemas Comp & Automatizac Mexico City 01000 DF Mexico Univ Nacl Autonoma Mexico Fac Ciencias Dept Matemat Mexico City 04510 DF Mexico

This paper introduces a consensus routing algorithm based on an availability function. Such a function obtains a consensus among a group of nodes by evaluating the idle time in the scheduler of each node, along with the general conditions of the network and determining the next step of the route. In this regard, the algorithm proposed here makes it possible to avoid flooding while reducing bandwidth use and keeping changes of the network only at a local scale.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

An Efficient Bypassing Void routing Algorithm for Wireless Sensor Network

引用

JOURNAL OF SENSORS 2015年第1期2015卷

作者： Fan, Xunli Du, Feifei NW Univ Xian Sch Informat Sci & Technol Xian 710127 Peoples R China

Since the sensor node's distribution in a wireless sensor network (WSN) is irregular, geographic routing protocols using the greedy algorithm can cause local minima problem. This problem may fail due to routing voids and lead to failure of data transmission. Based on the virtual coordinate mapping, this paper proposes an efficient bypassing void routing protocol to solve the control packet overhead and transmission delay in routing void of WSN, which is called EBVRPVCM. The basic idea is to transfer the random structure of void edge to a regular one through mapping the coordinates on a virtual circle. In EBVRPVCM, some strategies, executed in different regions, are selected through virtual coordinates to bypass routing void efficiently. The regular edge is established by coordinate mapping that can shorten the average routing path length and decrease the transmission delay. The virtual coordinate mapping is not affected by the real geographic node position, and the control packet overhead can be reduced accordingly. Compared with RGP and GPSR, simulation results demonstrate that EBVRPVCM can successfully find the shortest routing path with higher delivery ratio and less control packet overhead and energy consumption.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

MPSoCSim: An extended OVP Simulator for Modeling and Evaluation of Network-on-Chip based heterogeneous MPSoCs 15

MPSoCSim: An extended OVP Simulator for Modeling and Evaluat...

引用

International Conference on Embedded Computer Systems Architectures Modeling and Simulation

作者： Wehner, Philipp Rettkowski, Jens Kleinschmidt, Tobias Goehringer, Diana Ruhr Univ Bochum Bochum Germany

ISBN: (纸本)9781467373111

In this paper a SystemC simulator for Network-on-Chip (NoC) based Multiprocessor Systems-on-Chip (MPSoCs) is presented. The simulator currently supports mesh topology with wormhole switching and several routing algorithms such as XY-, a minimal West-First and an adaptive West-First algorithm. The impact of routing algorithms regarding performance can be analyzed by means of the presented simulator. In order to simulate a heterogeneous MPSoC, ARM processors and MicroBlazes can be attached to the NoC. Processor and peripheral models used within the test platforms are provided by Imperas/OVP. Moreover, traffic generators are available to analyze the system. An additional SystemC component enables the readout of simulation time from within the application. For evaluation of the simulator multiple platforms and applications were put under test and compared with a hardware implementation. The comparison shows that the simulator improves the development of MPSoCs by early estimation of system requirements.

关键词： MPSoC simulator Network-on-Chip heterogeneous MPSoC routing algorithms OVP

来源：评论

学校读者我要写书评

暂无评论

POSOP routing Algorithm: A DTN routing Scheme for Information Connectivity of Health Centres in Hilly State of North India

引用

INTERNATIONAL JOURNAL OF DISTRIBUTED SENSOR NETWORKS 2015年第6期11卷 9-9页

作者： Johari, Rahul Gupta, Neelima Aneja, Sandhya GGSIP Univ USICT Delhi 110078 India Univ Delhi Dept Comp Sci Delhi 110007 India Univ Delhi Inst Informat & Commun Delhi 110021 India

We explore the application of partitioned network for providing health services in difficult terrain where fixed communication infrastructure is not cost-effective due to low population density and very high cost of setting up a permanent infrastructure. We propose a hybrid routing which is persistent, on-demand, scheduled, opportunistic, and predicted (POSOP) routing algorithm, that exploits various types of contacts existing in a partitioned, hybrid, and sparse network. Such networks may be used to provide guidance from specialist doctors to junior doctors working in primary health centres. We present a scenario from Uttarakhand (a state in hilly region of North India), where POSOP routing algorithm may be used to provide improved health services. Using simulations, we evaluate the performance of POSOP routing algorithm on three metrics, messages delivered, average delay suffered by the delivered messages, and average message traffic. We compare the performance of POSOP routing algorithm with two routing schemes, namely, epidemic and spray and wait on the three metrics. Our approach outperforms both the routing schemes.

关键词： routing algorithms COMPUTER simulation NETWORK performance (Telecommunication) DELAY-tolerant networks MEDICAL centers

来源：评论

学校读者我要写书评

暂无评论

An Energy-Efficient Multipath routing Algorithm Based on Ant Colony Optimization for Wireless Sensor Networks

引用

INTERNATIONAL JOURNAL OF DISTRIBUTED SENSOR NETWORKS 2015年第6期11卷 1-12页

作者： Tong, Mengjun Chen, Yangli Chen, Fangxiang Wu, Xiaoping Shou, Guozhong Zhejiang A&F Univ Sch Informat Engn Linan City 311300 Peoples R China Zhejiang Prov Key Lab Forestry Intelligent Monito Linan City 311300 Peoples R China

An energy-efficient ACO-based multipath routing algorithm(EAMR) is proposed for energy-constrained wireless sensor networks. EAMR is a hybrid multipath algorithm, which is reactive in path discovery and proactive in route maintenance. EAMR has improvement and innovation in the ant packet structure, pheromone update formula, pheromone update mode, and the mechanism of multipath. Average energy consumption and congestion of path make pheromone update formula more reasonable. Incremental pheromone update mode may easily lead to local optimum. The pheromone will be thoroughly updated when a node receives a backward ant. EAMR makes an innovation in multipath mechanism which becomes more reasonable to multipath between source node and destination node. Probabilistic routing mechanism is designed to make stream flow into network more balanced. The simulation results show that the proposed algorithm achieves an improvement in energy efficiency, packet delivery ratio, and end-to-end delay.

关键词： ENERGY consumption routing algorithms WIRELESS sensor networks MATHEMATICAL optimization ANT algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：