Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Service discovery oriented clustering for mobile and adhoc networks
Download
index.pdf
Date
2010
Author
Bulut, Gülşah
Metadata
Show full item record
Item Usage Stats
110
views
57
downloads
Cite This
Adhoc networks do not depend on any fixed infrastructure. The most outstanding features of adhoc networks are non-centralized structure and dynamic topology change due to high mobility. Since mentioned dynamics of mobile adhoc networks complicate reaching the resources in the network, service discovery is significantly an important part of constructing stand-alone and self-configurable mobile adhoc networks. The heterogeneity of the devices and limited resources such as battery are also load up more difficulty to service discovery. Due to the volatile nature of the adhoc networks, service discovery algorithms proposed for mobile and adhoc networks suffer from some problems. Scalability becomes a problem when the service discovery is based on flooding messages over the network. Furthermore, the high traffic which occurs due to the message exchange between network nodes makes the communication almost impossible. Partitioning a network into sub-networks is an efficient way of handling scalability problem. In this thesis, a mobility based service discovery algorithm for clustered MANET is presented. The algorithm has two main parts. First one is for partitioning the MANET into sub-networks, named “clustering”. Second part is composed of an efficient discovery of services on overall network. Clustering algorithm used in this study is enhanced version of DMAC (Distributed Mobility Adaptive Clustering, which is one of the golden algorithms of the wireless network clustering area). To be fast and flexible in service discovery layer, a simple and fastresponding algorithm is implemented. Integration of two algorithms enables devices to be mobile in the network.
Subject Keywords
Computer enginnering.
,
Distributed computing.
,
MANET.
URI
http://etd.lib.metu.edu.tr/upload/2/12611889/index.pdf
https://hdl.handle.net/11511/19674
Collections
Graduate School of Natural and Applied Sciences, Thesis
Suggestions
OpenMETU
Core
Performance evaluation of routing protocols in wireless ad hoc networks with service differentiation
Yılmaz, Semra; Koçyiğit, Altan; Erten, Murat; Department of Information Systems (2003)
An ad hoc network is a collection of wireless mobile nodes dynamically forming a temporary network without the use of any fixed network infrastructure or centralized administration. Due to the limitations in the wireless environment, it may be necessary for one mobile host to enlist the aid of other hosts in forwarding a packet to its destination. In order to enable communication within the network, a routing protocol is needed to discover routes between nodes. The primary goal of ad hoc network routing pro...
Energy- aware task scheduling over mobile ad hoc networks
Bokar, Ali; Bozyiğit, Müslim; Department of Computer Engineering (2009)
Mobile ad hoc networks (MANETs) can be formed dynamically without the support of any existing infrastructure or any centralized administration. They consist of heterogeneous mobile nodes which are powered by batteries, move arbitrarily and are connected by wireless links. Battery energy limitation is one of the main challenges in the MANETs. Several hardware and software based techniques have been proposed in this field. Most of the previous studies have considered only the energy minimization of individual...
Energy-aware routing algorithms for wireless ad hoc networks with heterogeneous power supplies
Vazifehdan, Javad; Prasad, R. Venkatesha; Onur, Ertan; Niemegeers, Ignas (Elsevier BV, 2011-10-27)
Although many energy-aware routing schemes have been proposed for wireless ad hoc networks, they are not optimized for networks with heterogeneous power supplies, where nodes may run on battery or be connected to the mains (grid network). In this paper, we propose several energy-aware routing algorithms for such ad hoc networks. The proposed algorithms feature directing the traffic load dynamically towards mains-powered devices keeping the hop count of selected routes minimal. We unify these algorithms into...
Secure communication channel mechanisms for isolated networks
Karadağ, Gökdeniz; Özgit, Attila; Department of Computer Engineering (2009)
Current network security solutions are consisted of a single host, with network interfaces of the host connected to protected and external networks at the same time. This design ensures security by restricting traffic flow to a single point, where it can be examined and acted on by a set of rules. However, this design also has a flaw and a single point of failure, that being the vulnerabilities in the security device itself. An adversary would have unhindered access to protected networks if a vulnerability ...
Optimal resource allocation algorithms for efficient operation of wireless networks
Özel, Ömür; Uysal Bıyıkoğlu, Elif; Department of Electrical and Electronics Engineering (2009)
In this thesis, we analyze allocation of two separate resources in wireless networks: transmit power and buffer space. Controlled allocation of power can provide good performance for both users and the network. Although centralized mechanisms are possible, distributed power control algorithms are preferable for efficient operation of the network. Viewing distributed power allocation as the collection of rational decisions of each user, we make game theoretic problem formulations, devise distributed algorith...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
G. Bulut, “Service discovery oriented clustering for mobile and adhoc networks,” M.S. - Master of Science, Middle East Technical University, 2010.