Efficient aggregation of multiple classes of information in wireless sensor networks.

Congestion in a Wireless Sensor Network (WSN) can lead to buffer overflow, resource waste and delay or loss of critical information from the sensors. In this paper, we propose the Priority-based Coverage-aware Congestion Control (PCC) algorithm which is distributed, priority-distinct, and fair. PCC provides higher priority to packets with event information in which the sink is more interested. PCC employs a queue scheduler that can selectively drop any packet in the queue. PCC gives fair chance to all sensors to send packets to the sink, irrespective of their specific locations, and therefore enhances the coverage fidelity of the WSN. Based on a detailed simulation analysis, we show that PCC can efficiently relieve congestion and significantly improve the system performance based on multiple metrics such as event throughput and coverage fidelity. We generalize PCC to address data collection in a WSN in which the sensor nodes have multiple sensing devices and can generate multiple types of information. We propose a Pricing System that can under congestion effectively collect different types of data generated by the sensor nodes according to values that are placed on different information by the sink. Simulation analysis show that our Pricing System can achieve higher event throughput for packets with higher priority and achieve fairness among different categories. Moreover, given a fixed system capacity, our proposed Pricing System can collect more information of the type valued by the sink.