Please use this identifier to cite or link to this item:
|Title:||Highly scalable and efficient publish/subscribe protocols using geographic information for wireless sensor networks|
Wireless sensor networks
Wireless telecommunication systems
|Source:||ISSNIP 2007 : 3rd International Conference on Intelligent Sensors, Sensor Networks and Information Processing : 3-6 December 2007, Melbourne, Australia, p. 503-508.|
|Abstract:||Publish/Subscribe (Pub/Sub) systems have been used in traditional distributed computing applications to provide effective and efficient event services. Recently, the design of Pub/Sub systems are proposed for wireless sensor networks (WSNs). Some of the proposed Pub/Sub protocols address the issue of establishing event delivery path with low routing cost by using geographic information. However, they have not considered how to reduce redundant event delivery, which may cause high resource consumption and poor system scalability. In this paper, we propose protocols which address both issues. More specifically, our protocols use geographic information to save routing cost, and meanwhile reduce redundant event delivery by letting the subscribers share the event delivery paths. Three highly scalable and efficient Pub/Sub protocols for WSNs, namely Shortest Delivery Path (SDP), Shortest Delivery Path with Lower Delivery Overhead (SDP-LDO), and Lowest Delivery Overhead (LDO), are designed to achieve different performance goals. The results of theoretical and experimental evaluation show that the proposed protocols can significant improve the resource efficiency and scalability of a Pub/Sub system compared to the previous solutions. Our protocols can also be used to achieve a good tradeoff between the costs of event subscribing and event delivery.|
|Rights:||© 2007 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:||COMP Conference Papers & Presentations|
All items in the PolyU Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated. No item in the PolyU IR may be reproduced for commercial or resale purposes.