Joint sensor selection and data routing in sensor networks

Erçetin, Özgür and Gürbüz, Özgür and Bülbül, Kerem and Aksu, Aylin (2005) Joint sensor selection and data routing in sensor networks. Lecture notes in computer science, 3462 . pp. 828-839. ISSN 0302-9743 (Print) 1611-3349 (Online)

PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader

Official URL: http://dx.doi.org/10.1007/11422778_67


We propose a new joint sensor selection and routing algorithm, which selects a set of sensor nodes (sensing nodes) in a sensor network to take measurements, and determines a set of paths connecting the sensing nodes to the sink node. Our objective is to maximize the network lifetime, while satisfying the data precision required by the user. We first develop a multi-objective optimization model for this problem and design the near-optimal OPT-RE algorithm based on this model for network lifetime maximization. Next, we design a low complexity heuristic called SP-RE. SP-RE first labels the links between the nodes with a metric which trades off the residual energies of the transmitting and receiving nodes with the required transmission and reception energy. Then, SP-RE calculates the shortest paths from all nodes to the sink, and identifies the node which is closest to the sink as a sensing node. This process is repeated until the required data precision is satisfied. We demonstrate by simulations that SP-RE and OPT-RE can increase the network lifetime several orders of magnitude compared to naive approaches.

Item Type:Article
Additional Information:4th International IFIP-TC6 Networking Conference, Waterloo, Canada, May 2-6, 2005. Proceedings / Book: Networking 2005 / ISBN: 978-3-540-25809-4 7 Category: Sensor and Ad Hoc Networks
Subjects:Q Science > QA Mathematics > QA075 Electronic computers. Computer science
ID Code:638
Deposited By:Kerem Bülbül
Deposited On:14 Dec 2006 02:00
Last Modified:15 May 2009 10:44

Repository Staff Only: item control page