@conference { ISI:000391354500061,
	title = {CPROB: A dynamic hybrid broadcasting protocol for Vehicular Ad hoc Networks},
	booktitle = {2016 INTERNATIONAL CONFERENCE ON ELECTRICAL AND INFORMATION TECHNOLOGIES (ICEIT)},
	year = {2016},
	note = {2nd International Conference on Electrical and Information Technologies (ICEIT), Tangier, MOROCCO, MAY 04-07, 2016},
	pages = {355-361},
	abstract = {Vehicular Ad-hoc networks VANETs is a sub-class of Mobile Ad-hoc networks MANETs that has many promising future applications. For example, VANETs can significantly reduce car deaths. In VANETs, nodes mainly communicate by broadcasting messages to each other. Such broadcasting needs to be designed carefully to minimize both congestion and latency. However, most prior broadcasting protocols minimize either congestion or latency, but not both. In this paper, we present CPROB, a new broadcasting algorithm for VANETs that minimizes both congestion and latency. We achieve this result by setting a key parameter (namely the waiting time before retransmission) based on the characteristics of the surrounding environment. Through NS2 simulations, we show that CPROB achieves 57\% less latency and comparable congestion than prior work in congested areas. In less congested areas, CPROB has a comparable performance to prior work.},
	isbn = {978-1-4673-8469-8},
	author = {Naja, Assia and Essaaidi, Mohammad and Boulmalf, Mohammed},
	editor = {Essaaidi, M and ElHani, S}
}
@conference { ISI:000375089700008,
	title = {A new adaptive algorithm for data dissemination in Vehicular Ad hoc Networks},
	booktitle = {PROCEEDINGS OF 2015 INTERNATIONAL CONFERENCE ON ELECTRICAL AND INFORMATION TECHNOLOGIES (ICEIT 2015)},
	year = {2015},
	note = {1st International Conference on Electrical and Information Technologies (ICEIT), Marrakech, MOROCCO, MAR 25-27, 2015},
	pages = {36-42},
	abstract = {The idea or concept of intelligent traffic management in which data from the TIC (Traffic Information Centre) infrastructures could be reachable at any point is included mightily in Smart cities. Living labs (cities in which new designed systems can be tested in real conditions) have been created all over Europe to test the possibilities of these future cities. It{\textquoteright}s the new concept where vehicular networks play relevant role. The Vehicular Ad-hoc Networks VANETs are a sub-class of the most studied Mobile Ad hoc Networks MANET, in which vehicles are considered as mobile nodes. VANETs differ from other MANETs because of their specific characteristics, inducing numerous problems and constraints, which lead us to discuss many issues in VANETs as they are decentralized, self organized, self monitoring with distributed nature of network. When and if deployed, VANETs will be the most implemented MANET ever and will continue their development over next years; it is indeed the reason why many issues are of great concern to be studied. Ample research efforts have been devoted to VANETs in the broadcasting domain. In order to have optimal and adaptive approaches, we focus on a number of requirements. In this light, this article will present an overview of VANETs, chiefly broadcasting protocols with the aim to resolve this relevant related issue, it also present some suggested broadcasting solutions and a propose a new algorithm with the idea of integrating the concept of Intelligent Traffic Lights ITLs in order to solve the core{\textquoteright}s problem which is how to minimize the number of rebroadcast packets while maintaining good latency and reachability using dynamic parameters from the counter, probability based and distance based.},
	isbn = {978-1-4799-7479-5},
	author = {Naja, Assia and Essaaidi, Mohammad and Azzekhmam, Mourad and Boulmalef, Mohammed},
	editor = {Essaaidi, M and ElHani, S}
}
@conference { ISI:000355910900043,
	title = {Malicious Workers Tolerance in an Agent-Based Grid Resource Brokering System - Preliminary Considerations (Short Paper)},
	booktitle = {2014 INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE AND COMPUTATIONAL INTELLIGENCE (CSCI), VOL 2},
	year = {2014},
	note = {International Conference on Computational Science and Computational Intelligence (CSCI), Las Vegas, NV, MAR 10-13, 2014},
	pages = {233-236},
	publisher = {American Council Sci \& Educ},
	organization = {American Council Sci \& Educ},
	abstract = {The Agent in Grid (AiG) project develops an agent-based infrastructure for resource management in the Grid. The basic assumptions of the project are that (1) agents work in teams, and (2) information is ontologically represented and semantically processed. Thus far, issues involved in trust management were considered only from the point of view of fulfillment of contracts between stakeholders. However, it is also possible that some workers that fulfill their contracts, return incorrect results. In this note, we consider how the trust management in the AiG project can be further conceptualized by using a reputation-based voting.},
	isbn = {978-1-4799-3009-8},
	doi = {10.1109/CSCI.2014.126},
	author = {Attaoui, Naoual and Essaaidi, Mohammad and Paprzycki (Ca), Marcin and Ganzha, Maria},
	editor = {Akhgar, B and Arabnia, HR}
}
@article {11154994420140101,
	title = {MALICIOUS WORKERS TOLERANCE IN AN AGENT-BASED GRID RESOURCE BROKERING SYSTEM.},
	journal = {IADIS International Journal on Computer Science \& Information Systems},
	volume = {9},
	number = {1},
	year = {2014},
	pages = {55 - 70},
	abstract = {The Agent in Grid (AiG) project aims to develop an agent-based infrastructure that facilitates the resource management in the Grid. The core assumptions behind the system are: software agents representing Grid resources work in teams, and all information is ontologically represented and semantically processed. Thus far, trust management in AiG system is approached from the perspective of breaching an agreement between Users and teams or contracts between teams and Workers. Unfortunately, it is also possible that some Workers, which fulfilled the agreement, could have maliciously returned incorrect results from the jobs that they executed. In this paper, we discuss how the trust management in the AiG project can be improved by using a reputation-based voting technique, in order to assure reliable job execution. [ABSTRACT FROM AUTHOR]},
	keywords = {agent system, Computational grids (Computer systems), Distributed computing, Grid computing, Inte lligent agents (Computer software), Job performance, majority voting, malicious workers tolerance, reputation, Teams in the workplace, trust management},
	issn = {16463692},
	url = {http://search.ebscohost.com/login.aspx?direct=true\&db=iih\&AN=111549944\&site=ehost-live},
	author = {Attaoui, Naoual and Bendahmane, Ahmed and Essaaidi, Mohammad and Sanyal, Sugata and Ganzha, Maria and Paprzycki, Marcin and Wasielewska, Katarzyna}
}
@article {9342527920130601,
	title = {MULTIPLE EQUIVALENT SIMULTANEOUS OFFERS STRATEGY IN AN AGENT-BASED GRID RESOURCE BROKERING SYSTEM - INITIAL CONSIDERATIONS.},
	journal = {Scalable Computing: Practice \& Experience},
	volume = {14},
	number = {2},
	year = {2013},
	pages = {83 - 94},
	abstract = {The Agent in Grid (AiG) project attempts to integrate the concept of the Grid and an agent-based system to facilitate efficient resource management in the Grid. In this paper, we present preliminary considerations concerning multiple equivalent simultaneous offers strategy that can be used in the Service Level Agreement (SLA) negotiations. These negotiations are the key part of the main use case scenarios within the AiG project. In this context, first, we describe the AiG system. Second, we introduce the simultaneous offer strategy, as a mechanism known from economy, and suggest an approach for using it in the AiG negotiations. [ABSTRACT FROM AUTHOR]},
	keywords = {agent-based negotiations, AiG, Computational grids (Computer systems), Economics {\textendash} Study \& teaching, Gateways (Computer networks), Grid computing, multi-attribute negotiations, multiple equivalent simultaneous offers, Service level agreements, SLA, Social psychology {\textendash} Study \& teaching},
	issn = {18951767},
	url = {http://search.ebscohost.com/login.aspx?direct=true\&db=iih\&AN=93425279\&site=ehost-live},
	author = {Attaoui, Naoual and Ganzha, Maria and Paprzycki, Marcin and Wasielewska, Katarzyna and Essaaidi, Mohammad}
}
@article {5938723720101201,
	title = {REPUTATION-BASED MAJORITY VOTING FOR MALICIOUS GRID RESOURCES TOLERANCE.},
	journal = {Scalable Computing: Practice \& Experience},
	volume = {11},
	number = {4},
	year = {2010},
	pages = {385 - 392},
	abstract = {Recently, distributed computing infrastructures such as grid computing, have witnessed huge developments which have a very important impact on computationally intensive scientific, industrial and engineering problems. Collaborative computing, resources access and sharing facilitated by grid computing systems amplifies concerns about cyber attacks and misbehaviors of grid resources (resources provider). In many cases, an organization may send out jobs for remote execution on untrustworthy machines. Since resource sharing and cooperation among different administrative domains are among the central goals of grid computing, it is necessary to guarantee that, among the shared resources, there are no malicious resources interested in invalidating or corrupting the job results. In order to guarantee reliable jobs execution in grid systems, we have developed a new approach for malicious grid resources tolerance using reputation to improve the efficiency of majority voting mechanisms. The grid},
	keywords = {Computational grids (Computer systems), Distributed computing, Grid computing, Internet service providers, majority voting, malicious resources, Plurality voting, reputation, Service level agreements, tolerance, Web services},
	issn = {18951767},
	url = {http://search.ebscohost.com/login.aspx?direct=true\&db=iih\&AN=59387237\&site=ehost-live},
	author = {Bendahmane, Ahmed and Essaaidi, Mohammad and El Moussaoui, Ahmed and Younes, Ali}
}
