English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 6507/11669
造訪人次 : 29728315      線上人數 : 550
RC Version 3.2 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜尋範圍 進階搜尋

請使用永久網址來引用或連結此文件: http://ir.ncue.edu.tw/ir/handle/987654321/15974

題名: Resolving Pass-Over Problem in Wireless Sensor Network
作者: Cheng, Rei-Heng;Wu, Tung-Kuang;Yu, Chang-Wu
貢獻者: 資訊管理學系
關鍵詞: Wireless sensor networks;Small world;Routing protocols;Power saving
日期: 2009-11
上傳時間: 2013-04-22T07:37:27Z
出版者: IEEE
摘要: In this work, we address the pass-over issue in wireless sensor network routing. Pass-over occurs when a query agent passes over an event agent even though the two lines cross each other, which may potentially prevent a query from finding the event. Even if the query and event
agents eventually meet, the number of hop count may add up as a result of that. We tackle the problem with a variation of the Small-World Routing protocol (SWRP). The SWRP finds paths between the queries and events through recurrent propagations of weak and strong links.
The operation of the protocol is simple and does not require much computational power. It turns out that by maximizing the number of weak link of the SWRP within a controlled area, we may be able to reduce the possibility of pass-over. In fact, according to our simulations the pass-over can be completely excluded from occurring. Accordingly, the proposed solution not only cut the number of hop-count, but also achieve better successful rate in finding a route between the query and event. The corresponding wireless sensor network with the proposed routing protocol is thus more power conservative and lasts longer.
關聯: 6th International Conference on Information Technology and Applications (ICITA 2009), : 234-238
顯示於類別:[資訊管理學系所] 會議論文

文件中的檔案:

檔案 大小格式瀏覽次數
index.html0KbHTML520檢視/開啟


在NCUEIR中所有的資料項目都受到原著作權保護.

 


DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 回饋