International Journal of Ethics in Engineering & Management Education
Website: www.ijeee.in (ISSN: 2348
An Implementation of Algorithm Based on Backpressure in Wireless
Dept of CSE, Vaageswari College Of Engineering
Hyderabad -Karimnagar Highway, Beside LMD Police Station, Ramakrishna Colony, Karimnagar,
Abstract: - In the remote systems, the steering procedure is the one of the significant concern and it is the basic procedure in the impromptu systems. To help this effort, we proposed a test appraisal of backpressure components for remote systems. By this proposed framework, we will address many planning and directing issues and furthermore enhance the throughput and postpone that are essentially caused by the parcels at the hub transmission. The Back weight steering is a conservative and expanded throughput for remote systems, however experiences expanded postponements. In directing, the backpressure calculation is known to bear the cost of throughput optimality with dynamic activity. The vital suspicion in the backpressure calculation is that all hubs are big-hearted and watch the calculation rules driving the data trade and essential advancement prerequisites. In the proposed framework, we exhibit that how the hub is balance out at the backpressure calculation steering and furthermore by together mitigating the virtual trust line and the genuine bundle line. The backpressure calculation achieves adaptability, as well as endures the through put execution under security assaults. This framework is primarily upgrades the hub conduct at the season of correspondence and furthermore it enhances the hub security at the season of numerous dangers in the remote applications.
Keywords: -Backpressure Algorithm, through put dynamic traffic, node transmission
I. INTRODUCTION
Remote impromptu systems need stationary foundation e.g., base stations. Because of this, the correspondence between any two hubs that are out of each other's transmission go is achieved through middle person hubs. These center hubs hand-off messages to set up a correspondence channel. Present day uses of the specially appointed systems comprise of combat zones, calamity discharge, and precision in cultivating, e-wellbeing, and sea seeing with submerged remote sensor systems. In this sort of systems, Packet communicate booking is a fundamental worry as it is specifically identified with the accomplishment of a Quality of Service and a least utilization of framework belonging. It is regularly stately as far as the normal parcel delay, transmission rate and outrageous deferral, and the central framework source to be spared is the hubs' vitality keeping in mind the end goal to broaden arrange age.
Other than deferral and vitality advancement, any bundle directing calculation for impromptu systems must be hearty topology varieties and endeavor for throughput. Because of the in adequacy of remote data transmission assets, it is
Ethics in Engineering & Management Education
(ISSN: 2348-4748, Volume 4, Issue 10, October 201
An Implementation of Algorithm Based on Backpressure in Wireless - Network
MOHAMMAD SIRAJUDDIN Assistance Professor
Dept of CSE, Vaageswari College Of Engineering
Karimnagar Highway, Beside LMD Police Station, Ramakrishna Colony, Karimnagar, [email protected]
In the remote systems, the steering procedure is the one of the significant concern and it is the basic procedure in the impromptu systems. To help this effort, we proposed a test of backpressure components for remote systems. By this proposed framework, we will address many planning and directing issues and furthermore enhance the throughput and postpone that are essentially caused by the parcels at the hub weight steering is a conservative and expanded throughput for remote systems, however experiences expanded postponements. In directing, the backpressure calculation is known to bear the cost of throughput optimality on in the backpressure hearted and watch the calculation rules driving the data trade and essential advancement prerequisites. In the proposed framework, we exhibit that how the hub is balance out at the backpressure lculation steering and furthermore by together mitigating the virtual trust line and the genuine bundle line. The backpressure calculation achieves adaptability, as well as endures the through put execution under security assaults. This framework is ily upgrades the hub conduct at the season of correspondence and furthermore it enhances the hub security at the season of numerous dangers in the remote applications.
put optimality,
Remote impromptu systems need stationary foundation e.g., base stations. Because of this, the correspondence between any two hubs that are out of each other's transmission go is achieved through middle person hubs. These center hubs t up a correspondence channel. Present day uses of the specially appointed systems comprise of combat zones, calamity discharge, and precision in cultivating, wellbeing, and sea seeing with submerged remote sensor communicate booking is a fundamental worry as it is specifically identified with the accomplishment of a Quality of Service and a least utilization of framework belonging. It is regularly stately as far as the trageous deferral, and the central framework source to be spared is the hubs' vitality keeping in mind the end goal to broaden arrange age.
Other than deferral and vitality advancement, any bundle directing calculation for impromptu systems must be hearty to topology varieties and endeavor for throughput. Because of the in adequacy of remote data transmission assets, it is
imperative to capably utilize asset to keep up high throughput, brilliant correspondences over remote systems. In this setting, not too bad steering and arranging calculations are required to energetically dole out remote assets to debilitate the conceivable outcomes the system throughput segment. To report this throughput-ideal directing and arranging has been expansively considered. However these calculations misuse the system throughput district, additionally issues should be pondered for down to earth plan.
By methods for the generous increment of continuous activity, end-to-end defer ends up being extremely huge in organize calculation plot. The standard back-
the system by controlling every single conceivable way between source– goal sets. While this may be required in an extremely stacked system, this seems unreasonable in a light or sensible load framework. Finding all ways is in certainty hurtful; it prompts parcels arranging unnecessarily long ways amongst sources and goals, prompting huge end
delays. Backpressure calculations have quite recently settled much thought for commonly directing and
remote systems. This undertaking presents a directing/booking back-weight calculation that ensures arrange strength (throughput optimality), as well as adaptively chooses an arrangement of ideal courses in light of briefest way actualities to reduce normal way lengths between every hub.
Fig.1: Example of a Wireless ad hoc network topology with six nodes
The execution of backpressure devalues in circumstances of low, and direct in the system, i.e., this calculation reduces the framework utilizing every conceivable way everywhere throughout the system. The unfriendly impact of this calculation is to raise postpone and furthermore to build the vitality utilization of the hubs. This is a direct result of End to end defer and vitality utilization is steady. The minimization of the normal time that the parcels remain in the framework
Ethics in Engineering & Management Education
2017)
An Implementation of Algorithm Based on Network
Karimnagar Highway, Beside LMD Police Station, Ramakrishna Colony, Karimnagar, Telangana 505481
imperative to capably utilize asset to keep up high throughput, brilliant correspondences over remote systems. In this setting, bad steering and arranging calculations are required to energetically dole out remote assets to debilitate the conceivable outcomes the system throughput segment. To ideal directing and arranging has been ver these calculations misuse the system throughput district, additionally issues should be
By methods for the generous increment of continuous activity, end defer ends up being extremely huge in organize -weight calculation eases the system by controlling every single conceivable way goal sets. While this may be required in an extremely stacked system, this seems unreasonable in a light Finding all ways is in certainty hurtful; it prompts parcels arranging unnecessarily long ways amongst sources and goals, prompting huge end-to-end bundle delays. Backpressure calculations have quite recently settled much thought for commonly directing and planning over remote systems. This undertaking presents a directing/booking weight calculation that ensures arrange strength (throughput optimality), as well as adaptively chooses an arrangement of ideal courses in light of briefest way actualities
o reduce normal way lengths between every hub.
Fig.1: Example of a Wireless ad hoc network topology with six nodes
The execution of backpressure devalues in circumstances of low, and direct in the system, i.e., this calculation reduces the lizing every conceivable way everywhere throughout the system. The unfriendly impact of this calculation is to raise postpone and furthermore to build the vitality utilization of the hubs. This is a direct result of End to n is steady. The minimization of the normal time that the parcels remain in the framework
International Journal of Ethics in Engineering & Management Education
Website: www.ijeee.in (ISSN: 2348 proposes abatement in the normal number of jumps that the packs go until the point when they impact their goal, which thusly recommends a reduction in the aggregate v utilization.
II. BACK PRESSURE ROUTING
Backpressure steering indicates to a calculation for directing movement over a multi-bounce organize by utilizing sticking evaluations. This calculation can be connected to remote systems, containing sensor systems, portable specially appointed systems, and different systems with remote and wire line constituents. Backpressure procedures can likewise be connected to different parts, for example, to the investigation of item affiliation frameworks and treating
proposed framework focuses on correspondence systems, where bundles from different information deluges reach and should be dispersed to appropriate goals. The backpressure calculation actuates in found time, and each space it seeks after to course information in charges that boost the refinement accumulation between neighboring hubs. In center, the backpressure calculation sorts out transmissions and adventures the measure of aggregate information conveyance by acclimating booking and steering appraisals in light of every hub's per-stream line bottlenecks and channel rates when spread to remote systems. To this end, it trusts that all hubs take after the calculation tenets of data trade, perfect connection incitement, and stream combination. B
and by, a hub may deliberately bother any govern to break the key proof expected by the backpressure calculation.
Independent of its childish or pernicious assurance, there are two fundamental courses for an assailant to tail: it can distort any data utilized as a part of the backpressure calculation and it can hinder backpressure calculation based conventions by contributing no participation as well as not coming about choices in directing and arranging enhancement. These conceivable assaults represent a noteworthy obstacle to genuine sending of the backpressure calculation in genuine frameworks.
Fig.2. An example of backpressure algorithm
The above figure demonstrates the working principle of backpressure algorithm. In this setup, Nodes A, B, C, and D form a three hop wireless network with two flows. Each node has the same transmission rate and cannot transmit and receive at the same time slot. At a specified time slot, the backlog of each node for each flow is demonstrated in Fig. 1 backpressure algorithm works as follows.
Ethics in Engineering & Management Education
(ISSN: 2348-4748, Volume 4, Issue 10, October 201 proposes abatement in the normal number of jumps that the
packs go until the point when they impact their goal, which thusly recommends a reduction in the aggregate vitality
BACK PRESSURE ROUTING
Backpressure steering indicates to a calculation for directing bounce organize by utilizing sticking evaluations. This calculation can be connected to remote systems, portable specially appointed systems, and different systems with remote and wire line constituents. Backpressure procedures can likewise be connected to different parts, for example, to the investigation systems. This proposed framework focuses on correspondence systems, where bundles from different information deluges reach and should be dispersed to appropriate goals. The backpressure calculation actuates in found time, and each space it seeks course information in charges that boost the refinement accumulation between neighboring hubs. In center, the backpressure calculation sorts out transmissions and adventures the measure of aggregate information conveyance g appraisals in light of stream line bottlenecks and channel rates when spread to remote systems. To this end, it trusts that all hubs take after the calculation tenets of data trade, perfect connection incitement, and stream combination. By the by, by and by, a hub may deliberately bother any govern to break the key proof expected by the backpressure calculation.
Independent of its childish or pernicious assurance, there are two fundamental courses for an assailant to tail: it can distort ny data utilized as a part of the backpressure calculation and it can hinder backpressure calculation based conventions by contributing no participation as well as not coming about choices in directing and arranging enhancement. These represent a noteworthy obstacle to genuine sending of the backpressure calculation in genuine
backpressure algorithm
The above figure demonstrates the working principle of odes A, B, C, and D form a three hop wireless network with two flows. Each node has the same transmission rate and cannot transmit and receive time slot, the backlog of in Fig. 1. The
i) Compute the maximum differential queue backlog between each node pair as a link weight; i.e., A for flow 1, C→B is 3 for flow 1, and D flow 2, and select these three links.
ii) List all non-conflicting link sets, i.e., 1, D→C for flow 2} and {C→
iii) Choose the set that maximizes the sum of all link weights, i.e., {A→B for flow 1, D
III. PROPOSED SYSTEM
3.1. Backpressure Algorithm
The backpressure algorithm is the necessitates central organization. In reality controller will gather information from all nodes then planning decision. There also happen
speeded solutions with performance near to The backpressure algorithm creates decisions based on
Where,
u , (t) ϵ u (t) is the link rate from node
u (t) is a feasible rate vector in the set of all feasible vectors
R (t) in the network
Wi,j(t) is the maximum differential queue backlog
Fig.2. Information exchange and transmission scheduling in the backpressure algorithm
The fig.2 shows the generic operational backpressure algorithm at the starting
send information to the director for central The information contains queue bottlenecks differential queue backlog wi,j(t) in (2) and information created on network dimensions
best channel rate ui,j(t) from any node i to node j in (1).
Formerly, planned transmissions arise slot. The security solution is mainly comprehensive optimization such as it compacted or global information, but
information. Consequently, it can be readily disseminated varieties that rely on exchange of local only. The backpressure algorithm is throughput disappoints communicating to blocked
possible paths between source and destination. This asset leads
Ethics in Engineering & Management Education
2017)
maximum differential queue backlog between each node pair as a link weight; i.e., A→B is 5 B is 3 for flow 1, and D→C is 2 for flow 2, and select these three links.
conflicting link sets, i.e., {A→B for flow B for flow 1}.
the set that maximizes the sum of all link B for flow 1, D→C for flow 2}.
PROPOSED SYSTEM
The backpressure algorithm is the ideal solution that In reality, a integrated information from all nodes then sort the happen low-complexity, near to the best solution.
routing and scheduling
---(1)
---(2) the link rate from node i to j
t) is a feasible rate vector in the set of all feasible rate
differential queue backlog.
Fig.2. Information exchange and transmission scheduling in the backpressure
operational model for the starting of each time slot; nodes for centralized coordination.
bottlenecks for computing the differential queue backlog wi,j(t) in (2) and network state dimensions for attaining the best channel rate ui,j(t) from any node i to node j in (1).
arise at the rest of the time is mainly based on the comprehensive optimization such as it does not need extra or global information, but familiarizes new local , it can be readily stretched to that rely on exchange of local statistics The backpressure algorithm is throughput-optimal and blocked nodes, exploiting all een source and destination. This asset leads
International Journal of Ethics in Engineering & Management Education
Website: www.ijeee.in (ISSN: 2348 to redundant end-to-end delay when the traffic load is light.
Furthermore, using extended paths in the situation moderate traffic wastes network assets.
3.2 Threats in Backpressure Algorithm
In common, the performance of an insider attacker can be categorized to one or both of the following two groups.
Information-falsification attack: this occurs during the information altercation stage at the opening of each time slot, where the aggressor purposefully sends false information to others to undesirably affect backpressure routing. As the backpressure algorithm is responsive to node queue bottlenecks and channel state information, its routing results can be suggestively affected by information-falsification attacks.
Protocol-violation attack: this occurs in the arranged transmission stage, where the aggressor does not submit backpressure routing decisions.
3.3. Security actions in Backpressure Algorithm
The Backpressure Algorithm has resilient on several attacks Such attacks can ensure at least one of two
selfish behavior: if the assailant is selfish, it is concerned own behavior gain without care for others in the malicious behavior: if the assailant is malicious, it destroy the throughput of others in the network. As backpressure algorithm needs nodes to transmission bottlenecks and network state information, one for an attacker to achieve its selfish or malevolent
misrepresent its queue backlogs or network state information.
Fig.3:Large and small backlog size broadcasting can be used to backpressure routing.
Manipulating backlogs: If the invader requires its own packets instantaneously in place of
Ethics in Engineering & Management Education
(ISSN: 2348-4748, Volume 4, Issue 10, October 201 end delay when the traffic load is light.
the situation of light or
In common, the performance of an insider attacker can be categorized to one or both of the following two groups.
falsification attack: this occurs during the tage at the opening of each time slot, where the aggressor purposefully sends false information to others to undesirably affect backpressure routing. As the backpressure algorithm is responsive to node queue bottlenecks and channel state information, its outing results can be suggestively affected by violation attack: this occurs in the arranged transmission stage, where the aggressor does not submit
in Backpressure Algorithm
The Backpressure Algorithm has resilient on several attacks.
at least one of two objectives: (i) concerned in its ers in the network ;( ii) is malicious, it intends to network. As the transmission their line state information, one operative way malevolent intent is to state information.
broadcasting can be used to disturb
invader requires sending place of receiving
packets from others, it can broadcast backlogs than actual ones. Finally its backlog information subjectively
optimization solution in the backpressure algorithm.
Counterfeit channel state information desires to gain the transmission higher channel gains than the
broadcasting false channel information is one type of information prevarication, we can
forge channel state information into protocol attacks. This is for the reason that
communicate with a demanded scheduling decision.
3.4 Virtual Trust Queue to Algorithm
The main aim is to design assessing packet arrival rates to protect algorithm. We familiarize an amplified to defend the backpressure algorithm, and then
build a widespread virtual trust queue solution to provide the safety assurance.
There are three major short comings of this
(i) if an attacker causes a very large value of Di,j(t) at time (e.g., deliberately dropping all packets) and then returns to legitimate behavior after time t, the penalty only happens and lasts during time t (i.e., there is no memory in tracking the trust), and therefore may not mitigate the total damage of the attack;
(ii) There is no systematic way to determine the value of v;
and
(iii) There is no methodical way to recognize the damage that an attacker can cause to the network To deliberate the first dispute, it is to
to record the past and keep smearing Nevertheless, the sliding window method
adjustment of window size and still cannot solve the second and third issues. The virtual trust queue mechanism is
on the explanations on other nodes, which may have the real world. Such faults may also
allegation to some benevolent nodes.
IV. FALSIFYING VIRTUAL TRUST QUEUE INFORMATION
The virtual trust queue mechanism is mainly used to coordinate node transmissions. In
queues provide attack flexibility;
announce another line of susceptibility algorithm. Specifically, nodes want to trust queue information for either
coordination at time t. Nonetheless, it is possible that an aggressor can also fake virtual trust queue information to liability a genuine node for misconduct
more attackers can conspire with each ot untraceable setting, in which one attacker is network by operating information or impious
Ethics in Engineering & Management Education
2017)
packets from others, it can broadcast counterfeit higher ones. Finally, an attacker can operate subjectively to distress the optimization solution in the backpressure algorithm.
channel state information: If the aggressor to gain the transmission chance, it can broadcast higher channel gains than the tangible ones. While l information is one type of , we can classify attacks that channel state information into protocol-violation for the reason that when an attacker cannot demanded rate, it disturbs the 3.4 Virtual Trust Queue to Secure Backpressure is to design a approach based on protect the backpressure amplified optimization method the backpressure algorithm, and then existent how to virtual trust queue solution to provide the
comings of this approach are (i) if an attacker causes a very large value of Di,j(t) at time t (e.g., deliberately dropping all packets) and then returns to legitimate behavior after time t, the penalty only happens and lasts during time t (i.e., there is no memory in tracking the trust), and therefore may not mitigate the total damage of the is no systematic way to determine the value of v;
recognize, control, or limit the damage that an attacker can cause to the network behavior.
it is to define a gliding window smearing the disadvantage.
, the sliding window method necessitates careful adjustment of window size and still cannot solve the second The virtual trust queue mechanism is centered on other nodes, which may have faults in may also make possible false
FALSIFYING VIRTUAL TRUST QUEUE INFORMATION
mechanism is mainly used to one hand, virtual trust
; in contrast, they may susceptibility in the backpressure want to broadcast extra virtual ation for either spreader central coordination at time t. Nonetheless, it is possible that an virtual trust queue information to misconduct. Or even worse, two or each other to make an , in which one attacker is offensive the impious the protocol, and
International Journal of Ethics in Engineering & Management Education
Website: www.ijeee.in (ISSN: 2348-4748, Volume 4, Issue 10, October 2017)
4 at the same time other attackers follow the schedule but send counterfeit trust queue information to protect for the attacker.
Neighbor node/
Attacker
Attacker
This node virtual Manipulating the information/
Queue is normal Violating the protocol
Fig.4. Two nodes can collude with each other.
The above figure shows the Node An is forceful the system and in the meantime, its accomplice hub B attests that hub A's virtual trust line is ordinary. These assaults can be altogether comprehended through a similar arrangement of misrepresenting virtual trust line data. Therefore, it is basic to address such assaults with an agent countermeasure. The calculation asymptotically illustrates the bounce minimization issue as, however compensates a cost of logically huge overabundances in the system. On stochastic control of remote systems practically identical tuning limitations have additionally been acquainted. Budgetary use of vitality is a shaky issue in Wireless Networks. Correspondence is the most vitality princely movement a hub finishes. Vitality important to transmit changes exponentially with transmission remove;
thusly, it is relied upon to utilize multi-jump correspondence in WSNs. A WSN's life-time generally relies upon how professionally it transmits an information bundle from its source to its goal.
For a focal backpressure application, it is anything but difficult to let the controller to pick which hubs are faking virtual line data. The anticipated trust component can likewise be utilized as a part of a totally dispersed setting. Then again, a critical issue is then who will accumulate such data and select which hubs is faking the virtual line data. A typical route is to give each neighbor to associate with each other then a chance to choose independently who is adulterating the data.
A pernicious neighbor may attempt to send or forward the fashioned data to different neighbors to influence their determination. At last, establish that the trust system is less permissive of the quantity of noxious hubs in the appropriated backpressure foundation than it is in the focal one.
V. PERFORMANCE EVALUATION
In this performance evaluation, an extensive simulation study is to estimate the performance of the intended secure backpressure algorithm in a node. The setup of the wireless network includes 50 nodes with broadcasting range 80m consistently spread over specified area. The protocol interference model is adopted. Furthermore, if a node is
receiving from a neighbor at a time slot, none of its other neighbors will be planned to transmit. We deliberate a complete set of attack situations in the models:
Black hole attacks is the attacks in which it continuously broadcast zero queue backlogs and high frequency rates to fascinate packets to be directed to them, then drop all received packets.
On-off attacks in which perform as black holes or sincere nodes during on and off periods.
Selfish nodes always challenge to empty its queues by propagating high queue backlogs to detention the transmission opportunity.
Heterogeneous attacks include all above attackers at different nodes in the same network.
In the performance evaluation, we describe the metric of throughput as the average amount of distributed data per time slot normalized by the link rate.
Fig.5: Throughput over run time for different scenarios
Fig.6: Packet drop ratio over run time for different scenarios
International Journal of Ethics in Engineering & Management Education
Website: www.ijeee.in (ISSN: 2348-4748, Volume 4, Issue 10, October 2017)
5 In reproduction process, arbitrarily select one hub in the system executing as a dark opening. Fig.5 shows the throughput in the system under the dark opening assault. At first, the system throughput ascends as run time passes. This is on the grounds that the system is coolly troubled in the underlying state. As extra bundles reach at every hub, the system throughput increments dynamically and ends up plainly steady. However, when there is an assailant, we can see more than 85% hardship of the throughput in the system.
The yield of the framework is fundamentally focuses on the enhancing productivity. In the event that an aggressor initiates outside the given acknowledgment level, which brings about a flimsy line, the assailant will be avoided from the directing choice. Fig. 6illustrates the bundle drop proportion in arrange under similar assaults. We see from the figure, the bundle drop proportion is zero without the assault. Consequently, in the proposed framework, throughput is expanded and the parcel drop proportion is diminished.
VI. CONCLUSION
In this proposed framework, we gave an effective work on the backpressure calculation at the hub level and furthermore upgrade the security of the system. Ultimately, we demonstrated exhaustive recreations to confirm the productivity of the proposed instrument. The outcomes displayed that the virtual trust line component gains the backpressure calculation in logical inconsistency of an extensive variety of assaults. Therefore, the arrangement from this proposed framework disperses a noteworthy hindrance for viable course of action of backpressure calculation for secured remote applications. Henceforth, the backpressure calculation accomplishes adaptability, as well as perseveres through the throughput execution under security assaults. This framework is by and large enhances the hub conduct at the season of correspondence and furthermore it advances the hub security at the season of numerous dangers in the remote applications.
REFERENCES
[1] Maglaras, L.A. and Katsaros, D. (2011) Layered backpressure scheduling for delay reduction in ad hoc networks. In World of Wireless, Mobile and Multimedia Networks (WoWMoM), 2011 IEEE International Symposium on a (IEEE): 1-9.
[2] Gupta, G. and Shroff, N. (2009) Delay analysis for multi-hop wireless networks. In INFOCOM 2009, IEEE: 2356-2364.
[3] A. Warrier, S. Janakiraman, S. Ha, and I. Rhee, “DiffQ: Practical differential backlog congestion control for wireless networks,” inProc.
of IEEE INFOCOM, 2009.
[4] F. Bao, I.-R. Chen, M. Chang, and J.-H Cho, “Hierarchical trust management for wireless sensor networks and its applications to trust- based routing and intrusion detection,” IEEE Trans. Network and Service Management, vol. 9, pp. 169–183, Mar. 2012.
[5] L. Georgiadis, M. J. Neely, and L. Tassiulas,“Resource allocation and cross-layer control in wireless networks,” Foundations and Trends in Networking, vol. 1, pp. 1–144, 2006.
[6] H. Seferoglu and E. Modiano, “Diff-Max: Separation of routing and scheduling in backpressure-based wireless networks,” in Proc.of IEEE INFOCOM, 2013.
[7] S. Moeller, A. Sridharan, B.Krishnamachari, and O. Gnawali Routing without routes: The backpressure collection protocolProc. 9thACM/IEEE
Intl. Conf. on Information Processing in Sensor Networks (IPSN), April 2010.
[8] L. Huang, S. Moeller, M. J. Neely, and B. Krishnamachari. LIFO- backpressure achieves near optimal utility-delay tradeoff. Proc. WiOpt, May 2011.
[9] L. Huang, S. Moeller, M. J. Neely, and B. Krishnamachari,“LIFO- backpressure achieves near optimal utility-delay tradeoff,”ACM/IEEE Trans. Networking, pp. 831–844, June 2013.
[10] L. Bui, R. Srikant, and A. L. Stolyar, “A novel architecture for delay reduction in the back-pressure scheduling algorithm,” IEEE/ACM Trans.
Netw., vol. 19, no. 6, pp. 1597–1609, Dec. 2011.
[11] M. Alresaini, M. Sathiamoorthy, B. Krishnamachari, and M. J.
Neely,“Backpressure with adaptive redundancy (BWAR),” in Proc. of IEEE INFOCOM, 2012.
[12] J. Nunez-Martinez, J. Mangues-Bafalluy, and M. Portoles-Comeras,
“Studying practical any-to-any backpressure routing inWi-Fi mesh networks from a Lyapunovoptimizationperspective,”inProc. of IEEE MASS, 2011.
[13] Bui, L., Srikant, R. and Stolyar, A. (2009) Novel architectures and algorithms for delay reduction in back- pressure scheduling and routing.
In INFOCOM 2009, IEEE (IEEE): 2936-2940.
[14] B. Radunovic, C. Gkantsidis, D. Gunawardena, and P. Key. Horizon:
Balancing TCP over multiple paths in wireless mesh network ACMMobicom, 2008.
[15] Ying, L., Srikant, R., Towsley, D. and Liu, S.(2011) Cluster-based back- pressure routing algorithm. Networking, IEEE/ACM Transactions on 19(6): 1773-1786.
[16] J.-Y. Yoo, C. Sengul, R. Merz, and J. Kim, “Experimental analysisof backpressure scheduling in IEEE 802.11 wireless meshnetworks,” in Proc. of IEEE ICC, 2011.
[17] Li, R., Eryilmaz, A. and Li, B. (2013) Throughput optimal wireless scheduling with regulated inter-servicetimes. In INFOCOM, 2013 Proceedings IEEE: 2616-2624.
[18] L. Ying, S. Shakkottai, A. Reddy, and S. Liu,“Oncombiningshortest- path and back-pressure routing over multihopwirelessnetworks,”
IEEE/ACM Trans. Networking, vol. 19, Jun 2011.
[19] S. Liu, L. Ying, and R. Srikant,“Throughput-optimal opportunistic scheduling in the presence of flow-level dynamics,” IEEE/ACMTrans.
Networking, vol. 19, Aug 2011.
[20] L. Bui, R. Srikant, and A. L. Stolyar,“Optimal resource allocation for multicast flows in multichip wireless networks,” Phil. Trans. Roy. Soc., Ser.A, vol. 366, pp. 2059–2074, 2008.
About the author
MOHAMMAD SIRAJUDDIN has currently working as an Assistant Professor in CSE department, Vaageswari college of engineering, Beside LMD Police station, Hyderabad - Karimnagar Highway Ramakrishna Colony, Karimnagar, Telangana. He completed B.Tech in Mother Theresa Institute of technology and science in 2006 and M.Tech in Royal Institute of tech and science in 2011. His research interest areas in Wireless sensor networks, he has 5yrs experience in teaching.
