Position-based cluster routing protocol for mobile ad hoc networks

Authors:
Chao-Cheng Shih;Tzay-Farn Shih
Affiliations:
Department of Information Management, Shih Hsin University, Taipei, Taiwan, R. O. C.;Department of Electrical Engineering, National Taiwan University, Taipei, Taiwan, R. O. C.
Venue:
ICCOM'06 Proceedings of the 10th WSEAS international conference on Communications
Year:
2006

Citing 5
Cited 0

GeoCast—geographic addressing and routing

MobiCom '97 Proceedings of the 3rd annual ACM/IEEE international conference on Mobile computing and networking
A preservation-based multicast (RBM) routing protocol for mobile networks: initial route construction phase

Wireless Networks
Location-aided routing (LAR) in mobile ad hoc networks

MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
GPSR: greedy perimeter stateless routing for wireless networks

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Indoor geolocation science and technology

IEEE Communications Magazine

Quantified Score

Hi-index	0.00

Visualization

Abstract

Some of the proposed mobile ad hoc network routing algorithms require maintaining a global network state at each node. The global state is always an approximation of the current network state due to the non-negligible delay of propagating local state. The imprecision of global state information and the high storage and communication overhead make those algorithms do not scale well. In this paper, we propose a scalable loop-free cluster routing algorithm, which requires every node to maintain only its local state and uses physical location information to assist routing. In our protocol, the whole network is partitioned into several square clusters. In each cluster, we first use a cluster head selection algorithm to select a cluster head and then use a gateway selection algorithm to select gateways. After the construction of cluster heads and gateway nodes, it uses a distributed computation to collectively utilize the most up-to-date local state information to find multicast tree in a hop-by-hop basis. The performance of our algorithm was studied through extensive simulation. The simulation results reveal that our protocol has better performance than other algorithm.