IRJET- Cost Effective Scheme for Delay Tolerant Data Transmission

International Research Journal of Engineering and Technology (IRJET) e-ISSN: 2395-0056
Volume: 05 Issue: 10 | Oct 2018 www.irjet.net p-ISSN: 2395-0072
© 2018, IRJET | Impact Factor value: 7.211 | ISO 9001:2008 Certified Journal | Page 180
Cost Effective scheme for Delay Tolerant Data Transmission
C. Ashwini1, Bheemanadham Surya Sai2, Arpit Tharad3, Ayush Kumar4, Suraj Kumar5
1,2,3,4,5Department of Computer Science and Engineering, SRM Institute of Science and Technology,
Chennai, India
---------------------------------------------------------------------------***---------------------------------------------------------------------------
Abstract - A staggering amount of data is sent every second by
the smart devices to the cloud for further processing over the
course of time. While some of the data is supposed to be sent to
their applications in a timely fashion. However, all data are not
needed to be available in a real-time manner. For such delay-
tolerant data we propose a scheme to improve data transfer
cost, especially on wireless IoT gateways which use the cellular
network, by delaying data transmission to the eleventh hour.
The delayed transmission will enable us to compress more data
together and select a more suitable wireless IoT-Gateway. The
meshing of wireless IoT-Gateways together helps us in
providing a stable internet connection via fault tolerance and
bandwidth aggregation. In this proposed paper we try to meet
the maximum data deadline within minimal data transmission
cost. According to our tests both the existing and proposed
system lead to less than 1.5%data deadline missed and the
proposed system reduces the cost by 75% which is a
considerable amount of improvement and ground breaking in
the current industry.
Keywords: Wireless Mesh Network, Gateway, Delay
Tolerant Data, Data Deadline, Fall Tolerance
1. INTRODUCTION
As of late, the expanded interest for omnipresent web
network and broadband web access has prodded the
requirement for new imaginative remote advancements. One
is the Internet of Things (IoT) guarantees numerous
applications from exactness agribusiness to shrewd urban
areas. IoT applications and their designs are very tremendous,
as can be seen from late reviews. It is normal that relatively
every associated keen question will produce and transmitting
information, henceforth an amazing measure of information
should be gathered by the IoT doors and be prepared halfway
in the cloud. With the huge development of information
volume in IoT, organize correspondence cost turns into an
awesome worry in IoT, notwithstanding system execution. IoT
and information measurements are amazing, to the point of
seeming fantastical: 5 quintillion bytes of information
delivered each day, constantly 2020, the IoT will include in
excess of 30 billion associated gadgets, it would take a lifetime
to physically examine the information created by a solitary
sensor on an assembling sequential construction system.
Notwithstanding that, the Harvard Business Review found
that: not as much as half of organized information is
effectively utilized in basic leadership, under 1% of
unstructured information is broke down or utilized by any
means. With the gigantic development of information volume
in IoT, arrange correspondence cost turns into an
extraordinary concern.
A remote IoT-portal (in the future alluded as the door) in
this work alludes to a passage with an inherent cell modem
for association with the cloud which charges cell utilization
in light of a for each use premise. The point of this work is
to diminish the WAN information exchange cost over the
regular cell systems, for example, 3G and 4G. This work
opined that relying upon the idea of the applications, not all
applications require constant information, rather guarantee
that information must be sent to its cloud application
convenient. For example, continuous information isn't
expected to screen the proficiency of a forced air system
framework; information with 5-minute deferral is adequate
to uncover its productivity. So as to accomplish bring down
system correspondence cost in the IoT engineering, we
recommended that the passages ought to be built up in
work design so each IoT portal can speak with each other.
The execution is frequently unpredictable and the cost is
charged in light of the compensation as-you-utilize display.
The current IoT structures might not have comparable
issues if the IoT passages are associated with the web
through a wired system, or if the engineering is composed
with one IoT portal, or if adaptation to internal failure is
accomplished by means of excess. For our cell organize
based IoT entryway, clearly the upsides of work IoT portals
incorporate transfer speed accumulation and adaptation to
non-critical failure. By and large, to limit information
transmission cost without impinging upon the execution,
two methodologies can be considered: information
pressure and practical system association choice.
Information pressure is one of the current arrangements
that means to diminish the information transmission taken
a toll by limiting information volume to be transmitted. This
strategy can be connected to any current IoT engineering
paying little heed to the correspondence conventions.
In this work, we characterized 2 distinctive IoT-entryway
conspires in particular due date cost plot (DC) and due date
most brief line first plan (DSQF), and contrast them and the
traditional avaricious cost conspire (GC) and the most
limited line first (SQF) plots as far as aggregate information
transmission cost and level of information due date met.
The key thought for the due date cost plot (DC) is to pick the
least expensive portal that meets the information due date
at whatever point an information parcel is gotten by a door,
with the speediest entryway as the reinforcement passage.

For the due date most brief line first plan (DSQF), the
speediest entryway that meets the information due date is
chosen as the essential door while the least expensive
passage is the auxiliary portal. From our test results, we
demonstrated that while the immediate exchange meets just
68.8% of the information due date, we can meet 98.9% of the
information due date and diminish the information
transmission taken a toll by 5.74% under the typical
situation, when the normal Internet association speed is
higher than the normal information approaching rate.
There is the quantity of works concerning the issue of load-
adjusting in WMNs which a large portion of them center
around adjusting the heap between all door hubs though all
passages have comparative load and a large portion of them
don't consider blockage and obstruction.
1.1 Related Works
Internet of things (IoT) has a lots of application in day to day
life and this is shown by the works from [1],
Which tells us about the survey on the recent IoT applications
and their employed architectures. Which architecture can be
used at which point.
In the studies from [2],[3] and [4] tells us about the IoT
monitoring systems and distributed measurements. As a
number of smart devices are connected to the network of IoT
and it require a large amount of data transfer and storage. It
also tells about the sensor nodes that transfer data directly to
the cloud via WiFi access point. But it does not tell about the
cost of the scheme, volatility of the network and data transfer
cost in cellular networks. In our proposed system we
introduce a Wireless mesh Network to overcome these
limitations.
In the studies [5], tells about employing wireless mesh
network as they provide fault tolerance, ease of deployment
and load balancing among gateways to reduce network
congestion but do not focus on reducing the data transfer cost
and data transmission rate. In other studies [6] and [7] also
tells about employing WMNs but the performance metrics
depends on average delay, load balancing and output. They do
not consider about the data cost reduction by using of data
deadline and minimizing the data cost by managing the
tolerant and intolerant data appropriately.
In another study [8], in which the data is categorized into
urgent (high priority data) and normal ones (less priority
data) and uses a queue in which precedence is give to higher
priority data but the disadvantage of this approach is the least
priority data will always will remain at the last if all other data
is higher priority and will cross its deadline. This will in the
long run lead to increase in the number of data that cross the
deadline and ultimately lead to decrease in efficiency.
In the study [9] provides a solution for data transfer cost
reduction by networks edge data reduction in the real time.
It tells about an algorithm for the above approach but in for a
single gateway scheme and assumes that all data would be
available in cloud in the real time, this may not be the case all
the time and it also does not tell about handling delay
tolerant data.
2. CONTRIBUTIONS
We utilize "work system of doors" arrangement. The portal
choice methodologies in a remote work organize (WMN) is
for the most part intended to illuminate the system clog
issue. Remote Mesh Networks (WMNs) is a quickly
developing innovation for giving high transfer speed
broadband support of a huge network of clients. In WMNs,
passage hubs go about as a main issue of network to the
wired foundation (ordinarily the Internet).
In this manner activity collection happens in the ways
prompting an entryway and because of the constrained
remote connection limit, these hubs are probably going to be
potential bottlenecks. There are many existing works
identified with portals in work systems.
From our writing seek, many existing works center around
stack adjusting among entryways to ease organize clog
issues; information due date satisfaction are regularly
managed independently, while relatively few foci on
decreasing information transmission cost. For example, in
the work done by, the system execution is estimated as far as
normal deferral, line load, and throughput. Information due
date was not their examination need.
When switches have gotten the portal data, passage choice
ought to be prepared. For the most part, portal and course
determination can be coupled together in that the system
endeavors to locate the best course to any of the accessible
entryways by assessing the course measurements on the
accessible way.
The conventional portal choice depends on the metric of
least bounce tally. In any case, bounce tally is a poor decision
as a directing metric in multi-jump remote systems. The
conflict level metric was utilized rather than the base bounce
metric for passage choice.

Fig 1: Architecture of Wireless Mesh Gateway
In reality, there is various research in IoT that means to
enhance the financial cost. For example, some proposed
brilliant information valuing plans to set the ideal IoT benefit
membership expense as a benefit amplifying instrument for
IoT specialist organizations. Different creators researched on
the use based valuing in clog inclined system benefit market
to enable the IoT to specialist organizations enhance their
estimating methodology. Be that as it may, they attempt to
streamline the cost from the points of view of the IoT
specialist co-ops rather than the IoT clients. Rather, there are
a lot of work in the other research zones that expects to limit
the money related cost for clients, without trading off the
administration execution, for example, cloud benefit
determination and portable information offloading.
Since cloud benefit is given in light of use based valuing
model, it is vital to choose the best cloud specialist co-ops
with the most reduced cost, without corruption of the
administration execution. For instance, Yi et al introduced
adaptable case benefit, which supplements existing cloud
benefits by enabling the cloud clients to run delay-tolerant
employments at a lower value, which is like our advantage.
3. THE MODEL
In this paper, we center around the entryway choice issue in
Wireless Mesh Networks (WMN), that is, the means by which
to choose the best passage for each pending information
parcel, to guarantee however many information can be
transferred before its due date as could be allowed, with the
base information transmission cost.
A commonplace WMN can be visualized to be framed of a
three level various leveled structure. At the highest point of
the pecking order are the IGW or the door hubs that are
straightforwardly associated with the wired system. The
second level of progressive system comprises of hubs called
Access Points (APs)/Mesh Routers (MRs) that forward every
others' activity in multi-jump form towards the IGW. These
MRs frame the foundation of a WMN and are generally static.
At the least level of pecking order are the Mobile
Clients/Nodes (MNs) or the end clients associated with the
MRs for getting to the wired system administrations. A MR
can be outfitted with numerous interfaces to such an extent
that every one of the interfaces is tuned to various non
overlapping channels encouraging concurrent transmission
and gathering. This component of WMN can be misused to
improve their execution.
A remote work organize comprises of N entryways. We
signify G as the arrangement of passages, where G = {g0, g1,
... gN}. We consider the situation where every passage is sent
with various cell broadband plans chosen by the clients,
subsequently every portal is liable to various month to
month cost, greatest Internet association speed and
information amount. We characterize the unit cost of the cell
broadband arrangement as the cost-to-quantity proportion
of the arrangement. We accept that the information
transmission speed among the passages, SpeedG, is
substantially higher than the Internet association speed. For
every entryway I, we indicate the surge of information
gotten by every door as Di, where Di= {di,0, ..., di,j, ... di,n} and
di,j = <DataSizei,j, Deadlinei,j>.
At the point when an information bundle is gotten by a door,
it will communicate a message to all the entryways that are
one jump away. These neighboring doors will answer with
data, for example, line time and the unit cost for information
transmission. Entryways that are unmoved inside a given
time utmost will be considered as occupied. The neighboring
doors that are excessively occupied with, making it
impossible to react will be overlooked. The entryway choice
plan will then choose if the information ought to be
exchanged to other work doors or to the cloud
straightforwardly without anyone else's input, in light of the
accessible data from different portals. Information sent from
different passages can't be sent again and must be conveyed
by the entryway itself. This is to keep livelock from
happening.
4. PROPOSED SOLUTION
In our door choice calculation, at whatever point an
information parcel is gotten by a portal, the entryway will
communicate to all the neighboring passages that are one
jump away for data refresh. The neighboring portals will
then need to answer with message containing data, for
example, line time and unit cost inside a specific time
restrain. The door will then run the portal determination
plans to choose if the information ought to be exchanged to
other work entryways or to the cloud specifically, in light of
the acquired data. The passages that don't react inside the
given time cutoff will be accepted as occupied and won't be
considered in the basic leadership.
We propose and assess two door choice plans to upgrade the
rate of information due date met with the insignificant
information transmission cost: due date cost (DC) plan and
due date briefest line first (DSQF) plot. At whatever point an
information parcel lands at the portal from the allocated

gathering of gadgets, the passage choice plans will choose if
the information ought to be transmitted to another door or
stay in the present entryway, meant as G0. Both the due date
cost (DC) and the due date most limited line first (DSQF) plans
organize meeting the information due date of the information
in the basic leadership. In any case, due date cost (DC) plot
chooses the least expensive entryway that meets the
information due date while the due date most limited line first
(DSQF) picks the quickest door that meets the information
due date as the essential portal. Conversely, due date cost
(DC) conspire picks the quickest passage while the due date
briefest line first (DSQF) appoints the least expensive portal
as the optional entryway.
What's more, we likewise look at against the traditional
voracious cost (GC) and briefest line first (SQF) plans, with the
objective of having execution like most brief line first (SQF)
and information transmission cost like ravenous cost (GC).
Most limited line first plan (SQF) picks the entryway with the
briefest postponement for each pending information
transmission. Conversely, eager cost conspire (GC) picks the
entryway with the most minimal cost-to-quantity proportion
for each pending information transmission.
The rule of the paper is to assemble the information in view of
their information due date and to perform information
pressure just before sending them to the cloud. Since there is
a more noteworthy pressure proportion when there are more
information being compacted together, the plan intends to
augment the quantity of information in each line, gave that
none of the information in the line will have its due date
disregarded before the transmission of the considerable
number of information in that line is finished. On the off
chance that it is difficult to discover a line to meet its
information due date, at that point the system inactivity and
the transmission cost for every door will be the central
variables for the passage determination. Another line will be
brought forth at the chose passage. Every one of the
information in the line will be packed before transmitted.
5. TEST SETUP
We might want to assess the execution and cost of these doors
by applying due date cost (DC) and due date most brief line
first (DSQF) plans and contrast and covetous cost (GC) and
briefest line first (SQF) plans. The execution will be estimated
utilizing the level of information due date met. Other than the
insatiable cost (GC) and most brief line first (SQF) plans, we
additionally run the reenactment with no portal choice plan,
named coordinate exchange plot, to assess the degree of focal
points of utilizing our proposed plans. We expect that the
correspondence among entryways is circulated and that
passages can simply get data on different portals by message
spread and settle on ideal choices in view of the status of
every door. We additionally accept that every datum thing is
resolute and should be transferred effectively before its due
date terminates. We utilize Java reproductions to assess our
door determination plans. We rehash the reenactment with a
similar arrangement of information for various door
determination plans to think about the level of information
due date met and the aggregate information exchange cost.
Every one of the 3 portals in the reproduction gets
information from 10 gadgets, every one of which produces
information at a rate of 1 s-1 under Poisson appropriation.
Every gadget creates information which, after pressure,
needs to mean size 50kb and standard deviation 30kb under
the ordinary appropriation.
Consequently, the aggregate information size to be
transmitted from the 10 gadgets is 500 kb/s or 0.5 Mbps.
The recreation is kept running for 1,000,000 information
bundles, which is proportional to the transmission of 6GB of
compacted information.
We expect that the information needs to defer resistance
with the mean of 5 seconds and a standard deviation of 2.5
seconds under an ordinary conveyance. What's more, we
accept that the information transmission speed among the
portals in the remote work organize, SpeedG, is 50 Mbps,
which is around a hundred times speedier than the Internet
speed that we use for our recreation. Every datum is
compacted at its allocated door before being exchanged to
different passages or to the cloud straightforwardly.
To test our plans, the passages in the recreation have
changed system speed and unit cost. To recreate the genuine
case situation, we allude to the accessible cell broadband
plans in India and send three diverse cell broadband plans
for three distinctive portals as appeared in Table I. Table II
records down the examination of three unique situations in
reproduction, which are the ordinary situation, somewhat
congested situation, and vigorously congested situation.
Table I: The Cellular broadband cost in Indian Rupee
and normal Internet speed for doors
Gateway Quota Cost Average Internet
Connection Speed
1 3 GB 98 0.7 Mb/s
2 3 GB 98 0.5 Mb/s
3 3 GB 89 Variable Based on
Scenario

Table II: The Comparison of the three Scenarios in
Simulation
6. ASSESMENT RESULT
To assess the exhibitions of our proposed plans, due date cost
(DC) and due date most brief line first (DSQF) plans, we
contrast them and the immediate exchange, eager cost (GC)
and briefest line first (SQF) plots as far as level of information
due date met and information transmission cost. We assess
the exhibitions of the five plans in three unique situations
with fluctuated Internet association speed.
Through simulation, as appeared in Figure 2, we found that in
the ordinary situation, when the normal Internet association
speed is higher than the normal information approaching rate,
as opposed to the immediate exchange which just meets
68.8% of the information due date, the due date cost (DC) and
due date most brief line first (DSQF) plans meet 98.9% and
99.2% of the information due date individually. To add to that,
the due date cost conspire (DC) spares the most cost by
diminishing the information transmission cost up to 5.74%.
Then again, in the somewhat congested situation when the
normal Internet association speed is equivalent to the
information approaching rate, both the due date cost (DC) and
due date most limited line first (DSQF) plans meet around
75% of information due date, which is more than twofold of
the information due date met by the immediate exchange,
joined by comparative information transmission cost.
Fig. 2 :- Percentage of data deadline met versus total cost
for 3 GB data transmission during the normal scenario
when the Internet Connection speed is higher than the
avg. data incoming rate
Fig. 3:- Percentage of data deadline met versus total cost
for 3 GB data transmission during the slightly congested
scenario when the Internet Connection speed is higher
than the avg. data incoming rate
7. CONCLUSION
In this paper, we propose and assess two portal
determination plans: due date cost (DC) and due date
briefest line first (DSQF) plans, to exchange whatever
number information inside their due date as could be
expected under the circumstances with insignificant
information transmission cost. The outcomes demonstrated
that deferring the information to the eleventh hour builds
the open door for more information to be compacted
together. The fundamental target is to use all the accessible
portals for adjusting the movement stack and alleviate
198
149
192 196 193
68.8
0.04
99.1 98.9 99.2
0
20
40
60
80
100
120
0
50
100
150
200
250
Direct
Transfer
Greedy
Cost
Shortest
Queue
First
Deadline
Cost
Deadline
Shortest
Queue
First
Total Cost for 6 GB Compressed Data Transmission (₹)
Percentage of Data Deadline Met (%)
0
10
20
30
40
50
60
70
80
0
50
100
150
200
250
Direct
Transfer
Greedy
Cost
Shortest
Queue
First
Deadline
Cost
Deadline
Shortest
Queue
First
Total Cost for 6 GB Compressed Data Transmission (₹)
Percentage of Data Deadline Met (%)
Scenario Data Incoming
Rate from all the
sensors to
Gateways
Data outgoing
rate from
gateways to the
cloud
Normal
Scenario
1.2 Mb/s 0.7+0.5+0.4 = 1.6
Mb/s
Slightly
Congested
Scenario
1.2 Mb/s 0.7+0.5+0.6 = 1.8
Mb/s
Heavily
Congested
Scenario
1.2 Mb/s 0.7+0.5+0.3 = 1.5
Mb/s

blockage at just some doors. We reason that both our
proposed plans accomplish higher information due date
satisfaction and cost decrease, with the due date cost conspire
somewhat superior to the due date most limited line first
plan. Notwithstanding, we might want to investigate more
portal determination plans to convey additionally cost
decrease to information transmission process in our future
work and chipping away at a bigger scale reenactment.
REFERENCES
[1] C. Perera, C. H. Liu, S. Jayawardena, M. Chen, "A Survey on
Internet of Things from Industrial Market Perspective", IEEE
Access, vol. 2, pp. 1660-1679, 2015.
[2] M. Bassoli, V. Bianchi, I. De Munari, P. Ciampolini, "An
IoT Approach for an AAL Wi-Fi-Based Monitoring
System", IEEE Trans. Instrum. Meas., vol. 66, no. 12, pp. 3200-
3209, 2017.
[3] G. Mois, S. Folea, T. Sanislav, "Analysis of Three IoT-
Based Wireless Sensors for Environmental Monitoring",
IEEE Trans. Instrum. Meas., vol. 66, no. 8, pp. 2056-2064,
2017.
[4] G. Mois, T. Sanislav, S. C. Folea, "A Cyber-Physical System
for Environmental Monitoring", IEEE Trans. Instrum. Meas.,
vol. 65, no. 6, pp. 1463-1471, 2016.
[5] B. Das, A. K. Roy, A. K. Khan, S. Roy, "Gateway-Level Load
Balancing Techniques for WMN: A Comparative
Study", Communication Systems and Network Technologies
(CSNT), pp. 193-197, 2014.
[6] D. Nandiraju, L. Santhanam, N. Nandiraju, D. P. Agrawal,
"Achieving load balancing in wireless mesh networks through
multiple gateways", Mobile Adhoc and Sensor Systems (MASS)
2006 IEEE International Conference, pp. 807-812, 2006.
[7] M. Kashanaki, Z. Beheshti, M. R. Meybodi, "A distributed
learning automata based gateway load balancing algorithm in
Wireless Mesh Networks", Instrumentation & Measurement
Sensor Network and Automation (IMSNA) 2012 International
Symposium, vol. 1, pp. 90-94, 2012.
[8] Y. Xu, W. Wang, "Wireless Mesh Network in Smart Grid:
Modeling and Analysis for Time Critical
Communications", IEEE Trans. Wirel. Commun., vol. 12, no. 7,
pp. 3360-3371, Jul. 2013.
[9] A. Papageorgiou, B. Cheng, E. Kovacs, "Real-time data
reduction at the network edge of Internet-of-Things
systems", Network and Service Management (CNSM) 2015
11th International Conference, pp. 284-291, 2015.

IRJET- Cost Effective Scheme for Delay Tolerant Data Transmission

Recommended

Recommended

More Related Content

What's hot

What's hot (19)

Similar to IRJET- Cost Effective Scheme for Delay Tolerant Data Transmission

Similar to IRJET- Cost Effective Scheme for Delay Tolerant Data Transmission (20)

More from IRJET Journal

More from IRJET Journal (20)

Recently uploaded

Recently uploaded (20)

IRJET- Cost Effective Scheme for Delay Tolerant Data Transmission