Mobile agent based TDMA slot assignment algorithm for wireless sensor networks

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...

Full description

Saved in:
Bibliographic Details
Main Authors: Patro, R.K., Mohan, B.
Format: Conference Proceeding
Language:English
Subjects:
Access protocols
Broadcasting
Chemical technology
Job shop scheduling
Media Access Protocol
Mobile agents
Multiaccess communication
Network topology
Time division multiple access
Wireless sensor networks
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
DOI:10.1109/ITCC.2005.201