Scribd
Upload
5 views

Mobile Data

The document presents a new framework for mobile data gathering in wireless sensor networks (WSN) that utilizes mobile elements for concurrent data uploading, addressing issues such as energy consumption and link capacity. It proposes a polling-based approach, formulates an optimization problem, and outlines both centralized and decentralized algorithms for data collection. The proposed system aims to enhance reliability, reduce costs, and improve network efficiency by leveraging mobile nodes for data acquisition.

Uploaded by

vinoth
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
5 views

Mobile Data

The document presents a new framework for mobile data gathering in wireless sensor networks (WSN) that utilizes mobile elements for concurrent data uploading, addressing issues such as energy consumption and link capacity. It proposes a polling-based approach, formulates an optimization problem, and outlines both centralized and decentralized algorithms for data collection. The proposed system aims to enhance reliability, reduce costs, and improve network efficiency by leveraging mobile nodes for data acquisition.

Uploaded by

vinoth
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 26

A Distributed mechanism for Mobile Data Gathering using

mobile elements with


Concurrent Data Uploading in Wireless Sensor Networks

BY.
Abstract
• We look at mobile data acquisition in wireless sensor networks (WSN)
from a mobile collector with multiple antennas.

• By considering the elastic nature of wireless link capacity, and the power
control for each sensor, data uploading, which is forced to by flow saving,
energy consumption, connection capacity, compatibility among sensors
and the total residence time of the bound mobile collector at all anchor
points.

• We propose a polling-based mobile gathering approach and formulate it


into an optimization problem, named bounded relay hop mobile data
gathering (BRH-MDG).

• Centralized and Decentralized algorithms for selecting polling points that


buffer locally aggregated data and upload the data to the mobile collector
when it arrives.
Existing System:
• In existing system, data gathering cost minimization framework for mobile
data gathering in wireless sensor networks by considering dynamic wireless
link capacity and power control jointly.

• Our new framework not only allows concurrent data uploading from sensors
to the mobile collector, but also determines transmission power under
elastic link capacities.

• We study the problem under constraints of flow conservation, energy


consumption, elastic link capacity, transmission compatibility, and sojourn
time.

• We employ the subgradient iteration algorithm to solve the minimization


problem.
Disadvantage

• The cost function used may not completely


reflect the overall pricing structure in the
network.
Proposed System
• We have proposed a WSNs with mobile elements (MES) for mobile
data acquisition with concurrent data upload in Wireless Sensor
Networks.

• We specifically focus on data collection, that is, the process that


makes communication feasible between the sensor nodes and the
sink.

• In fact, there are many other problems that can be addressed by


taking advantage of mobility in WSNs.

• Wireless sensor nodes limited energy and efficient technologies must


be used during data collection network to maximize service life.
Advantage

• Sparse WSN – Since the nodes are mobile we can manage


with fewer nodes. So sparse WSN becomes a feasible option.
• Less Cost – Since fewer nodes can be deployed, the network
cost reduces. We can make use of mobile elements already
present like moving vehicles, public transport etc. to transport
data,
• More Reliable – Data loss is reduced as the mobile elements
visit the nodes to collect data directly through single- hop
transmission as opposed to multi-hop transmissions.
Interferences and collisions are avoided.
• Funneling effect avoided – In traditional networks, the nodes
near the sink are overloaded as they have to relay the data to
the sink node.
LIST OF MODULES
1. Re-locatable node

2. Data transfer follows discovery

3. Mobile Data Collectors (MDCs)

3.1. Mobile Sinks

3.2. Mobile Relays

4 Mobile peers
Re-locatable node

• These nodes change their location to forward data to the


destination.
• They do not carry any information in contrast to mobile
nodes. They change the topology of the network.
• Predefined Intelligent Lightweight tOpology managemenT
(PILOT) nodes are used during link failure to re-establish
connectivity in network.
• They act as bridges when nodes are unstable.

• Algorithms for placement of re-locatable nodes in order to


improve the network connectivity.
Data transfer follows discovery
• The goal of the data transfer protocols is to maximize the
throughput in terms of messages successfully transferred per
contact – while minimizing the energy consumption.
• After the presence of an ME has been detected, actual data
transfer has to be accomplished by using a data collection
protocol.
• By data transfer, we mean the communication process between
an ME and its one-hop neighbors.
• As a consequence, data transfer protocols have to be aware of
the issues which result from mobility.
Mobile Data Collectors (MDCs)
• They visit each node and gather data. They can be mobile sinks or
mobile relays.
1. Mobile Sinks
• These mobile nodes are the destination and have high energy. They
move around and collect data. The collected data can be made
available to users using wireless internet connection. The path
between the sink and node is not fixed and changes with time. Path
between node and sink is multi–hop.
2. Mobile Relays
• The MULEs pass through the network collect the data from the
sensor nodes and when they to near the sink they pass the collected
data to the sink. The MULEs move in straight line and to reduce
delay the data can be relayed by other nodes to reach the sink.
Mobile peers

• Mobile peers are ordinary mobile sensor nodes in WSN-MEs.


They can be the source or they can be used to relay the
messages in the network.
• Mobile peers are depicted Their interactions are symmetrical
because the sink itself might also be mobile.
• When a peer node is in communication range, it can transfer
its own data and it can gather data from the other peer nodes
while moving in the sensing area.
• This can be avoided by using a predictable robot or vehicle as
suggested in the Mobile peers can also be used for data
collection in urban sensing scenarios.
SYSTEM CONFIGURATION
HARDWARE CONFIGURATION
• Processor - Pentium –IV
• RAM - 520 MB(min)
• Hard Disk - 20 GB
• Key Board - Standard Windows Keyboard

SOFTWARE CONFIGURATION
• Operating System - Windows XP/7
• Programming Language - JAVA/J2EE
• Java Version - JDK 1.6 & above
RESULT
CONCLUTION
• The experimental work has proven that our proposed
mechanism significantly reduces energy compared to
the normal operational method in data centers. The
overlay is self-organizing and allows peers to join or
leave the overlay at any time. Due to its simplicity,
our proposed mechanism is particularly expected to
attract many practical uses in data centers.
REFERENCE
• Y. Wen, G. Zhang, and X. Zhu, “Lightweight Packet
Scheduling Algorithms for Content Uploading from Mobile
Devices to Media Cloud,” Proc. GLOBECOM’2011
Workshops, Houston, Texas, USA, Dec. 2011, pp. 45–50.

• D. Camps-Mur et al., “Device-to-Device Communications


with WiFi Direct: Overview and Experimentation,” IEEE
Wireless Commun., vol. 20, no. 3, 2013, pp. 96–104.

• X. Wang et al., “Cloud-Assisted Adaptive Video Streaming


and Socialaware Video Prefetching for Mobile Users,” IEEE
Wireless Commun., vol. 20, no. 3, 2013, pp. 72–79.

You might also like