Results 1 - 10
of
29
Multicast Throughput for Hybrid Wireless Networks under Gaussian Channel Model
- IEEE TRANSACTIONS ON MOBILE COMPUTING
"... We study the multicast capacity for hybrid wireless networks consisting of ordinary ad hoc nodes and base stations under Gaussian Channel model, which generalizes both the unicast capacity and broadcast capacity for hybrid wireless networks. Assume that all ordinary ad hoc nodes transmit at a consta ..."
Abstract
-
Cited by 12 (7 self)
- Add to MetaCart
We study the multicast capacity for hybrid wireless networks consisting of ordinary ad hoc nodes and base stations under Gaussian Channel model, which generalizes both the unicast capacity and broadcast capacity for hybrid wireless networks. Assume that all ordinary ad hoc nodes transmit at a constant power P, and the power decays along the path, with attenuation exponent α> 2. The data rate of a transmission is determined by the SINR (Signal to Interference plus Noise Ratio) at the receiver as B log(1 + SINR). The ordinary ad hoc nodes are placed in the square region A(a) of area a according to a Poisson point process of intensity n/a. Then, m additional base stations (BSs) acting as the relaying communication gateway are placed regularly in the region A(a), and are connected by a high-bandwidth wired network. Let a = n and a = 1, we construct the hybrid extended network (HEN) and hybrid dense network (HDN), respectively. We choose randomly and independently ns ordinary ad hoc nodes to be the sources of multicast sessions. We assume that each multicast session has nd randomly chosen terminals. Three broad categories of multicast strategies are proposed. The first one is the hybrid strategy, i.e., the multihop scheme with BS-supported, which further consists of two types of strategies called connectivity strategy and percolation strategy respectively. The second one is the ordinary ad hoc strategy, i.e., the multihop scheme without any BS-supported. The third one is the classical BSbased strategy under which any communications between ordinary ad hoc node pairs are relayed by some specific BSs. According to the different scenarios in terms of m, n and nd, we select the optimal scheme from the three categories of strategies, and derive the achievable multicast throughput based on the optimal decision.
Maximizing the Lifetime of Multi-Chain PEGASIS Using Sink Mobility
"... Abstract: In this paper, we propose the mobility of a sink in improved energy efficient PEGASIS-based protocol (IEEPB) to advance the network lifetime of Wireless Sensor Networks (WSNs). The multi-head chain, multi-chain concept and the sink mobility affects largely in enhancing the network lifetime ..."
Abstract
-
Cited by 4 (2 self)
- Add to MetaCart
Abstract: In this paper, we propose the mobility of a sink in improved energy efficient PEGASIS-based protocol (IEEPB) to advance the network lifetime of Wireless Sensor Networks (WSNs). The multi-head chain, multi-chain concept and the sink mobility affects largely in enhancing the network lifetime of wireless sensors. Thus, we recommend Mobile sink improved energy-efficient PEGASIS-based routing protocol (MIEEPB); a multi-chain model having a sink mobility, to achieve proficient energy utilization of wireless sensors. As the motorized movement of mobile sink is steered by petrol or current, there is a need to confine this movement within boundaries and the trajectory of mobile sink should be fixed. In our technique, the mobile sink moves along its trajectory and stays for a sojourn time at sojourn location to guarantee complete data collection. We develop an algorithm for trajectory of mobile sink. We ultimately perform wide-ranging experiments to assess the performance of the proposed method. The results reveal that the proposed way out is nearly optimal and also better than IEEPB in terms of network lifetime.
Delay-bounded sink mobility in wireless sensor networks
- in Proc. 2012 IEEE ICC
"... Abstract-This paper exploits sink mobility to prolong the network lifetime in wireless sensor networks (WSNs) where the information delay caused by moving the sink should be bounded. We build a unified framework for analyzing this joint sink mobility and routing problem. We offer a mathematical mod ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
(Show Context)
Abstract-This paper exploits sink mobility to prolong the network lifetime in wireless sensor networks (WSNs) where the information delay caused by moving the sink should be bounded. We build a unified framework for analyzing this joint sink mobility and routing problem. We offer a mathematical modeling that is general and captures diversified issues, e.g. sink mobility, routing, delay, etc. We discuss the induced subproblems and present efficient solutions for them. Then, we generalize these solutions and propose a polynomial-time optimal algorithm for the origin problem. In simulations, we show the benefits of involving a mobile sink. We also show that the impact of the delay bound on the network lifetime.
Data quality maximization in sensor networks with a mobile sink
- In Proc. of DCOSS. IEEE
, 2011
"... Data quality maximization in sensor networks with a mobile sink ..."
Abstract
-
Cited by 2 (1 self)
- Add to MetaCart
(Show Context)
Data quality maximization in sensor networks with a mobile sink
CFM: A Fitness-Model-based Topology Control Algorithm for Wireless Sensor Networks
- International Journal on Smart Sensing and Intelligent Systems
"... Abstract The main objective of wireless sensor network design is to maximize network lifetime. The network topology, which is the important foundation of upper layer protocols, serves as the supportive groundwork for this goal. We constructed the model of sensor networks, and investigated the proper ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
(Show Context)
Abstract The main objective of wireless sensor network design is to maximize network lifetime. The network topology, which is the important foundation of upper layer protocols, serves as the supportive groundwork for this goal. We constructed the model of sensor networks, and investigated the property of topology with complex network theory. Three statistical parameters were used to describe the network structure, and then some ideal characteristics were concluded for topology. The characteristics of topology can be achieved by fitness model, so we designed an approximate clustering algorithm based on fitness model, which is distributed. CFM is composed of three phases: links generation phase, heads selection phase and cluster division phase. The performance of CFM algorithm was analyzed
CSMA/SF: Carrier Sense Multiple Access with Shortest First
"... Abstract—Energy efficiency is the main concern in wireless sensor networks (WSNs) due to devices ’ limited battery power. Because the heavy burden of nodes that near the sink, this “energy hole problem ” makes nodes near the sink have faster energy depletion than others. Because of this, the lifetim ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
(Show Context)
Abstract—Energy efficiency is the main concern in wireless sensor networks (WSNs) due to devices ’ limited battery power. Because the heavy burden of nodes that near the sink, this “energy hole problem ” makes nodes near the sink have faster energy depletion than others. Because of this, the lifetime of WSNs, to some extent, is determined by the power consumption of communication between sink and sensing nodes that near the sink. To address this issue, we propose CSMA/SF (Shortest First) protocol to reduce power consumption of sink-node com-munication by minimizing energy cost in carrier sense during nodes ’ channel contention. CSMA/SF modifies existed CSMA/CA MAC protocol. Instead of complete contention-based, CSMA/SF ensures nodes remaining shorter message has higher priority in contention by implementing a distributed scheduling algorithm and incorporating Length Detection scheme. Further, CSMA/SF employs an Anti-Starvation mechanism to solve the starvation problem of shortest-first protocol. CSMA/SF also optimizes channel utilization by reducing the probability of collisions. We have implemented CSMA/SF into USRP2 platform and also conducted comprehensive simulations. The experimental results show that CSMA/SF can reduce overall energy consumption by around 20%. CSMA/SF can improve channel utilization up to
Achieving High Lifetime and Low Delay in Very Large Sensors Networks using Mobile Sinks
, 2011
"... Abstract—For smaller scale wireless sensor networks (WSN) it has been clearly shown that a single mobile sink can be very beneficial with respect to the network lifetime. Yet, how to plan the trajectories of many mobile sinks in very large WSNs in order to simultaneously achieve lifetime and delay g ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
(Show Context)
Abstract—For smaller scale wireless sensor networks (WSN) it has been clearly shown that a single mobile sink can be very beneficial with respect to the network lifetime. Yet, how to plan the trajectories of many mobile sinks in very large WSNs in order to simultaneously achieve lifetime and delay goals has not been treated so far. In this paper, we delve into this difficult problem and propose a heuristic framework using multiple orbits for the sinks ’ trajectories. The framework is carefully designed based on geometric arguments to achieve both, high lifetime and low delay. In simulations, we compare two different instances of our framework, one conceived based on a load balancing argument and one based on a distance minimization argument, with a set of different competitors spanning from statically placed sinks to battery-state aware strategies. We find our heuristics to perform very favorably: both instances outperform the competitors in both, lifetime and delay. Furthermore, and probably even more importantly, the heuristic, while keeping its good delay and lifetime performance, scales well with an increasing number of sinks. I.
Game Theoretic Energy Balanced Routing Protocols For Wireless Sensor Networks
, 2015
"... This online database contains the full-text of PhD dissertations and Masters ’ theses of University of Windsor students from 1954 forward. These documents are made available for personal study and research purposes only, in accordance with the Canadian Copyright Act and the Creative Commons license— ..."
Abstract
- Add to MetaCart
(Show Context)
This online database contains the full-text of PhD dissertations and Masters ’ theses of University of Windsor students from 1954 forward. These documents are made available for personal study and research purposes only, in accordance with the Canadian Copyright Act and the Creative Commons license—CC BY-NC-ND (Attribution, Non-Commercial, No Derivative Works). Under this license, works must always be attributed to the copyright holder (original author), cannot be used for any commercial purposes, and may not be altered. Any other use would require the permission of the copyright holder. Students may inquire about withdrawing their dissertation and/or thesis from this database. For additional inquiries, please
Sink Mobility Schemes in Wireless Sensor Networks for Network Lifetime Extension
, 2012
"... This online database contains the full-text of PhD dissertations and Masters ’ theses of University of Windsor students from 1954 forward. These documents are made available for personal study and research purposes only, in accordance with the Canadian Copyright Act and the Creative Commons license— ..."
Abstract
- Add to MetaCart
(Show Context)
This online database contains the full-text of PhD dissertations and Masters ’ theses of University of Windsor students from 1954 forward. These documents are made available for personal study and research purposes only, in accordance with the Canadian Copyright Act and the Creative Commons license—CC BY-NC-ND (Attribution, Non-Commercial, No Derivative Works). Under this license, works must always be attributed to the copyright holder (original author), cannot be used for any commercial purposes, and may not be altered. Any other use would require the permission of the copyright holder. Students may inquire about withdrawing their dissertation and/or thesis from this database. For additional inquiries, please contact the repository administrator via email (scholarship@uwindsor.ca) or by telephone at 519-253-3000ext. 3208.
Compliant Data-centric Network Processing for Energy Economic Data Collection in Wireless Sensor Networks
"... In the recent years Wireless Sensor Networks (WSNs) have gained a significant attention from the research and industrial community. A real-time WSN is expected to perform exceptionally well with large-scale applications across the Internetwork. Most sensor nodes adopt un-rechargeable batteries with ..."
Abstract
- Add to MetaCart
(Show Context)
In the recent years Wireless Sensor Networks (WSNs) have gained a significant attention from the research and industrial community. A real-time WSN is expected to perform exceptionally well with large-scale applications across the Internetwork. Most sensor nodes adopt un-rechargeable batteries with limited power supply. The practice of embedded and autonomous interrogation of data collected remotely across WSNs is one among the prime challenges faced in real-time environments. The process of data collection has a major impact in energy consumption across the sensor networks. The work proposes a Cluster-Based Priority Traverse (CBPT) technique where mobile sinks traverse in a dynamic path decided from the pri-oritized routing table. Also the work proposed emphasizes not only the collection of relevant data, but also a means of conditioning and interpreting these data. Sensed data are categorized into primary data that has a drastic variation from historical data and secondary data that resembles regular sensed data pattern. The WSN is organized as a clustered sensor network. The CBPT prioritizes the clusters in the network based on their Primary Data Count (PDC). The mobile sinks are ensured with high reliable traverse paths that include maximum high priority clusters to collect data in an energy efficient manner. A Minimum Spanning Tree is constructed for each cluster to all other clusters in the network. With repetitive simulations the categorization of data is achieved with high accuracy. Experimentations have been carried out to prove CBPT performs extremely well in terms of message overhead and delay.