International audienceAd hoc networks are wireless mobile networks that can operate without infrastructure and without centralized networkmanagement. Traditional techniques of routing are not well adapted. Indeed, their lack of reactivity with respect to thevariability of network changes makes them difficult to use. Moreover, conserving energy is a critical concern in the design ofrouting protocols for ad hoc networks, because most mobile nodes operate with limited battery capacity, and the energydepletion of a node affects not only the node itself but also the overall network lifetime. In all proposed single-path routingschemes a new path-discovery process is required once a path failure is detected, and this process causes delay and wastage ofnode resources. A multipath routing scheme is an alternative to maximize the network lifetime. In this paper, we propose anenergy-efficient multipath routing protocol, called AOMR-LM (Ad hoc On-demand Multipath Routing with LifetimeMaximization), which preserves the residual energy of nodes and balances the consumed energy to increase the networklifetime. To achieve this goal, we used the residual energy of nodes for calculating the node energy level. The multipathselection mechanism uses this energy level to classify the paths. Two parameters are analyzed: the energy threshold beta and thecoefficient alpha. These parameters are required to classify the nodes and to ensure the preservation of node energy. Our protocolimproves the performance of mobile ad hoc networks by prolonging the lifetime of the network. This novel protocol has beencompared with other protocols: AOMDV and ZD-AOMDV. The protocol performance has been evaluated in terms of networklifetime, energy consumption, and end-to-end delay
Abstract-Automatic processing of requirements (e.g. to generate code) remains a challenge in contemporary software development. Requirements are still treated as secondary artifacts by software developers, as they are written in natural languages which causes ambiguity. In this paper, we present an approach to generate working code from requirements through applying precisely formulated domain models. As the source, we use the Requirements Specification Language (RSL) which is a precise constrained language, based on a central domain model composed of domain notions. These notions are linked from use case scenarios and create a form of a 'wiki'. Notions are graphically visualized in RSL, and resemble UML classes with attributes. Notions can be used in phrases that can represent various operations used within use case scenarios. In our approach we introduce model transformation algorithms that allow to generate database access code associated with operations to persist (store, retrieve) data in a database system. To focus our work, we present code generated for Hibernate which is an object relational mapping framework.
Abstract-Routing in ad hoc mobile networks is a problem which has not yet been satisfactorily solved. Traditional routing techniques are not well adapted to new networks. Indeed, their lack of reactivity with respect to the traffic and network changes means traditional routing techniques cannot easily be used except at the price of over-dimensioning of the network resources (network bandwidth, node memory utilization, node CPU load, etc.). In recent years the research community has been interested in the improvement of ad hoc routing, and among the solutions suggested multipath routing has been considered. Multiple paths are exploited in order to ensure reliability and a quick reaction to changes in topology with a low overhead generated by the control messages. In this article we present an extension of the well-known routing protocol AODVM (Ad hoc On-demand Distance Vector Multipath). We propose to improve the multipath routing strategy with a path classification to allow the paths with the best energy level to be chosen.
This paper describes the Connected Dominating Set-Energy Protocol (CDSEP) for mobile ad hoc networks. The key concept used in the protocol is a new algorithm to construct Connected Dominating Set based on Energy and Connectivity (CDSE). This algorithm also permits to calculate the routing table based on the prediction. We propose a distributed algorithm to build a virtual topology based on Energy and Connectivity. This topology is used in the routing process. The nodes which build this topology are chosen according to two parameters: energy and connectivity, these nodes are named diffusion or dominator node. The CDSE virtual topology nodes forward broadcast packets during the flooding process. This technique greatly reduces the control packets and energy consumption as compared to Multipoint Relay flooding mechanism. In CDSEP protocol, the CDSE information is flooded in the network only by CDSE nodes. Thus a second optimization is achieved by minimizing the contents of the control packets flooded in the network. Hence, only a small subset of links is declared instead of all the network links. This information is then used by the CDSEP protocol to construct and predict the route. Simulation results show the CDSEP performances compared to Optimized Link State Routing Protocol for various metrics like overhead, energy consumption, end-to-end delay and packet delivery ratio.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.