99 research outputs found

    A FRAMEWORK FOR CONSERVING POWER IN MANETS

    Get PDF
    The idea of using controllable relay nodes for designing mobile systems has been explored by several researchers. The main objective of this paper is to design a framework for deploying relay nodes with controlled mobility to conserve power in MANET. To meet out this proposal, a heterogeneous network consisting of traditional nodes with limited energy and relay nodes with more energy resources are considered. The deployment of relay nodes are based on the following two methods: 1. Min-Total, aims to minimize the total energy consumption of all the traditional nodes in the network. 2. Min-Max, aims to minimize the energy consumed by a traditional node in the network. The solution of these two methods can be used to prioritize each individual node in the network. The trade-offs involved in deploying an increasing/decreasing fraction of relay nodes, varying node weights, varying epoch duration is analyzed. This framework aims at dynamically combining both Min-Total and Min-Max based on the characteristics and requirements of the network

    Route discovery based on energy-distance aware routing scheme for MANET

    Get PDF
    Route discovery proses in a Mobile Ad hoc Network (MANET) is challenging due to the limitation of energy at each network node. The energy constraint limits network connection lifetime thus affecting the routing process. Therefore, it is necessary for each node in the network to calculate routing factor in terms of energy and distance in deciding optimal candidate relay nodes needed to forward packets. This study proposes a new route discovery mechanism called the Energy-Distance Routing Aware (EDRA) that determines the selection of nodes during route discovery process to improve the network connection lifetime. This mechanism comprises of three schemes namely the Energy-Distance Factor Aware (EDFA), the Energy-Distance Forward Strategy (EDFS), and the Energy-Aware Route Selection (EARS). The EDFA scheme begins by calculating each nodes energy level (ei) and the distance (di) to the neighbouring nodes to produce the energy-distance factor value used in selecting the relay nodes. Next, the EDFS scheme forwards route request packets within discovery area of relay nodes based on the number of nodes. Then, the EARS scheme selects stable routing path utilising updated status information from EDFA and EDFS. The evaluation of EDRA mechanism is performed using network simulator Ns2 based on a defined set of performance metrics, scenarios and network scalability. The experimental results show that the EDRA gains significant improvement in the network connection lifetime when compared to those of the similar mechanisms, namely the AODV and the DREAM. EDRA also optimises energy consumption by utilising efficient forwarding decisions on varying scale of network nodes. Moreover, EDRA maximizes network connection lifetime while preserving throughput and packet drop ratio. This study contributes toward developing an efficient energy-aware routing to sustain longer network connection lifetime in MANET environment. The contribution is significant in promoting the use of green and sustainable next generation network technology

    From MANET to people-centric networking: Milestones and open research challenges

    Get PDF
    In this paper, we discuss the state of the art of (mobile) multi-hop ad hoc networking with the aim to present the current status of the research activities and identify the consolidated research areas, with limited research opportunities, and the hot and emerging research areas for which further research is required. We start by briefly discussing the MANET paradigm, and why the research on MANET protocols is now a cold research topic. Then we analyze the active research areas. Specifically, after discussing the wireless-network technologies, we analyze four successful ad hoc networking paradigms, mesh networks, opportunistic networks, vehicular networks, and sensor networks that emerged from the MANET world. We also present an emerging research direction in the multi-hop ad hoc networking field: people centric networking, triggered by the increasing penetration of the smartphones in everyday life, which is generating a people-centric revolution in computing and communications

    Reputation-Based Internet Protocol Security: A Multilayer Security Framework for Mobil Ad Hoc Networks

    Get PDF
    This research effort examines the theory, application, and results for a Reputation-based Internet Protocol Security (RIPSec) framework that provides security for an ad-hoc network operating in a hostile environment. In RIPSec, protection from external threats is provided in the form of encrypted communication links and encryption-wrapped nodes while internal threats are mitigated by behavior grading that assigns reputations to nodes based on their demonstrated participation in the routing process. Network availability is provided by behavior grading and round-robin multipath routing. If a node behaves faithfully, it earns a positive reputation over time. If a node misbehaves (for any number of reasons, not necessarily intentional), it earns a negative reputation. Each member of the MANET has its own unique and subjective set of Reputation Indexes (RI) that enumerates the perceived reputation of the other MANET nodes. Nodes that desire to send data will eliminate relay nodes they perceive to have a negative reputation during the formulation of a route. A 50-node MANET is simulated with streaming multimedia and varying levels of misbehavior to determine the impact of the framework on network performance. Results of this research were very favorable. Analysis of the simulation data shows the number of routing errors sent in a MANET is reduced by an average of 52% when using RIPSec. The network load is also reduced, decreasing the overall traffic introduced into the MANET and permitting individual nodes to perform more work without overtaxing their limited resources. Finally, throughput is decreased due to larger packet sizes and longer round trips for packets to traverse the MANET, but is still sufficient to pass traffic with high bandwidth requirements (i.e., video and imagery) that is of interest in military networks

    Recent Developments on Mobile Ad-Hoc Networks and Vehicular Ad-Hoc Networks

    Get PDF
    This book presents collective works published in the recent Special Issue (SI) entitled "Recent Developments on Mobile Ad-Hoc Networks and Vehicular Ad-Hoc Networks”. These works expose the readership to the latest solutions and techniques for MANETs and VANETs. They cover interesting topics such as power-aware optimization solutions for MANETs, data dissemination in VANETs, adaptive multi-hop broadcast schemes for VANETs, multi-metric routing protocols for VANETs, and incentive mechanisms to encourage the distribution of information in VANETs. The book demonstrates pioneering work in these fields, investigates novel solutions and methods, and discusses future trends in these field

    Clustering algorithms for sensor networks and mobile ad hoc networks to improve energy efficiency

    Get PDF
    Includes bibliographical references (leaves 161-172).Many clustering algorithms have been proposed to improve energy efficiency of ad hoc networks as this is one primary challenge in ad hoc networks. The design of these clustering algorithms in sensor networks is different from that in mobile ad hoc networks in accordance with their specific characteristics and application purposes. A typical sensor network, which consists of stationary sensor nodes, usually has a data sink because of the limitation on processing capability of sensor nodes. The data traffic of the entire network is directional towards the sink. This directional traffic burdens the nodes/clusters differently according to their distance to the sink. Most clustering algorithms assign a similar number of nodes to each cluster to balance the burden of the clusters without considering the directional data traffic. They thus fail to maximize network lifetime. This dissertation proposes two clustering algorithms. These consider the directional data traffic in order to improve energy efficiency of homogeneous sensor networks with identical sensor nodes and uniform node distribution. One algorithm is for sensor networks with low to medium node density. The other is for sensor networks with high node density. Both algorithms organize the clusters in such a way that the cluster load is proportional to the cluster energy stored, thereby equalizing cluster lifetimes and preventing premature node/cluster death. Furthermore, in a homogeneous sensor network with low to medium node density, the clusterhead is maintained in the central area of the cluster through re-clustering without ripple effect to save more energy. The simulation results show that the proposed algorithms improve both the lifetime of the networks and performance of data being delivered to the sink. A typical mobile ad hoc network, which usually consists of moveable nodes, does not have a data sink. Existing energy-efficient clustering algorithms maintain clusters by periodically broadcasting control messages. In a typical mobile ad hoc network, a greater speed of node usually needs more frequent broadcasting. To efficiently maintain the clusters, the frequency of this periodic broadcasting needs to meet the requirement of the potentially maximum speed of node. When the node speed is low, the unnecessary broadcasting may waste significant energy. Furthermore, some clustering algorithms limit the maximum cluster size to moderate the difference in cluster sizes. Unfortunately, the cluster sizes in these algorithms still experience significant difference. The larger clusters will have higher burdens. Some clustering algorithms restrict the cluster sizes between the maximum and minimum limits. The energy required to maintain these clusters within the maximum and minimum sizes is quite extensive, especially when the nodes are moving quickly. Thus, energy efficiency is not optimized

    Monitoring of Wireless Sensor Networks

    Get PDF

    Techniques to enhance the lifetime of mobile ad hoc networks

    Get PDF
    Devices in Mobile Ad Hoc Networks (MANETs) are mostly powered by battery. Since the battery capacity is fixed, some techniques to save energy at the device level or at the protocol stack should be applied to enhance the MANETs lifetime. In this thesis, we have proposed a few energy saving approaches at the network layer, and MAC layer. First, we proposed a routing technique, to which the following metrics are built into: (i) node lifetime, (ii) maximum limit on the number of connections to a destination, and (iii) variable transmission power. In this technique, we consider a new cost metric which takes into account the residual battery power and energy consumption rate in computing the lifetime of a node. To minimize the overutilization of a node, an upper bound is set on the number of connections that can be established to a destination. The proposed technique is compared with AODV [1] and LER [2]. It outperforms AODV and LER in terms of network lifetime. Next, a technique called Location Based Topology Control with Sleep Scheduling (LBTC) is proposed. It uses the feature of both topology control approach in which the transmission power of a node is reduced, and power management approach in which nodes are put to sleep state. In LBTC the transmission power of a node is determined from the neighborhood location information. A node goes to sleep state only when: (i) it has no traffic to participate, and (ii) its absence does not create a local partition. LBTC is compared with LFTC [3] and ANTC [4]. We observed that the network lifetime in LBTC is substantially enhanced. A framework for post-disaster communication using wireless ad hoc networks is proposed. This framework includes: (i) a multi-channel MAC protocol, (ii) a node-disjoint multipath routing, and (iii) a distributed topology aware scheme. Multi-channel MAC protocol minimizes the congestion in the network by transmitting data through multiple channels. Multipath routing overcomes the higher energy depletion rate at nodes associated with shortest path routing. Topology aware scheme minimizes the maximum power used at node level. Above proposals, taken together intend to increase the network throughput, reduce the end-to-end delay, and enhance the network lifetime of an ad hoc network deployed for disaster response
    corecore