Open Access. Powered by Scholars. Published by Universities.®
- Discipline
- Institution
- Publication
- Publication Type
Articles 1 - 13 of 13
Full-Text Articles in OS and Networks
Energy-Efficient Multi-Rate Opportunistic Routing In Wireless Mesh Networks, Mohammad Ali Mansouri Khah, Neda Moghim, Nasrin Gholami, Sachin Shetty
Energy-Efficient Multi-Rate Opportunistic Routing In Wireless Mesh Networks, Mohammad Ali Mansouri Khah, Neda Moghim, Nasrin Gholami, Sachin Shetty
VMASC Publications
Opportunistic or anypath routing protocols are focused on improving the performance of traditional routing in wireless mesh networks. They do so by leveraging the broadcast nature of the wireless medium and the spatial diversity of the network. Using a set of neighboring nodes, instead of a single specific node, as the next hop forwarder is a crucial aspect of opportunistic routing protocols, and the selection of the forwarder set plays a vital role in their performance. However, most opportunistic routing protocols consider a single transmission rate and power for the nodes, which limits their potential. To address this limitation, this …
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 …
Learning Improvement Heuristics For Solving Routing Problems, Yaoxin Wu, Wen Song, Zhiguang Cao, Jie Zhang, Andrew Lim
Learning Improvement Heuristics For Solving Routing Problems, Yaoxin Wu, Wen Song, Zhiguang Cao, Jie Zhang, Andrew Lim
Research Collection School Of Computing and Information Systems
Recent studies in using deep learning to solve routing problems focus on construction heuristics, the solutions of which are still far from optimality. Improvement heuristics have great potential to narrow this gap by iteratively refining a solution. However, classic improvement heuristics are all guided by hand-crafted rules which may limit their performance. In this paper, we propose a deep reinforcement learning framework to learn the improvement heuristics for routing problems. We design a self-attention based deep architecture as the policy network to guide the selection of next solution. We apply our method to two important routing problems, i.e. travelling salesman …
Preforming A Vulnerability Assessment On A Secured Network, Mathias Sovine
Preforming A Vulnerability Assessment On A Secured Network, Mathias Sovine
Williams Honors College, Honors Research Projects
A computer network will be built using 3 routers, 1 switch, and 4 computers. The network will be used to simulate the connections between an at home office and the internet. The network will be divided into 3 sub-networks. The routers will be secured using methods like access control lists, changing default admin passwords, and network encryption. The switch will be secured using methods like switchport security and setting access passwords. Once the network is secured, three penetration testing techniques and three exploits will be performed on the network. The results of the exploits and penetration testing techniques will be …
An Object Oriented Approach To Modeling And Simulation Of Routing In Large Communication Networks, Armin Mikler, Johnny S. Wong, Vasant Honavar
An Object Oriented Approach To Modeling And Simulation Of Routing In Large Communication Networks, Armin Mikler, Johnny S. Wong, Vasant Honavar
Johnny Wong
The complexity (number of entities, interactions between entities, and resulting emergent dynamic behavior) of large communication environments which contain hundreds of nodes and links make simulation an important tool for the study of such systems. Given the difficulties associated with complete analytical treatment of complex dynamical systems, it is often the only practical tool that is available. This paper presents an example of a flexible, modular, object-oriented toolbox designed to support modeling and experimental analysis of a large family of heuristic knowledge representation and decision functions for adaptive self-managing communication networks with particular emphasis on routing strategies. It discusses in …
Residual-Based Measurement Of Peer And Link Lifetimes In Gnutella Networks, Xiaoming Wang, Zhongmei Yao, Dmitri Loguinov
Residual-Based Measurement Of Peer And Link Lifetimes In Gnutella Networks, Xiaoming Wang, Zhongmei Yao, Dmitri Loguinov
Zhongmei Yao
Existing methods of measuring lifetimes in P2P systems usually rely on the so-called create-based method (CBM), which divides a given observation window into two halves and samples users "created" in the first half every Delta time units until they die or the observation period ends. Despite its frequent use, this approach has no rigorous accuracy or overhead analysis in the literature. To shed more light on its performance, we flrst derive a model for CBM and show that small window size or large Delta may lead to highly inaccurate lifetime distributions. We then show that create-based sampling exhibits an inherent …
Modeling Heterogeneous User Churn And Local Resilience Of Unstructured P2p Networks, Zhongmei Yao, Derek Leonard, Dmitri Loguinov, Xiaoming Wang
Modeling Heterogeneous User Churn And Local Resilience Of Unstructured P2p Networks, Zhongmei Yao, Derek Leonard, Dmitri Loguinov, Xiaoming Wang
Zhongmei Yao
Previous analytical results on the resilience of unstructured P2P systems have not explicitly modeled heterogeneity of user churn (i.e., difference in online behavior) or the impact of in-degree on system resilience. To overcome these limitations, we introduce a generic model of heterogeneous user churn, derive the distribution of the various metrics observed in prior experimental studies (e.g., lifetime distribution of joining users, joint distribution of session time of alive peers, and residual lifetime of a randomly selected user), derive several closed-form results on the transient behavior of in-degree, and eventually obtain the joint in/out degree isolation probability as a simple …
Networks - I: A Dynamic Transmission Power Control Routing Protocol To Avoid Network Partitioning In Wireless Sensor Networks, Ghufran Ahmed, Noor M. Khan, Mirza M Yasir Masood
Networks - I: A Dynamic Transmission Power Control Routing Protocol To Avoid Network Partitioning In Wireless Sensor Networks, Ghufran Ahmed, Noor M. Khan, Mirza M Yasir Masood
International Conference on Information and Communication Technologies
Power utilization in an efficient manner is a hot research issue in wireless sensor networks (WSNs). WSNs consist of energy hungry sensor nodes. Researchers have been trying to increase the lifetime of WSN since the development of WSN technology. Dynamic Transmission Power Control (DTPC) is a method for an efficient utilization of the energy resource and thus leads to an increase in lifetime. It has been used for the determination of minimum transmission power. A valuable study about the impact of variable transmission power on link quality has already been present in literature. In contrast to DTPC, transmitting data at …
Networks - I: A Comparative Analysis Of Energy-Aware Routing Protocols In Wireless Sensor Networks, Mohsin Raza, Ghufran Ahmed, Noor M. Khan, M Awais, Qasim Badar
Networks - I: A Comparative Analysis Of Energy-Aware Routing Protocols In Wireless Sensor Networks, Mohsin Raza, Ghufran Ahmed, Noor M. Khan, M Awais, Qasim Badar
International Conference on Information and Communication Technologies
This paper presents the implementation of two routing protocols for Wireless Sensor Networks (WSNs): GRACE (GRAdient Cost Establishment for Energy Aware routing) and GRAB (GRAdient Broadcasting) along with their comparative analysis using Sun SPOT sensor nodes, developed by Sun Microsystems. The performance of both the routing protocols is evaluated on the basis of various performance metrics including network lifetime, throughput and network energy etc. However in papers where these routing protocols presented, practical limitations of wireless sensor nodes were ignored. The communication of sensor nodes is established using multiple communication channels for proper implementation of both the routing protocols, GRACE …
Capability Information: A Cost-Effective Information Model For Multi-Hop Routing Of Wireless Ad Hoc Networks In The Real Environment, Zhen Jiang, Zhigang Li, Jie Wu, Nong Xiao
Capability Information: A Cost-Effective Information Model For Multi-Hop Routing Of Wireless Ad Hoc Networks In The Real Environment, Zhen Jiang, Zhigang Li, Jie Wu, Nong Xiao
Computer Science Faculty Publications
No abstract provided.
Residual-Based Measurement Of Peer And Link Lifetimes In Gnutella Networks, Xiaoming Wang, Zhongmei Yao, Dmitri Loguinov
Residual-Based Measurement Of Peer And Link Lifetimes In Gnutella Networks, Xiaoming Wang, Zhongmei Yao, Dmitri Loguinov
Computer Science Faculty Publications
Existing methods of measuring lifetimes in P2P systems usually rely on the so-called create-based method (CBM), which divides a given observation window into two halves and samples users "created" in the first half every Delta time units until they die or the observation period ends. Despite its frequent use, this approach has no rigorous accuracy or overhead analysis in the literature. To shed more light on its performance, we flrst derive a model for CBM and show that small window size or large Delta may lead to highly inaccurate lifetime distributions. We then show that create-based sampling exhibits an inherent …
Modeling Heterogeneous User Churn And Local Resilience Of Unstructured P2p Networks, Zhongmei Yao, Derek Leonard, Dmitri Loguinov, Xiaoming Wang
Modeling Heterogeneous User Churn And Local Resilience Of Unstructured P2p Networks, Zhongmei Yao, Derek Leonard, Dmitri Loguinov, Xiaoming Wang
Computer Science Faculty Publications
Previous analytical results on the resilience of unstructured P2P systems have not explicitly modeled heterogeneity of user churn (i.e., difference in online behavior) or the impact of in-degree on system resilience. To overcome these limitations, we introduce a generic model of heterogeneous user churn, derive the distribution of the various metrics observed in prior experimental studies (e.g., lifetime distribution of joining users, joint distribution of session time of alive peers, and residual lifetime of a randomly selected user), derive several closed-form results on the transient behavior of in-degree, and eventually obtain the joint in/out degree isolation probability as a simple …
Three Power-Aware Routing Algorithms For Sensor Networks, Javed Aslam, Qun Li, Daniela Rus
Three Power-Aware Routing Algorithms For Sensor Networks, Javed Aslam, Qun Li, Daniela Rus
Dartmouth Scholarship
This paper discusses online power‐aware routing in large wireless ad hoc networks (especially sensor networks) for applications in which the message sequence is not known. We seek to optimize the lifetime of the network. We show that online power‐aware routing does not have a constant competitive ratio to the off‐line optimal algorithm. We develop an approximation algorithm called max–min zPmin that has a good empirical competitive ratio. To ensure scalability, we introduce a second online algorithm for power‐aware routing. This hierarchical algorithm is called zone‐based routing. Our experiments show that its performance is quite good. Finally, we …