Please use this identifier to cite or link to this item:
|Title:||Selective cooperation based on link distance estimations in wireless ad-hoc networks||Authors:||Lim, T.L.
|Issue Date:||2006||Citation:||Lim, T.L.,Srivastava, V.,Motani, M. (2006). Selective cooperation based on link distance estimations in wireless ad-hoc networks. Proceedings - WoWMoM 2006: 2006 International Symposium on a World of Wireless, Mobile and Multimedia Networks 2006 : 391-397. ScholarBank@NUS Repository. https://doi.org/10.1109/WOWMOM.2006.100||Abstract:||In this paper, we present simulation-based studies of the performance and tradeoffs of cooperative communications in wireless ad-hoc networks. While cooperative schemes can potentially improve throughput performance, this improvement often comes at a price in terms of higher energy consumption and the involvement of additional nodes. As such, we contend that it is worthwhile to consider schemes that adapt to different link conditions such that cooperation is only invoked when necessary. We study these issues quantitatively by looking at the throughput and energy consumption of cooperative and non-cooperative schemes in a 3-node network. In particular, two different modes of cooperation, namely multihop routing and cooperative relaying, are considered. We aim to determine which modes of cooperation work well under a variety of link conditions and how their performances compare against direct transmissions. Our results are uniquely presented through vivid graphical representations, which facilitate visualization and easy comparison between the different transmission modes. © 2006 IEEE.||Source Title:||Proceedings - WoWMoM 2006: 2006 International Symposium on a World of Wireless, Mobile and Multimedia Networks||URI:||http://scholarbank.nus.edu.sg/handle/10635/71732||ISBN:||0769525938||DOI:||10.1109/WOWMOM.2006.100|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Apr 20, 2019
checked on Apr 21, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.