Abstract
Mesh networking has recently received considerable attention, largely as a mechanism for providing enhanced connectivity without the need to install additional expensive infrastructure. It relies on the fact that underutilised local area connectivity can be used to connect constrained devices to those that possess wide-area uplink capabilities. However, at present, proposals for uplink bandwidth sharing are limited by the use of a traditional view of routing in which multiple end-user devices are associated with each individual uplink in such a way that all their off-network traffic is routed through that particular gateway. While this has the merit of simplicity, it is possible for a subset of gateways to be overloaded while others remain underutilised. We propose a new type of local mesh network, called the Coalition Peering Domain, the goal of which is to maximise Internet connectivity dynamically, smoothing out the usage of uplink capacity, albeit at the cost of slightly more complex control and management. Within this paper, we describe three main routing and addressing issues and then propose novel mechanisms that partially address those issues.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
SAFECOM Statement of Requirements — http://www.safecom program.gov/NR/rdonlyres/A1118073-1B21-42DC-941F-C9DB 26F4DBEF/0/PSCI_Statement_of_Requirements_v1_0.pdf
Project MESA Statement of Requirements — http://www.projectmesa.org/MESA-SoR/SoR.htm
Lad M, Bhatti S, Hailes S and Kirstein P: ’Enabling Coalition-Based Community Networking’, in Proceedings of the London Communications Symposium, London, UK (September 2005).
Lad M, Bhatti S, Kirstein P and Hailes S: ’Challenges, Opportunities and Incentives for Coalition-Based Community Networking’, in Technical Research Note Number RN/05/08, University College London, London, UK (June 2005).
Quercia D, Lad M, Hailes S, Capra L and Bhatti S: ’STRUDEL: Supporting Trust in the Dynamic Establishment of peering coalitions’, in Proceedings of the 21st ACM Symposium on Applied Computing, Dijon, France (April 2006).
Yau P W and Mitchell C J: ’2HARP: A secure routing protocol to detect failed and selfish nodes in mobile ad hoc networks’, in Proceedings of the 5th World Wireless Congress, pp 1–6, San Franciso, USA (2004).
Quercia D, Hailes S and Capra L: ’B-trust: Bayesian Trust Framework for Pervasive Computing’, in Proceedings of the 4th International Conference on Trust Management, LNCS, Pisa, Italy (May 2006).
Quercia D and Hailes S: ’Risk Aware Decision Framework for Trusted Mobile Interactions’, in Proceedings of the 1st IEEE/ CreateNet International Workshop on The Value of Security through Collaboration, Athens, Greece (September 2005).
Quercia D and Hailes S: ’MATE: Mobility and Adaptation with Trust and Expected-utility’, International Journal of Internet Technology and Secured Transactions, 1 (2007).
Quercia D, Hailes S and Capra L: ’TATA: Towards Anonymous Trusted Authentication’, in Proceedings of the 4th International Conference on Trust Management, LNCS, Pisa, Italy (May 2006).
Aura T: ’Cryptographically Generated Addresses (CGA)’, in Proceedings of the 6th LNCS International Conference on Information Security, pp 29–43, Bristol, UK (2003).
Arai M, Chiba A and Iwasaki K: ’Measurement and modeling of burst packet losses in Internet end-to-end communications’, in Proceedings of the IEEE International Symposium on Dependable Computing, pp 260–267, Hong Kong (1999).
Carbone M, Nielsen M and Sassone V: ’A Formal Model for Trust in Dynamic Networks’, in Proceedings of the 1st IEEE International Conference on Software Engineering and Formal Methods, pp 54–63, Brisbane, Australia (September 2003).
Marsh S: ’Formalising Trust as a Computational Concept’, PhD Thesis, Department of Mathematics and Computer Science, University of Stirling (1994).
Abdul-Rahman A and Hailes S: ’Supporting Trust in Virtual Communities’, in Proceedings of the 33rd IEEE Hawaii International Conference on System Sciences, 6, p 6007, Washington DC, USA (2000).
Abdul-Rahman A and Hailes S: ’Using Recommendations for Managing Trust in Distributed Systems’, in Proceedings of IEEE Malaysia International Conference on Communication, Kuala Lumpur, Malaysia (November 1997).
Mui L, Mohtsahemi M, Ang C, Szolovits P and Halberstadt A: ’Ratings in Distributed Systems: A Bayesian Approach’, in Proceedings of the 11th Workshop on Information Technologies and Systems, New Orleans, Louisiana, USA (December 2001).
Buchegger S and Boudec J-Y L: ’A robust reputation system for p2p and mobile ad-hoc networks’, in Proceedings of the 2nd Workshop on the Economics of Peer-to-Peer Systems, Cambridge, MA, USA (June 2004).
Dimmock N: ’How much is ‘enough’? Risk in Trust-based Access Control’, in Proceedings of the 12th IEEE International Workshop on Enabling Technologies, pp 281, Washington, DC, USA (June 2003).
Zhu D and Mutka M W: ’Promoting Cooperation Among Strangers to Access Internet Services from an Ad Hoc Network’, in Proceedings of the 12th IEEE International Conference on Pervasive Computing and Communications, pp 229–240, Orlando, FL, USA (March 2004).
Papadopouli M and Schulzrinne H: ’Connection Sharing in an Ad Hoc Wireless Network among Collaborating Hosts’, in Proceedings of the International Workshop on Network and Operating System Support for Digital Audio and Video (NOSSDAV), pp 169–185 (June 1999).
Champaign-Urbana Community Wireless Network — http://www.cuwireless.net/
Rodriguez P, Chakravorty R, Chesterfield J, Pratt I and Banerjee S: ’MAR: A Commuter Router Infrastructure for the Mobile Internet’, in MobiSYS ’04: Proceedings of the 2nd international conference on Mobile systems, applications, and services, pp 217–230, ACM Press (2004).
About this article
Cite this article
Quercia, D., Lad, M., Hailes, S. et al. Survivable wireless networking — Autonomic bandwidth sharing in mesh networks. BT Technol J 24, 99–107 (2006). https://doi.org/10.1007/s10550-006-0081-2
Issue Date:
DOI: https://doi.org/10.1007/s10550-006-0081-2