淡江大學機構典藏:Item 987654321/59839
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 62830/95882 (66%)
Visitors : 4037085      Online Users : 604
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
    •  Adv. Search
    Home ‧ Login ‧ Upload ‧ Help ‧ About ‧ Administer Goto mobile version


    Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/59839


    Title: A Hierarchical Multiple-Choice Routing path Protocol for Wireless Sensor Networks
    Authors: Wang, Ying-Hong;Tsai, Chih-Hsiao;Mao, Hung-Jen
    Contributors: 淡江大學資訊工程學系
    Keywords: wireless sensor network;energy-efficient;hierarchical multiple-choice routing path;clustering protocol;data aggregation
    Date: 2008-01
    Issue Date: 2011-10-05 22:20:08 (UTC+8)
    Publisher: 臺北市：中央研究院資訊科學研究所
    Abstract: The wireless sensor networks (WSNs), a network comprising the huge number of sensor nodes, allow users to monitor a remote environment accurately by combining the data intelligently from the individual nodes. These networks require robust wireless communication protocols that are energy efficient and provide low latency. In this paper, we present a Hierarchical Multiple-Choice Routing Path Protocol (HMRP), a routing protocol for collecting data over multi-path, energy-balancing, and data aggregation to achieve good performance in terms of system lifetime and data delivery ratio. The design of the protocol aims to satisfy the requirements of sensor networks that every sensor transmits sensed data to the sink spontaneously. The sink constructs hierarchical tree by broadcasting its hop value to find the child nodes. Other nodes discover the child nodes in turn by the same way. The HMRP uses Candidates Information Table to avoid flooding and periodic updating of routing information. Moreover, the tree will automatically reconfigure according to nodes failure or adding the new nodes. The simulation results show that HMRP can increase the system lifetime by comparing with other general- purpose multi-hop clustering or tree-based approaches.
    Relation: Journal of Information Science and Engineering 24(1), pp.277-291
    Appears in Collections:[Graduate Institute & Department of Computer Science and Information Engineering] Journal Article

    Files in This Item:

    File SizeFormat
    index.html0KbHTML311View/Open

    All items in 機構典藏 are protected by copyright, with all rights reserved.

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - Feedback