A parallel link state routing protocol for mobile ad-hoc networks

Authors:
Dong Yang;Hongke Zhang;Hongchao Wang;Bo Wang;Shuigen Yang
Affiliations:
Beijing Jiaotong University, Beijing, China;Beijing Jiaotong University, Beijing, China;Beijing Jiaotong University, Beijing, China;Beijing Jiaotong University, Beijing, China;Beijing Jiaotong University, Beijing, China
Venue:
MSN'07 Proceedings of the 3rd international conference on Mobile ad-hoc and sensor networks
Year:
2007

Citing 4
Cited 0

Designing efficient algorithms for parallel computers

Designing efficient algorithms for parallel computers
Parallel and distributed computation: numerical methods

Parallel and distributed computation: numerical methods
Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers

SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Parallel algorithms for solving aggregated shortest-path problems

Computers and Operations Research - Special issue on aggregation and disaggregation in operations research

Quantified Score

Hi-index	0.00

Visualization

Abstract

With the network size growing, routing protocols of mobile ad-hoc networks (MANET) face many challenges. The most critical issue is the lack of bandwidth and computation capability. This paper describes the Parallel Link State Routing protocol (PLSR) that is suitable for MANET. The key concept used in the protocol is that of graph decomposition. This technique substantially raises the rate of routing updating; meanwhile it reduces the message overload as compared with a classical flooding mechanism and some other link state routing protocols. In PLSR, the network is a two-levels topology, and many problems caused by "flat" multi-hoppings will disappear. Thus, the second optimization is achieved by sub-network that reduces the control messages. As a third optimization, the routing computation will be in several subnetworks simultaneity. Hence, comparing with current link state algorithms, the routing table of PLSR will be regenerated quickly as the network topology changes.