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

A New Heuristic routing algorithm for Fleet Size and Mix Vehicle routing Problem

GAZI UNIVERSITY JOURNAL OF SCIENCE 2014年第3期27卷 979-986页

作者： Karagul, Kenan Pamukkale Univ Honaz MYO Lojistik Bolumu TR-20330 Denizli Turkey

Ochi's approach solves the heterogenous vehicle routing problem using the constraint having fixed costs as a multiplier of residuals. However, in this approach, there is not any information about which vehicle will be assigned to the route related to this constraint. In our study, Ochi's approach is interpreted again in terms of vehicle capacity and number of customers assigned to each route. The proposed routing approach is taking the higher capacity vehicle for improving the performance. Then the solution phases of a sample problem are shown by using the given algorithm. In order to highlight the performance of the routing approach, Golden's 12 test problems (Fleet Size and Mix Vehicle routing Problem with Fixed Cost) are used. It is seen that the proposed method has better average time complexity and equal cost performances than Ochi's routing approach. Therefore, the solutions with higher capacity vehicle of the proposed method that uses vehicle type information are better than those of the methods that use residual cost based on the vehicle type information.

关键词： Fleet Size and Mix Vehicle routing Problem Constructive routing Heuristics Vehicle routing Problem routing algorithm Ochi's routing approach

来源：评论

学校读者我要写书评

暂无评论

Agent-Based Distributed routing algorithm with Traffic Prediction for LEO Satellite Network

引用

INTERNATIONAL JOURNAL OF FUTURE GENERATION COMMUNICATION AND NETWORKING 2013年第3期6卷 67-84页

作者： Na, Zhenyu Gao, Zihe Cui, Yang Chen, Liming Guo, Qing Dalian Maritime Univ Sch Informat Sci & Technol Dalian Peoples R China China Acad Space Technol Inst Telecommun Satellite Beijing Peoples R China Harbin Inst Technol Inst Sci & Technol Harbin Heilongjiang Peoples R China Harbin Inst Technol Commun Res Ctr Harbin Heilongjiang Peoples R China

Satellite network, especially low earth orbit (LEO) satellite network, which has advantages of global coverage and short round-trip time (RTT), has played an increasingly important role in the future generation of global communication network. Due to fast velocity, frequent handover and time-varying topology, designing effective routing algorithm for LEO satellite network has always been challenging. An Agent-based distributed routing algorithm with Traffic Prediction (TPARA) is proposed in this paper. TPARA algorithm, which fully takes traffic density of the surface of the Earth into account, consists of two parts: traffic prediction and routing decision. In the former, not only the heterogeneity of traffic on the ground is considered, but upcoming traffic from terrestrial terminals is predicted using an improved Kalman filtering as well. In the latter, mobile agents (MAs) are used to explore satellite network and collect routing information. The ultimate routing decision is determined by both current status and future status of satellite network. Simulation results show that, compared with the classical algorithm of ACO, TPARA not only has shorter delay, but alleviates congestion as well.

关键词： LEO satellite network routing algorithm traffic prediction mobile agent

来源：评论

学校读者我要写书评

暂无评论

Analysis of multimedia network data security based on routing algorithm

引用

INTELLIGENT DECISION TECHNOLOGIES-NETHERLANDS 2024年第1期18卷 23-32页

作者： Zheng, Li Zheng, Yuntian Wenzhou Power Co Wenzhou Zhejiang Peoples R China Chongqing Univ Coll Phys Chongqing Peoples R China

In today's society, the application of multimedia data is increasing, and the accompanying data security is also an important issue. This paper will analyze the data security of multimedia network based on routing algorithm. The advantages of wireless local area networks (WLAN) and ad hoc networks are combined in wireless mesh networks (WMNs), which have steadily grown to be a reliable method of wireless broadband access. The application of multi RF and multi-channel technology improves the performance of WMN. However, the limitation that includes the number of wireless network interface cards and channels in the network, results in the great challenges ofrouting and channel allocation in multi RF and multi-channel WMN. Based on AODV algorithm, this paper proposes a new cross layer routing algorithm which is JRCA-AODV algorithm. The simulation results demonstrate that the JRCA-AODV algorithm can successfully increase multiRF multi-channel WMN throughput while lowering packet loss rate and network delay. Take the packet rate of 8 Mbps as an example, the network throughput based on JRCA-AODV algorithm is 1.14 times that of MRMC-AODV algorithm, the packet loss rate based on JRCA-AODV algorithm is 14.06% lower than that of MRMC-AODV algorithm, and the network time delay based on JRCA-AODV algorithm is 14.27% lower than that of MRMC-AODV algorithm. At the same time, JRCA-AODV algorithm can effectively reduce the probability of data loss caused by the competitive and shared access mechanism of the channel, improve the success rate of data transmission, thus reduce the probability of data eavesdropping and tampering in the process of repeated transmission, and improve the security of multimedia network data. This will provide a new direction for promoting the idea of multimedia data security.

关键词： Multimedia network data security routing algorithm

来源：评论

学校读者我要写书评

暂无评论

The Balanced Cross-Layer Design routing algorithm in Wireless Sensor Networks Using Fuzzy Logic

引用

SENSORS 2015年第8期15卷 19541-19559页

作者： Li, Ning Martinez, Jose-Fernan Hernandez Diaz, Vicente Ctr Invest Tecnol Software & Sistemal Multimedia Madrid 28031 Spain

Recently, the cross-layer design for the wireless sensor network communication protocol has become more and more important and popular. Considering the disadvantages of the traditional cross-layer routing algorithms, in this paper we propose a new fuzzy logic-based routing algorithm, named the Balanced Cross-layer Fuzzy Logic (BCFL) routing algorithm. In BCFL, we use the cross-layer parameters' dispersion as the fuzzy logic inference system inputs. Moreover, we give each cross-layer parameter a dynamic weight according the value of the dispersion. For getting a balanced solution, the parameter whose dispersion is large will have small weight, and vice versa. In order to compare it with the traditional cross-layer routing algorithms, BCFL is evaluated through extensive simulations. The simulation results show that the new routing algorithm can handle the multiple constraints without increasing the complexity of the algorithm and can achieve the most balanced performance on selecting the next hop relay node. Moreover, the Balanced Cross-layer Fuzzy Logic routing algorithm can adapt to the dynamic changing of the network conditions and topology effectively.

关键词： cross-layer design routing algorithm fuzzy logic balanced performance dynamic weight

来源：评论

学校读者我要写书评

暂无评论

Network performance optimisation using triple interleaving routing algorithm for oil and gas pipeline network

引用

INTERNATIONAL JOURNAL OF COMMUNICATION NETWORKS AND DISTRIBUTED SYSTEMS 2022年第2期28卷 147-170页

作者： Lee, Mohamad Yusry Lee Ikhwan Azman, Amierul Syazrul Azril Subramaniam, Siva Kumar Feroz, Farah Shahnaz Univ Teknikal Malaysia Melaka UTeM Fak Kejuruteraan Elekt & Kejuruteraan Komputer Melaka Malaysia Univ Teknikal Malaysia Melaka UTeM Fak Kejuruteraan Elekt & Kejuruteraan Komputer Adv Sensors & Embeded Controls Syst ASECS Melaka Malaysia Univ Teknikal Malaysia Melaka UTeM Fak Kejuruteraan Elekt & Kejuruteraan Komputer Pervas Comp & Educ Technol PET Melaka Malaysia

As demand for oil and gas increases, demands for a safe and efficient system for remote control and pipeline management also increases. The wireless sensor network (WSN) can facilitate real-time data transmission between sensor nodes and centralised monitoring stations. In this application, nodes are distributed in a linear chain configuration to cover long-distance pipelines in the midstream. When the size of the network increases, the performance of WSN is compromised. Consequently, the network has a substantially low throughput, low delivery ratio, high latency, high energy consumption, and unfairness. In this paper, ad-hoc on-demand distance vector triple interleaving (AODVTRI), a reactive protocol that reduced routing inconsistency by splitting the network traffic into three separate routes with the consideration of x-axis is proposed. The proposed routing protocol was evaluated with AODV and DSDV with 20, 40, 60, 80, 100, 120, 140, 160, 180, and 200 node deployments in accordance with IEEE802.11 standard.

关键词： WSN linear oil and gas pipeline LWSN routing algorithm multi-hop

来源：评论

学校读者我要写书评

暂无评论

Load balancing and data aggregation tree routing algorithm in wireless sensor networks

引用

JOURNAL OF HIGH SPEED NETWORKS 2015年第2期21卷 121-129页

作者： Zhang, Jing Yang, Ting Zhao, Chengli Tianjin Polytech Univ Engn Teaching Practice Training Ctr Tianjin 300387 Peoples R China Tianjin Univ Sch Elect Engn & Automat Tianjin Peoples R China Tianjin Nav Instruments Res Inst Tianjin Peoples R China

Wireless sensor networks have received increasing attention in recent years and have proven their capability in dealing with problems occurring in wide areas with difficult access. In other types of sensor networks, the nodes can modify their position to better adapt to changes in the monitored phenomenon. Thus, routing is one of the important issues to be considered for a WSN. In this paper, a distributed algorithm is proposed to ensure that the mean square deviation of the number of member nodes within each cluster is as small as possible, thus effectively balancing the number of member nodes among each cluster. The cluster-based algorithms has proven to be better than multi-hop routing. In this paper, a novel, energy-efficient, cluster-based routing algorithm for a WSN is proposed. To evaluate the efficiency of the proposed algorithm, we studied its performance in a sensor network against other applied algorithms. The simulation results indicate that the network load balancing of the Node Local Density Load Balancing (NLDLB) algorithm is better than that of other join cluster models, and that the Load Balancing and Data Aggregation Tree routing (LBDATR) algorithm can greatly reduce the energy consumption of a node, thus efficiently extending the lifecycle of the network and enhancing its robustness.

关键词： Wireless sensor networks clustering local density load balancing data aggregation tree routing algorithm

来源：评论

学校读者我要写书评

暂无评论

Study on the routing algorithm of airport navigation lighting system based on mobile wireless ad hoc network

引用

JOURNAL OF COMPUTATIONAL METHODS IN SCIENCES AND ENGINEERING 2020年第4期20卷 1085-1096页

作者： Wu, Huazhu Guo, Wenyou Dalian Jiaotong Univ Fac Elect & Informat Engn Dept Automat Dalian Liaoning Peoples R China

Currently, the performance of the conventional airport navigation lighting system can't meet the functional requirements of an airport under combat readiness or emergency state. A new type of airport navigation lighting system in mobile wireless ad hoc network is proposed in this paper. The system consists of a monitoring center, a coordinator and a number of terminal nodes. It can be flexibly transferred, concealed in time, remotely controlled, quickly started and networked on demand. According to the functions and the distribution characteristics of the navigation luminaries in the airfields, the terminal nodes are grouped according to regions. The cluster heads are selected in each group according to the energy of nodes and the distribution distance between nodes. By comparing the advantages and the disadvantages between the Cluster-Tree protocol and the AODVjr protocol, an optimized routing algorithm is proposed. In order to reduce the number of hops of RREQ broadcast packets and prevent the invalid RREQ flooding, this algorithm adopts the neighbor table algorithm of ZigBee protocol and regional grouping method. The results of the simulations and the test of small-scale hardware show that this optimization algorithm can effectively reduce the number of routing hops, shorten the transmission delay, reduce the number of dead nodes and improve the success rate of data transmission.

关键词： Wireless ad hoc network ZigBee routing algorithm airport navigation lighting system

来源：评论

学校读者我要写书评

暂无评论

E-XY: an entropy based XY routing algorithm

引用

INTERNATIONAL JOURNAL OF GRID AND UTILITY COMPUTING 2019年第2期10卷 179-186页

作者： Punhani, Akash Kumar, Pardeep Nitin Jaypee Univ Informat Technol Dept Comp Sci & Engn Solan Himachal Prades India Univ Cincinnati CEAS EECS 812 A Rhodes Hall2851 Woodside Dr Cincinnati OH 45219 USA

In recent years, Network on Chip (NoC) is used to handle the communication issues between cores or processing elements. The major drawback of existing XY routing algorithm for mesh topology is its inability to handle a high traffic load. In this paper, an E-XY (Entropy based XY) routing algorithm is proposed to generate information about the adjacent router based on previously communicated packets. Tests have been carried out on a mesh topology of 8x8 simulated using Omnet++ 4.4.1 using HNOCS version. Different types of traffic have been considered for result computation including uniform, bit complement, neighbour and tornado. The proposed algorithm is compared with other routing algorithms including XY, IX/Y and Odd Even. Results demonstrate that the proposed algorithm is comparable to XY routing algorithm up to the load factor of 0.8 and performs well than the XY, IX/Y and Odd Even routing algorithms with the increase in load.

关键词： routing algorithm adaptive parallel communication router architecture maximum entropy model

来源：评论

学校读者我要写书评

暂无评论

An Ant Colony based routing algorithm for Wireless Sensor Network

引用

INTERNATIONAL JOURNAL OF FUTURE GENERATION COMMUNICATION AND NETWORKING 2016年第6期9卷 75-86页

作者： Liu, Xiaodong Li, Songyang Wang, Miao Henan Inst Engn Sch Comp Zhengzhou 451191 Peoples R China

Wireless sensor network (WSN) is a new research area of computer science and technology and has a wide application future, more and more attention. It will be much market in application of military, health, home, environment, etc. In WSN, sensor devices have limited supply of energy. The sensor death due to dissipating battery energy is one of the fundamental design issues in WSNs. Hence, energy efficiency is argued to be the most important requirement for WSN Aiming at the limitation of energy of wireless sensor network node, this paper presents a routing algorithm which is based on the ant's capability of finding the best paths between a food source and their nests. The pheromone and the energy of the node and delay of the node were combined to affect the pheromone concentration in optimization. Simulation results show that it can balance energy consumption between nodes and prolong the lifecycle of the whole network.

关键词： routing algorithm wireless sensor network ant colony

来源：评论

学校读者我要写书评

暂无评论

Enhanced Long Edge First routing algorithm and Evaluation in Large-Scale Networks-on-Chip 11

Enhanced Long Edge First Routing Algorithm and Evaluation in...

引用

11th IEEE International Symposium on Embedded Multicore/Many-Core Systems-on-Chip (MCSoC)

作者： Van Chu, Thiem Kang, Myeonggu Fa, Shi Kise, Kenji Tokyo Inst Technol Dept Comp Sci Tokyo Japan Korea Adv Inst Sci & Technol Sch Elect Engn Daejeon South Korea

ISBN: (纸本)9781538634417

Networks-on-Chip (NoCs) have been developed to be the on-chip interconnects of many-core systems. routing is one of the most important factors that determine NoC performance. In this paper, we enhance LEF (Long Edge First), a routing algorithm proposed for the commonly used 2D meshes. LEF chooses one of the two dimension-ordered routing algorithms (XY or YX) for each packet based on the relative position between the source node and the destination node. LEF avoids deadlock by restricting the use of certain virtual channels (VCs). In particular, one VC of each channel in the X (Y) dimension is reserved exclusively for packets routed with the YX (XY) algorithm. However, we found that it is not necessary to restrict the use of VCs in both X and Y dimensions. We prove that restricting the use of VCs in only one dimension is enough for deadlock avoidance. In this way, the VCs in one dimension can be allocated to any packet. We also modify the method of choosing XY or YX routing to further improve the VC utilization. Our evaluation using a fast and cycle-accurate FPGA-based NoC simulator shows that, in small-scale NoCs (8 x 8 and 16 x 8), the enhanced LEF (LEF++) outperforms both the original LEF and the dimension-ordered routing algorithms. Under a uniform traffic, LEF++ achieves a maximum of 6% improvement of throughput than LEE Under a non-uniform traffic, LEF++ also performs better than LEF and provides up to 36.7% higher throughput than the dimension-ordered routing algorithms. The FPGA-based NoC simulator enables us to investigate how the routing algorithms behave in large-scale NoCs with thousands of nodes. Like in small-scale NoCs, both LEF and LEF++ can achieve higher throughputs than the dimension-ordered routing algorithms under the hotspot traffic. However, we observe a phenomenon that does not occur in small-scale NoCs. Large-scale NoCs adopting LEF/LEF++ are generally unstable at extremely high loads. This is evident in that simulation results of small-scale

关键词： Network-on-Chip routing algorithm Long Edge First (LEF) FPGA-based NoC simulator

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：