Search

The trend towards tunnel farming and hydroponic systems is increasing owing to the climatic changes as well as the need to increase crop yield. Hydroponic is a technique of growing plants without soil. Tunnel farming and hydroponic system requires controlled environmental parameters like temperature, humidity and soil moisture for better production of crops. This paper presents an effective method, named, ACHPA (Automatically Controlled Hydro-Ponic Agriculture) scheme that monitor and controls environmental parameters using sensors and controller. ACHPA provides better environmental control over traditional manual monitoring and controlling, thus yield high-quality crops. Sensor based monitoring and control system regulates the temperature and humidity of the tunnel to yield better. For the sake of saving water, an efficient method of drip irrigation is implemented which delivers water directly to the plants rather than being sprayed on as in conventional farming method. The proposed system here is tested for controlled environment and observations recorded for crop analysis purpose. This makes an effective solution to growing highly efficient, good quality and disease free crop production.

We study the scaling properties of a georouting scheme in a wireless multi-hop network of $n$ mobile nodes. Our aim is to increase the network capacity quasi-linearly with $n$ , while keeping the average delay bounded. In our model, we consider mobile nodes moving according to an independent identically distributed random walk with velocity $v$ and transmitting packets to randomly chosen fixed and known destinations. The average packet delivery delay of our scheme is of order $1/v$ , and it achieves network capacity of order $({n}/{\log n\log \log n})$ . This shows a practical throughput-delay tradeoff, in particular when compared with the seminal result of Gupta and Kumar, which shows network capacity of order ${(n/\log n)}^{1/2}$ and negligible delay and the groundbreaking result of Grossglauser and Tse, which achieves network capacity of order $n$ but with an average delay of order $\sqrt {n}/v$ . The foundation of our improved capacity and delay tradeoff relies on the fact that we use a mobility model that contains straight-line segments, a model that we consider more realistic than classic Brownian motions. We confirm the generality of our analytical results using simulations under various interference models.

Bluetooth Low Energy (BLE) represents the low-power, low-cost extension of the Bluetooth communication technology envisioned for the Internet of Things. Mesh protocols on top of BLE are currently emerging and the standard is currently being released. This paper first proposes a detailed measurement based comparison of two mesh approaches that fit within BLE operation: flooding and connection oriented networking. Using metrics such as packet delivery ratio (PDR), end-to-end delay and power consumption we conclude that the optimal mesh approach depends on the application. It is shown that for a comparable performance in terms of PDR and overhead, flooding can trade a lower end-to-end delay for a higher power consumption when compared to the connected mesh. We then propose an architecture, called Bluetooth Now, that is able to automatically switch the network between the two based on message priority. Our measurement results confirm the reliable delivery of important and urgent data sent using the Bluetooth Now paradigm, while saving battery life when transmitting non-time critical messages. ispartof: pages:1-6 ispartof: IEEE PIMRC 2017 Special Session SP-04 vol:2017-October pages:1-6 ispartof: IEEE PIMRC 2017 Special Session SP-04 location:Montreal, QC, Canada date:8 Oct - 13 Oct 2017 status: published

Background: Urinary incontinence is a common condition among females and it is estimated that 20-40% females of age under 60 years suffer with urinary incontinence however for the females above 60 years the percentage is 30-50%. Keegal exercises are used to strengthen pelvic floor muscles which ultimately treats and reduces urinary incontinence. It is pretty definite that women with diabetes mellitus at advanced phases of age suffer with urine incontinence, but the severity of matter has yet been considered enough to put forth the cautionary measures to evade such concerns. Purpose of the study is to analyze the effect of pelvic floor exercises on the urinary incontinence in diabetic women. Methods: To evaluate the effect of Keegeal exercises (pelvic floor muscle exercises), quantitative research approach has been opted, in which patient were advised to perform the keegeal exercise for 3weekswith 4 weeks follow up. 45 diabetic women were recruited to analyze the effect of keegal exercises to minimize the risk of urine incontinence. In due course, three types of keegeal exercises have been proposed to analyze their effect on urine incontinence i.e. adductor strengthening, pelvic bridging, and draw in maneuver with a follow up of 4 weeks. Results: Reliability test was performed to evaluate the dependency between independent and dependent variable. Through ANOVA with Friedman's Test, it was observed that the data of correlation between the suggestive variables is highly significant. Cronbach’s Alpha test was performed which has concluded the results to 0.753 which is quite significant in context of research hypothesis and approving the fact the with keegeal exercise, urine incontinence can be reduced. Conclusion: With subjective research it was concluded that if the patient efficiently performs the exercise the urine incontinence can be improved.

Vulnerabilities in key communication protocols that drive the daily operations of the power grid may lead to exploits that could potentially disrupt its safety-critical operation and may result in loss of power, consequent financial losses, and disruption of crucial power-dependent services. This paper focuses on the Inter Control Center Communications Protocol, (ICCP), which is the protocol used among control centers for data exchange and control. We discuss use of UPPAAL in formal modeling of portions of ICCP. Specifically, we present an iterative process and framework for the design and formal verification of tailored checking mechanisms that protect resource-exhaustion vulnerabilities in the protocol standard from attacks and exploits. We discuss insights we gained and lessons we learned when modeling the protocol functionalities and running the UPPAAL model checker to prove critical security and safety properties, and we discuss the overall success of this approach.

In today's IaaS clouds users only get a logical view of the underlying network and have limited control. Delegating more control to end users would be beneficial but would also raise security concerns for the provider. Emerging Software Defined Networking (SDN) technologies have the capabilities to facilitate delegation of network controls and provide some level of network abstractions to end users. However, any delegation solution should try to balance the level of controls delegated to end users with the security constraints of the provider. In this paper, we propose a SDN-based framework to facilitate delegation of some network controls to end users, providing the means to monitor and configure their own slices of the underlying networks. Using two instantiations of this framework, we illustrate the tradeoffs between security and the level of network abstractions provided to end users.

We study the scaling properties of a georouting scheme in a wireless multi-hop network of $n$ mobile nodes. Our aim is to increase the network capacity quasi linearly with $n$ while keeping the average delay bounded. In our model, mobile nodes move according to an i.i.d. random walk with velocity $v$ and transmit packets to randomly chosen destinations. The average packet delivery delay of our scheme is of order $1/v$ and it achieves the network capacity of order $\frac{n}{\log n\log\log n}$. This shows a practical throughput-delay trade-off, in particular when compared with the seminal result of Gupta and Kumar which shows network capacity of order $\sqrt{n/\log n}$ and negligible delay and the groundbreaking result of Grossglausser and Tse which achieves network capacity of order $n$ but with an average delay of order $\sqrt{n}/v$. We confirm the generality of our analytical results using simulations under various interference models., This work has been submitted to IEEE INFOCOM 2012

This article introduces a metric for performance evaluation of medium access schemes in wireless ad hoc networks known as local capacity. Although deriving the end-to-end capacity of wireless ad hoc networks is a difficult problem, the local capacity framework allows us to quantify the average information rate received by a receiver node randomly located in the network. In this article, the basic network model and analytical tools are first discussed and applied to a simple network to derive the local capacity of various medium access schemes. Our goal is to identify the most optimal scheme and also to see how does it compare with more practical medium access schemes. We analyzed grid pattern schemes where simultaneous transmitters are positioned in a regular grid pattern, ALOHA schemes where simultaneous transmitters are dispatched according to a uniform Poisson distribution and exclusion schemes where simultaneous transmitters are dispatched according to an exclusion rule such as node coloring and carrier sense schemes. Our analysis shows that local capacity is optimal when simultaneous transmitters are positioned in a grid pattern based on equilateral triangles and our results show that this optimal local capacity is at most double the local capacity of ALOHA based scheme. Our results also show that node coloring and carrier sense schemes approach the optimal local capacity by an almost negligible difference. At the end, we also discuss the shortcomings in our model as well as future research directions., This work has been accepted to appear in Springer Telecommunication Systems journal. Part of this work was also presented at the Wireless Days 2011 and WMNC 2011

We study the optimal transmission scheme that maximizes the local capacity in two-dimensional (2D) wireless networks. Local capacity is defined as the average information rate received by a node randomly located in the network. Using analysis based on analytical and numerical methods, we show that maximum local capacity can be obtained if simultaneous emitters are positioned in a grid pattern based on equilateral triangles. We also compare this maximum local capacity with the local capacity of slotted ALOHA scheme and our results show that slotted ALOHA can achieve at least half of the maximum local capacity in wireless networks., This work has been presented in the 4th IFIP Wireless-Days conference (WD 2011)

This paper evaluates the performance of IPv4 and IPv6 networks in the absence of link layer protection. Behavior of both the networks has been discussed and simulated in case of ideal scenario, low noise, medium noise, high noise and very high noise environment. Transmission behavior at each router is observed and computed to understand the comparative performance of IPv4 and IPv6 datagram's. Our simulation results for throughput, transmission time, number of corrupted packets and number of retransmissions clearly indicates that IPv6 performs better in ideal and low noise scenario as there is no checksum computed at each router and number of retransmissions for corrupted packets are also less. As the system moves from ideal to high noise, a decline in the performance of IPv6 is observed. IPv4 on the other hand produces better throughput as corrupted packets are verified and discarded at each router which saves extra wastage of bandwidth.

We quantify the throughput capacity of wireless multi-hop networks with several medium access schemes. We analyze pure ALOHA scheme where simultaneous transmitters are dispatched according to a uniform Poisson distribution and exclusion schemes where simultaneous transmitters are dispatched according to an exclusion rule such as node coloring and carrier sense based schemes. We consider both no-fading and standard Rayleigh fading channel models. Our results show that, under no-fading, slotted ALOHA can achieve at least one-third (or half under Rayleigh fading) of the throughput capacity of node coloring scheme whereas carrier sense based scheme can achieve almost the same throughput capacity as node coloring., Comment: This work has been presented in the 4th IFIP Wireless-Days conference (WD 2011)

In this work, we evaluate local capacity of wireless ad hoc networks with several medium access protocols and identify the most optimal protocol. We define local capacity as the average information rate received by a receiver randomly located in the network. We analyzed grid pattern protocols where simultaneous transmitters are positioned in a regular grid pattern, pure ALOHA protocols where simultaneous transmitters are dispatched according to a uniform Poisson distribution and exclusion protocols where simultaneous transmitters are dispatched according to an exclusion rule such as node coloring and carrier sense protocols. Our analysis allows us to conjecture that local capacity is optimal when simultaneous transmitters are positioned in a grid pattern based on equilateral triangles and our results show that this optimal local capacity is at most double the local capacity of simple ALOHA protocol. Our results also show that node coloring and carrier sense protocols approach the optimal local capacity by an almost negligible difference., Comment: This work has been presented in the 4th IFIP Wireless and Mobile Networking conference (WMNC 2011)

This paper quantifies the economic cost of power outages in the industrial sector of Pakistan: first, by extending the methodology developed by Munasinghe and Gellerson [7,8] and Sanghvi [11] to allow for long-run adjustments by firms to outages like investment in generators and renegotiation of labour contracts with flexible timing provisions; and second, by incorporating multiplier effects on other sectors. Variation in anticipated and unanticipated outage costs per kWh by type of industry, firm size and location are highlighted by analysing data collected from a nationwide sample of 843 industrial units. A set of policies is derived for pricing and load management in the short run and investment in energy generation in the medium run.