Please use this identifier to cite or link to this item:
Title: Energy efficient routing with mutual information accumulation
Authors: Girici, Tolga
Kazez, A. C.
Issue Date: 2012
Source: 2012 10th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, WiOpt 2012, 14 May 2012 through 18 May 2012, Paderborn, 92918
Abstract: We consider minimum-energy routing in a wireless network. We assume the use of ideal rateless codes, so that a node can accumulate transmission rates from the transmission of previous nodes on the routing path. Mutual information accumulation has significant advantages when compared with classical cooperative schemes that use energy accumulation. However, the resource allocation problem becomes more complex, as it involves the determination of 1) Routing path, 2) Transmission duration of each node, and 3) Transmission power of each node. We formulated the problem as an optimization problem, where the objective function is the total energy expenditure and the constraints are minimum mutual information for each node and the maximum total transmission time. We make a slotted-time assumption, and given the routing path and transmission duration, power optimization problem becomes convex. The optimal routing path and transmissions durations are found using a Branch-and-Bound technique. A distributively implementable greedy algorithm is also found and performance are compared by numerical simulations. © 2012 IFIP.
ISBN: 9783901882456
Appears in Collections:Elektrik ve Elektronik Mühendisliği Bölümü / Department of Electrical & Electronics Engineering
Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection

Show full item record

CORE Recommender

Page view(s)

checked on Dec 26, 2022

Google ScholarTM



Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.