A Role-oriented Routing Algorithm Applied for Wireless Heterogeneous Networks Hsing-Chung Chen Department of Computer Science and Information Engineering, Asia University Taichung, Taiwan shin8409@ms6.hinet.net also cdma2000@asia.edu.tw Kanoksak Wattanachote Institute of Computer Science and Information Engineering, Asia University Taichung, Taiwan p99267007@ms1.asia.edu.tw , kaskonak@hotmail.com Abstract—In recent years, on the researches in various routing protocols, applied to wireless heterogeneous networks, become more and more important. In this paper, we propose a role- oriented routing protocol applied for wireless heterogeneous networks based on a selected knowledge discovery agent with maintaining an n-bits map table. The routing protocol can be applied to digital home wireless heterogeneous networks. It is a role-oriented routing protocol which can get more flexible and achieve fault tolerant for packet routing in wireless heterogeneous networks. Keywords-wireless heterogeneous networks; role-oriented; knowledge discovery agent; digital home networks I. INTRODUCTION Due to Internet has been development rapidly, various routing protocols, in wireless heterogeneous networks (WHNs), were proposed by researchers [4]. There are various routing protocols for routing packet data in Internet. The routing protocols can be categorized into two types; one is the Global Routing (GR) algorithm, and the other one is the Decentralized Routing (DR) algorithm [6]. (a) (b) Figure 1. A network topology demonstration, a source node is node 1 and a destination node is node 3. (a) The shortest path discovered by global routing algorithm (GR). (b) The shortest path discovered by decentralized routing algorithm (DR). By way of GR algorithm as shown in Figure 1 (a), the routing path of minimum cost will be calculated between source node and destination node by gathering the topology information from global network, such as the knowledge discovery agent for topology bit-map (KDATB) algorithm [7]. The shortest route for the network topology in Figure 1 (a) is 1 → 2 → 3, if and only if node 1 plays a role as a source node and node 3 is a destination node. Whilst, both Routing Information Protocol (RIP) algorithm [3] and Ad hoc On-Demand Distance Vector Routing (AODV) algorithm [1, 2] are typical DR algorithms, in which each node only knows the costs which directly connect to other neighbor nodes. And when all nodes exchange the topology information, it will calculate its shortest path from each source node to destination node. As shown in the Figure 1 (b), the different shortest route result is 1 → 4 → 3. In this paper, we propose a role-oriented routing protocol based on Knowledge Discovery (KD) agent with maintaining n-bits map routing table (n-bits MRT), which is suitable for WHNs environment. It is a role-oriented routing protocol which can get more flexible and achieve fault tolerant for packet routing in WHNs. In addition, the proposed routing protocol is suitable to the environment of Digital Home Wireless Heterogeneous Networks (DHWHNs). The rest of the paper is organized as below. In Sec. II, we introduce the related works. Our scheme is proposed in Sec. III. In Sec. IV, discuss and analyze for fault tolerant for packet routing and control packet overheads. Finally, our conclusions are presented in Sec. V. II. REVIEW OF KDATB ROUTING PROTOCOL In 2008, Lee et al. [7] proposed a KDATB routing protocol, in which selected agent node will gather all network topology information, and then distribute a constructing bit-map routing table (BRT) to all other nodes. In BRT, a connecting state between two neighboring nodes is expressed as a binary bit. Through with the BRT, each node can decrease the overheads for maintaining its routing table [7]. Figure 2. A network topology presents an agent node is receiving ‘Hello message’ from neighbor nodes in network. (Note: node 1 expresses as an agent node.) For example, a network topology is shown as Figure 2, we suppose the node 1 is an agent node which directly 2011 Fifth International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing 978-0-7695-4372-7/11 $26.00 © 2011 IEEE DOI 10.1109/IMIS.2011.145 476 2011 Fifth International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing 978-0-7695-4372-7/11 $26.00 © 2011 IEEE DOI 10.1109/IMIS.2011.145 420