loading...
An Algorithm for a Constraint Optimization Problem in Mobile Ad-hoc Networks
Arlington, Virginia November 13-November 15
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICTAI.2006.2918th IEEE International Conference on ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Abdellah Idrissi, Universite de Picardie, France
Chu Min Li, Universite de Picardie, France
Jean Frederic Myoupo, Universite de Picardie, France
A mobile ad-hoc network is considered as a dynamic autonomous system composed of mobile devices interconnected by links without wire, without the use of a fixed infrastructure and without centralized administration. The absence of a centralized infrastructure forces each device to work in a peer to peer distributed environment, and to act as a router to relay communications, or to generate its own data. The management of the network thus is strongly distributed on all elements of the network. In this paper, we present a modelling of the Mobile Ad-hoc NETwork (MANET) problem in form of a Constraint Satisfaction/ Optimization Problem called CSPADhoc. Then, to minimize the consumption of batteries for devices, we describe an approach based on an adaptation of the A star algorithm to the MANET problem called (MANET-Astar). Finally, we present some experimental results using our approach.
Citation:
Abdellah Idrissi, Chu Min Li, Jean Frederic Myoupo, "An Algorithm for a Constraint Optimization Problem in Mobile Ad-hoc Networks," ictai, pp.555-562, 18th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.