hh.sePublikasjoner
Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Wireless Network Connectivity Measure
Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE).
Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE).
Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE).
2011 (engelsk)Independent thesis Advanced level (degree of Master (Two Years)), 20 poäng / 30 hpOppgave
Abstract [en]

The efficiency to which a wireless multi node network is connected is generally measured by the probability that all the nodes are connected to a master node or connected to a master node via other connected node. The grade of connectivity measures how easily and reliably a packet sent by a node can reach another node. Our thesis work is aimed to find connectivity measurement between the nodes in a wireless multi node network. The result is investigated by randomly placing all the nodes in a given area of 38*38 meters and by estimating the connectivity of the whole network. The sub goals of the thesis are To Design a link metric To Find a Routing algorithm which provides information about neighboring nodesAchieving the expected results from this thesis work, it can be a contribution to the research in the measure of connectivity for a wireless multi-node network. By using the available routing algorithm and by setting up appropriate threshold for (i) Good connectivity (ii) Average connectivity (iii) bad connectivity, the status (connectivity measure) is informed to the master node (teacher node) in the network, so that the life time of the whole network is enhanced. Various results and solutions are provided and discussed for the above stated problem from the practical experiments.

sted, utgiver, år, opplag, sider
2011. , s. 56
Emneord [en]
network, connectivity
HSV kategori
Identifikatorer
URN: urn:nbn:se:hh:diva-16655Lokal ID: IDE1148OAI: oai:DiVA.org:hh-16655DiVA, id: diva2:461998
Presentation
2011-06-20, E320, Halmstad University, Halmstad, 11:01 (engelsk)
Uppsök
Technology
Veileder
Examiner
Tilgjengelig fra: 2011-12-06 Laget: 2011-12-06 Sist oppdatert: 2011-12-06bibliografisk kontrollert

Open Access i DiVA

fulltext(1577 kB)484 nedlastinger
Filinformasjon
Fil FULLTEXT01.pdfFilstørrelse 1577 kBChecksum SHA-512
6dd8774cf679653ea373f2ecfad989a2cab91873f0eb549eeb42638acd565e11aa024d16553127cecbed681f8efab4a0472ca3c11173c3da3022e47f8a5d7d90
Type fulltextMimetype application/pdf

Søk i DiVA

Av forfatter/redaktør
Kandimalla, Jyothi Manju BhargaviVanam, AdityaMathiyalagan, Prathap
Av organisasjonen

Søk utenfor DiVA

GoogleGoogle Scholar
Totalt: 484 nedlastinger
Antall nedlastinger er summen av alle nedlastinger av alle fulltekster. Det kan for eksempel være tidligere versjoner som er ikke lenger tilgjengelige

urn-nbn

Altmetric

urn-nbn
Totalt: 613 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf