Abstract

This paper presents a nurumum hop routing algorithm for the multihop cellular CDMA network. A mechanism to update routing paths in case of network topology change is also developed. Mobile terminals will be separated into two groups and each group will only transmit on one of two timeslots so that terminals do not have to transmit and receive simultaneously on the same frequency band. The routing algorithm in this paper is designed in order to optimize criteria including SNIR, delay, power consumption, and network lifetime. Simulation is used to evaluate these criteria for the multihop cellular network and its performance is compared with the traditional cellular network. Simulations show that the total power consumption in the multihop cellular network is much lower than a traditional cellular network with a capacity that is nearly as high. Simulations also show that the network lifetime of the multihop cellular network is much higher than that of a traditional cellular network.

Highlights

  • This paper presents a nurumum hop routing algorithm for the multihop cellular CDMA network

  • All transmissions in the multihop cellular network were made within timeslots and the base station was used to relay all packets to their destination

  • It was shown in this paper that when using minimum hop routing, a much lower power consumption can be obtained for the multihop cellular network than for a traditional single hop cellular network

Read more

Summary

A MINIMUM HOP ROUTING ALGORITHM FOR MULTIHOP

Abstract - This paper presents a nurumum hop routing algorithm for the multihop cellular CDMA network. The routing algorithm in this paper is designed in order to optimize criteria including SNIR, delay, power consumption, and network lifetime. Simulations show that the total power consumption in the multihop cellular network is much lower than a traditional cellular network with a capacity that is nearly as high. Resumo - Este artigo apresenta urn protocolo de roteamento para redes multihop celulares CDMA com nmero mnimo de saltos. As resultados mostram que a potncia total consumida em uma rede multihop celular muito menor que em uma rede celular tradicional, ambas com capacidades prximas. As resultados tambm mostram que 0 tempo de vida de uma rede multihop celular muito maior do que aquele de uma rede celular tradicional. Palavras-chave: Redes celulares multihop, algoritmos de roteamento, redes ad hoc

INTRODUCTION
MULTIHOP CELLULAR NETWORK MODEL
TRANSMISSIONS IN TIMESLOTS
ROUTING PATH DETERMINATION
MULTIHOP CELLULAR ROUTE DETERMINATION ALGORITHM
ROUTE DETERMINATION ALGORITHM BASED ON ALOHA
ROUTE DETERMINATION ALGORITHM EXAMPLE
ROUTING PATH UPDATES
CHECKING FOR A BROKEN LINK
ROUTE UPDATE ALGORITHM EXAMPLE
SIMULATION RESLILTS
POWER CONSUMPTION
NETWORK LIFETIME
Findings
SUMMARY AND CONCLUSIONS
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call