CHAPTER 5 ANT-FUZZY META HEURISTIC GENETIC SENSOR NETWORK SYSTEM FOR MULTI - SINK AGGREGATED DATA TRANSMISSION

Size: px
Start display at page:

Download "CHAPTER 5 ANT-FUZZY META HEURISTIC GENETIC SENSOR NETWORK SYSTEM FOR MULTI - SINK AGGREGATED DATA TRANSMISSION"

Transcription

1 CHAPTER 5 ANT-FUZZY META HEURISTIC GENETIC SENSOR NETWORK SYSTEM FOR MULTI - SINK AGGREGATED DATA TRANSMISSION 5.1 INTRODUCTION Generally, deployment of Wireless Sensor Network (WSN) is based on a many to - one communication models, where a single sink node gathers data from a number of data resources. In recent times, developments with multiple sinks are gradually emerging, However, they struggle with a few demerits especially in the successful delivery of data to target region. The outcome of multiple communications formulates the existing works proposed for single-sink model useless. Hence data aggregation process will support the transmission of data to multiple sink nodes in an efficient manner. Wireless sensor network with the hierarchical organization of sensors aggregate the tasks into groups. The sensor nodes broadcast the aggregated data directly to the distant base station. The existing Mixed Integer Programming (MIP) formulation obtain the optimal solutions for multi-action processes using the genetic algorithm. However, MIP only deals with a resource scheduling problem in the field of Business Process execution plan and faces certain mean absolute error with lower transmission rate. MIP is not effectual in emerging hybrid genetic algorithms with the Tabu search meta-heuristics ant colony optimization. Another existing work 130

2 developed for security purpose termed as Dynamic secure end-to-end Data Aggregation with Privacy function (DyDAP) decreases the network load. DyDAP secures the data aggregation, but topological configuration is inappropriate when packet needs are to be transferred to multiple sink nodes. In order to develop the hybrid genetic algorithm on ant-fuzzy system, Hybrid (i.e.) ant-fuzzy Meta-heuristic Genetic method (HMG) based on the Tabu search is proposed in this chapter. Ant-fuzzy Meta heuristic Genetic method carries out the classification process on the aggregated data. The classification based on the genetic method uses the Tabu search - based mathematical operation to attain the feasible solution on multiple sinks. Initially, Ant-fuzzy Meta-heuristic Genetic method classifies the data record based on the weighted meta-heuristic distance. Genetic method combines the ant and fuzzy rule to optimize the classification capability with the weighted meta-heuristic distance. The classified records perform the Tabu search operation to transmit the aggregated data to the multiple sink nodes. HMG method achieves approximately 19 % improved transmitted message rate. Experiment is conducted in the network simulator on the factor such as transmission message rate, classification time, buffer level and the mean absolute relative error rate. 5.2 MULTIPLE SINKS IN WIRELESS SENSOR NETWORKS A single sink node gathers ecological data from a huge range of sensing devices. Hence communication routing is devised in order to offer secured and successful transmission to a single sink node. But most of the latest establishments gradually provide a better framework where the sensed data must be transmitted to 131

3 multiple sinks. Similarly, the framework definitely needs the same WSN to serve multiple applications, each operating on different resources. Moreover, the requirement for multiple sinks node occurs in the other cases. A sample multi - sink node is depicted in Figure 5.1. Figure 5.1 A Model representing multiple sink nodes The multiple sink nodes delivery as shown in Figure 5.1 involves two main sources or origins indicated in dark circles. The three different arrow marks denote the various path to the destination end or multiple sink nodes. Multiple sinks are increasingly and essentially needed to run latent applications and programming objectives. In general, data aggregation supports multiple sink node delivery as per the recent research reviews Issues related to Single Sink Based Data Aggregation Major difficulty faced in single sink - based data aggregation is elaborated below in detail, 132

4 i. In sensor data collection, multiple communication faces traffic overhead resulting in imbalance as well as high energy utilization in the complete network. Moreover, it leads to prior extinction of the network lifetime. Hence the open dispute is to prolong the network lifetime by minimizing the energy utilization and at the same time preserving energy efficiency. ii. Scalability trouble is vast in the single sink network framework. In single sink framework, the data aggregated at the sink may lead to more than its communication power due to the huge range of sensors usage in the network. Additionally, the radio channel capacity nearer to the sink may turn into excess if the typical number of hops between the source and the sink becomes overload. iii. In single sink network framework, if the sink is heavily loaded, then the data will not arrive at target region causing transmission failure Multiple Sink - based Data Aggregation for WSN A standard operation of the sensor network is data collection. Here the modeled data at each of the sensor nodes need to be delivered for the purpose of advanced processing and analysis for the sink node. In WSN, data aggregation is expected as the most important shared data, processing feature which consumes 133

5 energy and minimizes routing conflict. For wireless access connection in sensor networks, data aggregation is taken as a significant model. Data aggregation performs the process of data combination from different sources along the route discarding the repetitions as well as minimizing the transmission rate, thus consuming energy. Therefore the concentration is made on achieving energy consumption on efficient use of data aggregation function with successful delivery of data to multiple sink nodes. The information received from the sources is aggregated to reduce the number of transmission consuming energy. Due to limited resource utilization in sensor network, number of transmissions needs to be reduced in order to enhance the bandwidth utilization as well as to prolong network lifetime. WSN based on data aggregation protocol should be built with secure and energy efficient basis. The work in [79] investigates the association between energy security and data aggregation process in WSN. Classification of secure data aggregation protocols is made based on network topology and security. However, the research addressed many problems of data aggregation especially from the energy point of view. The scalability of sensor networks rises with the presence of the multiple sinks. By a simulated connection, all sink nodes are linked to the simulated sink node, in multiple sink networks which consecutively vary to a single destination turn around multiple destinations. Efficient data collection task is performed by the nodes, and then the optimal sink is selected for delivering the data in multiple sink networks. The mean length between the source nodes and the sink will be reduced in 134

6 the multi sink network resulting in energy consumption and prolonged network lifetime. The sink node behaves as an access in multi sink network, transmitting the sensed data to the storage system in the network by means of internet. Only the data generated by a specific set of resources is gathered by the sink and,then the complete event observed is rebuilt at the data storage system. The work in [51] develops a methodology for adopting business process semantics and other paths in the Business Process Management structure in order to address the problems related to achieve accurate execution of processes. The approach employs mixed integer programming (MIP) formulation for a businessprocess execution plan and a meta-heuristic algorithm to achieve best solutions for multi-activity processes. The purpose is to get the best task that gives the most efficient performance under resource restriction. However, an optimization technique of generating is not openly applicable to Business Process, which allows for substitute paths. In addition, MIP is unable to handle mean absolute error increasing transmission rate. MIP is still in the progress of cresting a hybrid genetic algorithm with the Tabu search meta-heuristics ant colony optimization. In addition to energy efficiency issues, security also plays a vital role in sensor network. An approach for dynamic secure end-to-end data aggregation with privacy function, named DyDAP, presented in [52] tackles the security management issues like anonymity and data integrity. Moreover, DyDAP incorporates a new aggregation 135

7 algorithm using a discrete-time control loop and is able to energetically manage innetwork data fusion to minimize the communication load. However, DyDAP needs extra attention to improve efficiency more specifically on considering multimedia application where the nodes exchange signals as data in sensor networks. The main drawback of DyDAP is that the system is not applicable to a set of topological configurations, i.e. containing multiple sink nodes. Keeping the above demerits in mind, the proposed work aims to address the issues related to energy efficiency. 5.3 HYBRID META-HEURISTIC GENETIC METHOD ON WIRELESS SENSOR NETWORK The main objective of the proposed work is to classify the aggregated data and perform the path searching process for effective transmission of data packets on the multiple sink nodes. The hybrid meta-heuristic genetic method involves two phases. The first phase performs the classification operation with the hybrid (i.e.) ant-fuzzy rule aggregated data information. The aggregated information is classified with the meta-heuristic genetic algorithm. After the classification, the second phase carries out the search process using the Tabu search for the effective transmission of the data packets on the sensor network. Architecture Diagram of the Hybrid Meta-heuristic Genetic (HMG) method is illustrated in Figure

8 Sensor network with Aggregated Data Classification operation Hybrid Meta-Heuristic Genetic method Weighted metaheuristic distance Tabu Search Path Selection Efficiency Transmit data packet to multi sink node Figure 5.2 Architecture Diagram of HMG method As illustrated in Figure 5.2, HMG method shows overall process briefly through the diagram. The energy effective data aggregation is performed on the sensor network using the fuzzy ant colony optimized clustering rule. The aggregated data through the ant-fuzzy rule perform the classification operation using the Hybrid Meta-Heuristic Genetic system. The classification process based on weighted metaheuristic form helps to increase the classification accuracy rate. Search process in identification of classification data is done using Tabu search in HMG method just to improve the path selection efficiency. The selection of path helps to transmit the data packet to multi-sink nodes. 137

9 5.3.1 Weighted Meta-Heuristic Distance for Classification Hybrid Meta-Heuristic Genetic system uses the ant-fuzzy aggregated data rule to classify the data packets. The genetic function uses the ant-fuzzy weights to classify the aggregate data. The hybrid genetic concept in HMG supports appropriate classification based on meta-heuristic chromosome weight distance computation in wireless sensor network. Meta-heuristic in HMG method represents the high level procedure elaborating the task of classification, searching and transmission of data packets to the destination sink nodes. Chromosome Weighted meta-heuristic is derived as ( )= 1 ( ), 2 ( ),. ( ) (1) Ant-Fuzzy rule as derived in (1) is represented as ( ). 1 ( ), 2 ( ) ( ) are the fuzzy set rules of 1,2 up to n respectively where the classification relies on weighted procedure. The weighted procedure in HMG method is computed as, g i (x) 0 (i=1,2,3...n) (2) ( ) 0 ( = 1, 2, 3 ) (3) 138

10 ( ) and ( ) denotes the classified part in HMG method using the metaheuristic chromosome weighted distance. The positive and negative values of chromosome weighted in HMG method vary based on the axes distance in sensor network. The meta-heuristic weighted chromosome distance concerns with the more generalized result using the ant-fuzzy rule. Chromosome Weighted Meta-heuristics is formularized as = ( ), ( ), = 0, =1 (4) where ( ), ( ) are the classified parts. If they are Equal to i, then the result will have accurate output on classification. Otherwise, the result is set to zero in Chromosome Weighted Meta-heuristics (CWM) form. Chromosome Weighted Meta-heuristics in HMG method makes a few assumptions about the classification process so that they are usable for a variety of multi - sink packet transmission Hybrid genetic Algorithm Chromosomes are vectors of real-valued weights from the hybrid (i.e.) antfuzzy rule. Each chromosome is a vector with the weight count of decimal numbers. Moreover, vector value of the chromosome is associated with each classification attribute in HMG method. The relation between the chromosome and classification 139

11 attribute supports a better way to increase the classification accuracy such that data is delivered perfectly. Hybrid genetic Algorithm - based classification is demonstrated in Figure 5.3 Network Environment Aggregated Data Hybrid GA Environment Initial population Parent Chromosome Fitness Evaluation Child Chromosome (offspring) Performs Classification Figure 5.3 Hybrid Genetic Algorithm - based Classification 140

12 Figure 5.3 describes the classification of aggregated data using the hybrid genetic algorithm. The initial population is measured in hybrid genetic method to easily forecast the classification time. The populated chromosome measures the weight using the fitness function. The fitness function is measured for each parent chromosome selection. The selected parent chromosome performs the weighted meta-heuristic measure to classify the child chromosome (i.e.) offspring in sensor network. The goal of the hybrid genetic algorithm is to have an attribute fitness vector from the ant-fuzzy weights and to improve the classification accuracy. These computations are used in a number of ways to evaluate the functions as explained in the hybrid genetic algorithmic steps. //Sensor Network Environment Step 1: Step 2: Begin with aggregated Data Initialize a population P of n data packets from sensor network Step 3: Step 4: Step 5: Step 6: For every population P Fitness function is evaluated on n data packets If data packet passes the weighted criteria test, Then the classification process is preceded, until the specified termination condition 141

13 Step 7: Step 8: Step 9: End if For each Parent Chromosome selection Child Chromosome (i.e.) offspring is classified based on parent attribute vector value Step 10: Step 11: Step 12: End For End For End The classified attribute is associated with initial population of chromosome to generate effective aggregated data. On repeated iteration, chromosomes are evaluated through each data aggregated group classifying each data based on its chromosome meta-heuristic weights in HMG method. The parent and offspring chromosomes are effectively selected using the hybrid genetic algorithm for the ant-fuzzy rule - based data packet classification Tabu Search in HMG method The classified Ant-fuzzy rule data aggregation in HMG method performs the searching process through Tabu mathematical operation. The Tabu search in HMG method refers to the set of classification rules to formulate the binary programming. The ant-fuzzy rule with the meta-heuristic genetic method aims to reduce the delay 142

14 time. The delay time is minimized in HMG method by judging the result of the individual users and formularized as =1 =1 =1 (5) = [, ] Tabu search time minimizes the delay count by computing (5) for each of the =1 =1 =1 users., [, ] are weight results of the meta-heuristics. The Tabu search reduces the memory structure in HMG method so that the delay strategic point is reduced. The classified records perform the Tabu search operation to transmit the aggregated data to the multiple sink nodes without any strategic delay. The metaheuristic weight guides to search the best result and explores solution space. Initially, Tabu search assumes i*=i and k=0, where k=0 at the root node. Tabu search in HMG method is described as, Step 1: Choose a data packet i from the population set P Step 2: K=k+1, when travelled through each node with the data packets Step 3: Binary programming choose best path from chromosome set Step 4: If ( )< ( ), then i* = i. Step 5: Update Tabu and goal conditions for transmit data packet to multi-sinks Step 6: User request satisfied, then stop, else go to Step 2 Step 7: End If 143

15 Tabu search in HMG method offers the bilinear path to transmit the ant-fuzzy rule - based data packets to the multiple sink nodes. The size of the data packets is measured in order to easily identify the transmission time using the HMG method. The program specifies the sink nodes and connected objective function. The first term denotes parent or root attribute values and the second term denotes the offspring attribute values. The Tabu search - based data packet transmission in HMG is demonstrated in Figure 5.4. Root Attribute Off Spring Attribute Figure 5.4 Multi Sink Data Packet Transmission Tabu search is used to transmit the ant-fuzzy data packets to the multiple sink nodes with the feasible solution. In the first stage of data packet transmission in HMG method, a quality solution is generated with the root path selection. After the root path selection, the offspring (i.e.) forwarding nodes are evaluated to improve the 144

16 diversity of result. Finally, a diversification strategy is used in HMG method to generate a new initial solution to reinitialize the procedure and perform data aggregation process for the other set of features. 5.4 HMG EXPERIMENTAL WORK EVALUATION Hybrid ant fuzzy Meta-heuristic Genetic method (HMG) based on Tabu search is experimented on ns-2 network simulator. The sensor network taken for the experiment purpose performs the classification process on the aggregated data. The network range taken for the experimental work is about 1000*1000 m. The Random Waypoint model is developed to randomly classify and move another sensed node location point. The RWM model relocates to a randomly chosen location to perform the effective transmission on the multiple sink nodes. HMG takes 25 milliseconds on each simulation, and averagely 80 sensor nodes are taken for the experimental evaluation. The chosen nodes randomly move with a selected velocity and speed. The minimum moving speed of the sensor node is about 4.0 m/s of each sensed node. The random movement of sensor node uses Dynamic Source Routing (DSR) Protocol to perform the experimental evaluation in the HMG method. The experiment is conducted on the parameters such as overall transmitted message rate, classification time, buffer level and mean absolute relative error. 145

17 5.5 RESULT ANALYSIS ON HMG MODEL HMG method performs experimental work and compares the result percentage on the existing Mixed Integer Programming (MIP) formulation in [51] and Dynamic secure end-to-end Data Aggregation with Privacy function (DyDAP) in [52]. The existing and the proposed HMG functional parameters are analyzed through table values and graph points. This algorithm is implemented in ns-2 network simulator Transmitted Message rate Transmission message rate is defined as the degree of accuracy in transferring the data packets to multiple sink nodes in sensor network. Transmission message rate is measured in terms of meter per second (m/s). ( / ) = ( ) Message size and travelling distance and time vary on each request. Higher the transmission message rates, then better the throughput of the system. The values are taken from the trace files of ns-2 network simulator. With message size of 5120 KB, the overall transmitted message rate (m/s) using the existing methods MIP and DyDAP were measured to be m/s and m/s, whereas the proposed HMG recorded m/s. 146

18 Example: Transmitted Message Rate =Distance Travelled/Time required to reach multiple sink node Time required to reach multiple sink node = milli sec Overall Transmitted Message Rate = 80/ Overall Transmitted Message Rate = m/ s Table 5.1 Tabulation of Overall Transmitted Message Rate Message Size (KB) Overall Transmitted Message Rate (m/s) DyDAP HMG MIP method function method The experimental work is conducted for different message sizes with network throughput maintained at 90 as tabulated in Table

19 Overall Transmitted Message Rate (m/s) MIP method DyDAP function HMG method Message Size (KB) Figure 5.5 Measure of Overall Transmitted Message Rate Figure 5.5 describes the transmitted message rate of HMG method, MIP method [51] and DyDAP function [52]. In HMG, hybrid genetic concept is adopted to provide better transmission with the help of meta-heuristic chromosome weight distance computation in wireless sensor network. Meta-heuristic in HMG method improves the transmission rate by % when compared with the MIP method [51]. Existing MIP [51] drops certain packets during transmission at the time of resource assignment by changing the currently assigned resource into one of its alternatives, which leads to lower transmission rate. HMG method transmits the data packets from 7 13 % improved when compared with the DyDAP function [52]. As the power supply is limited in DyDAP function [52], data to be transferred is stuck in-between paths transmission causing lower transmission message rate. 148

20 5.5.2 Classification Time Classification time is defined as the amount of time taken to classify the aggregated data based on the hybrid genetic algorithm. Classification time is evaluated as = Duration of start and end time gives the actual classification time period which actually represents the classification data accuracy. The values are taken from the trace files of ns-2 network simulator. In terms of classification time (sec), with respect to data record size (KB), MIP and DyDAP recorded 440 and 420 sec whereas using the proposed HMG the classification time was measured to be 400 sec. Example: Data Record Size = 50 KB Classification Time = End time for classification -Start time for classification Classification Time = 600 sec -200 sec = 400 sec Table 5.2 Tabulation of Classification Time Data Record Classification Time (sec) Size (KB) MIP method DyDAP function HMG method

21 Classification time measures are shown in Table 5.2 in comparison with the existing MIP method [51], DyDAP function [52] and the proposed HMG method. Classification Time (sec) MIP method DyDAP function HMG method Data Record Size (KB) Figure 5.6 Performance of Classification Time Figure 5.6 presented the classification time based on the varied data record sizes in terms of kilo bytes (KB). In HMG method, ( ) and ( ) denote the classified parts using the meta-heuristic chromosome so that the classification rate is reduced up to 3 14 % when compared with the MIP method [51] as decoding is done with the designed chromosome procedure with higher time instead of classification. The positive and negative values of chromosome weight value provide easy way to classification with axes distance measure so that the HMG method takes 2 8 % less time to classify when compared with the DyDAP function [52], while 150

22 DyDAP function requires additional time in handling with node reputation information Buffer Level In general, the buffer is considered as storage space in need to load the data temporarily so the nodes buffer size is the most important aspect within the network. If the amount of the buffer is filled, then packet will be dropped causing congestion in the sensor node. Buffer level denotes the higher memory space provided by the system to store data. ( )= Buffered rate is defined as the region of memory storage measurement. The memory storage is maintained high for storage of more messages in HMG method, and it is measured in terms of MB. The values are taken from the trace files of ns-2 network simulator. The buffer level (KB) attained 3495 KB using the proposed HMG whereas the existing MIP and DyDAP recorded 3198 KB and 3070 KB with respect to time. Example: Data Size = 20 KB Buffer Level = Actual memory space available/ Total Data size to be stored = 600/ Buffer Level =3495 KB 151

23 Table 5.3 Tabulation of Buffer Level Buffer Level (KB) DyDAP Data Size MIP method function HMG method Table 5.3 demonstrates the buffer level value of the HMG method, MIP method [51] and DyDAP function [52]. As per the tabulation result, the proposed HMG method offers a higher space for data storage temporarily Buffer Level (KB) Data Size MIP method DyDAP function HMG method Figure 5.7 Measure of Buffer Level 152

24 Figure 5.7 measures the buffer level rate or memory rate of the HMG method based on the simulation time. As the simulation time varies, the buffer level for storing the information is also strengthened (i.e.) expanded. The effective memory structure development in HMG method improves buffer level by 4 10 % when compared with the MIP method [51] and 4 13 % when compared with the DyDAP function [52]. Tabu search performs the effective transmission with effective utilization of the buffer level of the sensor network. The crossover operation in MIP [51] requires additional memory to store the combined parent, and offspring chromosomes result in ineffective buffer level. At the same time, the buffer needs to store the result of data anonymity mechanisms based on data cloaking and privacy policy values resulting in higher requirement of buffer memory space Mean Absolute Error rate Mean Absolute Error rate is the number of imperfectly established data packets from the total number of received data packets at the different time intervals. =.. Mean Absolute Error rate is measured in terms of the percentage, and the expected value of error rate is measured in decimal points.the values are taken from the trace files of ns-2 network simulator. The mean absolute error rate (%) was 153

25 observed to be % and % using MIP and DyDAP when compared to the proposed HMG which recorded %. Example: No of Nodes =10 Mean Absolute Error rate = No. of incorrectly received data packets/ Total no. of data packets received = (6/80.2)*100 % Mean Absolute Error rate = *100 % Table 5.4 Tabulation of Mean Absolute Error rate No. of nodes Mean Absolute Error rate *100(%) MIP method DyDAP function HMG method Table 5.4 depicts the tabulation for error rate found at the receiver side on prediction of faulty data packet. 154

26 Mean Absolute Error Rate (%) MIP method DyDAP function HMG method No.of nodes Figure 5.8 Measure of Mean Absolute Error rate Figure 5.8 depicts the mean absolute error rate based on the node count of the sensor network. The classified attribute in accordance with initial population of chromosome easily predicts the faults minimizing the relative error. Chromosomes are evaluated by iterating through each data aggregated group so that the mean absolute error rate is reduced up to % when compared with the MIP method [51]. Whereas the objective function performs a merging operation to split activity in transmission, so error rate is high in MIP method [51]. In HMG method, the parent and offspring chromosomes are effectively selected using the hybrid genetic algorithm providing a better way to reduce error rate for about 2 10 % when compared with the DyDAP function [52]. Because, DyDAP [52] alters the real position of the nodes at data cloaking anonymity approaches, the chance of mean error rate is high. 155

27 Finally, Hybrid Meta-heuristic Genetic method facilitates the process of classification on using ant-fuzzy rule - based data aggregation set. Hybrid genetic algorithm is more appropriate even to a wide variety of real number to achieve the best result in the wireless sensor network. The classified data are transmitted with the aid of Tabu search - based data path selection and transmission of information. Moreover, HMG mode is able to provide a successful transmission rate with sufficient buffer level in a minimum classification time discarding the error rate at the receiver side. 5.6 SUMMARY The algorithm Hybrid (i.e.,) ant-fuzzy Meta-heuristic Genetic (HMG) is the best as it develops hybrid genetic algorithm on ant fuzzy system for multi sink data aggregated transmission based on the Tabu search. The Ant-fuzzy Meta heuristic Genetic method is the best as it carries out the classification process on the aggregated data using the Tabu search based mathematical operation to attain the feasible solution on multiple sinks improving the buffer level. Further, the Ant-fuzzy Meta-heuristic Genetic method classifies the data record based on the weighted metaheuristic distance. Genetic method combines the ant and fuzzy rule to optimize the classification capability with the weighted meta-heuristic distance and therefore reducing the classification time. The classified records perform the Tabu search operation to transmit the aggregated data to the multiple sink nodes improving the overall transmitted message rate and reducing the mean absolute error rate. The proposed HMG is comparatively better than the existing methods Mixed Integer 156

28 Programming (MIP) formulation and Dynamic secure end-to-end Data Aggregation with Privacy function (DyDAP), in terms of parameters namely, overall transmitted message rate, classification time, buffer level and mean absolute error rate. With message size of 5120 KB, the overall transmitted message rate (m/s) using the existing methods MIP and DyDAP were measured to be m/s and m/s, whereas the proposed HMG recorded m/s. In terms of classification time (sec), with respect to data record size (KB), MIP and DyDAP recorded 440 and 420 sec whereas using the proposed HMG the classification time was measured to be 400 sec. The buffer level (KB) attained 3495 KB using the proposed HMG whereas the existing MIP and DyDAP recorded 3198 KB and 3070 KB with respect to time. Finally, the mean absolute error rate (%) was observed to be % and % using MIP and DyDAP when compared to the proposed HMG which recorded %. The Tabu search improves the path efficiency rate to % in contrast to the other existing works. Hybrid genetic algorithm reduces the mean absolute error rate predicting the faulty packets received. In addition, HMG model achieves improved classification performance in a realistic time. HMG method is more useful with higher benefits to different contexts of sensor network for transmitting the data packet successfully to the multiple sink nodes. Network simulator justified the better performance of HMG model by offering higher memory space increasing the buffer level memory rate on balancing the memory with Tabu search. Tabu search employed in HMG method gives an effective transmission of the ant-fuzzy data packets in wireless sensor network. 157

IMPROVING THE DATA COLLECTION RATE IN WIRELESS SENSOR NETWORKS BY USING THE MOBILE RELAYS

IMPROVING THE DATA COLLECTION RATE IN WIRELESS SENSOR NETWORKS BY USING THE MOBILE RELAYS IMPROVING THE DATA COLLECTION RATE IN WIRELESS SENSOR NETWORKS BY USING THE MOBILE RELAYS 1 K MADHURI, 2 J.KRISHNA, 3 C.SIVABALAJI II M.Tech CSE, AITS, Asst Professor CSE, AITS, Asst Professor CSE, NIST

More information

Chapter 6 Route Alteration Based Congestion Avoidance Methodologies For Wireless Sensor Networks

Chapter 6 Route Alteration Based Congestion Avoidance Methodologies For Wireless Sensor Networks Chapter 6 Route Alteration Based Congestion Avoidance Methodologies For Wireless Sensor Networks Early studies shows that congestion avoid in wireless sensor networks (WSNs) is a critical issue, it will

More information

Chapter 7 CONCLUSION

Chapter 7 CONCLUSION 97 Chapter 7 CONCLUSION 7.1. Introduction A Mobile Ad-hoc Network (MANET) could be considered as network of mobile nodes which communicate with each other without any fixed infrastructure. The nodes in

More information

Crew Scheduling Problem: A Column Generation Approach Improved by a Genetic Algorithm. Santos and Mateus (2007)

Crew Scheduling Problem: A Column Generation Approach Improved by a Genetic Algorithm. Santos and Mateus (2007) In the name of God Crew Scheduling Problem: A Column Generation Approach Improved by a Genetic Algorithm Spring 2009 Instructor: Dr. Masoud Yaghini Outlines Problem Definition Modeling As A Set Partitioning

More information

SUMMERY, CONCLUSIONS AND FUTURE WORK

SUMMERY, CONCLUSIONS AND FUTURE WORK Chapter - 6 SUMMERY, CONCLUSIONS AND FUTURE WORK The entire Research Work on On-Demand Routing in Multi-Hop Wireless Mobile Ad hoc Networks has been presented in simplified and easy-to-read form in six

More information

Analysis of Cluster based Routing Algorithms in Wireless Sensor Networks using NS2 simulator

Analysis of Cluster based Routing Algorithms in Wireless Sensor Networks using NS2 simulator Analysis of Cluster based Routing Algorithms in Wireless Sensor Networks using NS2 simulator Ashika R. Naik Department of Electronics & Tele-communication, Goa College of Engineering (India) ABSTRACT Wireless

More information

Data gathering using mobile agents for reducing traffic in dense mobile wireless sensor networks

Data gathering using mobile agents for reducing traffic in dense mobile wireless sensor networks Mobile Information Systems 9 (23) 295 34 295 DOI.3233/MIS-364 IOS Press Data gathering using mobile agents for reducing traffic in dense mobile wireless sensor networks Keisuke Goto, Yuya Sasaki, Takahiro

More information

All Rights Reserved 2017 IJARCET

All Rights Reserved 2017 IJARCET END-TO-END DELAY WITH MARKOVIAN QUEUING BASED OPTIMUM ROUTE ALLOCATION FOR MANETs S. Sudha, Research Scholar Mrs. V.S.LAVANYA M.Sc(IT)., M.C.A., M.Phil., Assistant Professor, Department of Computer Science,

More information

An Energy Efficient and Delay Aware Data Collection Protocol in Heterogeneous Wireless Sensor Networks A Review

An Energy Efficient and Delay Aware Data Collection Protocol in Heterogeneous Wireless Sensor Networks A Review Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology IJCSMC, Vol. 4, Issue. 5, May 2015, pg.934

More information

CACHING IN WIRELESS SENSOR NETWORKS BASED ON GRIDS

CACHING IN WIRELESS SENSOR NETWORKS BASED ON GRIDS International Journal of Wireless Communications and Networking 3(1), 2011, pp. 7-13 CACHING IN WIRELESS SENSOR NETWORKS BASED ON GRIDS Sudhanshu Pant 1, Naveen Chauhan 2 and Brij Bihari Dubey 3 Department

More information

CHAPTER 5 ENERGY MANAGEMENT USING FUZZY GENETIC APPROACH IN WSN

CHAPTER 5 ENERGY MANAGEMENT USING FUZZY GENETIC APPROACH IN WSN 97 CHAPTER 5 ENERGY MANAGEMENT USING FUZZY GENETIC APPROACH IN WSN 5.1 INTRODUCTION Fuzzy systems have been applied to the area of routing in ad hoc networks, aiming to obtain more adaptive and flexible

More information

Computation of Multiple Node Disjoint Paths

Computation of Multiple Node Disjoint Paths Chapter 5 Computation of Multiple Node Disjoint Paths 5.1 Introduction In recent years, on demand routing protocols have attained more attention in mobile Ad Hoc networks as compared to other routing schemes

More information

CONCLUSIONS AND SCOPE FOR FUTURE WORK

CONCLUSIONS AND SCOPE FOR FUTURE WORK Introduction CONCLUSIONS AND SCOPE FOR FUTURE WORK 7.1 Conclusions... 154 7.2 Scope for Future Work... 157 7 1 Chapter 7 150 Department of Computer Science Conclusion and scope for future work In this

More information

2. LITERATURE REVIEW. Performance Evaluation of Ad Hoc Networking Protocol with QoS (Quality of Service)

2. LITERATURE REVIEW. Performance Evaluation of Ad Hoc Networking Protocol with QoS (Quality of Service) 2. LITERATURE REVIEW I have surveyed many of the papers for the current work carried out by most of the researchers. The abstract, methodology, parameters focused for performance evaluation of Ad-hoc routing

More information

Time Synchronization in Wireless Sensor Networks: CCTS

Time Synchronization in Wireless Sensor Networks: CCTS Time Synchronization in Wireless Sensor Networks: CCTS 1 Nerin Thomas, 2 Smita C Thomas 1, 2 M.G University, Mount Zion College of Engineering, Pathanamthitta, India Abstract: A time synchronization algorithm

More information

A hierarchical network model for network topology design using genetic algorithm

A hierarchical network model for network topology design using genetic algorithm A hierarchical network model for network topology design using genetic algorithm Chunlin Wang 1, Ning Huang 1,a, Shuo Zhang 2, Yue Zhang 1 and Weiqiang Wu 1 1 School of Reliability and Systems Engineering,

More information

Routing Protocols in MANETs

Routing Protocols in MANETs Chapter 4 Routing Protocols in MANETs 4.1 Introduction The main aim of any Ad Hoc network routing protocol is to meet the challenges of the dynamically changing topology and establish a correct and an

More information

WSN Routing Protocols

WSN Routing Protocols WSN Routing Protocols 1 Routing Challenges and Design Issues in WSNs 2 Overview The design of routing protocols in WSNs is influenced by many challenging factors. These factors must be overcome before

More information

Intra and Inter Cluster Synchronization Scheme for Cluster Based Sensor Network

Intra and Inter Cluster Synchronization Scheme for Cluster Based Sensor Network Intra and Inter Cluster Synchronization Scheme for Cluster Based Sensor Network V. Shunmuga Sundari 1, N. Mymoon Zuviria 2 1 Student, 2 Asisstant Professor, Computer Science and Engineering, National College

More information

Journal of Electronics and Communication Engineering & Technology (JECET)

Journal of Electronics and Communication Engineering & Technology (JECET) Journal of Electronics and Communication Engineering & Technology (JECET) JECET I A E M E Journal of Electronics and Communication Engineering & Technology (JECET)ISSN ISSN 2347-4181 (Print) ISSN 2347-419X

More information

Content. 1. Introduction. 2. The Ad-hoc On-Demand Distance Vector Algorithm. 3. Simulation and Results. 4. Future Work. 5.

Content. 1. Introduction. 2. The Ad-hoc On-Demand Distance Vector Algorithm. 3. Simulation and Results. 4. Future Work. 5. Rahem Abri Content 1. Introduction 2. The Ad-hoc On-Demand Distance Vector Algorithm Path Discovery Reverse Path Setup Forward Path Setup Route Table Management Path Management Local Connectivity Management

More information

Chapter -6 IMPROVED CONGESTION CONTROL MECHANISM FOR REAL TIME DATA TRANSMISSION

Chapter -6 IMPROVED CONGESTION CONTROL MECHANISM FOR REAL TIME DATA TRANSMISSION Chapter -6 IMPROVED CONGESTION CONTROL MECHANISM FOR REAL TIME DATA TRANSMISSION Chapter 6 IMPROVED CONGESTION CONTROL MECHANISM FOR REAL TIME DATA TRANSMISSION 6.1 Introduction Supporting Quality of Service

More information

An Improved Genetic Algorithm based Fault tolerance Method for distributed wireless sensor networks.

An Improved Genetic Algorithm based Fault tolerance Method for distributed wireless sensor networks. An Improved Genetic Algorithm based Fault tolerance Method for distributed wireless sensor networks. Anagha Nanoti, Prof. R. K. Krishna M.Tech student in Department of Computer Science 1, Department of

More information

Design and Development of Secure Data Cache Framework. Please purchase PDF Split-Merge on to remove this watermark.

Design and Development of Secure Data Cache Framework. Please purchase PDF Split-Merge on   to remove this watermark. Design and Development of Secure Data Cache Framework CHAPTER 6 DESIGN AND DEVELOPMENT OF A SECURE DATA CACHE FRAMEWORK The nodes of the MANETs act as host and a router without trustworthy gateways. An

More information

ROUTING ALGORITHMS Part 1: Data centric and hierarchical protocols

ROUTING ALGORITHMS Part 1: Data centric and hierarchical protocols ROUTING ALGORITHMS Part 1: Data centric and hierarchical protocols 1 Why can t we use conventional routing algorithms here?? A sensor node does not have an identity (address) Content based and data centric

More information

IJREAT International Journal of Research in Engineering & Advanced Technology, Volume 1, Issue 2, April-May, 2013 ISSN:

IJREAT International Journal of Research in Engineering & Advanced Technology, Volume 1, Issue 2, April-May, 2013 ISSN: Fast Data Collection with Reduced Interference and Increased Life Time in Wireless Sensor Networks Jayachandran.J 1 and Ramalakshmi.R 2 1 M.Tech Network Engineering, Kalasalingam University, Krishnan koil.

More information

CHAPTER 5 PROPAGATION DELAY

CHAPTER 5 PROPAGATION DELAY 98 CHAPTER 5 PROPAGATION DELAY Underwater wireless sensor networks deployed of sensor nodes with sensing, forwarding and processing abilities that operate in underwater. In this environment brought challenges,

More information

Wireless Sensor Networks: Clustering, Routing, Localization, Time Synchronization

Wireless Sensor Networks: Clustering, Routing, Localization, Time Synchronization Wireless Sensor Networks: Clustering, Routing, Localization, Time Synchronization Maurizio Bocca, M.Sc. Control Engineering Research Group Automation and Systems Technology Department maurizio.bocca@tkk.fi

More information

Traffic balancing-based path recommendation mechanisms in vehicular networks Maram Bani Younes *, Azzedine Boukerche and Graciela Román-Alonso

Traffic balancing-based path recommendation mechanisms in vehicular networks Maram Bani Younes *, Azzedine Boukerche and Graciela Román-Alonso WIRELESS COMMUNICATIONS AND MOBILE COMPUTING Wirel. Commun. Mob. Comput. 2016; 16:794 809 Published online 29 January 2015 in Wiley Online Library (wileyonlinelibrary.com)..2570 RESEARCH ARTICLE Traffic

More information

An Industrial Employee Development Application Protocol Using Wireless Sensor Networks

An Industrial Employee Development Application Protocol Using Wireless Sensor Networks RESEARCH ARTICLE An Industrial Employee Development Application Protocol Using Wireless Sensor Networks 1 N.Roja Ramani, 2 A.Stenila 1,2 Asst.professor, Dept.of.Computer Application, Annai Vailankanni

More information

Routing protocols in WSN

Routing protocols in WSN Routing protocols in WSN 1.1 WSN Routing Scheme Data collected by sensor nodes in a WSN is typically propagated toward a base station (gateway) that links the WSN with other networks where the data can

More information

Mobile Agent Driven Time Synchronized Energy Efficient WSN

Mobile Agent Driven Time Synchronized Energy Efficient WSN Mobile Agent Driven Time Synchronized Energy Efficient WSN Sharanu 1, Padmapriya Patil 2 1 M.Tech, Department of Electronics and Communication Engineering, Poojya Doddappa Appa College of Engineering,

More information

Novel Cluster Based Routing Protocol in Wireless Sensor Networks

Novel Cluster Based Routing Protocol in Wireless Sensor Networks ISSN (Online): 1694-0784 ISSN (Print): 1694-0814 32 Novel Cluster Based Routing Protocol in Wireless Sensor Networks Bager Zarei 1, Mohammad Zeynali 2 and Vahid Majid Nezhad 3 1 Department of Computer

More information

CLUSTER BASED ROUTING PROTOCOL FOR WIRELESS SENSOR NETWORKS

CLUSTER BASED ROUTING PROTOCOL FOR WIRELESS SENSOR NETWORKS CLUSTER BASED ROUTING PROTOCOL FOR WIRELESS SENSOR NETWORKS M.SASIKUMAR 1 Assistant Professor, Dept. of Applied Mathematics and Computational Sciences, PSG College of Technology, Coimbatore, Tamilnadu,

More information

TCP Window Estimation for Burst Assembly in OBS Networks

TCP Window Estimation for Burst Assembly in OBS Networks TCP Window Estimation for Burst Assembly in OBS Networks Maurizio Casoni (maurizio.casoni@unimore.it) Department of Information Engineering University of Modena and Reggio Emilia Italy Outline Introduction:

More information

Modulation-Aware Energy Balancing in Hierarchical Wireless Sensor Networks 1

Modulation-Aware Energy Balancing in Hierarchical Wireless Sensor Networks 1 Modulation-Aware Energy Balancing in Hierarchical Wireless Sensor Networks 1 Maryam Soltan, Inkwon Hwang, Massoud Pedram Dept. of Electrical Engineering University of Southern California Los Angeles, CA

More information

SIMULATION FRAMEWORK MODELING

SIMULATION FRAMEWORK MODELING CHAPTER 5 SIMULATION FRAMEWORK MODELING 5.1 INTRODUCTION This chapter starts with the design and development of the universal mobile communication system network and implementation of the TCP congestion

More information

End-To-End Delay Optimization in Wireless Sensor Network (WSN)

End-To-End Delay Optimization in Wireless Sensor Network (WSN) Shweta K. Kanhere 1, Mahesh Goudar 2, Vijay M. Wadhai 3 1,2 Dept. of Electronics Engineering Maharashtra Academy of Engineering, Alandi (D), Pune, India 3 MITCOE Pune, India E-mail: shweta.kanhere@gmail.com,

More information

Multicast Routing with Load Balancing in Multi-Channel Multi-Radio Wireless Mesh Networks

Multicast Routing with Load Balancing in Multi-Channel Multi-Radio Wireless Mesh Networks (IJACSA) International Journal of Advanced Computer Science and Applications, Multicast Routing with Load Balancing in Multi-Channel Multi-Radio Wireless Mesh Networks Atena Asami, Majid Asadi Shahmirzadi,

More information

Blackhole Attack Detection in Wireless Sensor Networks Using Support Vector Machine

Blackhole Attack Detection in Wireless Sensor Networks Using Support Vector Machine International Journal of Wireless Communications, Networking and Mobile Computing 2016; 3(5): 48-52 http://www.aascit.org/journal/wcnmc ISSN: 2381-1137 (Print); ISSN: 2381-1145 (Online) Blackhole Attack

More information

Survey on Reliability Control Using CLR Method with Tour Planning Mechanism in WSN

Survey on Reliability Control Using CLR Method with Tour Planning Mechanism in WSN Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology IJCSMC, Vol. 4, Issue. 5, May 2015, pg.854

More information

WSN NETWORK ARCHITECTURES AND PROTOCOL STACK

WSN NETWORK ARCHITECTURES AND PROTOCOL STACK WSN NETWORK ARCHITECTURES AND PROTOCOL STACK Sensing is a technique used to gather information about a physical object or process, including the occurrence of events (i.e., changes in state such as a drop

More information

DETECTING SYBIL ATTACK USING HYBRID FUZZY K-MEANS ALGORITHM IN WSN

DETECTING SYBIL ATTACK USING HYBRID FUZZY K-MEANS ALGORITHM IN WSN DETECTING SYBIL ATTACK USING HYBRID FUZZY K-MEANS ALGORITHM IN WSN 1 Shipra Diwakar, 2 Dr. R. Kashyup 1 Research Scholar, 2 HOD ECE Rayat Bahara University Ropar, Punjab ABSTRACT Security in Wireless Sensor

More information

CASER Protocol Using DCFN Mechanism in Wireless Sensor Network

CASER Protocol Using DCFN Mechanism in Wireless Sensor Network Volume 118 No. 7 2018, 501-505 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu ijpam.eu CASER Protocol Using DCFN Mechanism in Wireless Sensor Network A.Shirly

More information

Handling Multi Objectives of with Multi Objective Dynamic Particle Swarm Optimization

Handling Multi Objectives of with Multi Objective Dynamic Particle Swarm Optimization Handling Multi Objectives of with Multi Objective Dynamic Particle Swarm Optimization Richa Agnihotri #1, Dr. Shikha Agrawal #1, Dr. Rajeev Pandey #1 # Department of Computer Science Engineering, UIT,

More information

Delay Performance of Multi-hop Wireless Sensor Networks With Mobile Sinks

Delay Performance of Multi-hop Wireless Sensor Networks With Mobile Sinks Delay Performance of Multi-hop Wireless Sensor Networks With Mobile Sinks Aswathy M.V & Sreekantha Kumar V.P CSE Dept, Anna University, KCG College of Technology, Karappakkam,Chennai E-mail : aswathy.mv1@gmail.com,

More information

A Review: Optimization of Energy in Wireless Sensor Networks

A Review: Optimization of Energy in Wireless Sensor Networks A Review: Optimization of Energy in Wireless Sensor Networks Anjali 1, Navpreet Kaur 2 1 Department of Electronics & Communication, M.Tech Scholar, Lovely Professional University, Punjab, India 2Department

More information

Predicting connection quality in peer-to-peer real-time video streaming systems

Predicting connection quality in peer-to-peer real-time video streaming systems Predicting connection quality in peer-to-peer real-time video streaming systems Alex Giladi Jeonghun Noh Information Systems Laboratory, Department of Electrical Engineering Stanford University, Stanford,

More information

Performance Evaluation of AODV and DSDV Routing Protocol in wireless sensor network Environment

Performance Evaluation of AODV and DSDV Routing Protocol in wireless sensor network Environment 2012 International Conference on Computer Networks and Communication Systems (CNCS 2012) IPCSIT vol.35(2012) (2012) IACSIT Press, Singapore Performance Evaluation of AODV and DSDV Routing Protocol in wireless

More information

Performance Analysis of MANET Routing Protocols OLSR and AODV

Performance Analysis of MANET Routing Protocols OLSR and AODV VOL. 2, NO. 3, SEPTEMBER 211 Performance Analysis of MANET Routing Protocols OLSR and AODV Jiri Hosek Faculty of Electrical Engineering and Communication, Brno University of Technology Email: hosek@feec.vutbr.cz

More information

Design and Implementation of detecting the failure of sensor node based on RTT time and RTPs in WSNs

Design and Implementation of detecting the failure of sensor node based on RTT time and RTPs in WSNs Design and Implementation of detecting the failure of sensor node based on RTT time and RTPs in WSNs Girish K 1 and Mrs. Shruthi G 2 1 Department of CSE, PG Student Karnataka, India 2 Department of CSE,

More information

Energy Conservation through Sleep Scheduling in Wireless Sensor Network 1. Sneha M. Patil, Archana B. Kanwade 2

Energy Conservation through Sleep Scheduling in Wireless Sensor Network 1. Sneha M. Patil, Archana B. Kanwade 2 Energy Conservation through Sleep Scheduling in Wireless Sensor Network 1. Sneha M. Patil, Archana B. Kanwade 2 1 Student Department of Electronics & Telecommunication, SITS, Savitribai Phule Pune University,

More information

Network-Adaptive Video Coding and Transmission

Network-Adaptive Video Coding and Transmission Header for SPIE use Network-Adaptive Video Coding and Transmission Kay Sripanidkulchai and Tsuhan Chen Department of Electrical and Computer Engineering, Carnegie Mellon University, Pittsburgh, PA 15213

More information

CHAPTER 4 IMPACT OF ROUTING ATTACKS IN LOCATION BASED ROUTING PROTOCOL

CHAPTER 4 IMPACT OF ROUTING ATTACKS IN LOCATION BASED ROUTING PROTOCOL 63 CHAPTER 4 IMPACT OF ROUTING ATTACKS IN LOCATION BASED ROUTING PROTOCOL 4.1 INTRODUCTION This chapter explains the impact of the blackhole, rushing, sybil and wormhole active attacks, in the route discovery

More information

Unicast Routing in Mobile Ad Hoc Networks. Dr. Ashikur Rahman CSE 6811: Wireless Ad hoc Networks

Unicast Routing in Mobile Ad Hoc Networks. Dr. Ashikur Rahman CSE 6811: Wireless Ad hoc Networks Unicast Routing in Mobile Ad Hoc Networks 1 Routing problem 2 Responsibility of a routing protocol Determining an optimal way to find optimal routes Determining a feasible path to a destination based on

More information

CHAPTER 2 CONVENTIONAL AND NON-CONVENTIONAL TECHNIQUES TO SOLVE ORPD PROBLEM

CHAPTER 2 CONVENTIONAL AND NON-CONVENTIONAL TECHNIQUES TO SOLVE ORPD PROBLEM 20 CHAPTER 2 CONVENTIONAL AND NON-CONVENTIONAL TECHNIQUES TO SOLVE ORPD PROBLEM 2.1 CLASSIFICATION OF CONVENTIONAL TECHNIQUES Classical optimization methods can be classified into two distinct groups:

More information

Finding Optimal Tour Length of Mobile Agent in Wireless Sensor Network

Finding Optimal Tour Length of Mobile Agent in Wireless Sensor Network Conference on Advances in Communication and Control Systems 2013 (CAC2S 2013) Finding Optimal Tour Length of Mobile Agent in Wireless Sensor Network Anil Kumar Mahto anil.fiem16@gmail.com Ajay Prasad Department

More information

AN EVOLUTIONARY APPROACH TO DISTANCE VECTOR ROUTING

AN EVOLUTIONARY APPROACH TO DISTANCE VECTOR ROUTING International Journal of Latest Research in Science and Technology Volume 3, Issue 3: Page No. 201-205, May-June 2014 http://www.mnkjournals.com/ijlrst.htm ISSN (Online):2278-5299 AN EVOLUTIONARY APPROACH

More information

The Parallel Software Design Process. Parallel Software Design

The Parallel Software Design Process. Parallel Software Design Parallel Software Design The Parallel Software Design Process Deborah Stacey, Chair Dept. of Comp. & Info Sci., University of Guelph dastacey@uoguelph.ca Why Parallel? Why NOT Parallel? Why Talk about

More information

Event Driven Routing Protocols For Wireless Sensor Networks

Event Driven Routing Protocols For Wireless Sensor Networks Event Driven Routing Protocols For Wireless Sensor Networks Sherif Moussa 1, Ghada Abdel Halim 2, Salah Abdel-Mageid 2 1 Faculty of Engineering, Canadian University Dubai, Dubai, UAE. 2 Faculty of Engineering,

More information

Performance Analysis Of Qos For Different MANET Routing Protocols (Reactive, Proactive And Hybrid) Based On Type Of Data

Performance Analysis Of Qos For Different MANET Routing Protocols (Reactive, Proactive And Hybrid) Based On Type Of Data ISSN (e): 2250 3005 Volume, 08 Issue, 4 April 2018 International Journal of Computational Engineering Research (IJCER) Performance Analysis Of Qos For Different MANET Routing Protocols (Reactive, Proactive

More information

ROUTING PROJECT LIST

ROUTING PROJECT LIST ROUTING PROJECT LIST Branches {Computer Science (CS), Information Science(IS), Software Engineering(SE),Electronics & Communication(EC), Telecommunication (TE),Information Technology(IT),Digital Communication(DCE),Digital

More information

Chapter 5 Ad Hoc Wireless Network. Jang Ping Sheu

Chapter 5 Ad Hoc Wireless Network. Jang Ping Sheu Chapter 5 Ad Hoc Wireless Network Jang Ping Sheu Introduction Ad Hoc Network is a multi-hop relaying network ALOHAnet developed in 1970 Ethernet developed in 1980 In 1994, Bluetooth proposed by Ericsson

More information

TO DESIGN ENERGY EFFICIENT PROTOCOL BY FINDING BEST NEIGHBOUR FOR ZIGBEE PROTOCOL

TO DESIGN ENERGY EFFICIENT PROTOCOL BY FINDING BEST NEIGHBOUR FOR ZIGBEE PROTOCOL TO DESIGN ENERGY EFFICIENT PROTOCOL BY FINDING BEST NEIGHBOUR FOR ZIGBEE PROTOCOL 1 Mr. Sujeet D. Gawande, Prof. Amit M. Sahu 2 1 M.E. Scholar, Department of Computer Science and Engineering, G.H.R.C.E.M.,

More information

3. Evaluation of Selected Tree and Mesh based Routing Protocols

3. Evaluation of Selected Tree and Mesh based Routing Protocols 33 3. Evaluation of Selected Tree and Mesh based Routing Protocols 3.1 Introduction Construction of best possible multicast trees and maintaining the group connections in sequence is challenging even in

More information

A Genetic Algorithm-Based Approach for Energy- Efficient Clustering of Wireless Sensor Networks

A Genetic Algorithm-Based Approach for Energy- Efficient Clustering of Wireless Sensor Networks A Genetic Algorithm-Based Approach for Energy- Efficient Clustering of Wireless Sensor Networks A. Zahmatkesh and M. H. Yaghmaee Abstract In this paper, we propose a Genetic Algorithm (GA) to optimize

More information

Integrated Routing and Query Processing in Wireless Sensor Networks

Integrated Routing and Query Processing in Wireless Sensor Networks Integrated Routing and Query Processing in Wireless Sensor Networks T.Krishnakumar Lecturer, Nandha Engineering College, Erode krishnakumarbtech@gmail.com ABSTRACT Wireless Sensor Networks are considered

More information

Metaheuristic Development Methodology. Fall 2009 Instructor: Dr. Masoud Yaghini

Metaheuristic Development Methodology. Fall 2009 Instructor: Dr. Masoud Yaghini Metaheuristic Development Methodology Fall 2009 Instructor: Dr. Masoud Yaghini Phases and Steps Phases and Steps Phase 1: Understanding Problem Step 1: State the Problem Step 2: Review of Existing Solution

More information

CROSS LAYER PROTOCOL (APTEEN) USING WSN FOR REAL TIME APPLICATION

CROSS LAYER PROTOCOL (APTEEN) USING WSN FOR REAL TIME APPLICATION CROSS LAYER PROTOCOL (APTEEN) USING WSN FOR REAL TIME APPLICATION V. A. Dahifale 1, N. Y. Siddiqui 2 PG Student, College of Engineering Kopargaon, Maharashtra, India 1 Assistant Professor, College of Engineering

More information

QUALITY OF SERVICE PROVISIONING IN MANET USING A CROSS-LAYER APPROACH FOR ROUTING

QUALITY OF SERVICE PROVISIONING IN MANET USING A CROSS-LAYER APPROACH FOR ROUTING QUALITY OF SERVICE PROVISIONING IN MANET USING A CROSS-LAYER APPROACH FOR ROUTING ABSTRACT Ruchita Goyal, Divyanshu and Manoj Mishra Department of Electronics and Computer Engineering, Indian Institute

More information

SEAR: SECURED ENERGY-AWARE ROUTING WITH TRUSTED PAYMENT MODEL FOR WIRELESS NETWORKS

SEAR: SECURED ENERGY-AWARE ROUTING WITH TRUSTED PAYMENT MODEL FOR WIRELESS NETWORKS SEAR: SECURED ENERGY-AWARE ROUTING WITH TRUSTED PAYMENT MODEL FOR WIRELESS NETWORKS S. P. Manikandan 1, R. Manimegalai 2 and S. Kalimuthu 3 1 Department of Computer Science and Engineering, Sri Venkateshwara

More information

Efficient Cluster Based Data Collection Using Mobile Data Collector for Wireless Sensor Network

Efficient Cluster Based Data Collection Using Mobile Data Collector for Wireless Sensor Network ISSN (e): 2250 3005 Volume, 06 Issue, 06 June 2016 International Journal of Computational Engineering Research (IJCER) Efficient Cluster Based Data Collection Using Mobile Data Collector for Wireless Sensor

More information

CHAPTER 4 SINGLE LAYER BLACK HOLE ATTACK DETECTION

CHAPTER 4 SINGLE LAYER BLACK HOLE ATTACK DETECTION 58 CHAPTER 4 SINGLE LAYER BLACK HOLE ATTACK DETECTION 4.1 INTRODUCTION TO SLBHAD The focus of this chapter is to detect and isolate Black Hole attack in the MANET (Khattak et al 2013). In order to do that,

More information

CHAPTER 6 HYBRID AI BASED IMAGE CLASSIFICATION TECHNIQUES

CHAPTER 6 HYBRID AI BASED IMAGE CLASSIFICATION TECHNIQUES CHAPTER 6 HYBRID AI BASED IMAGE CLASSIFICATION TECHNIQUES 6.1 INTRODUCTION The exploration of applications of ANN for image classification has yielded satisfactory results. But, the scope for improving

More information

A Genetic Algorithm for Graph Matching using Graph Node Characteristics 1 2

A Genetic Algorithm for Graph Matching using Graph Node Characteristics 1 2 Chapter 5 A Genetic Algorithm for Graph Matching using Graph Node Characteristics 1 2 Graph Matching has attracted the exploration of applying new computing paradigms because of the large number of applications

More information

Simulation & Performance Analysis of Mobile Ad-Hoc Network Routing Protocol

Simulation & Performance Analysis of Mobile Ad-Hoc Network Routing Protocol Simulation & Performance Analysis of Mobile Ad-Hoc Network Routing Protocol V.S.Chaudhari 1, Prof.P.N.Matte 2, Prof. V.P.Bhope 3 Department of E&TC, Raisoni College of Engineering, Ahmednagar Abstract:-

More information

Performance Comparison of DSDV, AODV, DSR, Routing protocols for MANETs

Performance Comparison of DSDV, AODV, DSR, Routing protocols for MANETs 2012 International Conference on Computer Networks and Communication Systems (CNCS 2012) IPCSIT vol.35(2012) (2012) IACSIT Press, Singapore Performance Comparison of DSDV, AODV, DSR, Routing protocols

More information

Chapter 5. A Bandwidth Sensitive Routing for Network Mobility (BSRNEMO)

Chapter 5. A Bandwidth Sensitive Routing for Network Mobility (BSRNEMO) A Bandwidth Sensitive Routing for Network Mobility (BSRNEMO) CHAPTER - 5 A BANDWIDTH-SENSITIVE ROUTING FOR NETWORK MOBILITY He profits most who serves best. -Arthur F. Sheldon 5.1 Background It is very

More information

A Location-based Directional Route Discovery (LDRD) Protocol in Mobile Ad-hoc Networks

A Location-based Directional Route Discovery (LDRD) Protocol in Mobile Ad-hoc Networks A Location-based Directional Route Discovery (LDRD) Protocol in Mobile Ad-hoc Networks Stephen S. Yau, Wei Gao, and Dazhi Huang Dept. of Computer Science and Engineering Arizona State University Tempe,

More information

Effects of Sensor Nodes Mobility on Routing Energy Consumption Level and Performance of Wireless Sensor Networks

Effects of Sensor Nodes Mobility on Routing Energy Consumption Level and Performance of Wireless Sensor Networks Effects of Sensor Nodes Mobility on Routing Energy Consumption Level and Performance of Wireless Sensor Networks Mina Malekzadeh Golestan University Zohre Fereidooni Golestan University M.H. Shahrokh Abadi

More information

Metaheuristic Optimization with Evolver, Genocop and OptQuest

Metaheuristic Optimization with Evolver, Genocop and OptQuest Metaheuristic Optimization with Evolver, Genocop and OptQuest MANUEL LAGUNA Graduate School of Business Administration University of Colorado, Boulder, CO 80309-0419 Manuel.Laguna@Colorado.EDU Last revision:

More information

Communication Synchronization in Cluster-Based Sensor Networks for Cyber-Physical Systems

Communication Synchronization in Cluster-Based Sensor Networks for Cyber-Physical Systems Communication Synchronization in Cluster-Based Sensor Networks for Cyber-Physical Systems Xi Deng and Yuanyuan Yang Department of Electrical and Computer Engineering, Stony Brook University, Stony Brook,

More information

Performance Enhancement of AOMDV with Energy Efficient Routing Based On Random Way Point Mobility Model

Performance Enhancement of AOMDV with Energy Efficient Routing Based On Random Way Point Mobility Model Performance Enhancement of AOMDV with Energy Efficient Routing Based On Random Way Point Mobility Model Geetha.S, Dr.G.Geetharamani Asst.Prof, Department of MCA, BIT Campus Tiruchirappalli, Anna University,

More information

AODV-PA: AODV with Path Accumulation

AODV-PA: AODV with Path Accumulation -PA: with Path Accumulation Sumit Gwalani Elizabeth M. Belding-Royer Department of Computer Science University of California, Santa Barbara fsumitg, ebeldingg@cs.ucsb.edu Charles E. Perkins Communications

More information

Performance Evaluation of Routing Protocols in Wireless Mesh Networks. Motlhame Edwin Sejake, Zenzo Polite Ncube and Naison Gasela

Performance Evaluation of Routing Protocols in Wireless Mesh Networks. Motlhame Edwin Sejake, Zenzo Polite Ncube and Naison Gasela Performance Evaluation of Routing Protocols in Wireless Mesh Networks Motlhame Edwin Sejake, Zenzo Polite Ncube and Naison Gasela Department of Computer Science, North West University, Mafikeng Campus,

More information

Secure Routing in Wireless Sensor Networks: Attacks and Countermeasures

Secure Routing in Wireless Sensor Networks: Attacks and Countermeasures Secure Routing in Wireless Sensor Networks: Attacks and Countermeasures By Chris Karlof and David Wagner Lukas Wirne Anton Widera 23.11.2017 Table of content 1. Background 2. Sensor Networks vs. Ad-hoc

More information

The movement of the dimmer firefly i towards the brighter firefly j in terms of the dimmer one s updated location is determined by the following equat

The movement of the dimmer firefly i towards the brighter firefly j in terms of the dimmer one s updated location is determined by the following equat An Improved Firefly Algorithm for Optimization Problems Amarita Ritthipakdee 1, Arit Thammano, Nol Premasathian 3, and Bunyarit Uyyanonvara 4 Abstract Optimization problem is one of the most difficult

More information

Performance Evaluation of Various Routing Protocols in MANET

Performance Evaluation of Various Routing Protocols in MANET 208 Performance Evaluation of Various Routing Protocols in MANET Jaya Jacob 1,V.Seethalakshmi 2 1 II MECS,Sri Shakthi Institute of Science and Technology, Coimbatore, India 2 Associate Professor-ECE, Sri

More information

The Impact of Clustering on the Average Path Length in Wireless Sensor Networks

The Impact of Clustering on the Average Path Length in Wireless Sensor Networks The Impact of Clustering on the Average Path Length in Wireless Sensor Networks Azrina Abd Aziz Y. Ahmet Şekercioğlu Department of Electrical and Computer Systems Engineering, Monash University, Australia

More information

Performance Evaluation of MANET through NS2 Simulation

Performance Evaluation of MANET through NS2 Simulation International Journal of Electronic and Electrical Engineering. ISSN 0974-2174, Volume 7, Number 1 (2014), pp. 25-30 International Research Publication House http://www.irphouse.com Performance Evaluation

More information

Research Incubator: Combinatorial Optimization. Dr. Lixin Tao December 9, 2003

Research Incubator: Combinatorial Optimization. Dr. Lixin Tao December 9, 2003 Research Incubator: Combinatorial Optimization Dr. Lixin Tao December 9, 23 Content General Nature of Research on Combinatorial Optimization Problem Identification and Abstraction Problem Properties and

More information

A Survey on an Energy-Efficient and Energy-Balanced Routing Protocol for Wireless Sensor Networks

A Survey on an Energy-Efficient and Energy-Balanced Routing Protocol for Wireless Sensor Networks sensors Article A Survey on an Energy-Efficient and Energy-Balanced Routing Protocol for Wireless Sensor Networks Olayinka O. Ogundile 1, * and Attahiru S. Alfa 1,2 1 Department of Electrical, Electronic

More information

Optimization of Ant based Cluster Head Election Algorithm in Wireless Sensor Networks

Optimization of Ant based Cluster Head Election Algorithm in Wireless Sensor Networks Optimization of Ant based Cluster Head Election Algorithm in Wireless Sensor Networks Siddharth Kumar M.Tech Student, Dept of Computer Science and Technology, Central University of Punjab, Punjab, India

More information

Comparative analysis of centralized and distributed clustering algorithm for energy- efficient wireless sensor network

Comparative analysis of centralized and distributed clustering algorithm for energy- efficient wireless sensor network Research Journal of Computer and Information Technology Sciences ISSN 2320 6527 Comparative analysis of centralized and distributed clustering algorithm for energy- efficient wireless sensor network Abstract

More information

Supporting Service Differentiation for Real-Time and Best-Effort Traffic in Stateless Wireless Ad-Hoc Networks (SWAN)

Supporting Service Differentiation for Real-Time and Best-Effort Traffic in Stateless Wireless Ad-Hoc Networks (SWAN) Supporting Service Differentiation for Real-Time and Best-Effort Traffic in Stateless Wireless Ad-Hoc Networks (SWAN) G. S. Ahn, A. T. Campbell, A. Veres, and L. H. Sun IEEE Trans. On Mobile Computing

More information

Analysis and Comparison of DSDV and NACRP Protocol in Wireless Sensor Network

Analysis and Comparison of DSDV and NACRP Protocol in Wireless Sensor Network Analysis and Comparison of and Protocol in Wireless Sensor Network C.K.Brindha PG Scholar, Department of ECE, Rajalakshmi Engineering College, Chennai, Tamilnadu, India, brindhack@gmail.com. ABSTRACT Wireless

More information

Data Gathering for Wireless Sensor Network using PEGASIS Protocol

Data Gathering for Wireless Sensor Network using PEGASIS Protocol Data Gathering for Wireless Sensor Network using PEGASIS Protocol Kumari Kalpna a, Kanu Gopal b, Navtej katoch c a Deptt. of ECE, College of Engg.& Mgmt.,Kapurthala, b Deptt. of CSE, College of Engg.&

More information

The Onion Routing Performance using Shadowplugin-TOR

The Onion Routing Performance using Shadowplugin-TOR The Onion Routing Performance using Shadowplugin-TOR Hartanto Kusuma Wardana, Liauw Frediczen Handianto, Banu Wirawan Yohanes * Faculty of Electronic and Computer Engineering Universitas Kristen Satya

More information

ROUTING ALGORITHMS Part 2: Data centric and hierarchical protocols

ROUTING ALGORITHMS Part 2: Data centric and hierarchical protocols ROUTING ALGORITHMS Part 2: Data centric and hierarchical protocols 1 Negative Reinforcement Time out Explicitly degrade the path by re-sending interest with lower data rate. Source Gradient New Data Path

More information

CHAPTER 4 SIMULATION MODEL AND PERFORMANCE METRICS

CHAPTER 4 SIMULATION MODEL AND PERFORMANCE METRICS 59 CHAPTER 4 SIMULATION MODEL AND PERFORMANCE METRICS 4.1 OVERVIEW OF SIMULATION MODEL The performance of a MANET routing protocol under varying network conditions is to be evaluated in order to understand

More information