International Journal of Computer Science Trends and Technology (IJCST) Volume 5 Issue 4, Jul Aug 2017

RESEARCH ARTICLE OPEN ACCESS

Optimal Scalable Dynamic Control and Selfish node
Identification of Packets in Wireless Sensor Network
K.Ravikumar [1], H.Bakyasri [2]
Assistant Professor [1], Research Scholar [2]
Department of Computer Science
Tamil University, Thanjavur 613010
Tamil Nadu India

ABSTRACT
This research examines the multiservice distribution between the sourcedestination pairs in dispersed selfish
wireless networks (SeWN), anywhere selfish relay nodes (RN) expose their self-centered behaviors, i.e., advancing
or dropping multi services. In wireless networks, the secure data announcement is needed to collect data from source
to destination. Collected data are communicated in a path containing of connected links. All existing end-to-end
routing procedures propose solutions in which each link uses a pair-wise shared key to defend data. Remaining to
the importanceof the RNs node-selfishness on the multi conveniences, a discretecontextual of the node-selfishness
organization is shaped to manage the RNs node-selfishness information (NSI) in terms of itsobtainablecapitals, the
workinginducementimplement and the quality-of-service (QoS) necessities, and the other RNs NSI in terms of their
traditional behaviors. In this framework, the RNs NSI includes the progression of node-selfishness (DeNS), the
degree of distinguishing selfishness (DeIS) and the degree of extrinsic self-centeredness (DeES).
Keywords:- End-to-End Multiservice Delivery, MANET, Node-selfishness, Extrinsic Selfishness

I. INTRODUCTION each system node may obtain the above-

In recent years, we have witnessed a radical
growth in demand for hypermedia services such as
dissimilar styles of media streams (i.e., video, voice
and data streams) and different importance classes of
one traffic brooks which are referred to as multiple
services having different quality of service (QoS)
supplies in wireless systems. Given the propagation
of smart devices in distributed intelligent networks,
each node is predictable to be brilliant with smart
autonomic functions. By instinct, the individual
network nodes would prefer to act inconsiderately
rather than altruistically in disseminated network. A
disseminated wireless system which comprises of
nodes displaying a selfish comportment is referred to
as a distributed selfish wireless network (SeWN). In
such network scenarios, the selfish behavior of
network nodes, mentioned to as node selfishness,
may damagethe networkperformance, e.g., the
network connectivity, the reliability of the designated
path and the probability of the productive End-to-End
(E2E) multiservice delivery. The node selfishness of
the network node is affected by some intrinsic and
extrinsic factors, such as its own energy and
bandwidth resources, the QoS necessities and the
employed incentive mechanisms. For improving the
network performance, the node persons need to
obtain the information on the node-selfishness of the
other nodes and to determine the relationship
between the aforementionedfactors and the node-
selfishness. In such dispersed network scenarios,
mentionedevidence, directly collected by itself and/or
indirectly conventional from its adjacent nodes.
II. RELATED WORK
2.1 Cross-Layer Resource Allocation for
Integrated Voice/Data Traffic in Wireless Cellular
Networks
In this paper, we suggest a cross-layer
design arrangement to provide QoS for voice and
data traffic in wireless cellular systems with
differentiated services (DiffServ) backbone. The
scheme syndicates the transport layer protocols and
link layer reserve allocation to both agreement the
QoS requirements in the conveyance layer and
achieve efficient resource consumption in the link
layer. Optimal resource allocation problems for voice
and data flows are expressed to guarantee pre-
specified QoS with negligible required resources. For
combined voice/data traffic in a cell, a hybrid time-
division/code-division medium access control (MAC)
arrangement is presented to achieve well-organized
multiplexing. Theoretical analysis and simulation
results demonstrate the efficiency of the proposed
cross-layer approach. Recently, the differentiated
services (DiffServ) approach has appeared as an
efficient and ascendable solution to ensure QoS in
future IP networks. As a class-based traffic
management mechanism, DiffServ does not use per-

ISSN: 2347-8578 www.ijcstjournal.org Page 60

International Journal of Computer Science Trends and Technology (IJCST) Volume 5 Issue 4, Jul Aug 2017
flow reserve reservation and per-flow gesturing in
core routers, which makes DiffServ scalable. Current
investigation on DiffServ is mainly focused on the
wireline network. The blockage of such a network is
normally assumed to be in the core system. The link
from users to the edge router is expected to have
sufficient resources. However, in a hybrid
wireless/wireline network, the above supposition
does not hold. The block for an end-to-end
application across a hybrid wireless/wireline province
is usually the link amongst the base station (BS) and
the mobile station (MS), due to the limited radio
resources and the varying physiognomies of the radio
channel. On the other hand, current medium access
control (MAC) schemes in CDMA wireless systems
usually deliver priority to voice users.
Voice traffic movements are scheduled for
communication first, while data circulation flows use
the residual system dimensions and are not
guaranteed with QoSgratification, nor are they
differentiated from each other. So far, research on
QoSprovision for data traffic is very limited.
In [5], [6], two packet-switching scheduling
schemes are planned for wireless CDMA
infrastructures. Both are based on per-packet
information, thus cumulative the scheduling burden
and system above. Furthermore, the QoS
provisioning for data traffic in these two
arrangements is limited up to the link coating, i.e.,
only physical layer QoS and link layer QoS are
considered. To the best of our information, there is no
planned solution to provide data circulation with
higher layer QoS, e.g., transmission rate guarantee
atthe transport layer, which can be a main
apprehensionfrom the users point of view. To
address the above subjects, in this paper, we propose
a cross-layer enterprise scheme for wireless cellular
networks with a DiffServ backbone to provide QoS
to MSs. The proposed scheme associations the
transport layer protocols and link layer reserve
allocation to both guarantee QoS requirements in the
transport layer and achieve efficient resource
utilization in the link layer. We consider a hybrid
wireless/wireline IP-based network for providing
hypermedia traffic to MSs, where the Internet
mainstay is DiffServ based, and the wireless subnet is
a wideband time-division/code-division multiple
access (TD/CDMA) cellular organization with
frequency division duplexing (FDD). In the code
domain, multi-code CDMA (MC-CDMA) is
considered. Here, we focus on the resource
management in the reverse link, as resource
distribution in the multiple-access reverse link is
ISSN: 2347-8578 www.ijcstjournal.org
much more complex than that in the distribution
forward link. User Datagram Protocol (UDP) is used
for voice traffic in our system, which does not use
retransmissions to guarantee reliable delivery. UDP
itself does not provide instruments to ensure timely
delivery or other QoS assurances, but relies on lower
layer services to do so. When a voice user is on talk
spurt, the UDP packets will be generated
periodically. On the other hand, Transmission
Control Protocol (TCP) can provide reliable end-to-
end transmission over unreliable IP service, which is
appropriate for the data traffic. Each transport layer
(TCP or UDP) packet is segmented into anamount of
link layer (LL) units for broadcast over the error-
prone wireless link, and then reconvened at the BS.
2.2 Correlation-Aware QoS Routing With
Differential Coding for Wireless Video Sensor
Networks
The spatial correlation of visual material
retrieved from distributed camera sensors indications
to considerable data redundancy in wireless video
radar networks, resulting in significant performance
deprivation in energy competence and quality-of-
service (QoS) fulfillment. In this paper, a correlation-
aware QoS routing algorithm (CAQR) is proposed to
efficiently deliver visual information under QoS
constraints by exploiting the correlation of pictorial
information observed by different camera sensors.
First, a correlation-aware inter-node discrepancy
coding scheme is intended to reduce the amount of
traffic in the network. Then, an association aware
load balancing arrangement is proposed to prevent
network congestion by splitting the Correlated flows
that cannot be reduced to dissimilar paths. Finally,
the correlation-aware schemes are integrated into an
optimization QoS routing framework with an
objective to minimalize energy consumption subject
to delay and dependability constraints. Simulation
results demonstrate that the proposed routing
algorithm achieves efficient delivery of visual
material under QoS constraints in wireless video
sensor networks. Many recent works have been
proposed for providing QoS support at different
layers of the communication stack, counting QoS
routing algorithms [9], QoS MAC procedures [19],
and cross-layer QoS solutions [21]. These works,
however, only try to meet QoS requirements by
properly regulating the linkage traffic, while the total
amount of data vaccinated into the network cannot be
reduced. Therefore, it is still resource-demanding to
transport large amounts of visual material in WVSNs.
To encounter this problem, cooperativehypermedia
in-network processing [2] is suggested to reduce the
traffic volume by allowing sensor nodes to filter out
Page 61
International Journal of Computer Science Trends and Technology (IJCST) Volume 5 Issue 4, Jul Aug 2017
monotonous events locally or coordinate with each
other to cumulative correlated data.
In WVSNs, correlation exists among the
observations of video instruments with touched field
of views (FoVs) [6], leading to considerable data
redundancy. It is highly desirable to remove such
joblessness to improve the presentation of WVSNs
[2]. To enhance energy efficiency, the joint
compression/aggregation and routing approach has
been studied for sensor networks that deal with scalar
data. This method can be classified into three groups
[22]: distributed source coding (DSC), routing driven
compression (RDC), and density driven routing
(CDR). DSC aims to allocate the optimum coding
rates to minimalize the total communication cost of
transporting interrelated information over shortest
paths. In RDC, sensors send data along the preferred
paths to the sink while allowing for opportunistic
combination wherever the paths overlap. In contrast,
CDR let nodes select the paths that allow for the
maximum possible combination at each hop. These
works cannot provide QoS supports such as
timeliness and reliability, and thus are not appropriate
to WVSNs. In this paper, we propose an association
aware QoS routing algorithm (CAQR) for the
efficient delivery of visual information in
WVSNs.First, based on the spatial correlation of
visual information in our previous work [6], a
correlation-aware inter-node difference coding
scheme is proposed to reduce the quantity of traffic in
the network, where difference coding is performed
between intra coded edges generated by correlated
devices. Then, a correlation-aware load balancing
scheme is proposed to prevent network congestion by
splitting the connected flows that cannot be reduced
to different paths. By mixing these association
conscious arrangements, an optimization QoS routing
framework is proposed with an objective to minimize
sensors energy ingesting under delay and
reliabilityrestraints. It is shown that by participating
the correlation-aware schemes, the proposed
algorithm can achieve dynamism efficient QoS
announcement in WVSNs.
QoS Aware Geographic Opportunistic
Routing in Wireless Sensor Networks
QoS direction-finding is a significant
investigation issue in wireless sensor networks
(WSNs), predominantly for mission-critical
monitoring and investigation systems which requires
suitable and reliable data distribution. Existing work
ISSN: 2347-8578 www.ijcstjournal.org
achievements multipath routing to assurance both
dependability and delay QoS restraints in WSNs.
However, the multipath routing method
suffers from a significant energy cost. Based on the
examination and observations of dissimilar routing
metrics in GOR, we then propose an Efficient QoS-
aware GOR(EQGOR) procedure for QoS
provisioning in WSNs. EQGOR chooses and
assembles the forwardingapplicant set in a well-
organized manner, which is appropriate for WSNs in
respect of energy efficiency, latency, and time
complexity. We comprehensively evaluate EQGOR
by likening it with the multipath routing approach
and other starting point protocols through simulation
and evaluate its time complication through
measurement on the MicaZ node. Assessment results
demonstrate the efficiency of the GOR approach for
QoS provisioning in WSNs. EQGOR significantly
improves both the end-to-end energy efficiency and
latency, and it is characterized by the low time
complexity. We argue that multipath direction-
findingapproach may not be suitable to guarantee
both reliability and delay QoS constraints in WSNs.
Correspondingly, we propose to exploit the
unprincipled routing approach for multi unnatural
QoS provisioning in WSNs. We find that current
GOR protocol cannot be directly applied for QoS
provisioning in WSNs. Therefore, we investigate the
problem of efficient GOR for multi constrained QoS
provisioning (EGQP) in WSNs, which is formulated
as a multi objective multi constraint optimization
problem. We provide awareness into the properties of
multiple direction-finding metrics in GOR. Based on
the theoretical investigation and annotations, we
propose an Efficient QoS aware GOR(EQGOR)
algorithm for QoS provisioning in WSNs. Through
wide-ranging presentation comparisons, we
demonstrate the low time complication and efficiency
of EQGOR for multi constrained QoS provisioning in
WSNs.
2.3 Hierarchical Trust Management for Wireless
Sensor Networks and its Applications to Trust-
Based Routing and Intrusion Detection
We propose a highly climbable cluster-
based ranked trust management procedure for
wireless sensor networks (WSNs) to effectively deal
with selfish or malevolent nodes. Unlike prior work,
we consider multidimensional trust qualities derived
from announcement and social networks to evaluate
the general trust of a sensor node. By means of a
novel likelihood model, we describe a heterogeneous
WSN comprising a large number of instrument nodes
with massivelydifferent social and quality of service
Page 62
International Journal of Computer Science Trends and Technology (IJCST) Volume 5 Issue 4, Jul Aug 2017
(QoS) behaviors with the objective to yield
groundtruth node status. This serves as a basis for
authenticating our protocol design by comparing
subjective trust generated as a result of protocol
implementation at runtime against objective trust
attained from actual node status. To demonstrate the
utility of our ranked trust management protocol, we
apply it to trust-based physical routing and trust-
based interruption detection. For each request, we
identify the best trust arrangement and formation to
maximize submission performance. Our results
indicate that trust-based topographical routing
approaches the ideal presentation level achievable by
flooding-based routing in communication delivery
ratio and message delay deprived of incurring
substantial message overhead. For trust-based
interruption detection, we discover that there exists
an optimum trust threshold for minimalizing false
positives and false negatives. Furthermore, trust-
based intrusion detection outdoes traditional
anomaly-based interruption detection approaches in
both the discovery probability and the false hopeful
probability.
2.4 Dynamic Trust Management for Delay
Tolerant Networks and Its Application to
Secure Routing
Delay tolerant networks (DTNs) are
considered by high end-to-end inexpression,
recurrentstrike, and opportunistic announcement over
unreliable wireless links. In this paper, we design and
authenticate a dynamic trust organization protocol for
secure routing optimization in DTN surroundings in
the presence of well-behaved, selfish and hateful
nodes. We develop a novel model-based
methodology for the analysis of our trust procedure
and validate it via extensive imitation. Moreover, we
address dynamic trust management, i.e., decisive and
applying the best working settings at runtime in reply
to dynamically changing network conditions to
minimize trust bias and to exploit the routing request
performance. We achieve a relative analysis of our
proposed routing procedure against Bayesian trust-
based and non-trust based (PROPHET and epidemic)
direction-finding protocols. The results demonstrate
that our procedure is able to deal with selfish
behaviors and is resilient in contradiction of trust-
related attacks. Additionally, our trust-based
direction-findingprocedure can effectively trade off
communicationabove and communication delay for a
significant gain in delivery ratio. Our trust based
routing procedure operating under identified best
settings outperforms Bayesian trust-based routing and
PROPHET, and approaches the ideal performance of
epidemic direction-finding in delivery ratio and
ISSN: 2347-8578 www.ijcstjournal.org
communication delay without incurring high message
or protocol conservation overhead.
2.5 Group-Based Trust Management Scheme for
Clustered Wireless Sensor Networks
In this work, we propose a new lightweight
Group based Trust Management Scheme (GTMS) for
wireless sensor networks, which employs gathering.
Our approach reduces the cost of trust evaluation.
Also, theoretical as well as imitation results show that
our scheme demands less reminiscence, energy, table
for large-scale sensor networks.
1. Trust solves the problem of providing
corresponding access control founded on judging the
quality of SNs and their services. This problematic
cannot be solved through outdated security
instruments.
2. Trust solves the problem of as long as
reliable routing paths that do not contain any
malevolent, selfish, or faulty node(s).
3. Trust makes the old-style security
services more robust and reliable by ensuring that all
the interactive nodes are trusted during
authentication, approval, or key management A
number of trust organization schemes have been
proposed for peer-to-peer networks, and ad hoc nets.
To the best of our knowledge, very few complete
trust management schemes (e.g., Reputation-based
Framework for Sensor Networks (RFSN), Agent-
based Trust and Reputation Management (ATRM),
and Parameterized and Localized trust management
Scheme have been future for sensor networks.
Although, there are some other works available in the
literature and so forth, that deliberate trust but not in
much detail. Within such complete works, only
ATRM scheme is specifically developed for the
gathered WSNs. However, this and other schemes
agonize from various limitations such as these
arrangements do not meet the resource constraint
requirements of the WSNs and, more exactly, for the
large-scale WSNs. Also, these schemes suffer from
higher cost associated with trust assessmentespecially
of distant nodes. Furthermore, prevailing schemes
have some other limitations such as dependence on
explicit routing scheme, like PLUS works on the top
of the PLUS_R routing scheme; dependence on
specific platform, like the ATRM arrangement
requires.
III. EXISTING SYSTEM
A main task in next peer group wireless
Page 63
International Journal of Computer Science Trends and Technology (IJCST) Volume 5 Issue 4, Jul Aug 2017
cellular networks is provisioning of quality of service
(QoS) over the bandwidth incomplete and error-
prone wireless link. In this paper, we propose a cross-
layer design arrangement to provide QoS for voice
and data traffic in wireless cellular systems with
differentiated services (DiffServ) backbone. The
scheme combines the transport layer protocols and
connection layer resource allocation to both
guarantee the QoS supplies in the transport layer and
attain efficient resource utilization in the link layer.
Optimal resource distribution problems for voice and
data flows areexpressed to guarantee pre-specified
QoS with negligible required resources. For mutual
voice/data traffic in a cell, a hybrid time-
division/code-division medium access control (MAC)
scheme is presented to achieve well-organized
multiplexing.
3.1 PROBLEMS IN EXISTING SYSTEM
This outline neglect the deep examination of
the node-selfishness from the standpoints of
all impact factors, i.e., the nodes available
capitals, the QoS requirements of the multi-
services and the influence of the employed
inducement mechanism
It does not provide exact security
construction for a network announcement
process.
This algorithm has less dynamismingesting.
Here we want to achieve High energy ingesting and
more energy competence,
3.2 OVERVIEW OF PROJECT
A dispersed wireless network which
comprises of nodes displaying a selfish conduct is
referred to as a dispersed selfish wireless network
(SeWN). In such systemsituations, the selfish
presentation of network protuberances, referred to as
node selfishness, may damage the net performance,
e.g., the network connectivity, the reliability of the
selected pathway and the probability of the operative
End-to-End (E2E) multiservice distribution. The
node self-centeredness of the network node is
pretentious by some inherent and extrinsic factors,
such as its own liveliness and bandwidth resources,
the QoS supplies and the employed incentive
mechanisms. For improving the systempresentation,
the node persons need to obtain the info on the node-
selfishness of the other nodes and to determine the
relationship between the above-mentioned factors
and the node-selfishness. In such dispersed network
scenarios, each network node may obtain the above-
mentioned information, directly collected by itself
and/or circuitously received from its adjacent nodes.
ISSN: 2347-8578 www.ijcstjournal.org
IV. CONCLUSION
In this paper, we have created a distributed
framework of the node-selfishness organization,
where every RN manages its NSI and other nodes
NSI and every source achieves the RNs NSI in
distributed SeWNs.In this outline, the RNs models
of intrinsic and extrinsic selfishness have been
industrialized to manage its DeIS and DeES, and the
other RNs NSI has been found in terms of the RNs
past behaviors and their optional NSI. Underneath
this dispersed framework of the node-selfishness
organization, the path selection criterion has been
intended to select the most dependable and shortest
path for the multi-service distribution. Additionally,
the optimal inducements have been adjusted by the
source for upholding the path reliability of the E2E
multi-service distribution.
REFERENCES
[1] J. Li, Q. Yang, and K. S. Kwak, Neural-
network based optimal dynamic control of
delivering packets in selfish wireless
networks,IEEECommun. Lett., Dec. 2015.
[2] J. Li, Q. Yang, K. S. Kwak, and L. Hanzo,
The connectivity of selfish wireless
networks,IEEE Access, vol. 3, pp. 2814
2827, Nov. 2015.
[3] Chen, F. Bao, M. Chang, and J. Cho,
Dynamic trust management for delay
tolerant networks and its application to
secure routing,IEEE Trans. Parallel Distrib.
May 2014.
[4] L. Cheng, J. Niu, J. Cao, S. K. Das, and Y.
Gu, QoS aware geographic opportunistic
routing in wireless sensor networks,IEEE
Trans. Parallel Distrib Jul. 2014.
[5] F. Bao, I. Chen, M. Chang, and J. Cho,
Hierarchical trust management for wireless
sensor networks and its applications to trust-
based routing and intrusion detection Jun.
2012.
[6] R. Dai, P. Wang, and I. F. Akyildiz,
Correlation-aware QoS routing with
differential coding for wireless video sensor
networks,IEEE J. Multimedia,, Oct. 2012.
[7] R. A. Shaikh, H. Jameel, B. J. dAuriol, H.
Lee, S. Lee, and Y. Song, Group-based
trust management scheme for clustered
Page 64
International Journal of Computer Science Trends and Technology (IJCST) Volume 5 Issue 4, Jul Aug 2017

wireless sensor networks,IEEE Trans. Nov. 2006.

2009.
[10] P. Kyasanur and N. F. Vaidya, Selfish
[8] H. Jiang and W. Zhuang, Cross-layer MAC layer misbehavior in wireless
resource allocation for integrated voice/data networks,IEEE Trans. Mobile Comput.,
traffic in wireless cellular networks,IEEE vol.4, no. 5, pp. 502516, Sep. 2005.
Trans. Wireless Commun.,, Feb. 2006.
[11] Y. Xiao and H. Li, Voice and video
[9] M. v. d. Schaar, Y. Andreopoulos, and Z. transmissions with global data parameter
Hu, Optimized scalable video steaming control for the IEEE 802.11e enhance
overIEEE 802.11a/e HCCA wireless distributed channel access,IEEE Trans.
networks under delay constraints, Jun. Nov. 2004.

ISSN: 2347-8578 www.ijcstjournal.org Page 65