Minimum Cost Blocking Problem in Multi-Path Wireless Routing Protocols

Duan, Qi; Virendra, Mohit; Upadhyaya, Shambhu; Sanzgiri, Ameya

doi:10.1109/tc.2013.47

Cited by 5 publications

(7 citation statements)

References 48 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…First problem, Quality of reception occurs in Physical layer, then Network layer faces problem of Impact on routing and finally Transport layer struck due to higher power impacts congestion. Some of the global impact [8] also happens in Power Control. Such as Connectivity, which is global property and Clustering is regional based property.…”

Section: Related Workmentioning

confidence: 99%

“…The key factor related to the performance metric multi-path routing using Network coding in routing protocol and the relevant improvement in Routing protocol are described in details [13] [14] [9]. …”

Section: Fig2 Block Diagram Of the Challenges In Wsn For Performancementioning

confidence: 99%

“…In the metric, linkquality measurement is To sustain the measurement of link-quality using the RF module, an efficient metrics is to be needed for sending the packets [8]. Table 3.…”

Section: Energy Consumptionmentioning

confidence: 99%

“…The stiffness of attacks in hypothetical model, due to mobile nodes of multi-path routing protocols Resiliency against blocking and node isolation-type attacks [9] Wireless mobile ad-hoc networks based routing protocols such as Ad hoc On-Demand Distance Vector Routing (AODV) [15], Dynamic MANET On-Demand (DYMO) [16] and Optimized link State Routing (OLSR) [17], that comes in the category of specific Engineering Task Force (IETF) related to Internet. WSNs are to be used these protocols [18] which keeps similar characteristics in the context of wireless.…”

Section: Multi-path Routing Using Without Network Codingmentioning

confidence: 99%

See 3 more Smart Citations

Challenges in wireless sensor networks with different performance metrics in routing protocols

Agnihotri

Singh

Verma

2015

2015 4th International Conference on Reliability, Infocom Technologies and Optimization (ICRITO) (Trends and Future Directions)

View full text Add to dashboard Cite

The routing protocols are playing a major role in the design and proper utilization of wireless sensor networks (WSN) that overcome all the limitation of interconnection networks. The role of routing protocols is become more challenging due to the real time applications in WSNs. The long life of sensor nodes is required for efficient use routing protocols which can be possible by preserving energy. Data Centric, Hierarchical and location are the three different kinds of categories is used in the design of routing protocols which is also approaches specific. Some other challenges are spoken of as contention in which many nodes access the medium. So the clash between packets would take place in this scenario. There is no method to find out these types of the collisions in WSN. Self-interference is also one of the challenges of the sensor network which is occurred in successive hops. The problem of dynamism is in that the links failure and catch up with for several times in lesser time and qualities of links are also changed during time. There are many numbers of the parameters which handles transmission rate, transmission power, etc. The data transmission time also impacts on the energy conservation and quality-of-service (QOS) in wireless sensor network.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Fig2 Block Diagram Of the Challenges In Wsn For Performancementioning

confidence: 99%

“…In the metric, linkquality measurement is To sustain the measurement of link-quality using the RF module, an efficient metrics is to be needed for sending the packets [8]. Table 3.…”

Section: Energy Consumptionmentioning

confidence: 99%

Section: Multi-path Routing Using Without Network Codingmentioning

confidence: 99%

See 2 more Smart Citations

Challenges in wireless sensor networks with different performance metrics in routing protocols

Agnihotri

Singh

Verma

2015

2015 4th International Conference on Reliability, Infocom Technologies and Optimization (ICRITO) (Trends and Future Directions)

View full text Add to dashboard Cite

show abstract

“…The CPMC problem has recently been studied in [17] (a special case studied in [16]). It has applications in many other areas, such as emergency responding, data mining, pattern recognition, and machine learning.…”

Section: Introductionmentioning

confidence: 99%

On DDoS Attack Related Minimum Cut Problems

Duan,

Jafarian,

Al-Shaer

et al. 2014

Preprint

Self Cite

View full text Add to dashboard Cite

Distributed Denial of Service (DDoS) attack is one of the most preeminent threats in Internet. Despite considerable progress on this problem in recent years, a remaining challenge is to determine its hardness by adopting proper mathematical models. In this paper, we propose to use generalized minimum cut as basic tools to model various types of DDoS attacks. Particularly, we study two important extensions of the classical minimum cut problem, called Connectivity Preserving Minimum Cut (CPMC) and Threshold Minimum Cut (TMC), to model largescale DDoS attacks.In the CPMC problem, a minimum cut is sought to separate a source node from a destination node and meanwhile preserve the connectivity between the source and its partner node(s). The CPMC problem also has important applications in many other areas such as emergency responding, image processing, pattern recognition, and medical sciences. In the TMC problem, a minimum cut is sought to isolate a target node from a threshold number of partner nodes. TMC problem is an interesting special case of the network inhibition problem and finds applications in network security. We show that the general CPMC problem cannot be approximated within logn unless N P = P . We also show that a special case of the CPMC problem in planar graphs can be solved in polynomial time. The corollary of this result is that the network diversion problem in planar graphs is in P ; this settles a previously open problem. For the TMC problem, we show that the threshold minimum node cut (TMNC) problem can be approximated within a ratio of O( √ n) and the threshold minimum edge cut (TMEC) problem can be approximated within a ratio of O(log 2 n). As a consequence, we show that the related network inhibition problem and network interdiction problem cannot be approximated within any constant ratio unless N P ∩ δ>0 BP T IM E(2 n δ ). This settles another long standing open problem.

show abstract

Qualitative Survey on Sensor Node Deployment, Load Balancing and Energy Utilization in Sensor Network

Panja

Ghosh

2020

Nature Inspired Computing for Wireless Sensor Networks

View full text Add to dashboard Cite

Minimum Cost Blocking Problem in Multi-Path Wireless Routing Protocols

Cited by 5 publications

References 48 publications

Challenges in wireless sensor networks with different performance metrics in routing protocols

Challenges in wireless sensor networks with different performance metrics in routing protocols

On DDoS Attack Related Minimum Cut Problems

Qualitative Survey on Sensor Node Deployment, Load Balancing and Energy Utilization in Sensor Network

Contact Info

Product

Resources

About