741 research outputs found

    Adaptive trust and reputation system as a security service in group communications

    Get PDF
    Group communications has been facilitating many emerging applications which require packet delivery from one or more sender(s) to multiple receivers. Owing to the multicasting and broadcasting nature, group communications are susceptible to various kinds of attacks. Though a number of proposals have been reported to secure group communications, provisioning security in group communications remains a critical and challenging issue. This work first presents a survey on recent advances in security requirements and services in group communications in wireless and wired networks, and discusses challenges in designing secure group communications in these networks. Effective security services to secure group communications are then proposed. This dissertation also introduces the taxonomy of security services, which can be applied to secure group communications, and evaluates existing secure group communications schemes. This dissertation work analyzes a number of vulnerabilities against trust and reputation systems, and proposes a threat model to predict attack behaviors. This work also considers scenarios in which multiple attacking agents actively and collaboratively attack the whole network as well as a specific individual node. The behaviors may be related to both performance issues and security issues. Finally, this work extensively examines and substantiates the security of the proposed trust and reputation system. This work next discusses the proposed trust and reputation system for an anonymous network, referred to as the Adaptive Trust-based Anonymous Network (ATAN). The distributed and decentralized network management in ATAN does not require a central authority so that ATAN alleviates the problem of a single point of failure. In ATAN, the trust and reputation system aims to enhance anonymity by establishing a trust and reputation relationship between the source and the forwarding members. The trust and reputation relationship of any two nodes is adaptive to new information learned by these two nodes or recommended from other trust nodes. Therefore, packets are anonymously routed from the \u27trusted\u27 source to the destination through \u27trusted\u27 intermediate nodes, thereby improving anonymity of communications. In the performance analysis, the ratio of the ATAN header and data payload is around 0.1, which is relatively small. This dissertation offers analysis on security services on group communications. It illustrates that these security services are needed to incorporate with each other such that group communications can be secure. Furthermore, the adaptive trust and reputation system is proposed to integrate the concept of trust and reputation into communications. Although deploying the trust and reputation system incurs some overheads in terms of storage spaces, bandwidth and computation cycles, it shows a very promising performance that enhance users\u27 confidence in using group communications, and concludes that the trust and reputation system should be deployed as another layer of security services to protect group communications against malicious adversaries and attacks

    Performance Enhancement of Routing in MANETs by using EOMD

    Get PDF
    Usually large scale of network applications requires communication of the single copy of same information packets simultaneously to many destinations. Applying the infrastructure- based multicast routing protocols in Mobile Ad hoc wireless Networks (MANETs) is a big challenge task. The circumstances that make Multicasting in ad hoc networks is extra intricate than in wired networks are node mobility, Interference of Wi-Fi alerts and broadcast nature of the communication. Tree based Protocols aren't suitable for common topology modifications as an excessive amount of overhead for updating the filter information and additionally no longer suitable for partition or isolation. The major impact of routing for multi-hop MANETs comes due to mobility of the node, as performance is prone to modifications in network topology. When any link breaks, the direction should be repaired or changed, similar to direction preservation or route discovery, respectively. The rerouting process charges in radio bandwidth and battery energy, and the extra routing latency can also affect QoS for community packages, degrading communication performance. The ODMRP is more robust to mobility and unreliable wireless links as its core layout relies on periodic floods of path discovery and renovation. ODMRP periodically reconstructs the ?forwarding mesh? on a fixed quick interval. The path refresh is the most essential parameter because it has the important effect at the protocol overhead. We proposed an Extended - On Demand Multicast Routing Protocol with motion detection (EOMD), which reduces communication overhead and performance improvisation in mobile Ad-Hoc Network in Mobility

    Impacts of Channel Switching Overhead on the Performance of Multicast in Wireless Mesh Networks

    Get PDF
    Wireless mesh networks (WMNs) have emerged as a promising technology for next generation wireless networking. A WMN extends network coverage using wireless mesh routers that communicate with each other via multi-hop wireless communications. One technique to increase the network capacity of WMNs is to use routers equipped with multiple radios capable of transmitting and receiving on multiple channels. In a Multi-Channel Multi-Radio wireless mesh network (MCMR WMN), nodes are capable of transmitting and receiving data simultaneously through different radios and at least theoretically doubling the average throughput. On the other hand, the use of multi-radio and multi-channel technology in many cases requires routers to switch channels for each transmission and/or reception. Channel switching incurs additional costs and delay. In this thesis, we present a simulation-based study of the impacts of channel switching overheads on the performance of multicast in MCMR WMNs. We study how channel switching overheads affect the performance metrics such as packet delivery ratio, throughput, end-to-end delay, and delay jitter of a multicast session. In particular, we examine: 1. the performance of multicast in MCMR WMNs with three orthogonal channels versus eleven overlapping channels defined in IEEE 802.11b. 2. the performance of the Minimum-interference Multi-channel Multi-radio Multicast (M4) algorithm with and without channel switching. 3. the performance of the Multi-Channel Minimum Number of Transmissions (MCMNT) algorithm (which does not do channel switching) in comparison with the M4 algorithm (which performs channel switching)

    Scattered Dropping Attack on TCP-Based Mobile Ad-Hoc Networks

    Get PDF
    Scattered Dropping Attack (SDA) is a simple yet very powerful denial of service (DoS) attack that is effective on both TCP and UDP based MANETs. The simulation results clearly show the impact of proposed attack on the network throughput, bandwidth wastage and received data quality. It has also been observed that even though the TCP congestion control is adaptable to the packet losses but in case of the dropping attack it is fully unable to detect whether the packet drop is the result of the attacker misbehaving or it is due to the congestion or other wireless environmental problem

    Resource-aware Video Multicasting via Access Gateways in Wireless Mesh Networks

    Get PDF
    This paper studies video multicasting in large-scale areas using wireless mesh networks. The focus is on the use of Internet access gateways that allow a choice of alternative routes to avoid potentially lengthy and low-capacity multihop wireless paths. A set of heuristic-based algorithms is described that together aim to maximize reliable network capacity: the two-tier integrated architecture algorithm, the weighted gateway uploading algorithm, the link-controlled routing tree algorithm, and the dynamic group management algorithm. These algorithms use different approaches to arrange nodes involved in video multicasting into a clustered and two-tier integrated architecture in which network protocols can make use of multiple gateways to improve system throughput. Simulation results are presented, showing that our multicasting algorithms can achieve up to 40 percent more throughput than other related published approaches

    Estimation-Based Queue Scheduling Model to Improve QoS for End Users in MANETs

    Get PDF
    Using MANETs for real time applications is always a challenge as the network is extremely dynamic with brisk topology changes. Despite this, several real time schedulers have been developed that aimed at providing QoS to ad hoc nodes. The quality of service (QoS) is standardized in terms of capacity, reliability, link quality, delays/jitters, and network cost. Thus, for QoS, the better transmission should be maintained at end user as well as at the transmitting unit. QoS of a network is affected by delays and bandwidth allocated for transmission. For an efficient network, it is required to predict these metrics during transmission. For this, in this paper, integration of quaternion-based Kalman filter is performed that predicts the required bandwidth and the network delays with higher accuracy. From the analysis, it is shown that bandwidth can be optimized but it is not possible to aloof delays in the network. Thus, while implementing such admission control procedures, estimation process allows control over delays and sustain them from going beyond a certain threshold value. The model proposed is a novel approach and has not been formulated in any of previous work related to QoS in MANETs. The effectiveness of model is demonstrated using both simulation and real time results
    • …
    corecore