Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Adaptive demand-driven multicast routing in multi-hop wireless ad hoc networks
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Small Group Multicast: A New Solution for Multicasting on the Internet
IEEE Internet Computing
Making Peer Databases Interact - A Vision for an Architecture Supporting Data Coordination
CIA '02 Proceedings of the 6th International Workshop on Cooperative Information Agents VI
The Node Distribution of the Random Waypoint Mobility Model for Wireless Ad Hoc Networks
IEEE Transactions on Mobile Computing
The Piazza peer data management project
ACM SIGMOD Record
The hyperion project: from data integration to data coordination
ACM SIGMOD Record
Topology properties of Ad hoc networks with random waypoint mobility
ACM SIGMOBILE Mobile Computing and Communications Review
Mercury: supporting scalable multi-attribute range queries
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Modeling mobility for vehicular ad-hoc networks
Proceedings of the 1st ACM international workshop on Vehicular ad hoc networks
Ekta: An Efficient DHT Substrate for Distributed Applications in Mobile Ad Hoc Networks
WMCSA '04 Proceedings of the Sixth IEEE Workshop on Mobile Computing Systems and Applications
A survey of peer-to-peer content distribution technologies
ACM Computing Surveys (CSUR)
Data management in the CarTel mobile sensor computing system
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
IEEE/ACM Transactions on Networking (TON)
Search-and-Discover in Mobile P2P Network Databases
ICDCS '06 Proceedings of the 26th IEEE International Conference on Distributed Computing Systems
Exploiting the synergy between peer-to-peer and mobile ad hoc networks
HOTOS'03 Proceedings of the 9th conference on Hot Topics in Operating Systems - Volume 9
Querying the internet with PIER
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
CoWSAMI: Interface-aware context gathering in ambient intelligence environments
Pervasive and Mobile Computing
Just-in-time query retrieval over partially indexed data on structured P2P overlays
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Energy Consumption Analysis of WLAN, 2G and 3G interfaces
GREENCOM-CPSCOM '10 Proceedings of the 2010 IEEE/ACM Int'l Conference on Green Computing and Communications & Int'l Conference on Cyber, Physical and Social Computing
Data management in mobile peer-to-peer networks
DBISP2P'04 Proceedings of the Second international conference on Databases, Information Systems, and Peer-to-Peer Computing
| Hi-index | 0.00 |
The widespread of mobile ad hoc networking calls for a careful design of network functions in order to meet the application requirements and economize on the limited resources. In this paper we address the problem of distributing query messages among peers in mobile ad hoc networks. We assume that peers are organized in classes. Each peer possesses a local database and can answer queries posed by other peers. Each peer can also pose queries to all the peers belonging to a certain class or classes. Contrary to traditional p2p lookup queries, we are interested in collecting answers from as many peers as possible. We propose a query routing protocol, called CL-QF, which is based on a novel cross-layer design. The purpose of this design is to incorporate application layer specifics (e.g., class information) into the network layer in order to reduce transmissions therefore economize on resources. CL-QF coexists with traditional routing. This synergy minimizes the complexity and signaling of CL-QF while the network is able to seamlessly provide legacy unicast communication. CL-QF manages a reduction of up to ~78% compared to non-cross-layer approaches, such as probabilistic forwarding, without compromising the ability to effectively collect replies.