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

ENHANCED SECURITY MECHANISM IN CLOUD COMPUTING: A REVIEW

Cloud is a term used as a metaphor for the wide area networks (like internet) or any such large networked environment. It came partly from the cloud-like symbol used to represent the complexities of the networks in the s...

3-D from 2-D Using Warping Transformations .

Shown in this paper are methods on how to find the third dimension of a single image or from the two views of the image taking in a different angle using the method more accurate and faster to get to the third dimension...

A METRICS BASED APPROACH TO ANALYSE WEB USAGE PATTERN

Web metrics are established goals and standards for measuring website performance. Web Analytics can be used to analyze and statistically process user and customer behavior. Web Analytics especially refers to the use of...

Content-Based Image Retrieval using Color Quantization and Angle Representation

An efficient non-uniform color quantization and similarity measurement methods are proposed to enhance the content-based image retrieval (CBIR) applications. The HSV color space is selected because it is close to human v...

Comparison of Various Window Functions Used in FIR Filter Designing

In this study, 2-parameter cosh window is modified to improve its spectral characteristic in terms of the ripple ratio by proposing a new additional parameter. It is observed that an increase in the new parameter results...

Download PDF file
  • EP ID EP650265
  • DOI 10.24297/ijct.v10i10.1195
  • Views 76
  • Downloads 0

How To Cite

Gargi Chauhan, Usha Sharma, Seema Verma, G. N. Purohit (2013). TDMA Scheduling Algorithm Using Independent Sets in Network Graph. INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY, 10(10), 2071-2080. https://europub.co.uk/articles/-A-650265