Journal of Applied Science and Engineering

Published by Tamkang University Press

1.30

Impact Factor

1.60

CiteScore

Pi-Rong Sheu This email address is being protected from spambots. You need JavaScript enabled to view it.1 and Chia-Wei Wang1

1Department of Electrical Engineering, National Yunlin University of Science & Technology, Touliu, Yunlin 640, Taiwan, R.O.C.


 

Received: July 2, 2005
Accepted: November 29, 2005
Publication Date: September 1, 2006

Download Citation: ||https://doi.org/10.6180/jase.2006.9.3.06  


ABSTRACT


Recently, extensive research efforts have been devoted to the design of clustering algorithms to organize all the hosts in a mobile ad hoc network into a clustering architecture. However, due to the dynamic nature of the mobile hosts, their association with and dissociation from clusters disturb the stability of the network, making reconfiguration of cluster heads unavoidable. Re-computation of cluster heads and frequent information exchange among the participating hosts will suffer high computation overheads. Therefore, it is obvious that a more stable clustering architecture will directly lead to the performance improvement of the whole network. In this paper, we will propose an efficient clustering algorithm that can establish a stable clustering architecture by keeping a host with weak battery power from being elected as a cluster head. Computer simulations show that the clustering architectures generated by our clustering algorithm are more stable than those generated by other clustering algorithms.


Keywords: Ad Hoc Network, Battery Power, Clustering Algorithm, Clustering Architecture


REFERENCES


  1. [1] Murthy, C. S. R. and Manoj, B. S., Ad Hoc Wireless Networks: Architectures and Protocols, Prentice Hall (2004).
  2. [2] Iwata, A., Chiang, C. C., Pei, G., Gerla, M. and Chen, T. W., “Scalable Routing Strategies for Ad hoc Wireless Networks,” IEEE J. Select. Areas Commun., Vol. 17, pp. 13691379 (1999).
  3. [3] Krishna, P., Vaidya, N., Chatterjee, M. and Pradhan, D., “A Cluster-Based Approach for Routing in Dynamic Networks,” ACM SIGCOMM Computer Commnications Review, Vol. 27, pp. 4964 (1997).
  4. [4] McDonald, B. and Znati, T. F., “A Mobility-Based Framework for Adaptive Clustering in Wireless Ad hoc Networks,” IEEE J. Select. Areas Commun., Vol. 17, pp. 14661487 (1999).
  5. [5] Ramanathan, R. and Steenstrup, M., “Hierarchically-Organized, Multihop Mobile Wireless Networks for Quality-of-Service Support,” ACM/Baltzer Mobile Networks and Applications, Vol. 3, pp. 101 119 (1998).
  6. [6] Gerla, M. and Tsai, J., “Multicluster, Mobile, Multimedia Radio Network,” ACM/Baltzer Journal of Wireless Networks, Vol. 1, pp. 225238 (1995).
  7. [7] Lin, C. R. and Gerla, M., “Adaptive Clustering for Mobile Wireless Networks,” IEEE J. Select. Areas Commun., Vol. 15, No. 7, pp. 12651275 (1997).
  8. [8] Basagni, S., “Distributed Clustering for Ad hoc Networks,” Proceedings of IEEE I-SPAN, pp. 310315 (1999).
  9. [9] Basagni, S., “Distributed and Mobility-Adaptive Clustering for Multimedia Support in Multi-Hop Wireless Networks”, Proceedings of the IEEE Vehicular Technology Conference (VTC) 1999, Amsterdam, The Netherlands (1999).
  10. [10] Basagni, S., “Distributed and Mobility-Adaptive Clustering for Ad hoc Networks,” Erik Jonsson School of Engineering and Computer Science, The University of Texas at Dallas, Tech. Rep. UTD/EE-02-98 (1998).
  11. [11] Hou, T. C. and Tsai, T. J., “An Access-Based Clustering Protocol for Multihop Wireless Ad hoc Networks,” IEEE J. Select. Areas Commun., Vol. 19. pp. 12011210 (2001).
  12. [12] Agarwal, S., Ahuja, A., Singh, J. P. and Shorey, R., “Route-Lifetime Assessment Based Routing (RABR) Protocol for Mobile Ad hoc Networks,” Proceedings of IEEE ICC 2000, Vol. 3, pp. 16971701 (2000).
  13. [13] Dube, R., Rais, C. D., Wang, K. Y. and Tripathi, S. K., “Signal Stability-Based Adaptive Routing (SSA) for Ad hoc Mobile Networks,” IEEE Personal Communications Magazine, Vol. 4, pp. 3645 (1997).
  14. [14] Paul, K., Bandyopadhyay, S., Mukherjee, A. and Saha, D., “Communication-Aware Mobile Hosts in Ad hoc Wireless Network,” IEEE International Conference on Personal Wireless Communication, pp. 8387 (1999).
  15. [15] Tien, T. C. and Upadhyaya, S. J., “A Local/Global Strategy Based on Signal Strength for Message Routing in Wireless Mobile Ad hoc Networks,” Proceedings of IEEE Academia/Industry Working Conference on Research Challenges, pp. 227232 (2000).
  16. [16] Singh, S., Woo, M. and Raghavendra, C., “PowerAware Routing in Mobile Ad hoc Networks,” Proceedings of the Fourth Annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom98), pp. 181190 (1998).
  17. [17] Toh, C. K., “Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad hoc Networks, ” IEEE Communications Magazine, Vol. 39, pp. 138147 (2001).
  18. [18] Tragoudas, S. and Dimitrova, S., “Routing with Energy Considerations in Mobile Ad hoc Networks,” IEEE Wireless Communications and Networking Conference (WCNC 2000), Vol. 3, pp.1258126 (2000).
  19. [19] Sivakumar, R., Sinha, P. and Bhagravan, V., “CEDAR: A Core Extraction Distributed Ad hoc Routing Algorithm,” IEEE J. Select. Areas Commun. Vol. 17, pp. 14541465 (1999).
  20. [20] Chen, G., Nocetti, F. G., Gonzalez, J. S. and Stojmenovic, I., “Connectivity Based K-hop Clustering in Wireless Networks,” Proceedings of the 35th Hawaii International Conference on System Science (2002).


    



 

1.6
2022CiteScore
 
 
60th percentile
Powered by  Scopus

SCImago Journal & Country Rank

Enter your name and email below to receive latest published articles in Journal of Applied Science and Engineering.