Escolar Documentos
Profissional Documentos
Cultura Documentos
net/publication/330983855
CITATIONS 0
1 autor:
Prakasam Periasamy
LEIA 209
VIT Universidade
127 PUBLICAÇÕES 306 CITAÇÕES
VER PERFIL
Alguns dos autores desta publicação também estão trabalhando nestes projetos relacionados: Identificação de Modulação Automática Ver projeto
Todo o conteúdo desta página foi carregado por Prakasam Periasamy em 09 de fevereiro de 2019. O usuário solicitou o aprimoramento do arquivo baixado .
MONOGRAPH
Autor
PRAKASAM PERIASAMY
KRISH PUBLICATIONS
5/350, Kolingikattur, Sankari Tk.
Salem - 637103, Índia.
Número do celular: 9443119090
E-mail: krishinformatics.slm@gmail.com
KRISH PUBLICATIONS
5/350, Kolingikattur, Sankari Tk.
Salem - 637103, Índia.
Número de telemóvel: 9443119090
E-mail: krishinformatics.slm@gmail.com
Visite-nos em: www.krishjournals.com
Este livro ou qualquer parte dele não pode ser reproduzido de qualquer forma sem a
permissão por escrito do editor/autor(es) )
Rs. 150,00
Publicado por P.Sumathi para KRISH PUBLICATIONS, 5/350, Kolingikattur, Sankari Tk., Salem - 637103,
Tamilnadu, Índia.
Agradecimentos
apoio e incentivo.
professor.
Autor
Sobre o autor
Ele é nomeado no Marquês Who's Who no mundo no ano de 2009. Ele também
coordenou Conferências, AICTE e ISTE patrocinados pelo programa SDP e STTP
organizado pelo Departamento.
Uma Rede de Sensores Sem Fio (WSNs) é composta por nós coletores móveis
para
Introduçã 1 -6
o
2 Revisão de Literatura 7 - 10
3 Materiais e Métodos 11 - 25
3.2.1 Preliminares 17
4 Resultados e Discussões 26 - 40
4.1.3 dados 29
5 Conclusão e Resumo 41
Referências 42
Lista da Figura
Lista de Tabelas
Tabela Nº Nome da Tabela Página Nº
Capítulo - 1
Introdução
2
Todos os sensores nessa área motivam e reagem com seus dados detectados
próximos. Como o objeto móvel continua sua jornada, ele atinge outra posição no
tempo M*, a partir da qual inicia uma tarefa extra de amostragem. Existem três
recursos interessantes ligados à missão de amostragem de dados de campo do
sensor.
3
Esquemas de encaminhamento conforme projetado em [17] exploram o
significado de suas mensagens individuais transmitidas. Uma enorme quantidade de
trabalhos de protocolos de agregação de dados em RSSF para preservação de
energia é publicada. O DAACA para agregação de dados, como demonstrado em [18],
aproveita as vantagens de méritos globais e locais para feromônios de
desvanecimento ou depósito.
O problema de programação de ciclos de sono-vigília de nós é abordado em [19]
sob restrições de objetivo. Qualquer esquema de encaminhamento de pacotes
baseado em cast em [20] ainda fornece uma solução eficaz para o problema de
programação de ciclos de sono-vigília, mas falha em levar em consideração
não-Poisson para acordar os processos e outras definições de vida útil. A agregação
de dados ocultos recuperáveis, conforme descrito em [21] para integridade de dados
em RSSF, recupera o valor máximo de todos os dados de detecção.
Broadcast é um recurso de comunicação geral em RSSF. O escalonamento
ótimo off-line em sistemas de comunicação de captação de energia para os canais de
transmissão paralelos e de evaporação como mostrado em [21] política de potência de
transmissão e atinge o limite da região de partida máxima. A abordagem de
disseminação de chave Hill Climbing conforme descrito em [23] garante as fontes de
dados com a capacidade de filtragem mais forte.
1.2 Redução de colisão de pacotes na rede de sensores sem fio
Certas aplicações de emergência em redes de sensores sem fio (WSNs) incluem
monitoramento intermitente de incêndios em escritórios, florestas, redes de sensores
subaquáticos e assim por diante. O protocolo de comunicação projetado para fins
específicos pode ser tolerante a atrasos que incluem monitoramento normal projetado
especificamente para problemas de eficiência energética. No entanto, tendo em vista a
ocorrência de um evento de emergência, o fator de eficiência energética torna-se
menos importante quando comparado com a relação de entrega de pacotes. Assim, o
design do protocolo de comunicação deve se adaptar em resposta aos cenários. O
protocolo Hybrid Medium Access Control (HMAC), inicialmente discutido em [33], é
especificamente um protocolo interessante para resposta de emergência em uma
RSSF, pois generaliza uma abordagem híbrida de TDMA e CSMA para escalonar slots
livres de colisão. Embora o HMAC garanta a imparcialidade durante a transmissão dos
pacotes, a colisão ocorre sempre que um pacote é transferido para o nó sorvedouro na
rede de sensores.
4
A Rede de Sensores Subaquáticos (UWSN), uma das técnicas de rede
promissoras, tem recebido muita atenção nos últimos anos devido ao desenvolvimento
na área especificada. No entanto, a implantação de UWSNs é comparativamente mais
difícil do que as RSSFs devido ao ambiente tedioso e aos altos custos. O protocolo
QELAR [34] foi projetado com o objetivo de fornecer um protocolo de roteamento com
eficiência energética e aumento da vida útil da rede. O protocolo QELAR visa aumentar
a vida útil das redes distribuindo a energia residual eventualmente entre os nós
sensores da rede. Mas o protocolo QELAR não funcionou bem com a camada MAC
para suportar retransmissões de pacotes eficazes.
A maioria dos autores desenvolveu muitos protocolos convergentes em RSSFs.
A teoria do hiper grafo e o algoritmo Spanning Hyper-Tree [35] foi desenvolvido para
calcular o caminho de entrega de potência de transmissão mínimo definido para WSNs
converge-cast. Em [36], o fast converge-cast foi desenvolvido para RSSFs onde os nós
se comunicam usando um protocolo TDMA para minimizar o tamanho do
escalonamento. Em [37], um novo algoritmo heurístico foi projetado para construir uma
árvore com escalonamentos atribuídos aos nós para
convergir-casting sem colisões.
Para melhorar a eficácia das retransmissões de pacotes, a alocação de recursos
em redes sem fio multichip deve combinar o escalonamento com a alocação de
energia, o que é muito difícil de ser implementado. Para este fim, o autor em [38]
introduziu uma estrutura de randomização para comutadores em fila de entrada com
um modelo de interferência baseado em taxa SINR. Além disso, foi estudado um
problema de alocação de energia
distribuída que satisfez a programação e alocação de energia e obteve maior
rendimento. Mas os resultados obtidos não foram ótimos para condições multicanal.
Alguns dos avanços recentes em RSSFs resultaram em uma possibilidade única
de sentir o ambiente de forma remota. Portanto, maximizar a vida útil da rede com o
uso eficiente de energia tem sido uma questão fundamental em uma rede sem fio. Um
dos métodos para aumentar a vida útil de uma RSSF é a implantação de nós de
retransmissão que, por sua vez, se comunicam com outros nós sensores, ou nós de
retransmissão, e finalmente com as estações base.
Em [39], o algoritmo de encaminhamento de mensagens foi projetado com base
na seleção dos nós sensores mais próximos dos nós sensores disponíveis na rede
usando o
5
, Minimum Distance Packet Forwarding (MDPF). O algoritmo MDPF usou as
informações de roteamento para selecionar o nó com a distância mínima para reduzir o
número médio de saltos necessários para propagar para o nó que contém os dados
específicos. O posicionamento de nós de retransmissão para RSSFs está altamente
relacionado ao posicionamento e colocação de uma contagem mínima de nós de
retransmissão em uma RSSF para atender aos critérios de conectividade. No entanto,
em cenários práticos, o problema de restrições físicas durante o posicionamento dos
nós do relé também pode ocorrer. Para fornecer solução para este problema, versões
restritas do nó de retransmissão [40] foram projetadas em um conjunto de locais
candidatos, o que por sua vez aumenta o tempo de vida da rede. Mas, a restrição do
posicionamento do nó de retransmissão sob a conectividade mais fraca permaneceu
sem solução. Em [41], o autor estudou o problema de otimização usando qualquer
esquema de encaminhamento de transmissão para minimizar a relação de entrega de
pacotes entre os nós sensores e os nós sorvedouros. Com a ajuda dos resultados
obtidos, foi então fornecida uma solução para qualquer protocolo de encaminhamento
de pacotes cast para aumentar o tempo de vida da rede.
O throughput de uma rede sem fio de certa forma foi derivado usando o nível de
interferência e a ocorrência de colisões. Ao mesmo tempo, um nível mais alto de taxa
de transferência pode ser alcançado se as transmissões forem programadas de
maneira adequada. No entanto, a forma convencional de calcular os horários é
computacionalmente impossível. Os escalonamentos ótimos foram introduzidos em
[42] para computar escalonamentos ótimos que resolvem o problema do Conjunto
Independente Máximo Ponderado (MWIS) e resultam na minimização da colisão, mas
com uma limitação de 2048 nós. Os resultados existentes foram obtidos com base na
suposição de que ocorre overhead desprezível na topologia da rede e na sincronização
das transmissões dos enlaces. Mas no caso das grandes redes, a coleta de topologia
global e a sincronização de links são altamente inviáveis. Em [43], uma metodologia de
partição de escalonamento foi apresentada para grandes configurações de rede sem
fio para alcançar o dimensionamento de capacidade máxima.
6
Capítulo - 2
Revisão da Literatura
7
aplicações de controle nas RSSFs nas quais os nós transmitem informações através
do roteamento multipath para um nó sorvedouro.
A abordagem adaptativa Inside-Out Power INOP foi desenvolvida em [3]
emprega informações de vizinhança local de dois saltos para atingir baixa utilização de
energia na cobertura dos vizinhos de um salto. Usando as antenas direcionais [4], a
transmissão engenhosa é preparada em redes ad-hoc e a comunicação baseada em
mobilidade também é alcançada. 2.1 Reduzir o consumo de energia em
RSSF
O principal desafio para a rede com restrição de energia é projetar os protocolos
de roteamento energeticamente eficientes para equilibrar o consumo de energia.
SCP-MAC, um protocolo MAC de escalonamento síncrono com eficiência energética
em [24] diminui o prefácio combinando amostragem de preâmbulo e técnicas de
escalonamento. No entanto, não evita a perda de energia por espionagem, além disso,
devido ao seu procedimento de sincronização.
Cooperative Networking protocol (CONET), que reforma energicamente os
clusters, mas não suporta taxas múltiplas, conforme ilustrado em [25]. O protocolo
TDEEC (Threshold Distributed Energy Efficient Clustering) descrito em [26] visa
aumentar a eficiência energética e a estabilidade das redes heterogêneas de sensores
sem fio. O escalonamento de tempo em um canal de freqüência única como mostrado
em [27] com o objetivo de minimizar o número inteiro de slots de tempo essenciais
para uma conversão convergente não qualificada.
Redes sem fio multi-hop com ciclo de trabalho (problema IAGS-UDC) como
demonstrado em [28] não resolvem o problema de fofoca sob o modelo de
interferência física. Algoritmos de aproximação baseados em alcance de transmissão
em [29] elaboram métodos de coloração eficientes para colorir uma telha hexagonal
em 2D. O problema MLAS no modelo físico mais realista como mostrado em [30]
deriva a relação sinal-ruído-interferência (SINR) no nível do limite inferior.
Redundant Radix based Number (RBN) como representado em [31] codifica e
transmite dados para diferentes aplicações juntamente com períodos sem ruído para
comunicar o dígito zero, esquema de comunicação codificado, denominado
RBNSiZeComm. O RBNSiZeComm une dados à sua representação numérica binária
redundante comparável. Os modelos sinal-interferência-mais-ruído (SINR) descritos
em [32] tratam abertamente das leis de transmissão na física geral.
8
2.2 Transmissão de pacotes com problema de colisão As RSSFs de
última geração são projetadas de forma que diferentes aplicações envolvendo
conteúdo tenham que ser atendidas em vez de apenas encaminhar os pacotes de uma
ponta a outra. Para fornecer esses tipos de serviços, é necessária alta qualidade de
serviço em diferentes nós da rede. Mas o processamento de pacotes por diferentes
tipos de processadores com o mesmo fluxo resulta na mudança de ordem e alto atraso
para o tráfego de saída. Um esquema Ordered Round Robin [44] foi introduzido com a
suposição de que a carga era distribuída, que seguia um cronograma justo
dependendo das reservas. Mas o provisionamento de mapeamento ideal não foi
incluído. Um algoritmo conhecido como ocultação de perda de pacote foi projetado em
[45] para minimizar a quantidade de perda de pacote na RSSF usando transformada
discreta de cosseno modificada. Mas o tempo envolvido foi alto.
As futuras redes sem fio, como a Ultra-Wideband (UWB), possuem diferentes
recursos que se diferenciam dos demais tipos de tecnologias de comunicação sem fio.
Uma dessas características é a possibilidade de capturar menos pacotes
simultaneamente, o que resulta na melhoria do desempenho da camada MAC. Em
[46], um projeto é feito de tal forma que a camada física fornece recepção
multi-pacotes e apresenta mecanismos alternativos de back-off via análise Markoviana
que atinge tanto a taxa de transferência quanto a imparcialidade. Mas o design para a
configuração multi-hop permaneceu um problema desafiador.
Uma aplicação importante em RSSFs inclui agregação em rede para minimizar o
consumo de energia nos nós sensores. Posteriormente, os pacotes que possuem
destino semelhante são unidos em um caminho de roteamento específico e esses
pacotes são então enviados. Embora esses tipos de arranjos sejam adequados para
aplicações convencionais de rede de sensores multiponto-a-ponto, eles não são
adequados quando os nós sensores estão conectados em uma topologia de malha.
Portanto, em [47], a agregação de broadcast foi projetada para agregar pacotes
independente de seu destino. As RSSFs com a capacidade de natureza orientada a
eventos resultam em carga de rede, que é altamente imprevisível. Por causa disso, o
congestionamento pode surgir em níveis de nós sensores que obtêm uma quantidade
maior de dados do que podem encaminhar, resultando em desperdício de energia,
reduzindo o nível de taxa de transferência e, finalmente, perda de pacote. O protocolo
Fairness-Aware Congestion Control (FACC) [48] controlou o congestionamento e
alcançou uma alocação justa de largura de banda para diferentes fluxos.
9
Dois algoritmos de escalonamento de broadcast não adaptativo e adaptativo são
desenvolvidos em [49] que levam em consideração o consumo de energia dos nós
sensores com o objetivo de melhorar a vida útil da rede. Em [50], um novo algoritmo foi
desenvolvido para controlar os movimentos da estação base que reduziu o consumo
de energia e melhorou a vida útil da RSSF. O impacto de desabilitar as comunicações
de nós suspeitos no tempo de vida da rede por meio de uma estrutura de programação
linear (LP) são abordados em [51].
A transmissão de dados ou pacotes é um dos métodos eficientes para entrega
de informações em redes sem fio assimétricas, onde o desempenho de cada cliente é
independente do número de clientes localizados em uma região similar [52]. Essa
condição foi alcançada sem que todo o desempenho do sistema fosse afetado
significativamente. Mas a transmissão oportuna do pacote não foi garantida. Para
garantir a transmissão oportuna, cada pacote em [53] foi associado a uma restrição de
atraso usando um algoritmo de programação dinâmica para alcançar resultados
ótimos. Mas as prioridades não foram fornecidas para que cada pacote permaneça
sem endereço. Estratégias de implantação aleatória foram aplicadas em [54] para
retransmitir pacotes de dados de nós sensores para a estação base para equilibrar o
consumo de energia e estender a vida útil da rede. Um esquema de controle de acesso
ao meio (MAC) [55] foi apresentado para minimizar a taxa de colisão e melhorar o nível
de throughput usando número constante de slots e resolveu o problema de contenção
de maneira eficiente. Mas funcionou apenas em uma base de curto prazo, que não
pode ser estendida por um longo período de tempo.
Em [56-58], a otimização consciente da energia do controle de potência,
transmissão de pacotes e controle de topologia em RSSFs foi apresentada para
resolver o problema de minimizar o consumo de energia. O algoritmo de controle de
colisão foi desenvolvido em [59-63] para reduzir os efeitos do congestionamento e
comprometer o atraso e a colisão.
A estrutura desta monografia é a seguinte. No Capítulo 3, apresenta-se a
Metodologia Proposta para o framework SNSTGS, o método MS-RDB e o Protocolo
ASC realizado em rede de sensores sem fio com o objetivo de minimizar a perda de
pacotes com auxílio do diagrama de blocos. Os resultados simulados e as discussões
são apresentados no Capítulo 4. Por fim, concluímos esta monografia no Capítulo 5.
10
Capítulo - 3
Materiais e Métodos
11
routes to reach the destination, the numerous sampling tasks is done depending on one
too many mapping sources. Once the mapping is effectively performed by means of the
related source and destination, the model can be planned.
WSN
12
Packet data is directed from source to destination with a set of decision variables,
j
=
otherwise
Depending on the task on route path between the nodes i and j, the packet data
will pass onto the S (p) and D (p). A communication link can be used for numerous
source-sink pairs to pass the nodes. The reality is that nodes (a, b) is employed to direct
as a minimum of one message for a source-sink pair. The purpose of communication
link from source to destination employed to allocate data messages are planned as,
∑
Path PA uab
( , ) ( , ) …......… 2
=
(,)
ab A
∈
The packets to be sent submit to the similar form of sensor data, such as the
warmth of the environment.
Numerous queries search for diverse types of sensor data can be calculated
individually, and such query dealing out can be cut down by using techniques
like attribute correlation.
Every node identifies its geological location and the range of the sensor field.
A region in the sensor field is identified as a rectangle connected next to the X and
Y axes. For a region which is not combined with the axes, then the region is
recognized by one or more regions which face the region of interest.
13
3.1.2 Numerous Sampling Task Representations in Sensor Field Initially, the
sensor readings of the sensor nodes are noted and outlined a region to pass the packet
data to the sink node. By means of the sensor readings, the recognition of nodes in the
intersection regions is noted. This is shown in Fig 3.2.
Calculate the set of meeting regions in the sensor field connected with the sensor
nodes
Recognize the set of nodes in the specific region to transmit the data in many
route path
If the data packet is retransmitted to the sink node, recognize the path and the
starting node to count the number of times the nodes sent the packet data.
14
3.1.3 Geometric Series Synchronization Method
Consider a set of nodes nϵN in WSN and a data packet is set as pϵP in a route
path rϵR. Consider a set of regions gϵG from which the source nodes and the mobile
sink node is recognized. The numerous sampling tasks through retransmit method
made the network regions overlapping.
The most important step is to recognize the source sensor node S (n) in the
network together with the data packet p. After that recognize the route r by means of
which the data packets are passed. With the values of S (n), p and r, confirm whether
the p attains the mobile sink. If not, rebroadcast is completed. Calculate the number of
times the R (S (n)) retransmit the data packet p to the sink node. It
is stated as,
R(S(n) = p * t …......… 3
Where,
R(S (n)) – Counting variable
P – Data packet
t – No. of time the data packet is routed to reach the mobile sink. The value of t
is set depending on the number of times the data packet is directed to arrive at the
destination. Depending on this, R (S (n)) is decided. It arranges similar to a loop.
Depending on this arrangement, execute the process for all source sensor nodes in the
network and sketched a series. The series of the source nodes is decided as,
S - s1, s2, s3,…………….……, sn
R (S (n)) - 2, 4, 6,……………………, C
Fig. 3.3 explains the process of synchronization which can be shown with the
directed path. Depending on the charge of R (S (n)), the route path is established. By
using the path, the data packet is sent by the source nodes are synchronized with each
other correspondingly.
//Algorithm
Input: set of nodes S
Begin
For each sensor source node S
Recognize the number of packet P it holds
Calculate the rebroadcast of data packet R (S (n))
End for
Depending on the charge of R (S (n))
Structure a series
Recognize the common counting of data packets the nodes
contain Select the shortest route path (r)
Allow the packet to the sink node
End
With this process, the synchronization among the sampling tasks is attained in
the sensor network.
3.2 Reverse Direction Broadcasting On Multiple Sampling Tasks
Multiple Sampling Reverse Direction Broadcasting method performs effective data
gathering and broadcasting of the packets in the reverse direction (ie,) from all nodes to
sink nodes at one time slot. MS-RDB method accomplishes data aggregation process
to multiple sampling tasks. Multiple Sampling Reverse
16
Direction Broadcasting (MS-RDB) method divides whole network into regions based on
the sink node. The sink nodes collect all packets from the nodes at one time through
Reverse Direction Broadcast process. The Reverse Direction Broadcasting with data
aggregation property transfers all data to sink node in each sub sequence.
MS-RDB method avoids the situation where two nodes located far away from
each other become neighbors in the sequence constructed for whole network to avoid
the problem occurred in existing system. The main goal for MS-RDB method is to
construct an energy-efficient chain and transmit all node information to sink node at one
time slot. The algorithm constructs a sequence where each node communicates with
any type of nodes in sensor network.
3.2.1 Preliminaries
MS-RDB method treats the sensor networks with static nodes. A sensor network
contains huge scale of sensor nodes that are motionless and energy controlled. Each
node regulates the area of coverage with its transmission using transmission power
control. End users access data through the sink node. The sink node is fixed and
located far from the sensors. Sink node has sufficient power supply; therefore, it has no
energy constraints. The source of power consumption is classified into three types with
regard to operations such as sensing relation, communication correlated and
computation correlated. Decreasing energy indulgence prolong the lifetime of a
network. Distance is a major factor in energy indulgence.
Reverse Direction Broadcast transmit data to the sink node with minimal energy
consumption at one time slot, and it is formulated as
+E n +E
Eenergy amp d = dn nJEenergy n
amp d = dn nJ ……(5) Thus, to
broadcast one bit message at distance'd' in sensor network, where 'n' is a stable
depending on the location circumstances. Eamp is the transmit speed amplifier to
compute the reverse direction broadcasting speed and 'J' joules consumed to average
the Eenergy consumed. The energy dissipation for sending data in reverse direction
consists of two parts namely redirection electronic and redirection amplifier.
Based on the analysis of energy consumption, it need to minimize the redirection
distance and data size to conserve energy on multi sampling tasks. In reverse direction
broadcasting, each node upholds the size of the header and concatenates its data to
the data from other nodes in sink node.
17
3.2.2 RDB on Multi Sampling Tasks
A multi sampling tasks decrease the total transmission distance for reverse
direction broadcasting. MS-RDB method main idea is to divide the whole sensing area
into six regions centred at the node that is closest to the center of the sensing area.
MS-RDB method constructs a linear sub sequence in each region. The maximum
distance between two neighbouring nodes in a sub sequence is smaller than that in a
single linear sequence generated within the whole area.
For example, divide an n*n area into six equal regions. The maximum
neighbouring distance in a sub sequence is 22 n. However, it doubles to 2n in a single
sequence. Thus MS-RDB method minimizes the total neighbour distance.
The transmission of packet from sink node to all nodes and from all nodes to sink node
is shown through Fig 3.4.
Figure 3.4 Multiple Sampling Task Representation
In MS-RDB method, sink node collects the information from all the sensor
nodes and performs the multiple sampling task. MS-RDB method aggregate and
transmit packets to the sink node at one time slot. Initially, it sends the packet to all six
neighbours, which transmit the packet to the end of all sub sequences. In aggregate
approach, each sub sequence in MS-RDB method independently transfers and
concatenates data from the end of sequence to sink node. After sink nodes collects all
data, it produces a packet which contains information of the whole network system. In
transmit approach, broadcast each sub sequence independently
18
and accumulates data packet to sink node. Then sink node transmits all received
packets to all sub sequences. To avoid the redundancy, the neighbors of sink node
check each receiving packet.
If a packet is the same as what a node just sent to sink node, then it will discard
the packet to avoid redundancy. If a packet is the first new packet the node receives, it
will send this packet combined with its own sensing data along the sequence. Each
reverse direction broadcasting node performs the analogous combination, generate and
send a larger packet to the next node, until transmission terminates at the end of sub
sequence. If the packet does not belong to the proceeding two cases, the neighbour
node only transmits this packet. No other data is concatenated to the packet.
In MS-RDB method, simplified assumptions are taken such that the number of
nodes 'n' associated with 'r' disjoint source destination routes such that
19
While Sl captures noise as well as the error due to medium access conflict, Sb
captures the packet loss due to input buffer overflow and node failure while reverse
direction broadcasting. Note that, to highlight the differences between different multiple
sampling tasks the end node (ie, destination) is considered ready to receive all packets.
Eb is the signal to noise ratio bit of packet 'p'. N0 is the average bit error probability
computed based on time slot and I is the packet size.
3.2.3 Reverse Direction Broadcast with MinTotal Energy Algorithm A packet
schedule along a reverse direction computes total energy indulgence of the network
which contains two parts such as aggregating and transmitting energy consumption at
each node. The total energy used by all nodes in receiving a packet is (n-1)*I* Eenergy
where I is the packet size. The energy consumption of receiving is independent of the
type of the sequence used. The transmission energy depends on the distance between
two nodes along a sequence dn. To simplify the analysis consider the packet transfer at
one time slot. The analysis for conserving total energy consumption is to build a
sequence with minimum ∑dn, where d is the distance between two nodes along the
sequence.
20
From the algorithm, Dj represents the node at location j in sequence, where d2 is
the square of distance between nodes and n' indicates the number of nodes. The first
stage in above algorithm is to find the farthest node from sink node as one end of the
sequence. Then each round selects a NEW node which is not in the sequence to
redirect the packet from the sensor nodes to sink nodes. The selection criteria are that
∑d2 of the current sequence with NEW node increases to the minimum possible extent
compared to the old sequence. There exist two cases depending on insertion position j.
In MS-RDB algorithm, If Dj is already the end of the current sequence, simply append
NEW to the sequence. Otherwise insert NEW between Dj and Dj +1 at same time slot.
The new transmission path from Dj to Dj + 1 through node Di minimizes the delay cost to
the sequence with all other sensor nodes in MS-RDB method.
3.3 Authoritative Synchronized Converge-Cast Protocol in Wireless
Sensor Network
The main objective of the Authoritative Synchronized Converge-Cast Protocol is
to minimize the packet collision rate when the packets are rebroadcasted from the
sensor nodes to the sink node. Normally, the packets are rebroadcasted from the
sensor nodes to the sink node using the same communication channel. The
Converge-Casting process in ASC protocol helps to perform the inverse operation
during packet broadcasting (ie,) rebroadcasting. The ASC protocol is integrated with
MAC layer to perform higher throughput level while broadcasting the packet
information. The sensor network consists of the multiple sensor events to monitor and
coordinate the multiple sampling tasks. The multiple tasks are integrated and process is
carried out in the data link layer of the wireless sensor network. The data link layer with
MAC in sensor network provides effective channel accessing for the packet
rebroadcasting. With this, the MAC integrates the proposed ASC protocol for easy
rebroadcasting of packet without any collision. Here, the sink nodes receive all the
reverse broadcasted sensor packet information in the ASC protocol. From the Fig, the
sensor nodes used for packet rebroadcasting are S1, S2, S3, and S4 in wireless sensor
network.
In WSNs, Converge-Cast is used to retransmit the packet information in an
efficient manner, from the sensor nodes to the sink nodes. The sink nodes receive all
21
the information from the sensor nodes concurrently. Here with the concurrent arrival of
packets, possibility of packet collision leads to serious crisis. To overcome the packet
collision, circular coordination strategy is used in ASC protocol to minimize the rate of
packet collision. The circular coordination strategy in ASC protocol adjusts the packet
transmission time using the Quadratic principle. With the application of
Converge-Casting on MAC layer with quadratic principle in ASC protocol the packet
collision is largely minimized in the sensor network with increase in the lifetime of the
network. The elaborate process involved in the design of ASC protocol is briefed in the
forthcoming subsection.
Let us assume that the sink node be represented as the root node whereas all
other sensor nodes (ie, S1, S2, S3, …, Sn) be the sensor or leaf nodes. The process
starts whenever a packet 'P' is instantiated from the sensor nodes. If a packet 'P'
22
is detected then the packet is appended into the communication channel for the
purpose of reverse broadcasting. If the sink node contains the packet 'P' then the
process is repeated for all the sensor node packet rebroadcasting. If the sink node does
not contain a packet 'P', then global function is applied until it reaches the sink node. As
illustrated in the algorithm, the Converge-Casting step helps to easily understand the
packet rebroadcasting from the sensor nodes to the sink node using ASC protocol. The
lesser the intermediate node, the execution time of the ASC protocol in MAC layer is
reduced.
The sink node receives all the sensor node packets in the MAC layer. Followed
by this, the sensor node packet is rebroadcasted using the global function. The global
function in ASC protocol takes the vertex points 'S' with the input packets 'P' for
computation. Global Function (GF) in ASC protocol is formularized as,
23
distance based sequential coordination. The sequence in the sequential coordination is
coordinated in circular form using ASC protocol to clearly compute the retransmit time
without any packet collision. The second step involved in the design of CC strategy is to
clearly describe the number of sensor nodes to avoid the overflowing of packets.
The initial step in the CC procedure is the sequential coordination which
measures the hop distance in a clear manner to avoid packet collision during multiple
sampling tasks. Followed by this, the second step uses overflow avoidance to evaluate
the likelihood control mechanism. With this the probability of packet retransmit time is
computed to avoid the packet collision in sensor network. The detailed analysis of two
steps fold, sequential coordination and overflow avoidance is explained below.
Sequential Coordination Step
The Sequential Coordination in a circular form acts as the key strategy to
minimize the packet collision. The first task involved during the design process of CC
procedure is that the Sequential Coordination sends the reply once the events are
received from the sensor nodes. The reply is sent by using the measured hop distance
value in wireless network, and as a result the ASC protocol minimizes the packet
collision rate on the same communication channel. The hop distance value is computed
as
Hop Distance = I1 + I2 + I3 + .. In …….. (11)
The hop distance value in the sequential coordination is measured based on the
intermediate nodes 'I1', 'I2','I3'….'In' from the sensor nodes to the sink node. The
sequential coordination function is implemented in ASC using the circular topology
structure. The circular topology structure waits for the particular hop distance time to
avoid the collision rate on multiple events driven wireless sensor network. The waiting
time based on the hop distance is computed as,
The waiting time of the multiple events is denoted by WT (S) that is based on the
hop distance. The time taken to reach the root (ie,) sink node is represented by τ which
travels through each intermediate nodes. S denotes the sensor node containing the
packets in MAC layer for effective rebroadcasting.
24
Overflow Avoidance step
ASC protocol avoids the overflow of packets in the communication channel
using the Likelihood control mechanism. The sequential coordination based packet
collision avoidance as described, achieves higher success rate. The higher success
rate is achieved even on the overflow avoidance of the packets in the sensor network.
In multiple event sampling tasks, ASC protocol bootstraps the sink node to avoid the
overflow of packets. Each sensor node in the ASC protocol in MAC layer computes the
hop distance to adjust the packet transmission time and to maintain the higher packet
flow rate without any collision.
Likelihood control mechanism control the packet rebroadcast time based on the
probability ratio. Likelihood control mechanism retransmits the packet indicating the
higher success rate from the sensor node to the sink node. A sink node which attain the
packet, tries to allocate the communication channel for the next packet transfer from the
different sensor node in a likelihood (ie,) probabilistic manner. With this the ASC
protocol maintains the relative distance time for packet forwarding.
3.3.3 Quadratic Principle on MAC-ASC Integration
Once the procedure of circular coordination is achieved by applying sequential
coordination and overflow avoidance, the last step involved in the design of ASC
protocol is to design the quadratic principle that effectively integrates the MAC layer
with ASC protocol. The quadratic form is given as
P(S2) + P(S) = Sink node …….. (13)
As given in (13), the packets 'P' on the sensor nodes 'S' are rebroadcasted to the
sink node. With this, the result produces a collision free rebroadcasting of packet
information. By integrating the circular coordination strategy with Converge Casting
process, collision is reduced further and eventually the throughput rate is improved.
25
Chapter - 4
Results and Discussions
26
below table and graph explains the result of the proposed synchronizing numerous
sampling tasks in sensor field using geometric series and existing Band-based
Directional Broadcast method.
Average number of messages is termed as the total number of messages employed in
each rebroadcast technique which is separated by the total number of nodes
incorporated in the particular regions.
∑ ()
= ()
R
...... (14) Where, tot (M) – total number of messages Table 4.1 No. of data packet vs.
average number of messages
No. of Average number of messages
data
Propose Existing Band-based Direction
packet
d Broadcast technique
SNSTGS
25 17 33
50 15 29
75 12 25
100 9 20
125 6 16
150 3 12
The average number of messages is calculated depending on the number of data
packets in the sensor node. The value of the proposed synchronization of numerous
sampling tasks in sensor field by means of geometric series is compared with the
existing Band-based Directional Broadcast method is demonstrated in table 4.1.
Fig 4.1 explains the average number of messages is calculated depending on the
number of data packets in the sensor node. Compared to the existing Band based
Directional Broadcast method, the proposed SNSTS gives less average in broadcasting
the messages. Smaller the value of average number of messages, higher the number
of distribution of data packet is executed in the network. Existing Band based
Directional Broadcast method controls only the path of the rebroadcast that are initiated
from the sensor nodes in the network, fails to synchronize with the
27
incoming data packets. So, region overlapping is high, consequently the distribution of
message is also less.
25 5 11
50 9 15
75 12 19
100 15 23
125 19 27
150 21 32
28
The percentage of packet overlapping is calculated depending on the number of data
packets collected in the sensor node. The values of the proposed Synchronizing
numerous sampling tasks in sensor field using geometric series is compared with the
existing Band-based Directional Broadcast technique is demonstrated in table 4.2.
ln . sin
=
29
The values of the proposed Synchronizing numerous sampling tasks in sensor
field using geometric series is compared with the existing Band-based Directional
Broadcast method is demonstrated in table 4.3.
Table 4.3 No. of nodes vs. data deliverability
No. of Data deliverability (%)
nodes
Proposed Existing Band-based Directional
SNSTGS Broadcast technique
50 20 10
100 26 15
150 32 19
200 40 26
250 46 32
300 52 37
Fig 4.3 demonstrates the simulation results of data deliverability depending on the
number of nodes in the sensor field. The data deliverability is calculated in terms of
percentage (%).
30
From Fig 4.3, it is being taken that SNSTGS method offers high rate of data
deliverability than the existing Band-based Directional Broadcast method. As, SNSTGS
remove rebroadcasts method, consequently the delivery rate of data packet is lower.
This occurs when some involvement among a sensor node and the mobile object is lost
because of minimizing the rebroadcasts which attain a higher
numbered band. But in the proposed SNSTGS, the deliverability rate is fairly high,
because it synchronizes the set of data packet depending on the geometric series. The
difference in the data deliverability in the proposed SNSTGS is 28-50% high. Lastly, the
result shows that the SNSTGS offers consistent synchronization among data packets
using geometric series method.
4.2 Experimental evaluation of MS-RDB method Simulation takes over
based on the sensor network package successively on the NS2 simulator. Our
simulation scenarios used 50 sensor nodes. These nodes are deployed uniformly and
randomly in an 800m x 800m field with a maximum speed of 45 m/s and an average
pause of 0.01s. Each simulation was over a time period of 950 simulation seconds. The
sensor nodes use the AODV as the routing protocol.
31
efficiency, and packet loss rate. The normalized throughput in MS-RDB method is the
sum of data rates that are delivered to all terminals in a network. Subsequent factor,
delay rate is measured as the amount of packet percentage delayed while packet
transmitted at one time slot. Transmission latency factor is the amount of time required
to move forward all of the packet's bits in sequence order. Broadcasting efficiency is
defined as the significant change, maximizing efficiency with multiple sampling on
wireless sensor network, measured in terms of percentage (%).Packet Failure rate
factor is that the rate at which the packet drop is identified in links effectively and
overcoming it successfully using the MS-RDB method.
Multiple Sampling with the Reverse Direction Broadcast (MS-RDB) method is
compared against the existing Constant approximation (CA) algorithm for the 2-Disk
model and Energy Efficient MAC protocol (EE-MAC) for WSN. The below graph
describes the MS-RDB method improvements with beneficial simulation results when
compared with existing system.
Fig 4.4 describes the normalized throughput based on the node distance. At each
round, selects a NEW node which is not in the sequence to redirect the packet from the
sensor nodes to sink nodes. The selection criteria ∑d2 of the current sequence with
NEW node increases to the minimum possible extent compared to the old sequence. In
MS-RDB Method, throughput value increased by 10 – 20 % when compared with the
CA Algorithm and 4 – 8 % improved when compared with the EE-MAC protocol.
32
Fig 4.5 illustrates the energy consumption based on the per hop count. Single
node insertion at every round of reverse direction broadcast, so that the smallest
amount of energy consumption takes place on whole sequence. As the count
increases, the energy consumption in MS-RDB Method is reduced to 5 - 15 % when
compared with CA Algorithm and 5 – 10 % decreases when compared with the EE
MAC protocol.
12 – 16 % when compared with the CA Algorithm. The MS-RDB method also reduced
approximately to 9 % when compared with the EE-MAC protocol.
Fig 4.7 shows the measurement of reverse broadcast efficiency factor obtains
the better result in MS-RDB method when compared with the CA Algorithm and
EE-MAC protocol [1, 2]. Eamp is the transmit speed amplifier to compute the reverse
direction broadcasting speed and depends on the data size and the redirection
distance. In reverse direction broadcasting, each node upholds the size of the header
and concatenates its data to the data from other nodes in sink node, to improve the
33
efficiency level. Reverse broadcast efficiency of MS-RDB method is 2-5 % higher when
compared with EE-MAC protocol and 7-14 % when compared with the CA Algorithm.
34
Finally, MS-RDB method significantly decreases the packet loss ratio, latency and
energy consumption rate. To reduce power consumption in MS-RDB method, a node
forwards merely one of many packets, established from its secondary sources, to the
destination.
Protocols AODV
Simulation time 50 ms
Number of mobile nodes 10, 20, 30, 40, 50, 60, 70,80
Mobility model Two Ray Ground Model
Network simulator NS 2
Pause time 15 s
Packets 50,100,150,200,250,300,350,400
The performance of ASC protocol is compared against with the existing Hybrid
Medium Access Control (HMAC) protocol [33] and Machine-Learning-Based Adaptive
Routing (QELAR) protocol [34]. The experiment is conducted on the factors such as
packet collision rate, packet transmission time, bandwidth rate, throughput level, and
execution time.
35
4.3.1 Packet collision rate (PCR)
The packet collision rate (PCR) is defined as the number of packet collisions
being detected (PCD) to the total number of packets transmitted. The packet collision
rate is measured in terms of (%) and mathematically formulated as below,
..... (17)
50 11 15 20
100 14 19 24
150 15 22 27
200 17 25 28
250 12 20 20
300 20 23 24
350 22 24 29
400 24 27 32
Table 4.5 shows the packet collision rate of ASC protocol with respect to the
different number of packets in the range of 50 to 400 and comparison is made with two
existing methods namely, Hybrid Medium Access Control Protocol (HMAC) protocol
[33] and Machine-Learning-Based Adaptive Routing (QELAR) Protocol [34]. From the
table value, it is illustrative that the packet collision rate using ASC protocol is reduced
as compared to the other existing protocols [33], [34].
Fig 4.9 illustrates the packet collision rate observed using the proposed ASC
protocol with MAC layer and compared with two other methods. As shown in Fig, the
packet collision rate using the ASC protocol is performs relatively well when compared
to the Hybrid Medium Access Control Protocol (HMAC) protocol [33] and
Machine-Learning-Based Adaptive Routing (QELAR) Protocol [34].This is because of
the fact that the circular coordination strategy is used in ASC protocol that results in the
minimization of packet collision by 9-40% when compared to HMAC. Further with the
application of CC strategy in ASC protocol, the hop distance is identified
36
based on the sequential coordination that minimizes the packet collision by 30-80%
than compared to HMAC.
50 4 7 10
100 9 12 15
150 12 14 19
200 14 20 22
250 18 23 28
300 20 24 32
350 22 27 35
400 25 30 42
37
The Table 4.6 represent the packet transmission time with respect to the number
of packets in varies in the range of 50 to 400 and compared with two other methods.
From the table values, it is descriptive that the packet transmission time using ASC
protocol is reduced as compared to other existing methods [33], [34].
Fig 4.10 shows the measure of packet transmission time using three different
methods namely proposed ASC protocol, HMAC protocol, QELAR Protocol. As shown
in Fig, packet transmission time using ASC protocol is performs relatively well as
compared to the other existing protocols namely, Hybrid Medium Access Control
Protocol (HMAC) protocol [33] and Machine-Learning-Based Adaptive Routing
(QELAR) Protocol [34]. Besides, while increasing the number of packets transmitted,
the packet transmission time is gets also increased. But comparatively packet
transmission time using ASC protocol is lesser. This is because the Converge
Casting process in ASC protocol helps to perform the inverse operation during packet
broadcasting (ie,) rebroadcasting and minimizing the packet transmission time by 20 –
75 % when compared to HMAC. Further the global function in ASC protocol eventually
review the packets received from the sensor nodes of the wireless network by reducing
the packet transmission time by 55 – 65 % when compared to HMAC.
38
4.3.3 Bandwidth rate
The bandwidth rate using ACS protocol defines the packet transfer rate, ie, the
number of packets that can be transmitted to the sink node. This bandwidth rate
is measured in terms of bits per second (bps).
Table 4.7 Bandwidth Rate
Packet Bandwidth Rate (bps)
Size (MB)
ASC HMAC QELAR
500 14 12 10
1000 17 15 12
1500 25 18 14
2000 32 23 17
2500 35 27 22
3000 40 33 25
3500 52 38 28
4000 58 42 32
Table 4.7 demonstrates the result analysis of bandwidth rate with respect to
differing packet size of ranges 500 MB and 4000 MB. From the table value, it is
illustrative that the bandwidth rate using ASC protocol is higher as compared to the
other existing methods.
41
References
1. Juzheng li, sol m. Shatz et. Al., “Mobile Sampling of Sensor field Data using
controlled Broadcast”, IEEE Transactions On Mobile Computing, vol. 10, no. 6,
June 2011 881.
2. Scott C.-H. Huang et. Et. Al., “Broadcast Scheduling in Interference Environment”,
IEEE Transactions on Mobile Computing, Vol. 7, No: 11, November 2008. 3. A.
Chiganmi, M. Baysan, K. Sarac, and R. Prakash, “Variable Power Broadcast Using
Local Information in Ad Hoc Networks,” Ad Hoc Networks, vol. 6, no. 5, pp. 675-695,
July 2008.
5. J. Li and SM Shatz, “Sampling Sensor Fields Using a Mobile Object: A Band Based
Approach for Directional Broadcast of Sensor Data,” Proc. IASTED Int'l Symp.
Distributed Sensor Networks, Nov. 2008.
6. Mingyan Li et. Al., “Optimal Jamming Attack Strategies and Network Defense
Policies in Wireless Sensor Networks”, IEEE Transactions On Mobile Computing,
Vol. 9, No: 8, August 2010.
7. Emad Felemban et. Al., “SAMAC: A Cross-Layer Communication Protocol for Sensor
Networks with Sectored Antennas”, IEEE Transactions on Mobile Computing, Vol.
9, No. 8, August 2010.
8. Raja Jurdak et. Al., “Radio Sleep Mode Optimization in Wireless Sensor Networks”
IEEE Transactions on Mobile Computing, Vol: 9, No: 7, July 2010. 9. Arif Selcuk
Uluagac et. Al., 'VEBEK: Virtual Energy-Based Encryption and Keying for Wireless
Sensor Networks', IEEE Transactions on Mobile Computing, Vol. 9, No. 7, July 2010.
10. Xue Wang et. Al., “Distributed Energy Optimization for Target Tracking in Wireless
Sensor Networks”, IEEE Transactions On Mobile Computing, Vol. 9, No: 1,
January 2009.
42
11. Bin Xiao et. Al., “Reliable Anchor-Based Sensor Localization in Irregular Areas”,
IEEE Transactions on Mobile Computing, Vol: 9, No. 1, January 2009 12. Pangun Park
et. Al., “Breath: An Adaptive Protocol for Industrial Control Applications Using Wireless
Sensor Networks”, IEEE Transactions on Mobile Computing, Vol. 10, No. 6, June 2011.
14. Enyang Xu., Zhi Ding., and Soura Dasgupta., “Target Tracking and Mobile Sensor
Navigation in Wireless Sensor Networks,” IEEE Transactions on Mobile
Computing, Vol. 12, No. 1, January, pp 177-186, 2013.
15. Satyajayant Misra, Seung Don Hong, Guoliang (Larry) Xue, and Jian Tang,
“Constrained Relay Node Placement in Wireless Sensor Networks: Formulation
and Approximations,” IEEE/ACM Transactions on Networking, Vol. 18, No. 2, pp
434-437, April 2010.
18. Chi Lin., Guowei Wu., Feng Xia., Mingchu Li., Lin Yao., Zhongyi Pei., “Energy
efficient ant colony algorithms for data aggregation in wireless sensor networks,”
Journal of Computer and System Sciences, pp 1686 -1702, 2012.
19. Ungjin Jang., Sunggu Lee ., Sungjoo Yoo., “Optimal wake-up scheduling of data
gathering trees for wireless sensor networks,” Elsevier Journal of Parallel
Distribution Computing, pp 536-546,2012.
43
20. Joohwan Kim., Xiaojun Lin., Ness B. Shroff., and Prasun S., “Minimizing Delay and
Maximizing Lifetime for Wireless Sensor Networks With Anycast,” IEEE/ ACM
Transactions on Networking, Vol. 18, No. 2, pp 515-528, April 2010.
21. Chien-Ming Chen., Yue-Hsun Lin., Ya-Ching Lin., and Hung-Min Sun., “RCDA:
Recoverable Concealed Data Aggregation for Data Integrity in Wireless Sensor
Networks,” IEEE Transactions on Parallel and Distributed Systems, Vol. 23, No. 4,
pp 727-734, April 2012.
22. Omur Ozel., Jing Yang., Sennur Ulukus., “Optimal transmission schemes for parallel
and fading Gaussian broadcast channels with an energy harvesting rechargeable
transmitter,” Computer Communications., Elsevier journal., pp 1360-1372, 2013.
23. Zhen Yu., and Yong Guan., “A Dynamic En-route Filtering Scheme for Data
Reporting in Wireless Sensor Networks,” IEEE/ACM Transactions on Networking,
Vol. 18, No. 1, 2010, pp 152-163.
24. Beakcheol Jang., Jun Bum Lim., Mihail L. Sichitiu., “An asynchronous scheduled
MAC protocol for wireless sensor networks,” Computer Networks., Elsevier
Journal., pp 85-98, 2013.
25. Jong-Woon Yoo., and Kyu Ho Park.,“A Cooperative Clustering Protocol for Energy
Saving of Mobile Devices with WLAN and Bluetooth Interfaces,” IEEE
Transactions On Mobile Computing, Vol. 10, NO. 5, pp 491-504, April 2011.
26. Parul Saini., Ajay K Sharma., “Energy Efficient Scheme for Clustering Protocol
Prolonging the Lifetime of Heterogeneous Wireless Sensor Networks,”
International Journal of Computer Applications (0975 – 8887), Volume 6– No.2, pp
30-36, September 2010.
27. Ozlem Durmaz Incel., Amitabha Ghosh., Bhaskar Krishnamachari., and Krishnakant
Chintalapudi., “Fast Data Collection in Tree-Based Wireless Sensor Networks.,
“IEEE/ACM Transactions on Networking, pp 86-99, 2012.
28. Xianlong Jiao., Wei Lou., Xiaodong Wang., Junchao Mab., Jiannong Cao.,
Xingming Zhou., “On interference-aware gossiping in uncoordinated duty-cycled
multi-hop wireless networks,” Ad Hoc Networks., Elsevier journal., pp 1319- 1330,
2011.
44
29. Ravi Tiwari, Thang N. Dinh, My T. Thai “On approximation algorithms for
Interference-Aware Broadcast Scheduling in 2D and 3D Wireless Sensor
Networks,” Springer Journal., pp 438-448,2009.
30. Min Kyung An., Nhat X. Lam., Dung T. Huynh., Trac N. Nguyen., “Minimum latency
data aggregation in the physical interference model,” Computer Communications.,
Elsevier journal., pp 2175-2186, 2012.
31. Koushik Sinha., Bhabani P. Sinha., and Debasish Datta., “An Energy-Efficient
Communication Scheme for Wireless Networks: A Redundant Radix-Based
Approach,” IEEE Transactions on Wireless Communications, Vol. 10, No. 2,
February, pp550-559, 2011.
32. Scott C.-H. Huang., Peng-Jun Wan., Jing Deng., and Yunghsiang S. Han.,
“Broadcast Scheduling in Interference Environment,” IEEE Transactions on Mobile
Computing, vol. 7, no. 11, pp 1338-1348, November 2008.
33. Lanny Sitanayah, Cormac J. Sreenan, Kenneth N. Brown. A hybrid MAC protocol
for emergency response wireless sensor networks, Ad Hoc Network. Elsevier
2014; 20: 77-95.
34. Tiansi Hu, Yunsi Fei. QELAR: A machine-learning-based adaptive routing protocol
for energy-efficient and lifetime-extended underwater sensor networks. IEEE
Transaction on Mobile Computing 2010; 9: 796–809.
35. Ting Yang, Chun Jian Kang and Guofang Nan, An energy-efficient and fault tolerant
convergecast protocol in wireless sensor networks. International Journal of Distributed
Sensor Networks Volume 2012, Article ID 429719, 8 pages.
36. O¨ zlem Durmaz Incel, Amitabha Ghosh, Bhaskar Krishnamachari, and Krishnakant
Chintalapudi, Fast data collection in tree-based wireless sensor networks, Mobile
Computing. IEEE Transactions on, vol. 11, no. 1, pp. 86,99, Jan. 2012.s
37. V. Annamalai, SKS Gupta, L. Schwiebert, On tree-based convergecasting in
wireless sensor networks, Wireless Communications and Networking, 2003 IEEE,
vol. 3 pp. 1942–1947.
38. Hyang-Won Lee, Eytan Modiano, Long Bao Le. Distributed throughput maximization
in wireless networks via random power allocation, IEEE Transaction on Mobile
Computing 2012; 11: 577–590.
45
39. Hassan Artail, Khaleel Mersha. MDPF: Minimum distance packet forwarding for
search applications in mobile ad hoc networks, IEEE Transaction on Mobile
Computing 2009; 8: 412–1426.
40. Satyajayant Misra Seung Don Hong, Guoliang (Larry) Xue, Jian Tang. Constrained
relay node placement in wireless sensor networks: Formulation and
approximations, IEEE ACM Transaction on Network 2010; 18: 434–447.
41. Joohwan Kim, Xiaojun Lin, Ness B. Shroff, Prasun Sinha. Minimizing delay and
maximizing lifetime for wireless sensor networks with anycast, IEEE ACM
Transaction on Network 2010; 18: 515–528.
43. Yi Xu, Wenye Wang, Scheduling partition for order optimal capacity in large-scale
wireless networks, IEEE Transaction on Mobile Computing 2013; 12: 666–679. 44.
Jingnan Yao, Jiani Guo, Laxmi Narayan Bhuyan. Ordered round-robin: An efficient
sequence preserving packet scheduler, IEEE Transaction on Mobile Computing 2008;
57: 1690–1703.
45. Nam In Park, Jin Ah Kang, Seong Ro Lee, Hong Kook Kim. A packet loss
concealment technique improving quality of service for wideband speech coding
in wireless sensor networks, International Journal of Distributed Sensor Networks,
Hindawi 2014; Article ID 852798, 8 pages.
46. Celik, GD Zussman, G. Khan, WF Modiano, E. MAC for networks with multipacket
reception capability and spatially distributed nodes, IEEE Transaction on Mobile
Computing 2010; 9: 226-240.
47. Evy Troubleyn, Jeroen Hoebeke, Ingrid Moerman, Piet Demeester. Broadcast
aggregation to improve quality of service in wireless sensor networks,
International Journal of Distributed Sensor Networks 2014, Hindawi; Article ID
383678: 12 Pages.
48. Xiaoyan Yin, Xingshe Zhou, Rongsheng Huang, Yuguang Fang, Shining Li. A
fairness-aware congestion control scheme in wireless sensor networks, IEEE
Transactions on Vehicular Technology 2009; 58: 5225–5234.
46
49. Akbar Ghaffarpour, Fault tolerant broadcasting analysis in wireless monitoring
networks, Turkish Journal of Electrical Engineering & Computer Sciences, (2014)
22: 1437 – 1452.
50. Moosa Ayati, Mahdi Pasha-Zanousi, Fuzzy PSO-based algorithm for controlling
base station movements in a wireless sensor network, Turkish Journal of
Electrical Engineering & Computer Sciences.
51. Zeydin PALA and Nihat İNAN, The impact of disabling suspicious nodes
communications on network lifetime in wireless ad-hoc sensor networks, Turkish
Journal of Electrical Engineering & Computer Sciences, 2015.
53. Jiayu Gong, Zhong, X., Cheng- Zhong Xu. Maximizing rewards in wireless networks
with energy and timing constraints for periodic data streams, IEEE Transaction on
Mobile Computing 2010; 9: 1187–1200.
54. Kenan Xu, Hossam Hassanein, Glen Takahara, Quanhong Wang. Relay node
deployment strategies in heterogeneous wireless sensor networks, IEEE
Transaction on Mobile Computing 2010; 9: 145–159.
55. Zakhia Abichar, J. Morris Chang. A medium access control scheme for wireless
LANs with constant-time contention, IEEE Transaction on Mobile Computing
2011; 10: 191–204.
47
59. Rajaram, P and Prakasam, P, 'Data Collection using Mobile Robot in WSN: A
Review', Journal of Theoretical and Applied Information Technology, vol. 65, No.
2, 2014, pp. 437- 446.
60. P Sathyaprakash and P Prakasam, “Proposed Energy Efficient Multi Attribute Time
Slot Scheduling Algorithm for Quality of Service in Wireless Sensor Network”,
Wireless Personal Communications, Vol. 97, No. 4, 2017, pp. 5951-5968.