M. Gueroui - Academia.edu (original) (raw)

Papers by M. Gueroui

J. Univers. Comput. Sci., 2011

In-network data aggregation has a great impact on the energy consumption in large-scale wireless ... more In-network data aggregation has a great impact on the energy consumption in large-scale wireless sensor networks. However, the resource constraints and vulnerable deployment environments challenge the application of this technique in terms of security and efficiency. A compromised node may forge arbitrary aggregation value and mislead the base station into trusting a false reading. In this paper, we present RAHIM, a reactive defense to secure data aggregation scheme in cluster-based wireless sensor networks. The proposed scheme is based on a novel application of adaptive hierarchical level of monitoring providing accuracy of data aggregation result in lightweight manner, even if all aggregator nodes and a part of sensors are compromised in the network.

Communications in Computer and Information Science, 2011

Transactions on Emerging Telecommunications Technologies, 2011

IEEE 5th International Symposium on Wireless Pervasive Computing 2010, 2010

AbstractThis work introduces a novel secure data aggregation framework for Wireless Sensor Netwo... more AbstractThis work introduces a novel secure data aggregation framework for Wireless Sensor Networks. It ensures the accuracy of data aggregation value without neglecting energy efficiency, even if all aggregator nodes and some of sensors are compromised in the ...

2011 10th International Symposium on Programming and Systems, 2011

ABSTRACT Localization in wireless sensor networks (WSNs) has drawn growing attention from the res... more ABSTRACT Localization in wireless sensor networks (WSNs) has drawn growing attention from the researchers and a number of localization schemes have been proposed to discover the locations of regular sensors based on a few beacon nodes, which are assumed to know their locations through GPS or manual configuration. However, the localization process is vulnerable to malicious attacks aimed at interrupting the functionality of location-aware applications. The wormhole attack is a particularly challenging one since the external adversary which acts in passive mode, does not need to compromise any nodes or have access to any cryptographic keys. In this paper, wormhole attack in DV-hop is discussed, and a Wormhole-free DV-hop Localization scheme (WFDV) is proposed to defend wormhole attack in proactive countermeasure. Using analysis and simulation, we show that our solution is effective in detecting and defending against wormhole attacks with a high detection rate.

2011 IEEE Wireless Communications and Networking Conference, 2011

... AT&T, 2008. [7] Kim, RY, Kwak, JS, and Etemad, K. 2009. ... 15 [11] Mostafa Zaman Chowdh... more ... AT&T, 2008. [7] Kim, RY, Kwak, JS, and Etemad, K. 2009. ... 15 [11] Mostafa Zaman Chowdhury, Yeong Min Jang, and Zygmunt J. Haas, Network Evolution And QoS Provisioning For Integrated Femtocell/Macrocell Networks. ...

2011 Wireless Telecommunications Symposium (WTS), 2011

2006 Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT'06), 2006

ABSTRACT In this paper we present a new distributed group mutual exclusion (DGME) based on client... more ABSTRACT In this paper we present a new distributed group mutual exclusion (DGME) based on clients/servers model, and uses a dynamic data structures. Several processes (clients) can access simultaneously to a same opened session (server). The algorithm ensures that, at any time, at most one session is opened, and any requested session will be opened in a finite time. The number of messages is between 0 and m, where m is the number of session in the network. In the average case, O(Log(m)) messages are necessary to open a session. The maximum concurrency is n, where n is the number of processes in the network

Innovations and Advanced Techniques in Computer and Information Sciences and Engineering

A mobile ad hoc network can be defined as a network that is spontaneously deployed and is indepen... more A mobile ad hoc network can be defined as a network that is spontaneously deployed and is independent of any static network. The network consist of mobile nodes1 with wireless interfaces and has an arbitrary dynamic topology. The networks suffers from frequent link formation and disruption due to the mobility of the nodes. In this paper we present a token based algorithm for Group Mutual Exclusion in ad hoc mobile networks. The proposed algorithm is adapted from the RL algorithm in [1]. The algorithm requires nodes to communicate with only their current neighbors. The algorithm ensures the mutual exclusion, the bounded delay, and the concurrent entering properties.

Advances and Innovations in Systems, Computing Sciences and Software Engineering

ABSTRACT This paper presents a quorum-based distributed algorithm for the group mutual exclusion.... more ABSTRACT This paper presents a quorum-based distributed algorithm for the group mutual exclusion. In the group mutual exclusion problem, multiples processes can enter a critical section simultaneously if they belong to the same group. This algorithm assumes that only one session can be opened at any time, several processes can access to the same session, and any requested session can be opened in a finite time. The message complexity of this algorithm is O(□n ) for the finite projective plane of order 2 (Fano plane) and O(2□n -1) for a grid where n is the total number of processes.

2006 International Symposium on Computer Networks

Energy efficiency operations are essential in extending wireless sensor networks lifetime. Among ... more Energy efficiency operations are essential in extending wireless sensor networks lifetime. Among the energy-saving-based solutions, clustering sensor nodes is an interesting alternative that features a reduction in energy consumption through: (i) aggregating data; (ii) controlling transmission power levels (iii) balancing load; (iv) putting redundant sensor nodes to sleep. This paper introduces a novel clustering algorithm that uses a distributed approach

The group mutual exclusion (GME) problem is an interesting generalization of the mutual exclusion... more The group mutual exclusion (GME) problem is an interesting generalization of the mutual exclusion problem. Several solutions of the GME problem have been proposed for message passing distributed systems. In this paper we present a new Distributed Group Mutual Exclusion (DGME) based on Clients/Servers model, and uses a dynamic data structure. Several processes (Clients) can access simultaneously to a same opened session (Server). The algorithm ensures that, at any time, at most one session is opened, and any requested session will be opened in a finite time. The number of messages is between 0 and m, where m is the number of session in the network. In the average case, O(Log(m)) messages are necessary to open a session. The maximum concurrency is n, where n is the number of processes in the network.

We present a table-less position based routing scheme for low power data centric wireless sensor ... more We present a table-less position based routing scheme for low power data centric wireless sensor networks. Our proposed scheme is localized, uses greedy forwarding approach, and does not rely on neighborhood information. These characteristics...

Z. Đurić, O. Marić, D. Gašević: Internet Payment System: A New Payment System for Internet Transa... more Z. Đurić, O. Marić, D. Gašević: Internet Payment System: A New Payment System for Internet Transactions Payment systems need to address a number of security issues in order to be an effective and secure means of transferring payments across the Internet. To be accessible to a wider audience, they also need to be easy to use for their end-users ... ... E. Börger: The Origins and the Development of the ASM Method for High Level System Design and Analysis The research belonging to the Abstract State Machines approach to system design and analysis is ...

Proceedings of the 1st ACM international workshop on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks, 2004

Proceedings of the 1st ACM international workshop on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks - PE-WASUN '04, 2004

The proposed IEEE 802.11e draft standard defines new MAC protocols for QoS support in wireless ne... more The proposed IEEE 802.11e draft standard defines new MAC protocols for QoS support in wireless networks, namely HCF and EDCF. EDCF is a contention based channel access scheme and is part of HCF for infrastructure networks and may be used as a separate coordination function for wireless Ad-hoc networks. In this paper we propose to enhance EDCF with a dynamic traffic class's management protocol, which allows firstly, a guarantee of QoS to the sensitive applications some as the network state. Secondly, a sliding QoS differentiation between the Traffic Classes (TC) according to the instantaneous channels fluctuations. This sliding differentiation is based on a dynamic tune of the IEEE 802.11 MAC's parameters. The performances of the proposed scheme namely AMPA (Adaptive MAC Parameters), are extensively investigated by simulations. Results obtained indicate that AMPA scheme outperforms both DCF and EDCF.