File Download
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/ISPACS.2005.1595512
- Scopus: eid_2-s2.0-33847240525
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: Along & Across algorithm for routing events and queries in wireless sensor networks
| Title | Along & Across algorithm for routing events and queries in wireless sensor networks |
|---|---|
| Authors | |
| Issue Date | 2005 |
| Publisher | IEEE. |
| Citation | 2005 International Symposium on Intelligent Signal Processing and Communication Systems (ISPACS 2005), Hong Kong, 13-16 December 2005. In 2005 International Symposium on Intelligent Signal Processing and Communication Systems, 2005, p. 725-728 How to Cite? |
| Abstract | In this paper, we investigate efficient strategies for routing events and queries in a wireless sensor network where energy is a major concern. Our along & across algorithm makes use of a hop tree structure. Event attributes are routed along hop levels while queries are routed across hop levels to seek for match. Location information is not assumed. Simulation results show that our algorithm yields much higher hitting probability between event attributes and queries than a previously proposed algorithm, rumor routing algorithm in a moderate-traffic environment. As a result, our algorithm consumes up to 72.6% less transmission overhead. As such, our along & across algorithm is sound and should be very useful to wireless sensor network developers. |
| Persistent Identifier | http://hdl.handle.net/10722/54042 |
| ISBN |
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Chim, TW | en_HK |
| dc.date.accessioned | 2009-04-03T07:35:16Z | - |
| dc.date.available | 2009-04-03T07:35:16Z | - |
| dc.date.issued | 2005 | en_HK |
| dc.identifier.citation | 2005 International Symposium on Intelligent Signal Processing and Communication Systems (ISPACS 2005), Hong Kong, 13-16 December 2005. In 2005 International Symposium on Intelligent Signal Processing and Communication Systems, 2005, p. 725-728 | en_HK |
| dc.identifier.isbn | 0-7803-9266-3 | - |
| dc.identifier.uri | http://hdl.handle.net/10722/54042 | - |
| dc.description.abstract | In this paper, we investigate efficient strategies for routing events and queries in a wireless sensor network where energy is a major concern. Our along & across algorithm makes use of a hop tree structure. Event attributes are routed along hop levels while queries are routed across hop levels to seek for match. Location information is not assumed. Simulation results show that our algorithm yields much higher hitting probability between event attributes and queries than a previously proposed algorithm, rumor routing algorithm in a moderate-traffic environment. As a result, our algorithm consumes up to 72.6% less transmission overhead. As such, our along & across algorithm is sound and should be very useful to wireless sensor network developers. | - |
| dc.language | eng | en_HK |
| dc.publisher | IEEE. | en_HK |
| dc.relation.ispartof | 2005 International Symposium on Intelligent Signal Processing and Communication Systems | - |
| dc.rights | ©2005 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. | - |
| dc.title | Along & Across algorithm for routing events and queries in wireless sensor networks | en_HK |
| dc.type | Conference_Paper | en_HK |
| dc.identifier.email | Chim, TW: twchim@eee.hku.hk | en_HK |
| dc.description.nature | published_or_final_version | en_HK |
| dc.identifier.doi | 10.1109/ISPACS.2005.1595512 | - |
| dc.identifier.scopus | eid_2-s2.0-33847240525 | - |