Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
GeoCast—geographic addressing and routing
MobiCom '97 Proceedings of the 3rd annual ACM/IEEE international conference on Mobile computing and networking
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
Geocasting in Mobile Ad Hoc Networks: Location-Based Multicast Algorithms
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
An Adaptive Protocol for Reliable Multicast in Mobile Multi-hop Radio Networks
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Energy efficient multicasting problem in wireless ad-hoc networks
ICCOMP'06 Proceedings of the 10th WSEAS international conference on Computers
QoS issues in ad hoc wireless networks
IEEE Communications Magazine
Indoor geolocation science and technology
IEEE Communications Magazine
CEDAR: a core-extraction distributed ad hoc routing algorithm
IEEE Journal on Selected Areas in Communications
Distributed quality-of-service routing in ad hoc networks
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
Wireless network offers freedom moving around the effective transmission area and the flexibility and easy to use function for Internet application. Many applications of computer network involve multiple users that will rely on the ability of the network to provide multicast services. Thus, multicasting will be concerned as an essential part of Ad Hoc networks. Some of the proposed routing algorithms require maintaining a global network state at each node, the imprecision of global state and the large amount of storage and communication overhead induce poor scalability. In this paper, we propose a distributed cluster-based QoS multicast routing algorithm which only requires maintaining a local state at each node. The location information provided by positioning device is aided in route discovery and route maintenance procedure. Our protocol partitions the network into square clusters. In each cluster, a cluster head and gateways are selected by a cluster head selection algorithm and a gateway selection algorithm respectively. After the construction of cluster heads and gateway nodes, a distributed computation collectively utilizes the local state information to construct multicast tree in a hop-by-hop basis. Simulations are conducted to evaluate the performance of our algorithm. As it turns out, our protocol has better performance and lower routing overhead than the non-cluster based algorithm.