Eva Jaho - Publications

E.Jaho, E.Tzoannos, A.Papadopoulos, N.Sarris, "Alethiometer: a Framework for Assessing Trustworthiness", International World Wide Web Conference Committee (IW3C2), Seoul, Korea, April 7-11, 2014 [link]
E. Jaho, V. Koutsiouris, E.Argyzoudis, R.Brown, "Moving around in Smart Cities: Developing Efficient Mobile Services using Open Data", Hybrid City 2013: Subtle rEvolutions, 2nd International Biennial Conference, Athens, Greece, 23-25 May, 2013 [link]
E. Jaho, M. Karaliopoulos, I. Stavrakakis, "Social Similarity favors Cooperation: the Content Placement Case", Transaction on Parallel and Distributed Systems, TPDS, Vol. 24, No. 3, pp: 601-613, March 2013 [link]
E. Jaho, I. Koukoutsidis, I. Stavrakakis, I. Jaho, “Cooperative Content Replication in Networks with Autonomous Nodes”, Computer Communications, Elsevier, Vol. 35, No. 5, pp: 637-647, March 2012 [link]
S. Allen, M. Chorley, G. Colombo, E Jaho, M. Karaliopoulos, I. Stavrakakis, R. Whitaker, “Exploiting User Interest Similarity and Social Links for Micro-blog Forwarding in Mobile Opportunistic Networks”, Pervasive and Mobile Computing, Elsevier, 2011 [link]
M. Karaliopoulos, P. Pantazopoulos, E. Jaho, I. Stavrakakis, “Trace-driven Analysis of Data Forwarding in Opportunistic Networks”, second conference on the Analysis of Mobile Phone Datasets and Networks (NetMob 2011), pp: 60-62, MIT (Media Lab), Cambridge, MA, USA, October 10-11, 2011 [link]
S. Tang, E. Jaho, I. Stavrakakis, I. Koukoutsidis, P. Van Mieghem, “Modeling Gossip-based Content Propagation and Search in Distributed P2P Overlay”, Computer Communications Journal, Vol. 34, No. 6, pp: 765-779, May 2011 [link]
E. Jaho, M. Karaliopoulos, I. Stavrakakis, “IsCoDe: a Framework for Interest Similarity-based Community Detection in Social Networks”, Third International Workshop on Network Science for Communication Networks, NetSciCom 2011, Shanghai China, 15 April 2011 [link]

E. Jaho, M. Karaliopoulos, I. Stavrakakis, “Social Similarity as a Driver for Selfish, Cooperative and Altruistic Behavior”, Fourth International IEEE WoWMoM Workshop on Autonomic and Opportunistic Communications, AOC 2010, Montreal/QC Canada, 14 June 2010 [link]

J. Antoniou, I. Koukoutsidis, E. Jaho, A. Pitsillides, I. Stavrakakis, “Access Network Synthesis Game in Next Generation Networks”, Computer Networks, vol. 53, no. 15, pp. 2716-2726, October 2009, Elsevier [link]
E. Jaho, I. Stavrakakis, “Joint Interest- and Locality-Aware Content Dissemination in Social Networks”, Sixth Annual Conference on Wireless On demand Network Systems and Services, IFIP/IEEE WONS 2009, Snowbird, Utah, USA, February 2-4, 2009 [link]

R. Cuevas, E. Jaho, C. Guerrero, I. Stavrakakis, “OnMove: A Protocol for Content Distribution in Wireless Delay Tolerant Networks based on Social Information”, ACM CoNEXT 2008 Student Workshop, Madrid, Spain, December 9th, 2008 [link]
E. Jaho, I. Koukoutsidis, I. Stavrakakis, I. Jaho, "Cooperative Replication in Content Networks with Nodes under Churn", IFIP Networking 2008, Singapore, May 2008 [link]
I. Koukoutsidis, E. Jaho, I. Stavrakakis, “Cooperative Content Retrieval in Nomadic Sensor Networks”, IEEE Infocom MOVE Workshop, April 2008 [link]

E. Jaho, I. Jaho, I. Stavrakakis, “Distributed Selfish Replication under Node Churn”, poster session, MED-HOC-NET'07, Corfu, Greece, June 13-15, 2007 [link]

• Some Presentations

"OnMove: A Protocol for Content Distribution in Wireless Delay Tolerant Networks based on Social Information", Content (EU project) Plenary Meeting, Universite Pierre et Marie Curie - Paris 06, Paris, France, October 16th, 2008 [ppt]

A general abstract of the talk:
We present OnMove, a protocol for content distribution in wireless delay tolerant networks for use by handheld devices. To improve content distribution, OnMove exploits social characteristics (social similarities and physical encounters) between individuals. We motivate the problem and describe a content sharing protocol based on a ranking algorithm that exploits the social and networking characteristics of individuals.
"Tutorial on Evolution of Networks", Dept. Informatics and Telecommunications, National and Kapodistrian University of Athens, February 14th, 2008 [ppt]

A general abstract of the talk:
A nomadic sensor network consists of: a) sensor nodes, that are fixed at some points and collect information about states or variables of the environment, and b) mobile nodes that collect and disseminate this information. In such networks, dissemination of information content at smaller costs can be achieved if mobile nodes are cooperative and collect and carry information not only in their own interest, but also in the interest of other mobile nodes. A specific modeling scenario is considered where the network has the form of a graph; sensor nodes are located on the vertices of the graph and U-nodes move along the edges according to a random waypoint model. We present a game-theoretic analysis to find conditions under which a cooperative equilibrium can be sustained.
"Distributed Selfish Replication under Node Churn", Dept. Informatics and Telecommunications, National and Kapodistrian University of Athens, October 25th, 2007 [ppt]

A general abstract of the talk: In a replication group where a cooperative algorithm may be applied to increase the social benefit so that nodes rely on other nodes to retrieve information objects, churn (changes in the set of participating nodes due to random join and leave events) induces instability and has a major impact on cooperation efficiency. It may lead to mistreatment problems, where some nodes benefit more at the expense of others, in which case it may be better for the mistreated nodes to act in isolation. We propose a distributed churn-aware object placement algorithm. We show that generally it has better performance than its churn unaware counterpart, increases fairness and incites all nodes to cooperate with each other.