Superimposed code based channel assignment in multi-radio multi-channel wireless mesh networks

Xing, Kai; Cheng, Xiuzhen; Ma, Liran; Liang, Qilian

doi:10.1145/1287853.1287857

Cited by 88 publications

(72 citation statements)

References 33 publications

(31 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In their approach, each sensor computes a fingerprint by incorporating the neighborhood information through a superimposed sdisjunct code (Xing et al, 2007). Each node stores the fingerprint of all neighbors.…”

Section: Methodsmentioning

confidence: 99%

Pro-Active Prevention of Clone Node Attacks in Wireless Sensor Networks

Anandkumar¹,

Jayakumar²

2012

Journal of Computer Science

View full text Add to dashboard Cite

Problem statement: Wireless mobile sensor networks are deploying large, self-organized and adaptable sets of sensors for many applications such as military, environmental, health care, remote monitoring and other applications. Unfortunately, the simplicity and low-cost of these sensors make eases cloning of compromised nodes by attackers in the network. Due to the unattended nature of wireless sensor networks, an adversary can capture and compromise sensor nodes, make replicas of them and then mount a variety of attacks with these clones. This cloning attack is the entry point for a large span of creepy attacks. In such attack, an adversary uses the credentials of a compromised node to introduce the replicas secretly into the network. These replicas are then used to launch a variety of attacks that challenge the sensor applications. Therefore the detection of node replication or called clone attacks in a wireless sensor network is a fundamental problem. Approach: These clone node attacks are highly dangerous because they allow the attacker to compromise a few nodes to exert control over much of the network. Several clone node detection schemes have been proposed in the literature to defend against such attacks in static sensor networks. A few distributed solutions to address this fundamental problem have been recently proposed. However, these solutions are not satisfactory in Pro-active context. First, they are energy and memory demanding: A serious drawback for any protocol to be used in the WSN-resource-constrained environment. Further, they are vulnerable to the specific adversary models introduced in this study. To overcome the above problems we propose the improved version of Randomized, Efficient and Distributed protocol named SRED-Secure, Randomized and Efficient and Distributed protocol. We show that our emergent algorithms represent a promising new approach to sensor network security by improving its trust aspects with the witness node. Results: The result of the experiments shows that not only the improvement levels of security aspects but also shows that the considerable amount of improvements in memory and time overheads. Conclusion: This method improves the security aspect of wireless sensor networks mainly in unattended environment and improves the real time data acquisition systems in future era.

show abstract

Section: Methodsmentioning

confidence: 99%

Pro-Active Prevention of Clone Node Attacks in Wireless Sensor Networks

Anandkumar¹,

Jayakumar²

2012

Journal of Computer Science

View full text Add to dashboard Cite

show abstract

“…Although we obtain the closed-form per-SU throughput equation in the correlated PU channel scenario, it is not straightforward to see how channel correlation affects per-SU throughput and N Ã by (34). We will numerically study the impacts of PU channel correlation in Section 6.…”

Section: Optimal Bandwidth Allocation With Pu Channel Correlationmentioning

confidence: 99%

Efficient and Fair Bandwidth Allocation in Multichannel Cognitive Radio Networks

Jung

Liu

2012

IEEE Trans. on Mobile Comput.

View full text Add to dashboard Cite

Abstract-Cognitive radio (CR) improves spectrum efficiency by allowing secondary users (SUs) to dynamically exploit the idle spectrum owned by primary users (PUs). This paper studies optimal bandwidth allocation of SUs for throughput efficiency. Consider the following tradeoff: an SU increases its instantaneous throughput by accessing more spectrum, but channel access/switching overhead, contention among multiple SUs, and dynamic PU activity create higher liability for larger bandwidths. So how much is too much? In this paper, we study the optimal bandwidth allocation for multiple SUs. Our approach is twofold. We first study the optimal bandwidth an SU should use to maximize the per-SU throughput in the long term. The optimal bandwidth is derived in the context of dynamic PU activity, where we consider both independent and correlated PU channel scenarios while accounting for the effects of channel switching overhead. We further consider the case of suboptimal spectrum use by SUs in the short term due to PU activity dynamics. We propose an efficient channel reconfiguration (CREC) scheme to improve SUs' performance. We use real PU channel activity traces in the simulations to validate our results. The work sheds light on the design of spectrum sharing protocols in cognitive radio networks.

show abstract

“…One of the drawbacks of these approaches is that, the CA is difficult to fault tolerance. In [1,22,23] the researchers have benefited from the properties of the Peer-oriented approach in the process of CA. The benefit is the capability of adapting to various kinds of traffic patterns, making it applicable for most of the current WMNs, where the peer-to-peer traffic is also a major part of the total network traffic.…”

Section: Peer-oriented Approachesmentioning

confidence: 99%

State of The Art, Channel Assignment Multi-Radio Multi-Channel in Wireless Mesh Network

Alzubir¹,

Bakar²,

Yousif³

et al. 2012

IJCA

View full text Add to dashboard Cite

The emergence of new-generation networking technologies and the wide-spread use of computers and wireless devices are providing opportunities for a new generation of powerful network systems. Recently, many researchers proposed several channel assignment (CA) algorithms in multi-radio multi-channel assignment (MR-MCA) wireless mesh networks (WMNs) to utilize available channels set in the network topology architecture. One of the key challenges faces MR-MCA is how to reduce the interferences to ensure the maximum throughput by improving the aggregate network capacity. There are several studies that have classified these CA algorithms into several approaches. The aim of this paper is to discuss the current channel assignment approaches in MR-MCA in wireless mesh networks and highlighting the state of the art for MR-MCA, which can help researchers and developers in the field of WMNs.

show abstract

Superimposed code based channel assignment in multi-radio multi-channel wireless mesh networks

Cited by 88 publications

References 33 publications

Pro-Active Prevention of Clone Node Attacks in Wireless Sensor Networks

Pro-Active Prevention of Clone Node Attacks in Wireless Sensor Networks

Efficient and Fair Bandwidth Allocation in Multichannel Cognitive Radio Networks

State of The Art, Channel Assignment Multi-Radio Multi-Channel in Wireless Mesh Network

Contact Info

Product

Resources

About