Wyniki wyszukiwania - BazTech

Ograniczanie wyników

2 Journal of Telecommunications and Information Technology

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

Load-balanced route discovery for mobile ad hoc networks

Abolhasan M., Lipman J., Wysocki T. A.

Journal of Telecommunications and Information Technology

2006

nr 1

38-45

This paper presents flow-aware routing protocol (FARP), a new routing strategy designed to improve load balancing and scalability in mobile ad hoc networks. FARP is a hop-by-hop routing protocol, which introduces a flow-aware route discovery strategy to reduce the number of control overheads propagating through the network and distributes the flow of data through least congested nodes to balance the network traffic. FARP was implemented in GloMoSim and compared with AODV. To investigate the load distribution capability of FARP new performance metrics were introduced to measure the data packet flow distribution capability of the each routing protocol. The simulation results obtained illustrate that FARP achieves high levels of throughput, reduces the level of control overheads during route discovery and distributes the network load more evenly between nodes when compared to AODV. This paper also describes a number of alternative strategies and improvements for the FARP.

LPAR: an adaptive routing strategy for MANETs

Abolhasan M., Wysocki T. A., Dutkiewicz E.

Journal of Telecommunications and Information Technology

2003

nr 2

28-37

This paper presents a new global positioning system (GPS)-based routing protocol, called location-based point-to-point adaptive routing (LPAR) for mobile ad hoc networks. This protocol utilises a 3-state route discovery strategy in a point-to-point manner to reduce routing overhead while maximising throughput in medium to large mobile ad hoc networks. In LPAR, data transmission is adaptable to changing network conditions. This is achieved by using a primary and a secondary data forwarding strategy to transfer data from the source to the destination when the condition of the route is changed during data transmission. A simulation study is performed to compare the performance of LPAR with a number of different exisiting routing algorithms. Our results indicate that LPAR produces less overhead than other simulated routing strategies, while maintains high levels of throughput.