Finding Node Location And Time Sensive In Wireless Sensor And Adhoc Networks

Abstract

Wireless sensor network consist of large number of sensor devices spread over a larger filed. A sensor is a small device which is having one or more sensors, processor, memory, a radio and actuator. Each sensor device will sense the data and transfers the collected data along the network. To transfer the data, each sensor node should be present in the network. For that finding location is important so as to send and receive the data from one to another node. Finding the location in the ad-hoc[1] network is too difficult. In ad-hoc and wireless sensor network, every node is moving from one location to another location, when node is moving from one location to another location during that juncture there may be a chance of loss of data in the wireless sensor[2] network. Finding the accurate location [3] in the ad-hoc network and the time frame to transfer the data is not an easy task. Let’s say i is the one node and j is the another node in the network, then finding the distance between the node is (i,j) € G, where G is the Euclidean space. Distance can be found in the way of d(i,j) and can be defined as d(p(i),p(j)), in this both local and non-local nodes can be noticed.

Authors and Affiliations

Mevundi Srinatha| Department of Computer Science and Engineering, Intell Engineering College, Anantapur, Andhra Pradesh,India, Dr. G. Prakash Babu| Computer Science and Engineering Department,. Intell Engineering College, Affiliated to JNTU, Anantapur, Andhra Pradesh,India.

Keywords

Related Articles

Courseware Quality Groups Tie-in to Reinforcing

Software Quality Assurance (SQA) involves the complete software development process - monitoring and improving the process, making sure that any agreed-upon standards and procedures are followed, and ensuring that the...

Improving the Security of E-Passports with WDDL Logic and Elliptic Curve Cryptography

This paper describes the security of E-passport with elliptic curves. The chip which is having the information about the passenger should occupy very less area & The chip information cannot be traceable. AS Compared t...

Reduce Scanning Process for Efficient Mining Tree in Association Rule Mining

The essential aspect of mining association rules is to mine the frequent patterns. Due to native difficulty it is impossible to mine complete frequent patterns from a dense database. FP-growth algorithm has been imple...

Finding Node Location And Time Sensive In Wireless Sensor And Adhoc Networks

Wireless sensor network consist of large number of sensor devices spread over a larger filed. A sensor is a small device which is having one or more sensors, processor, memory, a radio and actuator. Each sensor device...

Enhanced Bit Compressed Authentication Approach to Prevent False Data Injection Attacks and Energy Wastage in Route Nodes Over Wireless Sensor Network

Sensor Nodes Offer a powerful Combination of Distributed Sensing, Computation and Communication. A sensor network is a static ad hoc network consisting of hundreds of sensor nodes deployed over an area to perform loca...

Download PDF file
  • EP ID EP8477
  • DOI -
  • Views 359
  • Downloads 21

How To Cite

Mevundi Srinatha, Dr. G. Prakash Babu (2013). Finding Node Location And Time Sensive In Wireless Sensor And Adhoc Networks. The International Journal of Technological Exploration and Learning, 2(3), 127-130. https://europub.co.uk/articles/-A-8477