earticle

논문검색

An Evolving-Graph-Based Finite State Machine Model for Protocol Conformance Testing in MANETs

초록

영어

Dynamic network topology is one of the inherent features of Mobile Ad hoc Network (MANET). However, it may lead to unfeasible test sequences in the FSM-based active conformance testing, due to the topological distinction between testing sequences generation and its execution. In this paper, a formal model, named Evolving-Graph- based Finite State Machine (EGFSM), is proposed to help alleviate the impact of the dynamic network on conformance testing in MANETs. The evolving graph theory is first introduced to extend the Finite State Machine model to describe the dynamic behavior of the protocol with time-varying network topology. In the testing scenario with a predictable node movement pattern, test sequences adaptable to the dynamic topological changescan be generated on the basis of the EGFSM for the protocol under testing. A case study based on the AODV routing protocol is conducted, and promising experimental results show that it is a feasible way to test the protocols in MANETs using an EGFSM.

목차

Abstract
 1. Introduction
 2. Related Work
 3. FSM-Based Protocol Testing in MANETs
  3.2 FSM-Based Testing Model for AODV
 4. EGFSM Model
  4.1. Evolving Graph Theory
  4.2. Evolution of a FSM
  4.3. The EGFSM Model
  4.4. EGFSM-Based Test Sequence Generation
 5. A Case Study
 6. Conclusion
 Acknowledgments
 References

저자정보

  • Ting Shu School of Information Science and Technology, Zhejiang SCI-Tech University, Hangzhou 310018, China
  • Mangmang Gu School of Information Science and Technology, Zhejiang SCI-Tech University, Hangzhou 310018, China
  • Jinsong Xia School of Information Science and Technology, Zhejiang SCI-Tech University, Hangzhou 310018, China

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.