Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Wireless Network Connectivity Measure
Halmstad University, School of Information Science, Computer and Electrical Engineering (IDE).
Halmstad University, School of Information Science, Computer and Electrical Engineering (IDE).
Halmstad University, School of Information Science, Computer and Electrical Engineering (IDE).
2011 (English)Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
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.

Place, publisher, year, edition, pages
2011. , 56 p.
Keyword [en]
network, connectivity
National Category
Embedded Systems
Identifiers
URN: urn:nbn:se:hh:diva-16655Local ID: IDE1148OAI: oai:DiVA.org:hh-16655DiVA: diva2:461998
Presentation
2011-06-20, E320, Halmstad University, Halmstad, 11:01 (English)
Uppsok
Technology
Supervisors
Examiners
Available from: 2011-12-06 Created: 2011-12-06 Last updated: 2011-12-06Bibliographically approved

Open Access in DiVA

fulltext(1577 kB)417 downloads
File information
File name FULLTEXT01.pdfFile size 1577 kBChecksum SHA-512
6dd8774cf679653ea373f2ecfad989a2cab91873f0eb549eeb42638acd565e11aa024d16553127cecbed681f8efab4a0472ca3c11173c3da3022e47f8a5d7d90
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Kandimalla, Jyothi Manju BhargaviVanam, AdityaMathiyalagan, Prathap
By organisation
School of Information Science, Computer and Electrical Engineering (IDE)
Embedded Systems

Search outside of DiVA

GoogleGoogle Scholar
Total: 417 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 186 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf