No abstract

WSN is a network comprising of various sensor nodes that are highly energy efficient used in various applications now a days. It helps in transmitting data from sensor nodes to the base stations in a highly reliable and secured manner. It plays a very important role in real world and integrates with many other technologies like Cloud Computing, Internet of Things (IoT). Different researchers continuously attempted to work on different constraints under Wireless Sensor Network which further becomes research motivation. In this paper, we highlighted various issues facing by different researchers while data transmission among sensor nodes. WSNs are used in various areas in all over the world, and significant progress has been made to expand the use of sensor nodes over the past two decades.

No abstract

Abstract-Wireless sensor networks (WSNs) are comprised of huge number of resource constrained petite devices recognized as sensor nodes. Data collection and forwarding is an important function of WSN. In the majority of applications, the location of the data is of much significance. Such kind of info can be acquired by using localization schemes. So, node localization is extremely essential to determine the location of node by using localization algorithms. Hence, localization becomes a hot research issue in WSNs. Many localization algorithms have been projected to precisely locate nodes in WSNs. These algorithms are broadly classified into range based and range free categories. Range based methods use exact computation measure (distance or time) among nodes in the network. So range based methods needs some additional hardware for such computation while range free methods don't require any specific hardware. Range free methods use connectivity information between nodes in network. So range free methods are considered cost effective alternatives to range based methods. In this paper, we propose a novel range free localization algorithm for WSN on the basis of swarm intelligence. We perform the comparative analysis of proposed algorithm with DV-Hop algorithms on the basis of localization error and accuracy. Simulation results shows that proposed algorithm outperform the DV-Hop algorithm. In this paper, we proposed a modified algorithm for localization on the basis of distance vector hop algorithm. The proposed method reduces the localization error and improves accuracy without raising the cost of the sensor node. Here the presented work contributes three most important things to localization problem. First, we propose a new modified algorithm that is easy to use and cost effective. Second, the proposed algorithm reduces the localization error as compared to DV-Hop. Third, we explore the impact of anchors and communication range on performance of new modified algorithm. The remaining part of paper is planned as; section 2 focused on a literature review. Section 3 focused on the DV Hop localization algorithms. The proposed algorithm is illustrated in section 4. Section 5 focused on the result and discussion of performance of algorithms. Finally, section 6 concludes the work. Keyword

No abstract