884 resultados para Cellular mobile networks
Resumo:
Information-centric networking (ICN) is a new communication paradigm that has been proposed to cope with drawbacks of host-based communication protocols, namely scalability and security. In this thesis, we base our work on Named Data Networking (NDN), which is a popular ICN architecture, and investigate NDN in the context of wireless and mobile ad hoc networks. In a first part, we focus on NDN efficiency (and potential improvements) in wireless environments by investigating NDN in wireless one-hop communication, i.e., without any routing protocols. A basic requirement to initiate informationcentric communication is the knowledge of existing and available content names. Therefore, we develop three opportunistic content discovery algorithms and evaluate them in diverse scenarios for different node densities and content distributions. After content names are known, requesters can retrieve content opportunistically from any neighbor node that provides the content. However, in case of short contact times to content sources, content retrieval may be disrupted. Therefore, we develop a requester application that keeps meta information of disrupted content retrievals and enables resume operations when a new content source has been found. Besides message efficiency, we also evaluate power consumption of information-centric broadcast and unicast communication. Based on our findings, we develop two mechanisms to increase efficiency of information-centric wireless one-hop communication. The first approach called Dynamic Unicast (DU) avoids broadcast communication whenever possible since broadcast transmissions result in more duplicate Data transmissions, lower data rates and higher energy consumption on mobile nodes, which are not interested in overheard Data, compared to unicast communication. Hence, DU uses broadcast communication only until a content source has been found and then retrieves content directly via unicast from the same source. The second approach called RC-NDN targets efficiency of wireless broadcast communication by reducing the number of duplicate Data transmissions. In particular, RC-NDN is a Data encoding scheme for content sources that increases diversity in wireless broadcast transmissions such that multiple concurrent requesters can profit from each others’ (overheard) message transmissions. If requesters and content sources are not in one-hop distance to each other, requests need to be forwarded via multi-hop routing. Therefore, in a second part of this thesis, we investigate information-centric wireless multi-hop communication. First, we consider multi-hop broadcast communication in the context of rather static community networks. We introduce the concept of preferred forwarders, which relay Interest messages slightly faster than non-preferred forwarders to reduce redundant duplicate message transmissions. While this approach works well in static networks, the performance may degrade in mobile networks if preferred forwarders may regularly move away. Thus, to enable routing in mobile ad hoc networks, we extend DU for multi-hop communication. Compared to one-hop communication, multi-hop DU requires efficient path update mechanisms (since multi-hop paths may expire quickly) and new forwarding strategies to maintain NDN benefits (request aggregation and caching) such that only a few messages need to be transmitted over the entire end-to-end path even in case of multiple concurrent requesters. To perform quick retransmission in case of collisions or other transmission errors, we implement and evaluate retransmission timers from related work and compare them to CCNTimer, which is a new algorithm that enables shorter content retrieval times in information-centric wireless multi-hop communication. Yet, in case of intermittent connectivity between requesters and content sources, multi-hop routing protocols may not work because they require continuous end-to-end paths. Therefore, we present agent-based content retrieval (ACR) for delay-tolerant networks. In ACR, requester nodes can delegate content retrieval to mobile agent nodes, which move closer to content sources, can retrieve content and return it to requesters. Thus, ACR exploits the mobility of agent nodes to retrieve content from remote locations. To enable delay-tolerant communication via agents, retrieved content needs to be stored persistently such that requesters can verify its authenticity via original publisher signatures. To achieve this, we develop a persistent caching concept that maintains received popular content in repositories and deletes unpopular content if free space is required. Since our persistent caching concept can complement regular short-term caching in the content store, it can also be used for network caching to store popular delay-tolerant content at edge routers (to reduce network traffic and improve network performance) while real-time traffic can still be maintained and served from the content store.
Resumo:
One of the advantages of social networks is the possibility to socialize and personalize the content created or shared by the users. In mobile social networks, where the devices have limited capabilities in terms of screen size and computing power, Multimedia Recommender Systems help to present the most relevant content to the users, depending on their tastes, relationships and profile. Previous recommender systems are not able to cope with the uncertainty of automated tagging and are knowledge domain dependant. In addition, the instantiation of a recommender in this domain should cope with problems arising from the collaborative filtering inherent nature (cold start, banana problem, large number of users to run, etc.). The solution presented in this paper addresses the abovementioned problems by proposing a hybrid image recommender system, which combines collaborative filtering (social techniques) with content-based techniques, leaving the user the liberty to give these processes a personal weight. It takes into account aesthetics and the formal characteristics of the images to overcome the problems of current techniques, improving the performance of existing systems to create a mobile social networks recommender with a high degree of adaptation to any kind of user.
Resumo:
Providing QoS in the context of Ad Hoc networks includes a very wide field of application from the perspective of every level of the architecture in the network. Saying It in another way, It is possible to speak about QoS when a network is capable of guaranteeing a trustworthy communication in both extremes, between any couple of the network nodes by means of an efficient Management and administration of the resources that allows a suitable differentiation of services in agreement with the characteristics and demands of every single application.The principal objective of this article is the analysis of the quality parameters of service that protocols of routering reagents such as AODV and DSR give in the Ad Hoc mobile Networks; all of this is supported by the simulator ns-2. Here were going to analyze the behavior of some other parameters like effective channel, loss of packages and latency in the protocols of routering. Were going to show you which protocol presents better characteristics of Quality of Service (QoS) in the MANET networks.
Resumo:
HELLO protocol or neighborhood discovery is essential in wireless ad hoc networks. It makes the rules for nodes to claim their existence/aliveness. In the presence of node mobility, no fix optimal HELLO frequency and optimal transmission range exist to maintain accurate neighborhood tables while reducing the energy consumption and bandwidth occupation. Thus a Turnover based Frequency and transmission Power Adaptation algorithm (TFPA) is presented in this paper. The method enables nodes in mobile networks to dynamically adjust both their HELLO frequency and transmission range depending on the relative speed. In TFPA, each node monitors its neighborhood table to count new neighbors and calculate the turnover ratio. The relationship between relative speed and turnover ratio is formulated and optimal transmission range is derived according to battery consumption model to minimize the overall transmission energy. By taking advantage of the theoretical analysis, the HELLO frequency is adapted dynamically in conjunction with the transmission range to maintain accurate neighborhood table and to allow important energy savings. The algorithm is simulated and compared to other state-of-the-art algorithms. The experimental results demonstrate that the TFPA algorithm obtains high neighborhood accuracy with low HELLO frequency (at least 11% average reduction) and with the lowest energy consumption. Besides, the TFPA algorithm does not require any additional GPS-like device to estimate the relative speed for each node, hence the hardware cost is reduced.
Resumo:
Groupe Spécial Mobile (GSM) has been developed as the pan-European second generation of digital mobile systems. GSM operates in the 900 MHz frequency band and employs digital technology instead of the analogue technology of its predecessors. Digital technology enables the GSM system to operate in much smaller zones in comparison with the analogue systems. The GSM system will offer greater roaming facilities to its subscribers, extended throughout the countries that have installed the system. The GSM system could be seen as a further enhancement to European integration. GSM has adopted a contention-based protocol for multipoint-to-point transmission. In particular, the slotted-ALOHA medium access protocol is used to coordinate the transmission of the channel request messages between the scattered mobile stations. Collision still happens when more than one mobile station having the same random reference number attempts to transmit on the same time-slot. In this research, a modified version of this protocol has been developed in order to reduce the number of collisions and hence increase the random access channel throughput compared to the existing protocol. The performance evaluation of the protocol has been carried out using simulation methods. Due to the growing demand for mobile radio telephony as well as for data services, optimal usage of the scarce availability radio spectrum is becoming increasingly important. In this research, a protocol has been developed whereby the number of transmitted information packets over the GSM system is increased without any additional increase of the allocated radio spectrum. Simulation results are presented to show the improvements achieved by the proposed protocol. Cellular mobile radio networks commonly respond to an increase in the service demand by using smaller coverage areas. As a result, the volume of the signalling exchanges increases. In this research, a proposal for interconnecting the various entitles of the mobile radio network over the future broadband networks based on the IEEE 802.6 Metropolitan Area Network (MAN) is outlined. Simulation results are presented to show the benefits achieved by interconnecting these entities over the broadband Networks.
Resumo:
The advances in low power micro-processors, wireless networks and embedded systems have raised the need to utilize the significant resources of mobile devices. These devices for example, smart phones, tablets, laptops, wearables, and sensors are gaining enormous processing power, storage capacity and wireless bandwidth. In addition, the advancement in wireless mobile technology has created a new communication paradigm via which a wireless network can be created without any priori infrastructure called mobile ad hoc network (MANET). While progress is being made towards improving the efficiencies of mobile devices and reliability of wireless mobile networks, the mobile technology is continuously facing the challenges of un-predictable disconnections, dynamic mobility and the heterogeneity of routing protocols. Hence, the traditional wired, wireless routing protocols are not suitable for MANET due to its unique dynamic ad hoc nature. Due to the reason, the research community has developed and is busy developing protocols for routing in MANET to cope with the challenges of MANET. However, there are no single generic ad hoc routing protocols available so far, which can address all the basic challenges of MANET as mentioned before. Thus this diverse range of ever growing routing protocols has created barriers for mobile nodes of different MANET taxonomies to intercommunicate and hence wasting a huge amount of valuable resources. To provide interaction between heterogeneous MANETs, the routing protocols require conversion of packets, meta-model and their behavioural capabilities. Here, the fundamental challenge is to understand the packet level message format, meta-model and behaviour of different routing protocols, which are significantly different for different MANET Taxonomies. To overcome the above mentioned issues, this thesis proposes an Interoperable Framework for heterogeneous MANETs called IF-MANET. The framework hides the complexities of heterogeneous routing protocols and provides a homogeneous layer for seamless communication between these routing protocols. The framework creates a unique Ontology for MANET routing protocols and a Message Translator to semantically compare the packets and generates the missing fields using the rules defined in the Ontology. Hence, the translation between an existing as well as newly arriving routing protocols will be achieved dynamically and on-the-fly. To discover a route for the delivery of packets across heterogeneous MANET taxonomies, the IF-MANET creates a special Gateway node to provide cluster based inter-domain routing. The IF-MANET framework can be used to develop different middleware applications. For example: Mobile grid computing that could potentially utilise huge amounts of aggregated data collected from heterogeneous mobile devices. Disaster & crises management applications can be created to provide on-the-fly infrastructure-less emergency communication across organisations by utilising different MANET taxonomies.
Resumo:
In recent years, there has been an enormous growth of location-aware devices, such as GPS embedded cell phones, mobile sensors and radio-frequency identification tags. The age of combining sensing, processing and communication in one device, gives rise to a vast number of applications leading to endless possibilities and a realization of mobile Wireless Sensor Network (mWSN) applications. As computing, sensing and communication become more ubiquitous, trajectory privacy becomes a critical piece of information and an important factor for commercial success. While on the move, sensor nodes continuously transmit data streams of sensed values and spatiotemporal information, known as ``trajectory information". If adversaries can intercept this information, they can monitor the trajectory path and capture the location of the source node. This research stems from the recognition that the wide applicability of mWSNs will remain elusive unless a trajectory privacy preservation mechanism is developed. The outcome seeks to lay a firm foundation in the field of trajectory privacy preservation in mWSNs against external and internal trajectory privacy attacks. First, to prevent external attacks, we particularly investigated a context-based trajectory privacy-aware routing protocol to prevent the eavesdropping attack. Traditional shortest-path oriented routing algorithms give adversaries the possibility to locate the target node in a certain area. We designed the novel privacy-aware routing phase and utilized the trajectory dissimilarity between mobile nodes to mislead adversaries about the location where the message started its journey. Second, to detect internal attacks, we developed a software-based attestation solution to detect compromised nodes. We created the dynamic attestation node chain among neighboring nodes to examine the memory checksum of suspicious nodes. The computation time for memory traversal had been improved compared to the previous work. Finally, we revisited the trust issue in trajectory privacy preservation mechanism designs. We used Bayesian game theory to model and analyze cooperative, selfish and malicious nodes' behaviors in trajectory privacy preservation activities.
Resumo:
IEEE 802.11 is one of the most well-established and widely used standard for wireless LAN. Its Medium Access control (MAC) layer assumes that the devices adhere to the standard’s rules and timers to assure fair access and sharing of the medium. However, wireless cards driver flexibility and configurability make it possible for selfish misbehaving nodes to take advantages over the other well-behaving nodes. The existence of selfish nodes degrades the QoS for the other devices in the network and may increase their energy consumption. In this paper we propose a green solution for selfish misbehavior detection in IEEE 802.11-based wireless networks. The proposed scheme works in two phases: Global phase which detects whether the network contains selfish nodes or not, and Local phase which identifies which node or nodes within the network are selfish. Usually, the network must be frequently examined for selfish nodes during its operation since any node may act selfishly. Our solution is green in the sense that it saves the network resources as it avoids wasting the nodes energy by examining all the individual nodes of being selfish when it is not necessary. The proposed detection algorithm is evaluated using extensive OPNET simulations. The results show that the Global network metric clearly indicates the existence of a selfish node while the Local nodes metric successfully identified the selfish node(s). We also provide mathematical analysis for the selfish misbehaving and derived formulas for the successful channel access probability.
Resumo:
Often, fixed-line incumbents also own the largest mobile network. We consider the effect of this joint ownership on market outcomes. Our model predicts that while fixed-to-mobile call prices to the integrated mobile network are more efficient than under separation, those to rival mobile networks are distorted upwards, amplifying any incumbency advantage. As concerns potential remedies, a uniform off-net pricing constraint leads to higher welfare than functional separation and even allows to maintain some of the efficiency gains.
Resumo:
We present a calibrated model of the UK mobile telephony market with four mobile networks; calls to and from the fixed network; network-based price discrimination; and call externalities. Our results show that reducing mobile termination rates broadly in line with the recent European Commission Recommendation to either pure long-run incremental cost ; reciprocal termination charges with fixed networks; or Bill & Keep (i.e. zero termination rates), increases social welfare, consumer surplus and networks profits. Depending on the strength of call externalities, social welfare may increase by as much as £ 990 million to £ 4.5 billion per year, with Bill & Keep leading to the highest increase in welfare. We also apply the model to estimate the welfare effects of the 2010 merger between Orange and T-Mobile under different scenarios concerning MTRs, and predict that consumer surplus decreases strongly.
Resumo:
Following the European Commission’s 2009 Recommendation on the Regulatory Treatment of Fixed and Mobile Termination Rates in the EU, the Portuguese regulatory authority (ANACOM) decided to reduce termination prices in mobile networks to their long-run incremental cost (LRIC). Nevertheless, no serious quantitative assessment of the potential effects of this decision was carried out. In this paper, we adapt and calibrate the Harbord and Hoernig (2014) model of the UK mobile telephony market to the Portuguese reality, and simulate the likely impact on consumer surplus, profits and welfare of four different regulatory approaches: pure LRIC, reciprocal termination charges with fixed networks, “bill & keep”, and asymmetric termination rates. Our results show that reducing MTRs does increase social welfare, profits and consumer surplus in the fixed market, but mobile subscribers are seriously harmed by this decision.
Resumo:
Abstract This PhD thesis addresses the issue of alleviating the burden of developing ad hoc applications. Such applications have the particularity of running on mobile devices, communicating in a peer-to-peer manner and implement some proximity-based semantics. A typical example of such application can be a radar application where users see their avatar as well as the avatars of their friends on a map on their mobile phone. Such application become increasingly popular with the advent of the latest generation of mobile smart phones with their impressive computational power, their peer-to-peer communication capabilities and their location detection technology. Unfortunately, the existing programming support for such applications is limited, hence the need to address this issue in order to alleviate their development burden. This thesis specifically tackles this problem by providing several tools for application development support. First, it provides the location-based publish/subscribe service (LPSS), a communication abstraction, which elegantly captures recurrent communication issues and thus allows to dramatically reduce the code complexity. LPSS is implemented in a modular manner in order to be able to target two different network architectures. One pragmatic implementation is aimed at mainstream infrastructure-based mobile networks, where mobile devices can communicate through fixed antennas. The other fully decentralized implementation targets emerging mobile ad hoc networks (MANETs), where no fixed infrastructure is available and communication can only occur in a peer-to-peer fashion. For each of these architectures, various implementation strategies tailored for different application scenarios that can be parametrized at deployment time. Second, this thesis provides two location-based message diffusion protocols, namely 6Shot broadcast and 6Shot multicast, specifically aimed at MANETs and fine tuned to be used as building blocks for LPSS. Finally this thesis proposes Phomo, a phone motion testing tool that allows to test proximity semantics of ad hoc applications without having to move around with mobile devices. These different developing support tools have been packaged in a coherent middleware framework called Pervaho.
Resumo:
ABSTRACT The network of actin cytoskeleton is composed of actin filaments (F-actin) that are made by polymerisation of actin monomers and actin binding proteins. It is required for growth and morphogenesis of eukaryotic cells. The labelling of F-actin with constitutively expressed GFP-Talin (Kost et al., 1998) reveals the organisation of cellular actin networks in plants. Due to the lack of information on actin cytoskeleton through gametophytic development of the model moss plant Physcornitrella patens, stable transgenic lines overexpressing GFP-Talin were generated to detect F-actin structures. It is shown that the 35S promoter driven expression is not suitable for F-actin labelling in all cells. When it is replaced by the inducible heat-shock promoter Gmhsp17.3 from soybean, one hour mild heat stress at 37°C followed by recovery at 25°C is enough to induce efficient and transient labelling in all tissues without altering cellular morphology. The optimal observations of F-actin structures at different stages of moss development can be done between 12-18 hours after the induction. By using confocal microscopy, we demonstrate that stellated actin arrays were densely accumulated at the growing tip in regenerating protoplasts, apical protonemal cells and rhizoids and connected with a fine dispersed F-actin mesh. Following three-dimensional growth, the cortical star-like structures are widespread in the meristematic cells of developing bud and young gametophores. On the contrary, undulating networks of actin cables are found at the final stage of cell differentiation. During redifferentiation of mature leaf cells into protonemal filaments the rather stagnant web of actin cables is replaced by diffuse actin meshwork. In eukaryotes, nucleation of the actin monomers prior to their polymerization is driven by the seven-subunit ARP2/3 complex and formins. We cloned the gene encoding the ARP3 subunit of P. patens and generated arp3 mutants of the moss through gene disruption. The knockout of ARP3 affects the elongation of chloronemal cells and blocks further differentiation of caulonemal cells and rhizoids, and the gametophores are slightly stunted compared to wild-type. The arp mutants were created in the heat-shock inducible GFP-Talin strains allowing us to visualise a disorganised actin network and a lack of star-like actin cytoskeleton arrays. We conclude that ARP2/3 dependent nucleation of actin filaments is critical for the growth of filamentous cells, which in turn influences moss colonization. In complementation assays, the overexpression of Physcomitrella and Arab idopsis ARP3 genes in the moss arp3 mutant results in full recovery of wild type phenotype. In contrast the ARP3 subunit of fission yeast is not able to complement the moss arp3 mutant of moss indicating that regulation of the ARP2/3 dependent actin nucleation diverged in different kingdoms. RESUME Le réseau d'actine est composé de filaments de F-actine et d'un ensemble de protéines s'y attachant (Actin binding proteins). Le réseau d'actine est nécessaire à la croissance et à la morphogenèse de toutes les cellules eucaryotes. Chez les plantes, le marquage ainsi que l'étude de l'organisation du réseau d'actine ont été réalisés en utilisant une fusion GFP-Talin (Kost et al., 1998) exprimée sous le control d'un promoteur constitutif. Afin d'étudier les structures F-actine dans les cellules de Physcomitrella Patens et pour combler le manque d'information sur le développement des gamétophores, des lignées transgéniques stables surexprimant GFP-Talin ont été crées. Nous avons démontré que l'utilisation du promoteur 35S est inadéquate pour le marquage complet et homogène des filaments d'actine dans toutes les cellules de P. patens. Par contre, l'utilisation du promoteur inductible Gmhsp17.3 nous a permis de réaliser un marquage transitoire et général dans tous les tissus de la mousse. Une heure de choc thermique à 37°C suivis d'un temps de récupération de 12-18h à 25°C sont les conditions optimales (sans dommages cellulaires) pour l'observation des structures F-actine à différentes étapes de développement de la mousse. En utilisant la microscopie confocale, nous avons observé l'existence de structures F-actine accumulées en forme d'étoiles. Ces structures, qui sont liées au réseau de microfilaments d'actine, ont été observées dans les protoplastes en régénération, les cellules des protonema apicales ainsi que dans les rhizoïdes. En suivant la croissance tridimensionnelle, ces structures en étoiles ont été observées dans les cellules meristématiques des bourgeons et des jeunes gamétophores. Par contre, dans les cellules différentiées ces structures laissent place à des réseaux de câbles épais. Nous avons également remarqué que durant la redifferentiation des cellules foliaires le réseau de câbles de F-actine est remplacé par un réseau de F-actine diffus. Dans les cellules eucaryotes, la nucléation des filaments d'actirie précédant leur polymérisation est contrôlé par sept sous unités du complexe ARP2/3 et par des formines. Nous avons isolé le gène codant pour la sous unité ARP3 de P. patens et nous avons crée des mutants arp3 par intégration ciblée (Knockout). L'élongation des cellules chloronema est clairement affectée dans les mutants arp3. La différentiation des caulonemata et des rhizoïdes est bloquée et les gametophores sont légèrement plus courts comparé au type sauvage. A fin d'étudier l'organisation des filaments d'actines dans les mutants arp3, nous avons aussi réalisé un arp3-knockout dans la lignée Hsp-GFP-Talin. La nouvelle lignée générée nous a permis de visualiser une désorganisation du réseau d'actine et une absence complète de structures de F-actine accumulée en forme d'étoiles. Les résultats obtenus nous amènent à conclure que la nucléation (ARP2/3 dépendante) des filaments d'actine est indispensable à la croissance des cellules filamenteuses. Par conséquent, les filaments d'actine semblent avoir un rôle dans la colonisation des milieux par les mousses. Nous avons également procédé à des essais de complémentation du mutant arp3. La surexpression des gènes ARP3 de Physcomitrella et d'Arabidopsis dans les cellules du mutant arp3 rétabli complètement le phénotype WT. Par contre, le gène ARP3 des levures n'est pas suffisant pour complémenter la même mutation dans les cellules de mousses. Ce résultat démontre que les mécanismes de régulation de la nucléation des filaments d'actine (ARP2/3 dépendante) sont différents entre les différents groupes d'eucaryotes.
Resumo:
The diffusion of mobile telephony began in 1971 in Finland, when the first car phones, called ARP1 were taken to use. Technologies changed from ARP to NMT and later to GSM. The main application of the technology, however, was voice transfer. The birth of the Internet created an open public data network and easy access to other types of computer-based services over networks. Telephones had been used as modems, but the development of the cellular technologies enabled automatic access from mobile phones to Internet. Also other wireless technologies, for instance Wireless LANs, were also introduced. Telephony had developed from analog to digital in fixed networks and allowed easy integration of fixed and mobile networks. This development opened a completely new functionality to computers and mobile phones. It also initiated the merger of the information technology (IT) and telecommunication (TC) industries. Despite the arising opportunity for firms' new competition the applications based on the new functionality were rare. Furthermore, technology development combined with innovation can be disruptive to industries. This research focuses on the new technology's impact on competition in the ICT industry through understanding the strategic needs and alternative futures of the industry's customers. The change speed inthe ICT industry is high and therefore it was valuable to integrate the DynamicCapability view of the firm in this research. Dynamic capabilities are an application of the Resource-Based View (RBV) of the firm. As is stated in the literature, strategic positioning complements RBV. This theoretical framework leads theresearch to focus on three areas: customer strategic innovation and business model development, external future analysis, and process development combining these two. The theoretical contribution of the research is in the development of methodology integrating theories of the RBV, dynamic capabilities and strategic positioning. The research approach has been constructive due to the actual managerial problems initiating the study. The requirement for iterative and innovative progress in the research supported the chosen research approach. The study applies known methods in product development, for instance, innovation process in theGroup Decision Support Systems (GDSS) laboratory and Quality Function Deployment (QFD), and combines them with known strategy analysis tools like industry analysis and scenario method. As the main result, the thesis presents the strategic innovation process, where new business concepts are used to describe the alternative resource configurations and scenarios as alternative competitive environments, which can be a new way for firms to achieve competitive advantage in high-velocity markets. In addition to the strategic innovation process as a result, thestudy has also resulted in approximately 250 new innovations for the participating firms, reduced technology uncertainty and helped strategic infrastructural decisions in the firms, and produced a knowledge-bank including data from 43 ICT and 19 paper industry firms between the years 1999 - 2004. The methods presentedin this research are also applicable to other industries.
Resumo:
Tässä diplomityössä perehdytään WAP:in Push -viitekehykseen. WAP-standardit määrittelevät kuinka Internet-tyyppisiä palveluita, joita voidaan käyttää erilaisia mobiileja päätelaiteitteita käyttäen, toteutetaan tehokkaalla ja verkkoteknologiasta riippumattomalla tavalla. WAP pohjautuu Internet:iin, mutta huomioi pienten päätelaitteiden ja mobiiliverkkojen rajoitukset ja erikoisominaisuudet. WAP Push viitekehys määrittelee verkon aloittaman palvelusisällön toimittamisen. Työn teoriaosassa käydään läpi yleinen WAP-arkkitehtuuri ja WAP-protokollapino käyttäen vertailukohtina lanka-Internetin arkkitehtuuria ja protokollapinoa. Edellistä perustana käyttäen tutustaan WAP Push -viitekehykseen. Käytännönosassa kuvataan WAP Push -välityspalvelimen suunnittelu ja kehitystyö. WAP Push -välityspalvelin on keskeinen verkkoelementti WAP Push -viitekehyksessä. WAP Push -välityspalvelin yhdistää Internetin ja mobiiliverkon tavalla, joka piilottaa teknologiaeroavaisuudet Internetissä olevalta palveluntuottajalta.