A Search-based Network Architecture for Mobile Devices

Nordstrom, Gunningberg, Rohner

manet adhoc p2p gossip network haggle mobile dissemination

@techreport{nordstrom:uppsala-2009,
  author={Erik Nordstr{\"o}m and Per Gunningberg and Christian Rohner},
  title={A Search-based Network Architecture for Mobile Devices},
  institution={Department of Information Technology, Uppsala University},
  department={Division of Computer Systems},
  year={2009},
  number={2009-003},
  month={January}
}

"complete architecture framework for naming and address- ing, device discovery, resource management, persistent data storage and more"

"communication abstraction layer that hides a lot of the details of when, where, how, and to whom data is transmitted"

"an application needs no connectivity to re- ceivers and may not even know their identities, or the network interface technology eventually used to com- municate. Such temporal and spatial decouplings are widely argued as a corner-stone of a modern communi- cation architecture [6]."

"A novelty of this approach is that the match- ing between data and receivers is not binary---a top ranked match is the best only relative to lower ranked ones. Each device can hence limit the amount of dis- seminated data to only the top ranked nodes with the most interest in the data. In contrast, other approaches to dissemination uses binary matching filters or topic channels [7, 13] that are static and lack relative match- ing and ranking."

"Connections [15] enhances basic attribute-based file searching by building temporal relations between files. These relations are built when files are accessed on the filesystem in the same time slot. The relations then structure the files in a relation graph according to Fig- ure 1. The strength of a relation is based on how many times a pair of files have been accessed simultaneously. Thus, a file that matches badly a search query may be highly ranked due to its relation to a file that matches well. "

"A key addition is that both data holders (e.g., devices) and the data itself may be repre- sented in the same namespace and this allows them to build relations between each other in the relation graph."

"Pub/sub systems either disseminate based on exact matching filters [5], or channels of topics [13]. In contrast, Haggle uses filters only for local demultiplex- ing of data to applications, and instead uses search- ing with ranking for disseminations."

"late binding"