995 resultados para mobile sensors


Relevância:

20.00% 20.00%

Publicador:

Resumo:

Mobile applications are being increasingly deployed on a massive scale in various mobile sensor grid database systems. With limited resources from the mobile devices, how to process the huge number of queries from mobile users with distributed sensor grid databases becomes a critical problem for such mobile systems. While the fundamental semantic cache technique has been investigated for query optimization in sensor grid database systems, the problem is still difficult due to the fact that more realistic multi-dimensional constraints have not been considered in existing methods. To solve the problem, a new semantic cache scheme is presented in this paper for location-dependent data queries in distributed sensor grid database systems. It considers multi-dimensional constraints or factors in a unified cost model architecture, determines the parameters of the cost model in the scheme by using the concept of Nash equilibrium from game theory, and makes semantic cache decisions from the established cost model. The scenarios of three factors of semantic, time and locations are investigated as special cases, which improve existing methods. Experiments are conducted to demonstrate the semantic cache scheme presented in this paper for distributed sensor grid database systems.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Next generation wireless systems employ Orthogonal frequency division multiplexing (OFDM) physical layer owing to the high data rate transmissions that are possible without increase in bandwidth. While TCP performance has been extensively studied for interaction with link layer ARQ, little attention has been given to the interaction of TCP with MAC layer. In this work, we explore cross-layer interactions in an OFDM based wireless system, specifically focusing on channel-aware resource allocation strategies at the MAC layer and its impact on TCP congestion control. Both efficiency and fairness oriented MAC resource allocation strategies were designed for evaluating the performance of TCP. The former schemes try to exploit the channel diversity to maximize the system throughput, while the latter schemes try to provide a fair resource allocation over sufficiently long time duration. From a TCP goodput standpoint, we show that the class of MAC algorithms that incorporate a fairness metric and consider the backlog outperform the channel diversity exploiting schemes.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In this paper we focus on the challenging problem of place categorization and semantic mapping on a robot with-out environment-specific training. Motivated by their ongoing success in various visual recognition tasks, we build our system upon a state-of-the-art convolutional network. We overcome its closed-set limitations by complementing the network with a series of one-vs-all classifiers that can learn to recognize new semantic classes online. Prior domain knowledge is incorporated by embedding the classification system into a Bayesian filter framework that also ensures temporal coherence. We evaluate the classification accuracy of the system on a robot that maps a variety of places on our campus in real-time. We show how semantic information can boost robotic object detection performance and how the semantic map can be used to modulate the robot’s behaviour during navigation tasks. The system is made available to the community as a ROS module.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We consider a scenario in which a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing a function of the measurements and communicating it to an operator station. We restrict ourselves to the class of type-threshold functions (as defined in the work of Giridhar and Kumar, 2005), of which max, min, and indicator functions are important examples: our discussions are couched in terms of the max function. We view the problem as one of message-passing distributed computation over a geometric random graph. The network is assumed to be synchronous, and the sensors synchronously measure values and then collaborate to compute and deliver the function computed with these values to the operator station. Computation algorithms differ in (1) the communication topology assumed and (2) the messages that the nodes need to exchange in order to carry out the computation. The focus of our paper is to establish (in probability) scaling laws for the time and energy complexity of the distributed function computation over random wireless networks, under the assumption of centralized contention-free scheduling of packet transmissions. First, without any constraint on the computation algorithm, we establish scaling laws for the computation time and energy expenditure for one-time maximum computation. We show that for an optimal algorithm, the computation time and energy expenditure scale, respectively, as Theta(radicn/log n) and Theta(n) asymptotically as the number of sensors n rarr infin. Second, we analyze the performance of three specific computation algorithms that may be used in specific practical situations, namely, the tree algorithm, multihop transmission, and the Ripple algorithm (a type of gossip algorithm), and obtain scaling laws for the computation time and energy expenditure as n rarr infin. In particular, we show that the computation time for these algorithms scales as Theta(radicn/lo- g n), Theta(n), and Theta(radicn log n), respectively, whereas the energy expended scales as , Theta(n), Theta(radicn/log n), and Theta(radicn log n), respectively. Finally, simulation results are provided to show that our analysis indeed captures the correct scaling. The simulations also yield estimates of the constant multipliers in the scaling laws. Our analyses throughout assume a centralized optimal scheduler, and hence, our results can be viewed as providing bounds for the performance with practical distributed schedulers.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The Body Area Network (BAN) is an emerging technology that focuses on monitoring physiological data in, on and around the human body. BAN technology permits wearable and implanted sensors to collect vital data about the human body and transmit it to other nodes via low-energy communication. In this paper, we investigate interactions in terms of data flows between parties involved in BANs under four different scenarios targeting outdoor and indoor medical environments: hospital, home, emergency and open areas. Based on these scenarios, we identify data flow requirements between BAN elements such as sensors and control units (CUs) and parties involved in BANs such as the patient, doctors, nurses and relatives. Identified requirements are used to generate BAN data flow models. Petri Nets (PNs) are used as the formal modelling language. We check the validity of the models and compare them with the existing related work. Finally, using the models, we identify communication and security requirements based on the most common active and passive attack scenarios.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

An ad hoc network is composed of mobile nodes without any infrastructure. Recent trends in applications of mobile ad hoc networks rely on increased group oriented services. Hence multicast support is critical for ad hoc networks. We also need to provide service differentiation schemes for different group of users. An efficient application layer multicast (APPMULTICAST) solution suitable for low mobility applications in MANET environment has been proposed in [10]. In this paper, we present an improved application layer multicast solution suitable for medium mobility applications in MANET environment. We define multicast groups with low priority and high priority and incorporate a two level service differentiation scheme. We use network layer support to build the overlay topology closer to the actual network topology. We try to maximize Packet Delivery Ratio. Through simulations we show that the control overhead for our algorithm is within acceptable limit and it achieves acceptable Packet Delivery Ratio for medium mobility applications.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The paper explores the effect of customer satisfaction with online supporting services on loyalty to providers of an offline core service. Supporting services are provided to customers before, during, or after the purchase of a tangible or intangible core product, and have the purpose of enhancing or facilitating the use of this product. The internet has the potential to dominate all other marketing channels when it comes to the interactive and personalised communication that is considered quintessential for supporting services. Our study shows that the quality of online supporting services powerfully affects satisfaction with the provider and customer loyalty through its effect on online value and enjoyment. Managerial implications are provided.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The thesis is positioned in the services marketing field. Previous mobile service research has identified perceived value or relative advantage as a stable predictor of use of services. However, a more detailed view of what customers value in mobile services is needed for marketing diverse types of mobile content and attracting committed customers. The direct relationships between multidimensional value and loyalty constructs have received limited attention in the previous literature, although a multidimensional view is needed for differentiating services. This thesis studies how perceived value of mobile service use affects customer commitment, repurchase intentions, word-of-mouth and willingness to pay. The doctoral thesis consists of three journal articles and one working paper. The four papers have different sub-aims and comprise individual empirical studies. Mixed methods including both personal interviews and survey data collected from end-users of different types of mobile content services are used. The conceptual mobile perceived value model that results from the first explorative empirical study supports a six- dimensional value view. The six dimensions are further categorized into two higher order constructs: content-related perceived value (emotional, social, convenience and monetary value) and context-related (epistemic and conditional value) perceived value. Structural equation modeling is used in the other three studies to validate this framework by analyzing the relationships between context- and content-related value, and how the individual perceived value dimensions affect commitment and behavioral outcomes. Analyzing the direct relationships revealed differences in the effect of perceived value dimensions between information and entertainment mobile service user groups, between effects on commitment, repurchase intentions and word-of-mouth intentions, as well as between effects on commitment to the provider and to the mobile channel as such. This thesis contributes to earlier perceived value literature by structuring the value dimensions into two groups. Most importantly, the thesis contributes to the value and loyalty literature by increasing understanding of how the different dimensions of perceived value directly affect commitment and post-purchase intentions. The results have implications for further theory development in the electronic services field using multidimensional latent constructs, and practical implications for enhancing commitment to content provider and for differentiated marketing strategies in the mobile field. The general conclusion of this thesis is that differentiated value-based marketing of mobile services is essential for attracting committed customers who will use the same providers’ content also in the future. Minna Pihlström is associated with the Centre for Relationship Marketing and Service Management (CERS) at Hanken.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This paper proposes and compares four methods of binarzing text images captured using a camera mounted on a cell phone. The advantages and disadvantages(image clarity and computational complexity) of each method over the others are demonstrated through binarized results. The images are of VGA or lower resolution.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This paper describes the design and development of a thermoelectric gas sensor suitable for the detection of Volatile Organic Compounds (VOCs). In order to enhance the seebeck coefficient of the sensor, we have deposited chromium metal films on a limited area of the glass substrate. Tin oxide thin film was deposited on top of these metal films. The resulting metal/semiconductor film exhibits a high seebeck coefficient of 400 mu V/ degrees C. Platinum catalyst film deposited on the oxide film to create the necessary temperature gradient resulted in further enhancement in the sensitivity of the sensor to target gases. The sensor shows high sensitivity to ppm-change in the concentration of target hydrocarbons at a relatively low temperature of 120 degrees C.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We present the theoretical foundations for the multiple rendezvous problem involving design of local control strategies that enable groups of visibility-limited mobile agents to split into subgroups, exhibit simultaneous taxis behavior towards, and eventually rendezvous at, multiple unknown locations of interest. The theoretical results are proved under certain restricted set of assumptions. The algorithm used to solve the above problem is based on a glowworm swarm optimization (GSO) technique, developed earlier, that finds multiple optima of multimodal objective functions. The significant difference between our work and most earlier approaches to agreement problems is the use of a virtual local-decision domain by the agents in order to compute their movements. The range of the virtual domain is adaptive in nature and is bounded above by the maximum sensor/visibility range of the agent. We introduce a new decision domain update rule that enhances the rate of convergence by a factor of approximately two. We use some illustrative simulations to support the algorithmic correctness and theoretical findings of the paper.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In this paper, the behaviour of a group of autonomous mobile agents under cyclic pursuit is studied. Cyclic pursuit is a simple distributed control law, in which the agent i pursues agent i + 1 modulo n.. The equations of motion are linear, with no kinematic constraints on motion. Behaviourally, the agents are identical, but may have different controller gains. We generalize existing results in the literature and show that by selecting these gains, the behavior of the agents can be controlled. They can be made to converge at a point or be directed to move in a straight line. The invariance of the point of convergence with the sequence of pursuit is also shown.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This paper describes the design and development of a Fiber Bragg Grating (FBG) sensor system for monitoring tsunami waves generated in the deep ocean. An experimental setup was designed and fabricated to simulate the generation and propagation of a tsunami wave. The characteristics and efficiency of the developed FBG sensor was evaluated with a standard commercial Digiquartz sensor. For real time monitoring of tsunami waves, FBG sensors bonded to a cantilever is used and the wavelength shifts (Delta lambda(B)) in the reflected spectra resulting from the strain/pressure imparted on the FBGs have been recorded using a high-speed Micron Optics FBG interrogation system. The parameters sensed are the signal burst during tsunami generation and pressure variations at different places as the tsunami wave propagates away from the source of generation. The results obtained were compared with the standard commercial sensor used in tsunami detection. The observations suggest that the FBG sensor was highly sensitive and free from many of the constraints associated with the commercial tsunameter.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This thesis is an exploratory case study that aims to understand the attitudes affecting adoption of mobile self-services. This study used a demo mobile self-service that could be used by consumers for making address changes. The service was branded with a large and trusted Finnish brand. The theoretical framework that was used consisted of adoption theories of technology, adoption theories of self-service and literature concerning mobile services. The reviewed adoption theories of both technology and self-service had their foundation in IDT or TRA/TPB. Based on the reviewed theories an initial framework was created. The empirical data collection was done through three computer aided group interview sessions with a total of 32 respondents. The data analysis started from the premises of the initial framework. Based on the empirical data the framework was constantly reviewed and altered and the data recoded accordingly. The result of this thesis was a list of attitudinal factors that affect the adoption of a mobile self-service either positively or negatively. The factors that were found to affect the attitudes towards adoption of mobile self-services positively were: that the service was time & place independent and saved time. Most respondents, but not all, also had a positive attitude towards adoption due to ease of use and being mentally compatible with the service. Factors that affected adoption negatively were lack of technical compatibility, perceived risk for high costs and risk for malicious software. The identified factors were triangulated in respect to existing literature and general attitudes towards mobile services.