Well-designed wireless sensor networks (WSNs) usually provide vital support for collecting, processing, and forwarding the realtime information in mission-critical applications where medium access control (MAC) protocols determine the channel access control capabilities and the energy consumption properties of these networks. This paper models the MAC protocol of CSMA/CA using timed automata on the message communication and the energy harvesting and analyzes the protocol through model checking of the major CTL properties. The modeling and analysis of CSMA/CA protocol with the comparative experiments give some performance results and also reveal that timing error may cause deadlock, and the accessibility is satisfied if no deadlock exists.

Accurate and reliable routing protocols with Quality of Service (QoS) support determine the mission-critical application efficiency in WSNs. This paper proposes a model-checking design driven framework for designing the QoS-based routing protocols of WSNs, which involves the light-weight design process, the timed automata model, and the alternative QoS verification properties. The accurate feedback of continually model checking in the iterative design process effectively stimulates the parameter tuning of the protocols. We demonstrate the straightforward and modular characteristics of the proposed framework in designing a prototype QoS-based routing protocol. The prototype study shows that the model-checking design framework may complement other design methods and ensure the QoS implementation of the QoS-based routing protocol design for WSNs.

Aimed at the high dynamics and uncertainty of road traffic, we propose a method combine BDD (binary decision diagram)-Based heuristic algorithm which used to do the initial path planning with BDD-Based incremental to solve the route replanning problem. In order to get the optimal path set, BDD-Based heuristic Search is firstly used for global planning. BDD is a compact data structure, the BDD-Based heuristic Search use this characteristic to represent state space and compress the search space through heuristic information at the same time; when the road network information changes, incremental replanning was used in difference type of congestion and the optimum path set again. The simulation results show that the BDD-Based heuristic Search and incremental replanning method has high efficiency and practicability in solving vehicle routing problem under dynamic and uncertain environment.

Aims to the routing protocol of Bus Vehicle Network with the characteristics of cyclical movement, we put forward to the Signal-Single & Multi hop Routing (SSMHR) routing protocol, which can solve the problem of the signal attenuation on urban environment and uncertain next hop forwarding on multi-hop. Link Survival Mode considering the signal attenuation will be established in Single-hop to select encounter nodes as forwarding candidate set. Discrete Stochastic Dynamic Programming Delay Probability Model will be established in Multi-hop using the historical data of bus cyclical movement. The two models ensure the submitted data reliable in single-hop, and probability of successfully submitted to the target vehicle through multi-hop within a limited delay. According to the simulation test, SSMHR protocol has a higher successful rate of data transmission and lower submitted delays.

No abstract