Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2012, Article ID 324245, 17 pages
Research Article

Optimal Incentive Pricing on Relaying Services for Maximizing Connection Availability in Multihop Cellular Networks

Department of Information Technology and Management, Shih Chien University, No. 70, Ta-Chih Street, Taipei 10462, Taiwan

Received 16 September 2011; Accepted 12 October 2011

Academic Editor: Yi-Chung Hu

Copyright © 2012 Ming-Hua Lin and Hao-Jan Hsu. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


This paper investigates an incentive pricing problem for relaying services in multihop cellular networks. Providing incentives to encourage mobile nodes to relay data is a critical factor in building successful multihop cellular networks. Most existing approaches adopt fixed-rate or location-based pricing on rewarding packets forwarding. This study applies a mathematical programming model to determine an optimal incentive price for each intermediate node that provides relaying services. Under the obtained incentive price, the connection availability of the networks is maximized by using the same relaying costs as other pricing schemes. A signomial geometric programming problem is constructed, and a deterministic optimization approach is employed to solve the problem. Besides, quality-of-service constraints are added in the proposed model to mitigate the unfairness between connection availabilities of individual nodes. Computational results demonstrate that the proposed model obtains the optimal incentive price on relaying services to maximize connection availability of the networks.