z-logo
open-access-imgOpen Access
Congestion Detection Strategies in Wireless Sensor Networks: A Comparative Study with Testbed Experiments
Author(s) -
Mohamed Amine Kafi,
Djamel Djenouri,
Jalel BenOthman,
Abdelraouf Ouadjaout,
Nadjib Badache
Publication year - 2014
Publication title -
procedia computer science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.334
H-Index - 76
ISSN - 1877-0509
DOI - 10.1016/j.procs.2014.08.026
Subject(s) - testbed , wireless sensor network , computer science , network congestion , real time computing , computer network , event (particle physics) , key distribution in wireless sensor networks , wireless , traffic congestion , distributed computing , wireless network , engineering , telecommunications , physics , quantum mechanics , network packet , transport engineering
Event based applications of Wireless Sensor Networks (WSNs) are prone to traffic congestion, where unpredicted event detection yields simultaneous generation of traffic at spatially co-related nodes, and its propagation towards the sink. This results in loss of information and waste energy. Early congestion detection is thus of high importance in such WSN applications to avoid the propagation of such a problem and to reduce its consequences. Different detection metrics are used in the congestion control literature. However, a comparative study that investigates the different metrics in real sensor motes environment is missing. This paper focuses on this issue and compares some detection metrics in a testbed network with MICAz motes. Results show the effectiveness of each method in different scenarios and concludes that the combination of buffer length and channel load constitute the better candidate for early and fictive detection

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom