Jeril Kuriakose

A Review on Localization in Wireless Sensor Networks

Localization is extensively used in Wireless Sensor Networks (WSNs) to identify the current location of the sensor nodes. A WSN consist of thousands of nodes that make the installation of GPS on each sensor node expensive and moreover GPS will not provide exact localization results in an indoor environment. Manually configuring location reference on each sensor node is also not possible in the case of dense network. This gives rise to a problem where the sensor nodes must identify its current location without using any special hardware like GPS and without the help of manual configuration. Localization techniques makes the deployment of WSNs economical. Most of the localization techniques are carried out with the help of anchor node or beacon node, which knows its present location. Based on the location information provided by the anchor node or beacon node, other nodes localize themselves. In this paper we present a succinct survey on the localization techniques used in wireless sensor networks covering its problems and research gap.

A Review on Mobile Sensor Localization

Wireless sensor networks (WSNs) are on a steady rise in the current decade because of its progressions in hardware design, resource efficiency, communication and routing protocols, and other aspects. Recently, people started preferring mobile nodes in the place of static nodes, which brought mobile sensor network into focus. Location information always plays a key role in Mobile wireless sensor network (MWSN) and precise localization has always been a challenge for mobile sensor nodes. Deploying GPS receivers for each node would render network deployment cost for a dense network. The unavailability of GPS in indoor and underground environment has also put the installation of GPS into question. This makes the sensor nodes to identify its location coordinates or location reference without using GPS, and is achieved with the help of a special node that knows its location coordinates and protocols, called beacon node. This paper’s goal is to confer different localization techniques used by mobile sensor nodes to identify their location information. Problems and future issues have also been discussed.

A survey on localization of Wireless Sensor nodes

Localization is extensively used in Wireless Sensor Networks (WSNs) to identify the current location of the sensor nodes. A WSN consist of thousands of nodes that make the installation of GPS on each sensor node expensive and moreover GPS will not provide exact localization results in an indoor environment. Manually configuring location reference on each sensor node is also not possible in the case of dense network This gives rise to a problem where the sensor nodes must identify its current location without using any special hardware like GPS and without the help of manual configuration. Localization techniques make the deployment of WSNs economical. Most of the localization techniques are carried out with the help of anchor node or beacon node, which knows its present location. Based on the location information provided by the anchor node or beacon node, other nodes localize themselves. In this paper we present a succinct survey on the localization techniques used in wireless sensor networks covering its problems and research gap.

A review on host vs. Network Mobility (NEMO) handoff techniques in heterogeneous network

Wireless networks are becoming a combination of more and more diverse and complicated networks. Handoff is a process to maintain data session continuity where mobile node changes from one base station coverage area to another base station area. Mobile maintains its existing connections via vertical handoff. In wireless environment single node mobility is known as host mobility and group of nodes moving together as single network is known as Network Mobility (NEMO). NEMO is extension of MIPv6, invented for reducing number of individual handoffs. To influence smooth mobility between these heterogeneous wireless access networks, expeditious and dependable vertical handoff (VHO) schemes are required. While taking VHO decision several parameters has to consider like received signal strength (RSS), addressable bandwidth, power intake, monetary cost, security, user predilection and etc. In this paper various handoff decision techniques based on different parameters for host mobility, and vertical handoff technique for Network mobility (NEMO) are discussed. Finally gave research issues and future research directions to NEMO.

Secure Multipoint Relay Node Selection in Mobile Ad Hoc Networks

MANETs has become a broad area in wireless networks, because of its reduced deployment cost, ease of use, and deliverance from wires. MANETs uses a decentralized and infrastructure-less network, thus making the nodes to route its messages / data with the help of intermediate nodes. Routing in MANETs is carried out with the help of broadcasting schemes, among which MPR is found to be the effectual and uncomplicated scheme. The MPR scheme broadcasts its messages only to the selected MPR nodes. The selected MPR node may be any node in the network, and there are no obligatory and adequate conditions that provides assurance about the selected node’s integrity. In this paper, we have proposed a novel approach in the MPR node selection, by adding a security feature prior to the MPR node selection. We have verified the time constraints and efficiency with the help of localization techniques. Future events are also been discussed.

Assessing the Severity of Attacks in Wireless Networks

Sensor networks is an evolving technology and a hot exploration subject among scientists due to their tractability and individuality of network substructures, such as base stations, wireless access points, and moveable nodes. Sensor networks are widely used for solicitations, such as construction, traffic observation, and territory monitoring and several other scenarios. Wireless sensor network (WSN) makes a network malleable enough to go over concrete structures and it also evades lot of cabling. The primary encounters faced in WSN are security, and the hiatus in security leads to other constrains in energy efficiency, network life, and communication overhead. The hiatus in safekeeping the network is mostly because deficiency of the overriding of wave propagation, and computing constraints. In this paper, we have deliberated about numerous diversities of attacks in WSN, and their aftermath to the network.

A Comparative Analysis of Mobile Localization and its Attacks

Wireless sensor networks (WSNs) has made a remarkable improvement in hardware design, resource efficiency, communication and routing protocols, and other aspects thereby, making it widely used in the current decade. Nowadays, people started preferring mobile nodes in the place of static nodes, which brought mobile sensor network into focus. Current position information always shows a key role in Mobile wireless sensor network (MWSN) and accurate localization has always been an encounter for mobile sensor nodes. Installing GPS receivers for each node would also increase network installation cost for a large network, thereby making the sensor nodes to identify its own location coordinates or location reference without using GPS, and is achieved with the help of a special node that knows its location coordinates and protocols, called anchor node. The localization process suffers some setbacks due to adversary nodes. The adversary nodes make the location process tedious by giving false location references. This papers goal is to confer different localization techniques used by mobile sensor nodes to identify their location information and the attacks confronted during localization. Problems and future issues have also been discussed.

Secured Neighbour Discovery Using Trilateration in Mobile Sensor Networks

In a wireless network, the initial step after deployment of a network is identifying the nodes neighbours. Neighbour discovery is the building block of a network applications and protocols and its responsibility is to identify the one hop neighbours or the nodes that are in the direct communicational range. A minor vulnerability in the neighbour discovery can lead to severe disruptions in the functionalities of the network. In this paper we propose a novel technique to identify the adversary nodes that disrupt the networks functionalities. We have modified the trilateration technique to identify the adversary node. Our security mechanism has been carried out along with the localization procedure without causing any additional overhead. Our technique can achieve successful neighbour discovery even in the presence of cheating nodes. We have also identified the probability of detecting malicious nodes for two different scenarios.

Comparative study of diverse zero-knowledge argument systems

Cryptography and complexity theory have gained a lot of importance because of zero-knowledge proofs. The motive behind zero-knowledge proofs are to provide an obfuscation to the verifier, so that the verifier will not understand the information sent by the prover. Zero-knowledge proofs are normally used to verify a provers theorem to a verifier, in such a way that the verifier will not be able to discover any supplementary evidence other than the proof given to him. An enigmatic conception was formalized, that lead to the formation zero-knowledge proof systems. In this paper, we have reviewed different zero-knowledge argument / proof techniques. We have also reviewed the proof system implications in the presence of malicious prover and malicious verifier. Examples related to zero-knowledge argument systems are also given.

Removing the Outliers of Diverse Zero-Knowledge Proof Systems using Mahalanobis Distance

The purpose behind zero-knowledge proofs are to deliver a mystification to the verifier, so that the verifier will not comprehend the information sent by the prover. Cryptography and complexity theory have gained a lot of importance because of zero-knowledge proofs. An enigmatic outset was dignified, that lead to the foundation zero-knowledge proof systems. Zero-knowledge proofs are generally used to verify a provers theorem to a verifier, in such a way that the verifier will not be able to discover any supplementary evidence other than the proof given to him. In this paper, we have reviewed different zero-knowledge argument / proof techniques. We have also reviewed the proof system implications in the presence of malicious prover and malicious verifier. We have removed the outliers of the experiment by using Mahalanobis distance. Examples associated to zero-knowledge argument systems are also given.