|Communications on Applied Electronics|
|Foundation of Computer Science (FCS), NY, USA|
|Volume 7 - Number 2|
|Year of Publication: 2017|
|Authors: Khanh Le, Thanh Cao, Phuc Le, Bao Pham, Thang Bui, Tho Quan|
Khanh Le, Thanh Cao, Phuc Le, Bao Pham, Thang Bui, Tho Quan . Probabilistic Congestion of Wireless Sensor Networks: a Coloured Petri Net based Approach. Communications on Applied Electronics. 7, 2 ( May 2017), 1-7. DOI=10.5120/cae2017652602
Analysing probability properties on Coloured Petri Nets (CPNs) model is one of a favorite topic on system verification recently. This paper focuses on verifying congestion probability on Wireless Sensor Networks (WSNs) which is modelled by CPN. Actually, WSNs are the collection of sensors. A WSN topology is formed by the interaction among sensors via Wi-Fi connections. However, sensors can be consider as unsteady devices when working in the harsh environment due to limited processing capacity, non-replacement battery, etc. Hence, each sensor needs to attach a reliable probability so that users can know the probability of reaching the sink of data. Such probabilities are added into the transitions in our CPN probability model before checking congestion. Whole verifying process introduces also in order to emphasize the purpose of this paper via a straight example.