The Community for Technology Leaders
Green Image
Issue No. 01 - June (2013 vol. 1)
ISSN: 2168-6750
pp: 133-147
Ashraf E. Al-Fagih , Information and Computer Science Department, King Fahd University of Petroleum and Minerals, Dhahran, Saudi Arabia
Fadi M. Al-Turjman , School of Engineering, University of Guelph, Guelph, Canada
Waleed M. Alsalih , Department of Computer Science, King Saud University, Riyadh, Saudi Arabia
Hossam S. Hassanein , School of Computing, Queen's University, Kingston, Canada
The proliferation of wireless sensors has given rise to public sensing (PS) as a vibrant data-sharing model. This vision can be extended under the umbrella of the Internet of Things (IoT) to include versatile data sources within smart cities such as cell phones, radio frequency identification tags and sensors on roads, and buildings and living spaces. The facilitation of such a vision faces many challenges in terms of inter operability, resource management, and pricing. In this paper, we present a priced PS framework for IoT architectures. Our framework caters for service-based applications in smart cities where data is provided via a data cloud of multifarious data sources. We propose online heuristics for public data delivery in smart city settings. We also introduce a pricing utility function for data acquisition. Our pricing function considers resource limitations in terms of delay, capacity and lifetime on the data providers' side, as well as user's quality and trust requirements from the requesters' side. We present simulation results showing the efficiency of our scheme as compared with other wireless sensor and mobile ad-hoc schemes with respect to scalability, lifetime, delay, delivery ratio, and price.
Pricing, Network architecture, Intelligent sensors, Cities and towns, Wireless sensor networks, Mobile communication, Power system economics

A. E. Al-Fagih, F. M. Al-Turjman, W. M. Alsalih and H. S. Hassanein, "A Priced Public Sensing Framework for Heterogeneous IoT Architectures," in IEEE Transactions on Emerging Topics in Computing, vol. 1, no. 1, pp. 133-147, 2013.
793 ms
(Ver 3.3 (11022016))