By Topic

An integrated routing protocol for wireless sensor networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

6 Author(s)
Yong Liu ; Graduate Sch. & Univ. Center, City Univ. of New York, NY, USA ; Xuhui Hu ; Taekyoung Kwon ; Chunhui Zhu
more authors

Since the size of on-chip memory greatly affects the chip cost, sensors targeting at tiny size and low cost cannot afford large memory module. The process of efficiently routing the packets in networks containing memory constraint nodes is an interesting and challenging research topic. In this paper, we propose an integrated routing protocol for large-scale sensor networks consisting of both memory-constraint nodes and memory-sufficient nodes. In our design, a spanning-tree is first built to ensure that every node pair is connected through a tree route. Source nodes can directly use tree routes to deliver short or urgent messages; they can also choose to discover shortcuts through a reactive routing process. Intermediate nodes, depending on their memory conditions, either create routing entries to guide data forwarding, or simply relay all packets following tree routes. Simulations verify the feasibility of our protocol and show it a promising scheme empowering highly flexible network designs.

Published in:

Military Communications Conference, 2004. MILCOM 2004. 2004 IEEE  (Volume:3 )

Date of Conference:

31 Oct.-3 Nov. 2004