Author Login IJIRT Partner Network (IPN) Login

Movement Parameter in Mobile Sensor Networks

  • Unique Paper ID: 144110
  • Volume: 3
  • Issue: 6
  • PageNo: 105-110
  • Abstract:
  • Coverage of interest points and network connectivity are two main challenging and practically important issues of Wireless Sensor Networks (WSNs). Although many studies have exploited the mobility of sensors to improve the quality of coverage and connectivity, little attention has been paid to the minimization of sensors’ movement, which often consumes the majority of the limited energy of sensors and thus shortens the network lifetime significantly. To fill in this gap, this paper addresses the challenges of the Mobile Sensor Deployment (MSD) problem and investigates how to deploy mobile sensors with minimum movement to form a WSN that provides both target coverage and network connectivity. In this paper data collection problem is defined where, in a round of communication, each sensor node has a packet to be sent to the distant base station. If each node transmits its sensed data directly to the base station then it will deplete its power quickly. The protocol presented in this is an elegant solution where clusters are formed to fuse data before transmitting to the base station. By randomizing the cluster heads chosen to transmit to the base station. To this end, the MSD problem is decomposed into two sub-problems: the Target Coverage (TCOV) problem and the Network connectivity (NCON) problem. We then solve TCOV and NCON one by one and combine their solutions to address the MSD problem. The NP-hardness of TCOV is proved. For a special case of TCOV where targets disperse from each other further than double of the coverage radius, an exact algorithm based on the Hungarian method is proposed to find the optimal solution. Sensor webs consisting of nodes with limited battery power and wireless communications are deployed to collect useful information from the field. Gathering sensed information in an energy efficient manner is critical to operate the sensor network for a long period of time. In this paper, we propose PEGASIS (Power-Efficient Gathering in Sensor Information Systems), a near optimal chain-based protocol. In PEGASIS, each node communicates only with a close neighbor and takes turns transmitting to the base station, thus reducing the amount of energy spent per round. We also use the robot informatio
email to a friend

Cite This Article

  • ISSN: 2349-6002
  • Volume: 3
  • Issue: 6
  • PageNo: 105-110

Movement Parameter in Mobile Sensor Networks

Related Articles

01 Jan, 2018

Optimization of MQL in grinding with CBN wheels

Read More
22 Nov, 2017

A Stochastic Reward Nets (SRNs) Model to Investigate Data Center Performance and QoS in IaaS Cloud Computing Systems

Read More
19 Oct, 2017

Design of Improved Social Event Story Board From Image Click-Through Data

Read More
07 Oct, 2017

A New Design and Analysis for Voltage-Controlled DSTATCOM

Read More
27 Sep, 2017

An Optimal Energy Management Strategy for Standalone DC Microgrids

Read More
27 Sep, 2017

A Grid Connected Dual Voltage Source Inverter with Improvement Power Quality Features

Read More
27 Sep, 2017

STATCOM With Energy Storage For Power System Oscillation

Read More
09 Aug, 2017

Characterization and Investigation of Bending Test on Hybrid(Sisal and Banana) Fiber Reinforced Polyester Composite Material

Read More
08 Aug, 2017

AUTOMATED IRRIGATION SYSTEM USING GSM AND WIRELESS SENSOR NETWORK

Read More
15 Jul, 2017

Switching Losses And Harmonic Investigations In Multi-Level Inverter

Read More
Impact Factor
8.01 (Year 2024)
UGC Approved
Journal no 47859

Join Our IPN

IJIRT Partner Network

Submit your research paper and those of your network (friends, colleagues, or peers) through your IPN account, and receive 800 INR for each paper that gets published.

Join Now

Latest Publication

Archive

View More

Recent Conferences

NCSEM 2024

National Conference on Sustainable Engineering and Management - 2024 Last Date: 15th March 2024

Submit inquiry