Jean-Christophe Laneri is a master student from the Royal Institute of Technology in Stockholm, in electrical engineering, with specialization in Wireless Systems. He is also finishing a M.Sc. in computer science from the French engineering school ESIEA. His interests vary from evolutionary programming to computer languages and operational research to also signal processing, remote sensing, and wireless networks. He is an associate editor of the student journal of the Association for Computing Machinery (ACM), Crossroads. He participated twice in the ACM International Collegiate Programming Contest (ICPC) and once in the ACM Student Research competition. Starting in September, he will do his thesis in a research & development department in the wireless networks domain.
Project: Simulating Wireless Sensor Networks
A wireless sensor network (WSN) is a special kind of ad-hoc network where all the nodes can sense, actuate and communicate with each other using point-to-point multihop communication. WSNs are used in a wide range of applications, such as environmental monitoring and tactical surveillance. Such networks are characterized by a limited power source. An optimal planning (what to “turn on/off”) would require the computation of the minimum set of sensors needed for the given coverage constraint at each time instant: this is the so-called topology control problem (TCP). In this project, we model WSNs as cellular automata, and perform an NKS search on different sets of transition rules. Results show that the NKS approach to the problem appears to be very efficient in improving the longevity of the network, performing better than previous works.
Favorite Four-Color, Nearest-Neighbor, Totalistic Rule
Rule chosen: 10259