Zone-based Clustering for Intrusion Detection Architecture in Ad-Hoc Networks
|
|
- Joanna Cummings
- 5 years ago
- Views:
Transcription
1 Zone-based Clustering for Intrusion Detection Architecture in Ad-Hoc Networks Il-Yong Kim, Yoo-Sung Kim, and Ki-Chang Kim School of Information & Communication Engineering, Inha University 3 Yonghyundong Namgu Incheon, Korea bush@super.inha.ac.kr, {yskim, kchang}@inha.ac.kr Abstract. Setting up an IDS architecture on ad-hoc network is hard because it is not easy to find suitable locations to setup IDS s. One way is to divide the network into a set of clusters and put IDS on each cluster head. However traditional clustering techniques for ad-hoc network have been developed for routing purpose, and they tend to produce duplicate nodes or fragmented clusters as a result of utilizing maximum connectivity for routing. Most of recent clustering algorithm for IDS are also based on them and show similar problems. In this paper, we suggest to divide the network first into zones which are supersets of clusters and to control the clustering process globally within each zone to produce more efficient clusters in terms of connectivity and load balance. The algorithm is explained in detail and shows about 3% less load concentration in cluster heads than traditional techniques. Keywords: Intrusion detection architecture, Ad-hoc Network, Clustering. Introduction Detecting intrusion in ad-hoc networks is harder than in regular networks. In wired or LAN/WAN, we have a gateway where network traffic is concentrated, and an IDS(Intrusion Detection System) can be installed there. In ad-hoc networks, we don t have such a convenient point. A candidate for IDS installation in ad-hoc networks would be a node that has relatively large number of neighboring nodes located within communication range. There should be multiple of them since we have to cover all participating nodes in the network, and these nodes need to communicate with each other to convey the local intrusion-related information. Finding such nodes and allowing them to exchange information efficiently is not easy. To make the situation worse, the nodes are mobile, and the network topology can change frequently: we may have to repeat the hard process of setting up intrusion detection architecture again and again. The problem of computing efficient clusters and maintaining them in spite of frequent changes in network topology is studied in relation with routing in ad-hoc networks. For routing purpose, the most important parameter that determines the
2 efficiency of a cluster is connectivity, and the suggested techniques tend to allow duplicate nodes (nodes belonging to more than one cluster at the same time) and to produce many fragmented clusters (clusters with only one or two members). For intrusion detection point of view, the critical parameter should be the number of nodes since the cluster head is responsible for collecting security-related data from all member nodes. Many researchers studied the above clustering problem for Ad-Hoc IDS[-4]. However the existing clustering techniques for IDS are simple adaptations of ones used in Ad-Hoc routing and still have the similar problem of duplicate nodes and fragmented cluster. We propose a zone-based clustering technique for Ad-Hoc IDS. The aim is to avoid duplicate nodes or fragmented clusters and to control the size of clusters to prevent excessive load in cluster heads. Our technique clusters the given network of nodes in two steps. In the first step, the network is divided into a set of sub-networks, called zones. Clusters are formed within a zone in the second step; that is no cluster is formed across zones. Zoning helps us to group geographically adjacent nodes; clustering within this zone is a much easier problem than clustering for the whole networks. Zoning also helps us to maintain the clusters. The replacement of a cluster head can be handled within the corresponding zone only. The proposed algorithm has been implemented and tested using GloMoSim simulator[5], and the result shows a significant reduction in the cluster header s packet processing load. The rest of the paper is organized as follows: Section examines previous studied on Ad-Hoc IDS clustering, Section 3 explains the proposed clustering techniques in detail, Section 4 describes experimental results, and Section 5 contains the concluding remarks. Related Work [] classifies IDS architectures for Ad-Hoc networks into Stand-Alone, Distributed and Cooperative, and Hierarchical. In Stand-Alone type, all nodes have IDS, but each node performs intrusion detection independently. A watchdog program can be combined with Stand-Alone architecture []. It can monitor the packet exchange between adjacent nodes and prevent communication with suspicious nodes. Distributed and Cooperative type also allows all nodes to have IDS, but they should cooperate in collecting global intrusion-related data []. Hierarchical architecture is one that uses clustering technique [, 3, 4]. Fig. shows an example of Hierarchical architecture. Each cluster has a cluster head, and adjacent clusters share a gateway node as shown in Fig. (a). IDS s are installed in cluster heads as shown in Fig. (b). Various techniques have been developed to build an efficient cluster and to select a cluster head. [3] suggests a technique in which the number of neighboring nodes is computed for all nodes and one with the maximum number becomes a cluster head. Neighboring nodes are computed based on predetermined number of hops: if the number of hops is, all nodes within hops from a node become neighboring nodes for that node. Once a cluster head is determined, the head itself and the surrounding nodes (located within the pre-determined number of hops from the head) form a cluster. The same process to find a cluster head and the
3 corresponding cluster, then, repeats for the rest of nodes. [4] suggests to build cliques first. A clique is a set of nodes that are within hop from each other and corresponds to a cluster in general term. A random cluster head, then, is elected from the clique. To protect the identity of a cluster head (for security reason), all nodes within a clique have the same probability to be elected. Fig.. Clustering for IDS Clustering for the purpose of intrusion detection is reported to be effective in reducing the load on CPU. To achieve the same detection rate, clustering technique helps to reduce the CPU usage by % compared to the case when no clustering is performed [4]. However, we still observe unnecessary monitoring overhead in previous techniques such as duplicate nodes and excessive number of small cluster fragments. Duplicate nodes happen in the gateway nodes existing in the overlapped area between two adjacent clusters, and they increase the overhead on cluster heads because of multiple monitoring by at least two neighboring cluster heads. Fragmented clusters are generated since the clustering algorithm prefers a set of well-connected nodes as a cluster and tends to leave boundary nodes not belonging to any cluster as single-node clusters. 3 Zone-Based Clustering Technique We prevent cluster fragmentation by first dividing the network of nodes into zones. A zone is a set of nodes that are located close to each other. Clusters are built within each zone not allowing inter-zone clusters. Node sharing between clusters is prohibited to prevent duplicate nodes. 3. Zoning Zoning process is distributed: seed nodes that are located at the boundary of the network announce themselves as initiators and start to build zones at the same time. We assume all nodes in the network know their neighbor nodes within one hop before starting the zoning process. A node becomes a seed node if it has or neighbors; we prefer lonely nodes as starting points to avoid the formation of fragmented clusters. The seed nodes start to form zones following the algorithm shown in Fig..
4 . Send to all neighbor nodes belonging to different zones other than the current one.. Collect from them for a pre-determined time. Each message has the zone size the sender belongs to. This and the arrival time of message will be used to compute its priority. The messages are inserted to a message queue in the priority order. 3. Pop a message from the queue, and mark all the nodes in the zone the sender belongs to as a new member of the current zone. Repeat this process until the pre-determined zone size is reached. If the maximum zone size has been reached, exit the zoning algorithm, and start the clustering algorithm. 4. Send to all members in the current zone. 5. Collect from them for some pre-determined time. Each message includes a number for neighbor nodes that are not in the current zone.. Elect one with the maximum such number. Report this node as a new coordinator to all members. Fig.. Zoning algorithm performed by the coordinator In the beginning all nodes are themselves zones, a one-member zone. A node can be in several states; initially all nodes are in SLEEP state as shown in Fig. 3. A zone must have a coordinator which determines whether to merge or not with neighbor zones. A coordinator that actively starts the zone-merging process is called an initiator; one that passively responds to this merging request is called a participant. So, zoning process is a negotiation process between two coordinators that represent two neighboring zones: one of them is an initiator, the other a participant. The state changes of these two nodes are shown in Fig. 3. SLEEP : message flow : state transit INIT SEND_INIT AWAKEN REQUEST PERMIT JOIN ACCEPTED INIT or COMPLETE SLEEP or COMPLETE Fig. 3. State transition of a node When zoning process begins, the seed nodes send setup_init messages to their neighbors. The seed nodes in this case act as initiators, and the neighbors become participant. The participants send back the size of the zone they belong to. The initiator examines the size and determines whether to merge or not. The basic
5 criterion is zone size after merging; if it becomes greater than some threshold, the merging is abandoned. Merging decision may be made for several neighbor zones at the same time. The setup_init messages are sent to all neighboring coordinators, and if multiple responses arrive within the same time period the initiator would consider all the corresponding participants as possible candidates for merging. The response from the participant is a setup_request message, and it contains the responder s zone size. The initiator use this information to give a preference to smaller participants: it is again to deter the formation of fragmented clusters. The participant does a similar selection based on the size of a zone. The setup_init message also contains the zone size of the initiator, and when the participant has received a number of setup_init messages, it prefers the initiator with the smallest zone size and sends setup_request to it. The merging process is shown in Fig. 4(a), and the preference of the smaller zone is shown in Fig. 4(b). Fig. 4. Zone building When a new zone is formed through merging, a new coordinator has to be elected. For this purpose, the old coordinator broadcasts a coordinator_election_request message to all zone members. Each zone member responds with the neighbor node table it has. The old coordinator counts only the neighbor nodes that do not belonging to the current zone, and the member with the largest neighbor node number (excluding ones within the current zone) will be elected as the new coordinator. The node number of the new coordinator will be notified to all zone members, and this new coordinator will start the next phase of zone merging process. Merging process stops when all the neighbor zones are merged to the initiator s zone or when the size of zone has reached the maximum. When the maximum size is reached, we have a final zone, and the state of all nodes within this zone becomes COMPLETE. When the maximum size is not yet reached, we repeat the process of zone merging again. 3. Zone building example Fig. 5 shows an example of zone building process. Initially there are nodes in m 4m area. All of them are coordinators and form a zone by themselves as explained in Section 3.. When the zoning process begins, node, 3,, and
6 become the initiators because they have less than or equal to neighboring nodes as shown in Fig. 5(a). These nodes send setup_init messages to their neighbors (or participants) and merge them. The initiators are shown in shaded circles. They are also shown in the tables of nodes in the right side of the figure. For each table, the shaded entry is the initiator and other entries are the participants for the initiator. The result is shown in Fig. 5(b). In the figure, 4 new zones and the corresponding new coordinators of them (in shaded circle) are shown. The new coordinators tend to exist at the boundary of the zone since they have a more number of neighbor nodes (neighbors belonging to the same zone are excluded when computing the number of neighbor nodes). These new coordinators act as initiators to start the next merging process. This process of merging and selecting a new coordinator is repeated again and again until the size of all zones reach the maximum or there is no more neighbor zone to merge. The final zones are shown in Fig. 5(f) (a) (b) (c) (d) (e) (f) Fig. 5. An example of zone building process 3. Clustering Clustering is the process of selecting a cluster head and including the neighbor nodes of this head into the cluster. For security reason, an outsider should have no clue about who will be and is the cluster head, and, therefore, all nodes should have an equal chance of becoming a cluster head. Once the head is elected, the neighbor nodes are included to the corresponding cluster until the maximum size is reached. Sharing of nodes between clusters is prohibited, and collecting nodes from other zone is also prohibited.
7 Clustering is performed at each zone independently. The coordinator at each zone at the time of completion of the zone will act as the zone manager. This manager performs the algorithm in Fig.. Fig.. An algorithm performed by the zone manager Basically it repeats the process of selecting a cluster head and building a cluster. In the beginning, it sends cluster_init message to all zone members. All members respond with a random number as shown in Fig.. The node which sent the biggest random number will be chosen as a cluster head. In Fig., there are 5 nodes in the zone, and node 4 has the largest random number. Since it has neighbor node 3 and 5 as shown in figure, the first cluster will be node 3, 4, and 5 with node 4 being the head. The clustering manager repeats the same process for the rest of nodes. The second table in Fig. shows node and become the second cluster with node being cluster head. Fig.. Clustering process 3.3 Zone/cluster maintenance The zones and clusters are dynamic entities. Their members may move out of them, or new members come and join. More seriously, the zone manager or the cluster head
8 may move out of the region, or we may need to replace them for security reasons. All these events may require rebuilding of the zone or the cluster. Rebuilding is processed in the form of merge or split a zone or cluster whose size is below some minimum threshold will be merged to the neighbor zone or cluster while one whose size becomes greater than some maximum threshold will be split. The moving-out or moving-in of a node is detected by short-term or long-term hello message. A shortterm message is a one-hop broadcast. All nodes issue short-term messages regularly to detect the membership change. Upon receiving, it all nodes respond with their zone and cluster identifiers. A long-term message is issued by the zone manager to all cluster heads in the corresponding zone periodically. The cluster heads responds with a message containing updating information such as membership change. The merging of a cluster is initiated by the cluster head whose cluster size has shrunk below some threshold. It sends a merge request to its neighbor cluster head. When two clusters are merged successfully, a report about this change will be sent to the zone manager by the combined cluster head. The split of a cluster is also initiated by the corresponding cluster head. The cluster head sends a split request to the zone manager, and the manager will start the cluster-forming algorithm in Fig., but in this case only for the members in the corresponding cluster. The merge or split of a zone is initiated by the corresponding zone manager. Merging is essentially the same process as the zone building process in Fig.. The moving of a cluster head or a zone manager is dealt with a new election. A new cluster head is elected when the members do not hear a short-term message from the head for some time period. They broadcast a random number to each other, and one issued the largest number will become the new head. Similar election is performed at zone level when the current zone manager disappears; again this absence of a manager is detected by the silence of the long-term message. 4 Experiments We have implemented our zone-based clustering technique in simulated network of mobile nodes using GloMoSim [5]. On the same network we also have implemented two previous clustering techniques for IDS in mobile network proposed in [4] and [8]. The aims of experiments are two folds. First we compare the cluster size, and secondly we compare the load in cluster heads. Cluster size is an important parameter to evaluate the performance of IDS. To avoid traffic concentration on a few cluster heads, the size should be evenly distributed among the cluster heads. Also to reduce inter-cluster-head traffic, the number of clusters should be controlled, and for this reason fragmented clusters (that has only one or two members) should be avoided as much as possible. Finally to avoid unnecessary traffic monitoring, node sharing between clusters should be prevented. The result for cluster size comparison is shown in Table. In the table, WCL and CIDS represent the clustering technique in [8] and [4] respectively, and ZIDS our technique. Three figures are compared: number of clusters, average cluster size, and In fact, we replace the zone manager and the cluster head periodically to avoid their exposure to persistent packet observers.
9 number of single cluster. For each category, we varied the number of participating nodes by 3, 5, and. The first column in the table shows the number of clusters produced by each technique. "n" shows the number of nodes in the network. As can be seen in the table, ZIDS is producing the least number of clusters. The next column shows the average cluster size. This data becomes meaningful when combined with that in the third column, which shows the number of fragmented clusters produced by each technique. For example CIDS is producing lots of fragmented clusters, but the average size is between those of WCL and ZIDS. This means that CIDS is producing two kinds of clusters most of time very large ones and very small ones. Very large clusters will penalize the cluster head; very small ones will increase traffic between cluster heads. On the other hand WCL produces almost no fragmented clusters as shown in the third column. However its average cluster size is relatively high. Table. Result for cluster size comparison Number of Clusters Avg. Cluster Size Number of Single Clusters n=3 n=5 n= n=3 n=5 n= n=3 n=5 n= WCL CIDS ZIDS Fig. 8 shows the numbers of packets monitored by cluster heads in CIDS and ZIDS. The traffic was generated using CBR(Constant Bit Rate) application. We defined a pattern file that contain 5 CBR traffic pattern, generated such files, and applied them to 5 and node network respectively. As can be seen in figure, ZIDS shows the minimum packet monitoring load: the amount of packets in ZIDS is about 3% less than that in CIDS. 5 nodes nodes 3 cids zids 4 cids zids 35 3 observed packets 5 observed packets p p p 3 p 4 p 5 p p p 8 p p p p p 3 p 4 p 5 p p p 8 p p traffic patterns traffic patterns Fig. 8. Number of monitored packets for 5 and node network 5 Conclusion In this paper, we have proposed a zone based clustering technique for intrusion detection in Ad-Hoc network. Clustering process is essentially a distributed process since it is hard to control all the nodes in a mobile network. However, by dividing the network into a set of zones that contain geographically close nodes, we can control
10 the clustering process globally within each zone and produce more efficient clusters. This zoning helps to produce clusters with evenly distributed size; it also facilitates better management of clusters when the nodes move across the cluster boundary. We have measured the performance of our technique in terms of traffic load on cluster heads which was about 3% lighter than that in traditional clustering techniques. References. Y. Zhang and W. Lee: Intrusion Detection in Wireless Ad-Hoc Networks. In: Proceedings of the th Annual International Conference on Mobile Computing and Networks (MobiCom), Boston, USA (). D. Sterne, P. Balasubramanyam, D. Carman, B. Wilson, R. Talpade, C. Ko, R. Balupari, C-Y. Tseng, T. Bowen, K. Levitt and J. Rowe: A General Cooperative Intrusion Detection Architecture for MANETs. In: Proceedings of the third IEEE International Workshop on Information Assurance (IWIA), College Park, MD, USA () 3. O. Kachirski and R. Guha: Effective Intrusion Detection Using Multiple Sensors in Wireless Ad Hoc Networks. In: Proceedings of the 3th Hawaii International Conference on System Science (HICSS), Hawaii () 4. Y. Huang and W. Lee: A Cooperative Intrusion Detection System for Ad Hoc Networks. In: Proceedings of the ACM Workshop on Security in Ad Hoc and Sensor Networks (SASN), Fairfax, VA, USA () 5. GloMoSim Simulator s web site: P. Brutch and C. Ko: Challenges in Intrusion Detection for Wireless Ad-hoc Networks. In: Symposium on Applications and the Internet Workshops (SAINT), Orlando, Florida, USA (). S. Marti, T. Giuli, K. Lai, and M. Barker: Mitigating Routing Misbehavior in Mobile Ad Hoc Networks. In: Proceedings of th International Conference on Mobile Computing and Networking (MobiCom), Boston, USA () 8. M. Chatterjee, S. K. Das, and D. Turgut: WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks. Journal of Cluster Computing, 5(), (). L. Zhou and L. J. Hass: Securing ad hoc networks. In: IEEE Networks, (), (). Li. Y and J. Wei: Guidelines on Selecting Intrusion Detection Methods in MANET. In: The Proceedings of ISECON, Newport, (). M. Bechler, H.-J. Hof, D. Kraft, F. Pählke, and L. Wolf: A Cluster-Based Security Architecture of Ad Hoc Networks. In: Twenty-third Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), Hong Kong, China (). C.-K. Toh: Ad Hoc Mobile Wireless Networks: Protocols and Systems. Prentice Hall PTR, ()
MPBCA: Mobility Prediction Based Clustering Algorithm for MANET
MPBCA: Mobility Prediction Based Clustering Algorithm for MANET Rani.V.G Associate Professor Research and Development Center Bharathiar University Coimbatore, India ranikhans@gmail.com Dr.M.Punithavalli
More informationAn Energy Efficiency Routing Algorithm of Wireless Sensor Network Based on Round Model. Zhang Ying-Hui
Joint International Mechanical, Electronic and Information Technology Conference (JIMET 2015) An Energy Efficiency Routing Algorithm of Wireless Sensor Network Based on Round Model Zhang Ying-Hui Software
More informationMeasure of Impact of Node Misbehavior in Ad Hoc Routing: A Comparative Approach
ISSN (Print): 1694 0814 10 Measure of Impact of Node Misbehavior in Ad Hoc Routing: A Comparative Approach Manoj Kumar Mishra 1, Binod Kumar Pattanayak 2, Alok Kumar Jagadev 3, Manojranjan Nayak 4 1 Dept.
More informationSpecification-based Intrusion Detection. Michael May CIS-700 Fall 2004
Specification-based Intrusion Detection Michael May CIS-700 Fall 2004 Overview Mobile ad hoc networking (MANET) new area of protocols Some old networking solutions work (TCP/IP) but things change with
More informationEfficient Hybrid Multicast Routing Protocol for Ad-Hoc Wireless Networks
Efficient Hybrid Multicast Routing Protocol for Ad-Hoc Wireless Networks Jayanta Biswas and Mukti Barai and S. K. Nandy CAD Lab, Indian Institute of Science Bangalore, 56, India {jayanta@cadl, mbarai@cadl,
More informationLeader Election for ID with Prolonged Network Life Time Using ELAR1-VA in MANETs
International Journal of Scientific and Research Publications, Volume 3, Issue 4, April 2013 1 Leader Election for ID with Prolonged Network Life Time Using ELAR1-VA in MANETs 1 Chitra.R, 2 Jayalakshmi.V,
More informationConnectivity, Energy and Mobility Driven Clustering Algorithm for Mobile Ad Hoc Networks
Connectivity, Energy and Mobility Driven Clustering Algorithm for Mobile Ad Hoc Networks Fatiha Djemili Tolba University of Haute Alsace GRTC Colmar, France fatiha.tolba@uha.fr Damien Magoni University
More informationA Simple Sink Mobility Support Algorithm for Routing Protocols in Wireless Sensor Networks
A Simple Mobility Support Algorithm for Routing Protocols in Wireless Sensor Networks Chun-Su Park, You-Sun Kim, Kwang-Wook Lee, Seung-Kyun Kim, and Sung-Jea Ko Department of Electronics Engineering, Korea
More informationMitigating Hot Spot Problems in Wireless Sensor Networks Using Tier-Based Quantification Algorithm
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 16, No 1 Sofia 2016 Print ISSN: 1311-9702; Online ISSN: 1314-4081 DOI: 10.1515/cait-2016-0005 Mitigating Hot Spot Problems
More informationPerformance Evaluation of Mesh - Based Multicast Routing Protocols in MANET s
Performance Evaluation of Mesh - Based Multicast Routing Protocols in MANET s M. Nagaratna Assistant Professor Dept. of CSE JNTUH, Hyderabad, India V. Kamakshi Prasad Prof & Additional Cont. of. Examinations
More informationViTAMin: A Virtual Backbone Tree Algorithm for Minimal Energy Consumption in Wireless Sensor Network Routing
ViTAMin: A Virtual Backbone Tree Algorithm for Minimal Energy Consumption in Wireless Sensor Network Routing Jaekwang Kim Department of Electrical and Computer Engineering, Sungkyunkwan University, Suwon,
More informationA Scheme of Multi-path Adaptive Load Balancing in MANETs
4th International Conference on Machinery, Materials and Computing Technology (ICMMCT 2016) A Scheme of Multi-path Adaptive Load Balancing in MANETs Yang Tao1,a, Guochi Lin2,b * 1,2 School of Communication
More informationAn Intrusion Detection Architecture for Clustered Wireless Ad Hoc Networks
An Intrusion Detection Architecture for Clustered Wireless Ad Hoc Networks Jaydip Sen Innovation Lab, Tata Consultancy Services Ltd. Bengal Intelligent Park, Salt Lake Electronic Complex Kolkata, India
More informationCFMTL: Clustering Wireless Sensor Network Using Fuzzy Logic and Mobile Sink In Three-Level
CFMTL: Clustering Wireless Sensor Network Using Fuzzy Logic and Mobile Sink In Three-Level Ali Abdi Seyedkolaei 1 and Ali Zakerolhosseini 2 1 Department of Computer, Shahid Beheshti University, Tehran,
More informationA Modified Version of DMAC Clustering Algorithm in MANET
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. 3, Issue. 6, June 2014, pg.133
More informationISSN: [Preet* et al., 6(5): May, 2017] Impact Factor: 4.116
IJESRT INTERNATIONAL JOURNAL OF ENGINEERING SCIENCES & RESEARCH TECHNOLOGY DESIGNING SECURE MULTICASTING ROUTING ALGORITHMS IN MANET USING IDS Mrs Pooja Preet*, Dr. Rahul Mishra, Dr. Saket Agrawal * Ph.D.Scholar,Department
More informationPATM: Priority-based Adaptive Topology Management for Efficient Routing in Ad Hoc Networks
PATM: Priority-based Adaptive Topology Management for Efficient Routing in Ad Hoc Networks Haixia Tan, Weilin Zeng and Lichun Bao Donald Bren School of Information and Computer Sciences University of California,
More informationTCP and UDP Fairness in Vehicular Ad hoc Networks
TCP and UDP Fairness in Vehicular Ad hoc Networks Forouzan Pirmohammadi 1, Mahmood Fathy 2, Hossein Ghaffarian 3 1 Islamic Azad University, Science and Research Branch, Tehran, Iran 2,3 School of Computer
More informationDomain Based Approach for QoS Provisioning in Mobile IP
Domain Based Approach for QoS Provisioning in Mobile IP Ki-Il Kim and Sang-Ha Kim Department of Computer Science 220 Gung-dong,Yuseong-gu, Chungnam National University, Deajeon 305-764, Korea {kikim, shkim}@cclab.cnu.ac.kr
More informationA Graph-based Approach to Compute Multiple Paths in Mobile Ad Hoc Networks
A Graph-based Approach to Compute Multiple Paths in Mobile Ad Hoc Networks Gunyoung Koh, Duyoung Oh 1 and Heekyoung Woo 2 1 School of Electrical Engineering and Computer Science Seoul National University,
More informationSurvey of Intrusion Detection and Prevention System in MANETs based on Data Gathering Techniques
Survey of Intrusion Detection and Prevention System in MANETs on Data Gathering Techniques Monika Darji LJ Institute of Computer Application Ahmedabad, Gujarat India Bhushan Trivedi GLS Institute of Computer
More informationBlackhole 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 informationAnalysis of Black-Hole Attack in MANET using AODV Routing Protocol
Analysis of Black-Hole Attack in MANET using Routing Protocol Ms Neha Choudhary Electronics and Communication Truba College of Engineering, Indore India Dr Sudhir Agrawal Electronics and Communication
More informationA Comparative and Performance Study of On Demand Multicast Routing Protocols for Ad Hoc Networks
A Comparative and Performance Study of On Demand Multicast Routing Protocols for Ad Hoc Networks P.Madhan Mohan #, J.James Johnson #, K.Murugan $ and V.Ramachandran % # Under Graduate Student $ Senior
More informationPerformance of New Broadcast Forwarding Criteria in MANET
Performance of New Broadcast Forwarding Criteria in MANET Lijuan Zhu 1, Bu-Sung Lee 1, Boon-Chong Seet 2, Kai-Juan Wong 3, Genping Liu 1, Shell-Ying Huang 1, and Keok-Kee Lee 1 1 Centre for Multimedia
More informationPerformance Analysis of Mobile Ad Hoc Network in the Presence of Wormhole Attack
Performance Analysis of Mobile Ad Hoc Network in the Presence of Wormhole Attack F. Anne Jenefer & D. Vydeki E-mail : annejenefer@gmail.com, vydeki.d@srmeaswari.ac.in Abstract Mobile Ad-Hoc Network (MANET)
More informationVariable Length and Dynamic Addressing for Mobile Ad Hoc Networks
Variable Length and Dynamic Addressing for Mobile Ad Hoc Networks Som Chandra Neema Venkata Nishanth Lolla {sneema,vlolla}@cs.ucr.edu Computer Science Department University of California, Riverside Abstract
More informationAN EFFICIENT MAC PROTOCOL FOR SUPPORTING QOS IN WIRELESS SENSOR NETWORKS
AN EFFICIENT MAC PROTOCOL FOR SUPPORTING QOS IN WIRELESS SENSOR NETWORKS YINGHUI QIU School of Electrical and Electronic Engineering, North China Electric Power University, Beijing, 102206, China ABSTRACT
More informationROAL: A Randomly Ordered Activation and Layering Protocol for Ensuring K-Coverage in Wireless Sensor Networks
ROAL: A Randomly Ordered Activation and Layering Protocol for Ensuring K-Coverage in Wireless Sensor Networks Hogil Kim and Eun Jung Kim Department of Computer Science Texas A&M University College Station,
More informationAn Approximation Algorithm for Connected Dominating Set in Ad Hoc Networks
An Approximation Algorithm for Connected Dominating Set in Ad Hoc Networks Xiuzhen Cheng, Min Ding Department of Computer Science The George Washington University Washington, DC 20052, USA {cheng,minding}@gwu.edu
More information1 Multipath Node-Disjoint Routing with Backup List Based on the AODV Protocol
1 Multipath Node-Disjoint Routing with Backup List Based on the AODV Protocol Vahid Zangeneh i and Shahriar Mohammadi ii * ABSTRACT In recent years, routing has been the most focused area in ad hoc networks
More information(INTERFERENCE AND CONGESTION AWARE ROUTING PROTOCOL)
Qos of Network Using Advanced Hybrid Routing in WMN, Abstract - Maximizing the network throughput in a multichannel multiradio wireless mesh network various efforts have been devoted. The recent solutions
More informationINTERNATIONAL JOURNAL OF ADVANCED RESEARCH IN ENGINEERING AND TECHNOLOGY (IJARET)
INTERNATIONAL JOURNAL OF ADVANCED RESEARCH IN ENGINEERING AND TECHNOLOGY (IJARET) ISSN 0976-6480 (Print) ISSN 0976-6499 (Online) Volume 4, Issue 1, January- February (2013), pp. 50-58 IAEME: www.iaeme.com/ijaret.asp
More informationIntroduction to Mobile Ad hoc Networks (MANETs)
Introduction to Mobile Ad hoc Networks (MANETs) 1 Overview of Ad hoc Network Communication between various devices makes it possible to provide unique and innovative services. Although this inter-device
More informationInvestigating Intrusion Detection Systems in MANET and Comparing IDSs for Detecting Misbehaving Nodes
Investigating Intrusion Detection Systems in MANET and Comparing IDSs for Detecting Misbehaving Nodes Marjan Kuchaki Rafsanjani, Ali Movaghar, and Faroukh Koroupi Abstract As mobile ad hoc networks (MANET)
More information3. 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 informationShortcut Tree Routing using Neighbor Table in ZigBee Wireless Networks
Shortcut Tree Routing using Neighbor Table in ZigBee Wireless Networks Salmu K.P 1, Chinchu James 2 1,2 Department of Computer Science, IIET, Nellikuzhi Abstract- ZigBee is a worldwide standard for wireless
More informationSECURE AND EFFICIENT HYBRID APPROACH FOR DATA TRANSMISSION IN ZIGBEE NETWORK
SECURE AND EFFICIENT HYBRID APPROACH FOR DATA TRANSMISSION IN ZIGBEE NETWORK P.M.Shareefa Jareena *1, T.Samraj Lawrence #2, and V.Perathu Selvi #3 * Student, Dept of CSE (SNW), Francis Xavier Engineering
More informationPacket Routing using Optimal Flooding Protocol in Cluster based MANET
IJSTE - International Journal of Science Technology & Engineering Volume 2 Issue 09 March 2016 ISSN (online): 2349-784X Packet Routing using Optimal Flooding Protocol in Cluster based MANET S.Bavani V.Aiswariya
More informationImplementation of a Multi-Channel Multi-Interface Ad-Hoc Wireless Network
ENSC 85: High-Performance Networks Spring 2008 Implementation of a Multi-Channel Multi-Interface Ad-Hoc Wireless Network Chih-Hao Howard Chang howardc@sfu.ca Final Project Presentation School of Engineering
More informationModified Ultra Smart Counter Based Broadcast Using Neighborhood Information in MANETS
Modified Ultra Smart Counter Based Broadcast Using Neighborhood Information in MANETS Ms. Nutan Julka 1, Prof. Dr. J.W Bakal 2 1 Dept. of Computer Science, Pillais Institute of Information Technology,
More informationAnalysis of Cluster-Based Energy-Dynamic Routing Protocols in WSN
Analysis of Cluster-Based Energy-Dynamic Routing Protocols in WSN Mr. V. Narsing Rao 1, Dr.K.Bhargavi 2 1,2 Asst. Professor in CSE Dept., Sphoorthy Engineering College, Hyderabad Abstract- Wireless Sensor
More informationEfficient Location Services Using Hierarchical Topology of Mobile Ad Hoc Networks
Journal of Software Engineering and Applications, 2012, 5, 14-20 http://dx.doi.org/10.4236/jsea.2012.51003 Published Online January 2012 (http://www.scirp.org/journal/jsea) Efficient Location Services
More informationControl Traffic Analysis of On-Demand Routing Protocol. in Mobile Ad-hoc Networks
Second International Conference on Networking and Distributed Computing Control Traffic Analysis of On-Demand Routing Protocol in Mobile Ad-hoc Networks Zhilin Zhang School of Computer Science & Technology
More informationA 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 informationThe General Analysis of Proactive Protocols DSDV, FSR and WRP
Volume 116 No. 10 2017, 375-380 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu ijpam.eu The General Analysis of Proactive Protocols DSDV, FSR and WRP 1 Dr.
More informationZigBee Routing Algorithm Based on Energy Optimization
Sensors & Transducers 2013 by IFSA http://www.sensorsportal.com ZigBee Routing Algorithm Based on Energy Optimization Wangang Wang, Yong Peng, Yongyu Peng Chongqing City Management College, No. 151 Daxuecheng
More informationFig. 2: Architecture of sensor node
Volume 4, Issue 11, November 2014 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com To Reduce
More informationCHAPTER 5 AN AODV-BASED CLUSTERING APPROACH FOR EFFICIENT ROUTING
99 CHAPTER 5 AN AODV-BASED CLUSTERING APPROACH FOR EFFICIENT ROUTING 5.1 INTRODUCTION Dynamic network topology and limited system resources characterize mobile ad hoc networking. Many routing protocols
More informationResearch on Ad Hoc-based Routing Algorithm for Wireless Body Sensor Network
Sensors & Transducers 2014 by IFSA Publishing, S. L. http://www.sensorsportal.com Research on Ad Hoc-based Routing Algorithm for Wireless Body Sensor Network Hui Cheng, Zhongyang Sun, * Xiaobing Zhang,
More informationRouting Protocols in MANET: Comparative Study
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. 3, Issue. 7, July 2014, pg.119
More informationROBUST AND FLEXIBLE IP ADDRESSING FOR MOBILE AD-HOC NETWORK
ROBUST AND FLEXIBLE IP ADDRESSING FOR MOBILE AD-HOC NETWORK Pankaj Kumar, Vinod Kumar Mishra, Poonam Rautela Department of Computer Science & Engineering, B. T. Kumaon Institute of Technology, Dwarahat,
More informationA Comprehensive Survey on Anomaly-Based Intrusion Detection in MANET
Computer and Information Science; Vol. 5, No. 4; 2012 ISSN 1913-8989 E-ISSN 1913-8997 Published by Canadian Center of Science and Education A Comprehensive Survey on Anomaly-Based Intrusion Detection in
More informationHeuristic Clustering Algorithms in Ad hoc Networks
Heuristic Clustering Algorithms in Ad hoc Networks Artvin Çoruh University e-mail: nevin.aydin@gmail.com Volume 3 No 3 (2014) ISSN 2158-8708 (online) DOI 10.5195/emaj.2014.39 http://emaj.pitt.edu Abstract
More informationCooperative Reputation Index Based Selfish Node Detection and Prevention System for Mobile Ad hoc Networks
Research Journal of Applied Sciences, Engineering and Technology 4(3): 201-205, 2012 ISSN: 2040-7467 Maxwell Scientific Organization, 2012 Submitted: September 23, 2011 Accepted: November 02, 2011 Published:
More informationEstimation of Network Partition Problem in Mobile Ad hoc Network
Estimation of Network Partition Problem in Mobile Ad hoc Network Varaprasad Golla B.M.S.College of Engineering Bangalore, India varaprasad555555@yahoo.co.in ABSTRACT: A node cannot communicate with others
More informationImproved Performance of Mobile Adhoc Network through Efficient Broadcasting Technique
Improved Performance of Mobile Adhoc Network through Efficient Broadcasting Technique Vijay J Parmar Department of Computer Engineering,Sarvajanic College of Engineering and Technology Surat, Gujrat (India),E-mail
More informationGATEWAY MULTIPOINT RELAYS AN MPR-BASED BROADCAST ALGORITHM FOR AD HOC NETWORKS. Ou Liang, Y. Ahmet Şekercioğlu, Nallasamy Mani
GATEWAY MULTIPOINT RELAYS AN MPR-BASED BROADCAST ALGORITHM FOR AD HOC NETWORKS Ou Liang, Y. Ahmet Şekercioğlu, Nallasamy Mani Centre for Telecommunication and Information Engineering Monash University,
More informationDistributed Clusterhead Architecture for Mobile Ad Hoc Networks
Journal of Computer Science 2 (7): 583-588, 2006 ISSN 1549-3636 2006 Science Publications Distributed Clusterhead Architecture for Mobile Ad Hoc Networks 1 Emad Qaddoura, 2 Wesam AlMobaideen and 3 Ahmad
More informationHybrid gateway advertisement scheme for connecting mobile ad hoc networks to the Internet
* gateway advertisement scheme for connecting mobile ad hoc networks to the Internet Jeongkeun Lee (), Dongkyun Kim (2), J.J.Garcia-Luna-Aceves (3), Yanghee Choi (), Jihyuk Choi (4), Sangwoo Nam (4) ()
More informationA Reliable Route Selection Algorithm Using Global Positioning Systems in Mobile Ad-hoc Networks
A Reliable Route Selection Algorithm Using Global Positioning Systems in Mobile Ad-hoc Networks Won-Ik Kim Radio Performance Analysis Section Electronics & Telecommunications Research Institute 161 Kajong-dong,
More informationThe Improved WCMRP Protocol for Mobile Wireless Sensor Networks
152 JOURNAL OF COMMUNICATIONS, VOL. 6, NO. 2, APRIL 2011 The Improved WCMRP Protocol for Mobile Wireless Sensor Networks Ming Huang Guo Department of Information Management, Shih-Hsin University, Taipei,
More informationOverlapping Clusters Algorithm in Ad hoc Networks
Overlapping Clusters Algorithm in Ad hoc Networks Nevin Aydin Istanbul Arel University Dept. of Industrial Engineering 34295 Sefakoy-Istanbul, Turkey Email: nevinaydin@arel.edu.tr Farid Naït-Abdesselam
More informationAN OPTIMIZED CLUSTER BASED APPROACH FOR MULTI- SOURCE MULTICAST ROUTING PROTOCOL IN MOBILE AD HOC NETWORKS USING OWCA
AN OPTIMIZED CLUSTER BASED APPROACH FOR MULTI- SOURCE MULTICAST ROUTING PROTOCOL IN MOBILE AD HOC NETWORKS USING OWCA Ramyashree K.S, Arvind S & Shesharao M. Wanjerkhede GNDEC, Bidar-585403, Karnataka
More informationCongestion Control in Mobile Ad-Hoc Networks
Congestion Control in Mobile Ad-Hoc Networks 1 Sandeep Rana, 2 Varun Pundir, 3 Ram Sewak Singh, 4 Deepak Yadav 1, 2, 3, 4 Shanti Institute of Technology, Meerut Email: sandeepmietcs@gmail.com Email: varunpundir@hotmail.com
More informationClustering Based Certificate Revocation Scheme for Malicious Nodes in MANET
International Journal of Scientific and Research Publications, Volume 3, Issue 5, May 2013 1 Clustering Based Certificate Revocation Scheme for Malicious Nodes in MANET Ms.T.R.Panke * M.B.E.S.College of
More informationA COMPARISON OF IMPROVED AODV ROUTING PROTOCOL BASED ON IEEE AND IEEE
Journal of Engineering Science and Technology Vol. 4, No. 2 (2009) 132-141 School of Engineering, Taylor s University College A COMPARISON OF IMPROVED AODV ROUTING PROTOCOL BASED ON IEEE 802.11 AND IEEE
More informationTime 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[Nitnaware *, 5(11): November 2018] ISSN DOI /zenodo Impact Factor
[Nitnaware *, 5(11): November 218] ISSN 2348 834 DOI- 1.5281/zenodo.1495289 Impact Factor- 5.7 GLOBAL JOURNAL OF ENGINEERING SCIENCE AND RESEARCHES INVESTIGATION OF DETECTION AND PREVENTION SCHEME FOR
More informationEIGRP. About EIGRP. CLI Book 1: Cisco ASA Series General Operations CLI Configuration Guide, 9.7 1
This chapter describes how to configure the Cisco ASA to route data, perform authentication, and redistribute routing information using the Enhanced Interior Gateway Routing Protocol (). About, page 1
More informationKapitel 5: Mobile Ad Hoc Networks. Characteristics. Applications of Ad Hoc Networks. Wireless Communication. Wireless communication networks types
Kapitel 5: Mobile Ad Hoc Networks Mobilkommunikation 2 WS 08/09 Wireless Communication Wireless communication networks types Infrastructure-based networks Infrastructureless networks Ad hoc networks Prof.
More informationA Cluster-Based Energy Balancing Scheme in Heterogeneous Wireless Sensor Networks
A Cluster-Based Energy Balancing Scheme in Heterogeneous Wireless Sensor Networks Jing Ai, Damla Turgut, and Ladislau Bölöni Networking and Mobile Computing Research Laboratory (NetMoC) Department of Electrical
More informationEnergy Aware and Anonymous Location Based Efficient Routing Protocol
Energy Aware and Anonymous Location Based Efficient Routing Protocol N.Nivethitha 1, G.Balaji 2 1 PG student, 2 Asst.Professor Department of Electronics and Communication Engineering Angel College of Engineering
More informationMitigating Superfluous Flooding of Control Packets MANET
Mitigating Superfluous Flooding of Control Packets MANET B.Shanmugha Priya 1 PG Student, Department of Computer Science, Park College of Engineering and Technology, Kaniyur, Coimbatore, India 1 Abstract:
More informationTowards Systematic Design of Enterprise Networks
Towards Systematic Design of Enterprise Networks Geoffrey Xie Naval Postgraduate School In collaboration with: Eric Sung, Xin Sun, and Sanjay Rao (Purdue Univ.) David Maltz (MSR) Copyright 2008 AT&T. All
More informationVaibhav Jain 2, Pawan kumar 3 2,3 Assistant Professor, ECE Deptt. Vaish College of Engineering, Rohtak, India. Rohtak, India
Volume 3, Issue 8, August 2013 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Improved OLSR
More information2014, IJARCSSE All Rights Reserved Page 597
Volume 4, Issue 12, December 2014 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Mobility Based
More informationEfficient Clustering Routing Algorithm Based on Opportunistic Routing
Int. J. Communications, Network and System Sciences, 2016, 9, 198-208 Published Online May 2016 in SciRes. http://www.scirp.org/journal/ijcns http://dx.doi.org/10.4236/ijcns.2016.95019 Efficient Clustering
More informationHierarchical Low Power Consumption Technique with Location Information for Sensor Networks
Hierarchical Low Power Consumption Technique with Location Information for Sensor Networks Susumu Matsumae Graduate School of Science and Engineering Saga University Saga 840-8502, Japan Fukuhito Ooshita
More informationPrianka.P 1, Thenral 2
An Efficient Routing Protocol design and Optimizing Sensor Coverage Area in Wireless Sensor Networks Prianka.P 1, Thenral 2 Department of Electronics Communication and Engineering, Ganadipathy Tulsi s
More informationThis chapter describes how to configure the Cisco ASA to use the multicast routing protocol.
This chapter describes how to configure the Cisco ASA to use the multicast routing protocol. About, page 1 Guidelines for, page 4 Enable, page 4 Customize, page 5 Monitoring for PIM, page 16 Example for,
More informationPerformance 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 informationAn Improvement to Mobile Network using Data Mining Approach
An Improvement to Mobile Network using Data Mining Approach Sumiti Dahiya M.Phil (CS) MM University, Mulana, Ambala, Haryana (India) sumitidahiya604@gmail.com Abstract Secure communication is always the
More informationAn AIAD-Based Adaptive Routing Protocol in Ad-Hoc Wireless Networks
An AIAD-Based Adaptive Routing Protocol in Ad-Hoc Wireless Networks Youn-Sik Hong 1 and Ki-Young Lee 2 1 Department of Computer Science and Eng. 2 Department of Information and Telecommunication Eng.,
More informationBehaviour of Routing Protocols of Mobile Adhoc Netwok with Increasing Number of Groups using Group Mobility Model
Behaviour of Routing Protocols of Mobile Adhoc Netwok with Increasing Number of Groups using Group Mobility Model Deepak Agrawal, Brajesh Patel Department of CSE Shri Ram Institute of Technology Jabalpur,
More informationEZR: Enhanced Zone Based Routing In Manet
EZR: Enhanced Zone Based Routing In Manet Bency Wilson 1, Geethu Bastian 2, Vinitha Ann Regi 3, Arun Soman 4 Department of Information Technology, Rajagiri School of Engineering and Technology, Rajagiri
More informationIntrusion Detection System for Rushing Attack in MANETs
Intrusion Detection System for Rushing Attack in MANETs D.Shiny, K. Ganesh Reddy, Dept. of Computer Science and Engineering Shri Vishnu Engineering College for Women,Bhimavaram, India Abstract MANETs are
More informationA Localized Algorithm for Reducing the Size of Dominating Set in Mobile Ad Hoc Networks
A Localized Algorithm for Reducing the Size of Dominating Set in Mobile Ad Hoc Networks Yamin Li and Shietung Peng Department of Computer Science Hosei University Tokyo 18-858 Japan {yamin, speng}@k.hosei.ac.jp
More informationMobile Sink to Track Multiple Targets in Wireless Visual Sensor Networks
Mobile Sink to Track Multiple Targets in Wireless Visual Sensor Networks William Shaw 1, Yifeng He 1, and Ivan Lee 1,2 1 Department of Electrical and Computer Engineering, Ryerson University, Toronto,
More informationA New Energy Efficient and Scalable Multicasting Algorithm for Hierarchical Networks
International Journal of Engineering Research and Development ISSN: 2278-067X, Volume 1, Issue 5 (June 2012), PP.12-17 www.ijerd.com A New Energy Efficient and Scalable Multicasting Algorithm for Hierarchical
More informationPerformance Evaluation of Two Reactive and Proactive Mobile Ad Hoc Routing Protocols
www.ijcsi.org 551 Performance Evaluation of Two Reactive and Proactive Mobile Ad Hoc Routing Protocols Kashif Ibrahim Qazi Javed Ahmed Abdul Qudoos Mirza Aamir Mehmood Department of Computer Science, Balochistan
More informationFigure 1. Clustering in MANET.
Volume 6, Issue 12, December 2016 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Performance
More informationLow Overhead Geometric On-demand Routing Protocol for Mobile Ad Hoc Networks
Low Overhead Geometric On-demand Routing Protocol for Mobile Ad Hoc Networks Chang Su, Lili Zheng, Xiaohai Si, Fengjun Shang Institute of Computer Science & Technology Chongqing University of Posts and
More informationChapter 7: Naming & Addressing
Chapter 7: Naming & Addressing Goals of this chapter This short chapter looks at non-standard options for denoting the senders/receivers of messages Traditional (fixed, wireless, ad hoc): Denote individual
More informationModel Selection for Anomaly Detection in Wireless Ad Hoc Networks
Model Selection for Anomaly Detection in Wireless Ad Hoc Networks Hongmei Deng, Roger Xu Intelligent Automation Inc., Rockville, MD 2855 {hdeng, hgxu}@i-a-i.com Abstract-Anomaly detection has been actively
More informationSecuring MANETs using Cluster-based Certificate Revocation Method: An Overview
Securing MANETs using Cluster-based Certificate Revocation Method: An Overview Mrs. Dipti S. Sawant Dept. of Computer Engineering, Sinhgad College of Engineering, Pune, India. 411 041 Prof. J. E. Kamalasekaran
More informationReview on Packet Forwarding using AOMDV and LEACH Algorithm for Wireless Networks
RESEARCH ARTICLE OPEN ACCESS Review on Packet Forwarding using AOMDV and LEACH Algorithm for Wireless Networks Mrs. P. V. Meghare 1, Prof. P. A. Deshmukh 2 1 Department of Computer Science, Nagpur University,
More informationQoS Routing By Ad-Hoc on Demand Vector Routing Protocol for MANET
2011 International Conference on Information and Network Technology IPCSIT vol.4 (2011) (2011) IACSIT Press, Singapore QoS Routing By Ad-Hoc on Demand Vector Routing Protocol for MANET Ashwini V. Biradar
More informationEnergy-Efficient Communication Protocol for Wireless Micro-sensor Networks
Energy-Efficient Communication Protocol for Wireless Micro-sensor Networks Paper by: Wendi Rabiner Heinzelman, Anantha Chandrakasan, and Hari Balakrishnan Outline Brief Introduction on Wireless Sensor
More informationNeural Network Model Based Cluster Head Selection for Power Control in Mobile Ad-hoc Networks
Neural Network Model Based Cluster Head Selection for Power Control in Mobile Ad-hoc Networks Krishan Kumar,A.P.(CSE), Manav Rachna International University, Faridabad, Haryana, V.P.Singh,A.P.(CSE), Thapar
More information