Geetanjali Rathee

Buffered based routing and resiliency approach for WMN

Several approaches to effectively perform communication in Wireless Mesh Network (WMN) have been proposed. Further communication failures and possibilities of minimum services during such failures are very hard to maintain. Recently resilient multicasting and Resilient Opportunistic Mesh Routing for WMN (ROMER) approaches proposed routing and resilient methods over WMN. Resilient multicasting approach establishes two node disjoint path between each source-destination pair. But this approach can immune from any single link or intermediate node failure. While ROMER approach provides redundant copies of data in randomized manner to increase WMN throughput. We have proposed Buffer Based Routing method in which instead of maintaining routing table at each node we provide buffering at each node which reduces routing cost. At specific interval of time (after specified communication steps) it clears the buffer to increase performance and prevent overhead in network. Using this approach we effectively perform resiliency and exploits advantages o fWMN. The performance of the proposed approach is studied by evaluating the cost involved in routing and resiliency using these approaches and compared with the proposed approach.

Mitigation Techniques for Gray Hole and Black Hole Attacks in Wireless Mesh Network

Wireless mesh network (WMN) is considered as a key technology in today’s networking era. In this, security is determined as a vital constraint. Several approaches have been proposed to provide secure communication in WMN but communication security possibilities always exist and are very hard to maintain. Black hole and gray hole are the two major attacks at the network layer in WMN. RAODV, IDSAODV, and RIDAODV are some security approaches against these attacks. These approaches can immune the communication at a certain rate. We have proposed a cache-based secure AODV routing protocol, i.e., SDAODV in which instead of using the RREQ messages, security is provided by using the last sequence number of each packet. Using this approach, we have improved the network throughput at a certain rate. The performance of the proposed approach is evaluated by showing the throughput graph.

Secured Authentication and Signature Routing Protocol for WMN (SASR)

Security provisions are a significant influence in the conception of security system for wireless mesh networks (WMNs). It is therefore necessary to guard the identities of individual clients to avoid personal privacy concerns. Numerous susceptibilities exist in different protocols for WMNs (i.e. Overhead, storage, availability of resources). These ambiguities can be discussed by probable attackers to bring down the network performance. In this manuscript, we offer a secure authentication and signature routing protocol (SASR) based on diffie-helman model and threshold signature for reducing response time and improve the security at mesh node. The proposed approach validates the certification of the mesh nodes effectively and paves the path for secure communication. Since the protocol uses Diffie-Helman key mode and threshold signature, very little key is enough for obtaining the needed protection. This thins out the bandwidth allocation for key, so the security constraints will not move the bandwidth by any means, which is an additional advantage over other systems.

Transport Information System using Query Centric Cyber Physical Systems (QCPS)

To incorporate the computation and communication with the physical world, next generation architecture i.e. CPS is viewed as a new technology. To improve the better interaction with the physical world or to perk up the electricity delivery usage, various CPS based approaches have been introduced. Recently several GPS equipped smart phones and sensor based frameworks have been proposed which provide various services i.e. environment estimation, road safety improvement but encounter certain limitations like elevated energy consumption and high computation cost. To meet the high reliability and safety requirements, this paper introduces a novel approach based on QCPS model which provides several users services (discussed in this paper). Further, this paper proposed a Transport Information System (TIS), which provide the communication with lower cost overhead by arranging the similar sensors in the form of grids. Each grid has a coordinator which interacts with cloud to process the user query. In order to evaluate the performance of proposed approach we have implemented a test bed of 16 wireless sensor nodes and have shown the performance in terms of computation and communication cost.

Authentication Through Elliptic Curve Cryptography (ECC) Technique in WMN

Recently, Wireless Mesh Network is deliberated as a significant technology due to its self-healing and self-organizing characteristics. In WMN, data is forwarded through multiple hops to the destination node. One of the factors that impact the network performance is the secure communication delay. An authentication technique having significant delay may enhance the possibility of several security threats. A number of authentication protocols have been proposed in the literature but if existing practices are deliberated then to optimize one of the constraint other parameters are affected radically. In this manuscript, a Diffie-Hellman elliptic curve technique is used over WMN which reduces latency and computational overhead issues. Further to prove the integrity of proposed work, the performance is measured theoretically and analyzed experimentally over ns2 simulator.

Secure Modified Ad Hoc On-Demand Distance Vector MAODV Routing Protocol

In the context of wireless technology, a secure communication is requisite for stopping the unauthorized access to the network services. This manuscripts aim is to detect and eliminate the malicious nodes involved during routing path formation in mesh environments by doing some amendments in basic AODV routing phenomenon. The proposed mechanism is further merged with previously proposed secure authentication and signature routing SASR protocol to address the security threats such as grey hole, black hole attacks and to recover the network metrics in terms of packet loss ratio, packet delivery ratio, computational time and network throughput. Further, the approach is simulated by computing the network throughput in both the scenarios i.e. with the involvement of malicious nodes and without involvement of malicious nodes. Moreover, we have validated the network metrics of proposed mechanism against conventional approaches.

Weight Trusted Routing Mechanism for Hierarchical Mesh Environments

In this paper, we have proposed a technique to detect and eliminate the malicious/misbehaving nodesinvolvedduringroutingpathformationinhierarchicalmeshenvironments.Inthis,dijkstra’s shortestpathroutingalgorithmisusedwhoseweightsaredeliberatedusingcertainparameters(i.e. nodedistance,node’spreviousinteractions,packetlosspercentageandtrustvaluesofeachnode)for providingthesecurityagainstroutingattacks.Themaliciousnodesinvolvedduringroutediscovery processareeliminatedbycalculatingthetrustofeachnodeusingSocialImpactTheoryOptimizer (SITO).Here,wehavediscussedthenetworkperformancetrade-offcausedbysecurepathformation inconventionalmethodsandproposedaWeightTrustedRouting(WTR)mechanismforeliminating theseissues(packet-lossratio,end-to-enddelayandroutediscoverydelay).Wehavenumerically simulated and compared the network metrics for both conventional and proposed approaches. Moreover,theproposedtechniqueisvalidatedbydiscussinganempiricalstudyoverroutingattacks. KEyWoRDS Black Hole Attack, Routing Protocol, Security, SITO, Trusted Routing, Wireless Mesh Network, Worm Hole Attack, WTR

A Secure Homomorphic Routing Technique in Wireless Mesh Network (HRT for WMN)

As Wireless Mesh Network (WMN) is deliberated as a key technology in today’s networking era, security during designing of such system plays a significant role. A number of techniques (i.e. PANA, LHAP) have been proposed by several researchers in order to provide the security, but leads to certain vulnerability i.e. computational overhead, network congestion and encryption/decryption timing delay. In order to overcome against such drawbacks, this manuscript gives a novel technique based on homomorphic encryption (HE). Homomorphic encryption is a technique employed to heighten the security using algebraic operations without increasing the computational overhead. The suggested technique is evaluated against encryption/decryption parameter and proves the efficiency in comparison of existing protocols.

Resilient Packet Transmission (RPT) for the Buffer Based Routing (BBR) Protocol

To provide effective communication in the wireless mesh network (WMN), several algorithms have been proposed. Since the possibilities of numerous failures always exist during communication, resiliency has been proven to be an important aspect for WMN to recover from these failures. In general, resiliency is the diligence of the reliability and availability in network. Several types of resiliency based routing algorithms have been proposed (i.e., Resilient Multicast, ROMER, etc.). Resilient Multicast establishes a two-node disjoint path and ROMER uses a credit-based approach to provide resiliency in the network. However, these proposed approaches have some disadvantages in terms of network throughput and network congestion. Previously, the buffer based routing (BBR) approach has been proposed to overcome these disadvantages. We proved earlier that BBR is more efficient in regards to w.r.t throughput, network performance, and reliability. In this paper, we consider the node/link failure issues and analogous performance of BBR. For these items we have proposed a resilient packet transmission (RPT) algorithm as a remedy for BBR during these types of failures. We also share the comparative performance analysis of previous approaches as compared to our proposed approach. Network throughput, network congestion, and resiliency against node/link failure are particular performance metrics that are examined over different sized WMNs.

Image data-deduplication using the block truncation coding technique

In this paper, we have CBIR, which is known as Content based Image Retrieval is the application of computer vision technique to the image retrieval problem from the large databases. In this paper de-duplication of electricity bills is done through CBIR. The technique for comparing the images is Block truncation coding; it is a lossy compression technique for grayscale image. So Photograph of electricity was divided into different block size using a compression technique known as Block Truncation coding. On the basis of block size, we will put images of the same block size in the same cluster. As there will be large block, so they will be divided into chunks of data. Through this experiment we will try to remove duplicates in the same cluster. In this paper the block of data is also divided into different chunks, so that image of single instance can be stored in these chunks. So duplication will be improved with the help of compression techniques discussed in detail.