Showing papers in "Mobile Networks and Applications in 2011"
TL;DR: This paper provides a detailed investigation of sensor devices, physical layer, data link layer, and radio technology aspects of BAN research, and presents a taxonomy of B Ban projects that have been introduced/proposed to date.
Abstract: Advances in wireless communication technologies, such as wearable and implantable biosensors, along with recent developments in the embedded computing area are enabling the design, development, and implementation of body area networks. This class of networks is paving the way for the deployment of innovative healthcare monitoring applications. In the past few years, much of the research in the area of body area networks has focused on issues related to wireless sensor designs, sensor miniaturization, low-power sensor circuitry, signal processing, and communications protocols. In this paper, we present an overview of body area networks, and a discussion of BAN communications types and their related issues. We provide a detailed investigation of sensor devices, physical layer, data link layer, and radio technology aspects of BAN research. We also present a taxonomy of BAN projects that have been introduced/proposed to date. Finally, we highlight some of the design challenges and open issues that still need to be addressed to make BANs truly ubiquitous for a wide range of applications.
1,239 citations
TL;DR: How smartphones, such as the iPhone and Google Android platforms, can automatically detect traffic accidents using accelerometers and acoustic data, immediately notify a central emergency dispatch server after an accident, and provide situational awareness through photographs, GPS coordinates, VOIP communication channels, and accident data recording is described.
Abstract: Traffic accidents are one of the leading causes of fatalities in the US. An important indicator of survival rates after an accident is the time between the accident and when emergency medical personnel are dispatched to the scene. Eliminating the time between when an accident occurs and when first responders are dispatched to the scene decreases mortality rates by 6%. One approach to eliminating the delay between accident occurrence and first responder dispatch is to use in-vehicle automatic accident detection and notification systems, which sense when traffic accidents occur and immediately notify emergency personnel. These in-vehicle systems, however, are not available in all cars and are expensive to retrofit for older vehicles. This paper describes how smartphones, such as the iPhone and Google Android platforms, can automatically detect traffic accidents using accelerometers and acoustic data, immediately notify a central emergency dispatch server after an accident, and provide situational awareness through photographs, GPS coordinates, VOIP communication channels, and accident data recording. This paper provides the following contributions to the study of detecting traffic accidents via smartphones: (1) we present a formal model for accident detection that combines sensors and context data, (2) we show how smartphone sensors, network connections, and web services can be used to provide situational awareness to first responders, and (3) we provide empirical results demonstrating the efficacy of different approaches employed by smartphone accident detection systems to prevent false positives.
327 citations
TL;DR: A new elastic application model that enables seamless and transparent use of cloud resources to augment the capability of resource-constrained mobile devices is proposed and promising results of the proposed application model are demonstrated.
Abstract: We propose a new elastic application model that enables seamless and transparent use of cloud resources to augment the capability of resource-constrained mobile devices. The salient features of this model include the partition of a single application into multiple components called weblets, and a dynamic adaptation of weblet execution configuration. While a weblet can be platform independent (e.g., Java or .Net bytecode or Python script) or platform dependent (native code), its execution location is transparent--it can be run on a mobile device or migrated to the cloud, i.e., run on one or more nodes offered by an IaaS provider. Thus, an elastic application can augment the capabilities of a mobile device including computation power, storage, and network bandwidth, with the light of dynamic execution configuration according to device's status including CPU load, memory, battery level, network connection quality, and user preferences. This paper presents the motivation behind developing elastic applications and their architecture including typical elasticity patterns and cost models that are applied to determine the elasticity patterns. We implement a reference architecture and develop a set of elastic applications to validate the augmentation capabilities for smartphone devices. We demonstrate promising results of the proposed application model using data collected from one of our example elastic applications.
287 citations
TL;DR: A general framework for virtualizing the wireless medium is proposed and investigated, which focuses on virtualizing mobile communication systems so that multiple operators can share the same physical resources while being able to stay isolated from each other.
Abstract: Network virtualization is receiving immense attention in the research community all over the world. There is no doubt that it will play a significant role in shaping the way we do networking in the future. There have been different approaches to virtualize different aspects of the network: some are focusing on resource virtualization like node, server and router virtualization; while others are focusing on building a framework to set up virtual networks on the fly based on different virtual resources. Nevertheless, one very important piece of the puzzle is still missing, that is "Wireless Virtualization". The virtualization of the wireless medium has not yet received the appropriate attention it is entitled to, and there have only been some early attempts in this field. In this paper a general framework for virtualizing the wireless medium is proposed and investigated. This framework focuses on virtualizing mobile communication systems so that multiple operators can share the same physical resources while being able to stay isolated from each other. We mainly focus on the Long Term Evolution (LTE) but the framework can also be generalized to fit any other wireless system. The goal of the paper is to exploit the advantages that can be obtained from virtualizing the LTE system, more specifically virtualizing the air interface (i.e. spectrum sharing). Two different possible gain areas are explored: spectrum multiplexing and multi-user diversity.
154 citations
TL;DR: A secure same-symptom-based handshake (SSH) scheme for social-based patient health information (PHI) collaborative reporting in MHSN is proposed, and extensive simulations are conducted to evaluate its efficiency in terms of PHI delivery ratio and reporting delay.
Abstract: In our aging society, mHealthcare social network (MHSN) built upon wireless body sensor network (WBSN) and mobile communications provides a promising platform for the seniors who have the same symptom to exchange their experiences, give mutual support and inspiration to each other, and help forwarding their health information wirelessly to a related eHealth center. However, there exist many challenging security issues in MHSN such as how to securely identify a senior who has the same symptom, how to prevent others who don't have the symptom from knowing someone's symptom? In this paper, to tackle these challenging security issues, we propose a secure samesymptom-based handshake (SSH) scheme. Specifically, in the proposed SSH scheme, each patient is granted with a pseudo-ID and its private key corresponding to his symptom. When two patients meet, only if they have the same symptom, they can use their private keys to make mutual authentication. With the provable security technique, we demonstrate the proposed SSH is secure in the MHSN scenarios. Moreover, we also discuss a promising application - social-based patient health information (PHI) collaborative reporting in MHSN, and conduct extensive simulations to evaluate its efficiency in terms of PHI delivery ratio and reporting delay.
128 citations
TL;DR: The notion of hierarchical ABE (HABE) was proposed in this article, which can be viewed as a generalization of traditional ABE in the sense that both definitions are equal when all attributes are independent.
Abstract: Attribute-based encryption (ABE) has been envisioned as a promising cryptographic primitive for realizing secure and flexible access control. However, ABE is being criticized for its high scheme overhead as extensive pairing operations are usually required. In this paper, we focus on improving the efficiency of ABE by leveraging a previously overlooked fact, i.e., the often-found hierarchical relationships among the attributes that are inherent to many access control scenarios. As the first research effort along this direction, we coin the notion of hierarchical ABE (HABE), which can be viewed as the generalization of traditional ABE in the sense that both definitions are equal when all attributes are independent. We further give a concrete HABE construction considering a tree hierarchy among the attributes, which is provably secure. More importantly, our construction exhibits significant improvements over the traditional ABE when attribute hierarchies exist.
73 citations
TL;DR: This paper surveys and summarizes in a comprehensive manner recent developments in IP multihoming support at the application, session, transport, and network layers, covering all recent proposals based on a locator/identifier split approach.
Abstract: IP multihoming is a networking concept with a deceptively simple definition in theory. In practice, however, multihoming has proved difficult to implement and optimize for. Moreover, it is a concept, which, once adopted in the core Internet architecture, has a significant impact on operation and maintenance. A trivial definition of multihoming would state that an end-node or an end-site has multiple first-hop connections to the network. In this paper, we survey and summarize in a comprehensive manner recent developments in IP multihoming. After introducing the fundamentals, we present the architectural goals and system design principles for multihoming, and review different approaches. We survey multihoming support at the application, session, transport, and network layers, covering all recent proposals based on a locator/identifier split approach. We critically evaluate multihoming support in these proposals and detail recent developments with respect to multihoming and mobility management.
45 citations
TL;DR: Performance results obtained from extensive simulations show that error concealment (EC) integrated schemes, especially EC with multipath fusion (ECMF) are more promising to compensate losses than RS-coding-integrated and pure multipath transmission techniques in WSN.
Abstract: Robust image and video communications have become more imperative due to the ubiquitous proliferation of multimedia applications over wireless sensor networks. In this work, the transmission distortions on the image data induced by both channel and instant node failures for Wireless Sensor Networks (WSN) are considered. The effect of two techniques and their integration with multipath transmission are investigated to compensate the multimedia distortions at the expense of incurring additional energy consumption and/or wasting bandwidth resources. First technique is watermarking based error concealment utilizing discrete wavelet transform for embedding downsized replicas of original image into itself. The other is conventional Reed---Solomon (RS) coding utilizing additional information bits to correct bit/symbol errors. Performance results obtained from extensive simulations utilizing a communication and energy model applicable to WSN show that error concealment (EC) integrated schemes, especially EC with multipath fusion (ECMF), are more promising to compensate losses than RS-coding-integrated and pure multipath transmission techniques in WSN.
44 citations
TL;DR: A secure encryption algorithm – Rubbing Encryption Algorithm (REAL) is proposed to implement a Mobile-based and a Cloud-based OTP Token that are of high security level, lower total token cost and can resist the aforementioned security attacks as well.
Abstract: One-time Password (OTP) Token has become one of the main stream security products during the past few years. OTP Token can automatically generate a random password. It is especially popular to be used with the Two-factor Authentication (2FA) system. OTP Token has proliferated into many different form factors such as standalone token, PC, PDA, cellular phone and Cloud-based token. But most of the implementation has their short comings with high token cost, not easy to carry and high supporting or deployment cost. Certain implementations may also compromise the network security when the token is lost or stolen. Moreover, most of the tokens can be broken-in by Man-in-the-Middle Seed-tracing and Shoulder-surfing security attacks. To overcome such aforementioned issues, we propose a secure encryption algorithm --- Rubbing Encryption Algorithm (REAL). We use REAL to implement a Mobile-based and a Cloud-based OTP Token as design examples. Both of them are of high security level, lower total token cost and can resist the aforementioned security attacks as well.
44 citations
TL;DR: Evaluation result shows that A-ADHOC can maintain a high contending success probability and obtain about 50% reduction of response time over original ADHOC protocol, while providing important enhancement on network scalability and robustness.
Abstract: Vehicular Ad Hoc Networks (VANET) are the foundation of Intelligent Traffic System (ITS), and recently many MAC protocols for VANET are proposed, among which a reliable MAC protocol called ADHOC has aroused much attention. By investigating the details of ADHOC protocol, we have discovered several unsolved problems that might lead to network failure. In this paper, we provide a quantitative analysis of the success probability for contending nodes and prove that an adaptive frame length is quite necessary. We propose Adaptive-ADHOC (A-ADHOC) MAC protocol, which implements a robust mechanism supporting the adaptive frame length. Evaluation result shows that A-ADHOC can maintain a high contending success probability and obtain about 50% reduction of response time over original ADHOC protocol, while providing important enhancement on network scalability and robustness.
42 citations
TL;DR: A generalized multi-user distributed antenna system (DAS), where the antenna elements are divided into antenna clusters and the antenna clusters are randomly deployed in the coverage area, is focused on, and it is concluded that the ergodic uplink sum rate capacity can be improved due to access distance reduction by scattering AEs further only when V > M.
Abstract: In this paper, we focus on a generalized multi-user distributed antenna system (DAS), where the antenna elements (AEs) are divided into antenna clusters and the antenna clusters are randomly deployed in the coverage area. The mobile terminals equipped with M AEs each are supposed to be uniformly distributed in the coverage area. We are motivated to study the impact of the deployment of antenna elements on the system performance. In the model of consideration, the deployment of antenna elements is characterized by the antenna cluster size V, i.e., the number of AEs within each antenna cluster, and the distribution of the antenna clusters. With the assumption that the antenna clusters are uniformly deployed in the coverage area, the impact of the antenna cluster size V on the uplink sum rate capacity is particularly investigated. The mean square access distance (MSAD), a function of V, is proposed as a reasonable metric instead of the uplink sum rate capacity. From the analysis of the asymptotic behavior of MSAD, we derive an approximate closed-form expression for the expectation of MSAD over system topologies. Then, it is concluded that the ergodic uplink sum rate capacity can be improved due to access distance reduction by scattering AEs further only when V?>?M. An approximate closed-form expression for the relative variance of MSAD is also derived. And we conclude that the outage uplink sum rate capacity can be improved due to macro-diversity by scattering AEs further only when V???M. In other words, when V???M, the ergodic uplink sum rate capacity can not be improved by scattering AEs further, when V?>?M, the outage uplink sum rate capacity can not be improved by scattering AEs further. Finally, our analysis is well verified by Monte Carlo simulations.
TL;DR: A novel in-network solution to prioritize the transmission of patient vital signs using wireless body area networks is proposed; the solution relies on a distributed priority scheduling strategy based on the current patient condition and on the vital sign end-to-end delay/reliability requirement.
Abstract: Triage is the process of prioritizing patients based on the severity of their condition when resources are insufficient. Hospitals today are equipped with more and more electronic medical devices. This results in possibly high level of electromagnetic interference that may lead to the failure of medical monitoring devices. Moreover, a patient is usually moved between different hospital settings during triage. Accurate and quick prioritization of patient vital signs under such environment is crucial for making efficient and realtime decisions. In this article, a novel in-network solution to prioritize the transmission of patient vital signs using wireless body area networks is proposed; the solution relies on a distributed priority scheduling strategy based on the current patient condition and on the vital sign end-to-end delay/reliability requirement. The proposed solution was implemented in TinyOS and its performance was tested in a real scenario.
TL;DR: This paper presents a BSN mobile solution for biofeedback monitoring using the four major smart phone platforms: Symbian, Windows Mobile, Android, and iPhone.
Abstract: Body sensor networks (BSN) appeared as an application of Wireless Sensor Networks (WSN) to medicine and biofeedback. Such networks feature smart sensors (biosensors) that capture bio-physiological parameters from people and can offer an easy way for data collection. BSNs also need suitable interfaces for data processing, presentation, and storage for latter retrieval. As a result, Bluetooth technology can be used to communicate with several more powerful and graphical user interface (GUI)-enabled devices such as mobile phones or regular computers. Taking into account that people currently use mobile and smart phones, it offers a good opportunity to propose a suitable mobile system for BSN networks. This paper presents a BSN mobile solution for biofeedback monitoring using the four major smart phone platforms: Symbian, Windows Mobile, Android, and iPhone. As case study, a sensing health with intelligence modularity, mobility and experimental reusability (SHIMMER) platform with a core-body temperature sensor enabled to construct the BSN was used. The four mobile applications were evaluated and validated, and are ready for use.
TL;DR: This work proposes a novel genetic algorithm based multi-agent itinerary planning (GA-MIP) scheme that performs better than the prior single agent algorithms in terms of delay and energy consumption.
Abstract: It has been shown recently that using Mobile Agents (MAs) in wireless sensor networks (WSNs) can help to achieve the flexibility of over-the-air software deployment on demand. In MA-based WSNs, it is crucial to find out an optimal itinerary for an MA to perform data collection from multiple distributed sensors. However, using a single MA brings up the shortcomings such as large latency, inefficient route, and unbalanced resource (e.g. energy) consumption. Then a novel genetic algorithm based multi-agent itinerary planning (GA-MIP) scheme is proposed to address these drawbacks. The extensive simulation experiments show that GA-MIP performs better than the prior single agent algorithms in terms of the product of delay and energy consumption.
TL;DR: Experimental results show that, compared with the previously proposed Least Energy Tree (LET) and Minimum Spanning Tree (MST) construction methods for TMFA, LRT construction outperforms both the LET and the MST construction in network lifetime and in the ratio of the number of packets reaching the sink to the total energy expended by all the nodes.
Abstract: Wireless sensor networks (WSNs) are prone to partitioning due to limited energy in sensor nodes and unreliable radio communications between them. Message ferrying (MF) has been proposed as an effective means to deliver data between disjoint parts of a partitioned WSN. In this paper, we propose a tree-based MF algorithm (TMFA) with least ratio tree (LRT) construction in order to prolong the lifetime and reduce energy usage in a WSN employing MF routing. LRT constructs a spanning tree from the topology graph of each partition of the WSN by setting the weight of each edge in the graph as the ratio between the energy cost to deliver a packet over the corresponding wireless link and a linear combination of the residual energy of the transmitting and receiving nodes connected by the link. In addition, the root of the spanning tree is randomly chosen among the nodes in the partition with residual energy equal to or larger than the mean residual energy of all nodes in the partition, so that the energy of nodes are expended evenly. Experimental results show that, compared with the previously proposed Least Energy Tree (LET) and Minimum Spanning Tree (MST) construction methods for TMFA, LRT construction outperforms both the LET and the MST construction in network lifetime and in the ratio of the number of packets reaching the sink to the total energy expended by all the nodes.
TL;DR: This paper model the PHY security cooperation problem as a coalitional game with non-transferable utility and proposes a distributed algorithm for coalition formation that can cooperate and self-organize into disjoint independent coalitions, while maximizing their secrecy rate taking into account the costs during information exchange.
Abstract: Cooperation among wireless nodes has been recently proposed for improving the physical layer (PHY) security of wireless transmission in the presence of multiple eavesdroppers. While existing PHY security literature answered the question "what are the link-level secrecy rate gains from cooperation?", this paper attempts to answer the question of "how to achieve those gains in a practical decentralized wireless network and in the presence of a cost for information exchange?". For this purpose, we model the PHY security cooperation problem as a coalitional game with non-transferable utility and propose a distributed algorithm for coalition formation. Using the proposed algorithm, the wireless users can cooperate and self-organize into disjoint independent coalitions, while maximizing their secrecy rate taking into account the costs during information exchange. We analyze the resulting coalitional structures for both decode-and-forward and amplify-and-forward cooperation and study how the users can adapt the network topology to environmental changes such as mobility. Through simulations, we assess the performance of the proposed algorithm and show that, by coalition formation using decode-and-forward, the average secrecy rate per user is increased of up to 25.3 and 24.4% (for a network with 45 users) relative to the non-cooperative and amplify-and-forward cases, respectively.
TL;DR: A modified Android user terminal is proposed to improve the handover process, assuming a make-before-break approach, and results show that the proposed solution is an effective contribution to successfully accomplish seamless mobility of Android-based devices operating in 3G and Wi-Fi networks.
Abstract: The fast growing of mobile Internet users with the ability of using a wide diversity of access technologies such as Wi-Fi, WiMAX and UMTS/LTE, and the increasing proliferation of mobile devices with heterogeneous network interfaces, require versatile mobility mechanisms providing seamless roaming across those access technologies. Mobility agents such as Mobile IP and Fast MIPv6 are common, however, these solutions still have limitations when dealing with multiple link-layer technologies. In this context, the emerging standard IEEE 802.21 provides a framework which enables mobile agents and network operators to improve the handover process in heterogeneous networks. In this context, this paper presents and discusses the design and implementation of a mobility-aware solution for an Android device, using the IEEE 802.21 framework. A modified Android user terminal is proposed to improve the handover process, assuming a make-before-break approach. Resorting to an experimental testbed, the obtained results show that the proposed solution is an effective contribution to successfully accomplish seamless mobility of Android-based devices operating in 3G and Wi-Fi networks.
TL;DR: In this paper, a system enabling a novel paradigm for social, active experience of sound and music content is presented, named Sync‘n’Move, allowing two users to explore a multi-channel pre-recorded music piece as the result of their social interaction, and in particular of their synchronization.
Abstract: Social interaction and embodiment are key issues for future User Centric Media. Social networks and games are more and more characterized by an active, physical participation of the users. The integration in mobile devices of a growing number of sensors to capture users' physical activity (e.g., accelerometers, cameras) and context information (GPS, location) supports novel systems capable to connect audiovisual content processing and communication to users social behavior, including joint movement and physical engagement. In this paper, a system enabling a novel paradigm for social, active experience of sound and music content is presented. An instance of such a system, named Sync`n'Move, allowing two users to explore a multi-channel pre-recorded music piece as the result of their social interaction, and in particular of their synchronization, is introduced. This research has been developed in the framework of the EU-ICT Project SAME ( www.sameproject.eu ) and has been presented at Agora Festival (IRCAM, Centre Pompidou, Paris, June 2009). In that occasion, Sync`n'Move has been evaluated by both expert and non expert users, and results are briefly presented. Perspectives on the impact of such a novel paradigm and system in future User Centric Media are finally discussed, with a specific focus on social active experience of audiovisual content.
TL;DR: This work proposes a new architecture for the medical sensor network that is capable of temporal accountability, and preserves privacy ability via a Crowds anonymous system, and clearly indicates the advantages of being low-cost and reliable and having scalable features.
Abstract: The increasing number of elderly patients in the world has lead to various new appliances and technologies in the modem tele-healthcare platform. One such application is the medical sensor network (MSN). In this application, patients are deployed with certain medical sensors and wearable devices and are remotely monitored by professionals. Thus, seeing a doctor in person is no longer the only option for those in need of medical care. Since it is also an economical way to reduce healthcare costs and save medical resources, we expect a robust, reliable, and scalable MSN in the near future. However, the time signal and temporal history in the current MSN are vulnerable due to unsecured infrastructure and transmission strategies. Meanwhile, the MSN may leak patients' identifications or other sensitive information that violates personal privacy. To make sure that the critical time signal is accountable, we propose a new architecture for the MSN that is capable of temporal accountability. In addition, it also preserves privacy ability via a Crowds anonymous system. The analysis results clearly indicate the advantages of being our proposed methods in terms of low-cost and reliable and having scalable features.
TL;DR: A flexible cost (utility) function is introduced, which allows modulating the relevance given to the different aspects which could be taken into consideration while deciding the access alternative to be used: connection with a preferred operator, minimizing the number of handovers, or selecting the link with the best quality.
Abstract: In this work we analyze the possibilities which are brought about by the use of linear programming techniques in the framework of access selection procedures within heterogeneous wireless network environments. We present a tool which has been designed and implemented (based on the GLPK package) to tackle this problem. This tool can be used to retrieve the optimum assignment of access elements of a particular network deployment. To fulfil this goal, we introduce a flexible cost (utility) function, which allows modulating the relevance given to the different aspects which could be taken into consideration while deciding the access alternative to be used: connection with a preferred operator, minimizing the number of handovers, or selecting the link with the best quality, amongst others. Afterwards, the tool is used to study a set of access selection strategies, so as to establish the combination of parameters which might lead to optimum performances.
TL;DR: This work proposes the use of 802.11e’s TXOP mechanism to restore/enforce fairness among competing flows which traverse multiple hops, and is simple, implementable using off-the-shelf devices and fully decentralised (requires no message passing).
Abstract: To mitigate the damaging impacts caused by interference and hidden terminals, it has been proposed to use orthogonal channels in wireless multi-hop mesh networks. We demonstrate however that even if these issues are completely eliminated with perfectly assigned channels, gross unfairness can still exist amongst competing flows which traverse multiple hops. We propose the use of 802.11e's TXOP mechanism to restore/enforce fairness. The proposed scheme is simple, implementable using off-the-shelf devices and fully decentralised (requires no message passing).
TL;DR: This paper introduces this functionality as standardized in the 3GPP Evolved Packet Core (EPC), highlighting its main concepts and technical scenarios and a set of novel optimizations presented and evaluated.
Abstract: The future wireless telecommunication environment is characterized by the co-existence of a multitude of wireless networks such as LTE, LTE-Advanced, UMTS, WiMAX, WiFi etc. In order to be able to offer the best connectivity, according to the requirements of the users and to the preferences of the operator, a novel functionality was introduced in the core network and in the mobile devices for access network discovery and selection. This paper introduces this functionality as standardized in the 3GPP Evolved Packet Core (EPC), highlighting its main concepts and technical scenarios. Further, a set of novel optimizations are presented and evaluated, followed by the description of their implementation as part of the Fraunhofer FOKUS OpenEPC toolkit.
TL;DR: It is argued that Complex Events cannot be described using standard threshold-based or composite logic approaches and attempting to represent them as such can lead to unpredictable execution cost while detection accuracy suffers from erroneous recording of observations which are common in WSNs.
Abstract: Complex Events are sequences of sensor measurements indicating interesting or unusual activity in the monitored process. Such events are ubiquitous in a wide range of Wireless Sensor Network (WSN) applications, yet there does not exist a common mechanism that addresses both the considerable constraints of WSNs and the specific properties of Complex Events. We argue that Complex Events cannot be described using standard threshold-based or composite logic approaches and attempting to represent them as such can lead to unpredictable execution cost while detection accuracy suffers from erroneous recording of observations which are common in WSNs. To address this, we develop a family of Complex Event Detection (CED) algorithms based on online symbolic conversion of sensor readings. With fixed execution cost and modest resource requirements, the CED algorithms cater for exact, approximate, non-parametric, multiple and probabilistic detection that is neither application nor data dependent. Overall, full implementation and simulations provide experimental evidence of the advantages of the proposed approach. We find that the proposed algorithms minimise configuration, promote unattended operation and complement the goal of prolonged lifetime--factors that satisfy the long-term research vision predicting Internet-scale WSNs comprising billions of devices.
TL;DR: Performance comparisons between the proposal and previous approaches show how the former can efficiently reach a deployment at the desired variable density with moderate energy consumption under a wide range of operative settings.
Abstract: The use of mobile sensors is of great relevance to monitor critical areas where sensors cannot be deployed manually. The presence of data collector sinks causes increased energy depletion in their proximity, due to the higher relay load under multi-hop communication schemes (sink-hole phenomenon). We propose a new approach towards the solution of this problem by means of an autonomous deployment algorithm that guarantees the adaptation of the sensor density to the sink proximity and enables their selective activation. The proposed algorithm also permits a fault tolerant and self-healing deployment, and allows the realization of an integrated solution for deployment, dynamic relocation and selective sensor activation. We formally prove the termination of our algorithm. Performance comparisons between our proposal and previous approaches show how the former can efficiently reach a deployment at the desired variable density with moderate energy consumption under a wide range of operative settings.
TL;DR: A general framework for guaranteeing object identification reliability is proposed and existing schemes for reliability improved are briefly compared within this framework.
Abstract: Radio frequency identification (RFID) provides a more convenient and automatic approach for object identification than traditional universal product code-based barcode technology. However, radio communications are naturally unreliable and inevitably lead to unreliable object identification, which in turn encumber some special applications demanding large-scale deployment of RFID, even though many RFID applications have been emerging recent years. This paper discusses object identification reliability. We first list factors that could cause false readings and lead to unreliable object identification. Then we provide five definitions that directly and formally define object identification reliability. Based on these reliability-related definitions, a general framework for guaranteeing object identification reliability is proposed in this paper. Existing schemes for reliability improved are briefly compared within this framework.
TL;DR: A considerable part of Mobilware’10 follows this success with a technical program that covers a wide range of hot issues in research and practitioning of mobile middleware technologies, including new applications for mobile services, such as multimedia, wireless sensor and vehicular network applications, and surveillance systems.
Abstract: The most visible technology advance in the last decade is arguably the popular uses of wireless mobile handsets such as cellular phones. These devices are not just for phone calls, but also for the Internet access and management of mobile data. Many of them are equipped with positioning systems such as GPS, creating significant commercial opportunities for a range of new applications such as location-based services. Indeed, despite the recent economic downturn, the mobile computing industry continues to boom. A crucial technological challenge to develop applications for wireless mobile handsets is to deal with their heterogeneity. There are a large number of models running different operating systems. They come with vastly different capabilities in terms of computing power and applications they can support, and unlike traditional computers such as desktops and laptops, many times the software development kits are manufacturer-specific or even model-specific. Targeting at different consumer groups, they are also designed with different considerations on key components such as wireless interfaces, screen size, with or without keyboard/accelerometer/GPS, and so on. Developing novel mobile middleware solutions appears to be a natural strategy to circumvent the heterogeneity problem. By allowing application developers to concentrate their efforts on application logic, without taking into account the device-specific issues, the development and deployment of applications over heterogeneous mobile devices can be greatly accelerated and simplified. It is motivated by this belief that in 2008 the International Conference on MOBILe Wireless MiddleWARE, Operating Systems, and Applications (Mobilware) was launched with the specific goal to identify, propose, validate, and spread the adoption of open and interoperable software-support solutions, specifically designed and implemented for wireless mobile handsets. The past 2008 and 2009 editions of Mobilware were highly successful, attracting a large number of high-quality technical submissions from both academic and industrial communities. Mobilware’10 follows this success with a technical program that covers a wide range of hot issues in research and practitioning of mobile middleware technologies. Some papers address network, systems, and service management issues in dependence of location and context. Some contributions relate to middleware interface management, architectures, and security. A considerable part of the program is devoted to new applications for mobile services, such as multimedia, wireless sensor and vehicular network applications, and surveillance systems. This special section of MONET is organized with the extended versions of the papers selected from the best P. Bellavista University of Bologna, Bologna, Italy
TL;DR: A novel approach based on a controller that can automatically adjust streaming parameters basing on feedback measures from the client device providing high Quality of Service (QoS) in remote visualizations is presented.
Abstract: Wireless communication advances have enabled emerging video streaming applications to mobile handheld devices. For example, it is possible to display and interact with complex 3D virtual environments on mobile devices that don't have enough computational and storage capabilities (e.g. smart phones, PDAs) through remote rendering techniques, where a server renders 3D data and streams the corresponding image flow to the client. However, due to fluctuations in bandwidth characteristics and limited mobile device CPU capabilities, it is extremely challenging to design effective systems for streaming interactive multimedia over wireless networks. This paper presents a novel approach based on a controller that can automatically adjust streaming parameters basing on feedback measures from the client device. Experimental results prove the effectiveness of the proposed solution in coping with bandwidth changes, thus providing high Quality of Service (QoS) in remote visualizations.
TL;DR: A nature inspired meta-heuristic algorithm is tailored to solve the problem of congestion of gateways while designing WMNs and proposes a simultaneous optimization of three competing objectives, namely network deployment cost, interference between network channels and congestion of Gateways while guaranteeing full coverage for mesh clients.
Abstract: In Wireless Mesh Networks (WMNs), traffic is mainly routed by WMN Backbone (WMNB) between the mesh clients and the Internet and goes through mesh gateways. Since almost all traffic has to pass through one of the MGs, the network may be unexpectedly congested at one or more of them, even if every mesh router provides enough throughput capacity. In this paper, we address the problem of congestion of gateways while designing WMNs. We propose a simultaneous optimization of three competing objectives, namely network deployment cost, interference between network channels and congestion of gateways while guaranteeing full coverage for mesh clients. We tailor a nature inspired meta-heuristic algorithm to solve the model whereby, several trade-off solutions are provided to the network planner to choose from. A comparative experimental study with different key parameter settings is conducted to evaluate the performance of the model.
TL;DR: The result in the distributed scheme is able to provide sufficiently accurate predication of the global optimization and can clearly reduce the Symbol Error Rate (SER) and achieve higher STR compared with two existing energy-efficient routing protocols, in which no joint design is considered.
Abstract: In this paper, we study the reliable packet forwarding in Wireless Sensor Networks (WSNs) with the multiple-input multiple-output (MIMO) and orthogonal space time block codes (OSTBC) techniques. The objective is to propose a cross-layer optimized forwarding scheme to maximize the Successful Transmission Rate (STR) while satisfying the given end-to-end power consumption constraint. The channel coding, power allocation, and route planning are jointly considered to significantly improve the transmission quality in terms of STR. The joint optimization design is formulated as a global deterministic optimization and also a local stochastic optimization issues. It is found that the stochastic optimization approach can effectively model, analyze, and solve the routing problem. In order to substantially reduce the implementation complication of the global optimization, we propose a low-complexity distributed scheme. The determination of relaying nodes and power budgets are decoupled, i.e. performing route planning and power allocation separately. We have shown that the result in the distributed scheme is able to provide sufficiently accurate predication of the global optimization. In addition, the proposed scheme can clearly reduce the Symbol Error Rate (SER) and achieve higher STR compared with two existing energy-efficient routing protocols, in which no joint design is considered.
TL;DR: Initial numerical results demonstrate the effectiveness of the proposed architecture and reveal the benefits of such a service oriented paradigm against other existing access oriented autonomic designs, providing a viable path towards the evolution and realization of the future wireless networking paradigm.
Abstract: In this paper the problem of seamless mobility and proficient joint radio resource management over an all-IP internetworked wireless heterogeneous environment is addressed. Nodes' autonomicity is envisioned as the enabler to devise a Quality of Service (QoS) aware architecture for supporting a variety of services, founded on a common utility based framework that provides enhanced flexibility in reflecting different access networks' type of resources and diverse QoS prerequisites, under a unified QoS-aware resource allocation optimization problem. This allows a more in-depth intrinsic wireless network convergence, beyond All-IP, driven by QoS-oriented resource management. This vision is demonstrated and instantiated for integrated WLAN and cellular (both CDMA and OFDMA) networks, providing a viable path towards the evolution and realization of the future wireless networking paradigm. Initial numerical results demonstrate the effectiveness of the proposed architecture and reveal the benefits of such a service oriented paradigm against other existing access oriented autonomic designs.