The aim is to build and run simulations of a "Spray and Wait" and "Spray and Focus" protocol in ONE simulator and identify forwarding overheads, delays and success ratios for different application scenarios. Students will have access to animal and human data traces that include GPS coordinates, cnnectivity traces and Facebook traces. These traces will serve as an input to the ONE simulator that will be able to log "Apray and Wait" and "Spray and Focus" related parameters. A basic version of a these protocols is available together with the ONE simulator.
The aim it to design and build K-ananymity protocol on the top of the routing protocosl in Mobile Ad Hoc Wireless Networks. The simulator NS-2 (or for more challanged scenariosn with disconnections simulator ONE) should be used. Real or pseudo real data traces and map based driven experiments should be done with the data sets that will be provided. The students are expected to consider delays and success rations for different levels of K-anonymity.
The aim is to build and run simulations of a DSR and AODV routing protocols in NS-2 simulator and identify routing overheads and success ratio for different application scenarios. Students will have access to animal and human data traces that include GPS coordinates, pedometar data, connectivity data and medical profiles. These traces will serve as an input to the NS-2 simulator that will be able to log DSR related parameters. A basic version of a DSR protocol is available together with the NS-2 simulator.
The aim is to build simulations of Mobile Ad hhoc networks where some of the nodes are compromised or malfunctioning. For example, a node might be dropping all or some of the packets before forwarding. Other nodes should be able to idnetify such nodes and isolate them from the network. The students are expected to use any of the available mobile ad hoc routing protcols, NS-2 simulator and will have access to real animal or human data traces available in the public wireless networking repositories.
The aim is to build a P2P system where each node is able to claim certain trustworthiness of other nodes. The reputation system is to be modelled where an objective measure of trust should be achieved based on fully distributed trust claims. Nodes should be able to monitor any aspect of behavior of neighboring nodes such as: routing queries, asnwering queries, malfunctioning, storage and network characteristics. When anomalies in observed, actual or reported behavior are detected. nodes resolve and update trust levels based on localised voting.
The aim is to build an Blutooth aplication of mobile phones that is capable of locating a lost object (that is also Bluetooth capable) The phones should be able to keep track of recently detected Blutooth devices and know the blutooth ID of the lost obejct.
The aim is to build and test a multiuser Poker game for mobile phones. The users should be able to see their cards but not opponents'. Each hand should be carefuly schuffeled by the server to avoid predictable card behaviour. User interface can keep history of scores and rankings in addition to the cards views views/ If some nodes get temporarily disconnected other nodes are supposed to continue the game without the disconnected node.