GREEN ROUTINGSTRATEGY FOR DYNAMICALLY ARRANGED HOMOGENEOUS WSN- MSCT2
Journal Title: INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY - Year 2014, Vol 12, Issue 7
Abstract
Wireless networks play a crucial role in the communication systems nowadays. Wireless networks are being increasingly used in the communication among devices of the most varied types and sizes. User mobility, affordability, flexibility and ease of use are few of many reasons for making them very appealing to new applications and more users everyday. A Wireless Sensor Network (WSN) is composed of sensor nodes spread over the field to sense the data. The sensed data must be gathered & transmitted to Base Station (BS) for end user queries. The used sensor nodes being in- expensive having low computation power & limited energy so are not as much reliable as their expensive macro sensor counter parts but their size and cost enable hundred to thousand of micro sensors to achieve high quality fault tolerant system. In an environment where in each round all sensor nodes have to send data to base station; it is required to effectively utilize energy of sensor nodes so as to increase the life- time of the system. The use of data aggregation & fusion as proposed in LEACH increases system lifetime by a factor of 8 as compared to conventional routing protocols. In this work, our main focus is the static sensors are randomly selected and the base stations have their information all a priori. Basically, the sensors are in direct communication range of each other and can transmit to and receive from the base station. The nodes periodically sense the environment and have always data to send in each round of communication. The nodes fuse/ aggregate the data they receive from the others with their own data, and produce only one packet regardless of how many packets they receive. The problem is to find a routing scheme or an efficient protocol to deliver data packets collected from sensor nodes to the base station. It maximizes the lifetime of the sensor network under the system model given above. However, the definition of quality of service of the sensor network provides is not specified. Secondly, where the nodes are densely deployed, the quality of the system is affected as soon as a significant amount of nodes die, since adjacent nodes record identical or related data. In this case, the lifetime of the network is the time elapsed until half of the nodes or some specified portion of the nodes die. In general terms, the time in rounds where the last node depletes all of its energy defines the lifetime of the overall sensor network. Taking these different possible requirements under consideration, our work provides a proper timing of all deaths for all algorithms in detail as well as chooses the shortest possible path for communication with better memory management scheme and leaves the decision which one to choose to system designers.
Authors and Affiliations
Gulista Khan, Wajid Ali, Swati Arya, Vaibhav Sharma
Keywords
Related Articles
- EP ID EP650487
- DOI 10.24297/ijct.v12i7.3077
- Views 74
- Downloads 0
A NOVEL METHOD OF COLOR IMAGE ENHANCEMENT BY COLOR SPACE TRANSFORMATION FOLLOWED BY GAMMA/LOGARITHMIC TRANSFORMATION
Visual enhancement of image plays a very important role in the field of medical imaging. Enhanced medical images are more suitable for analysis and proper diagnosis. We present a novel method of enhancement of color medi...
STUDY OF TEST CASE PRIORITIZATION TECHNIQUE USING APFD
Regression testing is used to ensure that bugs are fixed and new functionality introduce in a new version of a software that don't adversely affect the original functionality inherited from the previous version.Regressio...
A Comparative analysis of OFDM based Communication using different Mapping Schemes for Signal Modulation
OFDM is a multiplexing technique that is used to divide a frequency spectrum into sub-carriers that are orthogonal to each other. They are capable to carry high rate data transmission. The orthogonality is maintained by...
A Comparative study on secure routing algorithms SAODV and A-SAODV in Mobile AdHoc Networks (MANET) – The Enhancements of AODV
A freely moving nodes forming as group to communicate among themselves are called as Mobile AdHoc Networks (MANET). Many applications are choosing this MANET for effective commutation due to its flexible nature in formin...
Social Representations of ICT in High School Students in Niger
This article examines social representations of information and communications technologies (ICT) in high school students in Niamey, Niger, and explores whether these representations are determined by training in and reg...