Improved Hierarchical Key Management Scheme (IHKMS) with Three Phase Technique for Ad-Hoc Networks

Quality of service (QoS) and security have been considered as two competent units to govern and administer end-to-end traffic across network. A mobile ad hoc network (MANET) is a type of wireless communication, every node can act as a router or base station. Secure QoS-based routing is an important problem in MANET. A hierarchical key ranking (HKR) model is presented here for secure group communications in MANETs. To enhance the security, one-to-one random mapping is performed using hash-based message authentication code (HashMAC). Due to the dynamic nature and topological changes in MANET, group safeguarding is efficiently accomplished. For secure group communication and efficient QoS routing in MANET, a sector key (SK) is shared among group members to encrypt group messages which is obtained using secured message authenticated code (SMAC). The primary design is to include the group members in sector to vigorously contribute to the security of the multicast group, as a result dropping the communication and calculating load on the source. Experimental evaluation is done to estimate the performance of the proposed secure QoS routing and communication using hierarchical key ranking [SRHKR] in MANET in terms of delivery rate, security level, delay.

Now a days, mobile users like to use their own consumer electronic devices anywhere and at anytime to access multimedia data. Consumer electronic devices have evolved depending on user needs. Users want to use compact and portable devices such as cellular phones, laptop computers, Personal Digital Assistants (PDAs), etc. anywhere and at anytime to download multimedia data or to access realtime traffic. The mobile Ad Hoc networks have several salient characteristics, such as Dynamic topologies, Bandwidth-constrained, Variable capacity links, Energy-constrained operation and Limited physical security. Due to these features, mobile Ad Hoc networks are particularly vulnerable to denial of service attacks launched through compromised node. The communication in mobile AdHoc networks comprises of two phases, the route discovery and the data transmission. In a hostile environment, adversarial nodes can try to disrupt communication in both the two phases. However, consumer electronic devices generally operate on limited battery power and therefore are vulnerable to security threats like data flooding attacks. Flooding attack is a novel and powerful attack against on-demand Ad Hoc routing protocols. At present, FAP (Flooding Attack Prevention) is the single scheme proposed to resist such attack. But it may not give quality of service. In this paper, we present a Period Based Defense mechanism against data flooding attack in wireless AdHoc network. This is the new technique to defend the flooding attack. This scheme is based on the periods and uses a blacklist to efficiently prevent the data flooding attack. The main aim of this paper is to enhance the throughput of burst traffic. As a result of which, many data packets are forwarded at a high rate for the whole duration. The simulation results show that the proposed scheme enhances the throughput of burst traffic.

A MANET (Mobile Ad-Hoc Network) is composed of mobile, autonomous, wireless nodes that could be connected at network edges to that of fixed wired internet. The ad-hoc network does not need infrastructures that are required for other wireless networks. The term infrastructure includes need of base stations, routers etc. The network execution ought to be supported up by protecting collaboration among various nodes and it is finished by essential mechanisms. In further, most proficient routing protocols are utilized to route the packets to the destination from the source by the method of routing process. In MANET, there are various kinds of routing protocols and every one of them is associated with systematic circumstances. This paper focuses on designing a new routing protocol which considering minimum number of nodes for routing and select optimal route. This protocol also concentrates clustering as well as security considerations in order to provide tenable and proficiency routing.

In mobile ad hoc networks (MANETs), the efficient energy-efficient cluster head selection (EECHS) is a significant issue. When an appropriate cluster head (CH) is chosen, MANETs'''' energy efficiency improves. Clusters are built in MANETs to facilitate communication between nodes. The EECHS problem has been addressed using a variety of clustering strategies, including distributed clustering and cluster-based routing. However, these approaches require high overhead and complexity, leading to suboptimal performance. Therefore, it is necessary to develop an algorithm that can select the best CH to facilitate efficient energy-efficient communication in MANETs. In this regard, the Firefly Algorithm (FA) has been proposed as an effective approach to solving the EECHS problem. FA is a type of swarm intelligence-based meta-heuristics algorithm inspired by the behavior of fireflies. FA is a simple and efficient optimization method that can be used to select the best CH in MANETs. The method has a number of benefits, including enhanced convergence rate and local search functionality. FA is also computationally effective and can adapt to shifting network conditions. This essay offers a thorough evaluation of the literature on the use of FA in MANETs to address the EECHS. Along with comparisons of their performances, a thorough examination of the suggested methodologies and algorithms is offered. Last but not least, various difficulties and potential research paths pertaining to the usage of the FA are explored.

At Mobile Adhoc Network (MANET) has been long-researched topic in adhoc network owing to the associated advantages in its cost-effective application as well as consistent loophopes owing to its inherent charecteristics. This manuscript draws a relationship between the energy factor and security factor which has not been emphasized in any existing studies much. Review of existing security approaches shows that they are highly attack specific, uses complex encryption, and overlooks the involvement of energy factor in it. Therefore, the proposed system introduces a novel mechanism where security tokens and passphrases are utilized in order to offer better security. The proposed system also introduces the usage of an agent node which communications with mobile nodes using group-based communication system thereby ensuring reduced computational effort of mobile nodes towards establishing secured communication. The outcome shows proposed system offers better outcome in contrast to existing system.

Mobile Ad hoc Network (MANET) is a matter of great concern and an emerging research field of ubiquitous computing. Nowadays, security issues regarding MANETs are gaining remarkable research interest. MANET is more vulnerable to the security attacks by resource constraints. An ID based cryptography allows an user to generate their public keys without exchanging any certificates. In above scheme, public/private key can be construct without exchanging any certificate. The idea of bilinear pairings make the system efficient and easy to providing basic security. In order to provide secure communication in MANET, many researchers used different schemes to provide authentication. However, existing techniques have drawbacks such as forgery on adaptive chosen plain text message and back secrecy in traditional authentication schemes. In this paper, we work on an ID based signature scheme for achieving reliability and secure authentication in MANET. We show that proposed id based signature scheme is secure against forgery attack in the random oracle model under the Inverse-Computational Diffie-Hellman Problem (Inv-CDHP) assumption. Proposed scheme is more efficient in term of computation than other traditional schemes.

Ad Hoc wireless networks are different from traditional cellular networks which have many striking features for effective communication that are much absent in ad hoc wireless networks. The basic objective of effective communication is to pass the information from source to destination with the view on energy consumption, reliability, security, cost factor and so on. Energy efficient routing plays a primary role to sustain the Mobile Ad hoc NETwork (MANET) that defined as the kind of wireless networks that make use of multi-hop wireless links with possessing the dynamic capability of functioning without the back of any fixed infrastructure and each node must act as a router and data packet forwarder. Moreover batteries used by MANETs have limited power and so restricted processing power, which in turn confines services and applications that can be supported by each node. So, Energy management is inevitable in MANET. Here; the ultimate focus is on the role of energy factor and in parallel on all other relevant factors are concentrated at integrated approach for offering valuable communication between every node in the MANET.

Mobile Ad-hoc Networks (MANETs) are seen as an essential technology to support future Pervasive Computing Scenarios and 4G networks. In a MANET, efficient support of multipoint communications is essential in order to provide services like group audio and video conferencing, dissemination of data to a set of receivers or collaboration of a group of users. However, most of these interactive services have very strong requirements regarding delay and bandwidth. Controlling the end-to-end delay and maintaining low packet loss rate is vital to support interactive multimedia applications in MANETs. In this paper, we present QAMNet, an approach to improve the Quality of Service (QoS) for multicast communication in MANETs. We extend existing mesh based multicast routing protocols by introducing traffic prioritization, distributed resource probing and admission control mechanisms and adaptive rate control of non-real-time traffic based on Medium Access Control (MAC) layer feedback to maintain low delay and required throughput for real-time multicast flows. Simulation results show that, by reusing control messages already used by those protocols, our approach does not significantly increase control overhead nor state stored at nodes compared while it manages to increase packet delivery ratio and reduce latency for real-time traffic.

6 - Current vulnerabilities, challenges and attacks on routing protocols for mobile ad hoc network: a review

Problem statement: In Mobile Ad hoc Networks (MANET) routing protocols, we require a network-level or link layer security. Since without appropriate security provisions, the MANETs is subjected to attacks like network traffic, replay transmissions, manipulate packet headers and redirect routing messages. In order to address these needs, a policy based network management system that provides the capability to express network requirements is required. Approach: In this study, we propose a policy based scheme for combined data security which focuses mainly on three policies: Integrity, authentication and Confidentiality. For providing security not only to data, but also for routing information, we calculate the trust indexes of the nodes and the route is selected according to the trust value which improves integrity. Then in order to provide authentication, we propose a Distributed Certificate Authority (DCA) technique in which multiple DCA is required to construct a certificate. Next we propose an RSA based novel encryption mechanism in order to provide Confidentiality among the nodes. Thus, the desired level of security is provided by the system based on the policy of the user by executing the corresponding security modules. Results: By simulation results, we show that this scheme provides a combined data security in MANETs and can be used efficiently. Conclusion: Our proposed combined data security policy provides complete protection for the data in MANET communications.

To adapt with the frequent link failures in mobile ad-hoc networks, the routing protocols shall catch more than one route, at least two routes. In case of two routes, the first route can be used as the main route; while the other one can be used as a standby route used upon the detections of link failures. If this is the case, the packet losses are virtually decreased to zero, and seamless multimedia communications can be supported over mobile ad-hoc networks. To ensure the existence of two routes between any randomly chosen two nodes, the node density in terms of the number of neighbors must be above a certain threshold. In this paper, we propose a mathematical model to find such node density, and propose some solutions in case the node density is below the required density in order to increase it to the required node density. Our results show that the probability to have two routes rapidly increases with node density till it reaches the saturation region, where the increase of node density has negligible improvement in terms of network availability. This paper shows that the network nodes must have at least 16 neighbors in order to ensure the existence of two routes between any randomly chosen source and destination pair.

Frequent link breaks (due to node mobility) and quick exhaustion of energy (due to limited battery volume) are two major problems impacting on the flexibility in mobile ad hoc networks (MANETs). Cooperative communication in MANETs has become an appealing topic, as it can improve system capacity and energy efficiency. In spite of such advantages of cooperative communication, some issues still remain, such as the lack of a systematically designed cooperative routing scheme (including route discovery, route reply, route enhancement, and cooperative data forwarding), facilitation of cooperative communication in mobility resistance, and route selection (jointly considering energy consumption, energy-harvesting ability, and link break probability). Driven by the above concerns, we propose a novel Constructive-Relay-based CooPerative Routing (CRCPR) protocol in this paper. Using topological information stored and maintained in a COoPerative Table and Relay Table, CRCPR enhances resilience to mitigate the mobility issue by self-managing to construct adequate relays for data forwarding. Furthermore, assuming nodes are mostly battery operated, CRCPR proposes a new route selection mechanism, which takes into account energy consumption, energy harvesting, and link break probability, to determine an appropriate route across a network. Simulation results show the robustness of CRCPR against node mobility, further with improvement for up to 60% network throughput and 40% prolonged network lifetime.

Power control algorithms for mobile ad hoc networks

The (MANET) ad-hoc mobile network is an automated, network in which android systems link to wireless devices. Ad hoc word means "for this purpose". In MANET any device can easily move in various directions. MANETs (Mobile Ad Hoc Networks) are the basics of broadband networks. In MANET network user can link and get connected anywhere, anytime through communication. MANET introduces a new co system for communication. MANET does not require a fixed structure relies on unconnected ports for service transportation delivery. The temporary hoc network is not dependent on mobile devices (android phones, laptop, PCs, sensors, etc.) that connect exclusively to wireless connectors. Ad-hoc work on a distributed system to provide the required network performance when there is no fixed structure. In this network, it acts as a standalone network or with many attachment points on mobile networks. This paper provides view on the features, applications of ad hoc networks, characteristics and various attacks and challenges faced by programmers and Users . We analyze MANET security objectives and will outline the features, structure, types and challenges of research and the latest trend analysis presented on Mobile Ad Hoc Network to explore open-ended issues in developing navigation strategies for MANET.

Flow control, end-to-end (EED) delay, throughput, and energy consumptions are important factors of real-time and multimedia communication in mobile ad-hoc networks (MANET’s). It has a characteristic of the dynamic flow of data communication among the various users without using wired technologies. Due to this dynamic structure of MANNETS, most of its energy is consumed in route searching and packet retransmission. In addition, a problem of energy consumption may also occur due to network congestion and traffic flow control. In general, UDP is used for real-time communication but this protocol is unable to control the traffic flow properly. Therefore, a new protocol is developed for this purpose called datagram congestion control protocol (DCCP) used in those networks, which has an increasing number of multimedia traffic, and real-time flow. In this research work, major performance metrics with the issue of power usage of the TFRC and TCP like DCCP protocols are evaluated.