421 |
GRID-BASED DEPLOYMENT FOR WIRELESS SENSOR NETWORKS IN OUTDOOR ENVIRONMENT MONITORING APPLICATIONSAL-TURJMAN, FADI 02 May 2011 (has links)
Wireless Sensor Networks (WSNs) overcome the difficulties of other monitoring systems, as they require no human attendance on site, provide real-time interaction with events, and maintain cost and power efficient operations. However, further efficiencies are required especially in the case of Outdoor Environment Monitoring (OEM) applications due to their harsh operational conditions, huge targeted areas, limited energy budget, and required Three-Dimensional (3D) setups. A fundamental issue in defeating these practical challenges is the deployment planning of the WSNs. The deployment plan is a key factor of many intrinsic properties of OEM networks, summarized in connectivity, lifetime, fault-tolerance, and cost-effectiveness. In this thesis, we investigate the problem of WSNs deployments that address these properties in order to overcome the unique challenges and circumstances in OEM applications.
A natural solution to this problem is to have multiple relay nodes that reserve more energy for sensing, and provide vast coverage area. Furthermore, assuming a subset of these relay nodes are mobile can contribute in repairing the network connectivity problems and recovering faulty nodes, in addition to granting balanced load distributions, and hence prolonging the network lifetime. We investigate this promising research direction by proposing a 3D grid-based deployment planning for heterogeneous WSNs in which Sensor Nodes (SNs) and Relay Nodes (RNs) are efficiently deployed on grid vertices. Towards this efficiency, we analyze and characterize the grid connectivity property in the 3D space. Afterward, we design optimization schemes for the placement of SNs and RNs on the 3D grid models. Based on theoretical analysis and extensive simulations, the proposed schemes show a significant enhancement in terms of network connectivity and lifetime in OEM applications. / Thesis (Ph.D, Computing) -- Queen's University, 2011-05-02 10:29:01.785
|
422 |
Permeability estimation of fracture networksJafari, Alireza Unknown Date
No description available.
|
423 |
IntelliSensorNet: A Positioning Technique Integrating Wireless Sensor Networks and Artificial Neural Networks for Critical Construction Resource TrackingSoleimanifar, Meimanat Unknown Date
No description available.
|
424 |
Dodec: A Random-link Approach for Low-radix On-chip NetworksYang, Haofan 11 December 2013 (has links)
Network topologies play a vital role in chip design; they largely determine the cost of the network and significantly impact performance in many-core architectures. We propose a novel set of on-chip networks, dodecs, and illustrate how they reduce network diameter with randomized low-radix router connections. In addition, we design an adaptive routing algorithm for dodec networks to achieve high throughput. By introducing randomness, dodec networks exhibit more uniform message latency. By using low-radix routers, dodec networks simplify the router microarchitecture and attain 20% area and 22% power reduction compared to mesh routers while delivering the same overall application performance for PARSEC. We compare our dodec network to alternative low-radix network topologies and show that at the same cost, dodec networks increase the throughput up to 50% while reducing average latency by 10% compared to a mesh.
|
425 |
Design and evaluation of MAC protocols for hybrid fiber/coaxial systemsSala, Dolors 05 1900 (has links)
No description available.
|
426 |
Network exploration and exploitation in international entrepreneurship: an opportunity-based viewFaroque, Anisur Rahman January 2014 (has links)
International entrepreneurship (IE) exists at the interface of two distinct research fields - entrepreneurship and international business (IB). However, IE studies typically fail to integrate research from both fields, leaning much more towards IB. This study uses core concepts from entrepreneurship to explain the export performance of early internationalising firms. It contributes to the network and international opportunity-based view in IE by incorporating the twin concepts of exploration and exploitation into a dynamic capability perspective, showing how these affect export performance.
While early internationalising firms including born globals constitute an important component in IE, empirical interest in this field focuses on high-tech and knowledge-intensive industries from developed countries. In addition, research in the field is mainly of qualitative nature investigating small numbers of firms. Therefore, much is unknown about how early internationalising firms differ in their dynamic network capabilities and opportunity related capabilities. We investigate these aspects using structural equation modelling based on a sample of 647 SMEs and large, young and mature export start-ups operating in the traditional low-tech apparel industry from a South Asian developing country (Bangladesh).
This study shows that both network exploitation and exploration capabilities positively influence international opportunity exploitation and exploration capabilities. In turn, international opportunity exploitation and exploration capabilities influence export performance. This study also demonstrates that the relationship between network capabilities and export performance is both direct and indirect through the mediation of the twin international opportunity capabilities.
The moderation analysis of firm age and size sheds additional light on the liabilities of newness and smallness of early internationalising firms. Interestingly, we find that the liabilities of smallness and newness do not have the same influence in different stages of IE. The role of firm size is more pronounced at the earlier stage of IE. In contrast, firm age accentuates in the later stage of the twin opportunity capabilities-export performance relationship. One possible explanation of this may be that developing and managing networks for the purpose of exploiting and exploring international opportunities is the most effortful and resource demanding stage in the entrepreneurial process. During this stage, owner-managers assess their own organisational resources, explore the possibilities of attracting external network resources and match their own resources with those of network partners. This stage reflects what is called "resource orchestration" in the strategic entrepreneurship literature. In the later stage, when opportunities are already developed and exploited, only minimal resources are then needed to achieve performance advantage. Age becomes a dominant factor because older firms derive greater performance advantage than younger firms due to their accumulated experience and learning throughout the years.
This study indicates that firms may overcome their liability of smallness by connecting with new foreign partners, especially customers, resulting in more export orders. Policy makers can also help them connect with new partners by organising trade fairs, trade missions and sponsoring other promotion programmes. With respect to the liability of newness prevailing in the later stage, owner-managers should work with prominent business partners to help them get good referrals and overcome the lack of legitimacy in establishing new relations. Finally, the managers of early internationalising firms should be empowered to develop relationships with external partners.
|
427 |
Using topological information in opportunistic network coding / by Magdalena Johanna (Leenta) GroblerGrobler, Magdalena Johanna January 2008 (has links)
Recent advances in methods to increase network utilization have lead to the introduction of a relatively new method called Network Coding. Network Coding is a method that can reduce local congestion in a network by combining information sent over the network. It is commonly researched in the information theory field after it was first introduced by Ahlswede et al in 2000.
Network Coding was proven in 2003, by Koetter & Medard to be the only way to achieve the throughput capacity defined by the Min cut Max flow theorem of Shannon. It was applied deterministically in wired networks and randomly in wireless networks. Random Network Coding however requires a lot of overhead and may cause possible delays in the network.
We found that there is an open question as to determine where in a wireless network, Network Coding can be implemented. In this thesis we propose to find opportunities for the implementation of Network Coding, by searching for known deterministic Network Coding topologies in larger Networks. Because a known topology is used, we will then also know how Network Coding should be implemented. This method of finding opportunities for the implementation of Network Coding using topology can be combined with a routing algorithm to improve the utilization of a wireless network.
We implemented our method on three different topologies and searched 1000 random networks for the presence of these topologies. We found that these topologies occurred frequently enough to make our method a viable method of finding opportunities for the implementation of Network Coding. / Thesis (M.Ing. (Computer and Electronical Engineering))--North-West University, Potchefstroom Campus, 2009.
|
428 |
Localization and Coverage in Wireless Ad Hoc NetworksGribben, Jeremy 04 August 2011 (has links)
Localization and coverage are two important and closely related problems in wireless ad hoc networks. Localization aims to determine the physical locations of devices in a network, while coverage determines if a region of interest is sufficiently monitored by devices. Localization systems require a high degree of coverage for correct functioning, while coverage schemes typically require accurate location information. This thesis investigates the relationship between localization and coverage such that new schemes can be devised which integrate approaches found in each of these well studied problems. This work begins with a thorough review of the current literature on the subjects of localization and coverage. The localization scheduling problem is then introduced with the goal to allow as many devices as possible to enter deep sleep states to conserve energy and reduce message overhead, while maintaining sufficient network coverage for high localization accuracy. Initially this sufficient coverage level for localization is simply a minimum connectivity condition. An analytical method is then proposed to estimate the amount of localization error within a certain probability based on the theoretical lower bounds of location estimation. Error estimates can then be integrated into location dependent schemes to improve on their robustness to localization error. Location error estimation is then used by an improved scheduling scheme to determine the minimum number of reference devices required for accurate localization. Finally, an optimal coverage preserving sleep scheduling scheme is proposed which is robust to localization error, a condition which is ignored by most existing solutions. Simulation results show that with localization scheduling network lifetimes can be increased by several times and message overhead is reduced while maintaining negligible differences in localization error. Furthermore, results show that the proposed coverage preserving sleep scheduling scheme results in fewer active devices and coverage holes under the presence of localization error.
|
429 |
Network Traffic Control Based on Modern Control Techniques: Fuzzy Logic and Network Utility MaximizationLiu, Jungang 30 April 2014 (has links)
This thesis presents two modern control methods to address the Internet traffic congestion control issues. They are based on a distributed traffic management framework for the fast-growing Internet traffic in which routers are deployed with intelligent or optimal data rate controllers to tackle the traffic mass.
The first one is called the IntelRate (Intelligent Rate) controller using the fuzzy logic theory. Unlike other explicit traffic control protocols that have to estimate network parameters (e.g., link latency, bottleneck bandwidth, packet loss rate, or the number of flows), our fuzzy-logic-based explicit controller can measure the router queue size directly. Hence it avoids various potential performance problems arising from parameter estimations while reducing much computation and memory consumption in the routers. The communication QoS (Quality of Service) is assured by the good performances of our scheme such as max-min fairness, low queueing delay and good robustness to network dynamics. Using the Lyapunov’s Direct Method, this controller is proved to be globally asymptotically stable.
The other one is called the OFEX (Optimal and Fully EXplicit) controller using convex optimization. This new scheme is able to provide not only optimal bandwidth allocation but also fully explicit congestion signal to sources. It uses the congestion signal from the most congested link, instead of the cumulative signal from a flow path. In this way, it overcomes the drawback of the relatively explicit controllers that bias the multi-bottlenecked users, and significantly improves their convergence speed and throughput performance. Furthermore, the OFEX controller design considers a dynamic model by proposing a remedial measure against the unpredictable bandwidth changes in contention-based multi-access networks (such as shared Ethernet or IEEE 802.11). When compared with the former works/controllers, such a remedy also effectively reduces the instantaneous queue size in a router, and thus significantly improving the queueing delay and packet loss performance.
Finally, the applications of these two controllers on wireless local area networks have been investigated. Their design guidelines/limits are also provided based on our experiences.
|
430 |
Using topological information in opportunistic network coding / by Magdalena Johanna (Leenta) GroblerGrobler, Magdalena Johanna January 2008 (has links)
Recent advances in methods to increase network utilization have lead to the introduction of a relatively new method called Network Coding. Network Coding is a method that can reduce local congestion in a network by combining information sent over the network. It is commonly researched in the information theory field after it was first introduced by Ahlswede et al in 2000.
Network Coding was proven in 2003, by Koetter & Medard to be the only way to achieve the throughput capacity defined by the Min cut Max flow theorem of Shannon. It was applied deterministically in wired networks and randomly in wireless networks. Random Network Coding however requires a lot of overhead and may cause possible delays in the network.
We found that there is an open question as to determine where in a wireless network, Network Coding can be implemented. In this thesis we propose to find opportunities for the implementation of Network Coding, by searching for known deterministic Network Coding topologies in larger Networks. Because a known topology is used, we will then also know how Network Coding should be implemented. This method of finding opportunities for the implementation of Network Coding using topology can be combined with a routing algorithm to improve the utilization of a wireless network.
We implemented our method on three different topologies and searched 1000 random networks for the presence of these topologies. We found that these topologies occurred frequently enough to make our method a viable method of finding opportunities for the implementation of Network Coding. / Thesis (M.Ing. (Computer and Electronical Engineering))--North-West University, Potchefstroom Campus, 2009.
|
Page generated in 0.0376 seconds