Communication algorithms for wireless ad hoc networks.

Bibliographic Details
Main Author: Viqar, Saira
Other Authors: Welch, Jennifer L. (Thesis advisor)
Format: Thesis eBook
Language:English
Published: [College Station, Tex.] : [Texas A&M University], [2012]
Subjects:
Online Access:Link to OAK Trust copy

MARC

Tag First Indicator Second Indicator Subfields
LEADER 00000cam a2200000Ka 4500
001 in00002785819
005 20150922151247.0
006 m fo d
007 cr unu||||||||
008 121127s2012 txu obm 000 0 eng d
035 |a (OCoLC)ocn819424821 
035 |a (OCoLC)819424821 
035 |a (TxCM)http://hdl.handle.net/1969.1/ETD-TAMU-2012-08-11766 
040 |a TXA  |c TXA  |d UtOrBLW 
049 |a TXAM 
099 |a 2012  |a Dissertation  |a 1969.1/ETD-TAMU-2012-08-11766 
100 1 |a Viqar, Saira. 
245 1 0 |a Communication algorithms for wireless ad hoc networks. 
264 1 |a [College Station, Tex.] :  |b [Texas A&M University],  |c [2012] 
300 |a 1 online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
500 |a "Major Subject: Computer Science" 
588 |a Description from author supplied metadata (automated record created 2012-10-22 13:24:58). 
502 |b Doctor of Philosophy  |c Texas A&M University  |d 2012  |o http://hdl.handle.net/1969.1/ETD-TAMU-2012-08-11766 
504 |a Includes bibliographical references. 
516 |a Text (Dissertation) 
520 3 |a In this dissertation we present deterministic algorithms for reliable and efficient communication in ad hoc networks. In the first part of this dissertation we give a specification for a reliable neighbor discovery layer for mobile ad hoc networks. We present two different algorithms that implement this layer with varying progress guarantees. In the second part of this dissertation we give an algorithm which allows nodes in a mobile wireless ad hoc network to communicate reliably and at the same time maintain local neighborhood information. In the last part of this dissertation we look at the distributed trigger counting problem in the wireless ad hoc network setting. We present a deterministic algorithm for this problem which is communication efficient in terms of the the maximum number of messages received by any processor in the system. 
500 |a Electronic resource. 
650 4 |a Major Computer Science. 
653 |a Mobile Ad Hoc Networks 
653 |a Sensor Networks 
653 |a Neighbor Discovery 
700 1 |a Welch, Jennifer L.,  |e thesis advisor. 
856 4 0 |u http://hdl.handle.net/1969.1/ETD-TAMU-2012-08-11766  |z Link to OAK Trust copy  |t 0 
994 |a C0  |b TXA 
948 |a cataloged  |b h  |c 2012/11/27  |d o  |e blrosas  |f 2:20:46 pm 
999 |a MARS 
999 f f |s 4294aaad-ac20-3b78-ba95-43bc8d096c68  |i 3d63906d-279c-3ee3-93d5-0b3e4c811a55  |t 0 
952 f f |a Texas A&M University  |b College Station  |c Electronic Resources  |d Available Online  |t 0  |e 2012 Dissertation 1969.1/ETD-TAMU-2012-08-11766  |h Other scheme 
998 f f |a 2012 Dissertation 1969.1/ETD-TAMU-2012-08-11766  |t 0  |l Available Online