Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/90873
Title: Throughput-Lifetime tradeoffs in multihop wireless networks under a realistic interference model
Authors: Luo, Jun.
Iyer, Aravind.
Rosenberg, Catherine.
Keywords: DRNTU::Engineering::Electrical and electronic engineering::Wireless communication systems
Issue Date: 2007
Source: Luo, J., Iyer, A. & Rosenberg, C. (2007). Throughput-Lifetime tradeoffs in multihop wireless networks under a realistic interference model. Allerton Conference (45th:2007:Urbana).
Conference: Allerton Conference (45th : 2007 : Urbana)
Abstract: Throughput and lifetime are both crucial design objectives for multihop wireless networks. In general, it is not sufficient to optimize either of them separately. As these two objectives are often conflicting with each other, we can only hope to identify the tradeoffs between them. This entails a harder problem than dealing with either solely. In this paper, we propose a general framework for investigating the tradeoff between throughput and lifetime. We employ a utility-based tradeoff objective that allows us to identify tradeoffs that are of physical interest. We consider a scheduled network where link transmissions can be coordinated to be conflict-free. We use a realistic interference model owing to which we gain a deep understanding of the network configurations that achieve the optimal tradeoffs. Our analytical and numerical results provide instructive insights into the interplay between the configurations and the throughput/lifetime.
URI: https://hdl.handle.net/10356/90873
http://hdl.handle.net/10220/6163
Schools: School of Computer Engineering 
Fulltext Permission: open
Fulltext Availability: With Fulltext
Appears in Collections:SCSE Conference Papers

Files in This Item:
File Description SizeFormat 
140294_1.pdf297.05 kBAdobe PDFThumbnail
View/Open

Page view(s) 5

981
Updated on Mar 28, 2024

Download(s) 5

602
Updated on Mar 28, 2024

Google ScholarTM

Check

Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.