Scheduled System Maintenance:
On Monday, April 27th, IEEE Xplore will undergo scheduled maintenance from 1:00 PM - 3:00 PM ET (17:00 - 19:00 UTC). No interruption in service is anticipated.
By Topic

MSTBBN: M-way Search Tree Based Base Station to Node Communication 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
$31 $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

3 Author(s)
Gupta, P. ; Dept. of E.C.E., Indian Inst. of Technol. Roorkee, Roorkee, India ; Bansal, T. ; Misra, M.

Inexpensive sensors capable of significant computation and wireless communication with limited energy resources are available. Once deployed, the small sensor nodes are usually inaccessible to the user, and thus replacement of the energy source is not feasible. Hence, energy efficiency is a key design issue that needs to be enhanced in order to improve the life span of network. Several network layer protocols like LEACH, BCDCP, and PEDAP have proved very useful and efficient for Node to Base Station (BS) communication. However, these centralized protocols have no explicit support for BS to Node communication. In some scenarios, BS to Node communication may be very frequent. In such cases trivial solution of flooding may prove to be a very costly solution. We introduce here M-way Search Tree Based Base station to Node communication protocol (MSTBBN) for Wireless Sensor Networks, which can be used to provide Base Station to Node communication. MSTBBN can be used with any of the centralized data-centric protocols (like LEACH-C) without any significant message overhead. Our solution provides efficient communication with time complexity of O(h) hops where h is the height of the BS-rooted tree constructed by the underlying routing protocol.

Published in:

Networks and Communications, 2009. NETCOM '09. First International Conference on

Date of Conference:

27-29 Dec. 2009