Relevant bibliographies by topics / Multi-Hop Wireless Sensor Network

Academic literature on the topic 'Multi-Hop Wireless Sensor Network'

Author: Grafiati
Published: 6 September 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Contents

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Multi-Hop Wireless Sensor Network.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Multi-Hop Wireless Sensor Network"

1

S.R, Srividhya. "Efficient Secured Multi-Hop Routing Technique for Wireless Sensor Network." Journal of Advanced Research in Dynamical and Control Systems 11, no. 0009-SPECIAL ISSUE (September 25, 2019): 806–14. http://dx.doi.org/10.5373/jardcs/v11/20192636.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Singh, Omkar, and Vinay Rishiwal. "QoS Aware Multi-hop Multi-path Routing Approach in Wireless Sensor Networks." International Journal of Sensors, Wireless Communications and Control 9, no. 1 (July 15, 2019): 43–52. http://dx.doi.org/10.2174/2210327908666180703143435.

Full text
Abstract:
Background & Objective: Wireless Sensor Network (WSN) consist of huge number of tiny senor nodes. WSN collects environmental data and sends to the base station through multi-hop wireless communication. QoS is the salient aspect in wireless sensor networks that satisfies end-to-end QoS requirement on different parameters such as energy, network lifetime, packets delivery ratio and delay. Among them Energy consumption is the most important and challenging factor in WSN, since the senor nodes are made by battery reserved that tends towards life time of sensor networks. Methods: In this work an Improve-Energy Aware Multi-hop Multi-path Hierarchy (I-EAMMH) QoS based routing approach has been proposed and evaluated that reduces energy consumption and delivers data packets within time by selecting optimum cost path among discovered routes which extends network life time. Results and Conclusion: Simulation has been done in MATLAB on varying number of rounds 400- 2000 to checked the performance of proposed approach. I-EAMMH is compared with existing routing protocols namely EAMMH and LEACH and performs better in terms of end-to-end-delay, packet delivery ratio, as well as reduces the energy consumption 13%-19% and prolongs network lifetime 9%- 14%.
APA, Harvard, Vancouver, ISO, and other styles
3

HUANG, GUANGYAN, XIAOWEI LI, JING HE, and XIN LI. "DATA MINING VIA MINIMAL SPANNING TREE CLUSTERING FOR PROLONGING LIFETIME OF WIRELESS SENSOR NETWORKS." International Journal of Information Technology & Decision Making 06, no. 02 (June 2007): 235–51. http://dx.doi.org/10.1142/s0219622007002538.

Full text
Abstract:
Clustering is applied in wireless sensor networks for increasing energy efficiency. Clustering methods in wireless sensor networks are different from those in traditional data mining systems. This paper proposes a novel clustering algorithm based on Minimal Spanning Tree (MST) and Maximum Energy resource on sensors named MSTME. Also, specified constrains of clustering in wireless sensor networks and several evaluation metrics are given. MSTME performs better than already known clustering methods of Low Energy Adaptive Clustering Hierarchy (LEACH) and Base Station Controlled Dynamic Clustering Protocol (BCDCP) in wireless sensor networks when they are evaluated by these evaluation metrics. Simulation results show MSTME increases energy efficiency and network lifetime compared with LEACH and BCDCP in two-hop and multi-hop networks, respectively.
APA, Harvard, Vancouver, ISO, and other styles
4

Li, Zhu Guo, Bing Wen Wang, and Li Zhu Feng. "EDMC: An Energy-Efficient Distributed Multi-Hop Clustering Approach for Wireless Sensor Networks." Applied Mechanics and Materials 198-199 (September 2012): 1668–71. http://dx.doi.org/10.4028/www.scientific.net/amm.198-199.1668.

Full text
Abstract:
The past few years have witnessed increasing focus on the potential applications of wireless sensor networks. Sensors in these networks are expected to be remotely dispersed in large number and to operate autonomously and unattended. Clustering is a widely used technique that can enhance scalability and decrease energy consumption over sensor networks. We present an energy-efficient distributed multi-hop clustering approach for sensor networks, which combined multi-hop transmission with clustering method, aiming to balance the energy dissipation and prolong the whole network lifetime. Simulations showed that the protocol proposed worked nearly 100% more efficient compared with LEACH and HEED.
APA, Harvard, Vancouver, ISO, and other styles
5

Yang, Han Hua. "Adaptive Multi Path Routing Protocol for Heterogeneous Multi-Hop Wireless Sensor Network." Applied Mechanics and Materials 291-294 (February 2013): 2532–36. http://dx.doi.org/10.4028/www.scientific.net/amm.291-294.2532.

Full text
Abstract:
Multi path routing protocol plays important part in the multi hop heterogeneous wireless sensor network. To get better performance, adaptive Wireless Senor Network Multi Path Routing Scheme (AMRH) is proposed, which is made up of three phrases: initial setup, route discovery and establishment, route maintenance. In the first phrase, every node gets the initial route table. In the second phrase, source node will find minimum-cost path among multiple paths. In the third phrase, route maintenance is conducted under adaptive mechanism. Simulation shows that AMRH scheme can prolong sensor network lifetime by 19.5%, increase data delivery ratio by 5.6%.
APA, Harvard, Vancouver, ISO, and other styles
6

Huang, Xiaohu, Dezhi Han, Mingming Cui, Guanghan Lin, and Xinming Yin. "Three-Dimensional Localization Algorithm Based on Improved A* and DV-Hop Algorithms in Wireless Sensor Network." Sensors 21, no. 2 (January 10, 2021): 448. http://dx.doi.org/10.3390/s21020448.

Full text
Abstract:
In the traditional wireless sensor networks (WSNs) localization algorithm based on the Internet of Things (IoT), the distance vector hop (DV-Hop) localization algorithm has the disadvantages of large deviation and low accuracy in three-dimensional (3D) space. Based on the 3DDV-Hop algorithm and combined with the idea of A* algorithm, this paper proposes a wireless sensor network node location algorithm (MA*-3DDV-Hop) that integrates the improved A* algorithm and the 3DDV-Hop algorithm. In MA*-3DDV-Hop, firstly, the hop-count value of nodes is optimized and the error of average distance per hop is corrected. Then, the multi-objective optimization non dominated sorting genetic algorithm (NSGA-II) is adopted to optimize the coordinates locally. After selection, crossover, mutation, the Pareto optimal solution is obtained, which overcomes the problems of premature convergence and poor convergence of existing algorithms. Moreover, it reduces the error of coordinate calculation and raises the localization accuracy of wireless sensor network nodes. For three different multi-peak random scenes, simulation results show that MA*-3DDV-Hop algorithm has better robustness and higher localization accuracy than the 3DDV-Hop, PSO-3DDV-Hop, GA-3DDV-Hop, and N2-3DDV-Hop.
APA, Harvard, Vancouver, ISO, and other styles
7

Huang, Xiaohu, Dezhi Han, Mingming Cui, Guanghan Lin, and Xinming Yin. "Three-Dimensional Localization Algorithm Based on Improved A and DV-Hop Algorithms in Wireless Sensor Network*." Sensors 21, no. 2 (January 10, 2021): 448. http://dx.doi.org/10.3390/s21020448.

Full text
Abstract:
In the traditional wireless sensor networks (WSNs) localization algorithm based on the Internet of Things (IoT), the distance vector hop (DV-Hop) localization algorithm has the disadvantages of large deviation and low accuracy in three-dimensional (3D) space. Based on the 3DDV-Hop algorithm and combined with the idea of A* algorithm, this paper proposes a wireless sensor network node location algorithm (MA*-3DDV-Hop) that integrates the improved A* algorithm and the 3DDV-Hop algorithm. In MA*-3DDV-Hop, firstly, the hop-count value of nodes is optimized and the error of average distance per hop is corrected. Then, the multi-objective optimization non dominated sorting genetic algorithm (NSGA-II) is adopted to optimize the coordinates locally. After selection, crossover, mutation, the Pareto optimal solution is obtained, which overcomes the problems of premature convergence and poor convergence of existing algorithms. Moreover, it reduces the error of coordinate calculation and raises the localization accuracy of wireless sensor network nodes. For three different multi-peak random scenes, simulation results show that MA*-3DDV-Hop algorithm has better robustness and higher localization accuracy than the 3DDV-Hop, PSO-3DDV-Hop, GA-3DDV-Hop, and N2-3DDV-Hop.
APA, Harvard, Vancouver, ISO, and other styles
8

Zhou, Xin Lian, and Sheng Chen. "Non-Uniform Cluster-Based Mobile Data Collector Routing Protocol in Wireless Sensor Networks." Advanced Materials Research 756-759 (September 2013): 2173–77. http://dx.doi.org/10.4028/www.scientific.net/amr.756-759.2173.

Full text
Abstract:
One fundamental task of wireless sensor networks (WSNs) is to save sensor power, and try to prolong the lifetime of WSNs. Traditional routing protocols are almost based on homogeneous WSNs, all sensors are use single hop or multi-hop to transmit data to base station, which lead to overload sensors next to base station, thus appear energy hole and made WSN outwork. In this paper, we use a new novel mobile collectors mobile strategy method to prolong network lifetime, and reduce hot-spot effect around base station. We propose the routing method can effectively balance the network sensors energy depletion, more save energy and longer whole network lifetime compare to LEACH.
APA, Harvard, Vancouver, ISO, and other styles
9

Tronci, Eleonora Maria, Sakie Nagabuko, Hiroyuki Hieda, and Maria Qing Feng. "Long-Range Low-Power Multi-Hop Wireless Sensor Network for Monitoring the Vibration Response of Long-Span Bridges." Sensors 22, no. 10 (May 22, 2022): 3916. http://dx.doi.org/10.3390/s22103916.

Full text
Abstract:
Recently, vibration-based monitoring technologies have become extremely popular, providing effective tools to assess the health condition and evaluate the structural integrity of civil structures and infrastructures in real-time. In this context, battery-operated wireless sensors allow us to stop using wired sensor networks, providing easy installation processes and low maintenance costs. Nevertheless, wireless transmission of high-rate data such as structural vibration consumes considerable power. Consequently, these wireless networks demand frequent battery replacement, which is problematic for large structures with poor accessibility, such as long-span bridges. This work proposes a low-power multi-hop wireless sensor network suitable for monitoring large-sized civil infrastructures to handle this problem. The proposed network employs low-power wireless devices that act in the sub-GHz band, permitting long-distance data transmission and communication surpassing 1 km. Data collection over vast areas is accomplished via multi-hop communication, in which the sensor data are acquired and re-transmitted by neighboring sensors. The communication and transmission times are synchronized, and time-division communication is executed, which depends on the wireless devices to sleep when the connection is not necessary to consume less power. An experimental field test is performed to evaluate the reliability and accuracy of the designed wireless sensor network to collect and capture the acceleration response of the long-span Manhattan Bridge. Thanks to the high-quality monitoring data collected with the developed low-power wireless sensor network, the natural frequencies and mode shapes were robustly recognized. The monitoring tests also showed the benefits of the presented wireless sensor system concerning the installation and measuring operations.
APA, Harvard, Vancouver, ISO, and other styles
10

Qing-Xue Liu, Qing-Xue Liu, Huang-Shui Hu Qing-Xue Liu, Mei-Qin Yao Huang-Shui Hu, and Chu-Hang Wang Mei-Qin Yao. "An Improved Multi-hop LEACH Protocol Based on Fuzzy Logic for Wireless Sensor Networks." 電腦學刊 33, no. 3 (June 2022): 001–16. http://dx.doi.org/10.53106/199115992022063303001.

Full text
Abstract:
<p>As an important kind of clustering protocols in wireless sensor networks (WSNs), LEACH and its variants have been demonstrated to efficiently balance the energy consumption, simplify the routing task and extend the network lifetime. Especially, the multi-hop LEACH type protocols have proved to be effective approaches for high energy efficiency, reliability as well as scalability. However, data transmission in hop-by-hop mode increases the energy consumption and end-to-end delay. In this paper, an improved multi-hop LEACH protocol based on fuzzy logic called IMF-LEACH is proposed, which uses a fuzzy logic controller with residual energy, length of data, and distance to BS as fuzzy descriptors to determine the hop count. Moreover, the hop count is used for each CH to find its optimal next-hop intermediate CH with more residual energy and less number of members. Simulations are conducted in MATLAB to evaluate the performance of the proposed protocol, and the results show that IMF-LEACH maximizes the network lifetime and outperforms its counterparts consistently.</p> <p>&nbsp;</p>
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Multi-Hop Wireless Sensor Network"

1

Pinto, Luis Ramos. "Aerial Multi-hop Sensor Networks." Research Showcase @ CMU, 2018. http://repository.cmu.edu/dissertations/1180.

Full text
Abstract:
Unmanned Aerial Vehicles (UAVs) recently enabled a myriad of new applications spanning domains from personal entertainment and industrial inspection, to criminal surveillance and forest monitoring. A combination of sensor collection, wireless communication and path planning between multiple distributed agents is the natural way to support applications. Several small UAVs working collaboratively can rapidly provide extended reach, at low cost, and efficiently stream sensor information to operators on a ground station. A significant amount of previous work has addressed each of these topics independently, but in this dissertation we propose a holistic approach for joint coordination of networking and topology (placement of mobile nodes). Our thesis is that this approach improves user-interactive control of UAVs for live-streaming applications in terms of throughput, delay and reliability. In order to defend these claims, this dissertation begins by experimentally evaluating and modeling the wireless link between two UAVs, under different conditions. Due to limited link range, and the need for wide-area operation, the model is extended to encompass a multi-hop topology. We show that the performance of such networks using COTS devices is typically poor, and solutions must rely on coordination of network protocol and topology, simultaneously. At the network layer, we introduce a novel Time-division Multiple Access (TDMA) scheme called Distributed Variable Slot Protocol that relies on adaptive slot-length. We prove its convergence as well as its meliorated performance experimentally validated, namely 50% higher packet delivery. In terms of network topology, we show that without node placement control overall performance of the network is severely penalized, due to natural link asymmetries. We propose a novel protocol, named Dynamic Relay Placement, that is able to do both online link quality model-estimation and in a distributed fashion decide the best location for each network node, increasing throughput by 300%. Finally, we demonstrate the end-to-end system in a multi-vehicle monitoring mission. We show that coordination of multiple UAVs increases the sensor sampling rate up to 7 times in wide areas when compared to a naive approach. This work considers environmental constraints such as wind, as well as the intrinsic limitations of the vehicles such as maximum acceleration.
APA, Harvard, Vancouver, ISO, and other styles
2

Guercin, Sergio Rolando. "Performance Evaluation of Opportunistic Routing Protocols for Multi-hop Wireless Networks." Thesis, Université d'Ottawa / University of Ottawa, 2019. http://hdl.handle.net/10393/38904.

Full text
Abstract:
Nowadays, Opportunistic Routing (OR) is widely considered to be the most important paradigm for Multi-hop wireless networks (MWNs). It exploits the broadcast nature of wireless medium to propagate information from one point to another within the network. In OR scheme, when a node has new information to share, it rst needs to set its forwarding list which include the IDs and/or any relevant information to its best suited neighboring nodes. This operation is supported by the use of appropriate metrics. Then, it executes a coordination algorithm allowing transmission reliability and high throughput among the next-hop forwarders. In this paper, we provide a comprehensive guide to understand the characteristics and challenges faced in the area of opportunistic routing protocols in MWNs. Moreover, since the planet we live on is largely covered by water, OR protocols have gained much attention during the last decade in real-time aquatic applications, such as oil/chemical spill monitoring, ocean resource management, anti-submarine missions and so on. One of the major problems in Underwater Wireless Sensor Network (UWSNs) is determining an e cient and reliable routing methodology between the source node and the destination node. Therefore, designing e cient and robust routing protocols for UWSNs became an attractive topic for researchers. This paper seeks to address in detail the key factors of underwater sensor network. Furthermore, it calls into question 5 state-of-the-art routing protocols proposed for UWSN: The Depth-Based Routing protocol (DBR), the Energy-E cient Depth-Based Routing protocol (EEDBR), the Hydraulic-pressure-based anycast routing protocol (Hydrocast), the Geographic and opportunistic routing protocol with Depth Adjustment for mobile underwater sensor networks (GEDAR), and the Void- Aware Pressure Routing for underwater sensor networks (VAPR). Finally, it covers the performance of those protocol through the use of the R programming language.
APA, Harvard, Vancouver, ISO, and other styles
3

Jung, Jin Woo. "Methods of cooperative routing to optimize the lifetime of multi-hop wireless sensor networks." Diss., Georgia Institute of Technology, 2013. http://hdl.handle.net/1853/47622.

Full text
Abstract:
This dissertation presents methods of extending the network lifetime of multi-hop wireless sensor networks (WSNs) through routing that uses cooperative transmission (CT), referred to as cooperative routing. CT can have a signal-to-noise ratio (SNR) advantage over non-CT schemes through cooperative diversity and simple aggregation of transmit power, and one of its abilities is to extend the communication range of a wireless device using this SNR advantage. In this research, we use the range-extension ability of CT as a tool to mitigate the energy-hole problem of multi-hop WSNs and extend the network lifetime. The main contributions of this research are (i) an analytical model for a cooperative routing protocol with a deployment method, (ii) cooperative routing protocols that can extend the network lifetime, and (iii) formulating the lifetime-optimization problem for cooperative routing. The analytical model developed in this research theoretically proves that, in a situation where non-CT routing cannot avoid the energy-hole problem, our CT method can solve the problem. PROTECT, a CT method based on the analytical model, provides a very simple way of doing cooperative routing and can improve the lifetime of non-CT networks significantly. REACT, a cooperative routing protocol that uses the energy information of nodes, overcomes some of the limitations of PROTECT and can be applied to any existing non-CT routing protocol to improve the network lifetime. Using REACT and analytical approaches, we also show that cooperative routing can be beneficial in multi-hop energy-harvesting WSNs. By formulating and solving the lifetime-optimization problem of cooperative routing, which requires a much more sophisticated formulation than that of non-CT routing, we explore the optimal lifetime bounds and behaviors of cooperative routing. Finally, we study and design online cooperative routing methods that can perform close to the optimal cooperative routing.
APA, Harvard, Vancouver, ISO, and other styles
4

Zhang, Xin. "Network Formation and Routing for Multi-hop Wireless Ad-Hoc Networks." Diss., Georgia Institute of Technology, 2006. http://hdl.handle.net/1853/11470.

Full text
Abstract:
An energy-aware on-demand Bluetooth scatternet formation and routing protocol taking into account network architecture and traffic pattern is proposed. The scatternet formation protocol is able to cope with multiple sources initiating traffic simultaneously as well as prolong network lifetime. A modified Inquiry scheme using extended ID packet is introduced for fast device discovery and power efficient propagation of route request messages with low delay. A mechanism employing POLL packets in Page processes is proposed to transfer scatternet formation and route reply information without extra overhead. In addition, the energy aware forwarding nodes selection scheme is based on local information and results in more uniform network resource utilization and improved network lifetime. Simulation results show that this protocol can provide scatternet formation with reasonable delay and with good load balance which results in prolonged network lifetime for Bluetooth-based wireless sensor networks. In this research, a metric-based scatternet formation algorithm for the Bluetooth-based sensor motes is presented. It optimizes the Bluetooth network formation from the hop distance and link quality perspectives. In addition, a smart repair mechanism is proposed to deal with link/node failure and recover the network connectivity promptly with low overhead. The experiments with the Intel Mote platform demonstrate the effectiveness of the optimizations. This research also investigates the scalability of ad hoc routing protocols in very large-scale wireless ad hoc networks. A comprehensive simulation study is conducted of the performance of an on-demand routing protocol on a very large-scale, with as many as 50,000 nodes in the network. The scalability analysis is addressed based on various network sizes, node density, traffic load, and mobility. The reasons for packet loss are analyzed and categorized at each network layer. Based on the observations, we observe the effect of the parameter selection and try to exhaust the scalability boundary of the on-demand routing protocol for wireless ad hoc networks.
APA, Harvard, Vancouver, ISO, and other styles
5

Chen, Quanjun Computer Science &amp Engineering Faculty of Engineering UNSW. "Analysis and application of hop count in multi-hop wireless ad-hoc networks." Awarded By:University of New South Wales. Computer Science & Engineering, 2009. http://handle.unsw.edu.au/1959.4/44769.

Full text
Abstract:
Hop count, i.e., the number of wireless hops a packet has to go through to reach the destination, is a fundamental metric in multi-hop wireless ad-hoc networks. Network performance, such as throughput, end-to-end delay, energy consumption, and so on, depends critically on hop count. Previous work on modeling hop count is limited in making unrealistic simplifying assumptions either at the physical or network, or both layers of the communication protocol stack. A key contribution of this thesis is to present an analytical model to derive the probability distribution of hop count under realistic assumptions at both physical and network layers. Specifically, the model considers a log-normal shadowing radio propagation capable of accommodating the random signal fading observed in most wireless communication environments, and the widely used geographic routing at the network layer. Validation of the model is achieved by a comprehensive set of simulation experiments including a trace driven simulation of a real-word vehicular ad-hoc network. The model reveals that the presence of randomness in radio propagation reduces the required number of hops to reach a given destination significantly. To demonstrate the utility of the proposed hop count model, the thesis proposes three new applications which address some of the key challenges in multi-hop wireless networks. The first application derives the per-node packet forwarding load in multi-hop wireless sensor networks and reveals that the nodes in the vicinity of the base station has a significantly less forwarding load than previously thought under simplifying radio propagation and routing assumptions. The second application demonstrates that using hop count as a measure of distance traveled by a data packet, geocasting can be achieved in multi-hop wireless networks in situations when some of the network nodes do not have access to reliable location information. Finally, the proposed hop count model is used to evaluate the performance of the third application which demonstrates that the overhead of geographic routing can be reduced significantly by embracing a position update philosophy which adapts to the mobility and communication patterns of the underlying ad-hoc network.
APA, Harvard, Vancouver, ISO, and other styles
6

Mortada, Mohamad Rida. "Multi-hop routing for cognitive radio sensor network." Thesis, Brest, École nationale supérieure de techniques avancées Bretagne, 2021. http://www.theses.fr/2021ENTA0010.

Full text
Abstract:
Le réseau de capteurs sans fil (WSN) se compose d'un grand nombre de minuscules dispositifs appelés nœuds, et ces nœuds sont généralement limités en puissance et ils sont déployés de manière aléatoire dans une zone géographique à des fins de surveillance. En raison du grand nombre de nœuds dans le WSN, leur demande en ressources de fréquence devient un véritable défi en raison de la rareté du spectre. La radio cognitive (CR) a été introduite pour améliorer l'efficacité spectrale. La CR classe les utilisateurs entre l'utilisateur principal (PU) qui détient une licence sur une bande passante du spectre et l'utilisateur secondaire (SU), c'est-à-dire un utilisateur opportuniste. L'intégration de CR dans WSN se traduit par un réseau de capteurs radio cognitifs (CRSN). Dans le CRSN, les nœuds se comportent comme des SU. Cependant, l'adoption du CRSN peut être confrontée à plusieurs défis. En effet, les nœuds du réseau peuvent arrêter de transmettre pour éviter toute interférence nuisible pour PU. De plus, la contrainte de consommation d'énergie doit être respectée. D'autres fonctionnalités peuvent être affectées par l'adoption du CRSN, telles que le processus de regroupement et l'agrégation de données dans le réseau, en particulier dans un CRSN basé sur un routage multi-sauts. Dans ce manuscrit, nous abordons les défis du CRSN à différents niveaux. Premièrement, le regroupement des nœuds améliore l'efficacité du réseau. En pratique, le regroupement des nœuds du réseau permet d'économiser de l'énergie lors de la transmission des données. Ainsi, nous étudions le nombre optimal de clusters dans le réseau en fonction de la consommation d'énergie lors de la transmission de données et de la détection du spectre pour prolonger la durée de vie du réseau. Ensuite, nous présentons LIBRO, un nouveau protocole de routage multi-sauts montant basé sur les informations de localisation géographique. LIBRO assure la livraison de paquets de données rectifiés dans des réseaux denses sans connaissance de la topologie ou des nœuds de chemin. Enfin, nous avons utilisé LIBRO et la technique de récupération d'énergie pour prolonger la durée de vie du CRSN. Ainsi, en résolvant un problème d'optimisation joignant la probabilité de collision, la consommation d'énergie, le délai de livraison des paquets et le taux de livraison des paquets, les paramètres appropriés sont trouvés. [Google traduction]
The Wireless Sensor Network (WSN) consists of a large number of tiny devices called nodes, and these nodes are generally limited in power and they are randomly deployed in a geographical area for monitoring purpose. Because of the large number of nodes in the WSN, their demand on the frequency resources becomes a real challenge due to the spectrum scarcity. Cognitive Radio (CR) was introduced to enhance the spectral efficiency. The CR classifies users into the Primary User (PU) that holds a license over a spectrum bandwidth, and the Secondary User (SU), i.e., an opportunistic user. The integration of CR into WSN results in a cognitive radio sensor network (CRSN). In CRSN, the nodes behave as SUs. However,the adoption of CRSN may face several challenges. Indeed, network nodes may stop transmitting to avoid any harmful interference for PU. In addition, energy consumption constraint should be respected. Other features may be impacted by the adoption of CRSN, such as the clustering process and the in-network data aggregation, especially in a multi-hop routing based CRSN. In this manuscript, we tackle the challenges of the CRSN from different levels. Firstly, clustering nodes enhances network efficiency. In practice, grouping the network nodes saves energy during data transmission. Thus, we investigate the optimal number of clusters in the network based on energy consumption during data transmission and spectrum sensing to extend network lifespan. Then, we present LIBRO, a new uplink multi-hop routing protocol based on the geographical location information. LIBRO ensures delivery of rectified data packets in dense networks without knowledge of topology or path nodes. Finally, we used LIBRO and the energy harvesting technique to extend the CRSN's lifespan. Thus, by solving an optimization problem jointing the collision probability, energy consumption, packet delivery delay and packet delivery ratio, the appropriate parameters are found
APA, Harvard, Vancouver, ISO, and other styles
7

Katayama, Masaaki, Takaya Yamazato, and Zheng Huang. "Optimal Cluster Partitioning for Wireless Sensor Networks with Cooperative MISO Scheme." IEEE, 2010. http://hdl.handle.net/2237/14500.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Hassan, Syed Ali. "Stochastic modeling of cooperative wireless multi-hop networks." Diss., Georgia Institute of Technology, 2011. http://hdl.handle.net/1853/42799.

Full text
Abstract:
Multi-hop wireless transmission, where radios forward the message of other radios, is becoming popular both in cellular as well as sensor networks. This research is concerned with the statistical modeling of multi-hop wireless networks that do cooperative transmission (CT). CT is a physical layer wireless communication scheme in which spatially separated wireless nodes collaborate to form a virtual array antenna for the purpose of increased reliability. The dissertation has two major parts. The first part addresses a special form of CT known as the Opportunistic Large Array (OLA). The second part addresses the signal-to-noise ratio (SNR) estimation for the purpose of recruiting nodes for CT. In an OLA transmission, the nodes from one level transmit the message signal concurrently without any coordination with each other, thereby producing transmit diversity. The receiving layer of nodes receives the message signal and repeats the process using the decode-and-forward cooperative protocol. The key contribution of this research is to model the transmissions that hop from one layer of nodes to another under the effects of channel variations, carrier frequency offsets, and path loss. It has been shown for a one-dimensional network that the successive transmission process can be modeled as a quasi-stationary Markov chain in discrete time. By studying various properties of the Markov chain, the system parameters, for instance, the transmit power of relays and distance between them can be optimized. This optimization is used to improve the performance of the system in terms of maximum throughput, range extensions, and minimum delays while delivering the data to the destination node using the multi-hop wireless communication system. A major problem for network sustainability, especially in battery-assisted networks, is that the batteries are drained pretty quickly during the operation of the network. However, in dense sensor networks, this problem can be alleviated by using a subset of nodes which take part in CT, thereby saving the network energy. SNR is an important parameter in determining which nodes to participate in CT. The more distant nodes from the source having least SNR are most suitable to transmit the message to next level. However, practical real-time SNR estimators are required to do this job. Therefore, another key contribution of this research is the design of optimal SNR estimators for synchronized as well as non-synchronized receivers, which can work with both the symbol-by-symbol Rayleigh fading channels as well as slow flat fading channels in a wireless medium.
APA, Harvard, Vancouver, ISO, and other styles
9

Zhang, Ruifeng. "Analysis of energy-delay performance in multi-hop wireless sensor networks." Lyon, INSA, 2009. http://theses.insa-lyon.fr/publication/2009ISAL0109/these.pdf.

Full text
Abstract:
Wireless sensor networks (WSNs) have introduced a new paradigm of communication between devices, which are applied to different scenarios. These applications demand three important performance parameters: the end-to-end reliability, the end-to-end delay and the overall energy consumption. Due to the fundamentality of reliability in many applications, we consider it in this thesis as a hard constraint, and the other two performance criteria, i. E. , energy and delay are exploited as a couple of competing criteria. Meanwhile, since unreliability is an inherent property of wireless channels, unreliable links are efficiently exploited to improve the energy-delay performance. We propose a metric for energy efficiency: mean energy distance ratio per bit and a metric for mean delay: mean delay distance, which are combine with the unreliable link model. Using these two metrics and a realistic unreliable link model, the lower bounds and the Pareto front of energy-delay trade-off are derived for three kinds of communication schemes: traditional multi-hop communications, opportunistic communications and cooperative MIMO (CMIMO) communications in three different channels: Additive White Gaussian Noise (AWGN) channel, Rayleigh block fading channel and Rayleigh flat fading channel. The close-form expression of these low bounds are obtained and verified by the simulations in 2-dimension Poisson networks. Furthermore, these results are applied to optimise the parameters of a network including physical and protocol layers. Finally, the lower bounds of the above three communication schemes are compared in different channels respectively. The results show that in order to achieve better energy-delay performance, the corresponding communication scheme should be adopted for different channels: traditional multi-hop communications for AWGN channel, opportunistic communications for Rayleigh block fading channel and CMIMO for Rayleigh flat fading channel
Les réseaux de capteurs sans fil représentent un nouveau paradigme dans les réseaux de communication qui permet de développer de nombreuses applications allant de la surveillance de l’environnement aux applications militaires. Les performances de ces réseaux peuvent être caractérisées par trois fonctions objectives caractérisant les transmissions de bout en bout: la fiabilité, le délai et la consommation d’énergie. Cette thése a pour but de trouver les param¨¨tres optimaux afin d’améliorer les performances de la couche physique, la couche MAC ainsi que la couche protocolaire des réseaux de capteurs. Dans ce travail, nous considérons la fiabilité comme un critère prépondérant et la traitons comme une contrainte dure. La consommation d’énergie et le délai de transmission sont considérés comme des contraintes secondaires concurrentes. Comme dans tous les réseaux radio, dans les réseaux de capteurs sans fil, les canaux radios ne sont pas fiables. Pour assurer la fiabilité bout-en-bout, la plupart des travaux existants, excluent les liens radios non fiables de la communication et se focalisent sur la sélection des liens fiables. Nous nous différencions par rapport à ces travaux par la prise en compte aussi bien des liens fiables que des liens non fiables. Nous démontrons aussi que les performances telles que la consommation d’énergie et le délai de transmission sont considérablement améliorées en exploitant efficacement les liens non fiables dans les réseaux, et tout en garantissant une fiabilité de bout en bout importante. Dans une première partie de la thèse, nous analysons le compromis entre la consommation d’énergie et le délai dans les réseaux multi-saut classiques. Nous proposons deux métriques. La première exprime l’efficacité énergétique sous la forme du rapport moyen énergie-distance par bit. La seconde exprime le délai sous la forme du rapport moyen délai-distance par bit. En utilisant ces deux métriques et un modèle réaliste de liaison radio à erreur, nous déduisons l’ensemble des solutions de compromis Energie-Délai sous la forme du front de Pareto à partir des performances d’une transmission à un saut, et obtenons une formule exprimant le compromis Energie-Délai. Ces résultats sont étendus aux transmissions multi-sauts. Ensuite, nous validons la limite inférieure à l’aide de simulations, sur des réseaux 2-D, issues d’une distribution Poissonnienne. Les analyses théoriques et les simulations montrent que les liens non-fiables dans les transmissions multi-sauts contribuent à améliorer l’efficacité énergétique du système ix évanouissements rapides de Rayleigh et le canal à évanouissements de Rayleigh par blocs. Sur la base de l’expression de la borne inférieure du compromis Energie-Délai, un cadre multi-couche est fourni pour optimiser les param¨¨tres des couches physique, MAC et routage sous contrainte de délai. Dans la seconde partie de la thèse, nous abordons après la non-fiabilité, une autre caractéristique importante des canaux sans fil, qui a trait à la nature diffusante des communications radio. Les communications opportunistes exploitent ces deux propriétés pour améliorer la performance du réseau. Nous analysons les performances d’énergie et de délai des communications opportunistes ainsi que l’optimisation des paramètres connexes. D’abord, nous proposons un cadre de conception pour évaluer l’efficacitè énergétique des communications opportunistes. Ce dernier fournit une méthode pour optimiser les différents mécanismes opportunistes. Ensuite, nous déduisons la borne inférieure du compromis Energie-Délais dans les communications opportunistes, tout en tenant compte du mécanisme de sélection des candidats pour une transmission optimale. La fromule exprimant la borne inférieure est obtenue sous l’hypothèse d’un nombre fixe de candidats à retransmettre. Un algorithme de recherche du nombre optimal de candidats est également proposé. Selon les analyses théoriques obtenues, nous proposons un nouvel algorithme opportuniste pour minimiser la consommation d’énergie face à une limite de délai moyen et intégrant les couches MAC et routage. Les résultats des simulations sur les mécanismes opportunistes proposés dans un réseau issu d’une distribution Poissonnienne correspondent à la limite inférieure théorique du compromis Energie-Délai. Enfin, nous discutons l’optimisation des paramètres de la couche physique. Dans la troisième partie de la thèse, nous considérons l’aspect coopératif des transmissions. Dans les communications opportunistes, seule la coopération de réception est réalisée, tandis que dans les communications coopératives prennent en compte une coopération des deux côtés : récepteur et émetteur. Dans cette partie, nous considérons l’approche CMIMO (cooperative multiple input multiple output). D’abord, nous analysons la baisse liée au compromis Energie-Délai de CMIMO par l’exploitation d’un modèle de liaison non fiable lorsque le nombre d’émetteurs et de récepteurs coopératifs est fixe. Ensuite, nous fournissons un algorithme de recherche du nombre optimal de noeuds coopératifs de chaque côté. Enfin, nous comparons les limites inférieures de ces trois schémas de communication dans les différents canaux respectivement. Les résultats obtenus montrent que pour parvenir à une meilleure performance Energie-Délai, les mécanismes de communication suivants devraient être adoptés selon le type de canal : les communications multi-saut traditionnelles sont les plus performantes pour le canal à bruit additif blanc Gaussien, alors que les communications opportunistes le sont pour les canaux à évanouissements de Rayleigh par blocs et enfin le CMIMO pour les canaux à évanouissements rapides de Rayleigh
APA, Harvard, Vancouver, ISO, and other styles
10

Kim, Seong-Pyo Mitchell Kenneth H. "Analytical models of throughput performance over multi-hop wireless and sensor networks." Diss., UMK access, 2004.

Find full text
Abstract:
Thesis (Ph. D.)--School of Computing and Engineering. University of Missouri--Kansas City, 2004.
"A dissertation in telecommunications networking and computer networking." Advisor: Ken Mitchell. Typescript. Vita. Title from "catalog record" of the print edition Description based on contents viewed Feb. 24, 2006. Includes bibliographical references (leaves 141-146). Online version of the print edition.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Multi-Hop Wireless Sensor Network"

1

Rani, Shalli, and Syed Hassan Ahmed. Multi-hop Routing in Wireless Sensor Networks. Singapore: Springer Singapore, 2016. http://dx.doi.org/10.1007/978-981-287-730-7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Ciceron, Jimenez, and Ortego Maurice, eds. Cluster computing and multi-hop network research. Hauppauge, N.Y: Nova Science Publishers, Inc., 2009.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Rani, Shalli, and Syed Hassan Ahmed. Multi-hop Routing in Wireless Sensor Networks: An Overview, Taxonomy, and Research Challenges. Springer, 2015.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Rani, Shalli, and Syed Hassan Ahmed. Multi-Hop Routing in Wireless Sensor Networks: An Overview, Taxonomy, and Research Challenges. Springer London, Limited, 2015.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Rani, Shalli, and Syed Hassan Ahmed. Multi-hop Routing in Wireless Sensor Networks: An Overview, Taxonomy, and Research Challenges. Springer, 2015.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Poocharoen, Panupat, and Mario E. Magaña. Partial Network Coding with Cooperation: A Study over Multi-hop Communications in Wireless Networks. LAP Lambert Academic Publishing, 2011.

Find full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Multi-Hop Wireless Sensor Network"

1

Eswaran, Sharanya, Matthew Johnson, Archan Misra, and Thomas La Porta. "Adaptive In-Network Processing for Bandwidth and Energy Constrained Mission-Oriented Multi-hop Wireless Networks." In Distributed Computing in Sensor Systems, 87–102. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-02085-8_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Jin, Yanliang, Yingxiong Song, Jian Chen, Yingchun Li, Junjie Zhang, and Junni Zou. "MR. Eye: A Multi-hop Real-time Wireless Multimedia Sensor Network." In Lecture Notes in Electrical Engineering, 999–1008. Dordrecht: Springer Netherlands, 2013. http://dx.doi.org/10.1007/978-94-007-7262-5_114.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

El-Hoiydi, Amre, and Jean-Dominique Decotignie. "WiseMAC: An Ultra Low Power MAC Protocol for Multi-hop Wireless Sensor Networks." In Algorithmic Aspects of Wireless Sensor Networks, 18–31. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-27820-7_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Venugopal, K. R., Shiv Prakash T., and M. Kumaraswamy. "QMSR: Qos Multi-hop Sensor Routing Cross-Layer Design for WSNs." In QoS Routing Algorithms for Wireless Sensor Networks, 113–22. Singapore: Springer Singapore, 2020. http://dx.doi.org/10.1007/978-981-15-2720-3_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Meghji, Mahir, and Daryoush Habibi. "Transmission Power Control in Single-Hop and Multi-hop Wireless Sensor Networks." In Multiple Access Communications, 130–43. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-23795-9_12.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Wei, Yawen, Zhen Yu, and Yong Guan. "COTA: A Robust Multi-hop Localization Scheme in Wireless Sensor Networks." In Distributed Computing in Sensor Systems, 338–55. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11776178_21.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Xu, Dan, and Xin Liu. "Energy Efficient Throughput Optimization in Multi-hop Wireless Networks." In NETWORKING 2007. Ad Hoc and Sensor Networks, Wireless Networks, Next Generation Internet, 49–60. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007. http://dx.doi.org/10.1007/978-3-540-72606-7_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Even, Guy, Yaniv Fais, Moti Medina, Shimon Shahar, and Alexander Zadorojniy. "Real-Time Video Streaming in Multi-hop Wireless Static Ad Hoc Networks." In Algorithms for Sensor Systems, 188–201. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-28209-6_15.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Even, Guy, Yakov Matsri, and Moti Medina. "Multi-hop Routing and Scheduling in Wireless Networks in the SINR Model." In Algorithms for Sensor Systems, 202–14. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-28209-6_16.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Zhang, Peng, Xu Ding, Jing Wang, and Juan Xu. "Multi-hop Wireless Recharging Sensor Networks Optimization with Successive Interference Cancellation." In Wireless Algorithms, Systems, and Applications, 482–94. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-23597-0_39.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Multi-Hop Wireless Sensor Network"

1

Kangwoo Lee, Jae-eon Kim, Do Do Thuy, Daeyoung Kim, Sungjin Ahn, and Jinyoung Yang. "Multi-hop Network Re-programming Modelfor Wireless Sensor Networks." In 2006 5th IEEE Conference on Sensors. IEEE, 2006. http://dx.doi.org/10.1109/icsens.2007.355609.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Li, Yang, and Bin Hu. "Multi-hop Encryption Protocol for Wireless Sensor Network." In 2011 Second International Conference on Networking and Distributed Computing (ICNDC). IEEE, 2011. http://dx.doi.org/10.1109/icndc.2011.80.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Panda, Hitesh, Manoranjan Das, and Benudhar Sahu. "Multi-Hop Communication in Wireless Underground Sensor Network." In 2021 International Conference in Advances in Power, Signal, and Information Technology (APSIT). IEEE, 2021. http://dx.doi.org/10.1109/apsit52773.2021.9641101.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Boukerche, Azzedine, and Xin Fei. "Energy-Efficient Multi-hop Virtual MIMO Wireless Sensor Network." In 2007 IEEE Wireless Communications and Networking Conference. IEEE, 2007. http://dx.doi.org/10.1109/wcnc.2007.785.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Kovac, Jelena, Jovan Crnogorac, Enis Kocan, and Malisa Vucinic. "Sniffing Multi-hop Multi-channel Wireless Sensor Networks." In 2020 28th Telecommunications Forum (TELFOR). IEEE, 2020. http://dx.doi.org/10.1109/telfor51502.2020.9306544.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Tajari, Mohammad Mahdi, Mohammad Hossien Yaghmaee Moghaddam, Masood Niazi Torshiz, and Javad Artin. "FUMOR: FUzzy Multi-hOp Routing for Wireless Sensor Network." In 2011 7th International Conference on Wireless Communications, Networking and Mobile Computing (WiCOM). IEEE, 2011. http://dx.doi.org/10.1109/wicom.2011.6040349.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Mager, Fabian, Johannes Neumann, Carsten Herrmann, Marco Zimmerling, and Frank Fitzek. "All-to-all Communication in Multi-hop Wireless Networks with Mixer." In SenSys '16: The 14th ACM Conference on Embedded Network Sensor Systems. New York, NY, USA: ACM, 2016. http://dx.doi.org/10.1145/2994551.2996706.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Eidaks, Janis, Romans Kusnins, Deniss Kolosovs, Ruslans Babajans, Darja Cirjulina, Pavels Krukovskis, and Anna Litvinenko. "Multi-Hop RF Wireless Power Transfer for Autonomous Wireless Sensor Network." In 2022 Workshop on Microwave Theory and Techniques in Wireless Communications (MTTW). IEEE, 2022. http://dx.doi.org/10.1109/mttw56973.2022.9942525.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Junlin Li and G. AlRegib. "Maximizing Network Lifetime for Estimation in Multi-Hop Wireless Sensor Networks." In 17th International Conference on Computer Communications and Networks 2008. IEEE, 2008. http://dx.doi.org/10.1109/icccn.2008.ecp.150.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Kim, Hyung-Sin, Jae-Seok Bang, and Yong-Hwan Lee. "Distributed Multi-hop Network Association in Large-Scale Wireless Sensor Networks." In 2013 IEEE 33rd International Conference on Distributed Computing Systems Workshops (ICDCSW). IEEE, 2013. http://dx.doi.org/10.1109/icdcsw.2013.72.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Multi-Hop Wireless Sensor Network"

1

Maltz, David A., Josh Broch, and David B. Johnson. Experiences Designing and Building a Multi-Hop Wireless Ad Hoc Network Testbed. Fort Belvoir, VA: Defense Technical Information Center, March 1999. http://dx.doi.org/10.21236/ada368412.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Multi-Hop Wireless Sensor Network' for particular source types:
Journal articles Dissertations / Theses
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography