A Survey On Packet Scheduling Schema For ... - ijctjournal

International Journal of Computer Techniques -– Volume 5 Issue 5, Sep- Oct 2018

ISSN : 2394-2231 http://www.ijctjournal.org 31

A Survey On Packet Scheduling Schema For Smart Cities Using Iot Vikas Mehta

Prof. Dr. P.D. Lambhate

Savitribai Phule University of Pune,

Department of Computer Engineering

JSPM’SJSCOE, Hadapsar, Pune

[email protected]

----------------------------------------************************----------------------------------

Abstract:

The Internet of Things (IoT) for smart cities is a large integrated system that consists of sensor networks,

wireless mesh networks, mobile communications, social networks, smart transportation and intelligent

transportation. With the utilizations of Internet of Things for shrewd urban communities, the continuous

execution for countless parcels is confronting genuine test. The previous algorithms don’t consider the

impact between different nodes, so there will be some extra time when the emergency data packets are

sent to the sink node. The classical QoS approach, such as Differentiated Services (diffserv), adopts this

idea. It assigns priorities according to the type of the sensor and characteristics of the data in networks.

Base paper proposes EARS, an efficient data-emergency-aware packet scheduling scheme for smart cities.

EARS describe the packet emergency information with the packet priority and deadline. Also for the

enhancement scheme we can apply the security algorithm for sharing the data, so that data get more

secure. In this paper we also scheduling packets schema for smart cities using Internet of Things.

Keywords—Internet of Things, Quality of Service, Packet Scheduling, Differentiated Services.

----------------------------------------************************----------------------------------

I. INTRODUCTION

In recent years, the researches for data packet

scheduling are mainly divided into three types: First

Come First Serve (FCFS), Earliest Deadline First

(EDF) and Emergency Task First Rate Monotonic

(EF-RM). Here, FCFS is widely used. Previous

papers mainly concentrate on single node’s data

packet scheduling, such as the packet with the

higher priority can pre-empt the packet with the

lower priority.

These algorithms don’t consider the impact

between different nodes, so there will be some extra

time when the emergency data packets are sent to

the sink node. Thus, need an efficient packet

scheduling algorithm that can allocate network

resources rationally.

When multiple nodes send data packets to the same

destination node at the same time, they use data-

emergency aware mechanism to deliver and deal

with emergency data packet first.

To provide energy efficient communication is the

main problem with communicating devices. So

propose a novel sleep scheduling method to reduce

the delay of alarm broadcasting from any sensor

node in WSNs [5] [6].

When wants some data immediately these networks

congestion causes delay in delivery of data.

Therefore, the end-to-end delay increases and the

real-time performance of emergency packets cannot

be guaranteed. To address this problem an event-

RESEARCH ARTICLE OPEN ACCESS


ISSN : 2394-2231 http://www.ijctjournal.org Page 132

aware backpressure scheduling scheme is proposed

[1].

The big data provides large amount of data

generated through various sources to cities to obtain

valuable insights.Issue of seeing how the data given

by individuals from the social IoT must be prepared

in order to construct a dependable framework based

on the conduct of the items. The propose LOES, a

local-optimization emergency scheduling scheme

with self-recovery for multi-sink sensor networks of

smart grid [2] [3] [4].

In EARS, time slots are strictly controlled, so that

all the processing modules collaborate to manage

the data packets. The network performance can be

improved by supporting the differentiated services

to the relevant packets based on the packet

emergency information.

To evaluate extended EARS in end-to-end delay,

packet loss rate, waiting time of data packet through

simulation experiments. Meanwhile, to compares

them with previous related works and obtain a

better performance.

This trade nearby geographic data to lessen the

bounce tallies and separation between conveyed

source hubs and sink hubs. Every goal hub decides

the bundle booking grouping as per the got crisis

data. At last, the contrast LOES and first start things

out serve, staggered plan, and dynamic staggered

need parcel booking plan utilizing bundle

misfortune rate, parcel holding up time, and normal

parcel end-to-end delay as measurements

II. RELATED WORK

Internet of things (IOT) [1] is widespread use in

many fields, such as industrial control, cyber

physical systems, public safety device,

environmental monitoring, military investigation

etc. As the sale of the network is increase, number

of packets cause network congestion. When T. Qiu

want’s some data immediately this network

congestion causes delay in delivery of data.

Therefore, the end-to-end delay increases and the

real-time performance of emergency packets cannot

be guaranteed. To address this problem an event-

aware backpressure scheduling scheme is proposed.

T.Hashem[2] combines the concept of big data and

internet of things. The big data provides large

amount of data generated through various sources

to cities to obtain valuable insights, whereas IOT

allows integration of sensors, radio-frequency

identification, and Bluetooth in the real-world

environment using highly networked services.

M. Nitti [3] integrates the concept of social

networking and internet of things.Issue of seeing

how the data given by individuals from the social

IoT must be prepared to assemble a solid

framework based on the conduct of the items. In the

abstract model, more like the social situation, every

hub processes the dependability of its companions

based on its own understanding and on the feeling

of the companions in the same way as the potential

Service supplier. In the objective model, obtained

starting from the P2P scenario, the information

about each node is distributed and stored making

use of a DHT (Distributed Hash Table) structure

with the goal that any hub can make utilization of a

similar data.

With the increase in applications [4] of internet of

things, the emergency response performance for

large-scale network packets is facing serious

challenge, especially for renewable distributed

energy resources monitoring in smart grid.It is very

important to improve the real time performance of

the emergency data packets. To reduce the

overhead of the packets transmission and explore

the recovery capability for large-scale sensor

networks of smart grid, this paper proposes LOES,

a local-optimization emergency scheduling scheme

with self-recuperation for multi-sink sensor systems

of savvy matrix.

Wireless sensor networks [5] are use in wide range

of applications such as environment monitoring,

event detection etc. How to provide energy efficient

communication is the main problem with

communicating devices.As the streams in some

remote sensor system can be extensive and

unsurprising, it is conceivable to configuration

plans for sensor hubs with the goal that hubs can

wake up just when it is vital and snoozing amid

different occasions.

International Journal of Computer Techniques

ISSN : 2394-2231

P. Guo [6], they are focusing on critical event

monitoring in wireless sensor networks, in which

small number of packets need to transfer most of

the times.At the point when a basic occasion

happens, a caution message ought to be

communicated to the whole system as quickly as

time permit.They propose a novel rest planning

strategy to lessen the deferral of caution

broadcasting from any sensor hub in WSNs.

Wireless sensor networks [7] are consists of large

number of sensor nodes which has the ability to

sense the physical environment, which also

computes the obtained information and

communicates using radio interfaces. Wakeup

scheduling algorithms are proposed in this paper.

Wireless sensor nodes [8] are mainly desi

gather data, process that data and transmit it over

the network. But it should be done by using low

hardware complexity, low energy consumption,

special traffic pattern support and scalability in real

time operations. Real time scheduling of the user

data which is getting transmitted over network is

the main aim of this paper.

Wireless sensor networks are now a day’s [9],

enabling the connection between physical world

and digital world, have become an important

component of the internet of things. The application

demands the efficient and timely collection of large

amount of a data. This paper proposes efficient

scheduling algorithms to eliminate collisions.

If there is any emergency occurs or any

hazardous accidents takes place then restoring the

organization’s data is the main issue where we can

use Disaster Recovery (DR). The paper proposes

[10] a “multi-purpose” approach, which allows data

to be restored to multiple sites with multiple

methods to ensure the organization recovers a very

high percentage of data.

III. PROBLEM STATEMENT

Past papers primarily focus on single hub's

information parcel booking, for example, the

bundle with the higher need can appropriate the

bundle with the lower need.According to EARS, the

destination node is able to get emergency


2231 http://www.ijctjournal.org

[6], they are focusing on critical event

monitoring in wireless sensor networks, in which

small number of packets need to transfer most of

the times.At the point when a basic occasion

age ought to be

communicated to the whole system as quickly as

time permit.They propose a novel rest planning

strategy to lessen the deferral of caution

broadcasting from any sensor hub in WSNs.

Wireless sensor networks [7] are consists of large

sensor nodes which has the ability to

sense the physical environment, which also

computes the obtained information and

communicates using radio interfaces. Wakeup

scheduling algorithms are proposed in this paper.

Wireless sensor nodes [8] are mainly design to

gather data, process that data and transmit it over

the network. But it should be done by using low

hardware complexity, low energy consumption,

special traffic pattern support and scalability in real

time operations. Real time scheduling of the users

data which is getting transmitted over network is

Wireless sensor networks are now a day’s [9],

enabling the connection between physical world

and digital world, have become an important

he application

demands the efficient and timely collection of large

amount of a data. This paper proposes efficient

scheduling algorithms to eliminate collisions.

If there is any emergency occurs or any

hazardous accidents takes place then restoring the

rganization’s data is the main issue where we can

use Disaster Recovery (DR). The paper proposes

purpose” approach, which allows data

to be restored to multiple sites with multiple

methods to ensure the organization recovers a very

STATEMENT

Past papers primarily focus on single hub's

information parcel booking, for example, the

bundle with the higher need can appropriate the

According to EARS, the

destination node is able to get emergency

information of every packet.Considering the actual

applications of packet scheduling for smart cities,

such as fire monitoring service and medical rescue

service, this paper proposes approach

scheduling packets schema for smart cities using

Internet of Things. The destination node is able to

get emergency information of every packet. The

resource allocation in IoT for smart cities is

optimized to ensure the timeliness of emergency

packets.Not efficiently updating dynamically of

network when nodes die or new nodes are added.

Data security algorithm is not use.

IV. OBJECTIVES

The main objective isto update dynamically of


With greatly decreases the

maintains.Also can apply the security algorithm for

sharing the data, so that data get more secure

Proposes another packet planning scheme named

LOES, which first consolidates the need based

bundle booking plan with nearby enhancement.

V. SYSTEM ARCHITECTURE

Fig. 1 System Architecture

System Architecture Explanation

A. Access Control Module:-

The function of ACM is to distinguish the incoming

packets, and then process packets based on their

Oct 2018

Page 133

Considering the actual

applications of packet scheduling for smart cities,

such as fire monitoring service and medical rescue

service, this paper proposes approach for

scheduling packets schema for smart cities using

The destination node is able to

get emergency information of every packet. The

resource allocation in IoT for smart cities is

optimized to ensure the timeliness of emergency

Not efficiently updating dynamically of


Data security algorithm is not use.

OBJECTIVES

update dynamically of


greatly decreases the cost of network

can apply the security algorithm for

sharing the data, so that data get more secures.

Proposes another packet planning scheme named

LOES, which first consolidates the need based

bundle booking plan with nearby enhancement.

ARCHITECTURE

Fig. 1 System Architecture

Architecture Explanation

The function of ACM is to distinguish the incoming

packets, and then process packets based on their



types. There are three-level priority queues at each

node: Priority Queue A (PQA), Priority Queue B

(PQB) and Priority Queue C (PQC). The

emergency data packets are put into the PQA which

has the highest priority. Also with the packet

scheduling scheme named LOES, which first

combines the priority-based packet scheduling

scheme with local optimization. We exchange local

geographic information to reduce the hop counts

and distance between distributed source nodes and

sink nodes. We select the packet with the highest

emergency at the node to extract its emergency

information.

B. Emergency-Aware Module

EAM is composed of two phases: one is the

Emergency Information Forward (EIF), the other

one is Emergency Information Analysis (EIA). EIF

sends the emergency information packet received

from local node’s ACM and the sibling nodes’

ACMs to the destination node in TDMA method.

When the priorities are same, the packets deadlines

need to be compared. The packet with higher

emergency will have shorter deadline. This result is

given to the security algorithm to make the data

more secure.

C. Packet Forward Module

PFM completes the packet forwarding. The MAC-

address packet from ACM is sent to MAC-address

analysis. Every goal hub decides the bundle

booking grouping as per the got crisis data. Finally,

we compare LOES with first come first serve,

multilevel scheme, and dynamic multilevel priority

packet scheduling scheme using packet loss rate,

packet waiting time, and average packet end-to-end

delay as metrics. During the process of the

execution process of EARS, each packet needs to

check the channel flag before it is sent to the

destination node.

VI. PACKET SCHEDULING SCHEME

In addition, each of this traffic [11] classes

has a different scheduling requirement and

consequently, it has become necessary to design

appropriate hybrid scheduling frameworks.

Therefore, they propose an efficient hybrid packet

scheduling scheme for IEEE 802.16 WiMAX to

satisfy both delay and throughput guarantees for the

admitted connections. The proposed QoS booking

plan is contrasted and a current QoS planning plan

proposed in writing in later past. Uplink packet

scheduling is a more challenging task than

downlink packet scheduling as all the necessary

information of SSs such as queue size for the uplink

scheduling are not available.

M.S. Alam [12], they have investigated the secure

communication between medical sensors and PDA,

as well as ensuring QoS for the real-time traffic.

The proposed secure communication scheme can

minimize the key storage space and need less

computation. Patientprivacy is ensured by using

pseudo identity. The plan is client driven and the

safe key is shared among all sensors in a WBAN to

limit any extra memory and handling power

necessities. A priority based traffic scheduling

scheme for real-time application in WBAN is

proposed and analysed. In this work, we propose on

the secure and privacy preserving communication

including real-time traffic scheduling in WBAN.

The most important RRM task [13] is performed by

the packet scheduler who is in charge of

distributing radio resources among users in an

efficient way, taking into account both flow

requirements and physical constraints. In the first

part of the paper, we tried to guide the reader

through the understanding of the resource sharing

problem in LTE networks, starting from the basics

and then adding more and more details in order to

explain always complex aspects of the system.

Packet scheduling systems, specifically, assume a

principal job, since they are in charge of picking,

with fine time and recurrence goals, how to disperse

radio assets among various stations.

In P. Doshi et al. [14] proposes, web crawlers: their

architecture, process of semantic focused crawling

technology, ontology learning, pattern matching,

types and various challenges being faced when

search engines use the web crawlers, have been

reviewed.

N. Nasser [15], they propose a Dynamic Multilevel

Priority (DMP) packet scheduling scheme for

Wireless Sensor Networks (WSNs). The plan


ISSN : 2394-2231

utilizes three-level of need lines to plan information

bundles dependent on their sorts and needs.

Furthermore, if a real-time task holds the resources

for a longer period of time, other tasks need to wait

for an undefined period time, causing

occurrence of a deadlock. Non-constant bundles are

set into two different lines dependent on a specific

limit of their evaluated preparing time. Hubs that

have a similar jump remove from the BS are viewed

as situated at the equivalent progressive level.

VII. EMERGENCY AWARE MODULE

New challenges [16] have emerged for second

generation wireless sensor networks including:

creating knowledge from raw data, robust system

operation, dealing with openness and heterogeneity,

security, privacy, real-time, and control and

actuation. Thus, the application requires vitality

mindful plans that can expand the lifetime of the

sensor gadgets, with the goal that

accessible for the term of the mission. Emergency

aware applications demand a privacy protection

framework capable of responding adaptively to

each resident’s health condition and privacy

requirements in real-time. The significant

difficulties as remote sensor systems wind up

boundless and move into numerous other

application areas, for example, horticulture, vitality,

and transportation.

Guowei Wu [17], a fault-tolerant emergency

access control scheme called FEAC has been

presented, which provides proactive and adaptive

access control polices to address the multiple

emergencies management problem and fault

tolerance problem for CPS applications. FEAC can

meet responsiveness, correctness, security, liveness

and non-repudiation requirements. Emergencies are

prepared in arrangement inside the gathering and in

parallel among gatherings. In order to handle all the

emergencies timely, emergency-group and

emergency-role are introduced for parallelly

processing multiple emergencies. Access control i

an issue of central significance in digital physical

frameworks.

This paper [18] conducts the first work on situation

aware emergency navigation by considering a more



level of need lines to plan information

bundles dependent on their sorts and needs.

holds the resources

for a longer period of time, other tasks need to wait

for an undefined period time, causing the

constant bundles are

set into two different lines dependent on a specific

ime. Hubs that

have a similar jump remove from the BS are viewed

as situated at the equivalent progressive level.

MODULE

] have emerged for second

generation wireless sensor networks including:

w data, robust system

operation, dealing with openness and heterogeneity,

time, and control and

e application requires vitality

mindful plans that can expand the lifetime of the

sensor gadgets, with the goal that they stay

accessible for the term of the mission. Emergency-

aware applications demand a privacy protection

framework capable of responding adaptively to

each resident’s health condition and privacy

time. The significant

remote sensor systems wind up

boundless and move into numerous other

application areas, for example, horticulture, vitality,

tolerant emergency-aware

access control scheme called FEAC has been

provides proactive and adaptive

access control polices to address the multiple

emergencies management problem and fault-

tolerance problem for CPS applications. FEAC can

meet responsiveness, correctness, security, liveness

Emergencies are

prepared in arrangement inside the gathering and in

parallel among gatherings. In order to handle all the

group and

role are introduced for parallelly

processing multiple emergencies. Access control is

an issue of central significance in digital physical

] conducts the first work on situation-

aware emergency navigation by considering a more

general and practical problem, where emergencies

of different hazard levels and exits

evacuation capabilities may coexist. They are

currently devoting to conducting a small

system prototype under more complex scenarios. In

this paper, they propose SEND, a situation

emergency navigation algorithm, which takes the

hazard levels of emergencies and the evacuation

capabilities of exits into account and provides the

mobile users the safest navigation paths

accordingly. It is fully distributed and does not

require any location information. It is more robust

to emergency dynamics since the constructed

hazard potential field reflects more global

properties of the underlying connectivity

The proposed [19] research work is done on

streamlining the execution of the Search Engine.

The proposed research tests have been directed on

Shannon data gain to decide the edge estimation of

dynamic dataset.

VIII. ALGORITHMIC

A frame [20] is composed of several vide

(VP) separated by resync-

information apportioning mode, a VP might be

additionally isolated into movement and surface

fields by the movement marker. In this paper, we

utilize video bundle mode with resync

and without information parcelling mode. Presently

utilized movement surface segregation. From an

emotional perspective, the booking results in

change in video quality with less by and large

mutilation and additionally more uniformly

disseminated worldly bending.

Fig. 1 Performance Analysis

Oct 2018

Page 135

general and practical problem, where emergencies

of different hazard levels and exits with different

evacuation capabilities may coexist. They are

currently devoting to conducting a small-scale

system prototype under more complex scenarios. In

this paper, they propose SEND, a situation-aware

emergency navigation algorithm, which takes the

azard levels of emergencies and the evacuation

capabilities of exits into account and provides the

mobile users the safest navigation paths

accordingly. It is fully distributed and does not

require any location information. It is more robust

ynamics since the constructed

hazard potential field reflects more global

properties of the underlying connectivity.

research work is done on

streamlining the execution of the Search Engine.

The proposed research tests have been directed on

Shannon data gain to decide the edge estimation of

IC STRATEGY

is composed of several video packets

-markers. Utilizing

information apportioning mode, a VP might be

additionally isolated into movement and surface

fields by the movement marker. In this paper, we

utilize video bundle mode with resync-marker with

t information parcelling mode. Presently

utilized movement surface segregation. From an

emotional perspective, the booking results in

change in video quality with less by and large

mutilation and additionally more uniformly

Fig. 1 Performance Analysis


ISSN : 2394-2231

It can be observed [21] that M-LWDF and EXP/PF

algorithms outperform Max-Rate, PF and RR

algorithms in terms of system throughput.

calculation accomplishes the most minimal

framework throughput as it doesn't consider

channel conditions when settling on planning

choices. The M-LWDF algorithm outperforms

other packet scheduling algorithms by providing a

higher system throughput, supporting a higher

number of users and guaranteeing fairness at a

satisfactory level.

Fig. 2 System Throughput VS Num. of users

M-EDF-PF algorithm [22] is an extension of the

combined EDF and PF algorithms, which is both

channel-aware and QoS aware. In order to make the

algorithm more flexible to adapt to the

characteristics of different flows, tunable

parameters are introduced. The proposed M

PF is much simpler and can be implemented with

low complexity. They not consider both the uplink

and downlink directions.

Fig. 3 Total Cell spectral Efficiency



LWDF and EXP/PF

Rate, PF and RR

algorithms in terms of system throughput. The RR

calculation accomplishes the most minimal

framework throughput as it doesn't consider

channel conditions when settling on planning

LWDF algorithm outperforms

other packet scheduling algorithms by providing a

higher system throughput, supporting a higher

number of users and guaranteeing fairness at a

Fig. 2 System Throughput VS Num. of users

n extension of the

and PF algorithms, which is both

In order to make the

algorithm more flexible to adapt to the

flows, tunable

The proposed M-EDF-

PF is much simpler and can be implemented with

both the uplink

Fig. 3 Total Cell spectral Efficiency

They reviewed [23] the most important packet

scheduling algorithms such as modified PF, BET,

M-LWDF, OSA etc., for real time traffic in the

LTE-A networks. The most significant observation

from this review is that any packet scheduling

algorithm for downlink real time data

QoS aware so that it is readily deployable in the

present day multimedia networks

review will help the researchers and academicians

to develop more efficient scheduling schemes for

real time applications for smart phone users with

better quality of experience.

Fig. 4 Average Packet Delay variation

EAM is composed of two phases: one is the

Emergency Information Forward (EIF), the other

one is Emergency Information Analysis (EIA).

EARS algorithm, the way to analyze the emergency

information packets is that: the higher the priority

the higher emergency the packet will be. When the

priorities are same, the packets deadlines need to be

compared. EARS, the destination node is able

emergency information of every packet.

Fig. 5 End to end delay of all packets

Oct 2018

Page 136

the most important packet

scheduling algorithms such as modified PF, BET,

LWDF, OSA etc., for real time traffic in the

most significant observation

from this review is that any packet scheduling

algorithm for downlink real time data should be

QoS aware so that it is readily deployable in the

present day multimedia networks. The presented

review will help the researchers and academicians

to develop more efficient scheduling schemes for

real time applications for smart phone users with

Average Packet Delay variation

wo phases: one is the

Information Forward (EIF), the other

one is Emergency Information Analysis (EIA). In

EARS algorithm, the way to analyze the emergency

information packets is that: the higher the priority is

the higher emergency the packet will be. When the

priorities are same, the packets deadlines need to be

EARS, the destination node is able to get

emergency information of every packet.

of all packets



IX. CONCLUSION AND FUTURE WORK

The resource allocation in IoT for smart

cities is optimized to ensure the timeliness of

emergency packets.In their existing algorithm, the

data packets are classified into various different

types based on their priorities, which should be

defined according to application scenario before

their scheduling scheme is used. Also for the

enhancement scheme we apply the security

algorithm for sharing the data, so that data get more

secure. The propose system can update dynamically

of network when nodes die or new nodes are added

more efficiently. Also greatly decreases the cost of

network maintains. Conventional packet planning

scheme and topology improvement systems are not

reasonable for an extensive scale IoT-based brilliant

matrix. To address this problem, this paper

proposes a new packet scheduling scheme named

LOES, which first combines the priority-based

packet scheduling scheme with local optimization.

ACKNOWLEDGMENT

I profoundly grateful to Prof. Dr.P.D. Lambhatefor

her expert guidance and continuous encouragement

throughout to see that this project rights its target

since its commencement to its completion. I would

like to express my deepest appreciation towards

Dr.M.G.JadhavPrincipal, Dr. S.B. ChaudhariHOD

department of computer engineering and Prof.

Madhav IngalePG coordinator. I must express my

sincere heartfelt gratitude to all staff members of

computer engineering department who helped me

directly or indirectly during this course of work.

Finally, I would like to thank my family and

friends, for their precious support.

REFERENCES

[1] T. Qiu, R. Qiao, and D. Wu, “EABS: An event-

aware backpressure scheduling scheme for

emergency internet of things,” IEEE Trans. Mobile

Comput., doi: 10.1109/TMC.2017.2702670.

[2] I. A. T Hashemet al., “The role of big data in

smart city,” Int. J. Inf. Manage., vol. 36, no. 5, pp.

748–758, 2016.

[3] M. Nitti, R. Girau, and L. Atzori,

“Trustworthiness management in the social internet

of things,” IEEE Trans. Knowl. Data Eng., vol. 26,

no. 5, pp. 1253–1266, May 2014.

[4] T.Qiu,K. Zheng, H. Song, M. Han, and

B.Kantarci, “A local-optimization emergency

scheduling scheme with self-recovery for smart

grid,” IEEE Trans. Ind. Inf, doi:

10.1109/TII.2017.2715844.

[5] G. Lu and B. Krishnamachari, “Minimum

latency joint scheduling and routing in wireless

sensor networks,” Ad Hoc Netw., vol. 5, no. 6, pp.

832– 843, 2007.

[6] P. Guo, T. Jiang, Q. Zhang, and K. Zhang,

“Sleep scheduling for critical event monitoring in

wireless sensor networks,” IEEE Trans. Parallel

Distrib. Syst., vol. 23, no. 2, pp. 345–352, Feb.

2012.

[7] F. Yang and I. Aug´e-Blum, “Delivery ratio-

maximized wakeup scheduling for ultra-low duty-

cycled WSN under real-time constraints,”

Comput.Netw., vol. 55, no. 3, pp. 497–513, 2011.

[8] R.Gomathi and N. Mahendran, “An efficient

data packet scheduling schemes in wireless sensor

networks,” Proc. Int. Conf. Electron. Commun.

Syst., Feb. 26–27, 2015, pp. 542–547.

[9] K.-H. Phung, B. Lemmens,M. Goossens, A.

Nowe, L. Tran, and K. Steenhaut, “Schedule-based

multi-channel communication in wireless sensor

networks: A complete design and performance

evaluation,” Ad Hoc Netw.,vol. 26, pp. 88–102,

2015.

[10] V. Chang, “Towards a big data system disaster

recovery in a private cloud,” Ad Hoc Netw., vol. 35,

pp. 65–82, 2015.



[11] PrasunChowdhury and ItiSahaMisra, “A Fair

and Efficient Packet Scheduling Scheme for IEEE

802.16 Broadband Wireless Access Systems,”

September 2010.

[12] MrinmoyBarua, M.S. Alam, Xiaohui Liang

and Xuemin (Sherman) Shen, “Secure and Quality

of Service Assurance Scheduling Scheme for

WBAN with Application to eHealth,” IEEE WCNC

Network- 2011.

[13] F. Capozzi, G. Piro, L.A. Grieco, G. Boggia

and P. Camarda, “Downlink Packet Scheduling in

LTE Cellular Networks: Key Design Issues and a

Survey,” IEEE Communications Surveys &

Tutorials, 06 July 2012.

[14]Poonam P. Doshi, Emmanuel M, “Web Pattern

Mining Using Eclat”, International Journal of

Computer Applications (0975 – 8887), New

York,Vol. 179 – No.8, pp.9-14, Dec2017,

DOI:10.5120/ijca2017916009.

[15] Nidal Nasser, LutfulKarim, and TarikTaleb,

“Dynamic Multilevel Priority Packet Scheduling

Scheme for Wireless Sensor Network,” IEEE

Transactions On Wireless Communications, Vol.

12, No. 4, April 2013.

[16] John A. Stankovic, Anthony D. Wood and

Tian He, “Realistic Applications for Wireless

Sensor Networks,” Distributed Computing in

Sensor Networkspp 835-863, November 2010.

[17] Guowei Wu, Dongze Lu, Feng Xia andLin

Yao “A Fault-Tolerant Emergency-Aware Access

Control Scheme for Cyber-Physical Systems,”

Information Technology and Control, Vol.40, No.1,

pp. 29-40, 2011

[18] Chen Wang, Hongzhi Lin, Rui Zhang and

Hongbo Jiang, “SEND: A Situation-Aware

Emergency Navigation Algorithm with Sensor

Networks,” IEEE Transactions On Mobile

Computing, Jul 7, 2016.

[19] Poonam P. Doshi, Emmanuel M, “Semantic

Web Mining Using Shannon Information

Gain”, International Journal of Allied Practices,

Research and Review, Vol 5, Issue 4, pp. 01-10,

April 2018.

[20] Sang H. Kang and AvidehZakhor, “Packet

Scheduling Algorithm for Wireless Video

Streaming,”January 2002.

[21] Huda AdibahMohdRamli, RiyajBasukala,

KumbesanSandrasegaran, RachodPatachaianand,

“Performance of Well Known Packet Scheduling

Algorithms in the Downlink 3GPP LTE System,”

IEEE17 Dec. 2009.

[22] Bin Liu, HuiTian, and LinglingXu, “An

Efficient Downlink Packet Scheduling Algorithm

for Real Time Traffics in LTE Systems,”IEEE

CCNC- Wireless Communications Track, Jan. 2013

[23] S. Radhakrishnan1, S. Neduncheliyan and K.

K. Thyagharajan, “A Review of Downlink Packet

Scheduling Algorithmsfor Real Time Traffic in

LTE-Advanced Networks,” Volume 9, Issue 4,

January 2016.

A Survey On Packet Scheduling Schema For ... - ijctjournal

Documents

Transcript of A Survey On Packet Scheduling Schema For ... - ijctjournal