A virtual subnet scheme on clustering algorithms for mobile ad hoc networks |
| |
| Authors: | Cheng-Feng Tai Tzu-Chiang Chiang Ting-Wei Hou |
| |
| Affiliation: | 1. Department of Insurance and Finance, National Taichung University of Science and Technology, Taichung 404, Taiwan, ROC;2. Department of Information Management, National Taichung University of Science and Technology, 129 Sec. 3, Sanmin Rd., Taichung 404, Taiwan, ROC;3. Department of Finance, National Chung Hsing University, Taichung 402, Taiwan, ROC;1. School of Computer Sciences and Technology, Harbin Institute of Technology (Shenzhen), Shenzhen, Guangdong 518055, China;2. Department of Computing, Mathematics and Physics, Western Norway University of Applied Sciences, Bergen 5063, Norway;3. Department of Electrical Engineering, National Dong Hwa University, Hualien 97401, Taiwan;4. Faculty of Software and Information Science, Iwate Prefectural University, Morioka 020-8550, Japan;5. Department of Computer Sciences, University of Illinois at Chicago, Chicago, IL 60607, USA |
| |
| Abstract: | 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. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
