By Topic

Mobile agent based TDMA slot assignment algorithm 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

2 Author(s)
R. K. Patro ; Res. & Technol. Group, Honeywell Technol. Solution Lab., Bangalore, India ; B. Mohan

In this paper we propose an on-line TDMA slot assignment/graph coloring algorithm for wireless sensor networks with the help of a mobile agent. It is known that graph coloring problem is NP-complete and several heuristics have been developed. Many of them are centralized algorithms and assume global knowledge of the network. We developed a mobile agent based slot assignment (MASA) algorithm in which a mobile agent moves from node to node and assigns a slot to nodes using two-hop neighborhood information. MASA is close to degree based lower bound (d + 1). It requires d + 1 number of colors or slightly more than d + 1 number of colors depending upon the topology, where d is the maximum nodal degree of the graph.

Published in:

International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II  (Volume:2 )

Date of Conference:

4-6 April 2005