An algorithm on fairness verification of mobile sink routing in wireless sensor network

Authors:
Guangquan Xu;Weisheng Li;Rui Xu;Yingyuan Xiao;Honghao Gao;Xiaohong Li;Zhiyong Feng;Jia Mei
Affiliations:
Institute of Knowledge Science and Engineering, School of Computer Science and Technology, Tianjin University, Tianjin, People's Republic of China 300072;College of Computer Science and Technology, Chongqing University of Posts and Telecommunications, Chongqing, People's Republic of China;Institute of Knowledge Science and Engineering, School of Computer Science and Technology, Tianjin University, Tianjin, People's Republic of China 300072;Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology, Tianjin University of Technology, Tianjin, People's Republic of China;Shanghai Key Laboratory of Computer Software Evaluating and Testing, Shanghai University, Shanghai, People's Republic of China 201112;Institute of Knowledge Science and Engineering, School of Computer Science and Technology, Tianjin University, Tianjin, People's Republic of China 300072;Institute of Knowledge Science and Engineering, School of Computer Science and Technology, Tianjin University, Tianjin, People's Republic of China 300072;Guangxi Economic Management Cadre College, Guangxi, People's Republic of China
Venue:
Personal and Ubiquitous Computing
Year:
2013

Citing 18
Cited 0

Survey of fairness notions

Information and Software Technology
Symbolic Model Checking

Symbolic Model Checking
A two-tier data dissemination model for large-scale wireless sensor networks

Proceedings of the 8th annual international conference on Mobile computing and networking
Faster Algorithms for the Nonemptiness of Streett Automata and for Communication Protocol Pruning

SWAT '96 Proceedings of the 5th Scandinavian Workshop on Algorithm Theory
Impartiality, Justice and Fairness: The Ethics of Concurrent Termination

Proceedings of the 8th Colloquium on Automata, Languages and Programming
SAT Based Abstraction-Refinement Using ILP and Machine Learning Techniques

CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Congestion control and fairness for many-to-one routing in sensor networks

SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
Model Checking with Strong Fairness

Formal Methods in System Design
Localized algorithm for aggregate fairness in wireless sensor networks

Proceedings of the 12th annual international conference on Mobile computing and networking
Coordinate Magnetic Routing for Mobile Sinks Wireless Sensor Networks

AINAW '07 Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 01
Spin model checker, the: primer and reference manual

Spin model checker, the: primer and reference manual
An efficient scheme of target classification and information fusion in wireless sensor networks

Personal and Ubiquitous Computing
Adaptive listen for energy-efficient medium access control in wireless sensor networks

Multimedia Tools and Applications
A routing scheme of mobile sink in sensor networks

ICCSA'07 Proceedings of the 2007 international conference on Computational science and Its applications - Volume Part II
RiSeG: a ring based secure group communication protocol for resource-constrained wireless sensor networks

Personal and Ubiquitous Computing
A note on on-the-fly verification algorithms

TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
An intelligent agent-based routing structure for mobile sinks in WSNs

IEEE Transactions on Consumer Electronics
Coping With Strong Fairness

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

Congestion and starvation will occur among some nodes due to the emerging serious unfairness, which is derived from the limited communication capabilities of all nodes and sink or in the case of a mobile sink moving to a new place. The problem to be solved is to balance the network and keep the fairness for all nodes. For this purpose, this paper focuses on verifying the fairness of mobile sink routing based on both state and action, which is realized mainly by composing Labeled Kripke Transition Systems (LKTS). First, an approach is presented by LKTS to model node behaviors. Second, a notion of Fair Computational Tree Logic (CTL) is introduced to describe the fairness formulae in branching time transitions, and four kinds of fairness assumptions are defined for fairness verification. Moreover, in order to avoid the problem of state-space explosion, Bounded model Checking to explore states and transitions on-the-fly until a witness is found, while Strong Connected Components algorithm is used to pick up fair paths under fairness constraints of Fair CTL. The experimental results show the superiority of our method by the savings in memory and time consumptions during the mobile sink routing process.