ACM Home Page
Please provide us with feedback. Feedback
Using mobile relays to prolong the lifetime of wireless sensor networks
Full text PdfPdf (430 KB)
Source International Conference on Mobile Computing and Networking archive
Proceedings of the 11th annual international conference on Mobile computing and networking table of contents
Cologne, Germany
SESSION: Sensor networks table of contents
Pages: 270 - 283  
Year of Publication: 2005
ISBN:1-59593-020-5
Authors
Wei Wang  National University of Singapore, Singapore
Vikram Srinivasan  National University of Singapore, Singapore
Kee-Chaing Chua  National University of Singapore, Singapore
Sponsors
ACM: Association for Computing Machinery
SIGMOBILE: ACM Special Interest Group on Mobility of Systems, Users, Data and Computing
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 24,   Downloads (12 Months): 186,   Citation Count: 22
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1080829.1080858
What is a DOI?

ABSTRACT

In this paper we investigate the benefits of a heterogeneous architecture for wireless sensor networks composed of a few resource rich mobile nodes and a large number of simple static nodes. These mobile nodes can either act as mobile relays or mobile sinks. To investigate the performance of these two options and the trade-offs associated with these two options, we first consider a finite network. We then compute the lifetime for different routing algorithms for three cases (i) when the network is all static (ii) when there is one mobile sink and (iii) when there is one mobile relay. We find that using the mobile node as a sink results in the maximum improvement in lifetime. We contend however that in hostile terrains, it might not always be possible for the sink to be mobile. We then investigate the performance of a large dense network with one mobile relay and show that the improvement in network lifetime over an all static network is upper bounded by a factor of four. Also, the proof implies that the mobile relay needs to stay only within a two hop radius of the sink. We then construct a joint mobility and routing algorithm which comes close to the upper bound. However this algorithm requires all the nodes in the network to be aware of the location of the mobile node. We then proposed an alternative algorithm, which achieves the same performance, but requires only a limited number of nodes in the network to be aware of the location of the mobile. We finally compare the performance of the mobile relay and mobile sink and show that for a densely deployed sensor field of radius R hops, we require O(R) mobile relays to achieve the same performance as the mobile sink.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
W. Ye, J. Heidemann, and D. Estrin, "An energy-efficient MAC protocol for wireless sensor networks," in Proceedings of the 21st IEEE INFOCOM, Jun 2002.
 
3
J. H. Chang and L. Tassiulas, "Energy conserving routing in wireless ad-hoc networks," in Proceedings of the 19th IEEE INFOCOM , Mar 2000.
 
4
N. Sadagopan and B. Krishnamachari, "Maximizing data extraction in energy-limited sensor networks," in Proceedings of the 23rd IEEE INFOCOM, Mar 2004.
 
5
S. Gandham, M. Dawande, R. Prakash, and S. Venkatesan, "Energy-efficient schemes for wireless sensor networks with multiple mobile base stations," in Proceedings of IEEE GLOBECOM, Dec 2003.
 
6
 
7
J.Luo and J. P. Hubaux, "Joint mobility and routing for lifetime elongation in wireless sensor networks," in Proceedings of the 24th IEEE INFOCOM, Mar 2005.
 
8
R. Shah, S. Roy, S. Jain, and W. Brunette, "Data mules: Modeling a three-tier architecture for sparse sensor networks," in Proceedings of the IEEE Workshop on Sensor Network Protocols and Applications (SNPA), 2003.
 
9
A. Chakrabarti, A. Sabharwal, and B. Aazhang, "Using Predictable Observer Mobility for Power Efficient Design of Sensor Networks," in The second International Workshop on Information Processing in Sensor Networks (IPSN), Palo Alto, CA, April 2003.
10
11
 
12
A. Shankar and Z. Liu, "Maximum lifetime routing in wireless ad-hoc networks," in Proceedings of the 23rd IEEE INFOCOM, Mar 2004.
 
13
J. Chou, D. Petrovic, and K. Ramchandran, "A distributed and adaptive signal processing approach to reducing energy consumption in sensor networks," in Proceedings of the 22nd IEEE INFOCOM, Mar 2003.
 
14
 
15
O. Younis and S. Fahmy, "Distributed clustering in ad-hoc sensor networks: A hybrid, energy-efficient approach," in Proceedings of the 23rd IEEE INFOCOM, Mar 2004.
 
16
N. Li, J. Hou, and J. Sha, "Design and analysis of an MST-based topology control algorithm," in Proceedings of the 22nd IEEE INFOCOM, 2003.
17
 
18

CITED BY  22

Collaborative Colleagues:
Wei Wang: colleagues
Vikram Srinivasan: colleagues
Kee-Chaing Chua: colleagues