Jay Prakash

Maximizing Lifetime of Wireless Sensor Network by Sink Mobility in a Fixed Trajectory

Maximization of lifetime of wireless sensor network (WSN) is an emerging area of research in present scenario. Many authors are performing their research work, so that they could achieve lower energy consumption for the sensor network which leads to increase in lifetime of network. Our work focuses on sink mobility in a fixed trajectory within a wireless sensor network while sensed data are required to be collected. We divide the whole sensor network into two different regions as direct communication area (DCA) and multi-hop communication area (MCA). Sensors node that lies in DCA is at one hop count distance from the sink node trajectory while sensors within MCA are at more than one hop count from the trajectory. We considered all the sensors that are within DCA as subsink nodes. During sink mobility, whenever a subsink is closer to the mobile sink node, then it starts transmitting its data to the sink node. But those sensors that are within MCA needs to search an appropriate sink node for sending its sensed data to the subsink so that on further stage, that subsink could provide those data to the sink node whenever it is in nearest proximity of that subsink. Basically, a sink node is the ultimate destination for the data while a subsink node acts as a relay node for the nodes that are within MCA. So our work is to find out the appropriate subsink node from a given set of subsinks. For doing so, we used location-aided routing on global positioning system (GPS)-enabled sensors and sink node. Our work is validated through simulation experiments using NS-2.

A Multi-metric-Based Algorithm for Cluster Head Selection in Multi-hop Ad Hoc Network

Clustering technique finds wide applicability in wireless networks. Cluster structures enhance resource reuse as well as increases system capacity. Clustering is a desirable task in MANET if the size of multi-hop wireless network becomes too large. In the existing work, number of cluster formation depends on the radius of cluster chosen in a scenario. But here, we propose a new approach in cluster head selection within a cluster. Here, we consider three parameters, i.e. number of node neighbours, node lifetime and stability of nodes which in turn are used for selection of an appropriate cluster head. We simulated our algorithm and measured performance by considering energy consumption, throughput and control overhead as performance metrics. Our approach has been found outperforming to the existing ones.

A survey on secure gateway discovery in MANET

Mobile adhoc network (MANET) is a collection of mobile node that can communicate with each other via radio or infra without any fixed infrastructure. MANET is a wireless network so to connect with internet any interface is needed that is called gateway which provide route to the internet. Due to dynamic topology packets are loss which degrades network operation. So to achieved high throughput security scheme are applied on internet gateway which helps to out from adversarial environment. There are some security goal is discussed (confidentiality, integrity, authentication and non-repudiation) which enhanced adhoc network operation. In this paper we survey on the gateway discovery scheme with security and without security on the basis of various performance parameter like packet delivery ratio, end to end delay, routing overhead and throughput and then conclude which one is better.

A New Congestion Avoidance and Mitigation Mechanism Based on Traffic Assignment Factor and Transit Routing in MANET

Data communication through wireless channels faces a challenging issue toward congestion and link quality variation. Regardless of mobile or stationary nodes in the network, the link in between the nodes experiences a fluctuation in link quality. Congestion is an intriguing issue, which occurs when there is deterioration in QoS at the link which transports data. This paper describes that an Internet network which is basically a backbone network with wired connection can be utilized for not just Internet services availability but also for mitigating congestion in a network. Data traffic in between nodes in a Mobile Ad hoc Network (MANET) can also be diverted through this backbone network to opt congestion-less environment and higher throughput. This technique is called as transit routing. The proposed protocol is compared with the uniform traffic allocation scheme. The experimental results prove that the proposed method outperforms the existing ones against congestion. It also reduces the packet drop ratio and increases system reliability.