Cross-layer routing for peer database querying over mobile ad hoc networks
| dc.contributor.author | Papapetrou, E. | en |
| dc.contributor.author | Vassiliadis, P. | en |
| dc.contributor.author | Rova, E. | en |
| dc.contributor.author | Zarras, A. | en |
| dc.date.accessioned | 2015-11-24T17:02:45Z | |
| dc.date.available | 2015-11-24T17:02:45Z | |
| dc.identifier.issn | 1389-1286 | - |
| dc.identifier.uri | https://olympias.lib.uoi.gr/jspui/handle/123456789/11090 | |
| dc.rights | Default Licence | - |
| dc.subject | mobile communication systems | en |
| dc.subject | routing protocols | en |
| dc.subject | wireless communication | en |
| dc.subject | distributed applications | en |
| dc.subject | databases | en |
| dc.subject | project | en |
| dc.title | Cross-layer routing for peer database querying over mobile ad hoc networks | en |
| heal.abstract | 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 similar to 78% compared to non-cross-layer approaches, such as probabilistic forwarding, without compromising the ability to effectively collect replies. (C) 2011 Elsevier B.V. All rights reserved. | en |
| heal.access | campus | - |
| heal.fullTextAvailability | TRUE | - |
| heal.identifier.primary | DOI 10.1016/j.comnet.2011.10.004 | - |
| heal.journalName | Computer Networks | en |
| heal.journalType | peer reviewed | - |
| heal.language | en | - |
| heal.publicationDate | 2012 | - |
| heal.recordProvider | Πανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μηχανικών Ηλεκτρονικών Υπολογιστών και Πληροφορικής | el |
| heal.type | journalArticle | - |
| heal.type.el | Άρθρο Περιοδικού | el |
| heal.type.en | Journal article | en |
Αρχεία
Φάκελος/Πακέτο αδειών
1 - 1 of 1
Φόρτωση...
- Ονομα:
- license.txt
- Μέγεθος:
- 1.74 KB
- Μορφότυπο:
- Item-specific license agreed upon to submission
- Περιγραφή: