Research Article Peer Reviewed Open Access DOI Supported
Articles

A Graph-Theoretic Model for Energy-Aware Routing Optimization in MANETs Using Availability Zones

2016-01-03 Vol. 3 No. 1 (2016): Volume 03 Issue 1
Downloads

Keywords

Energy-aware routing MANET graph-theoretic model availability zones
Article Usage Statistics
Live Metrics
Abstract Views
208
File Views
91
PDF
0
HTML
0
Other
91
Total
299

Article Usage Chart

Abstract
208
File Views
91
PDF
0
HTML
0
Other
91
Total
299

Abstract

Mobile Ad Hoc Networks (MANETs) are characterized by dynamic topologies, limited energy resources, and distributed communication architectures, which pose significant challenges for efficient and reliable routing. Energy conservation remains a critical factor, as the premature depletion of nodes can severely compromise network connectivity and overall performance. This study presents a novel graph-theoretic model for energy-aware routing optimization in MANETs, leveraging the concept of availability zones to systematically manage node participation in packet forwarding. The model represents nodes as graph vertices with dynamic attributes including residual energy, operational availability, and connectivity status, while edges are weighted based on energy costs and availability probabilities. By integrating these factors into a multi-objective optimization framework, the routing algorithm selectively identifies paths that minimize cumulative energy consumption while ensuring robust connectivity, even under conditions of high mobility and node failure.
The proposed approach incorporates heuristic strategies inspired by combinatorial optimization and evolutionary computation, allowing stochastic exploration of alternative paths, which enhances network resilience and load balancing. Extensive simulations across diverse network sizes and mobility scenarios demonstrate significant improvements in key performance metrics, including a 23–27% reduction in total energy consumption, a 23% increase in network lifetime, and markedly lower energy variance among nodes. These results underscore the model’s ability to distribute traffic loads efficiently, prolong network operation, and maintain connectivity under dynamic conditions. Comparative analyses with classical shortest-path and greedy heuristics reveal that the availability-zone-based method consistently outperforms existing strategies in terms of energy efficiency, stability, and fault tolerance.
The findings have broad implications for industrial automation, wireless sensor networks, and robotics, where energy-aware decision-making is essential for continuous operation and reliable system performance. Additionally, the study highlights the relevance of cross-domain optimization principles, drawing parallels between software test-suite reduction methodologies and network routing, demonstrating that selective inclusion and probabilistic exploration can yield optimal resource utilization. This research establishes a comprehensive framework for future investigations into adaptive, energy-efficient routing in MANETs and provides a foundation for integrating predictive mobility models and real-time energy monitoring in next-generation network management systems.

Downloads

Download data is not yet available.

References

1. J. Black, E. Melachrinoudis, D. Kaeli, “Bi-criteria models for all-uses test suite reduction”, In: Proceedings of 26th International Conference on Software Engineering, IEEE Computer Society, Washington, DC, USA, pp. 106–115, 2004.

2. T. Y. Chen, and M. F. Lau, “A New Heuristic for Test Suite Reduction”, Information and Software Technology, Vol. 40, No. 5-6, pp. 347-354, 1998.

3. T. Y. Chen, M. Lau, “A new heuristic for test suite reduction”, Information and Software Technology, Vol. 40, No. 5-6, 347–354, 1998.

4. T. Y. Chen, M. Lau, “A simulation study on some heuristics for test suite reduction”, Information and Software Technology, Vol. 40, No. 13, pp. 777–787, 1998.

5. V. Chvatal, “A Greedy Heuristic for the Set-Covering Problem”, Mathematics Operations Research, Vol. 4, No. 3, pp. 233-235, August 1979.

6. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, “Introduction to Algorithms”, second ed. MIT Press, 2001.

7. D. Goldberg, “Genetic Algorithms in Search, Optimization and Machine Learning”, Addison-Wesley, 1989.

8. M. R. Garey, and D. S. Johnson, “Computers and Intractability: A Guide to the Theory of NP-Completeness”, Freeman and Company, 1979.

9. Dan Hao, Tao Xie, Lu Zhang, Xiaoyin Wang, Jiasu Sun, Hong Mei, “Test input reduction for result inspection to facilitate fault localization”, Automated Software Engineering, Vol. 17, No. 1, pp 5-31, 2010.

10. M. J. Harrold, R. Gupta, and M. L. Soffa, “A Methodology for Controlling the Size of a Test Suite”, ACM Trans. Software Eng. And Methodology, Vol. 2, No. 3, pp. 270-285, 1993.

11. M. J. Harrold, R. Gupta, M. L. Soffa, “A methodology for controlling the size of a test suite”, ACM Transactions on Software Engineering and Methodology, Vol. 2 No. 3, pp. 270–285, 1993.

12. D. Jeffrey, and N. Gupta, “Improving Fault Detection Capability by Selectively Retaining Test Cases During Test Suite Reduction”, IEEE Trans. on Software Engineering, Vol. 33, No. 2, pp. 108-123, 2007.

13. R. M. Karp, “Reducibility among Combinatorial Problems”, Complexity of Computer Computations, Plenum Press, pp. 85-103, 1972.

14. GUPTA R., “A reconfigurable LIW architecture and its compiler”, Tech. Rep. 87-3, Dept. Computer Science, Univ. Pittsburgh, Pittsburgh, Pa., 1987.

15. Ma X. Y., He Z. F., Sheng B. K., Ye C. Q., “A genetic algorithm for test-suite reduction”, In: Proc. the International Conference on Systems, Man and Cybernetics, pp. 133–139, 2005.

16. J. A. Jones, and M. J. Harrold, “Test-Suite Reduction and Prioritization for Modified Condition/Decision Coverage”, IEEE Trans. on Software Engineering, Vol. 29 No. 3, pp. 195-209, 2003.

17. N. Mansour, K. El-Fakih, “Simulated annealing and genetic algorithms for optimal regression testing”, Journal of Software Maintenance, Vol. 11, No. 1, pp. 19–34, 1999.

18. Dac-Nhuong Le, “GA and ACO Algorithms Applied to Optimizing Location of Controllers in Wireless Networks”, International Journal of Electrical and Computer Engineering (IJECE), Vol. 3, No. 2, pp. 221-229, 2013.

19. J. W. Lin, and C. Y. Huang, “Analysis of Test Suite Reduction with Enhanced Tie-Breaking Techniques”, Information and Software Technology, Vol. 51, No. 4, pp. 679-690, 2009.

20. Chu-Ti Lin, Kai-Wei Tang, Cheng-Ding Chen, and Gregory M. Kapfhammer, “Reducing the Cost of Regression Testing by Identifying Irreplaceable Test Cases”, In Proc. Of the 6th ICGEC ’12.

21. S. K. Mohapatra, S. Prasad, “Minimizing Test Cases to Reduce the Cost of Regression Testing”, Proceedings of the 8th INDIACom, 2014.

22. S. K. Mohapatra, S. Prasad, “Evolutionary search algorithm for Test Case Prioritization“, 2013 International Conference on Machine Intelligence Research and Advancement.

23. S. K. Mohapatra, S. Prasad, B. P. Kar, ”Test Suit Reduction By Finding Cost Optimal Representative Set”, International Journal of Advanced Technology & Engineering Research (IJATER), Vol. 4, No. 3, 2014.

24. M. Jafari, Hassan Khotanlou, “A Routing Algorithm Based on Ant Colony, Local Search and Fuzzy Inference to Improve Energy Consumption in Wireless Sensor Networks”, International Journal of Electrical and Computer Engineering (IJECE), Vol. 3, No. 5, pp. 640-650, 2013.

25. Gum A. R., and Soffa M. L., “Compile-time techniques for improving scalar access performance in parallel memories”, IEEE Trans. Parallel and Distributed Systems 2, pp. 138-148, 1991.

26. S. Yoo, and M. Harman, “Regression Testing Minimization, Selection and Prioritization: a Survey”, Software Testing, Verification and Reliability, Vol. 22, No. 2, 2012.

27. H. Zhong, L. Zhang, and H. Mei, “An Experimental Study of Four Typical Test Suite Reduction Techniques”, Information and Software Technology, Vol. 50, No. 6, pp. 534-546, 2008.

28. Y. Zhang, J. Liu, Y. Cui, X. Hei, ”An improved quantum genetic algorithm for test suite reduction“, IEEE International Conference on Computer Science and Automation Engineering (CSAE), 2011.

Most read articles by the same author(s)

Similar Articles

1-10 of 108
Author Info
Submit Paper