Wireless Mesh Networks (WMNs) have received attention in wireless network users. Low cost, easy deploy ability, access to the Internet, are few of the several reasons for it. It is also capturing major share of attention amongst researchers as it is in its evolutionary stage. The performance of WMN is still under observation. In this paper, we have tried to analyze the performance of wireless mesh network where each individual cluster of client nodes is associated with cluster head which serves as default Gateway for Internet access. The performance is evaluated on the basis of throughput with varying transmission rate. Also end to end to delay with different transmission rates is analyzed. Performance of a cluster with one Gateway is compared with four clusters scenario. Number of nodes in the cluster is kept same as in the first case. Network Simulator NS-2 is used for evaluation. The results show that Multiple Gateway scenarios provide better results as compared to Single Gateway as the density of nodes goes on reducing per cluster.
{"title":"Analyzing Gateway Association in Wireless Mesh Network","authors":"Geeta J. Tripathi, A. Mahajan","doi":"10.1109/ICETET.2013.23","DOIUrl":"https://doi.org/10.1109/ICETET.2013.23","url":null,"abstract":"Wireless Mesh Networks (WMNs) have received attention in wireless network users. Low cost, easy deploy ability, access to the Internet, are few of the several reasons for it. It is also capturing major share of attention amongst researchers as it is in its evolutionary stage. The performance of WMN is still under observation. In this paper, we have tried to analyze the performance of wireless mesh network where each individual cluster of client nodes is associated with cluster head which serves as default Gateway for Internet access. The performance is evaluated on the basis of throughput with varying transmission rate. Also end to end to delay with different transmission rates is analyzed. Performance of a cluster with one Gateway is compared with four clusters scenario. Number of nodes in the cluster is kept same as in the first case. Network Simulator NS-2 is used for evaluation. The results show that Multiple Gateway scenarios provide better results as compared to Single Gateway as the density of nodes goes on reducing per cluster.","PeriodicalId":440967,"journal":{"name":"2013 6th International Conference on Emerging Trends in Engineering and Technology","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133192344","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
With the recent advancement in the mobile technology, devices are equipped with location computing facility. Devices are mounted with real entities such as human, animals, vehicles etc. In Location Based Services, user carrying device seeks service and hence user's location information is compromised and can be misused by service providers. In this paper, we present the review and propose the enhanced mechanisms to protect the location privacy of mobile users. It necessary to observe that to get quality of service, user needs to send precise location, while to protect privacy, we need to have balanced view regarding revealing location to service provider. Quality of service, Performance, Energy consumption, Network bandwidth consumption and Privacy strength are the parameters of importance which should be the objectives of research while providing the location based services.
{"title":"Survey and Review of Location Privacy Techniques in Location Based Services","authors":"B. Jagdale, J. Bakal","doi":"10.1109/ICETET.2013.43","DOIUrl":"https://doi.org/10.1109/ICETET.2013.43","url":null,"abstract":"With the recent advancement in the mobile technology, devices are equipped with location computing facility. Devices are mounted with real entities such as human, animals, vehicles etc. In Location Based Services, user carrying device seeks service and hence user's location information is compromised and can be misused by service providers. In this paper, we present the review and propose the enhanced mechanisms to protect the location privacy of mobile users. It necessary to observe that to get quality of service, user needs to send precise location, while to protect privacy, we need to have balanced view regarding revealing location to service provider. Quality of service, Performance, Energy consumption, Network bandwidth consumption and Privacy strength are the parameters of importance which should be the objectives of research while providing the location based services.","PeriodicalId":440967,"journal":{"name":"2013 6th International Conference on Emerging Trends in Engineering and Technology","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134255529","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In a wireless sensor network (WSN), many researchers proved that the clustering technique improves the longevity of the network. But the load of handling traffic increases on the nodes which are closer to the sink or the base station (BS), as it has to carry others traffic along with its own towards the BS and depletes more energy which causes network holes. The power transmitted by the nodes could be controllable and each sensor can transmit directly to the BS but the farthest nodes consume more power and die earlier. Here we develop an efficient clustering technique in which cluster heads (CH) are formed and are supposed to send the data to the BS and the role of CH is changed in each rotation. The finalization of the CH is based on the energy distribution and its selection procedure is optimized using genetic algorithm (GA). The results show that with this approach the stable operating period increases and is compared with probabilistic and EC algorithm.
{"title":"A Clustering Solution for Wireless Sensor Networks Based on Energy Distribution & Genetic Algorithm","authors":"Sunil R. Gupta, N. Bawane, S. Akojwar","doi":"10.1109/ICETET.2013.24","DOIUrl":"https://doi.org/10.1109/ICETET.2013.24","url":null,"abstract":"In a wireless sensor network (WSN), many researchers proved that the clustering technique improves the longevity of the network. But the load of handling traffic increases on the nodes which are closer to the sink or the base station (BS), as it has to carry others traffic along with its own towards the BS and depletes more energy which causes network holes. The power transmitted by the nodes could be controllable and each sensor can transmit directly to the BS but the farthest nodes consume more power and die earlier. Here we develop an efficient clustering technique in which cluster heads (CH) are formed and are supposed to send the data to the BS and the role of CH is changed in each rotation. The finalization of the CH is based on the energy distribution and its selection procedure is optimized using genetic algorithm (GA). The results show that with this approach the stable operating period increases and is compared with probabilistic and EC algorithm.","PeriodicalId":440967,"journal":{"name":"2013 6th International Conference on Emerging Trends in Engineering and Technology","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130229971","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Nidhi Chandak, H. Jayashree, Ghanshyam N. Patil, Nidhi C. Rao
This paper presents a decimal adder which is hardware, speed and power efficient. Conventional BCD addition usually concludes by adding the correction bits to the result, which often proves to consume lot of processing latency, hence instead of adding correction bits appropriate flag bits are generated thus reducing the delay and the hardware encountered decimal correction. Various fast adders like Brent-Kung, Kogge-Stone, Sklansky, Knowles, Ladner Fischer, Han-Carlson have been used to implement this. A comparative study based on the number of LUT's consumed and the combinational delay encountered in the critical path for different adders is performed for various device families. Verilog code has been used to design the proposed BCD adder and it is simulated using ISim. A delay improvement of 9.03% is achieved by the architecture of the BCD adder proposed in this paper.
{"title":"Performance Optimization of Flagged BCD Adder","authors":"Nidhi Chandak, H. Jayashree, Ghanshyam N. Patil, Nidhi C. Rao","doi":"10.1109/ICETET.2013.52","DOIUrl":"https://doi.org/10.1109/ICETET.2013.52","url":null,"abstract":"This paper presents a decimal adder which is hardware, speed and power efficient. Conventional BCD addition usually concludes by adding the correction bits to the result, which often proves to consume lot of processing latency, hence instead of adding correction bits appropriate flag bits are generated thus reducing the delay and the hardware encountered decimal correction. Various fast adders like Brent-Kung, Kogge-Stone, Sklansky, Knowles, Ladner Fischer, Han-Carlson have been used to implement this. A comparative study based on the number of LUT's consumed and the combinational delay encountered in the critical path for different adders is performed for various device families. Verilog code has been used to design the proposed BCD adder and it is simulated using ISim. A delay improvement of 9.03% is achieved by the architecture of the BCD adder proposed in this paper.","PeriodicalId":440967,"journal":{"name":"2013 6th International Conference on Emerging Trends in Engineering and Technology","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131705261","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This paper presents the review on removal of fluoride using adsorption process based on wide array of low cost and specialized adsorbent only with various options to supply safe drinking water to the people.
本文综述了以多种低成本专用吸附剂为基础的吸附法除氟的研究进展，为人们提供了安全饮用水。
{"title":"A State of Art: Removal of Fluoride from Water by Adsorption Method","authors":"B. Godboley, P. Nagarnaik","doi":"10.1109/ICETET.2013.41","DOIUrl":"https://doi.org/10.1109/ICETET.2013.41","url":null,"abstract":"This paper presents the review on removal of fluoride using adsorption process based on wide array of low cost and specialized adsorbent only with various options to supply safe drinking water to the people.","PeriodicalId":440967,"journal":{"name":"2013 6th International Conference on Emerging Trends in Engineering and Technology","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127557730","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
U. Shrawankar, A. Meshram, Reetu Gupta, Jashweeni Nandanwar
Achieving deadline in real time environment is a real practical difficulty. Real time scheduling algorithms consume more time in making scheduling decisions which leads to increase in deadline misses. The problem is further complicated in virtual environment. This motivates the idea for designing an efficient algorithm for future prediction of block access requests in virtual environment. Disk block access requests made by real time applications in virtualized environment are analyzed. Future disk access request are predicted by non-work conserving disk scheduling algorithm in offline mode. These pre-fetched disk blocks are moved to buffer cache. Pattern based detection technique is applied for predicting the future access of buffer cache blocks. Executing processes access large amount of data and require disk accesses. In real time virtualized environment the requesting processes are scheduled using an adaptive real time scheduling algorithm which reduces the deadline misses. Thus, due to non-work conserving algorithm seek time is reduced. Pattern based technique improves the hit ratio and reduces I/O time. An adaptive real time scheduling algorithm helps to schedule the processes for achieving their deadlines. Thus the performance of applications is enhanced in virtual environment and therefore non-work conserving pattern based adaptive real time scheduling algorithm is found very useful for hard real time applications.
{"title":"Pattern Based Real Time Disk Scheduling Algorithm for Virtualized Environment","authors":"U. Shrawankar, A. Meshram, Reetu Gupta, Jashweeni Nandanwar","doi":"10.1109/ICETET.2013.51","DOIUrl":"https://doi.org/10.1109/ICETET.2013.51","url":null,"abstract":"Achieving deadline in real time environment is a real practical difficulty. Real time scheduling algorithms consume more time in making scheduling decisions which leads to increase in deadline misses. The problem is further complicated in virtual environment. This motivates the idea for designing an efficient algorithm for future prediction of block access requests in virtual environment. Disk block access requests made by real time applications in virtualized environment are analyzed. Future disk access request are predicted by non-work conserving disk scheduling algorithm in offline mode. These pre-fetched disk blocks are moved to buffer cache. Pattern based detection technique is applied for predicting the future access of buffer cache blocks. Executing processes access large amount of data and require disk accesses. In real time virtualized environment the requesting processes are scheduled using an adaptive real time scheduling algorithm which reduces the deadline misses. Thus, due to non-work conserving algorithm seek time is reduced. Pattern based technique improves the hit ratio and reduces I/O time. An adaptive real time scheduling algorithm helps to schedule the processes for achieving their deadlines. Thus the performance of applications is enhanced in virtual environment and therefore non-work conserving pattern based adaptive real time scheduling algorithm is found very useful for hard real time applications.","PeriodicalId":440967,"journal":{"name":"2013 6th International Conference on Emerging Trends in Engineering and Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130628534","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：