Grid Routing Research Articles

Comparison of the Potential of Mangrove Forests as an Estimate of Carbon Stocks : A Review

Global warming is an increase in carbon dioxide gas (CO2) and other gases in the earth's atmosphere, which will make the earth's atmosphere retain more heat coming from the sun. This study aimed to determine the highest carbon stock ratio from various areas with mangrove forest areas. This research was conducted using the grid route method by collecting data from a literature study from different locations in the mangrove forest. The research results obtained that the highest average carbon stock in various regions of Indonesia which has the highest mangrove forest conservation is the Mangrove Area in Pasar Banggi Rembang Village of 737.2 tons/ha with three stations whose species names consist of Rhizophora apiculata, Rhizophora stylosa, and Rhizophora mucronata. High and low carbon content, density, and mangrove species in mangrove leaf litter were influenced by the rate of litter production. This production rate will later affect the high low carbon content in mangrove leaf litter.

Legalized Routing Algorithm Based on Linear Programming

Legalized routing is an essential part of PCB automatic routing. It solves the problem of wiring conflicts and obtains routing results that comply with the constraints of design rules. Traditional legalized routing problems mostly use trial backtracking methods, but with increasing design complexity and design rules, avoiding wiring conflicts between networks has become increasingly challenging. This paper proposes a legalized routing algorithm based on linear programming to obtain the optimal wiring trajectory under specified topological constraints. First, the corresponding routing model was established based on numerous routing rules, and a routing grid diagram was found using obstacles as grid points. Secondly, a global routing algorithm was used to obtain the estimated wiring path, and integer linear programming was used to realize the mathematical modeling of the legalized routing problem. Finally, a multi-line simultaneous routing strategy was used to design and implement a detailed routing algorithm, optimizing the routing results. We use C++ to complete the coding work and thoroughly test the PCB use cases of different sizes. The experimental results show that our algorithm still maintains a 100% routing success rate, good time performance, and excellent routing quality with large-scale use cases compared with the trial backtracking method.

A two-phase multi-objective metaheuristic for a green UAV grid routing problem

A two-phase multi-objective metaheuristic for a green UAV grid routing problem

IEDA-HGEO: Improved Energy Efficient with Clustering-Based Data Aggregation and Transmission Protocol for Underwater Wireless Sensor Networks

With the emerging technology in underwater wireless sensor networks (UWSN), many researchers are undergoing this field since it cannot maintain the batteries and recharge them manually. Network duration should be taken into account because they can easily be recharged by a non-conventional resource like solar energy. When coming to the data collection process, clustering is an effective method to construct vitality effective UWSNs. The clustering properties of UWSNs differ from those of terrestrial wireless sensor networks (TWSNs) due to the sparse deployment of nodes as well as the dynamic nature of the channel. This paper proposes improved efficient data aggregation in a Hexagonal grid with energy optimization (IEDA-HGEO) protocol for effective data transmission with an optimal clustering process. It is further compared with ERP2R n energy-efficient routing protocol and EGRC (Energy-efficiency Grid Routing based on 3D Cubes). The three techniques mentioned above are specifically examined for their applicability to underwater communication, and their performance is compared in terms of energy consumption, efficiency, throughput, packet delivery ratio, and delay. The proposed method achieved the following metrics: delay 41%, energy consumption 48%, efficiency 95%, throughput 95%, and PDR 92%.

Stable routing protocol for unmanned aerial vehicle ad‐hoc networks based on DQN‐OLSR

In unmanned aerial vehicle ad-hoc network (UANET), the network topology changes with time due to the movement of the unmanned aerial vehicles (UAVs), which brings great challenges to the design of the routing protocol. In traditional routing protocols, when UANET topology changes, nodes cannot dynamically update neighbour nodes and topology information, and routing table calculation cannot accurately reflect the actual transmission path. As a result, network cannot meet the quality of service (QoS) requirements such as low end-to-end delay, high throughput and low packet loss rate. This paper proposes a dynamically optimized link state routing (OLSR) protocol based on Deep Q-Network algorithm (DQN-OLSR). In this protocol, each node first adjusts the sending interval of Hello messages adaptively in real time, according to the position and speed information of its neighbour nodes. Then the protocol uses the DQN algorithm to dynamically adjust the flooding interval of topology control (TC) messages to improve the routing update capability of nodes. The simulation verifies that the UANETs under this protocol have higher throughput and less packet loss rate than ad-hoc on-demand distance vector (AODV), grid routing protocol (GRP) and OLSR protocols, at different movement speeds in random waypoint (RWP) and random walk mobile models. Under nomadic as well as pursue mobile models, DQN-OLSR performs consistently with OLSR QoS performance, with the best performance among all four protocols. By further adding positioning errors to the nodes, it shows that the proposed protocol has good robustness, and the QoS performance degradation keeps within a low level.

Decoupling Control Applied to the Smart Grid Power Dispatching Problem

This paper presents controller designs of the decoupling issue dedicated to renewable decentralized generators or new generation grids known as smart grids. The control methods were based on a three-phase voltage source grid representation that integrated wind and photovoltaic generators. The utilized decoupling strategies (Boksenbom and Hood, Zilkind and Luyben, and inverted decoupling) allowed the optimization of energy transfers and costs through the routing grid distribution path. Simulations were conducted in Matlab/Simulink. The trustworthiness of the multivariable control system design in addition to the tuning method was established using three test batches, totally decoupled and stable from input dependencies.

Geovisualization of Hydrological Flow in Hexagonal Grid Systems

Recent research has extended conventional hydrological algorithms into a hexagonal grid and noted that hydrological modeling on a hexagonal mesh grid outperformed that on a rectangular grid. Among the hydrological products, flow routing grids are the base of many other hydrological simulations, such as flow accumulation, watershed delineation, and stream networks. However, most of the previous research adopted the D6 algorithm, which is analogous to the D8 algorithm over a rectangular grid, to produce flow routing. This paper explored another four methods regarding generating flow directions in a hexagonal grid, based on four algorithms of slope aspect computation. We also developed and visualized hexagonal-grid-based hydrological operations, including flow accumulation, watershed delineation, and hydrological indices computation. Experiments were carried out across multiple grid resolutions with various terrain roughness. The results showed that flow direction can vary among different approaches, and the impact of such variation can propagate to flow accumulation, watershed delineation, and hydrological indices production, which was reflected by the cell-wise comparison and visualization. This research is practical for hydrological analysis in hexagonal, hierarchical grids, such as Discrete Global Grid Systems, and the developed operations can be used in flood modeling in the real world.

Chaotic Search-and-Rescue-Optimization-Based Multi-Hop Data Transmission Protocol for Underwater Wireless Sensor Networks.

Underwater wireless sensor networks (UWSNs) have applications in several fields, such as disaster management, underwater navigation, and environment monitoring. Since the nodes in UWSNs are restricted to inbuilt batteries, the effective utilization of available energy becomes essential. Clustering and routing approaches can be employed as energy-efficient solutions for UWSNs. However, the cluster-based routing techniques developed for conventional wireless networks cannot be employed for a UWSN because of the low bandwidth, spread stay, underwater current, and error probability. To resolve these issues, this article introduces a novel chaotic search-and-rescue-optimization-based multi-hop data transmission (CSRO-MHDT) protocol for UWSNs. When using the CSRO-MHDT technique, cluster headers (CHs) are selected and clusters are prearranged, rendering a range of features, including remaining energy, intracluster distance, and intercluster detachment. Additionally, the chaotic search and rescue optimization (CSRO) algorithm is discussed, which is created by incorporating chaotic notions into the classic search and rescue optimization (SRO) algorithm. In addition, the CSRO-MHDT approach calculates a fitness function that takes residual energy, distance, and node degree into account, among other factors. A distinctive aspect of the paper is demonstrated by the development of the CSRO algorithm for route optimization, which was developed in-house. To validate the success of the CSRO-MHDT method, a sequence of tests were carried out, and the results showed the CSRO-MHDT method to have a packet delivery ratio (PDR) of 88%, whereas the energy-efficient clustering routing protocol (EECRP), the fuzzy C-means and moth–flame optimization (FCMMFO), the fuzzy scheme and particle swarm optimization (FBCPSO), the energy-efficient grid routing based on 3D cubes (EGRC), and the low-energy adaptive clustering hierarchy based on expected residual energy (LEACH-ERE) methods have reached lesser PDRs of 83%, 81%, 78%, 77%, and 75%, respectively, for 1000 rounds. The CSRO-MHDT technique resulted in higher values of number of packets received (NPR) under all rounds. For instance, with 50 rounds, the CSRO-MHDT technique attained a higher NPR of 3792%.

Application of new techniques in the characterization of wetlands related to groundwater

The appearance of modern technological tools facilitates the characterization, monitoring, and modelling of wetlands related to groundwater. These techniques include the use of unmanned aircraft systems (drones) and continuous measurement sensors for water levels and quality. The traditional procedures associated with these new technologies provide an opportunity to advance the hydrological knowledge of wetlands with greater precision. The main guidelines of the methodology used in a study covering wetlands located in the northeast of the Province of Buenos Aires are presented. Photogrammetric surveys were carried out with a multi-rotor type drone equipped with a high-resolution RGB sensor. The configurations of flight, height, speed, frontal and lateral overlap and route grid were programmed to evaluate the areal variations of the wetlands. The information was processed using specific software. From field surveys, monitoring drilling was carried out in the vicinity of the wetland, where sensors were installed for the continuous measurement of levels, electrical conductivity of water and temperature. The results obtained consist of high-resolution orthorectified mosaics, digital elevation models and 3D terrain models, which show the areal variations of water in the wetland surface. This, associated with the data recorded in the drilling, allows a spatiotemporal analysis at different scales of the surface water - groundwater relationship in the wetland.

New flight trajectory optimisation method using genetic algorithms

AbstractThis paper presents a new flight trajectory optimisation method, based on genetic algorithms, where the selected optimisation criterion is the minimisation of the total cost. The candidate flight trajectories evaluated in the optimisation process are defined as flight plans with two components: a lateral flight plan (the set of geographic points that define the flight trajectory track segments) and a vertical flight plan (the set of data that define the altitude and speed profiles, as well as the points where the altitude and/or speed changes occur). The lateral components of the candidate flight plans are constructed by selecting a set of adjacent nodes from a routing grid. The routing grid nodes are generated based on the orthodromic route between the flight trajectory’s initial and final points, a selected maximum lateral deviation from the orthodromic route and a selected grid node step size along and across the orthodromic route. Two strategies are investigated to handle invalid flight plans (relative to the aircraft’s flight envelope) and to compute their flight performance parameters. A first strategy is to assign a large penalty total cost to invalid flight profiles. The second strategy is to adjust the invalid flight plan parameters (altitude and/or speed) to the nearest limit of the flight envelope, with priority being given to maintaining the planned altitude. The tests performed in this study show that the second strategy is computationally expensive (requiring more than twice the execution time relative to the first strategy) and yields less optimal solutions. The performance of the optimal profiles identified by the proposed optimisation method, using the two strategies regarding invalid flight profile performance evaluation, were compared with the performance data of a reference flight profile, using identical input data: initial aircraft weight, initial and final aircraft geographic positions, altitudes and speed, cost index, and atmospheric data. The initial and final aircraft geographic positions, and the reference flight profile data, were retrieved from the FlightAware web site. This data corresponds to a real flight performed with the aircraft model used in this study. Tests were performed for six Cost Index values. Given the randomness of the genetic algorithms, the convergence to a global optimal solution is not guaranteed (the solution may be non-optimal or a local optima). For a better evaluation of the performance of the proposed method, ten test runs were performed for each Cost Index value. The total cost reduction for the optimal flight plans obtained using the proposed method, relative to the reference flight plan, was between 0.822% and 3.042% for the cases when the invalid flight profiles were corrected, and between 1.598% and 3.97% for the cases where the invalid profiles were assigned a penalty total cost.

Evaluation of the Skill of a Fully-Coupled Atmospheric–Hydrological Model in Simulating Extreme Hydrometeorological Event: A Case Study Over Cauvery River Catchment

The monsoon-driven river basins are more vulnerable to the flash-floods triggered by intense rainfall activities. Due to the lack of adequate high resolution forecast of real-time hydro-meteorological variables, a reliable forecast of flash floods remains a challenge. One plausible way to generate such a high-resolution forecast of hydro-meteorological variables is to use a coupled atmospheric–hydrologic modelling system. Thus, in this study, a physically-based, fully distributed, multi-scale hydrologic modelling framework, WRF-Hydro with optimized configurations (stand-alone and coupled-mode) is used to simulate the important hydro-meteorological variables like precipitation, runoff, soil moisture, and land surface heat fluxes over Cauvery river basin, India. In stand-alone mode, the model is driven by the high-resolution gridded data from the Global Land Data Assimilation System; while the coupled model is run with the WRF atmospheric model. In this study, the ability of a fully coupled WRF–WRF-Hydro modelling framework , with 3 km grid spacing is used to simulate the hydro-meteorological conditions during an extreme rainfall event (08–09 August 2019). The innermost domain of WRF-Hydro in conjunction with a high resolution hydrological routing grid (300 m) is also utilized, to include the subgrid scale disaggregation–aggregation weighting procedures to generate the land–atmospheric feedbacks on the hydrometeorological variables. The resulting variables have been validated through relevant observations; the overall performance of the coupled WRF-Hydro is shown to be relatively good when compared to the WRF-only simulations.

A Mathematical Model of a Winter Route Census: Checking for Falsification

In a model experiment, an attempt was made to falsify (refute) a deduction from the mathematical justification of winter route counting (WRC) of game animals, which is the mathematical expectation of the proportionality coefficient of this count being equal to π/2. A simulation was carried out using the MapInfo software. The essence of our digital experiment was the following: in several places of the model territory (a circle 5 km in diameter), daily tracks of animals were placed. Then, a grid of parallel routes oriented along 12 directions equally displaced relative to each other was applied to the model territory. We selected a frequency of the route grid (the distance between parallel routes) for different tracks such that the total number of all intersections of a single track of all directions was not less than a thousand. In total, 19 electronic daily tracks of various animal species have been used. Ninety-five different actual values of the proportionality coefficient were obtained for various locations of the tracks on the model territory; no violations of the above-mentioned deduction have been found. The results of our experiment made it possible to formulate a corollary arising from the fundamental properties of Euclidean geometry on the directly proportional dependence between the number of intersections between the lines of daily animal tracks and route lines and the product of the total lengths of these lines. The mathematical justification of WRC has once again passed a simulation test, now with the means of geographical information systems and data from satellite navigators. At present, there are no grounds for abandoning the practical use of winter route censuses for game animals. All possible discrepancies in the estimates of the numbers of game animals determined by the WRC method with their actual values should be attributed to shortcomings in the direct organization of this count rather than to its mathematical justification.

Two-Level Clustering and Routing Algorithms to Prolong the Lifetime of Wind Farm-Based WSN

In recent years, wind power is emerging as one of the most promising renewable energy sources. Yet, reliability is less due to the unplanned downtimes caused by faults in the wind turbines. Monitoring of turbine elements with existing wired technology is not economical and hence replacement with smart wireless sensor devices are rapidly emerging as the next evolution. In such a wireless scenario, maximizing network lifetime and reliability is essential. The recently proposed hybrid multihop routing protocol aims to improve the lifetime of a WSN deployed in a widely distributed network. Though its performance is revealed to be better, the chain based CH selection and routing of data through MST increases the energy consumption thereby reducing the network lifetime. With an objective to circumvent this, three novel multihop routing strategies namely, Shortest Grid Routing, Partitioned Super Grid Direct Routing, and Shortest Super Grid Routing are proposed. For different network scenarios, the proposals are analyzed through simulation and validated via real time experimentation. The performance of the proposals is evaluated using metrics such as first node death, energy consumption, stability, and network reliability and are compared with the recently proposed protocol. The results reveal enhanced network lifetime and reliability which proves the applicability of the proposed routing protocols for CPS based infrastructure network.

A Mathematical Model of Winter Route Counting: Checking for Falsification

In the course of our model experiment, an attempt was made to falsify (refute) a consequence from the mathematical justification of the winter route counting of hunting animals (WRC) – the consequence of the mathematical expectation of the proportionality coefficient of this counting being equal to π/2. A simulation was carried out in the MapInfo program. The essence of our digital experiment was as follows: in several places of the model territory, which was a circle 5 km in diameter, daily tracks of animals were placed. Next, a grid of parallel routes oriented along 12 equally spaced directions relative to each other was applied to the model territory. The frequency of the route grid (the distance between parallel routes) for different tracks was chosen so that the total number of all intersections of a single track in all directions was not less than a thousand. In total, 19 electronic daily tracks of various animal species were used. 95 different actual values of the proportionality coefficient were obtained for various locations of the tracks in the model territory, no violations of the above mentioned consequence were found. The results of our experiment made it possible to formulate a corollary arising from the fundamental properties of Euclidean geometry on the directly proportional dependence between the number of intersections between the lines of daily animal tracks and route lines and the product of the total lengths of these lines. The mathematical justification of WRC has once again passed a simulation test, already using the means of geographical information systems and data from satellite navigators. At present, there are no grounds for abandoning the practical use of winter route counting for game animals. All possible discrepancies in the estimates of the numbers of game animals determined by the WRC method with their actual values should be attributed to shortcomings in the direct organization of this counting rather than to its mathematical justification.

DHGRP: Dynamic Hexagonal Grid Routing Protocol with Mobile Sink for Congestion Control in Wireless Sensor Networks

Efficient energy consumption is a major problem in Wireless Sensor Network. The sink can be static or dynamic. In case of static sink, the node that is placed near the sink is utilized more than other nodes in the network due to frequent packet forwarding. This causes the node near the sink to die very soon, also further communication between the sink and other nodes in the network is disconnected. When dynamic or mobile sinks are used, the energy consumption is distributed among other nodes in the network, which increases the lifetime of the network. In this paper to know the latest position of the sink, we introduce Dynamic Hexagonal Grid Routing Protocol (DHGRP). In the first phase, the protocol divides the network by several hexagonal virtual grids to share the current position of the sink among the nodes. In the second phase, the dynamic path is selected, in case congestion occurs during data transmission or if the mobile sink is moved to a new location. The performance is evaluated by comparing with the existing ring routing protocol, Query-Driven Virtual Grid-based Data Dissemination, and Grid-Cycle Routing Protocol. The results show that the proposed DHGRP protocol has better performance in terms of energy consumption, delay, network lifetime, throughput and Packet Delivery Ratio.

Control Point Position Calibration for Light Pen Coordinate Measuring System

Light pen coordinate measuring system is a kind of vision-based portable coordinate measuring technique. It implements coordinate measuring by analyzing the image of light pen, which has several control points. With the relative positons of the control points determined and the pixel coordinates of their image points acquired by image processing, the posture of light pen can be obtained by solving perspective- n-point problem. Therefore, the control point positons serve as the measuring basis of the whole system. However, the accuracy of existing calibration methods is not satisfactory. In this paper, a new method of control point positon calibration, which utilizes traditional coordinate measuring machine, is proposed. The light pen is fasten to the measuring arm of a coordinate measuring machine and moves along a three dimensional grid route driven by the machine. A stationary camera is located in front of the machine to capture the image of light pen at each node of the route. For each control point, an individual coordinate system is established. Then the relative positions of control points can be transformed into the differences of a series of translation vectors. Experiments show that, with the proposed method, the accuracy of light pen coordinate measuring system can reach 30m within 10 meters.

Application of WRF-Hydro modeling system in Chenhe Basin and comparison with Xin'anjiang model

本文利用全球陆面数据同化系统与降雨观测数据，以陕西半湿润区陈河流域为研究对象，驱动WRF-Hydro模型，研究该模型的表现和适用性，并在结构、参数、输入输出和模拟结果方面与新安江模型对比.考虑到次表面层与实际包气带的区别，引入土层厚度乘子ZSOILFAC对前者进行等比缩放，发现其与新安江模型反推包气带的厚度有较好的一致性.研究表明：在陈河流域中WRF-Hydro计算步长须在建议值的基础上缩小；WRF-Hydro模型善于模拟洪水细节，新安江模型表现好且稳定；前者的径流深和洪峰合格率平于或略低于后者；在两个指标均合格的洪水中，前者平均均方根误差比后者小21.5%，但对于其他洪水，前者平均均方根误差比后者大56.2%；WRF-Hydro在洪水起涨时刻模拟较好，表现出其在中小流域应用的潜力.;The WRF-Hydro modeling system (WRF-Hydro model) was used for flood forecast in semi-humid small and medium catchment in China, proposed by the National Center for Atmospheric Research Center (NCAR) in 2013. The Global Land Data Assimilated System (GLDAS) and observed rainfall data are adopted to drive WRF-Hydro model in Chenhe Basin located in the south-central Shanxi Province. This study examine the practical features and applicability of the model, and also compare with Xin'anjiang (XAJ) model in structure, parameters, inputs & outputs and simulation results. Given the excessive time consume in model running, the stepwise approach for calibration is used for five main parameters in this study. The multiplier for subsurface layer thickness (ZSOILFAC) is introduced to modify this thickness to establish contact between subsurface layer and aeration zone to meet the actual situation of the basin, and the good agreement between subsurface layer modified by ZSOILFAC and the aeration thickness evaluated by XAJ model is achieved. The results show that the time step is supposed to be reduced from 6 s recommended by User's Guidance to 1 s when spatial resolution of routing grid is 100 m in Chenhe Basin. WRF-Hydro model is good at simulating the details of flood, while XAJ model performs well and stably. The qualified rates of runoff depth and flood peak for the former are equal or slightly inferior to those for the latter. The mean root mean square Error (RMSE) of the former is 21.5% less than that of the latter for the flood events with qualified runoff depth and flood peak; while mean RMSE of the former is 56.2% greater than that of the latter for others. WRF-Hydro model has good skills in simulating the start time of observed hydrograph and has promising potential for hydrological simulation, flood forecasting and water resources evaluation for small- and medium-sized catchments.

Multicontrol: Advanced Control-Logic Synthesis for Flow-Based Microfluidic Biochips

Flow-based microfluidic biochips are one of the most promising platforms used in biochemical and pharmaceutical laboratories due to their high efficiency and low costs. Inside such a chip, fluids of nanoliter volumes are transported between devices for various operations, such as mixing and detection. The transportation channels and corresponding operation devices are controlled by microvalves driven by external pressure sources. Since assigning an independent pressure source to every microvalve would be impractical due to high costs and limited system dimensions, states of microvalves are switched by a control logic using time multiplexing. Existing control-logic designs, however, still switch only a single control channel per operation, leading to a low efficiency. In this article, we present the first automatic synthesis approach for a control logic that is able to switch multiple control channels simultaneously. Moreover, we propose the first fault-aware design in control logic by introducing backup control paths to maintain the correct function even when manufacturing defects occur. The construction of control logic is achieved by a highly efficient framework based on particle swarm optimization, Boolean logic simplification, grid routing, together with mixing multiplexing. The simulation results demonstrate that the proposed multichannel switching mechanism leads to fewer valve-switching times and lower total logic cost, while realizing fault tolerance for all control channels.

A systems approach to routing global gridded runoff through local high-resolution stream networks for flood early warning systems

Global or national scale flood early warning systems (FEWS) can benefit developing countries and ungauged regions that lack observational data, computational infrastructure, and/or the human capacity for streamflow modelling. Existing land surface models (LSM) typically generate forecasts using coarse resolution grid cells which, at least for streamflow, have little value when used for flood warning at local scales. We present the design and development of a new automated computational system, using existing, well-established open source software tools that quickly downscales (or maps) the runoff generated from such coarse grid-based LSMs onto high-resolution vector-based stream networks then routes the results using a vector-based river routing model. We conducted experiments using the ERA-Interim/Land reanalysis data – a 35-year retrospective gridded runoff data product from the European Center for Medium-range Weather Forecasts (ECMWF) – to assess our fast downscaling system. The accuracy of our approach is comparable to the Global Flood Awareness System (GloFAS) – a well-established gridded routing model using the same forcings – but our method provides streamflow predictions on significantly higher resolution stream networks. We found that the river network resolution has negligible effect on the simulated streamflow with our model routing. In other words, we can forecast streamflow for very small stream segments and potentially improve local flood awareness and response much more successfully than previously possible using readily available climate forcings from LSMs.

A Security Key Management Method using Grid Routing for EDDK in WSNs

Wireless sensor networks (WSNs) utilize event data collected through sensor nodes, which can be employed in different environments. Sensor nodes used in WSNs have limited energy and can be easily compromised by attackers since they are placed in the external environment. Therefore, energy efficiency and security are core requirements in WSNs, and various schemes have been proposed to solve them. The energy-efficient distributed deterministic key management scheme (EDDK) is a security scheme that uses distributed pairwise keys. The EDDK encrypts the packet using the pairwise key of the neighboring node, and transmits the encrypted packet securely to the base station (BS). In addition, the pairwise key shared with neighboring nodes is updated to defend against network attacks such as Denial of Service. However, the energies of the sensor nodes decrease rapidly in environments where key updates occur frequently. Further, since EDDK does not encrypt the sequence number, the attacker can manipulate this sequence number. If such attacks are continually attempted, key updates occur frequently. This paper proposes a scheme that removes the local cluster key from the EDDK and instead uses a grid routing protocol. The proposed scheme reduces the number of key updates by removing the local cluster key. In addition, the proposed scheme constructs the routing as a grid and selects the sensor node nearest to the BS as the master node. the master node of the grid routing scheme transmits routing control messages to the corresponding sensor nodes. In this way, the proposed method improves the sensor network energy efficiency. Experimental results show that the energy efficiency of the sensor network is improved by about 7.8097% compared with EDDK. Additionally, since the proposed scheme removes the local cluster key, sequence number manipulation attacks can be avoided. As a result, the security rate of the proposed scheme is more than double compared with EDDK.