Clustered balanced minimum spanning tree for routing and energy reduction in wireless sensor networks

Khamforoosh, Keyhan

doi:10.1109/iswta.2011.6089553

Cited by 10 publications

(7 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The computation terminates if there is only one connected component. The correctness of this method follows directly from the correctness of Borůvka's algorithm [17]. Algorithm adopted in this paper: The aim of proposed algorithm is to find a MST parallel out of a given network in an adjacency matrix form where the entries of this matrix are distances, costs or weights of edges or links.…”

Section: Base Paper Methodologymentioning

confidence: 99%

A Parallel Approach to Solve Minimum Spanning Tree Problem in Network Routing

Ahmed¹,

Ahmed²

2017

IJERMT

View full text Add to dashboard Cite

Abstracthe minimal-weight spanning tree (MST) problem is a famous combinatorial optimization problem worried with finding a spanning tree of an undirected, linked graph, such that the sum of the weights of the selected edges is minimal. Márquez,et al. proposed a minimal spanning tree (MST) set of rules and correctly applied it to wi-fi ad-hoc network routing. The undertaking of finding the shortest route in a network for routing data packets has been dealt in this paper. we've used an algorithm to remedy the MST hassle and we have parallelized it with the assist of Open MP API , we've got implemented the parallelized algorithm to resolve community routing problem with respect to its objective feature. A comparative evaluation with the help of VTune analyzer has also been done whilst the identical algorithm is completed sequentially in a unmarried thread environment. based on this analysis a elegant parallel MST algorithm is offered. The refined set of rules is carried out to a network to solve the routing trouble in it ,and results suggests that this parallel set of rules is a good approach to compute and resolve the network routing trouble.

show abstract

Section: Base Paper Methodologymentioning

confidence: 99%

A Parallel Approach to Solve Minimum Spanning Tree Problem in Network Routing

Ahmed¹,

Ahmed²

2017

IJERMT

View full text Add to dashboard Cite

show abstract

“…Lo más común en este sentido es que hayan enlaces multihop y en este caso se plantea la ocupación de redes distribuidas [7,[13][14].…”

Section: Cobertura Y Capacidad De Poblaciones Georreferenciadas De Meunclassified

“…Por otro lado, la colocación de puntos de agregación o de concentración se puede llevar a cabo mediante heurísticas: el algoritmo de Greedy que busca las soluciones cercanas a la óptima pero ha presentado problemas con grandes poblaciones o que se encuentren dispersas; como las poblaciones rurales en estudio [6][7][8].…”

Section: Introductionunclassified

Óptimo despliegue y enrutamiento de UDAP para infraestructura de medición avanzada basada en el algoritmo MST

Ganán

Inga

Hincapié

2017

Ingeniare. Rev. chil. ing.

View full text Add to dashboard Cite

RESUMENEl presente artículo permite optimizar el costo por despliegue de los puntos de agregación de datos universales (UDAP) para la infraestructura avanzada de medición inteligente (AMI) considerando cobertura y capacidad. Se presenta un modelo de enrutamiento entre UDAPs basado en minimum spanning tree (MST) para encontrar el mínimo número de enlaces en una zona georreferenciada específica. Al estar georreferenciada se logra que la localización de UDAP y la topología de la red sean reales. La búsqueda de los lugares óptimos de un conjunto de sitios candidatos advierte la necesidad de un algoritmo de optimización que permita minimizar los sitios candidatos y los convierta en sitios factibles activos en el diseño previo al despliegue de la red. Los resultados obtenidos implican un punto base firme para que las empresas de distribución eléctrica establezcan el número adecuado de concentradores (UDAP). Dentro del trabajo se consideran ciertas tecnologías de comunicación aplicadas en AMI como: redes celulares (CDMA, GPRS, LTE) o el estándar IEEE 802.15.4 g. El menor costo basado en el uso óptimo de recursos para despliegue de infraestructura toma gran importancia para la planificación y escalabilidad de la red de AMI.Palabras clave: Redes eléctricas inteligentes, infraestructura de medición avanzada, punto de agregación de datos universal, mínimo árbol de expansión, optimización, costos, red de sensores inalámbricos. ABSTRACT This paper optimizes the cost of deployment of universal data aggregation points (UDAP) for advanced smart metering infrastructure (AMI), considering coverage and capacity. We propose a routing model between UDAPs, based on minimum spanning tree algorithm (MST) to find the minimum number of links in a specific geo-referenced area. Because it is geo-referenced, the location of the UDAP and the topology

show abstract

“…1 is an energy model [33]. Assuming that the distance between node i and node j is d and the packet length is L bits, the energy cost of sending L bits data is E i,j (L, d) and E r,x (L, d) is the energy cost of receiving L bits data.…”

Section: Problem Statementmentioning

confidence: 99%

An Efficient Tree-Based Self-Organizing Protocol for Internet of Things

et al. 2016

View full text Add to dashboard Cite

There are a lot of researches on self-organizing network at present. However, due to the characteristics of topological change of the Internet of Things, node resource constraints and random distribution and so on. Most of the existing self-organizing network are not applicable. This paper is aimed at the characteristics of the Internet of Things, and draws lessons from small world model, energy multi-path routing and hybrid routing algorithm. On the basis of GEAR protocol, a model of high efficient self-organizing network for large scale aware node is proposed: A multi-path hybrid routing model based on small world model, referred as SMH (Small World Multi-Path Hybrid Routing) model. In this paper, the model is implemented and an improved protocol based on GEAR is obtained, which is SMH-GEAR protocol. And SMH-GEAR protocol and GEAR protocol are compared and analyzed with simulation by using NS-2 network simulation platform. The result of the experiment shows SMH-GEAR protocol is better than GEAR protocol in terms of overall performance.

show abstract

Clustered balanced minimum spanning tree for routing and energy reduction in wireless sensor networks

Cited by 10 publications

References 6 publications

A Parallel Approach to Solve Minimum Spanning Tree Problem in Network Routing

A Parallel Approach to Solve Minimum Spanning Tree Problem in Network Routing

Óptimo despliegue y enrutamiento de UDAP para infraestructura de medición avanzada basada en el algoritmo MST

An Efficient Tree-Based Self-Organizing Protocol for Internet of Things

Contact Info

Product

Resources

About