Architectural Considerations for a Self-Configuring Routing Scheme for Spontaneous Networks

Decoupling the permanent identifier of a node from the node's topology-dependent address is a promising approach toward completely scalable self-organizing networks. A group of proposals that have adopted such an approach use the same structure to: address nodes, perform routing, and implement location service. In this way, the consistency of the routing protocol relies on the coherent sharing of the addressing space among all nodes in the network. Such proposals use a logical tree-like structure where routes in this space correspond to routes in the physical level. The advantage of tree-like spaces is that it allows for simple address assignment and management. Nevertheless, it has low route selection flexibility, which results in low routing performance and poor resilience to failures. In this paper, we propose to increase the number of paths using incomplete hypercubes. The design of more complex structures, like multi-dimensional Cartesian spaces, improves the resilience and routing performance due to the flexibility in route selection. We present a framework for using hypercubes to implement indirect routing. This framework allows to give a solution adapted to the dynamics of the network, providing a proactive and reactive routing protocols, our major contributions. We show that, contrary to traditional approaches, our proposal supports more dynamic networks and is more robust to node failures

On Reliability of Dynamic Addressing Routing Protocols in Mobile Ad Hoc Networks

In this paper, a reliability analysis is carried out to state a performance comparison between two recently proposed proactive routing algorithms. These protocols are able to scale in ad hoc and sensor networks by resorting to dynamic addressing, to face with the topology variability, which is typical of ad hoc, and sensor networks. Numerical simulations are also carried out to corroborate the results of the analysis.Comment: Proc. of WRECOM '07: Wireless Rural and Emergency Communications Conference, Roma (Italy), October 200

Augmented Tree-based Routing Protocol for Scalable Ad Hoc Networks

In ad hoc networks scalability is a critical requirement if these technologies have to reach their full potential. Most of the proposed routing protocols do not operate efficiently with networks of more than a few hundred nodes. In this paper, we propose an augmented tree-based address space structure and a hierarchical multi-path routing protocol, referred to as Augmented Tree-based Routing (ATR), which utilizes such a structure in order to solve the scalability problem and to gain good resilience against node failure/mobility and link congestion/instability. Simulation results and performance comparisons with existing protocols substantiate the effectiveness of the ATR.Comment: Routing, mobile ad hoc network, MANET, dynamic addressing, multi-path, distributed hash table, DH

Cross-layer Peer-to-Peer Computing in Mobile Ad Hoc Networks

The future information society is expected to rely heavily on wireless technology. Mobile access to the Internet is steadily gaining ground, and could easily end up exceeding the number of connections from the fixed infrastructure. Picking just one example, ad hoc networking is a new paradigm of wireless communication for mobile devices. Initially, ad hoc networking targeted at military applications as well as stretching the access to the Internet beyond one wireless hop. As a matter of fact, it is now expected to be employed in a variety of civilian applications. For this reason, the issue of how to make these systems working efficiently keeps the ad hoc research community active on topics ranging from wireless technologies to networking and application systems. In contrast to traditional wire-line and wireless networks, ad hoc networks are expected to operate in an environment in which some or all the nodes are mobile, and might suddenly disappear from, or show up in, the network. The lack of any centralized point, leads to the necessity of distributing application services and responsibilities to all available nodes in the network, making the task of developing and deploying application a hard task, and highlighting the necessity of suitable middleware platforms. This thesis studies the properties and performance of peer-to-peer overlay management algorithms, employing them as communication layers in data sharing oriented middleware platforms. The work primarily develops from the observation that efficient overlays have to be aware of the physical network topology, in order to reduce (or avoid) negative impacts of application layer traffic on the network functioning. We argue that cross-layer cooperation between overlay management algorithms and the underlying layer-3 status and protocols, represents a viable alternative to engineer effective decentralized communication layers, or eventually re-engineer existing ones to foster the interconnection of ad hoc networks with Internet infrastructures. The presented approach is twofold. Firstly, we present an innovative network stack component that supports, at an OS level, the realization of cross-layer protocol interactions. Secondly, we exploit cross-layering to optimize overlay management algorithms in unstructured, structured, and publish/subscribe platforms

Next-Generation Public Safety Systems Based on Autonomous Vehicles and Opportunistic Communications

An emergency scenario is characterized by the unpredictability of the environment conditions and by the scarcity of the available communication infrastructures. After a natural or human disaster, the main public and private infrastructures are partially damaged or totally destroyed. These infrastructures include roads, bridges, water supplies, electrical grids, telecommunications and so on. In these conditions, the first rescue operations executed by the public safety organizations can be very difficult, due to the unpredictability of the disaster area environment and the lack in the communications systems. The aim of this work is to introduce next-generation public safety systems where the main focus is the use of unmanned vehicles that are able to exploit the self-organizing characteristics of such autonomous systems. With the proposed public safety systems, a team of autonomous vehicles will be able to overcome the hazardous environments of a post disaster scenario by introducing a temporary dynamic network infrastructure which enables the first responders to cooperate and to communicate with the victims involved. Furthermore, given the pervasive penetration of smart end-user devices, the emergence of spontaneous networks could constitute promising solutions to implement emergency communication systems. With these systems the survivors will be able to self-organize in a communication network that allows them to send alerts and information messages towards the rescue teams, even in absence of communication infrastructures

Software Defined Application Delivery Networking

In this thesis we present the architecture, design, and prototype implementation details of AppFabric. AppFabric is a next generation application delivery platform for easily creating, managing and controlling massively distributed and very dynamic application deployments that may span multiple datacenters. Over the last few years, the need for more flexibility, finer control, and automatic management of large (and messy) datacenters has stimulated technologies for virtualizing the infrastructure components and placing them under software-based management and control; generically called Software-defined Infrastructure (SDI). However, current applications are not designed to leverage this dynamism and flexibility offered by SDI and they mostly depend on a mix of different techniques including manual configuration, specialized appliances (middleboxes), and (mostly) proprietary middleware solutions together with a team of extremely conscientious and talented system engineers to get their applications deployed and running. AppFabric, 1) automates the whole control and management stack of application deployment and delivery, 2) allows application architects to define logical workflows consisting of application servers, message-level middleboxes, packet-level middleboxes and network services (both, local and wide-area) composed over application-level routing policies, and 3) provides the abstraction of an application cloud that allows the application to dynamically (and automatically) expand and shrink its distributed footprint across multiple geographically distributed datacenters operated by different cloud providers. The architecture consists of a hierarchical control plane system called Lighthouse and a fully distributed data plane design (with no special hardware components such as service orchestrators, load balancers, message brokers, etc.) called OpenADN . The current implementation (under active development) consists of ~10000 lines of python and C code. AppFabric will allow applications to fully leverage the opportunities provided by modern virtualized Software-Defined Infrastructures. It will serve as the platform for deploying massively distributed, and extremely dynamic next generation application use-cases, including: Internet-of-Things/Cyber-Physical Systems: Through support for managing distributed gather-aggregate topologies common to most Internet-of-Things(IoT) and Cyber-Physical Systems(CPS) use-cases. By their very nature, IoT and CPS use cases are massively distributed and have different levels of computation and storage requirements at different locations. Also, they have variable latency requirements for their different distributed sites. Some services, such as device controllers, in an Iot/CPS application workflow may need to gather, process and forward data under near-real time constraints and hence need to be as close to the device as possible. Other services may need more computation to process aggregated data to drive long term business intelligence functions. AppFabric has been designed to provide support for such very dynamic, highly diversified and massively distributed application use-cases. Network Function Virtualization: Through support for heterogeneous workflows, application-aware networking, and network-aware application deployments, AppFabric will enable new partnerships between Application Service Providers (ASPs) and Network Service Providers (NSPs). An application workflow in AppFabric may comprise of application services, packet and message-level middleboxes, and network transport services chained together over an application-level routing substrate. The Application-level routing substrate allows policy-based service chaining where the application may specify policies for routing their application traffic over different services based on application-level content or context. Virtual worlds/multiplayer games: Through support for creating, managing and controlling dynamic and distributed application clouds needed by these applications. AppFabric allows the application to easily specify policies to dynamically grow and shrink the application\u27s footprint over different geographical sites, on-demand. Mobile Apps: Through support for extremely diversified and very dynamic application contexts typical of such applications. Also, AppFabric provides support for automatically managing massively distributed service deployment and controlling application traffic based on application-level policies. This allows mobile applications to provide the best Quality-of-Experience to its users without This thesis is the first to handle and provide a complete solution for such a complex and relevant architectural problem that is expected to touch each of our lives by enabling exciting new application use-cases that are not possible today. Also, AppFabric is a non-proprietary platform that is expected to spawn lots of innovations both in the design of the platform itself and the features it provides to applications. AppFabric still needs many iterations, both in terms of design and implementation maturity. This thesis is not the end of journey for AppFabric but rather just the beginning

Internet of things: where to be is to trust

[EN] Networks' creation is getting more and more required, anytime, anywhere. Devices that can participate on these networks can be quite different among them. Sensors, mobiles, home appliances, or other type of devices will have to collaborate to increase and improve the services provided to clients. In the same way, network configuration, security mechanisms establishment, and optimal performance control must be done by them. Some of these devices could have limited resources to work, sometimes even resources restriction not existing, they must work to optimize network traffic. In this article, we center our researching on spontaneous networks. We propose a secure spontaneous ad-hoc network, based on direct peer-to-peer interaction and communities' creation to grant a quick, easy, and secure access to users to surf the Web. Each device will have an identity in the network. Each community will also have an identity and will act as a unity on a world based on Internet connection. Security will be established in the moment they access to the network through the use of the trust chain generated by nodes. Trust is modified by each node on the basis of nodes behaviorLacuesta, R.; Palacios-Navarro, G.; Cetina Englada, C.; Peñalver Herrero, ML.; Lloret, J. (2012). Internet of things: where to be is to trust. EURASIP Journal on Wireless Communications and Networking. (203):1-16. doi:10.1186/1687-1499-2012-203S116203Lipnack J, Stamps J: Virtual Teams: Researching Across Space, Time, and Organizations with Technology. New York: John Wiley and Sons; 1997.Ahuja MK, Carley KN: Network structure in virtual organizations, organization science, Vol. 10, No. 6, Special Issue: Communication Processes for Virtual Organizations, November–December. 1999, 741-757.Mowshowitz A: Virtual organization. Commun ACM 1997, 40(9):30-37. 10.1145/260750.260759Preuß S: CH Cap, Overview of spontaneous networking-evolving concepts and technologies, in Rostocker Informatik-Berichte. Rostock: Fachbereich Informatik der Universit; 2000:113-123.Feeney LM, Ahlgren B, Westerlund A: Spontaneous networking: an application-oriented approach to ad hoc networking. IEEE Commun Mag 2001, 39(6):176-181. 10.1109/35.925687Latvakoski J, Pakkala D, Pääkkönen P: A communication architecture for spontaneous systems. IEEE Wirel Commun 2004, 11(3):36-42. 10.1109/MWC.2004.1308947Mani M, Nguyen A-M, Crespi N: SCOPE: a prototype for spontaneous P2P social networking. Proceedings of 8th IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOM Workshops) 2010, 220-225.Legendre F, de Amorim MD, Fdida S: Implicit merging of overlapping spontaneous networks. Proceedings of Vehicular Technology Conference 2004, 3050-3054.Zarate Silva VH, De Cruz Salgado EI, Ramos Quintana F: AWISPA: an awareness framework for collaborative spontaneous networks. 36th Annual Frontiers in Education Conference 2006, 27-31.Perkins CE, Bhagwat P: Highly dynamic destination sequenced distance-vector routing (DSDV) for mobile computers. Proceedings of the Conference on Communications Architectures, Protocols and Applications (SIGCOMM’94 1994, 234-244.Johnson DB, Maltz DA, Broch J: DSR: The Dynamic Source Routing Protocol for Multihop Wireless Ad Hoc Networks. Boston, MA: Ad Hoc Networking (Addison-Wesley Longman Publishing; 2001.Perkins C, Belding-Royer E, Das S: Ad hoc on-demand distance vector (AODV) routing, RFC 3561. 2003.Park V, Corson MS: IETF MANET Internet Draft “draft-ietf-MANET-tora-spe03.txt”, November 2000. 2012. Accessed March http://tools.ietf.org/html/draft-ietf-manet-tora-spec-03Viana AC, De Amorim MD, Fdida S, de Rezende JF: Self-organization in spontaneous networks: the approach of DHT-based routing protocols. Ad Hoc Networks 2005, 3(5):589-606. 10.1016/j.adhoc.2004.08.006Lacuesta R, Peñalver L: IP addresses configuration in spontaneous networks. In Proceedings of the 9th WSEAS International Conference on Computers. Athens, Greece; 2005:1-6.Alvarez-Hamelin JI, Viana AC, de Amorim M Dias: Architectural considerations for a self-configuring routing scheme for spontaneous networks, Technical Report 1. 2005.Lacuesta R, Peñalver L: Automatic configuration of ad-hoc networks: establishing unique IP link-local addresses. In Proceedings of the International Conference on Emerging Security Information, Systems and Technologies (SECURWARE’07). Valencia, Spain; 2007:157-162.Foulks EF: Social network therapies and society: an overview. Contemp Fam Therapy 1985, 3(4):316-320.IBM: A Smarter Planet. 2012. http://www.ibm.com/smarterplanetMontenegro G, Kushalnagar N, Hui J, Culler D: RFC 4944: Transmission of IPv6 Packets over IEEE 802.15.4 Networks. 2007.Alcaraz C, Najera P, Lopez J, Roman R: Wireless Sensor Networks and the Internet of Things: Do We Need a Complete Integration?, 1st International workshop on the security of The internet of Things (SecIoT). tokyo (Japan); 2010. . Accessed January 2012 1er International Workshop on the Security of The Internet of Things (SecIoT 2010) http://www.nics.uma.es/seciot10/files/pdf/alcaraz_seciot10_paper.pdfFerscha A, Davies N, Schmidt A, Streitz N: Pervasive Socio-Technical Fabric. Procedia Computer Science 2011, 7: 88-91.Hubaux JP, Buttyán L, Capkun S: The quest for security in mobile ad-hoc networks, in Proceedings of the ACM Symposium on Mobile Ad-hoc Networking and Computing. 2001, 146-155.Wang Y, Varadharajan V: Interaction trust evaluation in decentralized environments, e-commerce and web technologies. In Proceedings of 5th International Conference on Electronic Commerce and Web Technologies, vol LNCS 3182. Springer; 2004:144-153.Jimin L, Junbao L, Aiguo A, Zhenpeng L: Two-way trust evaluation based on feedback. in Conference on Logistics Systems and Intelligent Management 2010, 3: 1910-1914.Daskapan S, Nurtanti I, Van den Berg J: Trust algorithms in P2P file sharing networks. Int J Internet Technol Secured Trans 2010, 2(1–2):174-200.Maña A, Koshutanski H, Pérez EJ: A trust negotiation based security framework for service provisioning in load-balancing clusters. Comput Secur 2012, 31(1):4-25. 10.1016/j.cose.2011.11.006Stajano F, Anderson R: The resurrecting duckling security issues for ad-hoc wireless networks. Security Protocols, 7th International Workshop Proceedings, Lecture notes in Computer Science, LNCS 1296 1999, 172-194.Balfanz D, Smetters DK, Stewart P, ChiWong H: Talking to strangers: authentication in ad-hoc wireless networks, in Symposium on Network and Distributed Systems Security (NDSS’02). San Diego, CA; 2002.Capkun S, Hubaux JP, Buttyán L: Mobility helps security in ad-hoc networks. In Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing. MD, USA: Annapolis; 2003:46-56.Metzger MJ: Privacy, trust, and disclosure: exploring barriers to electronic commerce. J Comput-Mediat Commun 2004, 9(4). http://jcmc.indiana.edu/vol9/issue4/metzger.html 2004, 9(4)

A spontaneous ad hoc network to share www access

In this paper, we propose a secure spontaneous ad-hoc network, based on direct peer-to-peer interaction, to grant a quick, easy, and secure access to the users to surf the Web. The paper shows the description of our proposal, the procedure of the nodes involved in the system, the security algorithms implemented, and the designed messages. We have taken into account the security and its performance. Although some people have defined and described the main features of spontaneous ad-hoc networks, nobody has published any design and simulation until today. Spontaneous networking will enable a more natural form of wireless computing when people physically meet in the real world. We also validate the success of our proposal through several simulations and comparisons with a regular architecture, taking into account the optimization of the resources of the devices. Finally, we compare our proposal with other caching techniques published in the related literature. The proposal has been developed with the main objective of improving the communication and integration between different study centers of low-resource communities. That is, it lets communicate spontaneous networks, which are working collaboratively and which have been created on different physical places.Authors want to give thanks to the anonymous reviewers for their valuable suggestions, useful comments, and proofreading of this paper. This work was partially supported by the Ministerio de Educacion y Ciencia, Spain, under Grant no. TIN2008-06441-C02-01, and by the "Ayudas complementarias para proyectos de I+D para grupos de calidad de la Generalitat Valenciana" (ACOMP/2010/005).Lacuesta Gilaberte, R.; Lloret, J.; García Pineda, M.; Peñalver Herrero, ML. (2010). A spontaneous ad hoc network to share www access. EURASIP Journal on Wireless Communications and Networking. 2010:1-16. https://doi.org/10.1155/2010/232083S1162010Preuß S, Cap CH: Overview of spontaneous networking-evolving concepts and technologies. In Rostocker Informatik-Berichte. Volume 24. Fachbereich Informatik der Universit at Rostock; 2000:113-123.Gallo S, Galluccio L, Morabito G, Palazzo S: Rapid and energy efficient neighbor discovery for spontaneous networks. Proceedings of the 7th ACM International Symposium on Modeling, Analysis and Simulation of Wireless and Mobile Systems, October 2004, Venice, ItalyLatvakoski J, Pakkala D, Pääkkönen P: A communication architecture for spontaneous systems. IEEE Wireless Communications 2004, 11(3):36-42. 10.1109/MWC.2004.1308947Zarate Silva VH, De Cruz Salgado EI, Quintana FR: AWISPA: an awareness framework for collaborative spontaneous networks. Proceedings of the 36th ASEE/IEEE Frontiers in Education Conference (FIE '06), October 2006 1-6.Feeney LM, Ahlgren B, Westerlund A: Spontaneous networking: an application-oriented approach to ad hoc networking. IEEE Communications Magazine 2001, 39(6):176-181. 10.1109/35.925687Perkins CE, Bhagwat P: Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers. Proceedings of the Conference on Communications Architectures, Protocols and Applications (SIGCOMM '94), August 1994 234-244.Johnson DB, Maltz DA, Broch J: DSR: The Dynamic Source Routing Protocol for Multihop Wireless Ad Hoc Networks, Ad Hoc Networking. Addison-Wesley Longman Publishing, Boston, Mass, USA; 2001.Perkins C, Belding-Royer E, Das S: Ad hoc on-demand distance vector (AODV) routing. RFC 3561, July 2003Park V, Corson MS: IETF MANET Internet Draft "draft-ietf-MANET-tora-spe03.txt". Novemmer 2000.Viana AC, De Amorim MD, Fdida S, de Rezende JF: Self-organization in spontaneous networks: the approach of DHT-based routing protocols. Ad Hoc Networks 2005, 3(5):589-606.Gilaberte RL, Herrero LP: IP addresses configuration in spontaneous networks. Proceedings of the 9th WSEAS International Conference on Computers, July 2005, Athens, GreeceViana AC, Dias de Amorim M, Fdida S, de Rezende JF: Self-organization in spontaneous networks: the approach of DHT-based routing protocols. Ad Hoc Networks 2005, 3(5):589-606.Alvarez-Hamelin JI, Carneiro Viana A, Dias De Amorim M: Architectural considerations for a self-configuring routing scheme for spontaneous networks.,Tech. Rep. 1 October 2005.Lacuesta R, Peñalver L: Automatic configuration of ad-hoc networks: establishing unique IP link-local addresses. Proceedings of the International Conference on Emerging Security Information, Systems and Technologies (SECURWARE '07), October 2007, Valencia, SpainFoulks EF: Social network therapies and society: an overview. Contemporary Family Therapy 1985, 3(4):316-320.Wang Y, Wu H: DFT-MSN: the delay/fault-tolerant mobile sensor network for pervasive information gathering. Proceedings of the 25th IEEE International Conference on Computer Communications (INFOCOM '06), April 2006Kindberg T, Zhang K: Validating and securing spontaneous associations between wireless devices. In Proceedings of the 6th Information Security Conference (ISC '03), 2003. Springer; 44-53.Al-Jaroodi J: Routing security in open/dynamic mobile ad hoc networks. The International Arab Journal of Information Technology 2007, 4(1):17-25.Stajano F, Anderson RJ: The resurrecting duckling: security issues for ad-hoc wireless networks. Proceedings of the 7th International Workshop on Security Protocols, April 1999 172-194.Zhou L, Haas ZJ: Securing ad hoc networks. IEEE Network 1999, 13(6):24-30. 10.1109/65.806983Hauspie M, Simplot-Ryl I: Cooperation in ad hoc networks: enhancing the virtual currency based models. Proceedings of the 1st International Conference on Integrated Internet Ad Hoc and Sensor Networks (InterSense '06), May 2006, Nice, FranceWang X, Dai F, Qian L, Dong H: A way to solve the threat of selfish and malicious nodes for ad hoc networks. Proceedings of the International Symposium on Information Science and Engieering (ISISE '08), December 2008, Shanghai, China 1: 368-370.Kargl F, Klenk A, Weber M, Schlott S: Sensors for detection of misbehaving nodes in MANETs. Detection of Intrusion and Malware and Vulnerability Assessment (DIMVA '04), July 2004, Dortmund, Germany 83-97.Kargl F, Geiss A, Scholott S, Weber M: Secure dynamic source routing. Proceedings of the 38th Annual Hawaii International Conference on System Sciences (HICSS '05), January 2005, Big Island, Hawaii, USAGokhale S, Dasgupta P: Distributed authentication for peer-to-peer networks. Proceedings of the Symposium on Applications and the Internet Workshops, January 2003 347-353.Capkun S, Buttyán L, Hubaux J-P: Self-organized public-key management for mobile ad hoc networks. IEEE Transactions on Mobile Computing 2003, 2(1):52-64. 10.1109/TMC.2003.1195151Stajano F, Anderson R: The resurrecting duckling security issues for ad-hoc wireless networks. In Proceedings of the 7th International Workshop on Security Protocols, 1999, Berlin, Germany, Lecture Notes in Computer Science. Volume 1796. Springer; 172-194.Balfanz D, Smetters DK, Stewart P, Wong HC: Talking to strangers: authentication in ad-hoc wireless networks. Proceedings of the International Symposium on Network and Distributed Systems Security (NDSS '02), February 2002, San Diego, Calif, USABarbara D, Imielinski T: Sleepers and workaholics: caching strategies in mobile environments. Proceedings of the ACM SIGMOD International Conference on Management of Data, May 1994 1-12.Cao G: A scalable low-latency cache invalidation strategy for mobile environments. IEEE Transactions on Knowledge and Data Engineering 2003, 15(5):1251-1265. 10.1109/TKDE.2003.1232276Hu Q, Lee D: Cache algorithms based on adaptive invalidation reports for mobile environments. Cluster Computing 1998, 1(1):39-50. 10.1023/A:1019012927328Jing J, Elmagarmid A, Helal A, Alonso R: Bit-sequences: an adaptive cache invalidation method in mobile client/server environments. Mobile Networks and Applications 1997, 2(2):115-127. 10.1023/A:1013616213333Kahol A, Khurana S, Gupta S, Srimani P: An efficient cache management scheme for mobile environment. Proceedings of the 20th International Conference on Distributied Computing System (ICDCS '00), April 2000, Taipei, Taiwan 530-537.Kazar M: Synchronization and caching issues in the Andrew file system. Proceedings of USENIX Conference, February 1988, Dallas, Tex, USA 27-36.Roussopoulos M, Baker M: CUP: controlled update propagation in peer-to-peer networks. Proceedings of USENIX Annual Technical Conference, June 2003, San Antonio, Tex, USASandberg S, Kleiman S, Goldberg D, Walsh D, Lyon B: Design and implementation of the sun network file system. Proceedings of USENIX Summer Conference, June 1985, Portland, Ore, USA 119-130.Wu K, Yu PS, Chen M: Energy-efficient caching for wireless mobile computing. Proceedings of the 12th IEEE International Conference on Data Engineering, February-March 1996, New Orleans, La, USA 336-343.Yeung MKH, Kwok Y-K: Wireless cache invalidation schemes with link adaptation and downlink traffic. IEEE Transactions on Mobile Computing 2005, 4(1):68-83.Wessels D, Claffy K: Internet cache protocol (IC) v.2. http://www.ietf.org/rfc/rfc2186.txtFan L, Cao P, Almeida J, Broder AZ: Summary cache: a scalable wide-area web cache sharing protocol. IEEE/ACM Transactions on Networking 2000, 8(3):281-293. 10.1109/90.851975Dykes SG, Robbins KA: A viability analysis of cooperative proxy caching. Proceedings of the 20th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM '01), April 2001, Anchorage, Alaska, USA 3: 1205-1214.Wessels D, Claffy K: RFC 2186: Internet cache protocol (ICP), version 2. The Internet Engineering Taskforce, September 1997Wessels D, Claffy K: RFC 2187: application of internet cache protocol (ICP), version 2. The Internet Engineering Taskforce, September 1997Ren Q, Dunhan MH: Using semantic caching to manage location dependent data in mobile computing. Proceedings of the 6th Annual International Conference on Mobile Computing and Networking, August 2000, Boston, Mass, USA 210-221.Lim S, Lee W-C, Cao G, Das CR: Cache invalidation strategies for internet-based mobile ad hoc networks. Computer Communications 2007, 30(8):1854-1869. 10.1016/j.comcom.2007.02.020Park B-N, Lee W, Lee C: QoS-aware internet access schemes for wireless mobile ad hoc networks. Computer Communications 2007, 30(2):369-384. 10.1016/j.comcom.2006.09.004Hara T: Effective replica allocation in ad hoc networks for improving data accessibility. Proceedings of the 20th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM '01), April 2001, Anchorage, Alaska, USA 1568-1576.Papadopouli M, Schulzrinne H: Effects of power conservation, wireless converage and cooperation on data dissemination among mobile devices. Proceedings of the ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc '01), October 2001, Long Beach, Calif, USA 117-127.Can P, Irani S: Cost-aware WWW proxy caching algorithms. Proceedings of the USENIX Symposium on lnternet Technology and Systems, December 1997Rizzo L, Vicisano L: Replacement policies for a proxy cache. IEEE/ACM Transactions on Networking 2000, 8(2):158-170. 10.1109/90.842139Williams S, Abrams M, Strandridge CR, Abdulla G, Fox EA: Removal policies in network caches for world-wide web documents. Proceedings of the ACM SIGCOMM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, August 1996, Palo Alto, Calif, USA 293-305.Hara T: Replica allocation in ad hoc networks with period data update. Proceedings of the 3rd International Conference on Mobile Data Management (MDM '02), July 2002, Edmonton, Canada 79-86.Papadopouli M, Schulzrinne H: Effects of power conservation, wireless coverage and cooperation on data dissemination among mobile devices. Proceedings of the ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc '01), October 2001, Long Beach, Calif, USA 117-127.Sailhan F, Issarny V: Cooperative caching in ad hoc networks. Proceedings of the 4th International Conference on Mobile Data Management (MDM '03), January 2003, Melbourne, Australia, Lecture Notes in Computer Science 2574: 13-28.Yin L, Cao G: Supporting cooperative caching in ad hoc networks. IEEE Transactions on Mobile Computing 2006, 5(1):77-89.Karumanchi G, Muralidharan S, Prakash R: Information dissemination in partitionable mobile ad hoc networks. Proceedings of the 18th IEEE Symposium on Reliable Distributed Systems (SRDS '99), October 1999, Lausanne, Switzerland 4-13.Corson MS, Macker JP, Cirincione GH: Internet-based mobile ad hoc networking. IEEE Internet Computing 1999, 3(4):63-70. 10.1109/4236.780962Lim S, Lee W-C, Cao G, Das CR: A novel caching scheme for improving internet-based mobile ad hoc networks performance. Ad Hoc Networks 2006, 4(2):225-239. 10.1016/j.adhoc.2004.04.013Opnet Modeler http://www.opnet.com/solutions/network_rd/modeler_wireless.htmlLacuesta R, Lloret J, Garcia M, Peñalver L: Two secure and energy-saving spontaneous ad-hoc protocol for wireless mesh client networks. Journal of Network and Computer Applications. In pres

Spontaneous ad hoc mobile cloud computing network

Cloud computing helps users and companies to share computing resources instead of having local servers or personal devices to handle the applications. Smart devices are becoming one of the main information processing devices. Their computing features are reaching levels that let them create a mobile cloud computing network. But sometimes they are not able to create it and collaborate actively in the cloud because it is difficult for them to build easily a spontaneous network and configure its parameters. For this reason, in this paper, we are going to present the design and deployment of a spontaneous ad hoc mobile cloud computing network. In order to perform it, we have developed a trusted algorithm that is able to manage the activity of the nodes when they join and leave the network. The paper shows the network procedures and classes that have been designed. Our simulation results using Castalia show that our proposal presents a good efficiency and network performance even by using high number of nodes.Lacuesta, R.; Lloret, J.; Sendra, S.; Peñalver Herrero, ML. (2014). Spontaneous ad hoc mobile cloud computing network. Scientific World Journal. 2014:1-19. doi:10.1155/2014/232419S1192014Rodrigues, J. J. P. C., Zhou, L., Mendes, L. D. P., Lin, K., & Lloret, J. (2012). Distributed media-aware flow scheduling in cloud computing environment. Computer Communications, 35(15), 1819-1827. doi:10.1016/j.comcom.2012.03.004Feeney, L. M., Ahlgren, B., & Westerlund, A. (2001). Spontaneous networking: an application oriented approach to ad hoc networking. IEEE Communications Magazine, 39(6), 176-181. doi:10.1109/35.925687Fernando, N., Loke, S. W., & Rahayu, W. (2013). Mobile cloud computing: A survey. Future Generation Computer Systems, 29(1), 84-106. doi:10.1016/j.future.2012.05.023Lacuesta, R., Lloret, J., Garcia, M., & Peñalver, L. (2013). A Secure Protocol for Spontaneous Wireless Ad Hoc Networks Creation. IEEE Transactions on Parallel and Distributed Systems, 24(4), 629-641. doi:10.1109/tpds.2012.168Lacuesta, R., Lloret, J., Garcia, M., & Peñalver, L. (2011). Two secure and energy-saving spontaneous ad-hoc protocol for wireless mesh client networks. Journal of Network and Computer Applications, 34(2), 492-505. doi:10.1016/j.jnca.2010.03.024Lacuesta, R., Lloret, J., Garcia, M., & Peñalver, L. (2010). A Spontaneous Ad Hoc Network to Share WWW Access. EURASIP Journal on Wireless Communications and Networking, 2010(1). doi:10.1155/2010/232083Lacuesta, R., Palacios-Navarro, G., Cetina, C., Peñalver, L., & Lloret, J. (2012). Internet of things: where to be is to trust. EURASIP Journal on Wireless Communications and Networking, 2012(1). doi:10.1186/1687-1499-2012-203Capkun, S., Buttyan, L., & Hubaux, J. (2003). Self-organized public-key management for mobile ad hoc networks. IEEE Transactions on Mobile Computing, 2(1), 52-64. doi:10.1109/tmc.2003.1195151Goodman, J., & Chandrakasan, A. (2000). An Energy Efficient Reconfigurable Public-Key Cryptography Processor Architecture. Lecture Notes in Computer Science, 175-190. doi:10.1007/3-540-44499-8_13Mayrhofer, R., Ortner, F., Ferscha, A., & Hechinger, M. (2003). Securing Passive Objects in Mobile Ad-Hoc Peer-to-Peer Networks. Electronic Notes in Theoretical Computer Science, 85(3), 105-121. doi:10.1016/s1571-0661(04)80687-xMendes, L. D. P., Rodrigues, J. J. P. C., Lloret, J., & Sendra, S. (2014). Cross-Layer Dynamic Admission Control for Cloud-Based Multimedia Sensor Networks. IEEE Systems Journal, 8(1), 235-246. doi:10.1109/jsyst.2013.2260653Dutta, R., & B, A. (2014). Protection of data in unsecured public cloud environment with open, vulnerable networks using threshold-based secret sharing. Network Protocols and Algorithms, 6(1), 58. doi:10.5296/npa.v6i1.486