Rendezvous based routing protocol for wireless sensor networks with mobile sink

In wireless sensor networks, the sensor nodes find the route towards the sink to transmit data. Data transmission happens either directly to the sink node or through the intermediate nodes. As the sensor node has limited energy, it is very important to develop efficient routing technique to prolong network life time. In this paper we proposed rendezvous-based routing protocol, which creates a rendezvous region in the middle of the network and constructs a tree within that region. There are two different modes of data transmission in the proposed protocol. In Method 1, the tree is directed towards the sink and the source node transmits the data to the sink via this tree, whereas in Method 2, the sink transmits its location to the tree, and the source node gets the sink’s location from the tree and transmits the data directly to the sink. The proposed protocol is validated through experiment and compared with the existing protocols using some metrics such as packet delivery ratio, energy consumption, end-to-end latency, network life time.     

Hybrid NSCT domain multiple watermarking for medical images

Multimedia Tools and Applications - Medical image watermarking is a challenging area of research. High bandwidth, secure transmission of patient’s data among hospitals and hiding capacity are...     

An SDP Primal-Dual Algorithm for Approximating the Lovász-Theta Function

The Lovász ?-function (Lovász in IEEE Trans. Inf. Theory, 25:1–7, 1979) of a graph G=(V,E) can be defined as the maximum of the sum of the entries of a positive semidefinite matrix X, whose trace Tr(X) equals 1, and X _ij =0 whenever {i,j}∈E. This function appears as a subroutine for many algorithms for graph problems such as maximum independent set and maximum clique. We apply Arora and Kale’s primal-dual method for SDP to design an algorithm to approximate the ?-function within an additive error of δ>0, which runs in time $O(\frac{\vartheta ^{2} n^{2}}{\delta^{2}} \log n \cdot M_{e})$ , where ?=?(G) and M _e =O(n ³) is the time for a matrix exponentiation operation. It follows that for perfect graphs G, our primal-dual method computes ?(G) exactly in time O(? ² n ⁵logn). Moreover, our techniques generalize to the weighted Lovász ?-function, and both the maximum independent set weight and the maximum clique weight for vertex weighted perfect graphs can be approximated within a factor of (1+?) in time O(? ^?2 n ⁵logn).     

Automated dynamic detection of busy–wait synchronizations

With the advent of multicores, multithreaded programming has acquired increased importance. In order to obtain good performance, the synchronization constructs in multithreaded programs need to be carefully implemented. These implementations can be broadly classified into two categories: busy–wait and schedule‐based. For shared memory architectures, busy–wait synchronizations are preferred over schedule‐based synchronizations because they can achieve lower wakeup latency, especially when the expected wait time is much shorter than the scheduling time. While busy–wait synchronizations can improve the performance of multithreaded programs running on multicore machines, they create a challenge in program debugging, especially in detecting and identifying the causes of data races. Although significant research has been done on data race detection, prior works rely on one important assumption—the debuggers are aware of all the synchronization operations performed during a program run. This assumption is a significant limitation as multithreaded programs, including the popular SPLASH‐2 benchmark have busy–wait synchronizations such as barriers and flag synchronizations implemented in the user code. We show that the lack of knowledge of these synchronization operations leads to unnecessary reporting of numerous races. To tackle this problem, we propose a dynamic technique for identifying user‐defined synchronizations that are performed during a program run. Both software and hardware implementations are presented. Furthermore, our technique can be easily exploited by a record/replay system to significantly speedup the replay. It can also be leveraged by a transactional memory system to effectively resolve a livelock situation. Our evaluation confirms that our synchronization detector is highly accurate with no false negatives and very few false positives. We further observe that the knowledge of synchronization operations results in 23% reduction in replay time. Finally, we show that using synchronization knowledge livelocks can be efficiently avoided during runtime monitoring of programs. Copyright © 2009 John Wiley & Sons, Ltd.     

Cross‐polarization reduction of microstrip antenna using microwave absorbers

In this article, a metamaterial inspired microwave absorber is used to reduce the cross‐polarization (XP) level of the radiated wave in microstrip antenna (MSA). A microwave absorber unit‐cell has been analyzed and implemented to reduce the cross polarization (XP) level in a single element and a 2 × 2 microstrip patch array antennas. The antennas have been designed on a FR‐4 substrate of thickness 0.8 mm at 10.1 GHz center frequency. The 2 × 2 patch array antenna with and without the absorbers have been experimentally verified for the S11 parameter, the radiation pattern, and the XP suppression in H‐plane and a good comparison has been found.     

A system for debugging via online tracing and dynamic slicing

Dynamic slicing is a promising trace based technique that helps programmers in the process of debugging. In order to debug a failed run, dynamic slicing requires the dynamic dependence graph (DDG) information for that particular run. The two major challenges involved in utilizing dynamic slicing as a debugging technique are the efficient computation of the DDG and the efficient computation of the dynamic slice, given the DDG. In this paper, we present an efficient debugger, which first computes the DDG efficiently while the program is executing; dynamic slicing is later performed efficiently on the computed DDG, on demand. To minimize program slowdown during the online computation of DDG, we make the design decision of not outputting the computed dependencies to a file, instead, storing them in memory in a specially allocated fixed size circular buffer. The size of the buffer limits the length of the execution history that can be stored. To maximize the execution history that can be maintained, we introduce optimizations to eliminate the storage of most of the generated dependencies, at the same time ensuring that those that are stored are sufficient to capture the bug. Experiments conducted on CPU‐intensive programs show that our optimizations are able to reduce the trace rate from 16 to 0.8 bytes per executed instruction. This enables us to store the dependence trace history for a window of 20 million executed instructions in a 16‐MB buffer. Our debugger is also very efficient, yielding slicing times of around a second, and only slowing down the execution of the program by a factor of 19 during the online tracing step. Using recently proposed architectural support for monitoring, we are also able to handle multithreaded programs running on multicore processors. Copyright © 2011 John Wiley & Sons, Ltd.     

Implementing enterprise resource planning systems: organizational performance and the duration of the implementation

This paper examines the impact of the duration of ERP implementation on firm performance both during and after implementation. Organizations choose either an accelerated implementation approach or a traditional (longer) implementation approach. The former approach gives the organization the advantage of speed, but the disadvantage of fitting its processes to that of a packaged (thus, undifferentiated from competitors) ERP. The latter approach allows the organization to redesign strategy and processes, and thus, search for ways to be unique from its competition. The study uses a regression model to capture the changes in various performance measures during and after implementation between firms that implemented the ERP, using the performance measure of a matched group of firms that did not implement an ERP as a benchmark/control sample, on the basis of the duration of the implementation. Financial data from Compustat, and data on start date and end date of ERP implementation between 1990 and 2005 for firms in the Oil and Gas industry was collected from an ERP vendor. Results show that measures such as return on sales improved after implementation. However, measures such as inventory turnover, which reflect operational benefits, improve during implementation. We find that accelerated implementation confers both operational and strategic benefits. This study highlights the strategic consequences of the different choices of implementation.     

Data structures for order-sensitive predicates in parallel nondeterministic systems

We study the problem of guaranteeing correct execution semantics in parallel implementations of logic programming languages in presence of built-in constructs that are sensitive to order of execution. The declarative semantics of logic programming languages permit execution of various goals in any arbitrary order (including in parallel). However, goals corresponding to extra-logical built-in constructs should respect the sequential order of execution to ensure correct semantics. Ensuring this correctness in presence of such built-in constructs, while efficiently exploiting maximum parallelism, is a difficult problem. In this paper, we propose a formalization of this problem in terms of operations on dynamic trees. This abstraction enables us to: (i) show that existing schemes to handle order-sensitive computations used in current parallel systems are sub-optimal; (ii) develop a novel, optimal scheme to handle order-sensitive goals that requires only a constant time overhead per operation. While we present our results in the context of logic programming, they will apply equally well to most parallel non-deterministic systems. Received: 20 April 1998 / 3 April 2000     

GIS Approach of Delineation and Risk Assessment of Areas Affected by Arsenic Pollution in Drinking Water

The objective of this study is to analyze health effects of arsenic pollution of drinking water using a geographical information system (GIS). The paper reports the regional impact of arsenic contamination in six administrative blocks of the central part of the Murshidabad district, West Bengal, India. In this area about 1,248,580 people are exposed to arsenic pollution out of whom 388,316 people are exposed to arsenic concentrations above 0.05?mg/L, the WHO maximum permissible level of arsenic in drinking water. The study estimates that 65% of the total area of the six blocks has arsenic concentrations below 0.05?mg/L, 26.12% of the area has arsenic concentrations above 0.05?mg/L, and for the rest of the area no arsenic distribution data available. The total number of expected death cases has been estimated considering the percent of risk involved in a concentration range and corresponding total population using such water for drinking purpose. The analysis forecasts that 11,890 people may risk death due to arsenic pollution in the whole life span. The maximum number of death cases is expected in Domkal and Beldanga 1 blocks and the minimum number of death cases is expected in Block Bhagabangola 2. This study also reports a comparison between the theoretical expectation of death cases and actual reported arsenicosis cases for the Domkal block. The areas of theoretical expectation and the areas of actually reported cases match fairly well except in a few cases. The present study helps planning and implementing of priority-based arsenic mitigation options.