Distributed Nodes Organization Algorithm for Channel Access in a Multihop Dynamic Radio Network
IEEE Transactions on Computers
Multicluster, mobile, multimedia radio network
Wireless Networks
Flooding for reliable multicast in multi-hop ad hoc networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
The broadcast storm problem in a mobile ad hoc network
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
The broadcast storm problem in a mobile ad hoc network
Wireless Networks - Selected Papers from Mobicom'99
Message-optimal connected dominating sets in mobile ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Flooding-based geocasting protocols for mobile ad hoc networks
Mobile Networks and Applications
Minimizing broadcast latency and redundancy in ad hoc networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
A near-optimal multicast scheme for mobile ad hoc networks using a hybrid genetic algorithm
Expert Systems with Applications: An International Journal
A systematic approach to new mobile service creation
Expert Systems with Applications: An International Journal
Expert Systems with Applications: An International Journal
Hi-index | 12.05 |
Resolving the broadcast storm problem is an important issue in mobile ad hoc networks (MANETs). In this paper, we propose an approach for constructing a virtual subnet whose nodes are logically related. The virtual subnet can be spread upon clusters of a MANET. An intelligent agent with a routing filtering table is proposed to assist the best known clustering algorithms, the original Least ID algorithm and the original Highest Connection Cluster (HCC) algorithm, to improve group communication efficiency. Our simulation covers the network factors of hop count, deprave rate, and delay time. The simulation results show that when the proposed intelligent agent is used with the HCC algorithm, the delay time was reduced by 81.84% as compared with flooding, and by 49.25% as compared with the Ad Hoc On-Demand Distance Vector (AODV) routing algorithm. The delay time for the Least ID algorithm assisted by the proposed agents reduced by 81.84% compared to that of flooding and by 50% compared to that of AODV.