PROBESYNC: Platform Based Synchronization for Enhanced Life of Large Scale Wireless Sensor Networks

Optimization in energy consumption of the existing synchronization mechanisms can lead to substantial gains in terms of network life in Wireless Sensor Networks (WSNs). In this paper, we analyze ERBS and TPSN, two existing synchronization algorithms for WSNs which use widely different approach, and compare their performance in large scale WSNs each of which consists of different type of platform and has varying node density. We, then, propose a novel algorithm, PROBESYNC, which takes advantage of differences in power required to transmit and receive a message on ERBS and TPSN and leverages the shortcomings of each of these algorithms. This leads to considerable improvement in energy conservation and enhanced life of large scale WSNs.

Time and Energy Complexity of Distributed Computation of a Class of Functions in Wireless Sensor Networks

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.

The channels of monetary policy triggered by central bank actions and statements in the Australian equity market

Owing to the discrete disclosure practices of the Reserve Bank of Australia, this paper provides new evidence on the channels of monetary policy triggered by central bank actions (monetary policy announcements) and statements (explanatory minutes releases), in the Australian equity market. Both monetary policy announcements and explanatory minutes releases are shown to have a significant and comparable impact on the returns and volatility of the Australian equity market. Further, distinct from US and European studies that find strong evidence of the interest rate, bank loan and balance sheet channels and no evidence of the exchange rate channel following central bank actions, this paper finds that monetary policy impacts the Australian equity market via the exchange rate, interest rate and bank loan channels of monetary policy, with only weak evidence of the balance sheet channel of monetary policy. These channels are found to be operating irrespective of the trigger (monetary policy announcements or explanatory minutes releases), though results are somewhat weaker when examining the explanatory minutes releases. These results have important implications for central bank officials and financial market participants alike: by confirming a comparable avenue to affect monetary policy; and providing an explication of its impact on the Australian equity market.

Understanding data flow and security requirements in wireless Body Area Networks for healthcare

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.

Zervamicins, a structurally characterised peptide model for membrane ion channels

Voltage dependent membrane channels are formed by the zervamicins, a group of α-aminoisobutyric acid containing peptides. The role of polar residues like Thr, Gln and Hyp in promoting helical bundle formation is established by dramatically reduced channel lifetimes for a synthetic apolar analog. Crystal structures of Leu1-zervamicin reveal association of bent helices. Polar contacts between convex faces result in an ‘hour glass’ like arrangement of an aqueous channel with a central constriction. The structure suggests that gating mechanisms may involve movement of the Gln11 carboxamide group. Gln3 may play a role in modulating the size of the channel mouth.

Uuden median murros Alma Mediassa, Sanoma Oy:ssä ja Yleisradiossa 1994-2004

This is a qualitative and multimethodological comparative study, which consists of two main parts: examining the development of new media and analysing and comparing the new media strategies of the three companies studied (Alma Media, Sanoma and the Finnish Broadcasting Company Yleisradio). The study includes the first large-scale review in Finnish of the development of new media, paying attention to the birth of the Internet as well as to mobile media, web TV and any other element of new media. It also concentrates on the function of electronic distribution channels before the age of the Internet, e.g. cable text and videotext. Answers about how the three traditional Finnish media houses began spreading their content to the Internet and wireless applications in 1994–2004 are also given. In researching the new media strategies the study pays special attention to the attitudes that the three media companies adopted towards the Internet and other forms of new media in their strategies during the years in question. By analysing and comparing, e.g., the companies’ strategies and their investments, the study ascertains whether the companies had a joint functional model in adopting new media or acted totally on their own without taking too much notice of the media field overall. The study makes extensive use of previously published material. The researcher has also interviewed almost twenty people who were involved in getting the companies’ new media functions under way. The methods for the interviews were dialogue and snowball sampling. The researcher has created a classification in which he divides the business strategies into four different categories: active strategy, careful strategy, permissive strategy, and passive strategy. In comparing and analysing the companies the researcher has used the classification devised by Allan Afuah & Christopher L. Tucci. The seven element classification consists of dominant managerial logic, competency trap, fear of cannibalisation and loss of revenue, channel conflict, political power, co-opetitor power and emotional attachment. In analysing the company strategies the researcher has also noted the classifications of convergence made by Everette E. Dennis and Graham Murdock as well as the aspects formulated by Sylvia Chan-Olmsted and Louisa Ha concerning the success of the companies in adopting the Internet into their functions. Based on all these classifications and by further developing them the researcher analyses and compares the success of the new media strategies of the three Finnish companies. The outcome of the study is a conclusion as to what kind of strategies the companies have carried out their new media functions and how they have succeeded in it.

An analytical approach to the study of cooperation in wireless ad hoc networks

In wireless ad hoc networks, nodes communicate with far off destinations using intermediate nodes as relays. Since wireless nodes are energy constrained, it may not be in the best interest of a node to always accept relay requests. On the other hand, if all nodes decide not to expend energy in relaying, then network throughput will drop dramatically. Both these extreme scenarios (complete cooperation and complete noncooperation) are inimical to the interests of a user. In this paper, we address the issue of user cooperation in ad hoc networks. We assume that nodes are rational, i.e., their actions are strictly determined by self interest, and that each node is associated with a minimum lifetime constraint. Given these lifetime constraints and the assumption of rational behavior, we are able to determine the optimal share of service that each node should receive. We define this to be the rational Pareto optimal operating point. We then propose a distributed and scalable acceptance algorithm called Generous TIT-FOR-TAT (GTFT). The acceptance algorithm is used by the nodes to decide whether to accept or reject a relay request. We show that GTFT results in a Nash equilibrium and prove that the system converges to the rational and optimal operating point.

Analysis of gradually and spatially varied flow in sand-bed channels

Seepage through a sand bed affects the channel hydrodynamics, which in turn alters channel stability. Thus, the effect of seepage on its hydrodynamic parameters needs to be ascertained. The present work analyses spatially varied flow of a sand-bed channel subjected to seepage in the downward direction through a sand bed. Numerically calculated flow profiles affected by seepage have been verified using experimental observations. The present work also analyses the friction slope, velocity and bed shear stress variations along the channel for both seepage and no-seepage conditions. It was found that the downward seepage-induced channel flow has larger friction slope and bed shear stress than that of no-seepage.

First simultaneous measurement of the top quark mass in the lepton+jets and dilepton channels at CDF

We present a measurement of the mass of the top quark using data corresponding to an integrated luminosity of 1.9fb^-1 of ppbar collisions collected at sqrt{s}=1.96 TeV with the CDF II detector at Fermilab's Tevatron. This is the first measurement of the top quark mass using top-antitop pair candidate events in the lepton + jets and dilepton decay channels simultaneously. We reconstruct two observables in each channel and use a non-parametric kernel density estimation technique to derive two-dimensional probability density functions from simulated signal and background samples. The observables are the top quark mass and the invariant mass of two jets from the W decay in the lepton + jets channel, and the top quark mass and the scalar sum of transverse energy of the event in the dilepton channel. We perform a simultaneous fit for the top quark mass and the jet energy scale, which is constrained in situ by the hadronic W boson mass. Using 332 lepton + jets candidate events and 144 dilepton candidate events, we measure the top quark mass to be mtop=171.9 +/- 1.7 (stat. + JES) +/- 1.1 (syst.) GeV/c^2 = 171.9 +/- 2.0 GeV/c^2.

Design of incentive compatible protocols for wireless networks: A game theoretic approach

In this thesis work, we design rigorous and efficient protocols/mechanisms for different types of wireless networks using a mechanism design [1] and game theoretic approach [2]. Our work can broadly be viewed in two parts. In the first part, we concentrate on ad hoc wireless networks [3] and [4]. In particular, we consider broadcast in these networks where each node is owned by independent and selfish users. Being selfish, these nodes do not forward the broadcast packets. All existing protocols for broadcast assume that nodes forward the transit packets. So, there is need for developing new broadcast protocols to overcome node selfishness. In our paper [5], we develop a strategy proof pricing mechanism which we call immediate predecessor node pricing mechanism (IPNPM) and an efficient new broadcast protocol based on IPNPM. We show the efficacy of our proposed broadcast protocol using simulation results.

Fading Customer Relationships

This dissertation is based on the assumption that fading customer relationships are important phenomena to understand in order for companies to prevent a future relationship termination, manage a desired relationship termination, or manage the situation where the relationship strength temporarily or permanently has weakened but where the customer still stays with the same service provider. It is assumed that fading could take different forms and develop through a range of different processes. The purpose of the thesis is therefore to define and describe fading, reveal different types of fading relationship processes, and discuss the dynamics of these processes. In services literature there is a lack of research focusing on the weakening of customer relationships. Fading therefore represents a new approach to understanding issues related to the ending of customer relationships. A fading relationship process could precede a relationship ending, but could also represent a temporal weakening of the relationship without leading to termination. It thus distinguishes the concept from other concepts within ending research which focus solely on relationships that have been terminated, taking a larger aspect of the relationship into account (as a relationship could build on constant changes). A pilot study created an understanding of difficulties related to understanding and detecting fading customer relationship, which led to a follow-up study incorporating qualitative interviews in relationship dyads characterised as fading with both private banking customers and their respective financial advisor. The focus remained on the understanding of the fading process resulting in a model for analysing different types of fading processes. Four types of fading processes were also revealed; the crash landing process, the altitude drop process, the fizzle out process and the try out process. The dissertation contributes to a broadened understanding of different types of fading processes within the research area of ending relationships emphasising the dynamic aspects of the phenomenon. Managerial implications include the management of different types of fading processes and also the understanding of the financial advisor’s role in influencing the development of these processes. Helena Åkerlund is associated with CERS, the Centre for Relationship Marketing and Service Management at Hanken, Swedish School of Economics and Business Administration, Helsinki

An efficient pricing based protocol for broadcasting in wireless ad hoc networks

In many applications of wireless ad hoc networks, wireless nodes are owned by rational and intelligent users. In this paper, we call nodes selfish if they are owned by independent users and their only objective is to maximize their individual goals. In such situations, it may not be possible to use the existing protocols for wireless ad hoc networks as these protocols assume that nodes follow the prescribed protocol without deviation. Stimulating cooperation among these nodes is an interesting and challenging problem. Providing incentives and pricing the transactions are well known approaches to stimulate cooperation. In this paper, we present a game theoretic framework for truthful broadcast protocol and strategy proof pricing mechanism called Immediate Predecessor Node Pricing Mechanism (IPNPM). The phrase strategy proof here means that truth revelation of cost is a weakly dominant-strategy (in game theoretic terms) for each node. In order to steer our mechanism-design approach towards practical implementation, we compute the payments to nodes using a distributed algorithm. We also propose a new protocol for broadcast in wireless ad hoc network with selfish nodes based on IPNPM. The features of the proposed broadcast protocol are reliability and a significantly reduced number of packet forwards compared to the number of network nodes, which in turn leads to less system-wide power consumption to broadcast a single packet. Our simulation results show the efficacy of the proposed broadcast protocol.

QoS with selfish nodes in wireless networks

The IEEE 802.1le medium access control (MAC) standard provides distributed service differentiation or Quality-of- Service (QoS) by employing a priority system. In 802.1 le networks, network traffic is classified into different priorities or access categories (ACs). Nodes maintain separate queues for each AC and packets at the head-of-line (HOL) of each queue contend for channel access using AC-specific parameters. Such a mechanism allows the provision of differentiated QoS where high priority, performance sensitive traffic such as voice and video applications will enjoy less delay, greater throughput and smaller loss, compared to low priority traffic (e. g. file transfer). The standard implicitly assumes that nodes are honest and will truthfully classify incoming traffic into its appropriate AC. However, in the absence of any additional mechanism, selfish users can gain enhanced performance by selectively classifying low priority traffic as high priority, potentially destroying the QoS capability of the system.

Stability of scheduled message communication over degraded broadcast channels

We develop a multi-class discrete-time processor-sharing queueing model for scheduled message communication over a discrete memoryless degraded broadcast channel. The framework we consider here models both the random message arrivals and the subsequent reliable communication by suitably combining techniques from queueing theory and information theory. Requests for message transmissions are assumed to arrive according to i.i.d. arrival processes. Then, (i) we derive an outer bound to the stability region of message arrival rate vectors achievable by the class of stationary scheduling policies, (ii) we show for any message arrival rate vector that satisfies the outer bound, that there exists a stationary "state-independent" policy that results in a stable system for the corresponding message arrival processes, and (iii) under an asymptotic regime, we show that the stability region of information arrival rate vectors is the information-theoretic capacity region of a degraded broadcast channel.