Refine your search
Collections
Co-Authors
Journals
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z All
Ganesan, R.
- Static Algorithmic Transformation Based Low Power Wireless Sensor Networks
Abstract Views :153 |
PDF Views:3
Authors
Affiliations
1 Electronics and Communication Engineering, Sri Sairam Institute of Technology, Chennai, IN
2 National Engineering College, IN
3 MIT, Anna University, IN
1 Electronics and Communication Engineering, Sri Sairam Institute of Technology, Chennai, IN
2 National Engineering College, IN
3 MIT, Anna University, IN
Source
Wireless Communication, Vol 6, No 2 (2014), Pagination:Abstract
Wireless Sensor Networks (WSN) has become a very significant enabling technology in civil, military, radio communication and medical applications for collecting and processing of complex environmental data. Wireless sensor networks have several important attributes that require special attention to device design. These include the need for inexpensive, long-lasting, highly reliable devices coupled with very low performance requirements. Radio communication has highest energy consumption in wireless sensor nodes. Sensor nodes are battery driven and have limited power. Hence, sensor nodes lifetime on the order of months to years. Hence, energy consumption is the important factor in determining sensor nodes lifetime. Power consumption is high during data processing and data transmission process. Inorder to reduce number of data sensed by nodes Data Aggregation is used. Data Aggregation converts multiple sensed data into single data. Here proposing, data aggregation process implemented using DVFS (Dynamic Voltage and Frequency Scaling) algorithm used at input side along with Static Algorithmic Transformation (SAT) uses folded tree architecture to reduce power by reducing number of processing elements and to improve performance of sensor nodes. Experimental results shows that using DVFS algorithm reduces power up to 13% compared to existing processing methods.Keywords
Folded Tree, DVFS, Processing Elements, WSN.
- A Nonblocking Token Ring Based Checkpointing Algorithm for Distributed Mobile Computing Systems
Abstract Views :173 |
PDF Views:1
Authors
Affiliations
1 Deparment of Computer Science, Arignar Anna Government Arts College Attur, Salem Dt Tamil Nadu, IN
2 Department of MCA, K. S. Rangasamy College of Technology, Tiruchengode, Namakkal Dt, Tamil Nadu, IN
1 Deparment of Computer Science, Arignar Anna Government Arts College Attur, Salem Dt Tamil Nadu, IN
2 Department of MCA, K. S. Rangasamy College of Technology, Tiruchengode, Namakkal Dt, Tamil Nadu, IN
Source
Wireless Communication, Vol 1, No 2 (2009), Pagination: 116-120Abstract
Mobile computing introduces new flexibility such as continuous access to computing resources while the users travel.This facility raises new challenges such as fault tolerance in distributed mobile computing system. In this paper we present a non blocking token ring based checkpointing algorithm to tolerate the faults in the mobile computing environment. It is a single phase algorithm neither having the overhead of temporary checkpoints nor using dependency vector; and also it avoids the avalanche effect. Results shows that it outperforms two-phase algorithms.