HIGH: A Hexagon-based Intelligent Grouping Approach in Wireless Sensor Networks

Fan, Chung-Shuo

doi:10.4316/aece.2016.01006

Cited by 8 publications

(7 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It is shown that this structure provides better connectivity, where the sensing nodes are deployed at the vertices and centers of each hexagon cell [33]. Fan has shown that calculating not only number of cells in the ROI, but also the cell area in a hexagonal cluster group is interesting [34]. The total number of hexagonal clusters is and the number of hexagonal clusters in each ring is defined with the following formula, where i is the ring from the center [34,35]:…”

Section: ) Wsnmentioning

confidence: 99%

See 1 more Smart Citation

A Review of Embedding Hexagonal Cells in the Circular and Hexagonal Region of Interest

Prvan¹,

Ožegović²,

Mišura³

2019

IJACSA

View full text Add to dashboard Cite

Hexagonal cells are applied in various fields of research. They exhibit many advantages, and one of the most important is their possibility to be closely packed and to form a hexagonal grid that fully covers the Region of Interest (ROI) without overlaps or gaps. ROI can be of various geometrical shapes, but this paper deals with the circular or hexagonal ROI approximations. The main purpose of our research is to provide a short review on the literature concerning the hexagonal grid, summarizing the existing state-of-the-art approaches on embedding hexagonal cells in the targeted ROI shapes and offering application-specific advantages. We report on formulas and algebraic expressions given in the existing researches that are used for calculating the number of embedded inner hexagonal cells or their vertices and/or edges. We contribute by integrating all researches in one place, finding a connection between previously unrelated applications concerning the use of embedded hexagonal grid and extracting commonality between previous researches on whether it provides the formulas on calculating the inner hexagon cells. In case only the number of edges or vertices is provided for the targeted application, we derive formulas for calculating the number of inner hexagons. Therefore, our survey results with the overview on solving the problem of embedding hexagonal cells in the desired circular or hexagonal ROI. The contribution of the review is the following: first it provides the existing and the derived formulas for calculating the embedded hexagons and second, it provides a theoretical background that is necessary to encourage further research. Namely, our main motivation, that is the geometrical design of the one of the world's largest CERN particle detectors, Compact Muon Solenoid (CMS) is analyzed as a source for the future research directions.

show abstract

Section: ) Wsnmentioning

confidence: 99%

“…Fan has shown that calculating not only number of cells in the ROI, but also the cell area in a hexagonal cluster group is interesting [34]. The total number of hexagonal clusters is and the number of hexagonal clusters in each ring is defined with the following formula, where i is the ring from the center [34,35]:…”

Section: ) Wsnmentioning

confidence: 99%

A Review of Embedding Hexagonal Cells in the Circular and Hexagonal Region of Interest

Prvan¹,

Ožegović²,

Mišura³

2019

IJACSA

View full text Add to dashboard Cite

show abstract

“…Except routing, transport layer must provide energy efficiency and the data aggregation. Routing is performed using any of the techniques of routing, such as flooding or gossiping (Fan, 2016). Data link layer is responsible for multiplexing data stream, detecting data frames, medium access and error detection (Dargie, 2010).…”

Section: Communication In Wireless Sensor Networkmentioning

confidence: 99%

“…These sensor nodes gather environmental data, collaborate with each other and send the measured data via wireless communications to the sink (Fan, 2016). The sink takes data from sensor nodes, analyses and synthesizes them and serves the purpose of interface for the outside world.…”

Section: Introductionmentioning

confidence: 99%

Overview of DOS attacks on wireless sensor networks and experimental results for simulation of interference attacks

Gavrić

Simić

2018

Ing. Inv.

View full text Add to dashboard Cite

Wireless sensor networks are now used in various fields. The information transmitted in the wireless sensor networks is very sensitive, so the security issue is very important. DOS (denial of service) attacks are a fundamental threat to the functioning of wireless sensor networks. This paper describes some of the most common DOS attacks and potential methods of protection against them. The case study shows one of the most frequent attacks on wireless sensor networks -the interference attack. In the introduction of this paper authors assume that the attack interference can cause significant obstruction of wireless sensor networks. This assumption has been proved in the case study through simulation scenario and simulation results. RESUMENLas redes de sensores inalámbricos se utilizan ahora en varios campos. La información transmitida en las redes de sensores inalámbricos es muy delicada, por lo que el tema de la seguridad es muy importante. Los ataques de DOS (Denegación de servicio) son una amenaza fundamental para el funcionamiento de las redes de sensores inalámbricos. Este documento describe algunos de los ataques DOS más comunes y los posibles métodos de protección contra ellos. El estudio de caso muestra uno de los ataques más frecuentes a las redes de sensores inalámbricos: el ataque de interferencia. En la introducción de este artículo, los autores suponen que la interferencia de ataque puede causar una obstrucción significativa de las redes de sensores inalámbricos. Esta suposición se ha demostrado en el estudio de caso a través de escenarios de simulación y los resultados de estas simulaciones.Palabras clave: Redes de sensores inalámbricos, detección de intrusión, comunicación inalámbrica, seguridad del sistema de comunicación, interferencia de radiofrecuencia.

show abstract

“…Hybrid Energy-Efficient Distributed clustering [36], or multi-level clusters like in Distributed Weightbased Energy-efficient Hierarchical Clustering protocol [8] and Two-Level Hierarchy LEACH [24]. The other very popular routing protocols which are based on clusters in sensor networks are: PANEL [3], UCS [30], EECS [35], EEUC [19], ACE [4], BCDCP [27], PEGASIS [21], TEEN [25], APTEEN [26], TTDD [23], CCS [16], HGMR [18], solutions like [10] [11] [12]. The detailed survey of clustering algorithms can be found in [33] and [22].…”

Section: Introductionmentioning

confidence: 99%

Improving DTNs Performance by Reduction of Bundles Redundancy using Clustering Algorithm

Schoeneich

Prus

2018

INT J COMPUT COMMUN

View full text Add to dashboard Cite

This article presents complex clustering algorithm for Delay Tolerant Networks (DTNs) including neighborhood discovery, cluster creation, and data distribution within cluster. The general idea is to reduce the amount of messages being sent and of buffer utilization, by taking advantage of the nodes tendency to create groups and to share similar mobility patterns among each other. The main purpose of the algorithm is to improve the network performance without major changes in communication schemes between nodes. Almost no extra message type is added. Most extra features are available thanks to adding small extra fields into transmitted packages. Neighborhood discovery is being realized passively by listening to other nodes messages. The proposed algorithms allow to reduce both the bandwidth occupation, as well as the problems related to the media access. Furthermore, it can increase message delivery probability thanks to intelligent package distribution inside created cluster. Simulations were carried out to evaluate the effectiveness of the proposed solution in terms of package delivery probability, mean buffer occupancy and mean hop number to delivery the message. Results of simulation show that this solution is not necessary or recommended for small-scale networks with few nodes using clustering algorithms. However, with increasing number of nodes and messages, the performance of non-clustered DTNs drops significantly while clustered network works efficiently.

show abstract

HIGH: A Hexagon-based Intelligent Grouping Approach in Wireless Sensor Networks

Cited by 8 publications

References 22 publications

A Review of Embedding Hexagonal Cells in the Circular and Hexagonal Region of Interest

A Review of Embedding Hexagonal Cells in the Circular and Hexagonal Region of Interest

Overview of DOS attacks on wireless sensor networks and experimental results for simulation of interference attacks

Improving DTNs Performance by Reduction of Bundles Redundancy using Clustering Algorithm

Contact Info

Product

Resources

About