File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Adaptive random re-routing for differentiated QoS in sensor networks

TitleAdaptive random re-routing for differentiated QoS in sensor networks
Authors
Keywordssensor networks
QoS routing
simulations
Issue Date2010
Citation
Computer Journal, 2010, v. 53, n. 7, p. 1052-1061 How to Cite?
AbstractSensor networks (SNs) consist of spatially distributed sensors which monitor an environment, and which are connected to some sinks or backbone system to which the sensor data is being forwarded. In many cases, the sensor nodes themselves can serve as intermediate nodes for data coming from other nodes, on the way to the sinks. Much of the traffic carried by SNs will originate from routine measurements or observations by sensors that monitor a particular situation, such as the temperature and humidity in a room or the infrared observation of the perimeter of a house, so that the volume of routine traffic resulting from such observations may be quite high. When important and unusual events occur, such as a sudden fire breaking out or the arrival of an intruder, it will be necessary to convey this new information very urgently through the network to a designated set of sink nodes where this information can be processed and dealt with. This paper addresses the important challenge by avoiding the routine background traffic from creating delays or bottlenecks that impede the rapid delivery of high priority traffic resulting from the unusual events. Specifically we propose a novel technique, the 'Randomized Re-Routing Algorithm (RRR)', which detects the presence of novel events in a distributed manner, and dynamically disperses the background traffic towards secondary paths in the network, while creating a 'fast track path' which provides better delay and better quality of service (QoS) for the high priority traffic which is carrying the new information. When the surge of new information has subsided, this is again detected by the nodes and the nodes progressively revert to best QoS or shortest-path routing for all the ongoing traffic. The proposed technique is evaluated using a mathematical model as well as simulations, and is also compared with a standard node by a node priority scheduling technique. © The Author 2009. Published by Oxford University Press on behalf of The British Computer Society. All rights reserved.
Persistent Identifierhttp://hdl.handle.net/10722/281400
ISSN
2023 Impact Factor: 1.5
2023 SCImago Journal Rankings: 0.520
ISI Accession Number ID

 

DC FieldValueLanguage
dc.contributor.authorGelenbe, Erol-
dc.contributor.authorNgai, Edith-
dc.date.accessioned2020-03-13T10:37:46Z-
dc.date.available2020-03-13T10:37:46Z-
dc.date.issued2010-
dc.identifier.citationComputer Journal, 2010, v. 53, n. 7, p. 1052-1061-
dc.identifier.issn0010-4620-
dc.identifier.urihttp://hdl.handle.net/10722/281400-
dc.description.abstractSensor networks (SNs) consist of spatially distributed sensors which monitor an environment, and which are connected to some sinks or backbone system to which the sensor data is being forwarded. In many cases, the sensor nodes themselves can serve as intermediate nodes for data coming from other nodes, on the way to the sinks. Much of the traffic carried by SNs will originate from routine measurements or observations by sensors that monitor a particular situation, such as the temperature and humidity in a room or the infrared observation of the perimeter of a house, so that the volume of routine traffic resulting from such observations may be quite high. When important and unusual events occur, such as a sudden fire breaking out or the arrival of an intruder, it will be necessary to convey this new information very urgently through the network to a designated set of sink nodes where this information can be processed and dealt with. This paper addresses the important challenge by avoiding the routine background traffic from creating delays or bottlenecks that impede the rapid delivery of high priority traffic resulting from the unusual events. Specifically we propose a novel technique, the 'Randomized Re-Routing Algorithm (RRR)', which detects the presence of novel events in a distributed manner, and dynamically disperses the background traffic towards secondary paths in the network, while creating a 'fast track path' which provides better delay and better quality of service (QoS) for the high priority traffic which is carrying the new information. When the surge of new information has subsided, this is again detected by the nodes and the nodes progressively revert to best QoS or shortest-path routing for all the ongoing traffic. The proposed technique is evaluated using a mathematical model as well as simulations, and is also compared with a standard node by a node priority scheduling technique. © The Author 2009. Published by Oxford University Press on behalf of The British Computer Society. All rights reserved.-
dc.languageeng-
dc.relation.ispartofComputer Journal-
dc.subjectsensor networks-
dc.subjectQoS routing-
dc.subjectsimulations-
dc.titleAdaptive random re-routing for differentiated QoS in sensor networks-
dc.typeArticle-
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1093/comjnl/bxp082-
dc.identifier.scopuseid_2-s2.0-77955667923-
dc.identifier.volume53-
dc.identifier.issue7-
dc.identifier.spage1052-
dc.identifier.epage1061-
dc.identifier.eissn1460-2067-
dc.identifier.isiWOS:000280704000013-
dc.identifier.issnl0010-4620-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats