HKUST Institutional Repository >
Electronic and Computer Engineering >
ECE Conference Papers >
Please use this identifier to cite or link to this item:
|Title: ||Channel-reuse for accumulative repetition message-forwarding on wireless ad-hoc networks|
|Authors: ||Lai, Kelvin K.|
Wong, Albert K. S.
Wireless ad-hoc networks
|Issue Date: ||Apr-2008 |
|Citation: ||IEEE Wireless Communications and Networking Conference (WCNC), Las Vagas, USA, 31 March-3 April 2008, p. 2301-2306|
|Abstract: ||Maximizing the rate of transmission over a network with fixed amount of power gives the most economic way to communicate in a network. This paper investigates accumulative repetition forwarding strategy in a wireless ad-hoc network using cooperative forwarding approaches that allow adaptive power allocation among nodes. We analyze the feasibility and performance gain of channel reuse over this network, where multiple transmit-and-receive pairs coexist simultaneously using the same channel. Under this framework, we present the jointly optimal power allocation and channel reuse solution. This solution can be computed in polynomial time and brings significant improvement in network performance.|
|Rights: ||© 2008 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.|
|Appears in Collections:||ECE Conference Papers|
Files in This Item:
All items in this Repository are protected by copyright, with all rights reserved.