Figure 1 - uploaded by Zahian Ismail
Content may be subject to copyright.
HetMAN Architecture  

HetMAN Architecture  

Source publication
Article
Full-text available
Networks are being used in various areas and the demand of users nowadays has motivated the emergence of the Mobile Ad Hoc Network (MANET). MANET is a dynamic network without fixed infrastructure due to their wireless nature and can be deployed as multi-hop packet networks. It is a wireless network and has dynamic topology due to its node mobility....

Context in source publication

Context 1
... it can give us more opportunity to deal with the more realistic problems than the closed one. Figure 1 shows the proposed architecture for heterogeneous MANET known as HetMAN. The details have been discussed in [6]. ...

Similar publications

Conference Paper
Full-text available
The use of wireless networks on environments with real-time constrains requires timeliness and dependability guarantees to allow the execution of time-restricted networked operations. The current wireless standards and state-of-the-art solutions pay no or little attention to dependability aspects of communications, which are fundamental to secure a...
Thesis
Full-text available
This doctoral thesis proposes a framework has controling and management the return network in Digital Television from four components: Digital Television Provider, Interactivity Terminal, Return Channel Provider, and Content Provider. Together, they interact based on a signaling mechanism that propagates QoS restrictions associated to the current i...
Article
Full-text available
In wireless networks, wireless channels are often shared between multiple nodes, which may interfere when they transmit simultaneously. The media access control (MAC) scheme coordinates channel access between the different nodes. In this article, we focus one specific method of channel access, Elimination-Yield Non-Preemptive Priority Multiple Acce...
Article
Full-text available
In mobile ad hoc wireless network (MANET), secure communication is more challenging task due to its fundamental characteristics like infrastructure less, wireless link, distributed cooperation, dynamic topology, lack of association, resource constrained and physical vulnerability of node. In MANET, attacks can be broadly classified in two categorie...
Technical Report
Full-text available
Increasing demand for high-speed wireless networks has motivated the development of wireless cellular and ad-hoc networks. In order to fully exploit the technological development in radio hardware and integrated circuits, which allow for implementation of more complicated communi- cation schemes, the fundamental performance limits of wireless netwo...

Citations

... The size of a data packet is defined as 300B. For routing, the size of control packets flowing through the backbone is selected as 64B as it is shown to be the optimum size for AODV discovery packets as well [28]. The same packet size is also chosen for the standard AODV algorithm. ...
Article
Full-text available
Control and user (data) plane separation (CUPS) is a concept applied in various networking areas to scale network resources independently, increase the quality of service, and facilitate the autonomy of networks. In this study, we leverage this concept to design a plane-separated routing algorithm, CUPS-based hierarchical routing algorithm (CHRA), as an energy-efficient and low-latency end-to-end communication scheme for clustered ad-hoc networks. In CHRA, while cluster heads constitute the control plane to conduct network discovery and routing, ordinary nodes residing in the user plane forward packets according to the routing decisions taken by the control plane. Exploiting the CUPS, we avoid exhausting cluster heads by offloading packet-forwarding to ordinary nodes and improve the quality of service by utilizing alternative paths other than the backbone of cluster heads. Our simulation results show that CHRA offers a better quality of service in terms of end-to-end latency and data-to-all ratio, and promotes fairness in energy-consumption in both stationary and mobile scenarios.
... AODV provides unicast multicast and broadcast communication ability. It reduces routing overhead but produces more delay [13] [20]. ...
Conference Paper
Full-text available
In today’s smart revolutionary era, Intelligent Transportation System (ITS) is a buzzword that plays a vital role. Vehicular ad-hoc network (VANET) techniques help ITS for improving efficiency as well as road safety services to vehicles and drivers. The vehicle acts as a node in the special ad-hoc network. Communication in the VANET is accomplished through IEEE802.11p i.e. Dedicated Short Range Communication (DSRC) and Wireless Access Vehicular Environment (WAVE). The ways of communication in the VANET are within vehicles (V2V) and vehicle-to-road (V2R). Routing is a foremost issue in the VANET environment due to the dynamic variation of topology, the restricted movement pattern of the vehicle, unstable links and complex city environments. Implementation of the VANET environment is a difficult task in a real environment. The objective of the paper is to simulate topological routing protocols to evaluate QoS. The simulation uses ManhattanGrid mobility to reflect the realistic vehicular environment. The simulation is conducted in various test environments with the variation in the vehicular density and speed of the vehicle. The influence of both factors on the QoS parameter is evaluated with Packet Delivery Ratio, Throughput, Avg. E2ED and Normalized Routing Overhead. AODV produces better PDR, Throughput and less NRL. OLSR produces less Avg. E2ED with respect to other protocols.
... To measure the total size of control packets, different aspects and design issues are specifically considered for each algorithm. In the backbone routing, for the size of control packets flowing through the backbone, an optimum AODV packet size is selected, which is 64 bytes [12]. The same packet size is also chosen for the standard AODV algorithm. ...
Preprint
Separation of user (data) plane from the control plane in networks helps scale resources independently, increase the quality of service and facilitate autonomy by employing software-defined networking techniques. Clustering introduces hierarchy in ad hoc networks where control functions can be carried out by some designated cluster heads. It is also an effective solution to handle challenges due to lack of centralized controllers and infrastructure in ad-hoc networks. Clustered network topologies gain a significant amount of scalability and reliability in comparison to flat topologies. Different roles that nodes have in a clustered network can be effectively used for routing as well. In this paper, we propose a novel plane-separated routing algorithm, Cluster-based Hybrid Routing Algorithm (CHRA). In CHRA, we take advantage of the hierarchical clustered structure through control and user plane separation (CUPS) in mobile ad-hoc networks. In the cluster neighborhood with a particular size, a link-state routing is used to minimize delay, control overhead, and also utilize energy consumption. For facilitating the communication with distant nodes, we form a routing backbone that is responsible for both control and data messages. The results show that CHRA outperforms its opponents in terms of fair energy consumption and end-to-end delay.
... MANET is a set of wireless nodes or devices that connects to each other as peer to peer without server devices and without any previous connection establishment processes. MANET has many characteristics to make it different than wired networks, the main characteristic in MANET that it does not have a fixed network topology because of its dynamically moving nodes, for that reason, MANET has a different routing protocols than any other networks types [6] [7][8] [9] [10]. MANET have a different set of routing protocols in order to carry the packets from source to destination, the routing protocols in MANET are divided into two main categories: Proactive and Reactive. ...
Article
Full-text available
Mobile Ad-Hoc networks (MANET) have become related to several aspects in human life while normal users uses the wireless mobile systems without prior knowledge about how such systems works. In order to support the mobility in MANETs, the routing protocols are needed to handle the data transmission between the wireless nodes from a source to destination. Ad-Hoc On demand Distance Vector (AODV) and Dynamic Source Routing (DSR) is a popular routing protocols used in MANET. Vehicular Ad-Hoc Networks (VANET) is a special type of MANET which is used to support the high mobility between moving cars on the roads. In this paper the AODV and DSR are applied on a VANET over two different scenarios, dense and sparse traffic based on cars density on the road, and then both protocols are evaluated based on different performance metrics.
... Ismail, Z. et al [1] "Impacts of Packet Size on AODV Routing Protocol Implementation in Homogeneous and Heterogeneous MANET" Networks are being utilized as a part of different territories and the interest of clients these days has persuaded the development of the Mobile Ad Hoc Network (MANET). ...
... DSR show better PDR while AODV shows lower delay. In [5] author studied the effect of packet size on AODV protocol in homogeneous and heterogeneous MANET. Result says that effect of packet size in homogeneous network is better than heterogeneous network. ...
Article
Full-text available
Performance of routing protocols rely on the node mobility, network size, traffic volume, and connectivity patterns. Increasing number of connections in the wireless network creates more data section and incurs more collision. Therefore, there is a need of identifying efficient routing protocol to provide call services in such network. In this paper, we analyze the performance of routing protocols like dynamic source routing (DSR), ad hoc on demand distance vector (AODV) and Destination-Sequenced Distance-Vector (DSDV) for different network sizes creating multiple TCP connections for different mobile nodes considering random way point (RWP) mobility model. Result shows that AODV protocol achieves higher throughput and packet delivery ratio (PDR) at the cost of more packet loss and routing overhead and DSR achieves lower delay as compared to others.
... The aim of this paper is to evaluate the Performance of Handover in WiMax with TCP and UDP protocols. Performance matrices in term end-to-end delay and throughput, which is defined as the average rate of successful message delivery over a communication channel (Zahian and Hassan, 2011a;2011b), were used in this study against packet size and traffic load. This paper contains six main sections. ...
Article
Full-text available
The rejection of an ongoing connection/session is serious problem and it degrades the QoS and efficiency of the network rather than rejecting a request for new connection. The impact on performance of handovers is a serious problem in cellular systems that must be addressed. During handover there may be delay in packets and connections may drop. Real time applications i.e., VoIP and streaming video can be adversely affected by such kind of delays. In this study we used TCP and UDP as an underlying protocol for exchange of data between two wireless mobile nodes in a WiMax access network and had evaluated the effect on performance in terms of end-to-end delay and throughput. The results showed that when handover is triggered the transfer window resets to zero causing higher throughput and end-to-end delay for TCP than UDP based on packet size and traffic load. © 2015 Karam Dhafer Mayoof, Rosilah Hassan, Amjed Sid Ahmed and Ahmed Marwan.
... Another work was done by Ismail, Z[3]. He presented Effects of Packet Size on AODV Routing Protocol Implementation in Homogeneous and Heterogeneous MANET. ...
... It is expected that the information packet will reach the intended node with less number of hops but in the case when the intermediate node fails to re-transmit the information packet towards the next node in the way due to any complication, it transmits the Route Error (RERR) message. When the source node receives the RERR, it will again start the route discovery process for intended node[7]The advantage in AODV routing is that, it provides the change in link situation very easily, but at the same time the node may undergoes the large delays during route manipulation and consume more bandwidth as the network size increases[5]. ...
... In MANETs, the nodes are mobile due to this the topology of the network changes arbitrarily [1], the link between two nodes is wireless, sometimes it causes link breakage [11], hence the routing performance is a major challenge in mobile ad hoc networks. Mobile Ad hoc Networks are categorized into Homogeneous and Heterogeneous networks [15]. Homogeneous Mobile Ad hoc networks carry the same type of mobile nodes whereas heterogeneous mobile ad hoc networks comprises different types of mobile nodes. ...
... (3 ) cos cos 15 6 ...
Article
Full-text available
Computer networks of any kind are vulnerable to potential queuing problems that we see in our day-to-day life, MANETs are no exception especially in the context of routing. The key challenge with the MANETs is that they are infrastructure-less, highly mobile and nodes are connected dynamically in an arbitrary manner. AODV happens to be the important reactive routing protocol. Several researchers have worked on AODV in particular queuing problems pertaining to routing in AODV. Many of the researches focused on delay time as the key metric for performance evaluation, however it is also important to consider the performance metrics like dropping probability, throughput, expected queuing delay, average response time along with delay time. In this paper an analytical study is carried out for evaluating performance of AODV based on finite queuing model M/M/1/K with "K" finite buffer capacity at a node. The afore mentioned metrics are evaluated by varying arrival rate, service rate, number of nodes, buffer capacity and probability of packets processing locally. Influence of buffer capacity, arrival rate, service rate, number of nodes and probability of packets processing locally on various performance metrics is demonstrated through well defined formulae as well as graphs.