Afficher la notice abrégée

dc.creatorChang, J. H.en
dc.creatorTassiulas, L.en
dc.date.accessioned2015-11-23T10:24:26Z
dc.date.available2015-11-23T10:24:26Z
dc.date.issued2004
dc.identifier10.1109/TNET.2004.833122
dc.identifier.issn10636692
dc.identifier.urihttp://hdl.handle.net/11615/26556
dc.description.abstractA routing problem in static wireless ad hoc networks is considered as it arises in a rapidly deployed, sensor based, monitoring system known as the wireless sensor network. Information obtained by the monitoring nodes needs to be routed to a set of designated gateway nodes. In these networks, every node is capable of sensing, data processing, and communication, and operates on its limited amount of battery energy consumed mostly in transmission and reception at its radio transceiver. If we assume that the transmitter power level can be adjusted to use the minimum energy required to reach the intended next hop receiver then the energy consumption rate per unit information transmission depends on the choice of the next hop node, i.e., the routing decision. We formulate the routing problem as a linear programming problem, where the objective is to maximize the network lifetime, which is equivalent to the time until the network partition due to battery outage. Two different models are considered for the information-generation processes. One assumes constant rates and the other assumes an arbitrary process. A shortest cost path routing algorithm is proposed which uses link costs that reflect both the communication energy consumption rates and the residual energy levels at the two end nodes. The algorithm is amenable to distributed implementation. Simulation results with both information-generation process models show that the proposed algorithm can achieve network lifetime that is very close to the optimal network lifetime obtained by solving the linear programming problem. © 2004 IEEE.en
dc.sourceIEEE/ACM Transactions on Networkingen
dc.source.urihttp://www.scopus.com/inward/record.url?eid=2-s2.0-4644360171&partnerID=40&md5=78659efc57705b8e8d29be7d685a95b8
dc.subjectComputer simulationen
dc.subjectData communication systemsen
dc.subjectLinear programmingen
dc.subjectMathematical modelsen
dc.subjectRoutersen
dc.subjectSensor data fusionen
dc.subjectTelecommunication networksen
dc.subjectTransceiversen
dc.subjectEnergy sensitive routingen
dc.subjectPower aware routingen
dc.subjectWireless ad hoc networksen
dc.subjectWireless sensor networksen
dc.subjectWireless telecommunication systemsen
dc.titleMaximum lifetime routing in wireless sensor networksen
dc.typejournalArticleen


Fichier(s) constituant ce document

FichiersTailleFormatVue

Il n'y a pas de fichiers associés à ce document.

Ce document figure dans la(les) collection(s) suivante(s)

Afficher la notice abrégée