Staff View
ReInForM: Reliable Information Forwarding using Multiple Paths in Sensor Networks

Descriptive

Language
LanguageTerm (authority = ISO 639-3:2007); (type = text)
English
Genre (authority = RULIB-FS)
Other
Genre (authority = marcgt)
technical report
PhysicalDescription
InternetMediaType
application/pdf
Extent
1 online resource (9 pages)
Note (type = special display note)
Technical report DCS-TR-495
Name (authority = RutgersOrg-School); (type = corporate)
NamePart
School of Arts and Sciences (SAS) (New Brunswick)
Name (authority = RutgersOrg-Department); (type = corporate)
NamePart
Computer Science (New Brunswick)
TypeOfResource
Text
TitleInfo
Title
ReInForM: Reliable Information Forwarding using Multiple Paths in Sensor Networks
Abstract (type = abstract)
Sensor networks are meant for sensing and disseminating information about the environment they sense. The criticality of a sensed phenomenon determines it’s importance to the end user. Hence data dissemination in a sensor network should be information-aware. Such information-awareness is essential firstly to disseminate critical information more reliably and secondly to consume network resources proportional to criticality of information.
In this paper, we describe a protocol called ReInForM to support information awareness in sensor networks. Using ReInForM, data can be delivered at desired levels of reliability at proportional cost, in spite of the presence of significant channel errors. It uses the concept of dynamic packet state in context of sensor networks to control the number of paths required for the desired reliability using only local knowledge of channel error rates and does not require any prior computation or maintenance of these multiple paths. We also show that for uniform unit disk graphs, multiple edge-disjoint paths numbering as many as the average node degree, exist between any source and sink with very high probability. These paths exist in a thin band between source and sink having low deviation from the optimal path. ReInForm utilizes this property in its randomized forwarding mechanism which results in use of all possible paths in this band. Thus as a side effect ReInForM leads to load balancing as well.
Name (type = personal)
NamePart (type = family)
Deb
NamePart (type = given)
Budhaditya
Affiliation
Computer Science (New Brunswick)
Role
RoleTerm (authority = marcrt); (type = text)
author
Name (type = personal)
NamePart (type = family)
Bhatnagar
NamePart (type = given)
Sudeept
Affiliation
Computer Science (New Brunswick)
Role
RoleTerm (authority = marcrt); (type = text)
author
Name (type = personal)
NamePart (type = family)
Nath
NamePart (type = given)
Badri
Affiliation
Computer Science (New Brunswick)
Role
RoleTerm (authority = marcrt); (type = text)
author
OriginInfo
DateCreated (encoding = w3cdtf); (keyDate = yes); (qualifier = exact)
2003-10
RelatedItem (type = host)
TitleInfo
Title
Computer Science (New Brunswick)
Identifier (type = local)
rucore21032500001
Location
PhysicalLocation (authority = marcorg); (displayLabel = Rutgers, The State University of New Jersey)
NjNbRU
Identifier (type = doi)
doi:10.7282/t3-rjz6-8w59
Genre (authority = ExL-Esploro)
Technical Documentation
Back to the top

Rights

RightsDeclaration (AUTHORITY = rightsstatements.org); (TYPE = IN COPYRIGHT); (ID = http://rightsstatements.org/vocab/InC/1.0/)
This Item is protected by copyright and/or related rights.You are free to use this Item in any way that is permitted by the copyright and related rights legislation that applies to your use.For other uses you need to obtain permission from the rights-holder(s).
Copyright
Status
Copyright protected
Availability
Status
Open
Reason
Permission or license
Back to the top

Technical

RULTechMD (ID = TECHNICAL1)
ContentModel
Document
CreatingApplication
Version
1.4
ApplicationName
GPL Ghostscript 9.07
DateCreated (point = start); (encoding = w3cdtf); (qualifier = exact)
2018-06-06T12:31:40
DateCreated (point = start); (encoding = w3cdtf); (qualifier = exact)
2018-06-06T12:31:40
Back to the top
Version 8.3.13
Rutgers University Libraries - Copyright ©2020