IEEE Transactions on Software Engineering
Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
Routing with guaranteed delivery in ad hoc wireless networks
Wireless Networks
Search and replication in unstructured peer-to-peer networks
ICS '02 Proceedings of the 16th international conference on Supercomputing
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Request Algorithms in Freenet-Style Peer-to-Peer Systems
P2P '02 Proceedings of the Second International Conference on Peer-to-Peer Computing
Information-directed routing in ad hoc sensor networks
WSNA '03 Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications
Should we build Gnutella on a structured overlay?
ACM SIGCOMM Computer Communication Review
Modeling and performance analysis of BitTorrent-like peer-to-peer networks
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Replication for web hosting systems
ACM Computing Surveys (CSUR)
Replication for web hosting systems
ACM Computing Surveys (CSUR)
Location Awareness in Unstructured Peer-to-Peer Systems
IEEE Transactions on Parallel and Distributed Systems
Using the small-world model to improve Freenet performance
Computer Networks: The International Journal of Computer and Telecommunications Networking
Heterogeneous Search in Unstructured Peer-to-Peer Networks
IEEE Distributed Systems Online
DIN '05 Proceedings of the 1st ACM workshop on Dynamic interconnection of networks
On-demand content delivery in vehicular wireless networks
MSWiM '05 Proceedings of the 8th ACM international symposium on Modeling, analysis and simulation of wireless and mobile systems
Content-aware search of multimedia data in ad hoc networks
MSWiM '05 Proceedings of the 8th ACM international symposium on Modeling, analysis and simulation of wireless and mobile systems
Insight and perspectives for content delivery networks
Communications of the ACM - Personal information management
Multiple co-existing grouping overlays
Proceedings of the second workshop on Use of P2P, GRID and agents for the development of content networks
An architecture for virtual organization (VO)-based effective peering of content delivery networks
Proceedings of the second workshop on Use of P2P, GRID and agents for the development of content networks
Urban Computing and Mobile Devices
IEEE Distributed Systems Online
Autonomic job scheduling policy for grid computing
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part III
Context delivery in ad hoc networks using enhanced gossiping algorithms
EuroSSC'06 Proceedings of the First European conference on Smart Sensing and Context
A survey and comparison of peer-to-peer overlay network schemes
IEEE Communications Surveys & Tutorials
The organic grid: self-organizing computation on a peer-to-peer network
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
| Hi-index | 0.00 |
This paper gives two contributions; First, it presents an architecture for customized content delivery for Ambient Intelligent Environments. We demonstrate how physical peers made up of a Bluetooth-based network of Java-enabled mobile phones can be used to provide customized content delivery from the web without the need of a dedicated web connection per device. Secondly, we present two algorithms Self-OrganiziNG random walkerS (SONGS) and peer-to-peeR self-organIZed tEmporary overlayS (PRIZES), both providing mechanisms of temporary overlay formation in limited connectivity ad-hoc networks. SONGS is an extension of k-random walk algorithm whereas PRIZES is a forest-fire type flooding mechanism. We then show how adding even naive self-organization to these algorithms significantly improves the leftover queries as well as latency in terms of hop-counts.