Thesis (M.S.)--University of Delaware, 2009. / Principal faculty advisor: Charles G. Boncelet, Dept. of Computer & Information Sciences. Includes bibliographical references.

Thesis (Ph. D.)--University of Hong Kong, 2001. / Includes bibliographical references.

Thesis (M.S.)--Rutgers University, 2009. / "Graduate Program in Electrical and Computer Engineering." Includes bibliographical references (p. 41-42).

Thesis (M.S.)--Florida State University, 2003. / Advisor: Dr. Xin Yuan, Florida State University, College of Arts and Sciences, Dept. of Computer Science. Title and description from dissertation home page (viewed Apr. 7, 2004). Includes bibliographical references.

Thesis (M.S.)--Worcester Polytechnic Institute. / Keywords: MAC routing protocols; ad hoc networking; MANET; performance evaluation. Includes bibliographical references (p.75-76).

Thesis (M.S.)--Worcester Polytechnic Institute. / Keywords: TCP; RED; satellite; PEP; STP; performance enhancing proxy; segment caching; IP-ABR; Internet; bandwidth reservation; IP-VBR; congestion avoidance; bandwidth sharing. Includes bibliographical references (p. 98-99).

M. Tech. Electrical Engineering. / Discusses the question of how to prolong the life of an entire sensor network by reducing the power consumption is the most important issue in wireless sensor networks. Traditional routing schemes have not fulfilled the expectations of an optimised WSN, and as a result, new algorithms are being designed globally. One of these protocols which serve as a basis for this study is the RCRR. In this project, we present a new approach of the Relative Coordinates Rumor Routing algorithm based on a link quality awareness scheme and a modified version of the protocol with better scaling.The benefits of this study are: Proposal of a tuneable algorithm that will not only consume less power compared to the classic RR but also addresses the scalability problem encountered with the original RCRR. Proposal a better trade-off between throughput and average end-to-end delay with the use of the SMAC (compared with Rumor protocol). Avoidance of long delays in queues and saving power on retransmission of packets. Reduction of the wandering of agents during communication. Prolonging the lifetime of the network and thus offering economic, operational, and environmental benefits. Balancing link quality awareness with a topological localisation scheme to achieve better throughput.

M. Tech. Electrical Engineering. / This research presented an integrated formal model of the JXTA protocol suite. The integrated model is constructed from the individual models describing the behaviours of protocols entities. Written in the PROMELA specification language, the finite state automata of these models are shown instead. The SPIN-based formal verification revealed that this studys integrated model was too large to perform for the computational resources available. This was in spite of the application of multiple complexity reduction techniques. Subsequently, as final recourse, the research resorted to the formal verification of individual protocols by making further abstraction of the interaction and dependencies between protocols. A number of errors were found including an invalid end state in the routing protocols and multiple non-progress cycles.

No description available.

This thesis addresses a novel type of network known as a mobile ad hoc network. A mobile ad hoc network is a collection of entirely mobile nodes that can establish communication in the absence of any fixed infrastructure. Envisioned applications of these networks include virtual classrooms, emergency relief operations, military tactical communications, sensor networks and community networking. Mobile ad hoc networking poses several new challenges in the design of network protocols. This thesis focuses on the routing problem. The main challenges in the design of a routing protocol for mobile ad hoc networks result from them having limited resources and there being frequent topological changes that occur unpredictably. Moreover, there is no fixed infrastructure that supports routing. The conventional routing protocols are not generally suitable for mobile ad hoc networks, as they cannot react quickly to the changing network topology, cause excessive communication and computation, or converge very slowly creating routing loops. In this thesis we propose two classes of routing schemes for mobile ad hoc networks. The first class is known as Limited Flooding Protocol. The protocol is fully reactive and does not require the computation of routing tables. It uses some basic principles of flooding, but reduces the communication overhead by restricting packet propagation through the network. Several variations of limited flooding are considered including deterministic, randomised and priority-based mechanisms. The main advantage of this protocol is that it can be used in networks with unpredictable topological changes and highly mobile nodes, since maintaining routing table at the intermediate nodes is not required. The second class of routing protocols is based on hierarchical clustering architecture and is intended for use in a relatively low mobility environment. The basic idea of this protocol is to partition the entire network into smaller units known as clusters and define routing mechanisms both within and between clusters using a hierarchical architecture. The main advantage of this architecture is reduction of storage requirements of routing information, communication overhead and computational overhead at each node. Discrete-event simulation is used for modelling and performance evaluation. Various options and variations of the protocols are examined in the…[Page 2 of abstract is missing.] / Thesis (Ph.D.)-University of Natal, Durban, 2000.