call for paper 2012, hard copy of journal, research paper publishing, where to publish research paper,
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals,
yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal
There are number of cluster based routing algorithms in mobile ad hoc networks. Since ad hoc networks are not accompanied by fixed access points, efficient routing is a must for such networks. Clustering approach is applied in mobile ad hoc network because clusters are more easily manageable and are more viable. It consists of segregating the given network into several reasonable clusters by using a clustering algorithm. By performing clustering we elect a worthy node from the cluster as the cluster head in such a way that we strive to reduce the management overheads and thus increasing the efficiency of routing. As for the fact that nodes in mobile ad hoc network have frequent host change and frequent topology change routing plays an important role for maintenance and backup mechanism to stabilize network performance. This paper aims to review the previous research papers and provide a survey on the various cluster based routing protocols in mobile ad hoc network. This paper presents analytical study of cluster based routing algorithms from literature. Index Terms— Ad- hoc networks, Cluster head, Clustering, Protocol, Route selection.
The novel applications of sensor networks impose some requirements in wireless sensor network design. With the energy efficiency and lifetime awareness, the throughput and network delayalso required to support emerging applications of sensor networks. In this paper, we propose
throughput and network delay aware intra-cluster routing protocol. We introduce the back-up links in the intra-cluster communication path. The link throughput, communication delay, packet loss ratio, interference, residual energy and node distance are the considered factors in finding efficient path of data communication among the sensor nodes within the cluster. The
simulation result shows the higher throughput and lower average packet delay rate for the proposed routing protocol than the existing benchmarks. The proposed routing protocol also shows energy efficiency and lifetime awareness with better connectivity rate.
AN OPTIMIZED MECHANISM FOR ADAPTIVE AND DYNAMIC POLICY BASED HANDOVER IN CLUS...pijans
On-going revolution in ever-improving wireless communication enforces the necessity of a self configuring,
rapidly deployable and infrastructure less network. MANET is such an autonomous wireless network that
meets the requirements. At the same time MANET’s random behavior and absence of any central
intelligence to gather unambiguous knowledge about user contexts complexes QoS maintenance and
hampers proper utilization of network resources resulting into unnecessary handovers. In past, few policy
driven handover approaches have been proposed for MANET but none of them explores a comprehensive
policy design. Therefore in this paper we propose an adaptive and optimized policy based handover
mechanism which is based on explicitly designed policies like load balancing, service discovery and next
hop selection .Efficient procedures for these policies are also explored .This work predicts the high time of
handover need on the basis of application specific needs of individual freely roaming mobile nodes,
avoiding unnecessary handovers and provides efficient handover procedure with optimized resource
consumption, reduced latency and interruption time.
Algorithmic Construction of Optimal and Load Balanced Clusters in Wireless Se...M H
This paper proposes a clustering algorithm - Ba-lanced Minimum Radius Clustering (BMRC) - for use in large scale, distributed Wireless Sensor Networks (WSN). Cluster balancing is an intractable problem to solve in a distributed manner, and distribution is important, by reason of both avoiding specialised node vulnerability and minimising message overhead.The BMRC algorithm described here distributes several of the cluster balancing functions to the cluster-heads. In proposing this algorithm, several tentative claims have been made for it, namely that it is suitable for arbitrary number of cluster heads; that its pecifies a way to elect cluster heads and use them to create the local models; that it accomplishes optimal balanced clusters in distributed manner; that it is scalable and it uses the number-of-hops as a clustering parameter; that it is energy efficient. These claims were studied and verified by simulation.
An Adaptive Cluster Head Election Algorithm for Heterogeneous Mobile Ad-hoc N...IJLT EMAS
Mobile ad-hoc network characterized as a homogenous and heterogeneous on the basis of node capabilities. Heterogeneity property may make issues for mobile ad-hoc network in context of coverage area, link stability, lifetime etc. To resolve these issues, require a mechanism to adapt different characteristics and make decision for smooth functioning. Heterogeneity also leads effective routing problem that occurs instability in route or path. Though to make effective routing in this situation, efficient clustering algorithm may be apply. In this paper, the effects of heterogeneity property are studied and analyzed. A cluster head algorithm is also suggested to deal with the effects of the property. Suggested algorithm is simulated in network simulation and performance is evaluated in context of computation cost, lifetime and number of clusters.
Abstract
Routing in MANET is one of the most researched areas in the field of networking; moreover it is one of the most complex tasks.
RF based transmission techniques are widely used in wireless communication networks. Due to the availability of sophisticated
optical components, the networking domain could be merged with optical domain to have a higher capacity and better
transmission. So in order to overcome the disadvantages of RF domain, we can use light as a medium between nodes. i.e, FSOMANET.
This work is aimed at designing an efficient routing in FSO MANET. This paper proposes a method to find the stable
path as well as stable nodes between the source and destination. The steps are as follows. i) Topology Management ii) Trust Level
Calculation iii) Award and Reward ranking iv)Path Selection. The proposed technique will be implemented in the working
platform of MATLAB.
Keywords: Mobile Ad Hoc Network, Free Space Optics, Link Stability, Delay Tolerant Networking, Clustering
Technique, Award and Reward
Interpolation Techniques for Building a Continuous Map from Discrete Wireless...M H
Wireless sensor networks (WSNs) typically gather data at a discrete number of locations. However, it is desirable to be able to design applications and reason about the data in more abstract forms than in points of data. By bestowing the ability to predict inter-node values upon the network, it is proposed that it will become possible to build applications that are unaware of the concrete reality of sparse data. This interpolation capability is realised as a service of the network. In this paper, the ‘map’ style of presentation has been identified as a suitable sense data visualisation format. Although map generation is essentially a problem of interpolation between points, a new WSN service, called the map generation service, which is based on a Shepard interpolation method, is presented. A modified Shepard method that aims to deal with the special characteristics of WSNs is proposed. It requires small storage, can be localised and integrates the information about the application domain to further reduce the map generation cost and improve the mapping accuracy. Flood management application is considered to demonstrate how MGS-generated maps can be used in various applications. Empirical analysis has shown that the map generation service is an accurate, a flexible and an efficient method.
There are number of cluster based routing algorithms in mobile ad hoc networks. Since ad hoc networks are not accompanied by fixed access points, efficient routing is a must for such networks. Clustering approach is applied in mobile ad hoc network because clusters are more easily manageable and are more viable. It consists of segregating the given network into several reasonable clusters by using a clustering algorithm. By performing clustering we elect a worthy node from the cluster as the cluster head in such a way that we strive to reduce the management overheads and thus increasing the efficiency of routing. As for the fact that nodes in mobile ad hoc network have frequent host change and frequent topology change routing plays an important role for maintenance and backup mechanism to stabilize network performance. This paper aims to review the previous research papers and provide a survey on the various cluster based routing protocols in mobile ad hoc network. This paper presents analytical study of cluster based routing algorithms from literature. Index Terms— Ad- hoc networks, Cluster head, Clustering, Protocol, Route selection.
The novel applications of sensor networks impose some requirements in wireless sensor network design. With the energy efficiency and lifetime awareness, the throughput and network delayalso required to support emerging applications of sensor networks. In this paper, we propose
throughput and network delay aware intra-cluster routing protocol. We introduce the back-up links in the intra-cluster communication path. The link throughput, communication delay, packet loss ratio, interference, residual energy and node distance are the considered factors in finding efficient path of data communication among the sensor nodes within the cluster. The
simulation result shows the higher throughput and lower average packet delay rate for the proposed routing protocol than the existing benchmarks. The proposed routing protocol also shows energy efficiency and lifetime awareness with better connectivity rate.
AN OPTIMIZED MECHANISM FOR ADAPTIVE AND DYNAMIC POLICY BASED HANDOVER IN CLUS...pijans
On-going revolution in ever-improving wireless communication enforces the necessity of a self configuring,
rapidly deployable and infrastructure less network. MANET is such an autonomous wireless network that
meets the requirements. At the same time MANET’s random behavior and absence of any central
intelligence to gather unambiguous knowledge about user contexts complexes QoS maintenance and
hampers proper utilization of network resources resulting into unnecessary handovers. In past, few policy
driven handover approaches have been proposed for MANET but none of them explores a comprehensive
policy design. Therefore in this paper we propose an adaptive and optimized policy based handover
mechanism which is based on explicitly designed policies like load balancing, service discovery and next
hop selection .Efficient procedures for these policies are also explored .This work predicts the high time of
handover need on the basis of application specific needs of individual freely roaming mobile nodes,
avoiding unnecessary handovers and provides efficient handover procedure with optimized resource
consumption, reduced latency and interruption time.
Algorithmic Construction of Optimal and Load Balanced Clusters in Wireless Se...M H
This paper proposes a clustering algorithm - Ba-lanced Minimum Radius Clustering (BMRC) - for use in large scale, distributed Wireless Sensor Networks (WSN). Cluster balancing is an intractable problem to solve in a distributed manner, and distribution is important, by reason of both avoiding specialised node vulnerability and minimising message overhead.The BMRC algorithm described here distributes several of the cluster balancing functions to the cluster-heads. In proposing this algorithm, several tentative claims have been made for it, namely that it is suitable for arbitrary number of cluster heads; that its pecifies a way to elect cluster heads and use them to create the local models; that it accomplishes optimal balanced clusters in distributed manner; that it is scalable and it uses the number-of-hops as a clustering parameter; that it is energy efficient. These claims were studied and verified by simulation.
An Adaptive Cluster Head Election Algorithm for Heterogeneous Mobile Ad-hoc N...IJLT EMAS
Mobile ad-hoc network characterized as a homogenous and heterogeneous on the basis of node capabilities. Heterogeneity property may make issues for mobile ad-hoc network in context of coverage area, link stability, lifetime etc. To resolve these issues, require a mechanism to adapt different characteristics and make decision for smooth functioning. Heterogeneity also leads effective routing problem that occurs instability in route or path. Though to make effective routing in this situation, efficient clustering algorithm may be apply. In this paper, the effects of heterogeneity property are studied and analyzed. A cluster head algorithm is also suggested to deal with the effects of the property. Suggested algorithm is simulated in network simulation and performance is evaluated in context of computation cost, lifetime and number of clusters.
Abstract
Routing in MANET is one of the most researched areas in the field of networking; moreover it is one of the most complex tasks.
RF based transmission techniques are widely used in wireless communication networks. Due to the availability of sophisticated
optical components, the networking domain could be merged with optical domain to have a higher capacity and better
transmission. So in order to overcome the disadvantages of RF domain, we can use light as a medium between nodes. i.e, FSOMANET.
This work is aimed at designing an efficient routing in FSO MANET. This paper proposes a method to find the stable
path as well as stable nodes between the source and destination. The steps are as follows. i) Topology Management ii) Trust Level
Calculation iii) Award and Reward ranking iv)Path Selection. The proposed technique will be implemented in the working
platform of MATLAB.
Keywords: Mobile Ad Hoc Network, Free Space Optics, Link Stability, Delay Tolerant Networking, Clustering
Technique, Award and Reward
Interpolation Techniques for Building a Continuous Map from Discrete Wireless...M H
Wireless sensor networks (WSNs) typically gather data at a discrete number of locations. However, it is desirable to be able to design applications and reason about the data in more abstract forms than in points of data. By bestowing the ability to predict inter-node values upon the network, it is proposed that it will become possible to build applications that are unaware of the concrete reality of sparse data. This interpolation capability is realised as a service of the network. In this paper, the ‘map’ style of presentation has been identified as a suitable sense data visualisation format. Although map generation is essentially a problem of interpolation between points, a new WSN service, called the map generation service, which is based on a Shepard interpolation method, is presented. A modified Shepard method that aims to deal with the special characteristics of WSNs is proposed. It requires small storage, can be localised and integrates the information about the application domain to further reduce the map generation cost and improve the mapping accuracy. Flood management application is considered to demonstrate how MGS-generated maps can be used in various applications. Empirical analysis has shown that the map generation service is an accurate, a flexible and an efficient method.
A wireless network consists of a set of wireless nodes forming the network. The bandwidth allocation scheme used in wireless networks should automatically adapt to the network’s environments, where issues such as mobility are highly variable. This paper proposes a method to distribute the bandwidth for wireless network nodes depending on dynamic methodology;this methodology uses intelligent clustering techniques that depend on the student’s distribution at the university campus, rather than the classical allocation methods. We propose a clustering-based approach to solve the dynamic bandwidth allocation problem in wireless networks, enabling wireless nodes to adapt their bandwidth allocation according to the changing number of expected users over time. The proposed solution allows the optimal online bandwidth allocation based on the data extracted from the lectures timetable, and fed to the wireless network control nodes, allowing them to adapt to their environment. The environment data is processed and clustered using the KMeans clustering algorithm to identify potential peak times for every wireless node. The proposed solution feasibility is tested by applying the approach to a case study, at the Arab American University campus wireless network.
Present new mechanisms for modelling multiple interfaces on a node, support for interference-limited links and a frame-work for modelling complex applications running on the nodes. Furthermore, provide an overview of concrete use cases where the simulator has been successfully exploited to study a variety of aspects related to opportunistic, message-based communications. Node movement is implemented by movement models. These are either synthetic models or existing movement traces. Connectivity between the nodes is based on their location, communication range and the bit-rate. The routing function is implemented by routing modules that decide which messages to forward over existing contacts. Finally, the messages themselves are generated either through event generators that generate random traffic between the nodes, or through applications that generate traffic based on application interactions. The main functions of the simulator are the modelling of node movement, inter-node contacts using various interfaces, routing, message handling and application interactions. Result collection and analysis are done through visualization, reports and post-processing tools.
Information extraction from sensor networks using the Watershed transform alg...M H
Wireless sensor networks are an effective tool to provide fine resolution monitoring of the physical environment. Sensors generate continuous streams of data, which leads to several computational challenges. As sensor nodes become increasingly active devices, with more processing and communication resources, various methods of distributed data processing and sharing become feasible. The challenge is to extract information from the gathered sensory data with a specified level of accuracy in a timely and power-efficient approach. This paper presents a new solution to distributed information extraction that makes use of the morphological Watershed algorithm. The Watershed algorithm dynamically groups sensor nodes into homogeneous network segments with respect to their topological relationships and their sensing-states. This setting allows network programmers to manipulate groups of spatially distributed data streams instead of individual nodes. This is achieved by using network segments as programming abstractions on which various query processes can be executed. Aiming at this purpose, we present a reformulation of the global Watershed algorithm. The modified Watershed algorithm is fully asynchronous, where sensor nodes can autonomously process their local data in parallel and in collaboration with neighbouring nodes. Experimental evaluation shows that the presented solution is able to considerably reduce query resolution cost without scarifying the quality of the returned results. When compared to similar purpose schemes, such as “Logical Neighborhood”, the proposed approach reduces the total query resolution overhead by up to 57.5%, reduces the number of nodes involved in query resolution by up to 59%, and reduces the setup convergence time by up to 65.1%.
Map as a Service: A Framework for Visualising and Maximising Information Retu...M H
This paper presents a distributed information extraction and visualisation service, called the mapping service, for maximising information return from large-scale wireless sensor networks. Such a service would greatly simplify the production of higher-level, information-rich, representations suitable for informing other network services and the delivery of field information visualisations. The mapping service utilises a blend of inductive and deductive models to map sense data accurately using externally available knowledge. It utilises the special characteristics of the application domain to render visualisations in a map format that are a precise reflection of the concrete reality. This service is suitable for visualising an arbitrary number of sense modalities. It is capable of visualising from multiple independent types of the sense data to overcome the limitations of generating visualisations from a single type of sense modality. Furthermore, the mapping service responds dynamically to changes in the environmental conditions, which may affect the visualisation performance by continuously updating the application domain model in a distributed manner. Finally, a distributed self-adaptation function is proposed with the goal of saving more power and generating more accurate data visualisation. We conduct comprehensive experimentation to evaluate the performance of our mapping service and show that it achieves low communication overhead, produces maps of high fidelity, and further minimises the mapping predictive error dynamically through integrating the application domain model in the mapping service.
Improvement at Network Planning using Heuristic Algorithm to Minimize Cost of...Yayah Zakaria
Wireless Mesh Networks (WMN) consists of wireless stations that are connected with each other in a semi-static configuration. Depending on the configuration of a WMN, different paths between nodes offer different levels of efficiency. One areas of research with regard to WMN is cost minimization. A Modified Binary Particle Swarm Optimization (MBPSO) approach was used to optimize cost. However, minimized cost does not
guarantee network performance. This paper thus, modified the minimization function to take into consideration the distance between the different nodes so as to enable better performance while maintaining cost balance. The results were positive with the PDR showing an approximate increase of 17.83% whereas the E2E delay saw an approximate decrease of 8.33%.
Adaptive Routing in Wireless Sensor Networks: QoS Optimisation for Enhanced A...M H
One of the key challenges for research in wireless sensor networks is the development of routing protocols that provide application-specific service guarantees. This paper presents a new cluster-based Route Optimisation and Load-balancing protocol, called ROL, that uses various quality of service (QoS) metrics to meet application requirements. ROL combines several application requirements, specifically it attempts to provide an inclusive solution to prolong network life, provide timely message delivery and improve network robustness. It uses a combination of routing metrics that can be configured according to the priorities of user-level applications to improve overall network performance. To this end, an optimisation tool for balancing the communication resources for the constraints and priorities of user applications has been developed and Nutrient-flow-based Distributed Clustering (NDC), an algorithm for load balancing is proposed. NDC works seamlessly with any clustering algorithm to equalise, as far as possible, the diameter and the membership of clusters. This paper presents simulation results to show that ROL/NDC gives a higher network lifetime than other similar schemes, such Mires++. In simulation, ROL/NDC maintains a maximum of 7\% variation from the optimal cluster population, reduces the total number of set-up messages by up to 60%, reduces the end-to-end delay by up to 56%, and enhances the data delivery ratio by up to 0.98% compared to Mires++.
An Overview of Information Extraction from Mobile Wireless Sensor NetworksM H
Information Extraction (IE) is a key research area within the field of Wireless Sensor Networks (WSNs). It has been characterised in a variety of ways, ranging from the description of its purposes, to reasonably abstract models of its processes and components. There has been only a handful of papers addressing IE over mobile WSNs directly, these dealt with individual mobility related problems as the need arises. This paper is presented as a tutorial that takes the reader from the point of identifying data about a dynamic (mobile) real world problem, relating the data back to the world from which it was collected, and finally discovering what is in the data. It covers the entire process with special emphasis on how to exploit mobility in maximising information return from a mobile WSN. We present some challenges introduced by mobility on the IE process as well as its effects on the quality of the extracted information. Finally, we identify future research directions facing the development of efficient IE approaches for WSNs in the presence of mobility.
PERFORMANCE STUDY AND SIMULATION OF AN ANYCAST PROTOCOL FOR WIRELESS MOBILE A...ijwmn
This paper conducts a detailed simulation study of stateless anycast routing in a mobile wireless ad hoc
network. The model covers all the fundamental aspects of such networks with a routing mechanism using
a scheme of orientation-dependent inter-node communication links. The simulation system Winsim is used
which explicitly represents parallelism of events and processes in the network. The purpose of these
simulations is to investigate the effect of node’s maximum speed, and different TTL over the network
performance under two different scenarios. Simulation study investigates five practically important
performance metrics of a wireless mobile ad hoc network and shows the dependence of this metrics on
the transmission radius, link availability, and maximal possible node speed
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Communication synchronization in cluster based wireless sensor network a re...eSAT Journals
Abstract A wireless sensor network is acquiring more popularity in different sectors. A scalable, low latency and energy efficient are desire challenges that should meet by wireless sensor network. Clustering permits sensors to systematically communicate among clusters. Cluster based sensor network satisfies these challenges as it provides flexible, energy saving and QoS. The communication efficiency and network performance degrades if the interaction between inter-cluster and intra-cluster communication are not managed properly. The proposed work uses two approaches to solve this problem. At aiming low packet delay and high throughput first approach uses cycle- based synchronous scheduling. By completely removing necessity of communication synchronization second approach send packets with no synchronization delay. The combined scheme can take benefit of both approaches. Keywords: Wireless sensor network, clustering, communication synchronization, QoS.
Simulation Issues in Wireless Sensor Networks: A SurveyM H
This paper presents a survey of simulation tools and systems for wireless sensor networks. Wireless sensor network modelling and simulation methodologies are presented for each system alongside judgments concerning their relative ease of use and accuracy. Finally, we propose a mixed-mode simulation methodology that integrates a simulated environment with real wireless sensor network testbed hardware in order to improve both the accuracy and scalability of results when evaluating different prototype designs and systems.
Information Extraction from Wireless Sensor Networks: System and ApproachesM H
Recent advances in wireless communication have made it possible to develop low-cost, and low power Wireless Sensor Networks (WSN). The WSN can be used for several application areas (e.g., habitat monitoring, forest fire detection, and health care). WSN Information Extraction (IE) techniques can be classified into four categories depending on the factors that drive data acquisition: event-driven, time-driven, query-based, and hybrid. This paper presents a survey of the state-of-the-art IE techniques in WSNs. The benefits and shortcomings of different IE approaches are presented as motivation for future work into automatic hybridization and adaptation of IE mechanisms.
Determination and comparison rate of expression markers of osteoblast derived...IJERD Editor
Nowadays high accident rates, fractures leading to permanent bone disorders and the impossibility of bone transplant have made scientists to look for new methods of repairing injured bones. Considering the application of stem cells in bone tissue engineering, there exists the necessity to investigate various culture methods and suitable fields and scaffolds. Thus, we decided to induce adipose-derived stem cells into osteoblast cells in two systems of pellet culture and monolayer and compare osteogenic markers. Methods: Stem cells have been separated via mechanical and enzymatic methods and cultured in monolayer and pellet culture models with osteogenic medium. Then, RNA was separated from differentiated cells, complementary DNA (cDNA) was synthesized and amplified. Polymerase chain reaction (PCR) product was transferred to electrophoresis gel. The intensity of the bands was measured by Image-J software and analyzed by SPSS.
The Implementation Of Concept Main Map In Basic Calculation Of Engineering Su...IJERD Editor
This research began from problem in spacious about teaching and learning by doing where is the method learning is not effective because used descriptive subject mater with writing on black board or descriptive by essay. In order that is not efficient and effective in used teaching and the student can not comprenship understand? With this method will hope can handle it. The used method in this research is classroom action and focus at pump and compressor subject mater in Basic Calculation of Engineering subject. This research was doing in Makassar State University with subject 15 students at machine department. The instrument is used test, interview, observation, and spacious writed. In this learning method is development 5 concept, they are congcrete concept, abstract concept with example kongret concept, abstract concept, concept that process basic and concept with principle. The result of this research showing with mapping concept method in pump and compressor subject, that have improvement competition students at the last siklus II is 7,0 – 10 or 86,67% is mean the students can said that they are competent in learning.
A wireless network consists of a set of wireless nodes forming the network. The bandwidth allocation scheme used in wireless networks should automatically adapt to the network’s environments, where issues such as mobility are highly variable. This paper proposes a method to distribute the bandwidth for wireless network nodes depending on dynamic methodology;this methodology uses intelligent clustering techniques that depend on the student’s distribution at the university campus, rather than the classical allocation methods. We propose a clustering-based approach to solve the dynamic bandwidth allocation problem in wireless networks, enabling wireless nodes to adapt their bandwidth allocation according to the changing number of expected users over time. The proposed solution allows the optimal online bandwidth allocation based on the data extracted from the lectures timetable, and fed to the wireless network control nodes, allowing them to adapt to their environment. The environment data is processed and clustered using the KMeans clustering algorithm to identify potential peak times for every wireless node. The proposed solution feasibility is tested by applying the approach to a case study, at the Arab American University campus wireless network.
Present new mechanisms for modelling multiple interfaces on a node, support for interference-limited links and a frame-work for modelling complex applications running on the nodes. Furthermore, provide an overview of concrete use cases where the simulator has been successfully exploited to study a variety of aspects related to opportunistic, message-based communications. Node movement is implemented by movement models. These are either synthetic models or existing movement traces. Connectivity between the nodes is based on their location, communication range and the bit-rate. The routing function is implemented by routing modules that decide which messages to forward over existing contacts. Finally, the messages themselves are generated either through event generators that generate random traffic between the nodes, or through applications that generate traffic based on application interactions. The main functions of the simulator are the modelling of node movement, inter-node contacts using various interfaces, routing, message handling and application interactions. Result collection and analysis are done through visualization, reports and post-processing tools.
Information extraction from sensor networks using the Watershed transform alg...M H
Wireless sensor networks are an effective tool to provide fine resolution monitoring of the physical environment. Sensors generate continuous streams of data, which leads to several computational challenges. As sensor nodes become increasingly active devices, with more processing and communication resources, various methods of distributed data processing and sharing become feasible. The challenge is to extract information from the gathered sensory data with a specified level of accuracy in a timely and power-efficient approach. This paper presents a new solution to distributed information extraction that makes use of the morphological Watershed algorithm. The Watershed algorithm dynamically groups sensor nodes into homogeneous network segments with respect to their topological relationships and their sensing-states. This setting allows network programmers to manipulate groups of spatially distributed data streams instead of individual nodes. This is achieved by using network segments as programming abstractions on which various query processes can be executed. Aiming at this purpose, we present a reformulation of the global Watershed algorithm. The modified Watershed algorithm is fully asynchronous, where sensor nodes can autonomously process their local data in parallel and in collaboration with neighbouring nodes. Experimental evaluation shows that the presented solution is able to considerably reduce query resolution cost without scarifying the quality of the returned results. When compared to similar purpose schemes, such as “Logical Neighborhood”, the proposed approach reduces the total query resolution overhead by up to 57.5%, reduces the number of nodes involved in query resolution by up to 59%, and reduces the setup convergence time by up to 65.1%.
Map as a Service: A Framework for Visualising and Maximising Information Retu...M H
This paper presents a distributed information extraction and visualisation service, called the mapping service, for maximising information return from large-scale wireless sensor networks. Such a service would greatly simplify the production of higher-level, information-rich, representations suitable for informing other network services and the delivery of field information visualisations. The mapping service utilises a blend of inductive and deductive models to map sense data accurately using externally available knowledge. It utilises the special characteristics of the application domain to render visualisations in a map format that are a precise reflection of the concrete reality. This service is suitable for visualising an arbitrary number of sense modalities. It is capable of visualising from multiple independent types of the sense data to overcome the limitations of generating visualisations from a single type of sense modality. Furthermore, the mapping service responds dynamically to changes in the environmental conditions, which may affect the visualisation performance by continuously updating the application domain model in a distributed manner. Finally, a distributed self-adaptation function is proposed with the goal of saving more power and generating more accurate data visualisation. We conduct comprehensive experimentation to evaluate the performance of our mapping service and show that it achieves low communication overhead, produces maps of high fidelity, and further minimises the mapping predictive error dynamically through integrating the application domain model in the mapping service.
Improvement at Network Planning using Heuristic Algorithm to Minimize Cost of...Yayah Zakaria
Wireless Mesh Networks (WMN) consists of wireless stations that are connected with each other in a semi-static configuration. Depending on the configuration of a WMN, different paths between nodes offer different levels of efficiency. One areas of research with regard to WMN is cost minimization. A Modified Binary Particle Swarm Optimization (MBPSO) approach was used to optimize cost. However, minimized cost does not
guarantee network performance. This paper thus, modified the minimization function to take into consideration the distance between the different nodes so as to enable better performance while maintaining cost balance. The results were positive with the PDR showing an approximate increase of 17.83% whereas the E2E delay saw an approximate decrease of 8.33%.
Adaptive Routing in Wireless Sensor Networks: QoS Optimisation for Enhanced A...M H
One of the key challenges for research in wireless sensor networks is the development of routing protocols that provide application-specific service guarantees. This paper presents a new cluster-based Route Optimisation and Load-balancing protocol, called ROL, that uses various quality of service (QoS) metrics to meet application requirements. ROL combines several application requirements, specifically it attempts to provide an inclusive solution to prolong network life, provide timely message delivery and improve network robustness. It uses a combination of routing metrics that can be configured according to the priorities of user-level applications to improve overall network performance. To this end, an optimisation tool for balancing the communication resources for the constraints and priorities of user applications has been developed and Nutrient-flow-based Distributed Clustering (NDC), an algorithm for load balancing is proposed. NDC works seamlessly with any clustering algorithm to equalise, as far as possible, the diameter and the membership of clusters. This paper presents simulation results to show that ROL/NDC gives a higher network lifetime than other similar schemes, such Mires++. In simulation, ROL/NDC maintains a maximum of 7\% variation from the optimal cluster population, reduces the total number of set-up messages by up to 60%, reduces the end-to-end delay by up to 56%, and enhances the data delivery ratio by up to 0.98% compared to Mires++.
An Overview of Information Extraction from Mobile Wireless Sensor NetworksM H
Information Extraction (IE) is a key research area within the field of Wireless Sensor Networks (WSNs). It has been characterised in a variety of ways, ranging from the description of its purposes, to reasonably abstract models of its processes and components. There has been only a handful of papers addressing IE over mobile WSNs directly, these dealt with individual mobility related problems as the need arises. This paper is presented as a tutorial that takes the reader from the point of identifying data about a dynamic (mobile) real world problem, relating the data back to the world from which it was collected, and finally discovering what is in the data. It covers the entire process with special emphasis on how to exploit mobility in maximising information return from a mobile WSN. We present some challenges introduced by mobility on the IE process as well as its effects on the quality of the extracted information. Finally, we identify future research directions facing the development of efficient IE approaches for WSNs in the presence of mobility.
PERFORMANCE STUDY AND SIMULATION OF AN ANYCAST PROTOCOL FOR WIRELESS MOBILE A...ijwmn
This paper conducts a detailed simulation study of stateless anycast routing in a mobile wireless ad hoc
network. The model covers all the fundamental aspects of such networks with a routing mechanism using
a scheme of orientation-dependent inter-node communication links. The simulation system Winsim is used
which explicitly represents parallelism of events and processes in the network. The purpose of these
simulations is to investigate the effect of node’s maximum speed, and different TTL over the network
performance under two different scenarios. Simulation study investigates five practically important
performance metrics of a wireless mobile ad hoc network and shows the dependence of this metrics on
the transmission radius, link availability, and maximal possible node speed
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Communication synchronization in cluster based wireless sensor network a re...eSAT Journals
Abstract A wireless sensor network is acquiring more popularity in different sectors. A scalable, low latency and energy efficient are desire challenges that should meet by wireless sensor network. Clustering permits sensors to systematically communicate among clusters. Cluster based sensor network satisfies these challenges as it provides flexible, energy saving and QoS. The communication efficiency and network performance degrades if the interaction between inter-cluster and intra-cluster communication are not managed properly. The proposed work uses two approaches to solve this problem. At aiming low packet delay and high throughput first approach uses cycle- based synchronous scheduling. By completely removing necessity of communication synchronization second approach send packets with no synchronization delay. The combined scheme can take benefit of both approaches. Keywords: Wireless sensor network, clustering, communication synchronization, QoS.
Simulation Issues in Wireless Sensor Networks: A SurveyM H
This paper presents a survey of simulation tools and systems for wireless sensor networks. Wireless sensor network modelling and simulation methodologies are presented for each system alongside judgments concerning their relative ease of use and accuracy. Finally, we propose a mixed-mode simulation methodology that integrates a simulated environment with real wireless sensor network testbed hardware in order to improve both the accuracy and scalability of results when evaluating different prototype designs and systems.
Information Extraction from Wireless Sensor Networks: System and ApproachesM H
Recent advances in wireless communication have made it possible to develop low-cost, and low power Wireless Sensor Networks (WSN). The WSN can be used for several application areas (e.g., habitat monitoring, forest fire detection, and health care). WSN Information Extraction (IE) techniques can be classified into four categories depending on the factors that drive data acquisition: event-driven, time-driven, query-based, and hybrid. This paper presents a survey of the state-of-the-art IE techniques in WSNs. The benefits and shortcomings of different IE approaches are presented as motivation for future work into automatic hybridization and adaptation of IE mechanisms.
Determination and comparison rate of expression markers of osteoblast derived...IJERD Editor
Nowadays high accident rates, fractures leading to permanent bone disorders and the impossibility of bone transplant have made scientists to look for new methods of repairing injured bones. Considering the application of stem cells in bone tissue engineering, there exists the necessity to investigate various culture methods and suitable fields and scaffolds. Thus, we decided to induce adipose-derived stem cells into osteoblast cells in two systems of pellet culture and monolayer and compare osteogenic markers. Methods: Stem cells have been separated via mechanical and enzymatic methods and cultured in monolayer and pellet culture models with osteogenic medium. Then, RNA was separated from differentiated cells, complementary DNA (cDNA) was synthesized and amplified. Polymerase chain reaction (PCR) product was transferred to electrophoresis gel. The intensity of the bands was measured by Image-J software and analyzed by SPSS.
The Implementation Of Concept Main Map In Basic Calculation Of Engineering Su...IJERD Editor
This research began from problem in spacious about teaching and learning by doing where is the method learning is not effective because used descriptive subject mater with writing on black board or descriptive by essay. In order that is not efficient and effective in used teaching and the student can not comprenship understand? With this method will hope can handle it. The used method in this research is classroom action and focus at pump and compressor subject mater in Basic Calculation of Engineering subject. This research was doing in Makassar State University with subject 15 students at machine department. The instrument is used test, interview, observation, and spacious writed. In this learning method is development 5 concept, they are congcrete concept, abstract concept with example kongret concept, abstract concept, concept that process basic and concept with principle. The result of this research showing with mapping concept method in pump and compressor subject, that have improvement competition students at the last siklus II is 7,0 – 10 or 86,67% is mean the students can said that they are competent in learning.
A location comparison of three health care centers in Sfax-cityIJERD Editor
The problem of health facilities location is explored under a mathematical optimization approach. Several models are developed for the location of a generalized health facility system in a manner that the selected criteria are optimized. From the literature we use in our paper the criteria efficiency and availability of the service. The optimal locations satisfying two objectives, one that minimizes health care centers-patient distance and another that captures as many patients as possible within a pre-specified time or distance. The results indicate that the existing locations provide near-optimal geographic access to health care center.
A New Modified Version of Caser Cipher AlgorithmIJERD Editor
Computers uses a file which is a collection of information. The information is sensitive part of the organizations , and can be classified into simple, important, and critical information. Any loss or threat to information can prove to be great loss to the organization as well to people. The most important goal for designing any encryption algorithm is the security against unauthorized attacks. This paper introduces a new method to enhance the performance of the (Cesar Cipher algorithm ). This is done by replacing the single key (Offsite) that used by the standard algorithm with dynamic key his value is changed for each letter depending on its position and the value of the previous letter. This replacement adds a new level of protection strength and more robustness against breaking methods. One more powerful technique added by the proposed algorithm is repeat the encryption for the entered text several times.
A Review on Image Compression in Parallel using CUDAIJERD Editor
Now a days images are prodigiously and sizably voluminous in size. So, this size is not facilely fits in applications. For that image compression is require. Image Compression algorithms are more resource conserving. It takes more time to consummate the task of compression. Utilizing Parallel implementation of the compression algorithm this quandary can be overcome. CUDA (Compute Unified Device Architecture) Provides parallel execution for algorithm utilizing the multi-threading. CUDA is NVIDIA`s parallel computing platform. CUDA uses GPU (Graphical Processing Unit) for the parallel execution. GPU have the number of the cores for parallel execution support. Image compression can additionally implemented in parallel utilizing CUDA. There are number of algorithms for image compression. Among them DWT (Discrete Wavelet Transform) is best suited for parallel implementation due to its more mathematical calculation and good compression result compare to other methods. In this paper included different parallel techniques for image compression. With the actualizing this image compression algorithm over the GPU utilizing CUDA it will perform the operations in parallel. In this way, vast diminish in processing time is conceivable. Furthermore it is conceivable to enhance the execution of image compression algorithms.
Contemporary Spread Spectrum Techniques: A Comparative StudyIJERD Editor
Anti-jamming is an important problem in broadcast communication. In this paper , we provide an
overview of recent contributions pertaining to the anti-jamming techniques. Specifically, the paper focuses on
comparative study of anti-jamming techniques‟ performance against jammers. Due to secret key sharing
between sender and receiver in classical Spread spectrum techniques, Anti-jamming Broadcast problem arises.
To have jamming resistant communication, Uncoordinated SS, Randomized differential-DSSS, Quorum
Rendezvous Channel Hopping are proposed and implemented in the respective domain of communication. From
the discussion provided in this paper, it is concluded that the brief review of anti-jamming techniques can help
the researchers to understand the functionality and practical applications of the techniques based on DSSS and
FHSS.
Parallel Reaction Kinetic Modelling Of Biogas To Biomethanol With Zno/Sio2 Na...IJERD Editor
Kinetic model proposed in this study is a single reaction kinetic model of parallel biogas into
biomethanol (CO2 + H2) and CO2 gas (CO + O2) in the gas phase. The phenomenon of this reaction is a new
breakthrough in the field of renewable energy and very exciting to be modeled kinetic. These parallel reactions
biomethanol and biogas into CO2 gas in this study utilizes content of methane (CH4) which is converted to CO2
by nanoprticles biomethanol and ZnO impregnated silica. Nanoparticles ZnO made with Zn (SO4) 7H2O and
NaOH with co precipitation method with stirring pressure of 1.2 bar and an isothermal drying temperature
180oC. Reaction biogas into biomethanol and CO2 takes place at a temperature of 350oC and a pressure of 1.2
bar produce biogas conversion into biomethanol 70% and 25% CO2 gas. at a temperature of 350oC and
volumetric rate of 5 ml per minute. Effect of water formed in this reaction will inhibit the formation of
biomethanol and hydrocarbons.
Enhancement of Power Quality Using the Combination of Thyristor-Controlled Re...IJERD Editor
This paper proposes the combined system of a thyristor – controlled reactor (TCR) and the shunt active filter for harmonic and reactive power compensation. The tuned passive filter and the TCR form a shunt passive filter to compensate the reactive power. The power system harmonics are a menace to electric power system with disastrous consequences. The line current harmonics can cause increase in losses, instability and voltage distortion. Shunt active filters have been used near harmonic producing loads or at the point of common coupling to block the current harmonics. With the diverse application involving reactive power together with harmonic compensation, passive filters are found suitable. The total harmonic distortion and compensation current are carried out in MATLAB using SIMULINK. With the increase in non-linear loads in power system, more and more filters are required. The active filters are designed and analysed to improve the power quality
Dynamic K-Means Algorithm for Optimized Routing in Mobile Ad Hoc Networks IJCSES Journal
In this paper, a dynamic K-means algorithm to improve the routing process in Mobile Ad-Hoc networks
(MANETs) is presented. Mobile ad-hoc networks are a collocation of mobile wireless nodes that can
operate without using focal access points, pre-existing infrastructures, or a centralized management point.
In MANETs, the quick motion of nodes modifies the topology of network. This feature of MANETS is lead
to various problems in the routing process such as increase of the overhead massages and inefficient
routing between nodes of network. A large variety of clustering methods have been developed for
establishing an efficient routing process in MANETs. Routing is one of the crucial topics which are having
significant impact on MANETs performance. The K-means algorithm is one of the effective clustering
methods aimed to reduce routing difficulties related to bandwidth, throughput and power consumption.
This paper proposed a new K-means clustering algorithm to find out optimal path from source node to
destinations node in MANETs. The main goal of proposed approach which is called the dynamic K-means
clustering methods is to solve the limitation of basic K-means method like permanent cluster head and fixed
cluster members. The experimental results demonstrate that using dynamic K-means scheme enhance the
performance of routing process in Mobile ad-hoc networks.
Impact of Mobility for Qos Based Secure Manet graphhoc
Secure multicast communication in Mobile Adhoc Networks (MANETs) is challenging due to its inherent characteristics of infrastructure-less architecture with lack of central authority, limited resources such as bandwidth, energy and power. Several group oriented applications over MANETs create new challenges to routing protocols in terms of QOS requirements. In many multicast interactions, due to its frequent node mobility, new member can join and current members can leave at a time. It is necessary to choose a routing protocol which establishes true connectivity between the mobile nodes. The pattern of movement of members is classified into different mobility models and each one has its own distinct features. It is a crucial part in the performance of MANET. Hence key management is the fundamental challenge in achieving secure communication using multicast key distribution for mobile adhoc networks. This paper describes the impact of mobility models for the performance of a new cluster-based multicast tree algorithm with destination sequenced distance vector routing protocol in terms of QOS requirements such as end to end delay, energy consumption and key delivery ratio. For simulation purposes, three mobility models are considered. Simulation results illustrate the performance of routing protocol with different mobility models and different mobility speed under varying network conditions.
Optimizing On Demand Weight -Based Clustering Using Trust Model for Mobile Ad...ijasuc
Mobile ad hoc networks are growing in popularity due to the explosive growth of modern
devices with wireless capability such as laptop, mobile phones, PDA, etc., makes the application more
challenging. The mobile nodes are vulnerable to security attacks. To protect the ad hoc network it is
essential to evaluate the trust worthiness. The proposed TWCA is similar to WCA in terms of cluster
formation and cluster head election. However, in WCA security features are not included. The proposed
TWCA is a cluster based trust evaluation, in which the mobile nodes are grouped into clusters with one
cluster head. It establishes trust relationship for the cluster based on the previous transaction result. The
simulation result confirms the efficiency of our scheme than the WCA and SEMC.
MODELING AND DESIGNING RESOURCE EFFICIENT DISTRIBUTED MANET MANAGEMENT SYSTEM...IJCNCJournal
Traditional network management systems use spoofing of resources to collect statistical data such as resource usage and performance. This data is exchanged with other resources through management protocols. The amount of data can be extremely high and the bandwidth for overhead management functions increases significantly. Also, the data storage requirements in each network resource for
management functions increases and become inefficient as it increases the power usage for processing. In
this paper, we propose a distributed network management system where each network resource maintains a
set of Management Information Base (MIB) elements and stores resource activities in their abstraction in
terms of counters, flag and threshold values. The abstract data is exchanged between different management
agents residing in different resources on a need-to-know basis and each agent logically executes management functions locally to develop understanding of the behavior of all network resources to ensure that user protocols can function smoothly. Our proposed architecture can be implemented in any network, but is highly important to be considered in power and bandwidth constrained networks such as Mobile Ad Hoc Networks (MANET). In this research, we use cross layer models to demonstrate simplified way of efficiently managing the overall performance of individual network resources (nodes) and the network itself which is critical for not only monitoring the traffic, but also dynamically controlling the end-to-end Quality of Service (QoS) for multi-service applications.
SECURE ROUTING PROTOCOL TO MITIGATE ATTACKS BY USING BLOCKCHAIN TECHNOLOGY IN...IJCNCJournal
MANET is a collection of mobile nodes that communicate through wireless networks as they move from one
point to another. MANET is an infrastructure-less network with a changeable topology; as a result, it is
very susceptible to attacks. MANET attack prevention represents a serious difficulty. Malicious network
nodes are the source of network-based attacks. In a MANET, attacks can take various forms, and each one
alters the network's operation in its unique way. In general, attacks can be separated into two categories:
those that target the data traffic on a network and those that target the control traffic. This article explains
the many sorts of assaults, their impact on MANET, and the MANET-based defence measures that are
currently in place. The suggested SRA that employs blockchain technology (SRABC) protects MANET from
attacks and authenticates nodes. The secure routing algorithm (SRA) proposed by blockchain technology
safeguards control and data flow against threats. This is achieved by generating a Hash Function for every
transaction. We will begin by discussing the security of the MANET. This article's second section explores
the role of blockchain in MANET security. In the third section, the SRA is described in connection with
blockchain. In the fourth phase, PDR and Throughput are utilised to conduct an SRA review using
Blockchain employing PDR and Throughput. The results suggest that the proposed technique enhances
MANET security while concurrently decreasing delay. The performance of the proposed technique is
analysed and compared to the routing protocols Q-AODV and DSR.
Secure Routing Protocol to Mitigate Attacks by using Blockchain Technology in...IJCNCJournal
MANET is a collection of mobile nodes that communicate through wireless networks as they move from one point to another. MANET is an infrastructure-less network with a changeable topology; as a result, it is very susceptible to attacks. MANET attack prevention represents a serious difficulty. Malicious network nodes are the source of network-based attacks. In a MANET, attacks can take various forms, and each one alters the network's operation in its unique way. In general, attacks can be separated into two categories: those that target the data traffic on a network and those that target the control traffic. This article explains the many sorts of assaults, their impact on MANET, and the MANET-based defence measures that are currently in place. The suggested SRA that employs blockchain technology (SRABC) protects MANET from attacks and authenticates nodes. The secure routing algorithm (SRA) proposed by blockchain technology safeguards control and data flow against threats. This is achieved by generating a Hash Function for every transaction. We will begin by discussing the security of the MANET. This article's second section explores the role of blockchain in MANET security. In the third section, the SRA is described in connection with blockchain. In the fourth phase, PDR and Throughput are utilised to conduct an SRA review using Blockchain employing PDR and Throughput. The results suggest that the proposed technique enhances MANET security while concurrently decreasing delay. The performance of the proposed technique is analysed and compared to the routing protocols Q-AODV and DSR.
Optimal Coverage Path Planningin a Wireless Sensor Network for Intelligent Tr...IJCNCJournal
With the enhancement of the intelligent and communication technology, an intelligent transportation plays a vital role to facilitate an essential service to many people, allowing them to travel quickly and conveniently from place to place. Wireless sensor networks (WSNs) are well-known for their ability to detect physical significant barriers due to their diverse movement, self-organizing capabilities, and the integration of this mobile node on the intelligent transportation system to gather data in WSN contexts is becoming more and more popular as these vehicles proliferate. Although these mobile devices might enhance network performance, however it is difficult to design a suitable transportation path with the limited energy resources with network connectivity. To solve this problem, we have proposed a novel itinerary planning schema data gatherer (IPS-DG) model. Furthermore, we use the path planning module (PPM) which finds the transportation path to travel the shortest distance. We have compared our results under different aspect such as life span, energy consumption, and path length with Low Energy Adaptive Clustering Hierarchy (LEACH), Multi-Hop Weighted Revenue (MWR), Single-Hop Data Gathering Procedure (SHDGP). Our model outperforms in terms of energy usage, shortest path, and longest life span of with LEACH, MWR, SHDGP routing protocols.
Optimal Coverage Path Planning in a Wireless Sensor Network for Intelligent T...IJCNCJournal
With the enhancement of the intelligent and communication technology, an intelligent transportation plays a vital role to facilitate an essential service to many people, allowing them to travel quickly and conveniently from place to place. Wireless sensor networks (WSNs) are well-known for their ability to detect physical significant barriers due to their diverse movement, self-organizing capabilities, and the integration of this mobile node on the intelligent transportation system to gather data in WSN contexts is becoming more and more popular as these vehicles proliferate. Although these mobile devices might enhance network performance, however it is difficult to design a suitable transportation path with the limited energy resources with network connectivity. To solve this problem, we have proposed a novel itinerary planning schema data gatherer (IPS-DG) model. Furthermore, we use the path planning module (PPM) which finds the transportation path to travel the shortest distance. We have compared our results under different aspect such as life span, energy consumption, and path length with Low Energy Adaptive Clustering Hierarchy (LEACH), Multi-Hop Weighted Revenue (MWR), Single-Hop Data Gathering Procedure (SHDGP). Our model outperforms in terms of energy usage, shortest path, and longest life span of with LEACH, MWR, SHDGP routing protocols.
Effect of multipath routing in autonomous mobile mesh networkseSAT Journals
Abstract
Autonomous mobile mesh networks are a combination of mobile ad hoc networks and mesh networks. Mobile ad hoc networks are temporarily formed for a specific purpose, without any fixed infrastructure. Mesh networks are fully connected networks with the support of fixed infrastructure. Autonomous mobile mesh networks (AMMNET in short) [1], is the framework designed for supporting mesh networks, which are mobile still expects connectivity as opposed to ad hoc networks. This paper proposes a multipath routing technology for AMMNETs which provides better packet delivery ratio in AMMNETs. The simulations are done in ns2. The results prove that, multipath routing technology works well with AMMNET framework.
Keywords: AMMNET, routing, multipath, ns2.
An Enhanced DSR Protocol for Improving QoS in MANETKhushbooGupta145
Ad hoc network is a network without centralized administration in which different users can communicate and exchange information. In such a structure, all the nodes participate in order to achieve the network and ensure the travel of the information. Hence, multihopping techniques are used to achieve this task. The communication reliability within an ad hoc network and how the different nodes act are managed by routing protocols. Nowadays, different types of protocols exist. Nevertheless, the source routing ones, based on information known at the source of the communication, seem to attract more studies. Source routing protocols had shown interesting results in realistic scenarios in areas such as military battlefields or airport stations.
This Paper deals with DSR Protocol and is focused on the multipath aspect of this routing protocol. Since, it is necessary to understand that multipath techniques enhance reliability and can ensure security. We have simulated a new multipath algorithm. The solution had been evaluated with the network Simulator 2. Since we want to know how our protocol reacts in different mobility cases, the random waypoint model which allows us to present relevant results, due to the fact this situation is taken into account.
Simulation results show that the multipath protocol behaves better than DSR, the main actual reactive protocol. The Proposed protocol MSR performs well in high mobility by using much less overhead than DSR. Additionally, it is interesting to see that DSR without any modifications manage poorly in high mobility situation.
Mobile ad hoc network become nowadays more and more used in different
domains, due to its flexibility and low cost of deployment. However, this
kind of network still suffering from several problems as the lack of resources.
Many solutions are proposed to face these problems, among these solutions
there is the clustering approach. This approach tries to partition the network
into a virtual group. It is considered as a primordial solution that aims to
enhance the performance of the total network, and makes it possible to
guarantee basic levels of system performance. In this paper, we study some
schemes of clustering such as Dominating-Set-based clustering, Energyefficient
clustering, Low-maintenance clustering, Load-balancing clustering,
and Combined-metrics based clustering.
Designing an opportunistic routing scheme for adaptive clustering in mobile a...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
Designing an opportunistic routing scheme for adaptive clustering in mobile a...eSAT Journals
Abstract Mobile networks have received great deal of attention during last few decades due to their potential applications such as large scale, improved flexibility and reduced costs. This proposed work addresses two problems associated with mobile network such as method to reduce overhead between the nodes, and energy balanced routing of packets by Co-Operative opportunistic routing for cluster based communication. We propose a modified algorithm that uses On-Demand Opportunistic Group mobility based clustering (ODOGMBC) for forming the cluster and predicting the cluster mobility by neighbourhood update algorithm. Cluster formation involves election of a mobile node as Cluster head. Each cluster comprises of cluster head and non-cluster head node that forms a cluster dynamically. Each node in the network continuously finds it neighbour by communicating with them, and nodes have consistent updated routing information in route cache by neighbourhood update algorithm. In routing process packet forwarded by the source node is updated by intermediate forwarder if topology undergo changes. This opportunistic routing scheme provides responsive data transportation and managing the node effectively, even in heavily loaded environment. Thus, our proposed routing technique helps us to reduce overhead, increases efficiency and better control of path selection. Keywords- Clustering, Forwarder, MANET, Prediction, Reactive, opportunistic routing.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Enhancenig OLSR routing protocol using K-means clustering in MANETs IJECEIAES
The design of robust routing protocol schemes for MANETs is quite complex, due to the characteristics and structural constraints of this network. A numerous variety of protocol schemes have been proposed in literature. Most of them are based on traditional method of routing, which doesn’t guarantee basic levels of Qos, when the network becomes larger, denser and dynamic. To solve this problem we use one of the most popular methods named clustering. In this work we try to improve the Qos in MANETs. We propose an algorithm of clustering based in the new mobility metric and K-Means method to distribute the nodes into several clusters; it is implemented to standard OLSR protocol giving birth a new protocol named OLSR Kmeans-SDE. The simulations showed that the results obtained by OLSR Kmeans-SDE exceed those obtained by standard OLSR Kmeans and OLSR Kmed+ in terms of, traffic Control, delay and packet delivery ratio.
AN EFFICIENT ROUTING PROTOCOL FOR MOBILE AD HOC NETWORK FOR SECURED COMMUNICA...pijans
Security and reliable communication is challenging task in mobile Ad Hoc network. Through mobility of
network device compromised with attack and loss of data. For the prevention of attack and reliable
communication, various authors proposed a method of secured routing protocol such as SAODV and SBRP
(secured backup routing protocol). The process of these methods work along with route discovery and
route maintains, discovery and route maintained needed more power consumption for that process. The
power of devices is decrease during such process and network lifetimes expire. In this paper, we modified
the secured stateless protocol for secured routing and minimized the utilization of power during path
discovering and establishment. For the authentication of group node used group signature technique and
sleep mode threshold concept for power minimization. Our proposed technique is simulated in ns-2 and
compare to other routing protocol gives a better performance in comparison to energy consumption and
throughput of network.
An Efficient Routing Protocol for Mobile Ad Hoc Network for Secured Communica...pijans
Security and reliable communication is challenging task in mobile Ad Hoc network. Through mobility of network device compromised with attack and loss of data. For the prevention of attack and reliable communication, various authors proposed a method of secured routing protocol such as SAODV and SBRP (secured backup routing protocol). The process of these methods work along with route discovery and route maintains, discovery and route maintained needed more power consumption for that process. The power of devices is decrease during such process and network lifetimes expire. In this paper, we modified the secured stateless protocol for secured routing and minimized the utilization of power during path discovering and establishment. For the authentication of group node used group signature technique and sleep mode threshold concept for power minimization. Our proposed technique is simulated in ns-2 and compare to other routing protocol gives a better performance in comparison to energy consumption and throughput of network.
GRAPH THEORETIC ROUTING ALGORITHM (GTRA) FOR MOBILE AD-HOC NETWORKS (MANET)graphhoc
Battlefield theater applications require supporting large number of nodes. It can facilitate many multi-hop
paths between each source and destination pairs. For scalability, it is critical that for supporting network
centric applications with large set of nodes require hierarchical approach to designing networks. In this
research we consider using Mobile Ad Hoc Network (MANET) with multiple clusters. Each cluster
supports a few nodes with a cluster head. The intra-cluster connectivity amongst the nodes within the
cluster is supported by multi-hop connectivity to ensure handling mobility in such a way that no service
disruption can occur. The inter-cluster connectivity is also achieved by multi-hop connectivity. However,
for inter-cluster communications, only cluster heads are connected. The selection of intra-cluster
communications and inter-cluster communications allow scalability of the network to support multiservices
applications end-to-end with a desired Quality of Service (QoS). This paper proposes graph
theoretic approach to establish efficient connection between a source and a destination within each cluster
in intra-cluster network and between clusters in inter-cluster network. Graph theoretic approach
traditionally was applied networks where nodes are static or fixed. In this paper, we have applied the
graph theoretic routing to MANET where nodes are mobile. One of the important challenges in MANET is
to support an efficient routing algorithm for multi-hop communications across many nodes which are
dynamic in nature. However, dynamic behavior of the nodes requires greater understanding of the node
degree and mobility at each instance of time in order to maintain end-to-end QoS for multi-service
provisioning. This paper demonstrates graph theoretic approach produces an optimum multi-hop
connectivity path based on cumulative minimum degree that minimizes the contention and scheduling
delay end-to-end. It is applied to both intra-cluster communications as well as inter-cluster
communications. The performance shows that having a multi-hop connectivity for intra-cluster
communications is more power efficient compared to broadcast of information with maximum power
coverage. Each cluster performs similarly and the algorithm is also used for inter-cluster communications.
Our simulation results show that the proposed graph theoretic routing approach will reduce the overall
delay and improves the physical layer data frame transmission.
A Novel Method for Prevention of Bandwidth Distributed Denial of Service AttacksIJERD Editor
Distributed Denial of Service (DDoS) Attacks became a massive threat to the Internet. Traditional
Architecture of internet is vulnerable to the attacks like DDoS. Attacker primarily acquire his army of Zombies,
then that army will be instructed by the Attacker that when to start an attack and on whom the attack should be
done. In this paper, different techniques which are used to perform DDoS Attacks, Tools that were used to
perform Attacks and Countermeasures in order to detect the attackers and eliminate the Bandwidth Distributed
Denial of Service attacks (B-DDoS) are reviewed. DDoS Attacks were done by using various Flooding
techniques which are used in DDoS attack.
The main purpose of this paper is to design an architecture which can reduce the Bandwidth
Distributed Denial of service Attack and make the victim site or server available for the normal users by
eliminating the zombie machines. Our Primary focus of this paper is to dispute how normal machines are
turning into zombies (Bots), how attack is been initiated, DDoS attack procedure and how an organization can
save their server from being a DDoS victim. In order to present this we implemented a simulated environment
with Cisco switches, Routers, Firewall, some virtual machines and some Attack tools to display a real DDoS
attack. By using Time scheduling, Resource Limiting, System log, Access Control List and some Modular
policy Framework we stopped the attack and identified the Attacker (Bot) machines
Hearing loss is one of the most common human impairments. It is estimated that by year 2015 more
than 700 million people will suffer mild deafness. Most can be helped by hearing aid devices depending on the
severity of their hearing loss. This paper describes the implementation and characterization details of a dual
channel transmitter front end (TFE) for digital hearing aid (DHA) applications that use novel micro
electromechanical- systems (MEMS) audio transducers and ultra-low power-scalable analog-to-digital
converters (ADCs), which enable a very-low form factor, energy-efficient implementation for next-generation
DHA. The contribution of the design is the implementation of the dual channel MEMS microphones and powerscalable
ADC system.
Influence of tensile behaviour of slab on the structural Behaviour of shear c...IJERD Editor
-A composite beam is composed of a steel beam and a slab connected by means of shear connectors
like studs installed on the top flange of the steel beam to form a structure behaving monolithically. This study
analyzes the effects of the tensile behavior of the slab on the structural behavior of the shear connection like slip
stiffness and maximum shear force in composite beams subjected to hogging moment. The results show that the
shear studs located in the crack-concentration zones due to large hogging moments sustain significantly smaller
shear force and slip stiffness than the other zones. Moreover, the reduction of the slip stiffness in the shear
connection appears also to be closely related to the change in the tensile strain of rebar according to the increase
of the load. Further experimental and analytical studies shall be conducted considering variables such as the
reinforcement ratio and the arrangement of shear connectors to achieve efficient design of the shear connection
in composite beams subjected to hogging moment.
Gold prospecting using Remote Sensing ‘A case study of Sudan’IJERD Editor
Gold has been extracted from northeast Africa for more than 5000 years, and this may be the first
place where the metal was extracted. The Arabian-Nubian Shield (ANS) is an exposure of Precambrian
crystalline rocks on the flanks of the Red Sea. The crystalline rocks are mostly Neoproterozoic in age. ANS
includes the nations of Israel, Jordan. Egypt, Saudi Arabia, Sudan, Eritrea, Ethiopia, Yemen, and Somalia.
Arabian Nubian Shield Consists of juvenile continental crest that formed between 900 550 Ma, when intra
oceanic arc welded together along ophiolite decorated arc. Primary Au mineralization probably developed in
association with the growth of intra oceanic arc and evolution of back arc. Multiple episodes of deformation
have obscured the primary metallogenic setting, but at least some of the deposits preserve evidence that they
originate as sea floor massive sulphide deposits.
The Red Sea Hills Region is a vast span of rugged, harsh and inhospitable sector of the Earth with
inimical moon-like terrain, nevertheless since ancient times it is famed to be an abode of gold and was a major
source of wealth for the Pharaohs of ancient Egypt. The Pharaohs old workings have been periodically
rediscovered through time. Recent endeavours by the Geological Research Authority of Sudan led to the
discovery of a score of occurrences with gold and massive sulphide mineralizations. In the nineties of the
previous century the Geological Research Authority of Sudan (GRAS) in cooperation with BRGM utilized
satellite data of Landsat TM using spectral ratio technique to map possible mineralized zones in the Red Sea
Hills of Sudan. The outcome of the study mapped a gossan type gold mineralization. Band ratio technique was
applied to Arbaat area and a signature of alteration zone was detected. The alteration zones are commonly
associated with mineralization. The alteration zones are commonly associated with mineralization. A filed check
confirmed the existence of stock work of gold bearing quartz in the alteration zone. Another type of gold
mineralization that was discovered using remote sensing is the gold associated with metachert in the Atmur
Desert.
Reducing Corrosion Rate by Welding DesignIJERD Editor
The paper addresses the importance of welding design to prevent corrosion at steel. Welding is
used to join pipe, profiles at bridges, spindle, and a lot more part of engineering construction. The
problems happened associated with welding are common issues in these fields, especially corrosion.
Corrosion can be reduced with many methods, they are painting, controlling humidity, and also good
welding design. In the research, it can be found that reducing residual stress on the welding can be
solved in corrosion rate reduction problem.
Preheating on 500oC and 600oC give better condition to reduce corosion rate than condition after
preheating 400oC. For all welding groove type, material with 500oC and 600oC preheating after 14 days
corrosion test is 0,5%-0,69% lost. Material with 400oC preheating after 14 days corrosion test is 0,57%-0,76%
lost.
Welding groove also influence corrosion rate. X and V type welding groove give better condition to reduce
corrosion rate than use 1/2V and 1/2 X welding groove. After 14 days corrosion test, the samples with
X welding groove type is 0,5%-0,57% lost. The samples with V welding groove after 14 days corrosion test is
0,51%-0,59% lost. The samples with 1/2V and 1/2X welding groove after 14 days corrosion test is 0,58%-
0,71% lost.
Router 1X3 – RTL Design and VerificationIJERD Editor
Routing is the process of moving a packet of data from source to destination and enables messages
to pass from one computer to another and eventually reach the target machine. A router is a networking device
that forwards data packets between computer networks. It is connected to two or more data lines from different
networks (as opposed to a network switch, which connects data lines from one single network). This paper,
mainly emphasizes upon the study of router device, it‟s top level architecture, and how various sub-modules of
router i.e. Register, FIFO, FSM and Synchronizer are synthesized, and simulated and finally connected to its top
module.
Active Power Exchange in Distributed Power-Flow Controller (DPFC) At Third Ha...IJERD Editor
This paper presents a component within the flexible ac-transmission system (FACTS) family, called
distributed power-flow controller (DPFC). The DPFC is derived from the unified power-flow controller (UPFC)
with an eliminated common dc link. The DPFC has the same control capabilities as the UPFC, which comprise
the adjustment of the line impedance, the transmission angle, and the bus voltage. The active power exchange
between the shunt and series converters, which is through the common dc link in the UPFC, is now through the
transmission lines at the third-harmonic frequency. DPFC multiple small-size single-phase converters which
reduces the cost of equipment, no voltage isolation between phases, increases redundancy and there by
reliability increases. The principle and analysis of the DPFC are presented in this paper and the corresponding
simulation results that are carried out on a scaled prototype are also shown.
Mitigation of Voltage Sag/Swell with Fuzzy Control Reduced Rating DVRIJERD Editor
Power quality has been an issue that is becoming increasingly pivotal in industrial electricity
consumers point of view in recent times. Modern industries employ Sensitive power electronic equipments,
control devices and non-linear loads as part of automated processes to increase energy efficiency and
productivity. Voltage disturbances are the most common power quality problem due to this the use of a large
numbers of sophisticated and sensitive electronic equipment in industrial systems is increased. This paper
discusses the design and simulation of dynamic voltage restorer for improvement of power quality and
reduce the harmonics distortion of sensitive loads. Power quality problem is occurring at non-standard
voltage, current and frequency. Electronic devices are very sensitive loads. In power system voltage sag,
swell, flicker and harmonics are some of the problem to the sensitive load. The compensation capability
of a DVR depends primarily on the maximum voltage injection ability and the amount of stored
energy available within the restorer. This device is connected in series with the distribution feeder at
medium voltage. A fuzzy logic control is used to produce the gate pulses for control circuit of DVR and the
circuit is simulated by using MATLAB/SIMULINK software.
Study on the Fused Deposition Modelling In Additive ManufacturingIJERD Editor
Additive manufacturing process, also popularly known as 3-D printing, is a process where a product
is created in a succession of layers. It is based on a novel materials incremental manufacturing philosophy.
Unlike conventional manufacturing processes where material is removed from a given work price to derive the
final shape of a product, 3-D printing develops the product from scratch thus obviating the necessity to cut away
materials. This prevents wastage of raw materials. Commonly used raw materials for the process are ABS
plastic, PLA and nylon. Recently the use of gold, bronze and wood has also been implemented. The complexity
factor of this process is 0% as in any object of any shape and size can be manufactured.
Spyware triggering system by particular string valueIJERD Editor
This computer programme can be used for good and bad purpose in hacking or in any general
purpose. We can say it is next step for hacking techniques such as keylogger and spyware. Once in this system if
user or hacker store particular string as a input after that software continually compare typing activity of user
with that stored string and if it is match then launch spyware programme.
A Blind Steganalysis on JPEG Gray Level Image Based on Statistical Features a...IJERD Editor
This paper presents a blind steganalysis technique to effectively attack the JPEG steganographic
schemes i.e. Jsteg, F5, Outguess and DWT Based. The proposed method exploits the correlations between
block-DCTcoefficients from intra-block and inter-block relation and the statistical moments of characteristic
functions of the test image is selected as features. The features are extracted from the BDCT JPEG 2-array.
Support Vector Machine with cross-validation is implemented for the classification.The proposed scheme gives
improved outcome in attacking.
Secure Image Transmission for Cloud Storage System Using Hybrid SchemeIJERD Editor
- Data over the cloud is transferred or transmitted between servers and users. Privacy of that
data is very important as it belongs to personal information. If data get hacked by the hacker, can be
used to defame a person’s social data. Sometimes delay are held during data transmission. i.e. Mobile
communication, bandwidth is low. Hence compression algorithms are proposed for fast and efficient
transmission, encryption is used for security purposes and blurring is used by providing additional
layers of security. These algorithms are hybridized for having a robust and efficient security and
transmission over cloud storage system.
Application of Buckley-Leverett Equation in Modeling the Radius of Invasion i...IJERD Editor
A thorough review of existing literature indicates that the Buckley-Leverett equation only analyzes
waterflood practices directly without any adjustments on real reservoir scenarios. By doing so, quite a number
of errors are introduced into these analyses. Also, for most waterflood scenarios, a radial investigation is more
appropriate than a simplified linear system. This study investigates the adoption of the Buckley-Leverett
equation to estimate the radius invasion of the displacing fluid during waterflooding. The model is also adopted
for a Microbial flood and a comparative analysis is conducted for both waterflooding and microbial flooding.
Results shown from the analysis doesn’t only records a success in determining the radial distance of the leading
edge of water during the flooding process, but also gives a clearer understanding of the applicability of
microbes to enhance oil production through in-situ production of bio-products like bio surfactans, biogenic
gases, bio acids etc.
Gesture Gaming on the World Wide Web Using an Ordinary Web CameraIJERD Editor
- Gesture gaming is a method by which users having a laptop/pc/x-box play games using natural or
bodily gestures. This paper presents a way of playing free flash games on the internet using an ordinary webcam
with the help of open source technologies. Emphasis in human activity recognition is given on the pose
estimation and the consistency in the pose of the player. These are estimated with the help of an ordinary web
camera having different resolutions from VGA to 20mps. Our work involved giving a 10 second documentary to
the user on how to play a particular game using gestures and what are the various kinds of gestures that can be
performed in front of the system. The initial inputs of the RGB values for the gesture component is obtained by
instructing the user to place his component in a red box in about 10 seconds after the short documentary before
the game is finished. Later the system opens the concerned game on the internet on popular flash game sites like
miniclip, games arcade, GameStop etc and loads the game clicking at various places and brings the state to a
place where the user is to perform only gestures to start playing the game. At any point of time the user can call
off the game by hitting the esc key and the program will release all of the controls and return to the desktop. It
was noted that the results obtained using an ordinary webcam matched that of the Kinect and the users could
relive the gaming experience of the free flash games on the net. Therefore effective in game advertising could
also be achieved thus resulting in a disruptive growth to the advertising firms.
Hardware Analysis of Resonant Frequency Converter Using Isolated Circuits And...IJERD Editor
-LLC resonant frequency converter is basically a combo of series as well as parallel resonant ckt. For
LCC resonant converter it is associated with a disadvantage that, though it has two resonant frequencies, the
lower resonant frequency is in ZCS region[5]. For this application, we are not able to design the converter
working at this resonant frequency. LLC resonant converter existed for a very long time but because of
unknown characteristic of this converter it was used as a series resonant converter with basically a passive
(resistive) load. . Here, it was designed to operate in switching frequency higher than resonant frequency of the
series resonant tank of Lr and Cr converter acts very similar to Series Resonant Converter. The benefit of LLC
resonant converter is narrow switching frequency range with light load[6] . Basically, the control ckt plays a
very imp. role and hence 555 Timer used here provides a perfect square wave as the control ckt provides no
slew rate which makes the square wave really strong and impenetrable. The dead band circuit provides the
exclusive dead band in micro seconds so as to avoid the simultaneous firing of two pairs of IGBT’s where one
pair switches off and the other on for a slightest period of time. Hence, the isolator ckt here is associated with
each and every ckt used because it acts as a driver and an isolation to each of the IGBT is provided with one
exclusive transformer supply[3]. The IGBT’s are fired using the appropriate signal using the previous boards
and hence at last a high frequency rectifier ckt with a filtering capacitor is used to get an exact dc
waveform .The basic goal of this particular analysis is to observe the wave forms and characteristics of
converters with differently positioned passive elements in the form of tank circuits.
Simulated Analysis of Resonant Frequency Converter Using Different Tank Circu...IJERD Editor
LLC resonant frequency converter is basically a combo of series as well as parallel resonant ckt. For
LCC resonant converter it is associated with a disadvantage that, though it has two resonant frequencies, the
lower resonant frequency is in ZCS region [5]. For this application, we are not able to design the converter
working at this resonant frequency. LLC resonant converter existed for a very long time but because of
unknown characteristic of this converter it was used as a series resonant converter with basically a passive
(resistive) load. . Here, it was designed to operate in switching frequency higher than resonant frequency of the
series resonant tank of Lr and Cr converter acts very similar to Series Resonant Converter. The benefit of LLC
resonant converter is narrow switching frequency range with light load[6] . Basically, the control ckt plays a
very imp. role and hence 555 Timer used here provides a perfect square wave as the control ckt provides no
slew rate which makes the square wave really strong and impenetrable. The dead band circuit provides the
exclusive dead band in micro seconds so as to avoid the simultaneous firing of two pairs of IGBT’s where one
pair switches off and the other on for a slightest period of time. Hence, the isolator ckt here is associated with
each and every ckt used because it acts as a driver and an isolation to each of the IGBT is provided with one
exclusive transformer supply[3]. The IGBT’s are fired using the appropriate signal using the previous boards
and hence at last a high frequency rectifier ckt with a filtering capacitor is used to get an exact dc
waveform .The basic goal of this particular analysis is to observe the wave forms and characteristics of
converters with differently positioned passive elements in the form of tank circuits. The supported simulation
is done through PSIM 6.0 software tool
Amateurs Radio operator, also known as HAM communicates with other HAMs through Radio
waves. Wireless communication in which Moon is used as natural satellite is called Moon-bounce or EME
(Earth -Moon-Earth) technique. Long distance communication (DXing) using Very High Frequency (VHF)
operated amateur HAM radio was difficult. Even with the modest setup having good transceiver, power
amplifier and high gain antenna with high directivity, VHF DXing is possible. Generally 2X11 YAGI antenna
along with rotor to set horizontal and vertical angle is used. Moon tracking software gives exact location,
visibility of Moon at both the stations and other vital data to acquire real time position of moon.
“MS-Extractor: An Innovative Approach to Extract Microsatellites on „Y‟ Chrom...IJERD Editor
Simple Sequence Repeats (SSR), also known as Microsatellites, have been extensively used as
molecular markers due to their abundance and high degree of polymorphism. The nucleotide sequences of
polymorphic forms of the same gene should be 99.9% identical. So, Microsatellites extraction from the Gene is
crucial. However, Microsatellites repeat count is compared, if they differ largely, he has some disorder. The Y
chromosome likely contains 50 to 60 genes that provide instructions for making proteins. Because only males
have the Y chromosome, the genes on this chromosome tend to be involved in male sex determination and
development. Several Microsatellite Extractors exist and they fail to extract microsatellites on large data sets of
giga bytes and tera bytes in size. The proposed tool “MS-Extractor: An Innovative Approach to extract
Microsatellites on „Y‟ Chromosome” can extract both Perfect as well as Imperfect Microsatellites from large
data sets of human genome „Y‟. The proposed system uses string matching with sliding window approach to
locate Microsatellites and extracts them.
Importance of Measurements in Smart GridIJERD Editor
- The need to get reliable supply, independence from fossil fuels, and capability to provide clean
energy at a fixed and lower cost, the existing power grid structure is transforming into Smart Grid. The
development of a smart energy distribution grid is a current goal of many nations. A Smart Grid should have
new capabilities such as self-healing, high reliability, energy management, and real-time pricing. This new era
of smart future grid will lead to major changes in existing technologies at generation, transmission and
distribution levels. The incorporation of renewable energy resources and distribution generators in the existing
grid will increase the complexity, optimization problems and instability of the system. This will lead to a
paradigm shift in the instrumentation and control requirements for Smart Grids for high quality, stable and
reliable electricity supply of power. The monitoring of the grid system state and stability relies on the
availability of reliable measurement of data. In this paper the measurement areas that highlight new
measurement challenges, development of the Smart Meters and the critical parameters of electric energy to be
monitored for improving the reliability of power systems has been discussed.
Study of Macro level Properties of SCC using GGBS and Lime stone powderIJERD Editor
One of the major environmental concerns is the disposal of the waste materials and utilization of
industrial by products. Lime stone quarries will produce millions of tons waste dust powder every year. Having
considerable high degree of fineness in comparision to cement this material may be utilized as a partial
replacement to cement. For this purpose an experiment is conducted to investigate the possibility of using lime
stone powder in the production of SCC with combined use GGBS and how it affects the fresh and mechanical
properties of SCC. First SCC is made by replacing cement with GGBS in percentages like 10, 20, 30, 40, 50 and
by taking the optimum mix with GGBS lime stone powder is blended to mix in percentages like 5, 10, 15, 20 as
a partial replacement to cement. Test results shows that the SCC mix with combination of 30% GGBS and 15%
limestone powder gives maximum compressive strength and fresh properties are also in the limits prescribed by
the EFNARC.
Study of Macro level Properties of SCC using GGBS and Lime stone powder
Welcome to International Journal of Engineering Research and Development (IJERD)
1. International Journal of Engineering Research and Development
e-ISSN: 2278-067X, p-ISSN: 2278-800X, www.ijerd.com
Volume 5, Issue 11 (February 2013), PP. 68-73
Clustering Approach in Route Selection Using Mobile
Agent in Mobile Ad-Hoc Network
Yashpal Singh1, Kamal Deep2, S.Niranjan3
1,2
Research Scholar, Mewar University, Rajasthan, India
3
Professor, Department of Computer Science & Engineering ,PDM School of Technology & Management ,
Bahadurgarh, Jhajjar,Haryana,India
Abstract:- Cluster-based mechanisms in ad hoc networks not only make a large network appear
smaller, but more importantly. In our scheme, each MN is disseminated to predict its own mobility
pattern, and this information is disseminated to its neighbors using a scalable clustering algorithm. The
work proposes a prediction based Clustering Approach for Route Discovery Protocol (CARDP)using
Mobile Agent in Mobile ad-hoc Network. This paper presents a scalable way to predict mobility, and
thus availability of MNs which is achieved with the virtual cluster and it is named as (b,e,m) model.
Here we compare our work with other three algorithms in term of cluster head stability. Our clustering
algorithm enables adaptability, autonomy, economy, scalability and survivability requirements in
managing ad hoc networks by adopting Mobile Agent–Based clustering Approach. In our result cluster
stability is measured and improved using clustering
Keywords:- Hierarchical clustering, Mobile Ad-hoc Network (MANET), mobile agent (MA), data
gathering, PBNM (prediction based network management.
I. INTRODUCTION
A mobile ad hoc network consists of a set of mobile hosts that form at temporary network without any
fixed infrastructure. The nodes operate both as hosts and routers. Due to mobility on nodes, the topology of
network may change rapidly and unexpectedly .Hence it is very important to find a route that can obtain highly
stable routing and transmission ratio. Ad hoc networks, where mobile nodes communicate via multi hop
wireless links, facilitate network connectivity without the aid of any pre-existing networking infrastructure.
Cluster-based wireless sensor network saves energy by Mobile Agent (MA) technology .It provides a new idea
for the key problem. Mobile Agent entities move in the network and alternate with environment independently
by taking executing codes, running state [1], processing results and visiting route and some other information
reducing the number of the nodes communicating with the base station. Cluster-based mechanisms in ad hoc
networks not only make a large network appear smaller, but more importantly, they make a highly dynamic
topology to appear less dynamic. MWSNs can be classified into a flat, two-tier or three-tier hierarchical
architecture [2]. Flat or level, network architecture contains a set of heterogeneous devices to communicate in ad
hoc mode. These devices are mobile or fixed, but to communicate within the same network. Two-level
architecture consists of a set of nodes in place and a set of mobile nodes.
In the three-tier architecture, a set of fixed sensor nodes transmit data at a set of mobile devices, which
then transmits data to one set of access points In addition to normal network information, data related to nodes‟
location, velocity, mobility and available battery-power needs to be considered in the data-collection process,
while conserving the scarce wireless bandwidth and transmission power
Fig 1 .Cluster based wireless sensor network. [2]
68
2. Clustering Approach in Route Selection Using Mobile Agent in Mobile Ad-Hoc Network
In MANETs, the chances for different configuration changes to occur are very high, and any
management architecture should allow the management entities to detect and react to such changes in a flexible
way [1]. Most MANET routing protocols focus on finding feasible route path from source to destination node
with full utilization of network resources [4]. Mobility prediction has also been applied to determine the
duration of life time between two connected mobile nodes. Using this prediction mechanism the propose scheme
choose the most stable links in MANETs [3].
II. RELATED WORK
The concept of clustering in MANETs is not new, there have been many algorithms that consider
different metrics and have different purposes in mind. However, almost none of them consider mode mobility as
a criterion in the clustering process effectively. As a result, they fail to guarantee a stable cluster formation[1].
In a MANET that uses cluster-based services, network performance metrics such as throughput, delay
and effective management are tightly coupled with the frequency of cluster reorganization [3]. Therefore, stable
cluster formation inessential for better management and QoS support [3].The most popular clustering
approaches in the literature are the lowest identifier(Lowest-ID) and maximum-connectivity[5].With Lowest-ID
,CH moves into another region it may unnecessarily replace an existing CH, causing transient instability[4]. But
later MN movement and traffic characteristics, the criterion values are used in CH election process which results
in instability. This is the case in Lowest Distance Value (LDV) and Highest In-Cluster Traffic(ICT) approaches.
In [3], Chiang et al. have shown that the Lowest-ID algorithm performs better than the max connectivity
algorithm 3 in terms of stability of clusters (measured by the number of cluster head changes), and they have
proposed a small change in the Lowest-ID algorithm to improve performance; the improved version is referred
to as LCC which stands for “Least Cluster head Change”. In [6], bounding flooding was proposed to increase
the chance of finding feasible branches. In [7], a genetic algorithm was used to perform faster route discovery.
In [8], the adaptive QoS protocol was proposed based on the prediction of local performance. Thus, predicting
the mobility of nodes is an effective and feasible method. At present, the mobility prediction methods are
path availability models [11], prediction-based link availability estimation[12], link expiration time model
[13] and prediction strategy. Link expiration time model predicts link stability between two nodes
according to the node‟s information such as location, velocity, and direction etc with the aid of Global
Position System (GPS). The next section describes how (b, e, m)-model results in stable clustering, and enables
proactive management in our management architecture.[3]
III. PROPOSED WORK
3.1 Clustering in MANETs:-
Clustering of nodes into groups results in simplification of addressing and management of the nodes
and also yields better performance. Lowest-ID clustering is one of the most popular clustering schemes used in
the oldas well as recent ad hoc networks literature. In each cluster, exactly one node, the one with the lowest ID
among its neighbors, becomes a cluster head, and maintains cluster memberships of other member nodes. A
cluster is identified by its cluster head‟s ID. In [15], an algorithm based on max-connectivity was also proposed,
but it performed much worse than the Lowest-ID algorithm in terms of stability of clusters. The cluster head
takes the responsibility of coordinating transmissions of packets and route discovery, and thus the network does
not have to depend on classic flooding for routing.
3.2 Agent Model in clustering:-
Agents use their own knowledgebase to achieve the specified goals without disturbing the activities of
the host. The primary goal of an agent is to deliver information of one node to others in the network. Here, the
agents are used to find the multicast routes and to create the backbone for reliable multicasting. There are
various type of Agents[3]:
Knowledge Base: The knowledgebase maintains a set of network state variables such as status of the
node (cluster head, child, others) available power, bandwidth, number of movements
Route Discovery Agent (RDA): It is a static agent that runs on nodes, creates agents and knowledge base,
controls and coordinates the activities.
Node Manager Agent (NMA): It maintains the multicast tree and provides group ID to allthe members of
the packet-forwarding nodes
Link Management Agent (LMA): When a node moves out of the communication range or
dies, LMA initiate route error (RERR) message to the upstream node and again initiates
the route request.
69
3. Clustering Approach in Route Selection Using Mobile Agent in Mobile Ad-Hoc Network
Fig 2 Routing agent model
The mobile agent which resides in the source node provides group ID and distributes multicast key to
all the group members
3.3(b, e, m)-Clustering Model:-
The (b,e,m)-Clustering Approach has the following necessary ingredients:
1) The concept of virtual clusters,
2) Mobility prediction model,
3) Clustering algorithm and protocol,
4) Management architecture,
Fig 3 Steps of clustering Approach
3.3.1 The Concept of Virtual Cluster
We introduced multiple virtual clusters, In order to make our mobility prediction, and our clustering
mechanism that is (b,e,m) approach [1]. For correct operation of the (b,e,m)-Approach , each MN is supposed
to have a complete picture of the locations of the centers of such virtual clusters (VCCs).If greater mobility
prediction accuracy is required, each virtual cluster can be further split into a number of equal tracking zones
(TZ) as shown in Fig. 4.These TZs are again circular in shape, and can handle the MNs.
Fig 4 Concept of Virtual Cluster and Tracking Zones[3]
In Fig. 4 depicts a virtual cluster (big circle) that consists of seven TZs (smaller circular region).A
virtual cluster can contain any number (N) of such TZs depending on factors such as the mobility prediction
accuracy required and maximum control overhead that is allowable. However, „N‟ should satisfy the following
[3]:
70
4. Clustering Approach in Route Selection Using Mobile Agent in Mobile Ad-Hoc Network
N = i2 + j2 + i*j, …………………(i)
Where „i‟ and „j‟ are non –negative integers.ie. i=1 and j =2 then N = 7 Again each TZ has its own
unique tracking zone identifier(TZI), which can be determined given the location information. Similarly, each
MN is supposed to know all the tracking zones, and their corresponding identifiers within a particular virtual
cluster. However, in our initial work we consider only the inter-virtual cluster movement pattern of MNs, and
greater accuracy in this case is obtained by optimizing the value of virtual cluster radius (R).
3.3.2 Mobility Prediction Mechanism
In mobile ad hoc network, the reliability of a path depends on the stability or availability of each link
of this path because of the dynamic topology changes frequently. According this approach the node
mobility is the main cause of uncertainty in N/ws, we design a mobility-prediction approach which is based on
the Ziv-Lempel algorithms for data compression technique [1][8][9]. It derives a prediction of user mobility
based on the accumulated behavior of a specific Mobile node. It is also confirm that the prediction is made
without complexity and waste of bandwidth and transmission power. In our approach, each Mobile node is
generating the strings of virtual cluster identifiers (VIDs) and maintaining its respective dictionary in its
memory [12].
In addition to making predictions as to future movements of a particular Mobile node, our cluster
approach is used by each MN to predict its approximate residence-times of the virtual clusters. For this purpose,
each MN maintains its mobility database at a specific time in terms of a Mobility Trie[1][4]. This trie is a
probabilistic model corresponding to the dictionary of the LZ78 algorithm [9]. There are two important
parameters, interval time (Te)of updated events which are triggered on time-based updating Radius (Tr) of
virtual cluster. If „Te‟ is smaller then greater the accuracy of the residence-time, and also higher the tracking
overhead. Similarly, the smaller the Radius the better the prediction capability, but the higher the tracking
overhead. So for greater prediction accuracy ,Mobility Tries can be constructed with respect to tracking zones.
In this approach, the higher the number of TZs that a virtual cluster consists of, the greater the accuracy of the
residence-time.
3.3.3 Clustering Algorithm and Protocol of (b,e,m) model:-
This clustering algorithm and protocol are mainly due to our mobility prediction model as explained in
[12].The Mobility Trie that each MN constructs plays an important role to bring in proactivness in our (b,e,m)-
clustering approach. Each MN „A‟ to determine its residence-time (tav) in virtual cluster „V‟ from its Mobility
Trie. The MN that has the highest Ω(from equ.[1]) can become the primary CH, and the MNs that have the
second and third highest values become assistant(secondary) CHs. To form clusters, CH should cover the whole
area of virtual cluster .So CH makes a k-hop cluster where value „k‟ is not necessarily Uniform However,
efforts have been made to limit the value of „k‟, as it is better if every MN is only a fewer hops for proper
management.
Example of Virtual clustering is that we have four different packet types such as CALL,
CONNECT_CH,CONNECT_MN and TARGET have been defined for the operation of our clustering protocol.
Each cluster head broadcasts a CONNECT_CH packet periodically- every CH_CONNECT_INTERVAL –
within its virtual cluster and each cluster member uncast CONNECT_MN to its respective CH periodically -
Every MN_CONNECT _INTERVAL. On the other hand, if a new MN has not become a member in any
cluster, it has to uncast a CALL packet to its respective CHs. Since all mobile nodes except CHsuse unicating as
opposed to broadcasting, our clustering algorithm conserves the bandwidth and transmission power.[3]
In addition to other information regarding each virtual cluster, each periodic CONNECT_CH carries
the neighbor-table which is a set of MNs in the cluster and their latest Ω values. From the neighbor-table of
CONNECT_CH, each MN that resides within the same virtual cluster constructs its own neighbor-table, and
hence becomes aware of its neighbors. If any member node has not received a CONNECT_CHpacket from any
CH during the last three consecutive CH_CONNECT _INTERVAL periods, Each node of a particular virtual
cluster has to broadcast its protocol packet in order for other neighbor nodes to know about its existence[3]. This
enables the MNs within the virtual cluster to select one as their CH in a distributed manner. These control
packets are relayed by intermediate MNs only with in the virtual cluster. This is to enable CHs to get the
topology information of adjacent clusters. Given that each CH knows the predicted residence-time of each MN
within its cluster, it deletes the entry associated with a particular MN exactly „t0‟(system parameter) seconds
after its residence-time expires. This effect will be reflected in every CONNECT _CH packet a CH broadcasts
periodically. Also after having become a member ofa cluster, each MN can dynamically increase its MN_
CONNECT _INTERVAL until the new CH election process is triggered. Second aspect of our protocol is that,
particular CH determine its successor and inform its members using TARGET packet .
71
5. Clustering Approach in Route Selection Using Mobile Agent in Mobile Ad-Hoc Network
3.3.4 Management Architecture:
Network management is a process of controlling a complex data network in order to maximize
its efficiency and productivity. Generally it involves data collection, data processing, data analysis, and problem
fixing. However, this management related tasks have to be performed in an efficient and scalable way. The
clustering protocol is used to simplify the task of proper management in MANETs. [1].In case of
information collection and communication strategy, there are three types of network management
architectures: centralized, distributed, and hierarchical. In hierarchical model data collection is done by
intermediate levels of the hierarchy before forwarding it to upper layers of the hierarchy. Our (b,e,m)-
clustering approach facilitates this hierarchical management architecture that makes use of policy-based
management technique together with mobile agents forwarding it to upper layers of the hierarchy[8]. The
lowest level of this architecture consists of individual managed SNs. Several SNs are grouped into clusters
and managed by a cluster head (CH).
Fig 5 Hierarchical Management Architecture [2]
BS: Base Station, SN: Sensor Network CH: Cluster Head,
The cluster should take an optimal size, and should be stable most of the time in order to
enable the efficient data collection. These cluster heads are autonomously elected through our (b,e,m)-
clustering algorithm. The network manager, serving as a top-level manager, regulates and distributes
high level management policies such as QoS parameters and management rules to a group of cluster heads.
In hierarchical management, each cluster head provides functionality that is transparent to its network
manager, and hence cluster heads are autonomous in this respect.
In our approach it is assumed that all nodes have equal management software modules and states and
any node can become either cluster head or cluster member depending on clustering mechanism. Cluster head
itself manage entire ad hoc network. The reason why mobile agent technology is used here is that it can
dynamically deploy itself in an appropriate node and execute managerial. In our clustering algorithm, since each
cluster head knows the predicted lifetime of each of its members, the cluster heads and the mobile code that they
originate can perform managerial operations.
Moreover, using Mobility Tries, the cluster head would know the predicted mobility patterns of
its member nodes. In case a node moves from one virtual cluster to another, its respective cluster head
knows this from the Mobility Trie of the former. Our (b,e,m)-algorithm enables proactive cluster head
election process, that leads to continuous management operation without any interruption . In our three-level
hierarchy, the network manager is responsible for the PBNM operations, and can function as a policy server or
policy decision point [7]. Mobile agent technology is used again in our approach for policy distribution,
provisioning, and even for policy monitoring. Our(b,e,m)-clustering model facilitates each node to know about
the availability pattern of neighboring nodes, and thus enables the PBNM to be aware of the possible network
resources through prediction. The network manager is elected exactly the same way as the cluster head is
elected. It responsible for a particular region, and might contain a number of virtual clusters under it.
IV. INITIAL EVALUATION THROUGH SIMULATION
The main aim of this research is to design and implement a novel routing scheme based on mobile
agent technology in wireless ad-hoc networks that will provide the following benefits. Maximize network
performance, scalability, provide end-to-end reliable communications and reduce possible delays, and minimize
losses. Our initial simulation work attempts to compare the performance of our clustering algorithm
with the Lowest-ID, maximum-connectivity (Max-Connect) and Lowest Distance Value(LDV) clustering
algorithms, We performed our simulations using the GloMo Sim simulation package in which we implemented
and compared the Lowest-ID, Max-Connect, LDV and our algorithm [12]. The cluster stability can be
measured by determining the number oftimes each MN either attempts to become a CH or gives up its role
as a CH. In Fig. 6 it is measured by determining the number of MNs that have attempted to become the
CH at least once in 50 time period . As can be seen, in all the other three algorithms the numbers tend
to increase linearly with the node degree. our model has only a few numbers of MNs that have attempted
to become the CH, and hence improves stability.
72
6. Clustering Approach in Route Selection Using Mobile Agent in Mobile Ad-Hoc Network
Chart Title
200
attempts to be the CH
Number of MN's that
150 lowest ID
100 b,e,m-clustering
50 LDVP
0 Max connect
25 50 75 100 125 150
Fig.6 Number of MNs that Attempted to become the CH as a function of Node Degree.
V. CONCLUSIONS
The main objective is to use mobile agent technology for route selection in ad-hoc networks with
purpose to improve over traditional schemes in terms of performance, scalability and stability of clusters. A new
clustering approach that makes use of intelligent mobility prediction and location information in new long-term
MANETs was proposed in this paper. [1]This clustering approach is to enable the development of an
automated, intelligent[3],efficient and robust management architecture. To facilitate this, we introduced the
virtual cluster concept. in the network management perspective, it results in the following uniquebenefit:
[4] We could predict a specific MN‟s future positions and continue managerial operations without
interruptions in a proactive way
REFERENCES
[1]. S.Sivavakeesar, G.Pavlou, and Liotta, “Stable Clustering Through Mobility Prediction for Large-
Scale Multihop Intelligent Ad Hoc Networks|”, IEEE WCNC 2004, in press.
[2]. Muhammad Arshad ,Nasrullah Armi, Nidal Kamel and N. M.Saad.“Mobile data collector based routing
protocol for
[3]. wireless sensor networks”.Scientific Research and Essays Vol. 6(29), pp. 6162-6175, 30 November,
2011.
[4]. G.Santhi and Alamelu Nachiappan ,”Adaptive QoS Multicast Routing with Mobility Prediction in
MANET” ,Int.
[5]. Journal of Ad hoc, Sensor & Ubiquitous Computing, 2010,vol.1,No.3
[6]. Bita Safarzadeh, ShahramJamali, HamedAlimohammadi, “ A High Performance Scalable QoS Routing
Protocol for Mobile Ad Hoc Network”, Int. J. Comp. Tech. Appl. ,vol 2 (2), 332-339.
[7]. P.Basu, N.Khan, F. Znati, “Mobility Based Metric for Clustering in Mobile Ad Hoc Networks”,
Workshop on Distributed Computing System, 2001,pp.413-418.
[8]. Barolli L, Koyama A, Shiratori N, “ A QoS Routing Method for Ad-Hoc Networks Based on Genetic
Algorithm”, In: Proceeding of the 14th international workshop ondatabase and expert system
applications,2003, pp.175-179.
[9]. Du X,”QoS Routing Based on Multi-Class Nodes for Mobile Ad Hoc Networks”, Ad Hoc
Network,2004,pp.241-254.
[10]. Sun H, Hughes HD, “Adaptive QoS Routing Based on Prediction of Local Performance in Ad Hoc
Network”, In: Proceeding of IEEE conference on wireless communication and networking ,2003, pp.
1191-1195
[11]. B.McDonald, and F.Znati, “A Mobility-Based Framework for AdaptiveClustering in Wireless Ad Hoc
Networks”, IEEE Journal on SelectedAreas in Communications, vol. 17, August 1999, pp 1466 –
1487.
[12]. XiangbinZhu,Wenjuan Zhang.“A MobileAgent-based Clustering Data FusionAlgorithm in
WSN”,IJECE-2010.
[13]. McDonald et al., “Path availability model for wireless ad hoc networks” Proceeding of IEEE wireless
communications, 1999, (WCNC ‟99).
[14]. Jiang Shengming et al., “A prediction based link availability estimation for mobile ad-hoc networks”
IEEE Infocom, 2001.
[15]. SuW.Lee Sung-Ju et al., “ Mobility predictin and routing in ad-hoc wireless networks”» International
Journal of Network Management, 2001.
[16]. C.-C. Chiang, H.-K. Wu, W. Liu, M. Gerla, “Routing in Clustered Multihop, Mobile Wireless
Networks with Fading Channel,” Proceedings of SICON 1997.
73