5,305 research outputs found

    AN ENHANCED LID ROUTING SECURITY SCHEME FOR MOBILE AD-HOC NETWORKS

    Get PDF
    In this work we present novel security architecture for MANETs that merges the clustering and the threshold key management techniques. The proposed distributed authentication architecture reacts with the frequently changing topology of the network and enhances the process of assigning the node's public key. In the proposed architecture, the overall network is divided into clusters where the cluster heads (CH) are connected by virtual networks and share the private key of the Central Authority (CA) using Lagrange interpolation. Experimental results show that the proposed architecture reaches to almost 95.5% of all nodes within an ad-hoc network that are able to communicate securely, 9 times faster than other architectures, to attain the same results. Moreover, the solution is fully decentralized to operate in a large-scale mobile network. We also proposing a special security routing architecture called Local Intrusion Detection (LID) to detect Black Hole Attack (BHA) over Ad hoc On Demand Distance Vector (AODV) MANET routing protocol. In LID security routing mechanism, the intrusion detection is performed locally using the previous node of the attacker node instead of performing the intrusion detection via the source node as in Source Intrusion Detection (SID) security routing mechanism. By performing LID security routing mechanism, the security mechanism overhead would be decreased

    On the Impact of Wireless Jamming on the Distributed Secondary Microgrid Control

    Full text link
    The secondary control in direct current microgrids (MGs) is used to restore the voltage deviations caused by the primary droop control, where the latter is implemented locally in each distributed generator and reacts to load variations. Numerous recent works propose to implement the secondary control in a distributed fashion, relying on a communication system to achieve consensus among MG units. This paper shows that, if the system is not designed to cope with adversary communication impairments, then a malicious attacker can apply a simple jamming of a few units of the MG and thus compromise the secondary MG control. Compared to other denial-of-service attacks that are oriented against the tertiary control, such as economic dispatch, the attack on the secondary control presented here can be more severe, as it disrupts the basic functionality of the MG

    Network coding-based survivability techniques for multi-hop wireless networks

    Get PDF
    Multi-hop Wireless Networks (MWN) have drawn a lot of attention in the last decade, and will continue to be a hot and active research area in the future also. MWNs are attractive because they require much less effort to install and operate (compared to wired networks), and provide the network users with the flexibility and convenience they need. However, with these advantages comes a lot of challenges. In this work, we focus on one important challenge, namely, network survivability or the network ability to sustain failures and recover from service interruption in a timely manner. Survivability mechanisms can be divided into two main categories; Protection and restoration mechanisms. Protection is usually favored over restoration because it usually provides faster recovery. However, the problem with traditional protection schemes is that they are very demanding and consume a lot of network resources. Actually, at least 50% of the used resources in a communication session are wasted in order to provide the destination with redundant information, which can be made use of only when a network failure or information loss occurs. To overcome this problem and to make protection more feasible, we need to reduce the used network resources to provide proactive protection without compromising the recovery speed. To achieve this goal, we propose to use network coding. Basically, network coding allows intermediate network nodes to combine data packets instead of just forwarding them as is, which leads to minimizing the consumed network resources used for protection purposes. In this work we give special attention to the survivability of many-to-one wireless flows, where a set of N sources are sending data units to a common destination T. Examples of such many-to-one flows are found in Wireless Mesh Networks (WMNs) or Wireless Sensor Networks (WSNs). We present two techniques to provide proactive protection to the information flow in such communication networks. First, we present a centralized approach, for which we derive and prove the sufficient and necessary conditions that allows us to protect the many-to-one information flow against a single link failure using only one additional path. We provide a detailed study of this technique, which covers extensions for more general cases, complexity analysis that proves the NP-completeness of the problem for networks with limited min-cuts, and finally performance evaluation which shows that in the worst case our coding-based protection scheme can reduce the useful information rate by 50% (i.e., will be equivalent to traditional protection schemes). Next, we study the implementation of the previous approach when all network nodes have single transceivers. In this part of our work we first present a greedy scheduling algorithm for the sources transmissions based on digital network coding, and then we show how analog network coding can further enhance the performance of the scheduling algorithm. Our second protection scheme uses deterministic binary network coding in a distributed manner to enhance the resiliency of the Sensors-to-Base information flow against packet loss. We study the coding efficiency issue and introduce the idea of relative indexing to reduce the coding coefficients overhead. Moreover, we show through a simulation study that our approach is highly scalable and performs better as the network size and/or number of sources increases. The final part of this work deals with unicast communication sessions, where a single source node S is transmitting data to a single destination node T through multiple hops. We present a different way to handle the survivability vs. bandwidth tradeoff, where we show how to enhance the survivability of the S-T information flow without reducing the maximum achievable S-T information rate. The basic idea is not to protect the bottleneck links in the network, but to try to protect all other links if possible. We divide this problem into two problems: 1) pre-cut protection, which we prove it to be NP-hard, and thus, we present an ILP and a heuristic approach to solve it, and 2) post-cut protection, where we prove that all the data units that are not delivered to T directly after the min-cut can be protected against a single link failure. Using network coding in this problem allows us to maximize the number of protected data units before and after the min-cut

    Software Defined Networks based Smart Grid Communication: A Comprehensive Survey

    Get PDF
    The current power grid is no longer a feasible solution due to ever-increasing user demand of electricity, old infrastructure, and reliability issues and thus require transformation to a better grid a.k.a., smart grid (SG). The key features that distinguish SG from the conventional electrical power grid are its capability to perform two-way communication, demand side management, and real time pricing. Despite all these advantages that SG will bring, there are certain issues which are specific to SG communication system. For instance, network management of current SG systems is complex, time consuming, and done manually. Moreover, SG communication (SGC) system is built on different vendor specific devices and protocols. Therefore, the current SG systems are not protocol independent, thus leading to interoperability issue. Software defined network (SDN) has been proposed to monitor and manage the communication networks globally. This article serves as a comprehensive survey on SDN-based SGC. In this article, we first discuss taxonomy of advantages of SDNbased SGC.We then discuss SDN-based SGC architectures, along with case studies. Our article provides an in-depth discussion on routing schemes for SDN-based SGC. We also provide detailed survey of security and privacy schemes applied to SDN-based SGC. We furthermore present challenges, open issues, and future research directions related to SDN-based SGC.Comment: Accepte

    The Legal Needs of Local Media Reform Organizations: Report of a National Survey

    Get PDF
    This report summarizes a nationwide survey of media reform groups to gauge their needs for pro bono legal assistance. Conclusions are that local media democracy groups need legal help on multiple issues, ranging from municipal broadband to cable franchising to low-power radio

    Secure Routing Protocols Comparison Analysis Between RNBR, SAA, A-UPK

    Get PDF
    The advent of wireless communications and the development of mobile devices have made great strides in the development of roaming communications. The MANET mobile network was developed with the ability for mobile devices to quickly self-configure and extend wireless coverage without infrastructure support. Security is one of the most important areas of research and plays a vital role in determining the success of personal and commercial telephone systems.Therefore, this study focuses on systematically examining MANET security and accountability issues and analyzing the performance of solutions proposed by three different design approaches to security systems.First, it provides an approach for identifying trusted nodes employing the proposed RNBR method for secure routing.it provides a Self-Assured Assessment (SAA) method to estimate node stability. Its main goal is to contribute to a self-assessment-based reliability assessment mechanism that provides a reliable and reliable pathway.it provides a new authentication method to prevent forgery attacks. It supports authentication mechanisms to prevent RF attacks and ensure secure routing development.The main Objective of this paper is compare to packet delivery Ratio ,Control Overhead, Packet Drop Ratio in different secure RNBR,SAA,A-UPK Routing Protocols in MANETS

    An Effective Approach for Recovering From Simultaneous Node Failures in Wireless Sensor Networks

    Get PDF
    In wireless sensor - actor networks, sensors probe their surroundings and forward their data to actor nodes. Actors collaboratively respond to achieve predefined application mission. Since actors have to coordinate their operation, it is nec essary to maintain a stron gly connected network topology at all times. Failure of one or multiple actors may partition the inter - actor network into disjoint segments, and thus hinders the network operation. Autonomous detection and rapid recovery procedures ar e highly desirable in such a case . One of the effective recovery methodologies is to autonomously reposition a subset of the actor nodes to restore connectivity. Contemporary recovery schemes either impose high node relocation overhead or extend some of th e inter - actor data pat hs. This paper overcomes these shortcomings and presents extended version of DCR named RAM, to handle one possible case of a multi - actor failure with Least - Disruptive topology Repair (LeDiR) algorithm for minimal topological changes . Upon failure detection , the backup actor initiates a recovery process that relocates the least num ber of nodes
    corecore