@conference {
	title = {Synchronization and Collision Avoidance in Non-Linear Flocking Networks of Autonomous Agents},
	author = {Somarakis, Christoforos., Paraskevas, Evripidis., Baras, John S., Motee, Nader.},
	year = {2016},
	month = {07/2016},
	abstract = {We introduce and discuss two novel second-order consensus networks with state-dependent couplings of CuckerSmale type. The first scheme models flocking to synchronization over a network of agents where the alignment of the agent{\textquoteright}s states occurs over a non-trivial limit orbit that is generated by the internal dynamics of each individual agent. The second scheme models the speed alignment of a group of agents which avoid approaching each other closer than a prescribed distance. While seemingly different, both of these systems can be analyzed using the same mathematical methods. We rigorously analyze both examples and reveal their striking similarities. We arrive at sufficient conditions that relate the initial configurations and the systems{\textquoteright} parameters that give rise to a collective common behavior. Simulation examples are presented to support our theoretical conclusions},
	address = {Athens, Greece},
	booktitle = {24th Mediterranean Conference on Control and Automation},
	pages = {pp. 1089-1094}
}
@conference {
	title = {Distributed Energy-Aware Mobile Sensor Coverage Game with Inter-Agent Communication},
	author = {Paraskevas, Evripidis., Maity, Dipankar., Baras, John S.},
	year = {2016},
	month = {07/2016},
	abstract = {Mobile Sensor Networks (MSN) are used to monitor large areas and collect measurements, e.g. temperature, humidity, or pressure data. Mobile sensors try to optimize their benefit from sensing a particular area, while keeping their energy consumption at the lowest possible level. We formulate this energy-aware sensor coverage problem as a potential game, where the mobile sensor nodes are considered as agents. The utility function of the game captures the trade-off between the benefit from coverage and the energy consumption. We also propose a distributed learning strategy for this potential game. The algorithm enables a bit-valued information exchange between the agents. Finally, it is proved that the learning rule converges to a Nash Equilibrium.},
	address = {Boston, Massachusetts},
	booktitle = {2016 American Control Conference},
	pages = {pp. 6259-6264}
}
@conference {
	title = {Trust-Aware Network Utility Optimization in Multihop Wireless Networks with Delay Constraints},
	author = {Paraskevas, Evripidis., Jiang, Tao., Purkayastha, Punyaslok., Baras, John S.},
	year = {2016},
	month = {06/2016},
	abstract = {Many resource allocation problems can be formulated as a constrained maximization of a utility function. Network Utility Maximization (NUM) applies optimization techniques to achieve decomposition by duality or the primal dual method. Several important problems, for example, joint source rate control, routing, and scheduling design, can be optimized by using this framework. In this work, we introduce an important network security concept, {\textquotedblleft}trust{\textquotedblright}, into the NUM formulation and we integrate nodes{\textquoteright} trust values in the optimization framework. These trust values are based on the interaction history between network entities and community-based monitoring. Our objective is to avoid routing packets through paths with large percentage of malicious nodes. We also add end-to-end delay constraints for each of the traffic flows. The delay constraints are introduced to capture the imposed quality of service (QoS) requirements for each traffic flow.},
	address = {Athens, Greece},
	booktitle = {24th Mediterranean Conference on Control and Automation},
	pages = {pp. 593-598}
}
