skip to main content
Visitante
Meu Espaço
Minha Conta
Sair
Identificação
This feature requires javascript
Tags
Revistas Eletrônicas (eJournals)
Livros Eletrônicos (eBooks)
Bases de Dados
Bibliotecas USP
Ajuda
Ajuda
Idioma:
Inglês
Espanhol
Português
This feature required javascript
This feature requires javascript
Primo Search
Busca Geral
Busca Geral
Acervo Físico
Acervo Físico
Produção Intelectual da USP
Produção USP
Search For:
Clear Search Box
Search in:
Busca Geral
Or select another collection:
Search in:
Busca Geral
Busca Avançada
Busca por Índices
This feature requires javascript
This feature requires javascript
Enhanced Power-Aware Routing for Mobile Ad Hoc Networks
Shin, Il-Hee ; Lee, Chae-Woo
Ad-Hoc, Mobile, and Wireless Networks, 2005, p.285-296
[Periódico revisado por pares]
Berlin, Heidelberg: Springer Berlin Heidelberg
Sem texto completo
Citações
Citado por
Serviços
Detalhes
Resenhas & Tags
Nº de Citações
This feature requires javascript
Enviar para
Adicionar ao Meu Espaço
Remover do Meu Espaço
E-mail (máximo 30 registros por vez)
Imprimir
Link permanente
Referência
EasyBib
EndNote
RefWorks
del.icio.us
Exportar RIS
Exportar BibTeX
This feature requires javascript
Título:
Enhanced Power-Aware Routing for Mobile Ad Hoc Networks
Autor:
Shin, Il-Hee
;
Lee, Chae-Woo
Assuntos:
Access methods and protocols, osi model
;
Applied sciences
;
Exact sciences and technology
;
Telecommunications
;
Telecommunications and information theory
;
Teleprocessing networks. Isdn
É parte de:
Ad-Hoc, Mobile, and Wireless Networks, 2005, p.285-296
Notas:
This work was supported by the grant No.R01-2003-000-10724-0 from Korea Science & Engineering Foundation.
Descrição:
The Route re-establishment methods that intend to extend the lifetime of the network attempt to find a new route periodically not to overly consume the energy of certain nodes. They outperform other algorithms in the network lifetime aspect, however, they require heavy signaling overheads because new routes are found based on the flooding method and route re-establishments occur frequently as a result. Because of the overhead they often can not extend the lifetime of the network as much as they want. In the paper, we propose a new maintenance algorithm which considers the costs associated with packet transmission and route re-establishment at the same time. Since the proposed algorithm considers packet transmission and future route re-establishment costs at the same time when it initially finds the route, it spends less energy to transmit the packets while evenly consuming the energy of the node as much as possible. Simulation results show that the proposed algorithm outperforms other route re-establishment methods.
Editor:
Berlin, Heidelberg: Springer Berlin Heidelberg
Idioma:
Inglês
Links
View record in Pascal Francis
This feature requires javascript
This feature requires javascript
Voltar para lista de resultados
Anterior
Resultado
6
Avançar
This feature requires javascript
This feature requires javascript
Buscando em bases de dados remotas. Favor aguardar.
Buscando por
em
scope:(USP_PRODUCAO),scope:(USP_EBOOKS),scope:("PRIMO"),scope:(USP),scope:(USP_EREVISTAS),scope:(USP_FISICO),primo_central_multiple_fe
Mostrar o que foi encontrado até o momento
This feature requires javascript
This feature requires javascript