Pub Date : 2010-12-01DOI: 10.1109/ICCITECHN.2010.5723862
I. Jahangir, A. Das
Quaternary logic requires a dedicated comparator circuit besides the usual add/sub unit which may not be optimal due to several reasons. In this paper, we have thoroughly discussed various alternative expressions for equality operator which serves as the basis for quaternary comparator. Then we have derived the necessary equations for single qudit comparator and extended it to serial multi qudit comparator. We have also shown the equations and design of single stage parallel comparator where restriction of fan-in is sacrificed for constant speed. We have ended our discussion with the design of a logarithmic stage parallel comparator which can compute the comparator output within log2(n) time delay for n qudits.
{"title":"On the design of quaternary comparators","authors":"I. Jahangir, A. Das","doi":"10.1109/ICCITECHN.2010.5723862","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2010.5723862","url":null,"abstract":"Quaternary logic requires a dedicated comparator circuit besides the usual add/sub unit which may not be optimal due to several reasons. In this paper, we have thoroughly discussed various alternative expressions for equality operator which serves as the basis for quaternary comparator. Then we have derived the necessary equations for single qudit comparator and extended it to serial multi qudit comparator. We have also shown the equations and design of single stage parallel comparator where restriction of fan-in is sacrificed for constant speed. We have ended our discussion with the design of a logarithmic stage parallel comparator which can compute the comparator output within log2(n) time delay for n qudits.","PeriodicalId":149135,"journal":{"name":"2010 13th International Conference on Computer and Information Technology (ICCIT)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114292439","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 : 2010-12-01DOI: 10.1109/ICCITECHN.2010.5723893
S. U. Ahmed, M. Shahjahan, K. Murase
It is important to study the neural network (NN) when it falls into chaos, because brain dynamics involve chaos. In this paper, the several chaotic behaviors of supervised neural networks using Hurst Exponent (H), fractal dimension (FD) and bifurcation diagram are studied. The update rule for NN trained with back-propagation (BP) algorithm absorbs the function of the form x(1-x) which is responsible for exhibiting chaos in the output of the NN at increased learning rate. The H is computed with the time series obtained from the output of NN. One can comment on the classification of the network from the values of Hs. The chaotic dynamics for two bit parity, cancer, and diabetes problems are examined. The result is validated with the help of bifurcation diagram. It is found that the values of H are repositioned marginally depending on the size of NN. The effect of the size of NN on chaos is also investigated.
{"title":"Chaotic dynamics of supervised neural network","authors":"S. U. Ahmed, M. Shahjahan, K. Murase","doi":"10.1109/ICCITECHN.2010.5723893","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2010.5723893","url":null,"abstract":"It is important to study the neural network (NN) when it falls into chaos, because brain dynamics involve chaos. In this paper, the several chaotic behaviors of supervised neural networks using Hurst Exponent (H), fractal dimension (FD) and bifurcation diagram are studied. The update rule for NN trained with back-propagation (BP) algorithm absorbs the function of the form x(1-x) which is responsible for exhibiting chaos in the output of the NN at increased learning rate. The H is computed with the time series obtained from the output of NN. One can comment on the classification of the network from the values of Hs. The chaotic dynamics for two bit parity, cancer, and diabetes problems are examined. The result is validated with the help of bifurcation diagram. It is found that the values of H are repositioned marginally depending on the size of NN. The effect of the size of NN on chaos is also investigated.","PeriodicalId":149135,"journal":{"name":"2010 13th International Conference on Computer and Information Technology (ICCIT)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129757954","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 : 2010-12-01DOI: 10.1109/ICCITECHN.2010.5723859
Faisal Mohsin
For various reasons in recent years the interest in building quantum computers has increased gradually. To do the calculations in quantum computer we need quantum arithmetic logic unit (ALU). The building block of quantum ALU is quantum adder. In quantum computer multivalued logic is possible. In this paper a generalized circuit has been proposed to build odd base multivalued quantum full adder. A novel approach has been taken to minimize the total no. of gates. Muthukrishnan-Stroud gates and quantum shift gates have been combined to achieve the minimal circuit.
{"title":"A novel method for the synthesis of odd base quantum full adder","authors":"Faisal Mohsin","doi":"10.1109/ICCITECHN.2010.5723859","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2010.5723859","url":null,"abstract":"For various reasons in recent years the interest in building quantum computers has increased gradually. To do the calculations in quantum computer we need quantum arithmetic logic unit (ALU). The building block of quantum ALU is quantum adder. In quantum computer multivalued logic is possible. In this paper a generalized circuit has been proposed to build odd base multivalued quantum full adder. A novel approach has been taken to minimize the total no. of gates. Muthukrishnan-Stroud gates and quantum shift gates have been combined to achieve the minimal circuit.","PeriodicalId":149135,"journal":{"name":"2010 13th International Conference on Computer and Information Technology (ICCIT)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126938715","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 : 2010-12-01DOI: 10.1109/ICCITECHN.2010.5723823
Md. Kowsar Hossain, Md. Amjad Hossain, M. Hashem, Md. Mohsin Ali
Quantum Evolutionary Algorithm (QEA) is an optimization algorithm based on the concept of quantum computing and Particle Swarm Optimization (PSO) algorithm is a population based intelligent search technique. Both these techniques have good performance to solve optimization problems. PSEQEA combines the PSO with QEA to improve the performance of QEA and it can solve single objective optimization problem efficiently and effectively. In this paper, PSEQEA is studied to solve multi-objective Optimization (MO) problems. Some well-known non-trivial functions are used to observe the performance of PSEQEA to detect the Pareto optimal points and the shape of the Pareto front using both Fixed Weighted Aggregation method and Adaptive Weighted Aggregation method. Moreover, Vector Evaluated PSEQEA (VEPSEQEA) borrows concept from Schaffer's Vector Evaluated Genetic Algorithm (VEGA) that can also cope with MO problems. Simulation results show that PSEQEA and VEPSEQEA perform better than PSO and VEPSO to discover the Pareto frontier.
{"title":"Quantum Evolutionary Algorithm based on Particle Swarm theory in multiobjective problems","authors":"Md. Kowsar Hossain, Md. Amjad Hossain, M. Hashem, Md. Mohsin Ali","doi":"10.1109/ICCITECHN.2010.5723823","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2010.5723823","url":null,"abstract":"Quantum Evolutionary Algorithm (QEA) is an optimization algorithm based on the concept of quantum computing and Particle Swarm Optimization (PSO) algorithm is a population based intelligent search technique. Both these techniques have good performance to solve optimization problems. PSEQEA combines the PSO with QEA to improve the performance of QEA and it can solve single objective optimization problem efficiently and effectively. In this paper, PSEQEA is studied to solve multi-objective Optimization (MO) problems. Some well-known non-trivial functions are used to observe the performance of PSEQEA to detect the Pareto optimal points and the shape of the Pareto front using both Fixed Weighted Aggregation method and Adaptive Weighted Aggregation method. Moreover, Vector Evaluated PSEQEA (VEPSEQEA) borrows concept from Schaffer's Vector Evaluated Genetic Algorithm (VEGA) that can also cope with MO problems. Simulation results show that PSEQEA and VEPSEQEA perform better than PSO and VEPSO to discover the Pareto frontier.","PeriodicalId":149135,"journal":{"name":"2010 13th International Conference on Computer and Information Technology (ICCIT)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126672350","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 : 2010-12-01DOI: 10.1109/ICCITECHN.2010.5723909
Badrun Nahar, Md Liakot Ali
In today's world, ensuring security for important locations is a burning issue. Different surveillance methodologies such as alarm system, CCTV, PC based video system are used to ensure this security. But using all these systems, it is not possible for a person to monitor the security of his or her desired location when they are outside. Now-a-days anybody can communicate with anyone at anytime around the globe with the help of mobile phone technology. By keeping the technological facility of mobile phone in mind, a mobile phone based surveillance system has been described in this paper. This paper will give a solution for the security of corporate houses as well as corporate personnel. In this system there are server and client end. Server will store images being captured by the webcam of an important location. Then based on clients request sending from their mobile phone to the server, clients will be able to view the images from their mobile phone that is stored in the server. Clients are also able to move the webcam by sending control instruction from their mobile phone to view the images of their desired position. The developed system has been tested first using the GUI (emulator) designed by NetBeans IDE. It has also been tested using different mobile phones to see the images in real time and it provides the true sense of real mobility and security by accessing the desired location from the mobile phone anytime anywhere whenever wishes. This surveillance system can also be implemented for other handheld devices like PDA.
{"title":"Development of mobile phone based surveillance system","authors":"Badrun Nahar, Md Liakot Ali","doi":"10.1109/ICCITECHN.2010.5723909","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2010.5723909","url":null,"abstract":"In today's world, ensuring security for important locations is a burning issue. Different surveillance methodologies such as alarm system, CCTV, PC based video system are used to ensure this security. But using all these systems, it is not possible for a person to monitor the security of his or her desired location when they are outside. Now-a-days anybody can communicate with anyone at anytime around the globe with the help of mobile phone technology. By keeping the technological facility of mobile phone in mind, a mobile phone based surveillance system has been described in this paper. This paper will give a solution for the security of corporate houses as well as corporate personnel. In this system there are server and client end. Server will store images being captured by the webcam of an important location. Then based on clients request sending from their mobile phone to the server, clients will be able to view the images from their mobile phone that is stored in the server. Clients are also able to move the webcam by sending control instruction from their mobile phone to view the images of their desired position. The developed system has been tested first using the GUI (emulator) designed by NetBeans IDE. It has also been tested using different mobile phones to see the images in real time and it provides the true sense of real mobility and security by accessing the desired location from the mobile phone anytime anywhere whenever wishes. This surveillance system can also be implemented for other handheld devices like PDA.","PeriodicalId":149135,"journal":{"name":"2010 13th International Conference on Computer and Information Technology (ICCIT)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133118819","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 : 2010-12-01DOI: 10.1109/ICCITECHN.2010.5723850
M. Rana
Single carrier-frequency division multiple access (SC-FDMA) utilizes single carrier modulation at the transmitter and frequency domain equalization at the receiver. It has almost similar performance and essentially the same overall structure of an orthogonal frequency division multiple access (OFDMA) system with low peak to average power ratio (PAPR). Recently, the SC-FDMA has drawn great attention as an attractive alternative to OFDMA, in the uplink communications where lower PAPR greatly benefits the mobile terminal in terms of manufacturing cost as well as transmit power efficiency. Such power efficiency can provide considerable performance improvements in future wireless communication networks. This article outlines the basic principles of SC-FDMA systems with different types of sub-carrier mapping schemes. Simulation results demonstrate the performance of different sub-carrier mapping schemes under ideal and pedestrian channel condition.
{"title":"Performance of sub-carrier mapping in single carrier FDMA systems under radio mobile channels","authors":"M. Rana","doi":"10.1109/ICCITECHN.2010.5723850","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2010.5723850","url":null,"abstract":"Single carrier-frequency division multiple access (SC-FDMA) utilizes single carrier modulation at the transmitter and frequency domain equalization at the receiver. It has almost similar performance and essentially the same overall structure of an orthogonal frequency division multiple access (OFDMA) system with low peak to average power ratio (PAPR). Recently, the SC-FDMA has drawn great attention as an attractive alternative to OFDMA, in the uplink communications where lower PAPR greatly benefits the mobile terminal in terms of manufacturing cost as well as transmit power efficiency. Such power efficiency can provide considerable performance improvements in future wireless communication networks. This article outlines the basic principles of SC-FDMA systems with different types of sub-carrier mapping schemes. Simulation results demonstrate the performance of different sub-carrier mapping schemes under ideal and pedestrian channel condition.","PeriodicalId":149135,"journal":{"name":"2010 13th International Conference on Computer and Information Technology (ICCIT)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132188813","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 : 2010-12-01DOI: 10.1109/ICCITECHN.2010.5723851
Thomas Kvamme, S. Ahmed
A novel SQL Tunnelling system to allow communication with an SQL database is developed by utilising the standard Internet protocol HTTP. The communication with the database is allowed by a client interacting with a Web Service running on a standard off-the-shelf HTTP Server. With this tunnelling system, access to a database can be provided without providing access to the database native communication port. This can be useful if a database application needs to be made available on insecure networks, such as Internet, or if firewalls between client and server does not accept anything other than the normal HTTP communications.
{"title":"SQL Tunnelling through HTTP","authors":"Thomas Kvamme, S. Ahmed","doi":"10.1109/ICCITECHN.2010.5723851","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2010.5723851","url":null,"abstract":"A novel SQL Tunnelling system to allow communication with an SQL database is developed by utilising the standard Internet protocol HTTP. The communication with the database is allowed by a client interacting with a Web Service running on a standard off-the-shelf HTTP Server. With this tunnelling system, access to a database can be provided without providing access to the database native communication port. This can be useful if a database application needs to be made available on insecure networks, such as Internet, or if firewalls between client and server does not accept anything other than the normal HTTP communications.","PeriodicalId":149135,"journal":{"name":"2010 13th International Conference on Computer and Information Technology (ICCIT)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132287197","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 : 2010-12-01DOI: 10.1109/ICCITECHN.2010.5723910
J. Kamal, M. S. Hasan, A. Carrington, Hongnian Yu
Although more than a decade of research has been done but pure general-purpose MANET is still not available rather than few prototypes within laboratory due to both technical and socio-economic point of view. Lacking in appropriate guidelines for realistic user traces, mobility models, routing protocols and considering real-life challenges, it is difficult to reproduce any typical scenario in reality apart from simulation. In this paper, difficulties faced to regenerate real-life scenarios have been discussed to clearly identify the gaps in simulation and real-time experiments. Four laptops are used in an open field environment for different scenarios to evaluate a TCP based streaming video application using real OLSR implementation within a IEEE 802.11g wireless network. Corresponding simulations are performed in ns-2 based on the realistic setup parameters achieved from real experiments and finally a comprehensive analysis identifies the generic gaps between these two approaches to evaluate network protocols. Simulation results show better performance than the real-life results due to differ in external influences and protocol implementation although maintaining realistic simulation setups.
{"title":"Lessons learned from real MANET experiments and simulation-based evaluation of UDP and TCP","authors":"J. Kamal, M. S. Hasan, A. Carrington, Hongnian Yu","doi":"10.1109/ICCITECHN.2010.5723910","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2010.5723910","url":null,"abstract":"Although more than a decade of research has been done but pure general-purpose MANET is still not available rather than few prototypes within laboratory due to both technical and socio-economic point of view. Lacking in appropriate guidelines for realistic user traces, mobility models, routing protocols and considering real-life challenges, it is difficult to reproduce any typical scenario in reality apart from simulation. In this paper, difficulties faced to regenerate real-life scenarios have been discussed to clearly identify the gaps in simulation and real-time experiments. Four laptops are used in an open field environment for different scenarios to evaluate a TCP based streaming video application using real OLSR implementation within a IEEE 802.11g wireless network. Corresponding simulations are performed in ns-2 based on the realistic setup parameters achieved from real experiments and finally a comprehensive analysis identifies the generic gaps between these two approaches to evaluate network protocols. Simulation results show better performance than the real-life results due to differ in external influences and protocol implementation although maintaining realistic simulation setups.","PeriodicalId":149135,"journal":{"name":"2010 13th International Conference on Computer and Information Technology (ICCIT)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123797751","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 : 2010-12-01DOI: 10.1109/ICCITECHN.2010.5723829
Kazi Shah Nawaz Ripon, K. Glette, M. Høvin, J. Tørresen
In many real-world applications, the accurate number of clusters in the data set may be unknown in advance. In addition, clustering criteria are usually high dimensional, nonlinear and multi-model functions and most existing clustering algorithms are only able to achieve a clustering solution that locally optimizes them. Therefore, a single clustering criterion sometimes fails to identify all clusters in a data set successfully. This paper presents a novel multi-objective evolutionary clustering algorithm based on adaptive local search that mitigates the above disadvantages of existing clustering algorithms. Unlike the conventional local search, the proposed adaptive local search scheme automatically determines whether local search is used in an evolutionary cycle or not. Experimental results on several artificial and real data sets demonstrate that the proposed algorithm can identify the accurate number of clusters in the data sets automatically and simultaneously achieves a high quality clustering solution. The superiority of the proposed algorithm over some single-objective clustering algorithms and existing multi-objective evolutionary clustering algorithms is also confirmed by the experimental results.
{"title":"Evolutionary multi-objective clustering with adaptive local search","authors":"Kazi Shah Nawaz Ripon, K. Glette, M. Høvin, J. Tørresen","doi":"10.1109/ICCITECHN.2010.5723829","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2010.5723829","url":null,"abstract":"In many real-world applications, the accurate number of clusters in the data set may be unknown in advance. In addition, clustering criteria are usually high dimensional, nonlinear and multi-model functions and most existing clustering algorithms are only able to achieve a clustering solution that locally optimizes them. Therefore, a single clustering criterion sometimes fails to identify all clusters in a data set successfully. This paper presents a novel multi-objective evolutionary clustering algorithm based on adaptive local search that mitigates the above disadvantages of existing clustering algorithms. Unlike the conventional local search, the proposed adaptive local search scheme automatically determines whether local search is used in an evolutionary cycle or not. Experimental results on several artificial and real data sets demonstrate that the proposed algorithm can identify the accurate number of clusters in the data sets automatically and simultaneously achieves a high quality clustering solution. The superiority of the proposed algorithm over some single-objective clustering algorithms and existing multi-objective evolutionary clustering algorithms is also confirmed by the experimental results.","PeriodicalId":149135,"journal":{"name":"2010 13th International Conference on Computer and Information Technology (ICCIT)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128009605","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 : 2010-12-01DOI: 10.1109/ICCITECHN.2010.5723915
Md.Mosaddek Khan, M. Mamun-Or-Rashid
The Routing Approaches in Mobile Ad-hoc Network have almost entered the saturated arena. But still there are available options of perfection in this meadow. The task of improving the clustering technique is one of the fields which is under rated as a research topic for further improvement of routing. Clustering based MANET routing protocols, which are popular in terms of efficiency, simplicity and usability mostly use circular based clustering techniques. And the election of cluster head is done through the use conventional approaches. This particular paper is mainly focused to launch a new-fangled clustering technique through which it is possible to improve the routing performance of existing protocols. Another important aspect of this paper is to provide a cluster head selection algorithm which can effectively maintain the clusters and provides more stability. Proposed clustering idea is useful for geographically related nodes effectively in different turf of routing. To maintain the clusters and their stability, it provides a new idea to select cluster head within the cluster, also the election of secondary cluster head for avoiding further election immediately after the unavailability of primary cluster head. This idea is evaluated in network simulator and it outperforms the existing clustering techniques.
{"title":"A stable clustering method for efficient geographic routing in Mobile Ad-Hoc Networks","authors":"Md.Mosaddek Khan, M. Mamun-Or-Rashid","doi":"10.1109/ICCITECHN.2010.5723915","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2010.5723915","url":null,"abstract":"The Routing Approaches in Mobile Ad-hoc Network have almost entered the saturated arena. But still there are available options of perfection in this meadow. The task of improving the clustering technique is one of the fields which is under rated as a research topic for further improvement of routing. Clustering based MANET routing protocols, which are popular in terms of efficiency, simplicity and usability mostly use circular based clustering techniques. And the election of cluster head is done through the use conventional approaches. This particular paper is mainly focused to launch a new-fangled clustering technique through which it is possible to improve the routing performance of existing protocols. Another important aspect of this paper is to provide a cluster head selection algorithm which can effectively maintain the clusters and provides more stability. Proposed clustering idea is useful for geographically related nodes effectively in different turf of routing. To maintain the clusters and their stability, it provides a new idea to select cluster head within the cluster, also the election of secondary cluster head for avoiding further election immediately after the unavailability of primary cluster head. This idea is evaluated in network simulator and it outperforms the existing clustering techniques.","PeriodicalId":149135,"journal":{"name":"2010 13th International Conference on Computer and Information Technology (ICCIT)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125829795","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
扫码关注我们
求助内容：
应助结果提醒方式：