NIS07-5: Security Vulnerabilities in Channel Assignment of Multi-Radio Multi-Channel Wireless Mesh Networks

Anjum, Naveed; Kanhere, Salil S.

doi:10.1109/glocom.2006.300

Cited by 34 publications

(40 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Recently, three new misbehavior scenarios have appeared in the literature, namely the NEPA (Network Endo-Parasite Attack), CEPA (Channel Ecto-Parasite Attack) and LORA (Low-cost Rippleeffect Attack) attacks [62]. They pose a threat to the operation of modern mesh networks, but can also be executed against DSA schemes.…”

Section: Identity Theft/multiple Identitiesmentioning

confidence: 99%

Misbehavior Scenarios in Cognitive Radio Networks

et al. 2010

View full text Add to dashboard Cite

Recent advances in the fields of Cognitive Radio and the proliferation of open spectrum access promise that spectrum-agile wireless communication will be widespread in the near future, and will bring significant flexibility and potential utility improvements for end users. With spectrum efficiency being a key objective, most relevant research focuses on smart coexistence mechanisms. However, wireless nodes may behave selfishly and should be considered as rational autonomous entities. Selfishness, pure malice or even faulty equipment can lead to behavior that does not conform to sharing protocols and etiquette. Thus, there is a need to secure spectrum sharing mechanisms against attacks in the various phases of the sharing process. Identifying these attacks and possible countermeasures is the focus of this work.

show abstract

Section: Identity Theft/multiple Identitiesmentioning

confidence: 99%

Misbehavior Scenarios in Cognitive Radio Networks

et al. 2010

View full text Add to dashboard Cite

show abstract

“…The security issue in multi-channel multi-radio WMNs has been studied in [5,9]. In [9], Naveed et al identify vulnerabilities in channel assignment algorithms and briefly suggest possible solutions.…”

Section: Related Workmentioning

confidence: 99%

“…We say that a solution only satisfying (9) and (10) is fractional since some of its components may be non-integral. The algorithm PIPAGE takes a BP and a fractional x as its input and outputs a new fractional solution x .…”

Section: Deterministic Rounding Algorithmmentioning

confidence: 99%

See 1 more Smart Citation

Optimal monitoring in multi-channel multi-radio wireless mesh networks

Shin

Bagchi

2009

Proceedings of the Tenth ACM International Symposium on Mobile Ad Hoc Networking and Computing

View full text Add to dashboard Cite

Wireless mesh networks (WMN) are finding increasing usage in city-wide deployments for providing network connectivity. Mesh routers in WMNs typically use multiple wireless channels to enhance the spatial-reuse of frequency bands, often with multiple radios per node. Due to the cooperative nature of WMNs, they are susceptible to many attacks that cannot be defeated by using traditional cryptographic mechanisms of authentication or encryption alone. A solution approach commonly used for defending against such attacks is behavior-based detection in which some nodes overhear communication in their neighborhood to determine if the behavior by a neighbor is legitimate. It has been proposed to use specialized monitoring nodes deployed strategically throughout the network for performing such detection. The problem that arises is where to deploy these monitoring nodes, how to minimize their number, and which channels to tune their radios to, such that the maximum part of the network can be covered. This problem has been solved for single channel networks by a greedy approximation algorithm since the exact solution is NP-hard. The greedy algorithm achieves the best performance, in terms of the worst case, possible among all polynomial-time algorithms provided that P = N P . In this paper, we solve the problem for multi-channel multi-radio WMNs. The intuitive extension of the greedy algorithm destroys the property of best performance. Instead, we formulate the problem as an integer linear program, solve its linear program relaxation, and then use two rounding techniques that we develop by adapting existing rounding schemes. We thereby present two approximation algorithms. The first, computationallylight algorithm, called probabilistic rounding algorithm gives an expected best performance in the worst case. The second, called deterministic rounding algorithm achieves the best worst-case performance in a deterministic manner. To evaluate how the three algorithms perform in practice, we simulate them in random networks and scale-free networks.

show abstract

“…The primary concern of any security solution for DSR should be to satisfy security standards, mainly, Integrity, Authentication, Confidentiality and non-repudiation [6], [15] and [24]. To achieve these standards, the designed security solution must safeguard against attacks possible at each layer.…”

Section: Security Challengesmentioning

confidence: 99%

DoS Attack Prevention Technique DSR Protocol based on Signal Strength

Dhatarwal¹,

Nagar²

2017

IJCA

View full text Add to dashboard Cite

Ad Hoc network is a network that is not any fixed physical structure and is established with mobile nodes using wireless connections. Ad Hoc network is highly flexible and use dynamic network topology. Thus, the efficiency of the routing protocol will affect the all network performance. Dynamic Source Routing (DSR) is one of the extensively used routing protocols for packet transfer from source to destination. It relies on maintaining most recent information, for which, each ad-hoc node maintains hop count and sequence number field. Mobile ad hoc networks carriage many types of security problems, initiated by their open systems and nature of collaborative by limited accessibility of resources.In this paper, his propose an improved version of DSR routing protocol using neighbor monitoring Scheme which prevents dos attack and accomplishes in maintaining Integrity Security Standard by following minimum hop count path. In GDSR a neighbor monitoring has been detected the routing and packet forwarding vulnerabilities for an incoming demand that helps to stabile its security and efficiency of incoming messages. GDSR DSR routing scheme is evaluated by simulation and results show that improved FPR, throughput and ETE delay can be obtained using simulator.

show abstract

NIS07-5: Security Vulnerabilities in Channel Assignment of Multi-Radio Multi-Channel Wireless Mesh Networks

Cited by 34 publications

References 6 publications

Misbehavior Scenarios in Cognitive Radio Networks

Misbehavior Scenarios in Cognitive Radio Networks

Optimal monitoring in multi-channel multi-radio wireless mesh networks

DoS Attack Prevention Technique DSR Protocol based on Signal Strength

Contact Info

Product

Resources

About