2009
DOI: 10.3390/s91008083
|View full text |Cite
|
Sign up to set email alerts
|

Efficient Aggregation of Multiple Classes of Information in Wireless Sensor Networks

Abstract: 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 … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
7
0

Year Published

2009
2009
2019
2019

Publication Types

Select...
6
3
1

Relationship

0
10

Authors

Journals

citations
Cited by 26 publications
(7 citation statements)
references
References 17 publications
0
7
0
Order By: Relevance
“…Several solutions have been proposed in the literature addressing these issues [ 24 ]. At the same time, considerable effort has been devoted to the design of energy efficient message delivery and data retrieval methods [ 25 ]. Theoretically, point-to-point systems are the most reliable because there is only one point of failure in the topology (the host).…”
Section: Discussionmentioning
confidence: 99%
“…Several solutions have been proposed in the literature addressing these issues [ 24 ]. At the same time, considerable effort has been devoted to the design of energy efficient message delivery and data retrieval methods [ 25 ]. Theoretically, point-to-point systems are the most reliable because there is only one point of failure in the topology (the host).…”
Section: Discussionmentioning
confidence: 99%
“…2) Value-based pricing: The value-based pricing can be also employed for the packet dropping strategy at the congested node as proposed in [155]. However, in this approach, the buyer sets the price instead of the seller.…”
Section: Congestion Managementmentioning
confidence: 99%
“…Well-known CBRP methods include LCA (Linked Clustered Algorithm) [17], LID (Lowest-ID) [9], LCC (Least Cluster Change) [18], MCC (Maximum Connectivity) [19], and RCC (Random Competition Clustering) [20]. These existing algorithms have clustering criteria for selecting cluster heads and are based on the minimum cluster overlap method in the formation of clusters [21,22]. These algorithms, however, cannot guarantee stability due to the ambiguity in the selection of cluster heads.…”
Section: Related Workmentioning
confidence: 99%