TDMA Scheduling Algorithm Using Independent Sets in Network Graph
Journal Title: INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY - Year 2013, Vol 10, Issue 10
Abstract
Wireless Sensor Networks (WSNs) is a distributed wireless network consists of large amount of sensor nodes which gather useful information from a variety of environment and these sensor nodes communicate with each other in a multi-hop radio networks, with the end goal of handing their processed data to the data collector or access point (AP) [1,2]. WSNs have many issues such as self-configuration, fault-tolerance, adaptation, flexibility, energy efficiency, security, scalability, interference, architectural issues, mobility and delay tolerance [3]. Amongthese issues the most critical issue is to save energy and interference. The aim of this study is to construct the network graph which is conflict free and has minimum interference and minimum energy consumption. We have MAC Access protocols but TDMA protocol is more efficient than other protocols because TDMA can eliminate collisions and remove the need for a back-off [4]. A TDMA scheduling algorithm is constructed for the wireless sensor network, which is based on the creation of separate independent sets of the representing network graph. Independent sets are employed to minimize the time slots needed for the complete transmission of data packets in the network. An algorithm has been developed to implement it and there are three different steps in the implementation of this algorithm. In first phase, the minimum independent sets of the network are constructed. In second phase, the conflict graph of given network graph has been created. In third phase, time slots are assigned to all the transmissions according to the independent sets which were created in first phase, so that all the data packets are transmitted to the access point (AP) or data collector. The simulation results indicate that the TDMA scheduling algorithm reduce the interference and energy consumption in the network graph.
Authors and Affiliations
Gargi Chauhan, Usha Sharma, Seema Verma, G. N. Purohit
Keywords
Related Articles
- EP ID EP650265
- DOI 10.24297/ijct.v10i10.1195
- Views 53
- Downloads 0
On multi-objective linear programming problems with inexact rough interval-fuzzy coefficients
This paper deals with a multi-objective linear programming problem with an inexact rough interval fuzzy coefficients IRFMOLP. This problem is considered by incorporating an inexact rough interval fuzzy number in both the...
Enhanced Tiny Encryption Algorithm with Embedding (ETEA)
As computer systems become more pervasive and complex, security is increasingly important. Secure Transmission refers to the transfer of data such as confidential or proprietary information over a secure channel. Many se...
Performance Evaluation of COCOMO Vs UCP
Effort estimation is a measure factor of estimation in today’s world. From a long time being, a no. of techniques is employed for the estimation of efforts. Very popular and widely used techniques are COCOMO1 and COCOM...
Forensic Analysis of Databases by Combining Multiple Evidences
The information security for securing enterprise databases from internal and external attacks and violations of mutual policy is an interminable struggle. With the growing number of attacks and frauds, the organizations...
Implementation and Analysis of a Refactoring Tool for Detecting Code Smells
Software development is a field which is in action for decades. Preparing code for Software is not a difficult task, but preparing an efficient code is complicated one. To change the code is to make internal structure of...