Pub Date : 2014-12-01DOI: 10.1109/ICCIC.2014.7238339
R. Sarala, G. Zayaraz, V. Vijayalakshmi, R. Sivaranjani
The increase in the number of security breaches has made information security risk management an essential security activity for all type of organizations. Risk Management involves assessment involves identification of assets, threats and vulnerabilities. Attacks by outsiders continue to cause the most security breaches to all organizations. Existing approaches like attack graph based risk assessment have scalability issues and focus on only single step attacks. It is very difficult to predict multistep attacks that exploit a chain of vulnerabilities. The multistep attacks are based on the causality of relation where every cause has an effect. Causality refers to a cause i.e. one event and consequences i.e. another event that has occurred because of the cause. The proposed system aims to make use of fuzzy cognitive maps to model the causally dependent events. Fuzzy cognitive map is a concrete representation of knowledge that can handle incomplete or conflicting information. This is very important in risk assessment because important information may be unreliable as they may be a result of unreliable measurement techniques. The proposed system will aid in proactive information security risk assessment.
{"title":"Modeling causally dependent events using fuzzy cognitive maps","authors":"R. Sarala, G. Zayaraz, V. Vijayalakshmi, R. Sivaranjani","doi":"10.1109/ICCIC.2014.7238339","DOIUrl":"https://doi.org/10.1109/ICCIC.2014.7238339","url":null,"abstract":"The increase in the number of security breaches has made information security risk management an essential security activity for all type of organizations. Risk Management involves assessment involves identification of assets, threats and vulnerabilities. Attacks by outsiders continue to cause the most security breaches to all organizations. Existing approaches like attack graph based risk assessment have scalability issues and focus on only single step attacks. It is very difficult to predict multistep attacks that exploit a chain of vulnerabilities. The multistep attacks are based on the causality of relation where every cause has an effect. Causality refers to a cause i.e. one event and consequences i.e. another event that has occurred because of the cause. The proposed system aims to make use of fuzzy cognitive maps to model the causally dependent events. Fuzzy cognitive map is a concrete representation of knowledge that can handle incomplete or conflicting information. This is very important in risk assessment because important information may be unreliable as they may be a result of unreliable measurement techniques. The proposed system will aid in proactive information security risk assessment.","PeriodicalId":187874,"journal":{"name":"2014 IEEE International Conference on Computational Intelligence and Computing Research","volume":"342 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115983271","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}
Pub Date : 2014-12-01DOI: 10.1109/ICCIC.2014.7238351
P. Kaliappan, H. Koenig
We developed a component-oriented modeling approach for the design of communication protocols and distributed systems. The approach aims at the reuse of components represented by means of Unified Modeling Language (Uml) diagrams. Designs based on compositions of components have to formally be proved for correctness. In this paper we propose a verification approach by combining trace equivalence and model checking to verify UML-based designs of communication protocols. Our method consists of two steps. Foremost, the internal and external component behaviors are verified independently regarding their formal correctness. Thereafter the correctness and consistency of compositions is verified. This is achieved by generating the component adaptation path as traces during the composition. The requirements, i.e., safety and liveness properties, are formulated using linear temporal logic formulae. We apply the Spin tool as our model checking mechanism. For this, we present a method for automatically transforming the designs into Promela. We evaluate our approach for an example data transfer protocol as a case study.
{"title":"Model checking the component-based protocol specification for proving the design correctness","authors":"P. Kaliappan, H. Koenig","doi":"10.1109/ICCIC.2014.7238351","DOIUrl":"https://doi.org/10.1109/ICCIC.2014.7238351","url":null,"abstract":"We developed a component-oriented modeling approach for the design of communication protocols and distributed systems. The approach aims at the reuse of components represented by means of Unified Modeling Language (Uml) diagrams. Designs based on compositions of components have to formally be proved for correctness. In this paper we propose a verification approach by combining trace equivalence and model checking to verify UML-based designs of communication protocols. Our method consists of two steps. Foremost, the internal and external component behaviors are verified independently regarding their formal correctness. Thereafter the correctness and consistency of compositions is verified. This is achieved by generating the component adaptation path as traces during the composition. The requirements, i.e., safety and liveness properties, are formulated using linear temporal logic formulae. We apply the Spin tool as our model checking mechanism. For this, we present a method for automatically transforming the designs into Promela. We evaluate our approach for an example data transfer protocol as a case study.","PeriodicalId":187874,"journal":{"name":"2014 IEEE International Conference on Computational Intelligence and Computing Research","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121286088","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}
Pub Date : 2014-12-01DOI: 10.1109/ICCIC.2014.7238556
S. V. Ragavan, M. Shanmugavel, C. H. Lim, Jin Zhen Lee
Land based vehicles, i.e. cars, make up the main mode of transport on Earth, emitting harmful greenhouse gases due to combustion of fossil fuels. By installing regenerative systems in vehicles, the fuel consumption of the internal combustion engine (ICE) is reduced by capturing the energy usually lost during braking and reusing it to help propel the vehicle. The work described in this paper explores the practicality of a pneumatic regenerative braking system (PRBS). A functional prototype was successfully designed and tested to obtain efficiency data from a prototype.
{"title":"Design of a low cost parallel pneumatic regenerative braking and acceleration assist for light motor vehicles","authors":"S. V. Ragavan, M. Shanmugavel, C. H. Lim, Jin Zhen Lee","doi":"10.1109/ICCIC.2014.7238556","DOIUrl":"https://doi.org/10.1109/ICCIC.2014.7238556","url":null,"abstract":"Land based vehicles, i.e. cars, make up the main mode of transport on Earth, emitting harmful greenhouse gases due to combustion of fossil fuels. By installing regenerative systems in vehicles, the fuel consumption of the internal combustion engine (ICE) is reduced by capturing the energy usually lost during braking and reusing it to help propel the vehicle. The work described in this paper explores the practicality of a pneumatic regenerative braking system (PRBS). A functional prototype was successfully designed and tested to obtain efficiency data from a prototype.","PeriodicalId":187874,"journal":{"name":"2014 IEEE International Conference on Computational Intelligence and Computing Research","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122381205","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}
Pub Date : 2014-12-01DOI: 10.1109/ICCIC.2014.7238489
A. Florence, V. Shanthi
Cloud computing is novel technology, which enables any resource as service on demand. Cloud environment motivates highly dynamic resource provisioning. Hence clients can scale up or scale down their requirements as per their demand. Load balancing is very important and complex problem in cloud environment, because of its heterogeneity of the computing nodes. In order to realize the full potential of cloud computing it is vital to minimize energy consumption along with effective load balancing. The aim of Energy Aware Load Balancing (EALB) model is to minimize energy consumption with load balancing. EALB model classifies the incoming job request either CPU bound or I/O bound according to their purpose and behaviour. This classification details are maintained in a table named Pattern History Table (PHT) and organized as hash table. One of the virtual machine (VM) is selected dynamically based on best fit allocation policy and the job is assigned to the victimized VM. From the pattern history table job's nature is identified. Using Dynamic Voltage Frequency Scaling (DVFS) scheme the selected VM's processor clock frequency is increased if it is found CPU bound else decreased (I/O bound). Thus, EALB algorithm saves considerable amount of energy and proves to be more efficient.
云计算是一种新颖的技术，它使任何资源都能按需提供服务。云环境激发了高度动态的资源配置。因此，客户可以根据他们的需求增加或减少他们的需求。由于计算节点的异构性，负载均衡是云环境中一个非常重要而复杂的问题。为了充分发挥云计算的潜力，最小化能源消耗以及有效的负载平衡至关重要。能量感知负载均衡(EALB)模型的目标是通过负载均衡使能耗最小化。EALB模型根据传入作业请求的目的和行为，对传入作业请求进行CPU绑定或I/O绑定的分类。这些分类细节保存在一个名为Pattern History table (PHT)的表中，并组织为散列表。根据最佳匹配分配策略动态选择一个虚拟机，并将任务分配给受害虚拟机。从模式历史表作业的性质被识别出来。使用动态电压频率缩放(DVFS)方案，如果发现CPU绑定或降低(I/O绑定)，则所选VM的处理器时钟频率将增加。因此，EALB算法节省了大量的能量，并且被证明是更高效的。
{"title":"Energy aware load balancing for computational cloud","authors":"A. Florence, V. Shanthi","doi":"10.1109/ICCIC.2014.7238489","DOIUrl":"https://doi.org/10.1109/ICCIC.2014.7238489","url":null,"abstract":"Cloud computing is novel technology, which enables any resource as service on demand. Cloud environment motivates highly dynamic resource provisioning. Hence clients can scale up or scale down their requirements as per their demand. Load balancing is very important and complex problem in cloud environment, because of its heterogeneity of the computing nodes. In order to realize the full potential of cloud computing it is vital to minimize energy consumption along with effective load balancing. The aim of Energy Aware Load Balancing (EALB) model is to minimize energy consumption with load balancing. EALB model classifies the incoming job request either CPU bound or I/O bound according to their purpose and behaviour. This classification details are maintained in a table named Pattern History Table (PHT) and organized as hash table. One of the virtual machine (VM) is selected dynamically based on best fit allocation policy and the job is assigned to the victimized VM. From the pattern history table job's nature is identified. Using Dynamic Voltage Frequency Scaling (DVFS) scheme the selected VM's processor clock frequency is increased if it is found CPU bound else decreased (I/O bound). Thus, EALB algorithm saves considerable amount of energy and proves to be more efficient.","PeriodicalId":187874,"journal":{"name":"2014 IEEE International Conference on Computational Intelligence and Computing Research","volume":"290 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116390529","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}
Pub Date : 2014-12-01DOI: 10.1109/ICCIC.2014.7238371
S. V. Viraktamath, Preeya H. Patil, G. V. Attimarad
The most of the modern hand held communicating devices rely on forward error correction techniques for their proper functioning. Convolutional coding and Viterbi decoding is one of the forward error correction technique used in most of the communication applications. This paper investigates the impact of code rates on the performance of hard decision Viterbi decoder. In this paper different rates such as 1/2, 2/3 and 3/5 have been simulated using different constraint lengths from 5 to 10 as well as different generator polynomials. All the simulations are conducted in MATLAB over AWGN channel. The paper also investigates the impact of trace back length on the performance of Viterbi decoder. The decoding time for different constraint lengths have also been observed.
{"title":"Impact of code rate on the performance of Viterbi decoder in AWGN channel","authors":"S. V. Viraktamath, Preeya H. Patil, G. V. Attimarad","doi":"10.1109/ICCIC.2014.7238371","DOIUrl":"https://doi.org/10.1109/ICCIC.2014.7238371","url":null,"abstract":"The most of the modern hand held communicating devices rely on forward error correction techniques for their proper functioning. Convolutional coding and Viterbi decoding is one of the forward error correction technique used in most of the communication applications. This paper investigates the impact of code rates on the performance of hard decision Viterbi decoder. In this paper different rates such as 1/2, 2/3 and 3/5 have been simulated using different constraint lengths from 5 to 10 as well as different generator polynomials. All the simulations are conducted in MATLAB over AWGN channel. The paper also investigates the impact of trace back length on the performance of Viterbi decoder. The decoding time for different constraint lengths have also been observed.","PeriodicalId":187874,"journal":{"name":"2014 IEEE International Conference on Computational Intelligence and Computing Research","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127257846","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}
Pub Date : 2014-12-01DOI: 10.1109/ICCIC.2014.7238457
Phaniram Sayapaneni, V. Elamaran
From the past few years a variety of low power adders have been proposed to reduce the overall power consumption of micro-electronic systems. The role of adders are important in almost all fields of engineering and applied sciences. With the help of low power adders, all the other systems which make use of adders may dissipate less power. This study presents a detailed comparison between various low power 1-bit full adders. This study focuses mainly on the comparisons among conventional Complementary Metal Oxide Semiconductor (CMOS) adder, bridge style adder, transmission gate adder, square root based adder and static energy recovery full adder, etc. All the simulation results are done using Digital Schematic (DSCH) editor and the functionality is verified using the Microwind layout editor tool. The sole objective of this study to conclude with a better estimate and ease in selecting a low power adder for the required application.
{"title":"A comparative study on low power adders using microwind EDA tool","authors":"Phaniram Sayapaneni, V. Elamaran","doi":"10.1109/ICCIC.2014.7238457","DOIUrl":"https://doi.org/10.1109/ICCIC.2014.7238457","url":null,"abstract":"From the past few years a variety of low power adders have been proposed to reduce the overall power consumption of micro-electronic systems. The role of adders are important in almost all fields of engineering and applied sciences. With the help of low power adders, all the other systems which make use of adders may dissipate less power. This study presents a detailed comparison between various low power 1-bit full adders. This study focuses mainly on the comparisons among conventional Complementary Metal Oxide Semiconductor (CMOS) adder, bridge style adder, transmission gate adder, square root based adder and static energy recovery full adder, etc. All the simulation results are done using Digital Schematic (DSCH) editor and the functionality is verified using the Microwind layout editor tool. The sole objective of this study to conclude with a better estimate and ease in selecting a low power adder for the required application.","PeriodicalId":187874,"journal":{"name":"2014 IEEE International Conference on Computational Intelligence and Computing Research","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125968293","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}
Pub Date : 2014-12-01DOI: 10.1109/ICCIC.2014.7238444
A. Suresh, M. Kiran, C. S. Kumar
In this paper, a new auto tuning least square optimization tuning technique is presented to design Wood and Berry (WB) distillation column. It has Two Inputs and Two Outputs (TITO) binary distillation column. Design of TITO systems with decentralized, centralized, decouplers (compensators) and optimization tuning methods are not guaranteed to achieve desired output response. By adopting least square optimization tuning, it acts like an auto tuning control strategy. Hence, best performance characteristics of the system can be obtained. Here, WB TITO system is designed with full centralized structure and its PID values are evaluated from the MATLAB simulation program. Performance of the closed loop system is compared with Real Coded Genetic algorithm (RGA) and Covariance Matrix Adaption Evolution Strategy (CMAES). Best simulation results and performance indices values are obtained in least square optimization tuning method.
{"title":"Design PID controller for TITO process based on least square optimization tuning method","authors":"A. Suresh, M. Kiran, C. S. Kumar","doi":"10.1109/ICCIC.2014.7238444","DOIUrl":"https://doi.org/10.1109/ICCIC.2014.7238444","url":null,"abstract":"In this paper, a new auto tuning least square optimization tuning technique is presented to design Wood and Berry (WB) distillation column. It has Two Inputs and Two Outputs (TITO) binary distillation column. Design of TITO systems with decentralized, centralized, decouplers (compensators) and optimization tuning methods are not guaranteed to achieve desired output response. By adopting least square optimization tuning, it acts like an auto tuning control strategy. Hence, best performance characteristics of the system can be obtained. Here, WB TITO system is designed with full centralized structure and its PID values are evaluated from the MATLAB simulation program. Performance of the closed loop system is compared with Real Coded Genetic algorithm (RGA) and Covariance Matrix Adaption Evolution Strategy (CMAES). Best simulation results and performance indices values are obtained in least square optimization tuning method.","PeriodicalId":187874,"journal":{"name":"2014 IEEE International Conference on Computational Intelligence and Computing Research","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125477068","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}
Pub Date : 2014-12-01DOI: 10.1109/ICCIC.2014.7238545
Z. Livinsa
Recent technological developments in Micro-Electro-Mechanical System (MEMS) and communication system have made the wireless sensor networks (WSNs) with emerging applications. Localization is the essential research problem in WSNs. In this paper, I have projected Received Signal Strength Indicator (RSSI) and improved Distance vector (DV) localization algorithms for accurate position estimation. The localization error is premeditated for a diverse range of anchor population, communication range and degree of irregularity (DOI). In the simulation, I compare these two localization algorithms and the result shows that the performance of improved DV-Hop algorithm has high position accuracy as compared to the RSSI algorithm.
{"title":"Recital analysis of localization algorithm in wireless sensor networks","authors":"Z. Livinsa","doi":"10.1109/ICCIC.2014.7238545","DOIUrl":"https://doi.org/10.1109/ICCIC.2014.7238545","url":null,"abstract":"Recent technological developments in Micro-Electro-Mechanical System (MEMS) and communication system have made the wireless sensor networks (WSNs) with emerging applications. Localization is the essential research problem in WSNs. In this paper, I have projected Received Signal Strength Indicator (RSSI) and improved Distance vector (DV) localization algorithms for accurate position estimation. The localization error is premeditated for a diverse range of anchor population, communication range and degree of irregularity (DOI). In the simulation, I compare these two localization algorithms and the result shows that the performance of improved DV-Hop algorithm has high position accuracy as compared to the RSSI algorithm.","PeriodicalId":187874,"journal":{"name":"2014 IEEE International Conference on Computational Intelligence and Computing Research","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126617488","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}
Pub Date : 2014-12-01DOI: 10.1109/ICCIC.2014.7238474
K. Jayanthi, M. Karthikeyan
The future user needs in the field of Multimedia retrieval is the focus of many research and development activists. It is empirically observed that no single algorithm is efficient in extracting all different types of images like building images, flower images, car images and so on. Hence a thorough analysis of certain color, texture and shape extraction techniques are carried out to identify an efficient CBIR technique which suits for a particular type of images. The Extraction of an image includes feature description, index generation and feature detection. The low-level feature extraction techniques are proposed in this paper are tested on Corel database, which contains 1000 images. The feature vectors of the query image (QI) are compared with feature vectors of the database images to obtain matching images(MI). This paper proposes Fuzzy Color and Texture Histogram (FCTH) techniques which extract the matching image based on the similarity of color and edge of an image in the database. The Image Retrieval Precision value (IRP) of the proposed techniques are calculated and compared with that of the existing techniques. The algorithms used in this paper are Discrete Cosine Transform (DCT), Discrete Wavelet Transform (DWT) and Fuzzy Linking algorithm. The proposed technique results in the improvement of the average precision value. Also FCTH is effective and efficient for image indexing and image retrieval.
{"title":"Efficient fuzzy color and texture feature extraction technique for content based image retrieval system","authors":"K. Jayanthi, M. Karthikeyan","doi":"10.1109/ICCIC.2014.7238474","DOIUrl":"https://doi.org/10.1109/ICCIC.2014.7238474","url":null,"abstract":"The future user needs in the field of Multimedia retrieval is the focus of many research and development activists. It is empirically observed that no single algorithm is efficient in extracting all different types of images like building images, flower images, car images and so on. Hence a thorough analysis of certain color, texture and shape extraction techniques are carried out to identify an efficient CBIR technique which suits for a particular type of images. The Extraction of an image includes feature description, index generation and feature detection. The low-level feature extraction techniques are proposed in this paper are tested on Corel database, which contains 1000 images. The feature vectors of the query image (QI) are compared with feature vectors of the database images to obtain matching images(MI). This paper proposes Fuzzy Color and Texture Histogram (FCTH) techniques which extract the matching image based on the similarity of color and edge of an image in the database. The Image Retrieval Precision value (IRP) of the proposed techniques are calculated and compared with that of the existing techniques. The algorithms used in this paper are Discrete Cosine Transform (DCT), Discrete Wavelet Transform (DWT) and Fuzzy Linking algorithm. The proposed technique results in the improvement of the average precision value. Also FCTH is effective and efficient for image indexing and image retrieval.","PeriodicalId":187874,"journal":{"name":"2014 IEEE International Conference on Computational Intelligence and Computing Research","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127890119","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}
Pub Date : 2014-12-01DOI: 10.1109/ICCIC.2014.7238466
D. Seth, S. Patnaik, Srikanta Pal
In this paper a new MAC protocol called FAMAC is proposed. This protocol has been designed keeping in view the impact of both small scale and large scale fading environments. Whenever the transmission process encounters a small scale fading environments such as rayleigh or ricean, the action is taken to retransmit the RTS control signal expecting the improvement of the communication environment. In case of large scale fading, the transmission power is increased under the assumption that the communicating environment will remain approximately same in the near future. By using ns2 simulator, performance of FAMAC the proposed MAC protocol is compared with the two other most widely used MAC protocol DCF & EDCF. Avg. end-to-end delay and throughput are taken as the performance measure for the purpose. It was observed that the proposed FAMAC protocol shows improved results in comparison to DCF & EDCF. FAMAC shows higher throughput and lesser avg. delay in comparison to other MAC protocols. It was also observed that in FAMAC, the throughput and avg. and-to-end delay remains unaffected by various fading environment. But in DCF and EDCF, those are affected by Rayleigh and Ricean fading environment.
{"title":"Fading aware MAC (FAMAC) protocol for mobile adhoc network","authors":"D. Seth, S. Patnaik, Srikanta Pal","doi":"10.1109/ICCIC.2014.7238466","DOIUrl":"https://doi.org/10.1109/ICCIC.2014.7238466","url":null,"abstract":"In this paper a new MAC protocol called FAMAC is proposed. This protocol has been designed keeping in view the impact of both small scale and large scale fading environments. Whenever the transmission process encounters a small scale fading environments such as rayleigh or ricean, the action is taken to retransmit the RTS control signal expecting the improvement of the communication environment. In case of large scale fading, the transmission power is increased under the assumption that the communicating environment will remain approximately same in the near future. By using ns2 simulator, performance of FAMAC the proposed MAC protocol is compared with the two other most widely used MAC protocol DCF & EDCF. Avg. end-to-end delay and throughput are taken as the performance measure for the purpose. It was observed that the proposed FAMAC protocol shows improved results in comparison to DCF & EDCF. FAMAC shows higher throughput and lesser avg. delay in comparison to other MAC protocols. It was also observed that in FAMAC, the throughput and avg. and-to-end delay remains unaffected by various fading environment. But in DCF and EDCF, those are affected by Rayleigh and Ricean fading environment.","PeriodicalId":187874,"journal":{"name":"2014 IEEE International Conference on Computational Intelligence and Computing Research","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128753982","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
扫码关注我们
求助内容：
应助结果提醒方式：