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!
cited_by
cites
container_end_page 667 Vol. 2
container_issue
container_start_page 663
container_title
container_volume 2
creator Patro, R.K.
Mohan, B.
description 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_str_mv 10.1109/ITCC.2005.201
format conference_proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_1425220</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>1425220</ieee_id><sourcerecordid>1425220</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-2c7739e0e0755df6c8bfd971d8cd7bcb02aa08b80b42bd57993ccbd334f8ef283</originalsourceid><addsrcrecordid>eNotjEtLxDAUhQMiqOMsXbnJH-h4kzRNshzqa2BGN3U95HFbo31IUhj891b0LM7H4YNDyA2DDWNg7nZNXW84gFyKnZErUJWRXDApLsg65w9YIkxpKrgkL4fJxR6p7XCcqbMZA23uD1ua-2mmNufYjcOvsn03pTi_D7SdEj3FhD3mTDOOedkjzqcpfeZrct7aPuP6nyvy9vjQ1M_F_vVpV2_3RWRKzgX3SgmDgKCkDG3ltWuDUSxoH5TzDri1oJ0GV3IXpDJGeO-CEGWrseVarMjt329ExONXioNN30dWcsk5iB_oB0zQ</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Mobile agent based TDMA slot assignment algorithm for wireless sensor networks</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Patro, R.K. ; Mohan, B.</creator><creatorcontrib>Patro, R.K. ; Mohan, B.</creatorcontrib><description>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.</description><identifier>ISBN: 0769523153</identifier><identifier>ISBN: 9780769523156</identifier><identifier>DOI: 10.1109/ITCC.2005.201</identifier><language>eng</language><publisher>IEEE</publisher><subject>Access protocols ; Broadcasting ; Chemical technology ; Job shop scheduling ; Media Access Protocol ; Mobile agents ; Multiaccess communication ; Network topology ; Time division multiple access ; Wireless sensor networks</subject><ispartof>International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II, 2005, Vol.2, p.663-667 Vol. 2</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/1425220$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2056,4047,4048,27923,54918</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/1425220$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Patro, R.K.</creatorcontrib><creatorcontrib>Mohan, B.</creatorcontrib><title>Mobile agent based TDMA slot assignment algorithm for wireless sensor networks</title><title>International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II</title><addtitle>ITCC</addtitle><description>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.</description><subject>Access protocols</subject><subject>Broadcasting</subject><subject>Chemical technology</subject><subject>Job shop scheduling</subject><subject>Media Access Protocol</subject><subject>Mobile agents</subject><subject>Multiaccess communication</subject><subject>Network topology</subject><subject>Time division multiple access</subject><subject>Wireless sensor networks</subject><isbn>0769523153</isbn><isbn>9780769523156</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2005</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><recordid>eNotjEtLxDAUhQMiqOMsXbnJH-h4kzRNshzqa2BGN3U95HFbo31IUhj891b0LM7H4YNDyA2DDWNg7nZNXW84gFyKnZErUJWRXDApLsg65w9YIkxpKrgkL4fJxR6p7XCcqbMZA23uD1ua-2mmNufYjcOvsn03pTi_D7SdEj3FhD3mTDOOedkjzqcpfeZrct7aPuP6nyvy9vjQ1M_F_vVpV2_3RWRKzgX3SgmDgKCkDG3ltWuDUSxoH5TzDri1oJ0GV3IXpDJGeO-CEGWrseVarMjt329ExONXioNN30dWcsk5iB_oB0zQ</recordid><startdate>2005</startdate><enddate>2005</enddate><creator>Patro, R.K.</creator><creator>Mohan, B.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>2005</creationdate><title>Mobile agent based TDMA slot assignment algorithm for wireless sensor networks</title><author>Patro, R.K. ; Mohan, B.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-2c7739e0e0755df6c8bfd971d8cd7bcb02aa08b80b42bd57993ccbd334f8ef283</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2005</creationdate><topic>Access protocols</topic><topic>Broadcasting</topic><topic>Chemical technology</topic><topic>Job shop scheduling</topic><topic>Media Access Protocol</topic><topic>Mobile agents</topic><topic>Multiaccess communication</topic><topic>Network topology</topic><topic>Time division multiple access</topic><topic>Wireless sensor networks</topic><toplevel>online_resources</toplevel><creatorcontrib>Patro, R.K.</creatorcontrib><creatorcontrib>Mohan, B.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Xplore</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Patro, R.K.</au><au>Mohan, B.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Mobile agent based TDMA slot assignment algorithm for wireless sensor networks</atitle><btitle>International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II</btitle><stitle>ITCC</stitle><date>2005</date><risdate>2005</risdate><volume>2</volume><spage>663</spage><epage>667 Vol. 2</epage><pages>663-667 Vol. 2</pages><isbn>0769523153</isbn><isbn>9780769523156</isbn><abstract>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.</abstract><pub>IEEE</pub><doi>10.1109/ITCC.2005.201</doi></addata></record>
fulltext fulltext_linktorsrc
identifier ISBN: 0769523153
ispartof International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II, 2005, Vol.2, p.663-667 Vol. 2
issn
language eng
recordid cdi_ieee_primary_1425220
source IEEE Electronic Library (IEL) Conference Proceedings
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
title Mobile agent based TDMA slot assignment algorithm for wireless sensor networks
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-14T13%3A54%3A55IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Mobile%20agent%20based%20TDMA%20slot%20assignment%20algorithm%20for%20wireless%20sensor%20networks&rft.btitle=International%20Conference%20on%20Information%20Technology:%20Coding%20and%20Computing%20(ITCC'05)%20-%20Volume%20II&rft.au=Patro,%20R.K.&rft.date=2005&rft.volume=2&rft.spage=663&rft.epage=667%20Vol.%202&rft.pages=663-667%20Vol.%202&rft.isbn=0769523153&rft.isbn_list=9780769523156&rft_id=info:doi/10.1109/ITCC.2005.201&rft_dat=%3Cieee_6IE%3E1425220%3C/ieee_6IE%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-i175t-2c7739e0e0755df6c8bfd971d8cd7bcb02aa08b80b42bd57993ccbd334f8ef283%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=1425220&rfr_iscdi=true