Book Chapters
Permanent URI for this collectionhttp://dl.cerist.dz/handle/CERIST/24
Browse
8 results
Search Results
Item An Architectural Model for a Mobile Agents System Interoperability(Springer, 2007) Zeghache, Linda; Badache, Nadjib; El Maouhab, AouaoucheAn important goal in mobile agent technology is interoperability between various agent systems. A way of achieving this goal would be to envisage a standard to be imposed on these various “agents systems” in order to allow the inter-working of various architectures of mobile agents. During the past years, different scientific communities proposed to different standardization actions, such as the Foundation for Physical Intelligent Agents (FIPA) and the Object Management Group’s MASIF (Mobile Agent System Interoperability Facilities). Although, they finally share some major targets, the OMG and FIPA current results show their distinct origins, particularly for interoperability between or within distributed systems. In this paper, we first analyze the similarities and differences, advantages and disadvantages of the Object Management Group (OMG) mobile agent and the Foundations for Intelligent Physical Agents (FIPA) intelligent agent approaches. Based on this analysis, we try to integrate these two standards to propose an architectural model for mobile agents system interoperabilityItem SQUIRREL: Self-Organizing Qos-roUting for IntRa-flow Contention in Ad-Hoc wiRELess Networks(Springer Berlin Heidelberg, 2008) Derhab, AbdelouahidIn this paper, we use the self-organizing paradigms presented in [1] to design a new QoS-routing intra-flow contention-based protocol for wireless ad-hoc networks, called SQUIRREL. The admission control component of SQUIRREL, called: Scalable and Accurate Admission control (SAICAC), has two variants: SAICAC-Power and SAICAC-CS. SAICAC-Power estimates channel bandwidth availability through high power transmissions and SAICAC-CS through passive monitoring of the channel. Contrary to the existing intra-flow contention-based protocols, SQUIRREL can ensure all the properties of a self-organizing system and can achieve the best results in terms of of message overhead, delay, and scalability.Item ELS: Energy-Aware Some-for-Some Location Service for Ad Hoc Mobile Networks(Springer Berlin Heidelberg, 2006) Derhab, Abdelouahid; Badache, Nadjib; Tari, Karim; Sami, SihemIn this paper, we propose a new location service for Ad hoc mobile networks. The network area is divided into non-overlapping zones. Using a hash function, a node identifier is mapped to a set of zones, in which the location information of the node are stored. We also propose a location information distribution scheme that achieves low rate of outdated location information. Using cross-layer design, the service can tolerate servers mobility and failure, and last for a long time period. Simulation Results show that the proposed location service experiences low overhead and high location information availability and accuracy.Item Low-Cost and Accurate Intra-flow Contention-Based Admission Control for IEEE 802.11 Ad Hoc Networks(Springer Berlin Heidelberg, 2008) Derhab, AbdelouahidIn this paper, we propose a new admission control method for IEEE 802.11 ad hoc networks, called Low-cost and Accurate Admission control (LAAC). The proposed method has two variants: LAAC-Power and LAAC-CS. LAAC-Power estimates channel bandwidth availability through high power transmissions and LAAC-CS through passive monitoring of the channel. Due to the shared nature of the wireless medium, contention occurs among the nodes along a multi-hop path, which leads to intra-flow contention. LAAC accurately estimates the intra-flow contention. In addition, an analytical study demonstrates that LAAC achieves optimal results in terms of overhead and delay compared to the existing intra-flow contention-based admission control methods. LAAC also utilizes two criteria for accepting flows: one during the route request phase and the other during the route reply phase, which helps to reduce message overhead and avoid flooding route requests in hot spots. Simulation results show that LAAC-CS outperforms LAAC-Power in terms of packet delivery ratio, throughput, message overhead, and energy consumption.Item Performance Analysis of Binding Update in Mobile IP during Handoff(Springer Berlin Heidelberg, 2004) Tandjaoui, Djamel; Badache, Nadjib; Bouabdallah, AbdelmadjidMobile IP protocol was proposed to handle users mobility on Internet. However, Mobile IP suffers from many drawbacks especially handoff latency. In this paper, we investigate the loss of successive binding update requests and their impact on handoff latency. We show that handoff latency increases in case of successive binding update requests loss. We propose an enhancement of binding update in Mobile IP. It consists on reducing the timeout to half just after the loss of the first binding update. So, the mobile node sends two binding update requests within a timeout. By doing so, we increase the probability that one binding update request reach the home agent. We present an analytical model of handoff latency based on packets loss probability. The simulation shows that our solution reduces considerably the additional handoff latency induced by successive binding update requests loss.Item P2P B&B and GA for the Flow-Shop Scheduling Problem(Springer-Verlag, 2008-09) Bendjoudi, Ahcène; Guerdah, Samir; Mansoura, Madjid; Melab, Nouredine; Talbi, El-GhazaliSolving exactly Combinatorial Optimization Problems (COPs) using a Branch-and-Bound algorithm (B&B) requires a huge amount of computational resources. The efficiency of such algorithm can be improved by its hybridization with meta-heuristics such as Genetic Algorithms (GA) which proved their effectiveness, since they generate acceptable solutions in a reasonable time. Moreover, distributing at large scale the computation, using for instance Peer-to-Peer (P2P) Computing, provides an efficient way to reach high computing performance. In this chapter, we propose ParallelBB and ParallelGA, which are P2P-based parallelization of the B&B and GA algorithms for the computational Grid. The two algorithms have been implemented using the ProActive distributed object Grid middleware. The algorithms have been applied to a mono-criterion permutation flow-shop scheduling problem and promisingly experimented on the Grid5000 computational Grid.Item Information Security in Wireless Sensor Networks(World Scientific, 2009-10) Ouadjaout, Abdelraouf; Bagaa, Miloud; Bachir, Abdelmalik; Challal, Yacine; Lasla, Noureddine; Khelladi, LyesIn this chapter, we provide a comprehensive survey of security issues in wireless sensor networks. We show that the main features of WSNs, namely their limited resources, wireless communications, and close physical coupling with environment, are the main causes of the their security vulnerabilities. We discuss the main attacks stemming from these vulnerabilities, along with the solutions proposed in the literature to cope with them. The security solutions are analyzed with respect to the different layers of the network protocol stack and cover the following issues: Key management, secure data dissemination, secure data aggregation, secure channel access and secure node compromise.Item Selfish Behavior on Packet Forwarding: An Emergent Security Problem in MANET(Auerback Publisher, 2008) Djenouri, Djamel; Badache, NadjibThe limitation in energy resources along with the multi-hop nature of mobile ad hoc networks (MANETs) causes a new vulnerability, that does not exist in traditional networks. To preserve its own battery, a node may behave selfishly and would not forward packets originated from other nodes, while using their services and consuming their resources. This deviation from the correct behavior represents a potential threat against the quality and the availability of the forwarding service. Recently, this challenging problem received more and more attention among researchers, and some solutions have been proposed. Still, to the best of our knowledge, no paper surveying these solutions has been published yet. In this entry, we deal with the emergent problem of node selfishness in MANETs, and we provide a state-of-the-art on the current proposed solutions.