Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Algorithms (2)
- Wireless sensor networks (2)
- Access control (1)
- Ad hoc networks (1)
- Ad hoc networks computer networks (1)
-
- Bandwidths (1)
- Bridge/routers (1)
- Computer and information sciences (1)
- Computer communication networks (1)
- Computer simulation (1)
- Control methods (1)
- Data protection (1)
- Internet of things (1)
- Key management (1)
- Localization (1)
- Loop formation (1)
- Management (1)
- Minimal cost flow (1)
- Network protocols (1)
- Network reliability (1)
- Physical sciences (1)
- Properties (1)
- Quality of service (1)
- Quality of service architectures (1)
- Reproducibility of results (1)
- Research and analysis methods (1)
- Routing (1)
- Theta (1)
- Traffic (1)
- Traffic flow (1)
- Publication
- Publication Type
Articles 1 - 4 of 4
Full-Text Articles in OS and Networks
Joint Congestion And Contention Avoidance In A Scalable Qos-Aware Opportunistic Routing In Wireless Ad-Hoc Networks, Ali Parsa, Neda Moghim, Sasan Haghani
Joint Congestion And Contention Avoidance In A Scalable Qos-Aware Opportunistic Routing In Wireless Ad-Hoc Networks, Ali Parsa, Neda Moghim, Sasan Haghani
VMASC Publications
Opportunistic routing (OR) can greatly increase transmission reliability and network throughput in wireless ad-hoc networks by taking advantage of the broadcast nature of the wireless medium. However, network congestion is a barrier in the way of OR's performance improvement, and network congestion control is a challenge in OR algorithms, because only the pure physical channel conditions of the links are considered in forwarding decisions. This paper proposes a new method to control network congestion in OR, considering three types of parameters, namely, the backlogged traffic, the traffic flows' Quality of Service (QoS) level, and the channel occupancy rate. Simulation results …
Efficient Algorithms For Identifying Loop Formation And Computing Θ Value For Solving Minimum Cost Flow Network Problems, Timothy Michael Chávez, Duc Thai Nguyen
Efficient Algorithms For Identifying Loop Formation And Computing Θ Value For Solving Minimum Cost Flow Network Problems, Timothy Michael Chávez, Duc Thai Nguyen
Computational Modeling & Simulation Engineering Faculty Publications
While the minimum cost flow (MCF) problems have been well documented in many publications, due to its broad applications, little or no effort have been devoted to explaining the algorithms for identifying loop formation and computing the value needed to solve MCF network problems. This paper proposes efficient algorithms, and MATLAB computer implementation, for solving MCF problems. Several academic and real-life network problems have been solved to validate the proposed algorithms; the numerical results obtained by the developed MCF code have been compared and matched with the built-in MATLAB function Linprog() (Simplex algorithm) for further validation.
Efficient Corona Training Protocols For Sensor Networks, Alan A. Bertossi, Stephan Olariu, Cristina M. Pinotti
Efficient Corona Training Protocols For Sensor Networks, Alan A. Bertossi, Stephan Olariu, Cristina M. Pinotti
Computer Science Faculty Publications
Phenomenal advances in nano-technology and packaging have made it possible to develop miniaturized low-power devices that integrate sensing, special-purpose computing, and wireless communications capabilities. It is expected that these small devices, referred to as sensors, will be mass-produced and deployed, making their production cost negligible. Due to their small form factor and modest non-renewable energy budget, individual sensors are not expected to be GPS-enabled. Moreover, in most applications, exact geographic location is not necessary, and all that the individual sensors need is a coarse-grain location awareness. The task of acquiring such a coarse-grain location awareness is referred to as training. …
Group Key Management In Wireless Ad-Hoc And Sensor Networks, Mohammed A. Moharrum
Group Key Management In Wireless Ad-Hoc And Sensor Networks, Mohammed A. Moharrum
Computer Science Theses & Dissertations
A growing number of secure group applications in both civilian and military domains is being deployed in WAHNs. A Wireless Ad-hoc Network (WARN) is a collection of autonomous nodes or terminals that communicate with each other by forming a multi-hop radio network and maintaining connectivity in a decentralized manner. A Mobile Ad-hoc Network (MANET) is a special type of WARN with mobile users. MANET nodes have limited communication, computational capabilities, and power. Wireless Sensor Networks (WSNs) are sensor networks with massive numbers of small, inexpensive devices pervasive throughout electrical and mechanical systems and ubiquitous throughout the environment that monitor and …