Learn More
In next generation communication networks, multiple access networks will coexist on a common service platform. In cases where network resource planning indicates that individual access network resources are insufficient to meet service demands, these networks can cooperate and combine their resources to form a unified network that satisfies these demands.(More)
This paper explores how the degree of similarity within a social group can dictate the behavior of the individual nodes, so as to best tradeoff the individual with the social benefit. More specifically, we investigate the impact of social similarity on the effectiveness of content placement and dissemination. We consider three schemes that represent well(More)
Social groups are typically formed by nodes that share common interests (interest-induced social groups), with no implication on the geographic location of these nodes. In addition to such groups, mobile nodes form groups also as they move around and come to a locality where they can establish communication with other nodes (locality-induced social groups).(More)
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(More)
This paper proposes a framework for node clustering in computerized social networks according to common interests. Communities in such networks are mainly formed by user selection, which may be based on various factors such as acquaintance, social status, educational background. However, such selection may result in groups that have a low degree of(More)
—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. Mobile nodes usually belong to different classes, and are thus interested in different subsets of sensor node information. In such(More)
—This paper explores how the degree of similarity within a social group can be exploited in order to dictate the behavior of the individual nodes, so as to best accommodate the typically non-coinciding individual and social benefit maxi-mization. More specifically, this paper investigates the impact of social similarity on the effectiveness of content(More)
This paper presents a rigorous analytic study of gossip-based message dissemination schemes that can be employed for content/service dissemination or discovery in unstructured and distributed networks. When using random gossiping, communication with multiple peers in one gossiping round is allowed. The algorithms studied in this paper are considered under(More)
Micro-blogging services have recently been experiencing increasing success among Web users. Different to traditional online social applications, micro-blogs are lightweight, require small cognitive effort and help share real-time information about personal activities and interests. In this article we explore scalable pushing protocols that are particularly(More)