The performance measurement of packet scheduling algorithm based on set covering problem

Abstract

All sensor node shares a single channel using a multiple access protocols named CSMA/CA mechanism. When a sensor node receives more than one packet at the same time, these packets are termed collided, even when they coincide only partially. A solution is scheduling the packets before sending. The scheduling algorithm named SCGA (Set Covering Problem with Greedy Algorithm) is therefore introduced to solve this problem. The NS-2 is used for SCGA evaluation the network performance in this paper. There are three performance metrics: packet collision rate, throughput and end-to-end delay, are compared with simple CSMA/CA mechanism on standard benchmarks. Even though, throughput from both mechanism are not difference significantly when they are compared with statistical method, but SCGA decreases packet collision rate and clearly decrease end-to-end delay better than simple CSMA/CA mechanism.