• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 5
  • 1
  • Tagged with
  • 6
  • 6
  • 6
  • 3
  • 3
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Broadcasting in cycles with chords

Kovalchick, Lisa L. January 1900 (has links)
Thesis (Ph. D.)--West Virginia University, 2008. / Title from document title page. Document formatted into pages; contains ix, 105 p. : ill. Includes abstract. Includes bibliographical references (p. 103-105).
2

Performance analysis of Mobile Ad Hoc Networking routing protocols /

Lee, Kok Thong. January 2004 (has links) (PDF)
Thesis (M.S. in Computer Science)--Naval Postgraduate School, Dec. 2004. / Thesis Advisor(s): Geoffrey Xie. Includes bibliographical references (p. 129-132). Also available online.
3

On the tightness of inner and outer bounds for broadcast channels with three and more receivers. / CUHK electronic theses & dissertations collection

January 2010 (has links)
The last part considered a k-receiver broadcast channel with two unmatched degraded components, and degraded message sets where receiver Ys, s ∈ {1, ··· , k} requires messages (Ms, ··· , Mk). We established the capacity region for this class of broadcast channels by showing that superposition coding is optimal. In the process of proving the achievability, we showed a general superposition coding region for any broadcast channels with degraded message requirement. / The main contributions in this thesis consist of the following three parts: The first part studied the existing inner and outer bounds to the capacity region for 3-receiver broadcast channels with 2-degraded message sets, in an attempt to find the deficiencies with the current techniques of establishing the bounds. We produced a simple example where we were able to explicitly evaluate these bounds to show that they are indeed different. For a class of channels where the bounds differ, we used a new argument to show that the inner bound is tight and outer bound is weak. / The second part considered a broadcast channel consisting of k receivers that lie in a less noisy sequence. The capacity region for this scenario had been unknown since the mid 1970s, when k ≥ 3. We solved this open problem for the case k = 3. Indeed we proved that superposition coding is optimal for a class of broadcast channels with a sequence of less noisy receivers. This class contains the k = 3 case, thus resolving its capacity region. / This thesis focused on a fundamental problem of network information theory called broadcast channel, which models the communication from a single sender to multiple receivers (say, from a cellular tower to cell phone users in its coverage area). The goal is to determine the set of achievable communication data rates where each receiver can decode the messages it requires with high fidelity. From a purely theoretical standpoint, however, this problem of characterizing the feasible rate region (capacity region) had stumped researchers for over three decades. / Wang, Zizhou. / Advisers: Shua-Yen Robert Li; Nair Chandra M. / Source: Dissertation Abstracts International, Volume: 72-04, Section: B, page: . / Thesis (Ph.D.)--Chinese University of Hong Kong, 2010. / Includes bibliographical references (leaves 67-70). / Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Electronic reproduction. Ann Arbor, MI : ProQuest Information and Learning Company, [200-] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Abstract also in Chinese.
4

Performance analysis of mobile ad hoc networking routing protocols

Thong, Lee Kok 12 1900 (has links)
Approved for public release, distribution is unlimited / This thesis presents a simulation and performance evaluation analysis of the various routing protocols that have been proposed for the Mobile Ad Hoc Network (MANET) environment using the Network Simulator-2 (NS-2) tool. Many routing protocols have been proposed by the academic communities for possible practical implementation of a MANET in military, governmental and commercial environments. Four (4) such routing protocols were chosen for analysis and evaluation: Ad Hoc On-demand Distance Vector routing (AODV), Dynamic Source Routing (DSR), Destination-Sequenced Distance Vector routing (DSDV) and Optimized Link State Routing (OLSR). NS-2 is developed and maintained by the University of Southern California's Information Sciences Institute (ISI). Leveraging on NS-2's simulation capabilities, the key performance indicators of the routing protocols were analyzed such as data network throughput, routing overhead generation, data delivery delay as well as energy efficiency or optimization. The last metric is explored, especially due to its relevance to the mobile environment. Energy is a scare commodity in a mobile ad hoc environment. Any routing software that attempts to minimize energy usage will prolong the livelihood of the devices used in the battlefield. Three important mobility models are considered, namely, Random Waypoint, Manhattan Grid, and Reference Point Group Mobility. The application of these three models will enhance the realism of simulation to actual real life mobility in an urban or military setup scenario. The performance of the routing protocols in varied node density, mobility speed as well as loading conditions have been studied. The results of the simulation will provide invaluable insights to the performance of the selected routing protocols. This can serve as a deciding factor for the U.S. Department of Defense (DoD) in their selection of the most suitable routing protocols tailored to their specific needs. / Civilian, Defence Science Technology Agency, Singapore
5

Connection management applications for high-speed audio networking /

Sibanda, Phathisile. January 2007 (has links)
Thesis (M.Sc. (Computer Science)) - Rhodes University, 2008.
6

Connection management applications for high-speed audio networking

Sibanda, Phathisile 12 March 2008 (has links)
Traditionally, connection management applications (referred to as patchbays) for high-speed audio networking, are predominantly developed using third-generation languages such as C, C# and C++. Due to the rapid increase in distributed audio/video network usage in the world today, connection management applications that control signal routing over these networks have also evolved in complexity to accommodate more functionality. As the result, high-speed audio networking application developers require a tool that will enable them to develop complex connection management applications easily and within the shortest possible time. In addition, this tool should provide them with the reliability and flexibility required to develop applications controlling signal routing in networks carrying real-time data. High-speed audio networks are used for various purposes that include audio/video production and broadcasting. This investigation evaluates the possibility of using Adobe Flash Professional 8, using ActionScript 2.0, for developing connection management applications. Three patchbays, namely the Broadcast patchbay, the Project studio patchbay, and the Hospitality/Convention Centre patchbay were developed and tested for connection management in three sound installation networks, namely the Broadcast network, the Project studio network, and the Hospitality/Convention Centre network. Findings indicate that complex connection management applications can effectively be implemented using the Adobe Flash IDE and ActionScript 2.0.

Page generated in 0.0531 seconds