• Nenhum resultado encontrado

A DYNAMIC ROUTE DISCOVERY SCHEME FOR HETEROGENEOUS WIRELESS SENSOR NETWORKS BASED ON POLYCHROMATIC SETS THEORY

N/A
N/A
Protected

Academic year: 2017

Share "A DYNAMIC ROUTE DISCOVERY SCHEME FOR HETEROGENEOUS WIRELESS SENSOR NETWORKS BASED ON POLYCHROMATIC SETS THEORY"

Copied!
13
0
0

Texto

Loading

Imagem

Figure 2. Illustration of a Network and Grouping
Figure 4. PS
Figure 6 shows the ratios of numbers of nodes with different priority under other six evaluation  metrics
Figure  7  shows  the  results  of  throughputs  and  figure  8  shows  the  results  of  delay  for  protocols  based  on  GFR  and  PS

Referências

Documentos relacionados

Then the routing paths are selected by connecting all the cluster head nodes using the minimum spanning tree with degree constraint that minimizes the energy consumption for

This phase discusses about the Conjugative sleep scheduling scheme in order to efficiently compute routing for the localized energy levels in wireless sensor networks.

This paper proposes an energy efficient routing protocol for heterogeneous sensor networks with the goal of finding the nearest base station or sink node1. Hence the problem of

In this paper, we have proposed a new technique to distribute the role of cluster head among some of the wireless sensor nodes based on their residual

Various metrics like packet delivery ratio, average network delay, network throughput, routing overhead and average energy consumption have been considered by varying the

LEACH (Low Energy Adaptive Clustering Hierarchy) [1], which is a homogeneous system then proposed a new routing protocol and data aggregation method in Leach heterogeneous

As seen from the simulation results in LEACH R, transmissions to the base station (high energy), takes place only from the R nodes which are selected from

This paper builds on the QoS mapping strategy and proposes a Synchronous Interleaved Dynamic Bandwidth Assignment (SIDBA) scheme based on the Interleaved Dynamic