Malicious Node Detection Using Confidence Level Evaluation in a Grid-Based Wireless Sensor Network

In this paper, we present a malicious node detection scheme using confidence-level evaluation in a grid-based wireless sensor network. The sensor field is divided into square grids, where sensor nodes in each grid form a cluster with a cluster head. Each cluster head maintains the confidence levels of its member nodes based on their readings and reflects them in decision-making. Two thresholds are used to distinguish between false alarms due to malicious nodes and events. In addition, the center of an event region is estimated, if necessary, to enhance the event and malicious node detection accuracy. Experimental results show that the scheme can achieve high malicious node detection accuracy without sacrificing normal sensor nodes.

A Path-Based Approach for Data Aggregation in Grid-Based Wireless Sensor Networks

Sensor nodes in a wireless sensor network （WSN） are typically powered by batteries, thus the energy is constrained. It is our design goal to efficiently utilize the energy of each sensor node to extend its lifetime, so as to prolong the lifetime of the whole WSN. In this paper, we propose a path-based data aggregation scheme （PBDAS） for grid-based wireless sensor networks. In order to extend the lifetime of a WSN, we construct a grid infrastructure by partitioning the whole sensor field into a grid of cells. Each cell has a head responsible for aggregating its own data with the data sensed by the others in the same cell and then transmitting out. In order to efficiently and rapidly transmit the data to the base station （BS）, we link each cell head to form a chain. Each cell head on the chain takes turn becoming the chain leader responsible for transmitting data to the BS. Aggregated data moves from head to head along the chain, and finally the chain leader transmits to the BS. In PBDAS, only the cell heads need to transmit data toward the BS. Therefore, the data transmissions to the BS substantially decrease. Besides, the cell heads and chain leader are designated in turn according to the energy level so that the energy depletion of nodes is evenly distributed. Simulation results show that the proposed PBDAS extends the lifetime of sensor nodes, so as to make the lifetime of the whole network longer.

Using Cellular Automata for Grid-Based Fishery Management

This report introduced new concept and technics for a grid-based fishery management system. The fishing ground was first divided into small grid of equal area, each with predefined longitudes and latitudes (both 0.033 degrees or approximately 2 × 2 nautical miles in this study). All grids were laid and formatted into a Microsoft-Excel spreadsheet system, as defined by the coastline. Individual sheets were also constructed to represent different ecological characters, serving as supporting data of the main grid-map. Including individual fishing record, water depth, wind & current vector, benthic character, etc. Cellular automata (CA) mathematics was applied for simulation studies. They were programmed on the built-in Visual BASIC langrage in EXCEL. In a three-year research project, the author was able to accomplish the following major results: 1) An EXCEL-based spreadsheet system for storage of fishing effort in each grid. Provided that data of fishing yield is also available for each grid, research model for fishery management can be constructed, leading toward solutions for total allowable catch (TAC) as well as maximum economic yield (MEY). 2) A multi-layered, 2-dimentional spread-sheet system demonstrating the distribution of relative intensity for individual grids. The system can be decked up with different ecological data for more advanced studies. 3) Estimation of the nearest distance between two special grids as well as fishing harbors. This would help in more efficient navigation management and allocation of fishing rights for the fishing vessels.

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.

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.

An Efficient Cartesian Grid-Based Method for Scattering Problems with Inhomogeneous Media

Boundary integral equations provide a powerful tool for the solution of scattering problems.However,often a singular kernel arises,in which case the standard quadratures will give rise to unavoidable deteriorations in numerical precision,thus special treatment is needed to handle the singular behavior.Especially,for inhomogeneous media,it is difficult if not impossible to find out an analytical expression for Green’s function.In this paper,an efficient fourth-order accurate Cartesian grid-based method is proposed for the two-dimensional Helmholtz scattering and transmission problems with inhomogeneous media.This method provides an alternative approach to indirect integral evaluation by solving equivalent interface problems on Cartesian grid with a modified fourth-order accurate compact finite difference scheme and a fast Fourier transform preconditioned conjugate gradient(FFT-PCG)solver.A remarkable point of this method is that there is no need to know analytical expressions for Green’s function.Numerical experiments are provided to demonstrate the advantage of the current approach,including its simplicity in implementation,its high accuracy and efficiency.

Highway Toll Collection Method for Connected Automated Vehicle Platooning Using Spatio-Temporal Grid Reservation

In the intelligent transportation system, the autonomous vehicle platoon is a promising concept for addressing traffic congestion problems. However, under certain conditions, the platoon’s advantage cannot be properly developed, especially when stopping for electronic toll collection (ETC) to pay the toll fee using the highway. This study proposes a software architectural platform that enables connected automated vehicles to reserve a grid-based alternative approach to replace current highway toll collection systems. A planned travel route is reserved in advance by a connected automated vehicle in a platoon, and travel is based on reservation information. We use driving information acquired by communication mechanisms installed in connected automated vehicles to develop a dynamic map platform that collects highway toll tax based on reserving spatio-temporal grids. Spatio-temporal sections are developed by dividing space and time into equal grids and assigning a certain road tax rate. The results of the performance evaluation reveal that the proposed method appropriately reserves the specified grids and collects toll taxes accurately based on a spatio-temporal grid with minimal communication time and no data package loss. Likely, using the proposed method to mediate driving on a one-kilometer route takes an average of 36.5 seconds, as compared to ETC and the combination of ETC and freeway road lane methods, which take 46.6 and 53.8 seconds, respectively, for 1000 vehicles. Consequently, our proposed method’s travel time improvements will reduce congestion by more effectively exploiting road capacity as well as enhance the number of platoons while providing non-stoppable travel for autonomous vehicles.

Performance Analysis of Grid Based AODV Routing Algorithm for AD Hoc Wireless Networks

In many traditional On Demand routing algorithms in Ad hoc wireless networks, a simple flooding mechanism is used to broadcast route request (RREQ) packets when there is a need to establish a route from a source node to a destination node. The broadcast of RREQ may lead to high channel contention, high packet collisions, and thus high delay to establish the routes, especially with high density networks. Ad hoc on Demand Distance Vector Routing Protocol (AODV) is one among the most effective Reactive Routing Protocols in MANETs which use simple flooding mechanism to broadcast the RREQ. It is also used in Wireless Sensor Networks (WSN) and in Vehicular Ad hoc Networks (VANET). This paper proposes a new modified AODV routing protocol EGBB-AODV where the RREQ mechanism is using a grid based broadcast (EGBB) which reduces considerably the number of rebroadcast of RREQ packets, and hence improves the performance of the routing protocol. We developed a simulation model based on NS2 simulator to measure the performance of EGBB-AODV and compare the results to the original AODV and a position-aware improved counter-based algorithm (PCB-AODV). The simulation experiments that EGBB-AODV outperforms AODV and PCB-AODV in terms of end-to-end delay, delivery ratio and power consumption, under different traffic load, and network density conditions.

On Density-Based Data Streams Clustering Algorithms: A Survey

Clustering data streams has drawn lots of attention in the last few years due to their ever-growing presence. Data streams put additional challenges on clustering such as limited time and memory and one pass clustering. Furthermore, discovering clusters with arbitrary shapes is very important in data stream applications. Data streams are infinite and evolving over time, and we do not have any knowledge about the number of clusters. In a data stream environment due to various factors, some noise appears occasionally. Density-based method is a remarkable class in clustering data streams, which has the ability to discover arbitrary shape clusters and to detect noise. Furthermore, it does not need the nmnber of clusters in advance. Due to data stream characteristics, the traditional density-based clustering is not applicable. Recently, a lot of density-based clustering algorithms are extended for data streams. The main idea in these algorithms is using density- based methods in the clustering process and at the same time overcoming the constraints, which are put out by data streanFs nature. The purpose of this paper is to shed light on some algorithms in the literature on density-based clustering over data streams. We not only summarize the main density-based clustering algorithms on data streams, discuss their uniqueness and limitations, but also explain how they address the challenges in clustering data streams. Moreover, we investigate the evaluation metrics used in validating cluster quality and measuring algorithms＇ performance. It is hoped that this survey will serve as a steppingstone for researchers studying data streams clustering, particularly density-based algorithms.

Extended Global Convergence Framework for Unconstrained Optimization

An extension of the global convergence framework for unconstrained derivative-free op- timization methods is presented.The extension makes it possible for the framework to include opti- mization methods with varying cardinality of the ordered direction set.Grid-based search methods are shown to be a special case of the more general extended global convergence framework.Furthermore, the required properties of the sequence of ordered direction sets listed in the definition of grid-based methods are relaxed and simplified by removing the requirement of structural equivalence.

A pyramid-based approach to visual exploration of a large volume of vehicle trajectory data

Advances in positioning and wireless commu- nicating technologies make it possible to collect large volumes of trajectory data of moving vehicles in a fast and convenient fashion. These data can be applied to traffic studies. Behind this application, a methodological issue that still requires particular attention is the way these data should be spatially visualized. Trajectory data physically consists of a large number of positioning points. With the dramatic increase of data volume, it becomes a challenge to display and explore these data. Existing commercial software often employs vector-based indexing structures to facilitate the display of a large volume of points, but their performance downgrades quickly when the number of points is very large, for example, tens of millions. In this paper, a pyramid-based approach is proposed. A pyramid method initially is invented to facilitate the display of raster images through the tradeoff between storage space and display time. A pyramid is a set of images at different levels with different resolutions. In this paper, we convert vector-based point data into raster data, and build a grid- based indexing structure in a 2D plane. Then, an image pyramid is built. Moreover, at the same level of a pyramid, image is segmented into mosaics with respect to the requirements of data storage and management. Algorithms or procedures on grid-based indexing structure, image pyramid, image segmentation, and visualization operations are given in this paper. A case study with taxi trajectory data in Shanghai is conducted. Results demonstrate that the proposed method outperforms the existing commercial software.