Improving Reactive Ad Hoc Routing Performance by Geographic Route Length

In order to help reactive ad hoc routing protocols select better-performance routes, a novel metric named geographic route length （GRL） is proposed. The relationship between GRL metric and routing performance is analyzed in detail. Combined with hop metric, GRL is applied into the original ad hoe on-demand distance vector （AODV） to demonstrate its effectiveness. Simulation experiments have shown that GRL can effectively reduce packet delay and route discovery frequency, thus can improve reactive ad hoc routing performance.

Comparative Study of Proactive, Reactive and Geographical MANET Routing Protocols

Mobile Adhoc Network (MANET) is defined as a combination of mobile nodes that lack a fixed infrastructure and is quickly deployable under any circumstances. These nodes have self-aware architecture and are able to move in multiple directions, which renders it dynamic topology. Its dynamicity makes routing in MANET rather challenging compared to fixed wired networks. This paper aims to perform a comparative study on the three categories of MANET routing protocol by comparing their characteristics and operations, as well as their strength and weaknesses.

Geographic Drone-based Route Optimization Approach for Emergency Area Ad-Hoc Network

Wireless sensor Mobile ad hoc networks have excellent potential in moving and monitoring disaster area networks on real-time basis.The recent challenges faced in Mobile Ad Hoc Networks(MANETs)include scalability,localization,heterogeneous network,self-organization,and self-sufficient operation.In this background,the current study focuses on specially-designed communication link establishment for high connection stability of wireless mobile sensor networks,especially in disaster area network.Existing protocols focus on location-dependent communications and use networks based on typically-used Internet Protocol(IP)architecture.However,IP-based communications have a few limitations such as inefficient bandwidth utilization,high processing,less transfer speeds,and excessive memory intake.To overcome these challenges,the number of neighbors(Node Density)is minimized and high Mobility Nodes(Node Speed)are avoided.The proposed Geographic Drone Based Route Optimization(GDRO)method reduces the entire overhead to a considerable level in an efficient manner and significantly improves the overall performance by identifying the disaster region.This drone communicates with anchor node periodically and shares the information to it so as to introduce a drone-based disaster network in an area.Geographic routing is a promising approach to enhance the routing efficiency in MANET.This algorithm helps in reaching the anchor(target)node with the help of Geographical Graph-Based Mapping(GGM).Global Positioning System(GPS)is enabled on mobile network of the anchor node which regularly broadcasts its location information that helps in finding the location.In first step,the node searches for local and remote anticipated Expected Transmission Count(ETX),thereby calculating the estimated distance.Received Signal Strength Indicator(RSSI)results are stored in the local memory of the node.Then,the node calculates the least remote anticipated ETX,Link Loss Rate,and information to the new location.Freeway Heuristic algorithm improves the data speed,efficiency and determines the path and optimization problem.In comparison with other models,the proposed method yielded an efficient communication,increased the throughput,and reduced the end-to-end delay,energy consumption and packet loss performance in disaster area networks.

Safety Evaluation Method of Evacuation Routes in Areas in Case of Earthquake Disasters Using Ant Optimization Algorithm and Geographic Information Systems

The present study aims to propose the method for the quantitative evaluation of safety concerning evacuation routes in case of earthquake disasters in urban areas using ACO （Ant Colony Optimization） algorithm and GIS （Geographic Information Systems）. Regarding the safety evaluation method, firstly, the similarity in safety was focused on while taking into consideration road blockage probability, and after classifying roads by means of the hierarchical cluster analysis, the congestion rates of evacuation routes using ACO simulations were estimated. Based on these results, the multiple evacuation routes extracted were visualized on digital maps by means of GIS, and its safety was evaluated. Furthermore, the selection of safe evacuation routes between evacuation sites, for cases when the possibility of large-scale evacuation after an earthquake disaster is high, is made possible. As the safety evaluation method is based on public information, by obtaining the same geographic information as the present study, it is effective in other areas regardless of whether the information is of the past and future. Therefore, in addition to spatial reproducibility, the safety evaluation method also has high temporal reproducibility. Because safety evaluations are conducted on evacuation routes based on quantified data, highly safe evacuation routes that are selected have been quantitatively evaluated, and thus serve as an effective indicator when selecting evacuation routes.

Multipath Grid-Based Enabled Geographic Routing for Wireless Sensor Networks

This work proposes an efficient disjoint multipath geographic routing algorithm for dense wireless sensor networks (WSN), called Multipath Grid-based Enabled Geographic Routing (MGEGR). The proposed algorithm relies on the construction of a 2-D logical grid in the geographical region of deployment. The objective of the proposed scheme is to determine optimal or near-optimal (within a defined constant) multiple disjoint paths (multipath) from a source node to the sink, in order to enhance the reliability of the network. The determined multiple disjoint paths would be used by the source node in a round-robin way to balance the traffic across the disjoint paths, and to avoid discovered paths with cell holes. The proposed scheme limits the use of broadcasting to the process of gateway election within each cell, and the process of maintaining the table of neighbors of each gateway. Our simulation results show the effectiveness and scalability of our routing scheme with increased network size compared to on-demand routing protocols.

Search Methods for Evacuation Routes during Torrential Rain Disasters Using Genetic Algorithms and GIS

The present study aims to propose a method to search for the most appropriate evacuation routes that take calorie consumption required for evacuees to reach evacuation sites into consideration, by focusing on disasters caused by heavy rainfall, and using genetic algorithm (GA) and geographic information system (GIS). Specifically, GA was used to design and develop an evacuation route search algorithm and 4 parameters including the number of generations, mutation rate number of individuals and crossover rate were set by conducting sensitivity analyses. Additionally, GIS was also used to create road network data and contour data for digital maps and calculate the altitude of each crossover point. Based on these, the necessary calorie consumption to reach evacuation sites for each route was calculated, and that made it possible to derive the several evacuation routes with the small values unlike other methods. By using GA and GIS to suggest detailed evacuation routes, which take the necessary calories required to reach evacuation sites into consideration, it can be expected that the present study should contribute to the decision-making of evacuees. Additionally, as the method is based on public information, the method has high spatial and temporal repeatability. Because evacuation routes are proposed based on quantified data, the selected evacuation routes are quantitatively evaluated, and are an effective indicator for deciding on an evacuation route. Additionally, evacuation routes that accurately reflect current conditions can be derived by utilizing detailed information as data.

Tourist Route Model Formulation Method Considering Spatial Reproducibility

This study aims to gradually reflect information concerning tourists and to propose tourist route model formulation techniques that take spatial reproducibility into account using GIS （geographic information systems）. The conclusions can be summarized into the following three points： （1） Kawagoe city in Saitama Prefecture was selected as the area targeted by this study. All types of data about Kawagoe city and tourists was collected and processed, and a tourist route model formulation method that considered spatial reproducibility using GIS was proposed, （2） 3-stage scenarios were created with the presence or absence of Kawagoe city tourist policies set as standards and this was used to develop tourist route models. It is POSsible to expect synergy in the encouragement of the use of sightseeing buses and the same traffic regulations as the traffic pilot program, and （3） It is considered that it is possible to apply the tourist route model formulation method proposed by this study to other tourist destinations without being limited by spatiotemporal differences or the particular issues of each tourist destinations as spatial reproducibility was confirmed.

Route Search Method for Railway Replacement Buses Adopting Ant Colony Optimization

In recent years, Japan, and especially rural areas have faced the growing problems of debt-ridden local railway lines along with the population decline and aging population. Therefore, it is best to consider the discontinuation of local railway lines and introduce replacement buses to secure the transportation methods of the local people especially in rural areas. Based on the above background, targeting local railway lines that may be discontinued in the near future, appropriate bus stops when provided with potential bus stops were selected, the present study proposed a method that introduces routes for railway replacement buses adopting ant colony optimization (ACO). The improved ACO was designed and developed based on the requirements set concerning the route length, number of turns, road width, accessibility of railway lines and zones without bus stops as well as the constraint conditions concerning the route length, number of turns and zones without bus stops. Original road network data were generated and processed adopting a geographic information systems (GIS), and these are used to search for the optimal route for railway replacement buses adopting the improved ACO concerning the 8 zones on the target railway line (JR Kakogawa line). By comparing the improved ACO with Dijkstra’s algorithm, its relevance was verified and areas needing further improvements were revealed.

Location-Based Routing Protocols for Wireless Sensor Networks: A Survey

Recently, location-based routings in wireless sensor networks (WSNs) are attracting a lot of interest in the research community, especially because of its scalability. In location-based routing, the network size is scalable without increasing the signalling overhead as routing decisions are inherently localized. Here, each node is aware of its position in the network through some positioning device like GPS and uses this information in the routing mechanism. In this paper, we first discuss the basics of WSNs including the architecture of the network, energy consumption for the components of a typical sensor node, and draw a detailed picture of classification of location-based routing protocols. Then, we present a systematic and comprehensive taxonomy of location-based routing protocols, mostly for sensor networks. All the schemes are subsequently discussed in depth. Finally, we conclude the paper with some insights on potential research directions for location-based routing in WSNs.

A Trusted Routing Protocol Based on GeoDTN＋Nav in VANET

Because the node of vehicular ad-hoc networks has the characteristics of high mobility and encounter temporary, a trust management between the nodes in the routing process becomes more difficult. To solve this problem, this paper proposes a new trusted routing protocol in VANET based on GeoDTN＋Nav by using trust management model of Bayesian and the three opportunistic routing forwarding models, which includes four steps of the routing initialization, the routing discovery, the trusted routing establishment and the routing deletion. The proposed protocol not only improves the security of routing, but also has the lower time complexity. Besides, experimental results and analysis show that the protocol has achieved good performance in the removal ratio of malicious nodes, correct reception ratio of packet and the message payload.

An ellipse-guided routing algorithm in wireless sensor networks

In wireless sensor networks,sensor nodes are deployed to collect data,perform calculations,and forward information to either other nodes or sink nodes.Recently,geographic routing has become extremely popular because it only requires the locations of sensor nodes and is very efficient.However,the local minimum phenomenon,which hinders greedy forwarding,is a major problem in geographic routing.This phenomenon is attributed to an area called a hole that lacks active sensors,which either prevents the packet from being forwarded to a destination node or produces a long detour path.In order to solve the hole problem,mechanisms to detect holes and determine landmark nodes have been proposed.Based on the proposed mechanisms,landmark-based routing was developed in which the source node first sends a packet to the landmark node,and the landmark node then sends the packet to the destination.However,this approach often creates a constant node sequence,causing nodes that perform routing tasks to quickly run out of energy,thus producing larger holes.In this paper,a new approach is proposed in which two virtual ellipses are created with the source,landmark,and destination nodes.Then guide the forwarding along the virtual ellipses.Furthermore,a recursive algorithm is designed to ensure a shortcut even if there are multiple holes or a hole has multiple landmarks.Thus,the proposed approach improves both geographic routing and energy efficiency routing.Simulation experiments show that the proposed approach increases the battery life of sensor nodes,lowers the end-to-end delay,and generates a short path.

Potential field based hole detour routing algorithm in wireless sensor networks

The current geographic routing protocols arise data congestion if a multi-flow bypasses a hole simultaneously and excessive energy consumption of hole boundary nodes because these protocols tend to route data packets along the boundaries of void areas （holes） by perimeter routing scheme.This scheme possibly enlarges the holes phenomenon （called hole diffusion problem） and shortens the life span of the network. A novel geographical routing algorithm based on a potential field approach （PFA） is proposed to deal with multiple holes scenario and restrict data to forward near boundary of a hole. That is, data packets are attracted to its sink and are repulsed away from the hole （s）. Simulation results show that PFA is superior to other protocols in terms of packet delivery ratio, network lifetime.

A Void Avoidance Scheme for Grid-Based Multipath Routing in Underwater Wireless Sensor Networks

This work proposes a geographic routing protocol for UWSNs based on the construction of a 3D virtual grid structure, called Void-Avoidance Grid-based Multipath Position-based Routing (VA-GMPR). It consists of two main components, the multipath routing scheme and the grid-based void avoidance (GVA) mechanism for handling routing holes. The multipath routing scheme adopts node-disjoint routes from the source to the sink in order to enhance network reliability and load balancing. While the GVA mechanism handles the problem of holes in 3D virtual grid structure based on three techniques: Hole bypass, path diversion, and path backtracking. The performance evaluation of the VA-GMPR protocol was compared to a recently proposed grid-based routing protocol for UWSNs, called Energy-efficient Multipath Geographic Grid-based Routing (EMGGR). The results showed that the VA-GMPR protocol outperformed the EMGGR protocol in terms of packet delivery ratio, and end-to end-delay. However, the results also showed that the VA-GMPR protocol exhibited higher energy consumption compared to EMGGR.

Google Earth-based dynamic visualization system for storm surge flood routing

To describe the dynamic process of flood routing intuitively and realistically when storm surge disaster occurs,a method for ArcGIS data and Google Earth(GE) data integration is proposed,which realizes the importing and integrating of basic geographic information into GE. Based on SketchUp and AutoCAD software,threedimension(3D) visualization of seawall and other tidal defense structures is achieved. By employing Microsoft Foundation Class Library(MFC),the related system modules and storm surge flood routing dynamic visualization system are developed. Therefore,dynamic visualization of flood routing process and interactive query of submerged area and inundated depth are implemented. A practical application case study of Tianjin Binhai New Area provides decision-making support for coastal seawall planning and storm surge disaster prevention and reduction.

A Contention-Based MAC and Routing Protocol for Wireless Sensor Network

Advance development of wireless technologies and micro-sensor systems have enabled Wireless Sensor Network (WSN) to emerge as a leading solution in many crucial sensor-based applications. WSN deploys numerous resource-constrained sensor nodes which have limited power supply, memory and computation capability in a harsh environment. Inefficient routing strategy results in degraded network performance in terms of reliability, latency and energy efficiency. In this paper, a cross-layer design, Contention-based MAC and Routing protocol is proposed, termed Contention/SNIR-Based Forwarding (CSBF) protocol. CSBF utilizes the geographical information of sensor nodes to effectively guide the routing direction towards destination node, thereby enhancing reliability. Furthermore, Signal-to-Noise-plus-Interference Ratio (SNIR) metric is used as a routing parameter to guarantee high quality link for data transmission. A Contention-Winner Relay scheme is utilized to reduce the delays caused by the contention procedure. Energy efficiency is also improved by introducing sleep mode technique in CSBF. The simulation work is carried out via OMNeT++ network simulator. The performance of CSBF is compared with other existing routing protocols such as AODV and DSDV in terms of packet delivery ratio (PDR), average end-to-end (ETE) delay and energy consumption per packet. Simulation results highlight that CSBF outperforms AODV and DSDV protocols in respect of PDR and energy efficiency. CSBF also has the most consistent overall network performance.

清末民初诗钟社团的地域分布

清代后期至民国初期诗钟创作十分兴盛,并成立了相应的社团。诗钟由福建兴起后,北上北京,东进台湾地区,西入江苏,进而在全国乃至海外掀起社团活动热潮,山东、河南、湖北、浙江、广东以及东南亚各地都出现了数量不等的诗钟社团,呈现出“全面覆盖,相对集中”的分布格局。考察诗钟社团的地域分布,可以清晰地看到清末民初诗钟的传播路线。

基于改进加权距离的建成区布线及供电范围调整

针对建成区源荷空间发展与配电网供电范围调整及其建设改造之间的复杂耦合关系,提出一种基于改进加权距离的建成区布线及供电范围调整方法。首先,结合建成区与新建区自动布线的技术差异性,建立建成区配电网供电范围调整及其自动布线一体化优化框架;其次,提出考虑新增源荷归属动态调整的新建线路待选条数区间计算方法;然后,综合考虑负载率越限改进效果和源荷距离特征,提出基于改进加权距离的新建线路供电范围划分和基于混合整数线性优化的网架布局方法;最后,通过所提实例验证模型和方法的经济性与实用性。

基于GIS技术的复杂山区道路选线优化方法探讨

针对复杂山区道路选线的优化问题,提出以地理信息系统技术为基础,综合考虑地形特征和环境约束等因素,进行道路选线优化的方法,对道路网络模型进行地形参数的获取与处理,对道路节点及其连通性进行分析;在此基础上,设计多条件权衡算法并有效处理约束条件,以达到道路选线优化的目的。此种方法在实际应用中得到验证并取得了较好的效果。

不同气候情景下黄心梓木在我国的潜在适生区预测

【目的】预测不同气候情景下黄心梓木在我国的分布情况及其自然群体可能的迁移路线,为黄心梓木的保护和可持续利用提供科学依据,为濒危植物的潜在适生区预测和保护提供参考。【方法】基于当前和未来(2030s、2050s、2070s)4个时期的环境变量数据以及黄心梓木分布数据,利用MaxEnt模型模拟预测不同气候情景下黄心梓木在我国的潜在地理分布,综合分析限制其扩散的环境因子,制定针对性保护措施。【结果】1)MaxEnt模型各组曲线下面积(AUC)均高于0.9,模型预测结果非常准确。2)黄心梓木在我国的潜在适生区狭窄,当前适生区总面积为50416 km^(2),其中高适生区面积2309 km^(2),仅在黔南和黔西南部分地区分布,中适生区(面积14288 km^(2))在其周围分布,低适生区面积33819 km^(2),分布在贵州中部、广西、云南、四川等地;未来气候情景下,黄心梓木在我国的潜在适生区呈先扩张后收缩的变化趋势,其中高强迫(SSP5-8.5)情景下的2030s时期适生区总面积最大(70313 km^(2)),新增面积达当前适生区总面积的39%。3)最干月降水量(bio14)、海拔(bio20)、等温性(bio3)、年降水量(bio12)是限制黄心梓木分布的主导环境因子。4)未来气候情景下,黄心梓木潜在适生区的质心迁移方向总体为先向北移后向东南移。5)基于黄心梓木现状提出在高适生区范围内就地划分保护区,在湖北西部、重庆东北部等潜在适生区开展相关育种试验扩大其种植面积以及建立种质资源库等相关保护措施。【结论】黄心梓木在我国的潜在适生区较为狭窄且中、高适生区相对集中,大多分布在贵州西南部,广西、云南、四川、重庆以及湖北部分地区也可能有分布;目前黄心梓木的潜在适生区未达到饱和,预计适生区面积会持续扩增至2030s;未来气候情景下,黄心梓木潜在适生区面积呈先扩大后缩小的趋势;基于黄心梓木现状,建议以人为方式开展协助恢复其生境以及快速促进其种群扩大等相关保护措施。

基于AHP-熵权法的GIS高速公路选线研究

利用GIS空间分析技术和综合评价法进行高速公路的路径规划,建立一种基于AHP-熵权法的公路选线模型,从而降低规划过程的复杂性。以河北沿海高速唐山段为研究对象,选取土地利用类型、坡度、坡向、水文、断层、土壤类型、GDP、旅游资源和生态敏感度九种地理指标评价因子,分别建立基于层次分析法和熵权法的高速公路选线方案决策模型,并结合两种方法建立综合评价模型生成最优路径与原路径进行对比。结果表明,结合两种评价方法生成的最优路径与原路径有较高拟合,基于AHP-熵权法的高速公路选线模型在对比有一定优势。