Wireless Mesh network (WMN) is dynamically self-organizing and self-configured, with the nodes in the
network automatically establishing an ad-hoc network and maintaining the mesh connectivity. The ability
to use multiple-radios and multiple channels can be cashed to increase aggregate throughput of wireless
mesh network. Thus the efficient use of available interfaces and channels without interference becomes
the key factor. In this paper we propose interference aware clustered based channel assignment schemes
which minimizes the interference and increases throughput. In our proposed scheme we have given
priority to minimize interference from nearby mesh nodes in interference range than maximizing channel
diversity. We simulated our proposed work using NS-3 and results show that our scheme improves
network performance than BFSCA and Distributed Greedy CA.
With the increase of usage of wireless networks for purposes where the nodes are either stationary or minimally mobile, focus is also on increasing the network capacity of wireless networks. One such way is to use non-overlapping multiple channels provided by 802.11 by using multiple interfaces per node. Multiple non overlapped channels exist in the 2.4 GHz and 5 GHz spectrum. Under this scenario, several challenges need to be addressed before all the available channels can be fully utilized.
GTSH: A New Channel Assignment Algorithm in Multi-Radio Multi-channel Wireles...IJERA Editor
One of the complexities in a wireless mesh networks is its low throughput. For this reason and due to the fact that throughput is highly reduced by increased number of nodes, it is difficult to extend such networks. Therefore, providing a high throughput in these networks is an essential goal. The main lowering cause of efficiency of such networks is interference between wireless links. A high interference leads to a reduced throughput. In this research, two channel assignment methods were presented using genetic and tabu search algorithms and their advantages and disadvantages were assessed. Finally, a new method combining the advantages of both methods was proposed. With the help of NS2 network simulator, our work was simulated and the combination results of the two methods were compared. The results were indicative of the better performance of the hybrid method and significant increase of throughput in the network.
A Survey of Various Routing and Channel Assignment Strategies for MR-MC WMNsijsrd.com
One fundamental problem of WMNs with a limited number of radio interfaces and orthogonal channels is that the performance degrades significantly as the network size grows. This results from increased interference between nodes and diminished spatial reuse over the network. A WMN node needs to share a common channel with each of its neighbours in the communication range, requiring it to set up a virtual link. Moreover, to reduce network interference, a node should minimize the number of neighbours that it shares a common channel with. The objective of a channel assignment strategy is to ensure efficient utilization of the available channels (e.g., by minimizing interference) while maximizing connectivity in the network. However, since these two requirements are conflicting with each other, the goal is to achieve a balance between these two. The major constraints which need to be satisfied by a channel assignment scheme include fixed number of channels in the network, limited number of radios in mesh nodes, common channel between two communicating nodes, and limited channel capacity. Also, a channel assignment scheme should take the amount of traffic load supported by each mesh node into consideration.
PERFORMANCE ANALYSIS OF WIRELESS MESH NETWORK USING ADAPTIVE INFORMANT FACTOR...IJCSES Journal
Wireless mesh network (WMN) has become an important leading technology which provides several types of useful applications such as community network, broadband home network and internet access, etc. The rise in the size of users in WMN has created a degradation of efficiency in a network especially in dense areas due to the clumsy channel allocation and hence creating many challenges for enhancing the users experience, network quality and throughput. Therefore in this paper, we proposed OCA based AIF model that can access the channel information and then it process to improve the RF channel association. The proposed OCA-AIF will function for each period when some interference is detected via AIF and we further extend this analysis by taking in to consideration the influence of interference to provide a high quality indicator in network. The analysis of result shows the optimization by our proposed approach which increases as per the increment of relay nodes (RNs).
MULTI-HOP BANDWIDTH MANAGEMENT PROTOCOL FOR MOBILE AD HOC NETWORKSIJMIT JOURNAL
An admission control scheme should play the role of a coordinator for flows in a data communication network, to provide the guarantees as the medium is shared. The nodes of a wired network can monitor the medium to know the available bandwidth at any point of time. But, in wireless ad hoc networks, a node must consume the bandwidth of neighboring nodes, during a communication. Hence, the consumption of bandwidth by a flow and the availability of resources to any wireless node strictly depend upon the neighboring nodes within its transmission range. We present a scalable and efficient admission control scheme, Multi-hop Bandwidth Management Protocol (MBMP), to support the QoS requirements
in multi-hop ad hoc networks. We simulate several options to design MBMP and compare the performances of these options through mathematical analysis and simulation results, and compare its effectiveness with the existing admission control schemes through extensive simulations.
Efficient and stable route selection by using cross layer concept for highly...Roopali Singh
Efficient and stable route selection by using cross layer concept for highly mobile network with predictive features by Rupali Singh, Gajendra Singh Dhakad
published in International Journal of Research & Technology, Volume 3, Issue 4_November_2015
With the increase of usage of wireless networks for purposes where the nodes are either stationary or minimally mobile, focus is also on increasing the network capacity of wireless networks. One such way is to use non-overlapping multiple channels provided by 802.11 by using multiple interfaces per node. Multiple non overlapped channels exist in the 2.4 GHz and 5 GHz spectrum. Under this scenario, several challenges need to be addressed before all the available channels can be fully utilized.
GTSH: A New Channel Assignment Algorithm in Multi-Radio Multi-channel Wireles...IJERA Editor
One of the complexities in a wireless mesh networks is its low throughput. For this reason and due to the fact that throughput is highly reduced by increased number of nodes, it is difficult to extend such networks. Therefore, providing a high throughput in these networks is an essential goal. The main lowering cause of efficiency of such networks is interference between wireless links. A high interference leads to a reduced throughput. In this research, two channel assignment methods were presented using genetic and tabu search algorithms and their advantages and disadvantages were assessed. Finally, a new method combining the advantages of both methods was proposed. With the help of NS2 network simulator, our work was simulated and the combination results of the two methods were compared. The results were indicative of the better performance of the hybrid method and significant increase of throughput in the network.
A Survey of Various Routing and Channel Assignment Strategies for MR-MC WMNsijsrd.com
One fundamental problem of WMNs with a limited number of radio interfaces and orthogonal channels is that the performance degrades significantly as the network size grows. This results from increased interference between nodes and diminished spatial reuse over the network. A WMN node needs to share a common channel with each of its neighbours in the communication range, requiring it to set up a virtual link. Moreover, to reduce network interference, a node should minimize the number of neighbours that it shares a common channel with. The objective of a channel assignment strategy is to ensure efficient utilization of the available channels (e.g., by minimizing interference) while maximizing connectivity in the network. However, since these two requirements are conflicting with each other, the goal is to achieve a balance between these two. The major constraints which need to be satisfied by a channel assignment scheme include fixed number of channels in the network, limited number of radios in mesh nodes, common channel between two communicating nodes, and limited channel capacity. Also, a channel assignment scheme should take the amount of traffic load supported by each mesh node into consideration.
PERFORMANCE ANALYSIS OF WIRELESS MESH NETWORK USING ADAPTIVE INFORMANT FACTOR...IJCSES Journal
Wireless mesh network (WMN) has become an important leading technology which provides several types of useful applications such as community network, broadband home network and internet access, etc. The rise in the size of users in WMN has created a degradation of efficiency in a network especially in dense areas due to the clumsy channel allocation and hence creating many challenges for enhancing the users experience, network quality and throughput. Therefore in this paper, we proposed OCA based AIF model that can access the channel information and then it process to improve the RF channel association. The proposed OCA-AIF will function for each period when some interference is detected via AIF and we further extend this analysis by taking in to consideration the influence of interference to provide a high quality indicator in network. The analysis of result shows the optimization by our proposed approach which increases as per the increment of relay nodes (RNs).
MULTI-HOP BANDWIDTH MANAGEMENT PROTOCOL FOR MOBILE AD HOC NETWORKSIJMIT JOURNAL
An admission control scheme should play the role of a coordinator for flows in a data communication network, to provide the guarantees as the medium is shared. The nodes of a wired network can monitor the medium to know the available bandwidth at any point of time. But, in wireless ad hoc networks, a node must consume the bandwidth of neighboring nodes, during a communication. Hence, the consumption of bandwidth by a flow and the availability of resources to any wireless node strictly depend upon the neighboring nodes within its transmission range. We present a scalable and efficient admission control scheme, Multi-hop Bandwidth Management Protocol (MBMP), to support the QoS requirements
in multi-hop ad hoc networks. We simulate several options to design MBMP and compare the performances of these options through mathematical analysis and simulation results, and compare its effectiveness with the existing admission control schemes through extensive simulations.
Efficient and stable route selection by using cross layer concept for highly...Roopali Singh
Efficient and stable route selection by using cross layer concept for highly mobile network with predictive features by Rupali Singh, Gajendra Singh Dhakad
published in International Journal of Research & Technology, Volume 3, Issue 4_November_2015
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
A Cross Layer Based Scalable Channel Slot Re-Utilization Technique for Wirele...csandit
Due to tremendous growth of the wireless based application services are increasing the demand
for wireless communication techniques that use bandwidth more effectively. Channel slot reutilization
in multi-radio wireless mesh networks is a very challenging problem. WMNs have
been adopted as back haul to connect various networks such as Wi-Fi (802.11), WI-MAX
(802.16e) etc. to the internet. The slot re-utilization technique proposed so far suffer due to high
collision due to improper channel slot usage approximation error. To overcome this here the
author propose the cross layer optimization technique by designing a device classification
based channel slot re-utilization routing strategy which considers the channel slot and node
information from various layers and use some of these parameters to approximate the risk
involve in channel slot re-utilization in order to improve the QoS of the network. The simulation
and analytical results show the effectiveness of our proposed approach in term of channel slot
re-utilization efficiency and thus helps in reducing latency for data transmission and reduce
channel slot collision.
A CROSS-LAYER BASED SCALABLE CHANNEL SLOT RE-UTILIZATION TECHNIQUE FOR WIRELE...cscpconf
Due to tremendous growth of the wireless based application services are increasing the demand for wireless communication techniques that use bandwidth more effectively. Channel slot reutilization in multi-radio wireless mesh networks is a very challenging problem. WMNs have been adopted as back haul to connect various networks such as Wi-Fi (802.11), WI-MAX (802.16e) etc. to the internet. The slot re-utilization technique proposed so far suffer due to high collision due to improper channel slot usage approximation error. To overcome this here the author propose the cross layer optimization technique by designing a device classification based channel slot re-utilization routing strategy which considers the channel slot and node information from various layers and use some of these parameters to approximate the risk involve in channel slot re-utilization in order to improve the QoS of the network. The simulation and analytical results show the effectiveness of our proposed approach in term of channel slot re-utilization efficiency and thus helps in reducing latency for data transmission and reduce
channel slot collision.
Throughput Maximization using Spatial Reusability in Multi Hop Wireless Networkijtsrd
Energy is a valuable resource in wireless networks. For many multi hop networking scenarios, nodes require power for performing their operation, so requiring capable power management to make certain connectivity across the network. Though when wireless networks are attached outside power source due to obstruction between lively links the network may demand excessive energy per unit time Power due to this the overall performance is reduced. Since network life time or network capacity is depend on the power efficiency, many efforts to study energy efficient networks in the wireless network community. In multi hop wireless networks well organized routing algorithms are significant for network performance. We dispute that by carefully considering spatial reusability of the wireless communication media, we can reduce the overhead in multi hop wireless networks. To support our argument, propose Broadcast Tree Construction BTC and compare them with existing routing and multi path routing protocols, respectively. Our estimate outcome shows that proposed protocols significantly improve the end to end throughput compared with existing protocols. We also introduce the sleep scheduling approach for energy consumption and hybrid cryptography for security of data that can be prevent the data leakage and jammer attacks. Twinkal P. Dudhagawali | Prof. L. K. Gautam | Prof. V. P. Vaidya ""Throughput Maximization using Spatial Reusability in Multi Hop Wireless Network"" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-3 | Issue-3 , April 2019, URL: https://www.ijtsrd.com/papers/ijtsrd23489.pdf
Paper URL: https://www.ijtsrd.com/engineering/information-technology/23489/throughput-maximization-using-spatial-reusability-in-multi-hop-wireless-network/twinkal-p-dudhagawali
Energy Behavior in Ad Hoc Network Minimizing the Number of Hops and Maintaini...CSCJournals
Wireless ad-hoc mesh network is a special kind of network, where all of the nodes move in time. The topology of the network changes as the nodes are in the proximity of each other. Ad-hoc networks are generally self-configuring no stable infrastructure takes a place. In this network, each node should help relaying packets of neighboring nodes using multi-hop routing mechanism. This mechanism is needed to reach far destination nodes to solve problem of dead communication. This multiple traffic "hops" within a wireless mesh network caused dilemma. Wireless mesh network that contain multiple hops become increasingly vulnerable to problems such as energy degradation and rapid increasing of overhead packets. This paper provides a generic routing framework that balances energy efficient broadcast schemes in Wireless (Ad-Hoc) Mesh Network and maintaining connectivity of nodes (mobile terminals). Typically, each node’s activities will consume energy, either for sending packets, receiving or preparing/processing packets. Number of hops, distance of nodes, and size of packet will determine the consumption of energy. The framework is based on the principle that additional relay nodes with appropriate energy and routing metric between source and final destination significantly reduces the energy consumption necessary to deliver packets in Wireless (Ad-Hoc) Mesh Network while keep the connectivity of dynamic nodes. Using the framework, the average network connectivity is kept 18% higher and the lifetime of network lasting more than 2.38% compared with network with Link State Routing mechanism. The simulation notes that the end-to-end delay may increase rapidly if relay nodes are more than five.
International Refereed Journal of Engineering and Science (IRJES)irjes
The core of the vision IRJES is to disseminate new knowledge and technology for the benefit of all, ranging from academic research and professional communities to industry professionals in a range of topics in computer science and engineering. It also provides a place for high-caliber researchers, practitioners and PhD students to present ongoing research and development in these areas.
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
A wireless network consists of a set of wireless nodes forming the network. The bandwidth allocation scheme used in wireless networks should automatically adapt to the network’s environments, where issues such as mobility are highly variable. This paper proposes a method to distribute the bandwidth for wireless network nodes depending on dynamic methodology;this methodology uses intelligent clustering techniques that depend on the student’s distribution at the university campus, rather than the classical allocation methods. We propose a clustering-based approach to solve the dynamic bandwidth allocation problem in wireless networks, enabling wireless nodes to adapt their bandwidth allocation according to the changing number of expected users over time. The proposed solution allows the optimal online bandwidth allocation based on the data extracted from the lectures timetable, and fed to the wireless network control nodes, allowing them to adapt to their environment. The environment data is processed and clustered using the KMeans clustering algorithm to identify potential peak times for every wireless node. The proposed solution feasibility is tested by applying the approach to a case study, at the Arab American University campus wireless network.
Design and implementation of new routingIJCNCJournal
Energy consumption is a key element in the Wireless Sensor Networks (WSNs) design. Indeed, sensor nodes are really constrained by energy supply. Hence, how to improve the network lifetime is a crucial and challenging task. Several techniques are available at different levels of the OSI model to maximize the WSN lifetime and especially at the network layer which uses routing strategies to maintain the routes in the network and guarantee reliable communication. In this paper we intend to propose a new protocol called
Combined Energy and Distance Metrics Dynamic Routing Protocol (CEDM-DR). Our new approach considers not only the distance between wireless sensors but also the energy of node acting as a router in order to find the optimal path and achieve a dynamic and adaptive routing.
The performance metrics exploited for the evaluation of our protocol are average energy consumed, network lifetime and packets lost. By comparing our proposed routing strategy to protocol widely used in WSN namely Ad hoc On demand Distance Vector(AODV), simulation results show that CEDM-DR strategy might effectively balance the sensor power consumption and permits accordingly to enhance the network
lifetime. As well, this new protocol yields a noticeable energy saving compared to its counterpart.
A QoS Based MAC Protocol For Wireless Ad-hoc NetworkIJNSA Journal
Multimedia communication over wireless Ad-hoc networks has become the driving technology for many of the important applications, experiencing dramatic market growth and promising revolutionary experiences in personal communication, gaming, entertainment, military, security, environment monitoring, and more. The advances in wireless communications and growth of real-time applications have necessitated the development of wireless networks that can support high Quality of Service (QoS) and power control. A node in an ad hoc network is normally battery operated which poses a huge constraint on the power consumption of such a node. Hence, designing a power efficient MAC protocol for ad hoc wireless networks is a major challenge. In this paper, we propose a CDMA based power controlled medium access protocol for mobile and ad hoc network (MNA). The protocol conserves power and provides QoS guarantees for multimedia traffics. In that network one of the fundamental challenger in MANETs is how to increase the overall network throughputs well as reading the delay while maintaining how energy consumption for packet processing in communication. simulation results shows that the performance of the protocol with increase in traffic while QoS is better in terms of Energy consumption, throughput, & communication delay than existing protocol.
Wireless Sensor Network Using Six Sigma Multi Hop RoutingIOSR Journals
Abstract: The most significant problem in the design of wireless sensor networks is to coordinate the sensors with dynamism into a wireless communication network and route sensed data to the base station. The energy efficiency is the most important key point of the network routing designing. This paper presents the efficient multi hop routing algorithm to extend the lifetime of sensor networks and focuses by employing six sigma principles to obtain the Quality of Service. To attain QoS support, we have to find either a route to assure the application requirements or offering network response to the application when the requirements cannot be met. Keywords: Wireless Sensor Networks, Multi hop routing, six sigma, QoS
Wireless Sensor Network Using Six Sigma Multi Hop RoutingIOSR Journals
The most significant problem in the design of wireless sensor networks is to coordinate the sensors
with dynamism into a wireless communication network and route sensed data to the base station. The energy
efficiency is the most important key point of the network routing designing. This paper presents the efficient
multi hop routing algorithm to extend the lifetime of sensor networks and focuses by employing six sigma
principles to obtain the Quality of Service. To attain QoS support, we have to find either a route to assure the
application requirements or offering network response to the application when the requirements cannot be met.
A QUALITY OF SERVICE ARCHITECTURE FOR RESOURCE PROVISIONING AND RATE CONTROL ...ijasuc
Prioritized flow control is a type of QoS provisioning in which each class is provided a different QoS by
assigning priority to one class over another in terms of allocating resources. It is an effective means to
provide service differentiation to different class of service in mobile ad hoc networks. So the objective is to
achieve a desired level of service to high-priority flows so that the wireless medium is completely utilized
using adaptive rate control. In this paper, we propose to design QoS architecture for Bandwidth
Management and Rate Control in MANET. Our proposed QoS architecture contains an adaptive
bandwidth management technique which measures the available bandwidth at each node in real-time and
it is then propagated on demand by the QoS routing protocol. The source nodes perform call admission
control for different priority of flows based on the bandwidth information provided by the QoS routing.
The network bandwidth utilization is monitored continuously and network congestion is detected in
advance. Then a rate control mechanism is used to regulate best-effort traffic.
An Optimized Mechanism for Adaptive and Dynamic Policy Based Handover in Clus...pijans
On-going revolution in ever-improving wireless communication enforces the necessity of a self configuring,
rapidly deployable and infrastructure less network. MANET is such an autonomous wireless network that
meets the requirements. At the same time MANET’s random behavior and absence of any central
intelligence to gather unambiguous knowledge about user contexts complexes QoS maintenance and
hampers proper utilization of network resources resulting into unnecessary handovers. In past, few policy
driven handover approaches have been proposed for MANET but none of them explores a comprehensive
policy design. Therefore in this paper we propose an adaptive and optimized policy based handover
mechanism which is based on explicitly designed policies like load balancing, service discovery and next
hop selection .Efficient procedures for these policies are also explored .This work predicts the high time of
handover need on the basis of application specific needs of individual freely roaming mobile nodes,
avoiding unnecessary handovers and provides efficient handover procedure with optimized resource
consumption, reduced latency and interruption time.
An Efficient Routing Protocol for Mobile Ad Hoc Network for Secured Communica...pijans
Security and reliable communication is challenging task in mobile Ad Hoc network. Through mobility of network device compromised with attack and loss of data. For the prevention of attack and reliable communication, various authors proposed a method of secured routing protocol such as SAODV and SBRP (secured backup routing protocol). The process of these methods work along with route discovery and route maintains, discovery and route maintained needed more power consumption for that process. The power of devices is decrease during such process and network lifetimes expire. In this paper, we modified the secured stateless protocol for secured routing and minimized the utilization of power during path discovering and establishment. For the authentication of group node used group signature technique and sleep mode threshold concept for power minimization. Our proposed technique is simulated in ns-2 and compare to other routing protocol gives a better performance in comparison to energy consumption and throughput of network.
More Related Content
Similar to INTERFERENCE-AWARE CHANNEL ASSIGNMENT FOR MAXIMIZING THROUGHPUT IN WMN
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
A Cross Layer Based Scalable Channel Slot Re-Utilization Technique for Wirele...csandit
Due to tremendous growth of the wireless based application services are increasing the demand
for wireless communication techniques that use bandwidth more effectively. Channel slot reutilization
in multi-radio wireless mesh networks is a very challenging problem. WMNs have
been adopted as back haul to connect various networks such as Wi-Fi (802.11), WI-MAX
(802.16e) etc. to the internet. The slot re-utilization technique proposed so far suffer due to high
collision due to improper channel slot usage approximation error. To overcome this here the
author propose the cross layer optimization technique by designing a device classification
based channel slot re-utilization routing strategy which considers the channel slot and node
information from various layers and use some of these parameters to approximate the risk
involve in channel slot re-utilization in order to improve the QoS of the network. The simulation
and analytical results show the effectiveness of our proposed approach in term of channel slot
re-utilization efficiency and thus helps in reducing latency for data transmission and reduce
channel slot collision.
A CROSS-LAYER BASED SCALABLE CHANNEL SLOT RE-UTILIZATION TECHNIQUE FOR WIRELE...cscpconf
Due to tremendous growth of the wireless based application services are increasing the demand for wireless communication techniques that use bandwidth more effectively. Channel slot reutilization in multi-radio wireless mesh networks is a very challenging problem. WMNs have been adopted as back haul to connect various networks such as Wi-Fi (802.11), WI-MAX (802.16e) etc. to the internet. The slot re-utilization technique proposed so far suffer due to high collision due to improper channel slot usage approximation error. To overcome this here the author propose the cross layer optimization technique by designing a device classification based channel slot re-utilization routing strategy which considers the channel slot and node information from various layers and use some of these parameters to approximate the risk involve in channel slot re-utilization in order to improve the QoS of the network. The simulation and analytical results show the effectiveness of our proposed approach in term of channel slot re-utilization efficiency and thus helps in reducing latency for data transmission and reduce
channel slot collision.
Throughput Maximization using Spatial Reusability in Multi Hop Wireless Networkijtsrd
Energy is a valuable resource in wireless networks. For many multi hop networking scenarios, nodes require power for performing their operation, so requiring capable power management to make certain connectivity across the network. Though when wireless networks are attached outside power source due to obstruction between lively links the network may demand excessive energy per unit time Power due to this the overall performance is reduced. Since network life time or network capacity is depend on the power efficiency, many efforts to study energy efficient networks in the wireless network community. In multi hop wireless networks well organized routing algorithms are significant for network performance. We dispute that by carefully considering spatial reusability of the wireless communication media, we can reduce the overhead in multi hop wireless networks. To support our argument, propose Broadcast Tree Construction BTC and compare them with existing routing and multi path routing protocols, respectively. Our estimate outcome shows that proposed protocols significantly improve the end to end throughput compared with existing protocols. We also introduce the sleep scheduling approach for energy consumption and hybrid cryptography for security of data that can be prevent the data leakage and jammer attacks. Twinkal P. Dudhagawali | Prof. L. K. Gautam | Prof. V. P. Vaidya ""Throughput Maximization using Spatial Reusability in Multi Hop Wireless Network"" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-3 | Issue-3 , April 2019, URL: https://www.ijtsrd.com/papers/ijtsrd23489.pdf
Paper URL: https://www.ijtsrd.com/engineering/information-technology/23489/throughput-maximization-using-spatial-reusability-in-multi-hop-wireless-network/twinkal-p-dudhagawali
Energy Behavior in Ad Hoc Network Minimizing the Number of Hops and Maintaini...CSCJournals
Wireless ad-hoc mesh network is a special kind of network, where all of the nodes move in time. The topology of the network changes as the nodes are in the proximity of each other. Ad-hoc networks are generally self-configuring no stable infrastructure takes a place. In this network, each node should help relaying packets of neighboring nodes using multi-hop routing mechanism. This mechanism is needed to reach far destination nodes to solve problem of dead communication. This multiple traffic "hops" within a wireless mesh network caused dilemma. Wireless mesh network that contain multiple hops become increasingly vulnerable to problems such as energy degradation and rapid increasing of overhead packets. This paper provides a generic routing framework that balances energy efficient broadcast schemes in Wireless (Ad-Hoc) Mesh Network and maintaining connectivity of nodes (mobile terminals). Typically, each node’s activities will consume energy, either for sending packets, receiving or preparing/processing packets. Number of hops, distance of nodes, and size of packet will determine the consumption of energy. The framework is based on the principle that additional relay nodes with appropriate energy and routing metric between source and final destination significantly reduces the energy consumption necessary to deliver packets in Wireless (Ad-Hoc) Mesh Network while keep the connectivity of dynamic nodes. Using the framework, the average network connectivity is kept 18% higher and the lifetime of network lasting more than 2.38% compared with network with Link State Routing mechanism. The simulation notes that the end-to-end delay may increase rapidly if relay nodes are more than five.
International Refereed Journal of Engineering and Science (IRJES)irjes
The core of the vision IRJES is to disseminate new knowledge and technology for the benefit of all, ranging from academic research and professional communities to industry professionals in a range of topics in computer science and engineering. It also provides a place for high-caliber researchers, practitioners and PhD students to present ongoing research and development in these areas.
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
A wireless network consists of a set of wireless nodes forming the network. The bandwidth allocation scheme used in wireless networks should automatically adapt to the network’s environments, where issues such as mobility are highly variable. This paper proposes a method to distribute the bandwidth for wireless network nodes depending on dynamic methodology;this methodology uses intelligent clustering techniques that depend on the student’s distribution at the university campus, rather than the classical allocation methods. We propose a clustering-based approach to solve the dynamic bandwidth allocation problem in wireless networks, enabling wireless nodes to adapt their bandwidth allocation according to the changing number of expected users over time. The proposed solution allows the optimal online bandwidth allocation based on the data extracted from the lectures timetable, and fed to the wireless network control nodes, allowing them to adapt to their environment. The environment data is processed and clustered using the KMeans clustering algorithm to identify potential peak times for every wireless node. The proposed solution feasibility is tested by applying the approach to a case study, at the Arab American University campus wireless network.
Design and implementation of new routingIJCNCJournal
Energy consumption is a key element in the Wireless Sensor Networks (WSNs) design. Indeed, sensor nodes are really constrained by energy supply. Hence, how to improve the network lifetime is a crucial and challenging task. Several techniques are available at different levels of the OSI model to maximize the WSN lifetime and especially at the network layer which uses routing strategies to maintain the routes in the network and guarantee reliable communication. In this paper we intend to propose a new protocol called
Combined Energy and Distance Metrics Dynamic Routing Protocol (CEDM-DR). Our new approach considers not only the distance between wireless sensors but also the energy of node acting as a router in order to find the optimal path and achieve a dynamic and adaptive routing.
The performance metrics exploited for the evaluation of our protocol are average energy consumed, network lifetime and packets lost. By comparing our proposed routing strategy to protocol widely used in WSN namely Ad hoc On demand Distance Vector(AODV), simulation results show that CEDM-DR strategy might effectively balance the sensor power consumption and permits accordingly to enhance the network
lifetime. As well, this new protocol yields a noticeable energy saving compared to its counterpart.
A QoS Based MAC Protocol For Wireless Ad-hoc NetworkIJNSA Journal
Multimedia communication over wireless Ad-hoc networks has become the driving technology for many of the important applications, experiencing dramatic market growth and promising revolutionary experiences in personal communication, gaming, entertainment, military, security, environment monitoring, and more. The advances in wireless communications and growth of real-time applications have necessitated the development of wireless networks that can support high Quality of Service (QoS) and power control. A node in an ad hoc network is normally battery operated which poses a huge constraint on the power consumption of such a node. Hence, designing a power efficient MAC protocol for ad hoc wireless networks is a major challenge. In this paper, we propose a CDMA based power controlled medium access protocol for mobile and ad hoc network (MNA). The protocol conserves power and provides QoS guarantees for multimedia traffics. In that network one of the fundamental challenger in MANETs is how to increase the overall network throughputs well as reading the delay while maintaining how energy consumption for packet processing in communication. simulation results shows that the performance of the protocol with increase in traffic while QoS is better in terms of Energy consumption, throughput, & communication delay than existing protocol.
Wireless Sensor Network Using Six Sigma Multi Hop RoutingIOSR Journals
Abstract: The most significant problem in the design of wireless sensor networks is to coordinate the sensors with dynamism into a wireless communication network and route sensed data to the base station. The energy efficiency is the most important key point of the network routing designing. This paper presents the efficient multi hop routing algorithm to extend the lifetime of sensor networks and focuses by employing six sigma principles to obtain the Quality of Service. To attain QoS support, we have to find either a route to assure the application requirements or offering network response to the application when the requirements cannot be met. Keywords: Wireless Sensor Networks, Multi hop routing, six sigma, QoS
Wireless Sensor Network Using Six Sigma Multi Hop RoutingIOSR Journals
The most significant problem in the design of wireless sensor networks is to coordinate the sensors
with dynamism into a wireless communication network and route sensed data to the base station. The energy
efficiency is the most important key point of the network routing designing. This paper presents the efficient
multi hop routing algorithm to extend the lifetime of sensor networks and focuses by employing six sigma
principles to obtain the Quality of Service. To attain QoS support, we have to find either a route to assure the
application requirements or offering network response to the application when the requirements cannot be met.
A QUALITY OF SERVICE ARCHITECTURE FOR RESOURCE PROVISIONING AND RATE CONTROL ...ijasuc
Prioritized flow control is a type of QoS provisioning in which each class is provided a different QoS by
assigning priority to one class over another in terms of allocating resources. It is an effective means to
provide service differentiation to different class of service in mobile ad hoc networks. So the objective is to
achieve a desired level of service to high-priority flows so that the wireless medium is completely utilized
using adaptive rate control. In this paper, we propose to design QoS architecture for Bandwidth
Management and Rate Control in MANET. Our proposed QoS architecture contains an adaptive
bandwidth management technique which measures the available bandwidth at each node in real-time and
it is then propagated on demand by the QoS routing protocol. The source nodes perform call admission
control for different priority of flows based on the bandwidth information provided by the QoS routing.
The network bandwidth utilization is monitored continuously and network congestion is detected in
advance. Then a rate control mechanism is used to regulate best-effort traffic.
Similar to INTERFERENCE-AWARE CHANNEL ASSIGNMENT FOR MAXIMIZING THROUGHPUT IN WMN (20)
An Optimized Mechanism for Adaptive and Dynamic Policy Based Handover in Clus...pijans
On-going revolution in ever-improving wireless communication enforces the necessity of a self configuring,
rapidly deployable and infrastructure less network. MANET is such an autonomous wireless network that
meets the requirements. At the same time MANET’s random behavior and absence of any central
intelligence to gather unambiguous knowledge about user contexts complexes QoS maintenance and
hampers proper utilization of network resources resulting into unnecessary handovers. In past, few policy
driven handover approaches have been proposed for MANET but none of them explores a comprehensive
policy design. Therefore in this paper we propose an adaptive and optimized policy based handover
mechanism which is based on explicitly designed policies like load balancing, service discovery and next
hop selection .Efficient procedures for these policies are also explored .This work predicts the high time of
handover need on the basis of application specific needs of individual freely roaming mobile nodes,
avoiding unnecessary handovers and provides efficient handover procedure with optimized resource
consumption, reduced latency and interruption time.
An Efficient Routing Protocol for Mobile Ad Hoc Network for Secured Communica...pijans
Security and reliable communication is challenging task in mobile Ad Hoc network. Through mobility of network device compromised with attack and loss of data. For the prevention of attack and reliable communication, various authors proposed a method of secured routing protocol such as SAODV and SBRP (secured backup routing protocol). The process of these methods work along with route discovery and route maintains, discovery and route maintained needed more power consumption for that process. The power of devices is decrease during such process and network lifetimes expire. In this paper, we modified the secured stateless protocol for secured routing and minimized the utilization of power during path discovering and establishment. For the authentication of group node used group signature technique and sleep mode threshold concept for power minimization. Our proposed technique is simulated in ns-2 and compare to other routing protocol gives a better performance in comparison to energy consumption and throughput of network.
As-Puma : Anycast Semantics In Parking Using Metaheuristic Approachpijans
The number of vehicle used in the world are increasing day by day resulting in the obvious problem of
parking of these vehicle’s in residential and vocational areas. We perceive the problem of vehicles parking
in vocational establishments / malls. Today majority of parking systems are manual parking systems where
in, on the spot, parking of the vehicle is done and a parking slip is generated and handed over to customer.
This is cumbersome technique wherein various parking attendants in the parking areas manually keeps on
informing the Parking inspector on how many free parking slots available so that only that many number of
parking slips/tickets are generated as the number of free parking slots. We address the problem of parking
in Delay Tolerant Network (DTN) by proposing metaheuristic driven approach of Ant Colony optimization
(ACO) technique with anycast semantics models . Here we propose the parking architecture to solve the
problem of parking especially in commercial areas with their design diagrams . In this architecture we
apply the delivery model to deliver the packet correctly to the intended receiver. Using this we can book
various parking’s through remote areas so that the customer can get the information about availability of
various parking’s inside an area and the parking fare for each category of the automobile. Using this
architecture the customer can get the prior knowledge about various vacant parking slots inside a parking
area and he can book the corresponding parking from his location.
A Survey of Enhanced Routing Protocols for Manetspijans
Mobile Ad Hoc Networks (MANETs) form a class of dynamic multi-hop networks consisting of a set of
mobile nodes that intercommunicate on shared wireless channels. MANETs are self-organizing and selfconfiguring multi-hop wireless networks, where the network structure changes dynamically due to the node
mobility. There exists no fixed topology due to the mobility of nodes, interference, multipath propagation
and path loss. Hence efficient dynamic routing protocols are required for these networks to function
properly. Many routing protocols have been developed to accomplish this task. In this paper we survey
various new routing protocols that have been developed as extensions or advanced versions of previously
existing routing protocols for MANETs such as DSR, AODV, OLSR etc.
Black Hole Attack Prevention Using Random Dispersive Routing for Mobile Adhoc...pijans
Mobile Adhoc Networks is a wireless network and it has become an important technology in current years
in which security has become an important problem. Black hole Attack is one of the promising and severe
security attacks in mobile ad hoc networks which block the communication of secret data during packet
delivery. Black hole attack directly attacks the node’s data traffic on the path and with intent drops, alters
or delays the data traffic passing through that node. In other type of black hole attack which misleadingly
replies for the route request which comes from the node which initiates the route discovery process that it
has as much as necessary routes to the destination even it does not have path to the destination. This paper
deals with prevention of black hole attacks using Shamir’s secret sharing and Random Multipath Routing
Algorithm
Performance Analysis of Mtpr Routing Protocol in Power Deficient Nodepijans
Power conservation in Mobile Ad hoc Network (MANET) is a major challenge even today for researchers.
To conserve it various power aware routing protocols have been proposed. These protocols do not take into
consideration the residual power left in nodes. To find the impact of the same a simulator was designed in
MATLAB-7.01. The routing protocol used in our simulation is Minimum Total Power Routing (MTPR) and
different performance metrics such as path optimality, throughput and hop count were recorded in
presence and absence of power scarce node. The result shows significant impact of power scarce node on
MANET performance.
Path Duration Analysis in Vehicular Ad Hoc Networkpijans
In Vehicular Ad hoc Networks (VANETs) the mobility of the nodes is the main concern. This mobility of
nodes makes the route unstable and unreliable for the information exchange and communication between
two nodes in the network. To enhance the performance and throughput of the VANETs, routes between
nodes must be reliable and stable. In this paper, we study the significance of path duration and link
duration in Vehicular Ad hoc Networks (VANETs). Because of this mobility, connectivity graphs changes
very frequently and it affects the performance of VANETs. Therefore, path duration can be used to predict
the behaviour of the mobile nodes in the network. Estimation of the path duration in VANETs can be a key
factor to improve the performance of the routing protocol. Estimation of path duration is a challenging task
to perform as it depends on many parameters including node density, transmission range, numbers of hops,
and velocity of nodes. This paper will provide a comprehensive study for estimating the path duration in
VANETs.
Study of Various Schemes for Link Recovery in Wireless Mesh Networkpijans
As there is a growing need for the cost effective and highly dynamic large-bandwidth networks over large
coverage area , the Wireless Mesh Network provide first step towards effective communication. A Wireless
Mesh Network is one of the most advanced wireless network used for communication. During their
operating period , the wireless mesh network may suffer from frequent link failure which results in poor
performance of network. Link failure detection plays crucial role in performance of WMN. The proposed
paper presents the review of various techniques used for detection of link failure and the techniques used
for recovery of wireless mesh network.
A Survey on Security Issues to Detect Wormhole Attack in Wireless Sensor Networkpijans
Sensor nodes, when deployed to form Wireless sensor network operating under control of central authority
i.e. Base station are capable of exhibiting interesting applications due to their ability to be deployed
ubiquitously in hostile & pervasive environments. But due to same reason security is becoming a major
concern for these networks. Wireless sensor networks are vulnerable against various types of external and
internal attacks being limited by computation resources, smaller memory capacity, limited battery life,
processing power & lack of tamper resistant packaging. This survey paper is an attempt to analyze threats
to Wireless sensor networks and to report various research efforts in studying variety of routing attacks
which target the network layer. Particularly devastating attack is Wormhole attack- a Denial of Service
attack, where attackers create a low-latency link between two points in the network. With focus on survey of
existing methods of detecting Wormhole attacks, researchers are in process to identify and demarcate the
key research challenges for detection of Wormhole attacks in network layer.
This document is Intended for the purpose of Enabling the power of social media to Empower Ridesharing.
this entails the creation of an ad-ridesharing Initiative with a view to tackling real-world problems such as
traffic congestion and the ever-increasing fuel prices. The main objectives include creating applications,
both web and mobile based, to seamlessly integrate the app’s functionality into and everyday user’s
routine.
Performance Analysis of Improved Autonomous Power Control Mac Protocol (IAPCM...pijans
Power Control in Mobile Ad Hoc networks is a critical issue, since nodes are powered by batteries.The
main idea of power control schemes is to use different power levels for RTS/CTS and DATA/ACK. These
schemes may degrade network throughput and reduce energy efficiency of the network. In this paper we
have evaluated the performance of Improved Autonomous Power Control MAC Protocol (IAPCMP),that
allows nodes to dynamically adjust power levels for transmission of DATA/ACK according to the distance
between the transmitter and its neighbors.In IAPCMP power level for transmission of RTS/CTS is also
adjustable. This also used maximum power level for transmitting DATA/ACK periodically to make
neighboring nodes aware about ongoing transmission. The performance of IAPCMP is evaluated through
the metrics namely, packet delivery ratio and rate of energy efficiency.The simulation results show
significant improvement in protocol.
A Survey of Using Directional Antennas in Ad Hoc Networkspijans
In this paper, we present a comprehensive overview on Ad hoc networking by directional antennas. Use of
Directional antennas can largely reduce the interference, increase the spatial reuse and due to their longer
range we can have routes with fewer hop for two distant nodes. However the main problem of using
directional antennas in Ad hoc networks is due to the dynamic nature of the network. Neighbour discovery,
maintenance the track of moving neighbours, exploitation of the benefit of long range and directional MAC
protocols are the most challenging issues. We present three Directional MAC protocols and two
combinational protocols and system which give solutions to MAC and Neighbour discovery and compare
the throughput of them with 802.11 with omnidirectional antennas.
Wireless Evolution: IEEE 802.11N, 802.11AC, and 802.11AX Performance Comparisonpijans
The widespread adoption of IEEE 802.11 WLANs is attributed to their inherent mobility, flexibility, and
cost-effectiveness. Within the IEEE 802 working group, a dedicated task group is diligently advancing
WLAN technologies, particularly tailored for dense network scenarios. Amidst these advancements, the
802.11ac protocols have emerged as a preferred choice, delivering superior data transfer rates compared
to the preceding 802.11n standard. Significantly, the sixth-generation wireless protocol, IEEE 802.11ax,
has been introduced, showcasing enhanced performance capabilities that outpace its fifth-generation
predecessor, 802.11ac.In this pioneering investigation, we engage in an in-depth simulation-based scrutiny
of prominentWLAN protocols—namely, IEEE 802.11n, IEEE 802.11ac, and the cutting-edge IEEE
802.11ax. Our exhaustive analyses traverse a spectrum of critical metrics, encompassing throughput,
coverage, spectral efficiency, Tx/Rx gain, and Tx/Rx power.In a single-user and SISO scenario, both
802.11ac and 802.11ax outperform 802.11n. Significantly, 802.11ax surpasses the previous 802.11n/ac
standards, highlighting substantial advancements in wireless performance.
Performance Improvement of Multiple Connections in AODV with the Concern of N...pijans
Mobile Ad-hoc Networks (MANETS) consists of a collection of mobile nodes without having a central
coordination. In MANET, node mobility and dynamic topology play an important role in the performance.
MANET provide a solution for network connection at anywhere and at any time. The major features of
MANET are quick set up, self organization and self maintenance. Routing is a major challenge in MANET
due to it’s dynamic topology and high mobility. Several routing algorithms have been developed for
routing. This paper studies the AODV protocol and how AODV is performed under multiple connections in
the network. Several issues have been identified. The bandwidth is recognized as the prominent factor
reducing the performance of the network. This paper gives an improvement of normal AODV for
simultaneous multiple connections under the consideration of bandwidth of node.
An Efficient Call Admission Control Scheme for Handling Handoffs in Wireless ...pijans
Personal Communication Network (PCN) is an emerging wireless network that promises many new
services for the telecommunication industry. The proliferation of demands for extending wireless services
to integrated services, which supports the transmission of data and multimedia information, has resulted in
the need for broadband wireless systems that are able to provide service capabilities similar to those of
wire line networks. The ATM cell - relay paradigm is one possible approach to provide broadband wireless
transmission with PCN’s using the ATM switching networks for interconnection of PCN cells. As traffic in
these mobile cellular networks increases, Handoffs will become an increasingly important issue. As cell
sizes shrink to accommodate an increasingly large demand of services, newer more efficient handoff
schemes need to be used. In this paper, the authors describe the use of novel and efficient data structure
which dynamically allocates guard channel for handoffs and introduces the concept of channel borrowing
strategy. The proposed scheme allocates the guard channels for handoff requests dynamically, based on the
traffic load for certain time period. A new originating call in the cell coverage area also uses these guard
channels if they are unused. Our basic idea is to allow Guard channels to be shared between new calls and
handoff calls. This approach maximizes the channel utilization. The simulation results prove that the
channel borrowing scheme improves the overall throughput.
Design and Implementation of Low-Cost Electric Vehicles (EVs) Supercharger: A...pijans
This article presents a probabilistic modeling method utilizing smart meter data and an innovative agentbased simulator for electric vehicles (EVs). The aim is to assess the effects of different cost-driven EV charging strategies on the power distribution network (PDN). We investigate the effects of a 40% EV adoption on three parts of Frederiksberg's low voltage distribution network (LVDN), a densely urbanized municipality in Denmark. Our findings indicate that cable and transformer overloading especially pose a challenge. However, the impact of EVs varies significantly between each LVDN area and charging scenario. Across scenarios and LVDNs, the share of cables facing congestion ranges between 5% and 60%. It is also revealed that time-of-use (ToU)-based and single-day cost-minimized charging could be beneficial for LVDNs with moderate EV adoption rates. In contrast, multiple-day optimization will likely lead to severe congestion, as such strategies concentrate demand on a single day that would otherwise be distributed over several days, thus raising concerns about how to prevent it. The broader implications of our research suggest that, despite initial worries primarily centered on congestion due to unregulated charging during peak hours, a transition to cost-based smart charging, propelled by an increasing awareness of time-dependent electricity prices, may lead to a significant rise in charging synchronization, bringing about undesirable consequences for the power distribution network (PDN).
Design and Implementation of Low-Cost Electric Vehicles (EVs) Supercharger: A...pijans
This article presents a probabilistic modeling method utilizing smart meter data and an innovative agentbased simulator for electric vehicles (EVs). The aim is to assess the effects of different cost-driven EV
charging strategies on the power distribution network (PDN). We investigate the effects of a 40% EV
adoption on three parts of Frederiksberg's low voltage distribution network (LVDN), a densely urbanized
municipality in Denmark. Our findings indicate that cable and transformer overloading especially pose a
challenge. However, the impact of EVs varies significantly between each LVDN area and charging
scenario. Across scenarios and LVDNs, the share of cables facing congestion ranges between 5% and
60%. It is also revealed that time-of-use (ToU)-based and single-day cost-minimized charging could be
beneficial for LVDNs with moderate EV adoption rates. In contrast, multiple-day optimization will likely
lead to severe congestion, as such strategies concentrate demand on a single day that would otherwise be
distributed over several days, thus raising concerns about how to prevent it. The broader implications of
our research suggest that, despite initial worries primarily centered on congestion due to unregulated
charging during peak hours, a transition to cost-based smart charging, propelled by an increasing
awareness of time-dependent electricity prices, may lead to a significant rise in charging synchronization,
bringing about undesirable consequences for the power distribution network (PDN).
Multilayer Perceptron Guided Key Generation through Mutation with Recursive R...pijans
In this paper, a multilayer perceptron guided key generation for encryption/decryption (MLPKG) has been
proposed through recursive replacement using mutated character code generation for wireless
communication of data/information. Multilayer perceptron transmitting systems at both ends accept an
identical input vector, generate an output bit and the network are trained based on the output bit which is
used to form a protected variable length secret-key. For each session, different hidden layer of multilayer
neural network is selected randomly and weights or hidden units of this selected hidden layer help to form
a secret session key. The plain text is encrypted using mutated character code table. Intermediate cipher
text is yet again encrypted through recursive replacement technique to from next intermediate encrypted
text which is again encrypted to form the final cipher text through chaining , cascaded xoring of multilayer
perceptron generated session key. If size of the final block of intermediate cipher text is less than the size of
the key then this block is kept unaltered. Receiver will use identical multilayer perceptron generated
session key for performing deciphering process for getting the recursive replacement encrypted cipher text
and then mutated character code table is used for decoding. Parametric tests have been done and results
are compared in terms of Chi-Square test, response time in transmission with some existing classical
techniques, which shows comparable results for the proposed technique.
Performance Analysis of Mobile Adhoc Network Routing Protocols Over Tcppijans
In order to reduce the communication cost and time we are looking forward for successful implementation
of an infrastructure less network like Mobile Ad Hoc Network in all arena of wireless mobile
communication. But still it is a challenge to decide a most appropriate routing protocol for MANET. In
MANET there is no fixed topology due to the mobility of nodes, interference, multipath propagation and
path loss. Since MANET does not use fixed infrastructure rather it always have to find suitable router and
routing path for each communication, existing established routing protocol is not suitable for MANET to
function properly. Different Routing protocols have been proposed to meet the challenges with MANETs.
This paper evaluates the performances of four MANET routing protocols which are DSDV, AODV, DSR
and TORA over TCP, a Transport Layer Protocol. The performance metrics which are considered in this
paper are packet delivery fractions, normalized routing overload, end to end delay and throughput. DSDV
is a proactive protocol and the others are reactive protocols.
Securing Mobile Ad hoc Networks: Key Management and Routingpijans
Secure communication between two nodes in a network depends on reliable key management systems that generate and distribute keys between communicating nodes and a secure routing protocol that establishes a route between them. But due to lack of central server and infrastructure in Mobile Ad hoc Networks (MANETs), this is major problem to manage the keys in the network. Dynamically changes in network’s topology causes weak trust relationship among the nodes in the network. . In MANETs a mobile node operates as not only end terminal but also as an intermediate router. Therefore, a multi-hop scenario occurs for communication in MANETs; where there may be one or more malicious nodes in between source and destination. A routing protocol is said to be secure that detects the detrimental effects of malicious node(s in the path from source to destination). In this paper, we proposed a key management scheme and a secure routing protocol that secures on demand routing protocol such as DSR and AODV. We assume that MANETs is divided into groups having a group leader in each group. Group leader has responsibility of key management in its group. Proposed key management scheme is a decentralized scheme that does not require any Trusted Third Party (TTP) for key management. In proposed key management system, both a new node and group leader authenticates each other mutually before joining the network. While proposed secure routing protocol allows both communicating parties as well as intermediate nodes to authenticate other nodes and maintains message integrity.
About
Indigenized remote control interface card suitable for MAFI system CCR equipment. Compatible for IDM8000 CCR. Backplane mounted serial and TCP/Ethernet communication module for CCR remote access. IDM 8000 CCR remote control on serial and TCP protocol.
• Remote control: Parallel or serial interface.
• Compatible with MAFI CCR system.
• Compatible with IDM8000 CCR.
• Compatible with Backplane mount serial communication.
• Compatible with commercial and Defence aviation CCR system.
• Remote control system for accessing CCR and allied system over serial or TCP.
• Indigenized local Support/presence in India.
• Easy in configuration using DIP switches.
Technical Specifications
Indigenized remote control interface card suitable for MAFI system CCR equipment. Compatible for IDM8000 CCR. Backplane mounted serial and TCP/Ethernet communication module for CCR remote access. IDM 8000 CCR remote control on serial and TCP protocol.
Key Features
Indigenized remote control interface card suitable for MAFI system CCR equipment. Compatible for IDM8000 CCR. Backplane mounted serial and TCP/Ethernet communication module for CCR remote access. IDM 8000 CCR remote control on serial and TCP protocol.
• Remote control: Parallel or serial interface
• Compatible with MAFI CCR system
• Copatiable with IDM8000 CCR
• Compatible with Backplane mount serial communication.
• Compatible with commercial and Defence aviation CCR system.
• Remote control system for accessing CCR and allied system over serial or TCP.
• Indigenized local Support/presence in India.
Application
• Remote control: Parallel or serial interface.
• Compatible with MAFI CCR system.
• Compatible with IDM8000 CCR.
• Compatible with Backplane mount serial communication.
• Compatible with commercial and Defence aviation CCR system.
• Remote control system for accessing CCR and allied system over serial or TCP.
• Indigenized local Support/presence in India.
• Easy in configuration using DIP switches.
Immunizing Image Classifiers Against Localized Adversary Attacksgerogepatton
This paper addresses the vulnerability of deep learning models, particularly convolutional neural networks
(CNN)s, to adversarial attacks and presents a proactive training technique designed to counter them. We
introduce a novel volumization algorithm, which transforms 2D images into 3D volumetric representations.
When combined with 3D convolution and deep curriculum learning optimization (CLO), itsignificantly improves
the immunity of models against localized universal attacks by up to 40%. We evaluate our proposed approach
using contemporary CNN architectures and the modified Canadian Institute for Advanced Research (CIFAR-10
and CIFAR-100) and ImageNet Large Scale Visual Recognition Challenge (ILSVRC12) datasets, showcasing
accuracy improvements over previous techniques. The results indicate that the combination of the volumetric
input and curriculum learning holds significant promise for mitigating adversarial attacks without necessitating
adversary training.
Student information management system project report ii.pdfKamal Acharya
Our project explains about the student management. This project mainly explains the various actions related to student details. This project shows some ease in adding, editing and deleting the student details. It also provides a less time consuming process for viewing, adding, editing and deleting the marks of the students.
Water scarcity is the lack of fresh water resources to meet the standard water demand. There are two type of water scarcity. One is physical. The other is economic water scarcity.
Industrial Training at Shahjalal Fertilizer Company Limited (SFCL)MdTanvirMahtab2
This presentation is about the working procedure of Shahjalal Fertilizer Company Limited (SFCL). A Govt. owned Company of Bangladesh Chemical Industries Corporation under Ministry of Industries.
Saudi Arabia stands as a titan in the global energy landscape, renowned for its abundant oil and gas resources. It's the largest exporter of petroleum and holds some of the world's most significant reserves. Let's delve into the top 10 oil and gas projects shaping Saudi Arabia's energy future in 2024.
Sachpazis:Terzaghi Bearing Capacity Estimation in simple terms with Calculati...Dr.Costas Sachpazis
Terzaghi's soil bearing capacity theory, developed by Karl Terzaghi, is a fundamental principle in geotechnical engineering used to determine the bearing capacity of shallow foundations. This theory provides a method to calculate the ultimate bearing capacity of soil, which is the maximum load per unit area that the soil can support without undergoing shear failure. The Calculation HTML Code included.
Gen AI Study Jams _ For the GDSC Leads in India.pdf
INTERFERENCE-AWARE CHANNEL ASSIGNMENT FOR MAXIMIZING THROUGHPUT IN WMN
1. International Journal on AdHoc Networking Systems (IJANS) Vol. 1, No. 1, July 2011
1
INTERFERENCE-AWARE CHANNEL ASSIGNMENT
FOR MAXIMIZING THROUGHPUT IN WMN
Vinay Kapse and Ms. U.N. Shrawankar
Department of Computer Science and Engineering, G.H. Raisoni College of
Engineering, Nagpur, India
vinaykapse82@gmail.com
urmilas@rediffmail.com
ABSTRACT
Wireless Mesh network (WMN) is dynamically self-organizing and self-configured, with the nodes in the
network automatically establishing an ad-hoc network and maintaining the mesh connectivity. The ability
to use multiple-radios and multiple channels can be cashed to increase aggregate throughput of wireless
mesh network. Thus the efficient use of available interfaces and channels without interference becomes
the key factor. In this paper we propose interference aware clustered based channel assignment schemes
which minimizes the interference and increases throughput. In our proposed scheme we have given
priority to minimize interference from nearby mesh nodes in interference range than maximizing channel
diversity. We simulated our proposed work using NS-3 and results show that our scheme improves
network performance than BFSCA and Distributed Greedy CA.
KEYWORDS
IEEE 802.11s, Channel assignment, Multi-channel, Multi-radio, Channel diversity.
1. INTRODUCTION
Wireless Mesh Network (IEEE 802.11s) are dynamically self-organizing and self-configured,
with the nodes in the network automatically establishing an ad-hoc network and maintaining the
mesh connectivity. The wireless mesh network consists of mesh clients, mesh routers also called
as mesh nodes and mesh gateways. Wireless mesh network has mesh clients such as laptops,
smart phone and other wireless devices. The mesh routers are wireless routers that provide a
routing functionality to and from wireless clients to internet gateways. Mesh routers also
provide reliable, redundant and strong network backbone for providing internet services to mesh
clients. Mesh gateways provide internet and high speed broadband connectivity to mesh clients
through routers. Wireless mesh network have been subject of interest for research communities
and wireless industries due to infrastructure less easy deployment, self organizing and self-
configuring feature applicable in metropolitan areas. Through multi-hop communication, a large
coverage area can be benefited by mesh routers with lower transmission power. Most of the
routers have minimal mobility.
Multi-Channel Multi-Radio communication, fixed mobility model in mesh network diversify
the capabilities of ad-hoc networks. These features bring many advantages to WMNs, such as
low up-front cost, easy network maintenance, robustness, reliable service coverage, etc.
Therefore wireless mesh network is widely accepted in the traditional application scenarios such
2. International Journal on AdHoc Networking Systems (IJANS) Vol. 1, No. 1, July 2011
2
as broadband home networking, community networking, building automation, high speed
metropolitan area networks, and enterprise networking.
Wireless mesh network are similar to in concept with mobile ad hoc network with some
important differences and with less constraints as compared to ad hoc network which can be
exploited. The main difference is that the nodes of WMN are not mobile or with negligible
mobility. These avoid frequent topology changes and link failures. Topology changes are
caused only if new nodes are added or due to node failures or power offing mesh routers for
maintenance purposes. The traffic is always concentrated on the links originating and
terminating to mesh gateways. More over flow characteristics do not change frequently. This
characteristic can be used to optimize network traffic based on previous traffic statistics. All
Mesh clients in wireless mesh network try to gain access to internet. Thus most of the traffic is
directed to and from mesh gateways saturating channels at gateways. So allocating the non
interfering channels at links near gateways can considerably increase network throughput.
The IEEE 802.11s standard is designed to work in compatibility with IEEE 802.11 a/b/g
physical standards. The IEEE 802.11b has 12 overlapping channels (Channel 0..11) and 3 non-
overlapping channels (CH-1, CH-6, CH-11).Where as IEEE 802.11a/g has 12 non-overlapping
channels. These non-overlapping channels can be operated in the 2.4 GHz band in
neighbourhood of each other without causing interference. Interference between the
neighbourhood channels results in increase in end-to-end delay, increase in retransmission and
hence decrease in overall throughput. The use of multiple channels proves to be good effort to
decrease this interference. But the use of multiple channels in a single radio environment can
lead to the considerably large channel switching time among channels and hence a delay in the
transmission. Switching an interface from one channel to another incurs delay. For example,
wireless NICs are currently available that support both IEEE 802.11a and IEEE 802.11b and
can switch between the two bands, However with the currently available hardware, switching
across bands incurs a large delay, but the switching delay is expected to reduce in the future. To
overcome this use of multi-radio NICs are recommended to be used at mesh nodes of mesh
network.
The rest of the paper is structured as follows. In Section II related work is discussed. In Section
III we describe different network model for channel assignment. In Section IV we will show
simulation results and finally we will conclude paper.
2. RELATED WORK
Many approaches were proposed in the past to increase capacity by reducing interference on
wireless links. In one type of these approach, focused on the use of multiple non-overlapping
channels over a single wireless network interface card [4]-[6]. This type of approach requires a
fast and efficient algorithm to switch in between the channel. This approach fails to an
inefficient because of the significant delay generated in switching the channels with the use of
commodity hardware NICs. The delay generated can be of the order of milliseconds. Sometimes
these are higher than the normal packet transmission time. Moreover the use of channel
switching requires changing in MAC layer and hardware.
Subramanian et al [9] designed a centralized channel assignment algorithm in which nodes
listens all available channels on its neighbourhood nodes for which listening node is in
interference range of other nodes and assigns channels which minimizes the interference from
the set of nodes within their interference range. The above approach considers the multi radios,
which does not work when number of interfaces is limited.
3. International Journal on AdHoc Networking Systems (IJANS) Vol. 1, No. 1, July 2011
3
Ramachandaran introduced multi-radio conflict graph model and a centralized CA algorithm
[6]. They extended graph colouring problem to represent channel assignment problem as
colouring the nodes in multi-radio conflict graph. This CA algorithm traverses multi-radio graph
in bread first order and assigns channels in greedy manner and recommends utilization of a
dedicated radio assigned to common channel in order to ensure network connectivity.
Ko et al.[10] propose a distributed channel assignment algorithm where each node can choose
greedily a channel that minimizes its local objective function depending only on local
information. Every node selects a channel that minimizes the sum of interference cost within its
interference range. The advantage of this approach is that channel assignment can be achieved
based on local information among nodes. However they don’t consider number of interface
cards per node.
Naveed [3] proposed cluster based interference aware CA that exploits multiple paths between
mesh router and gateway. This method recommends the use of localized default channel in a
cluster to broadcasting with minimum overhead. Dedicating an interface on each mesh node in
the cluster poses heavy overhead.
Shin et al.[13] showed that finding a channel assignment for optimal performance is NP-hard.
They presented the channel assignment scheme, which uses randomized channel assignment in
a distributed manner while maintaining network connectivity. Channel assignment at NIC is
done randomly.
One solution proposed by [11, 6, 12] reserves one channel as default channel on default NIC
and other channels operating on non-default NIC for mesh connectivity within network. This
ensures network connectivity, at same time increases overhead and delay.
One approach proposed by hyacinth is to assign channels through routing protocol. The protocol
allocates channels in order to maximize channel diversity within flow. But it does not consider
interflow interference during channel assignment.
Other approach is to use multiple radio and multiple channels without the requirement of
channel switching [6-10]. The multiple WNICs allow simultaneous transmission and reception
on different channels. Previous literature shows the use of maximum number of NIC per mesh
router is limited to 3 as installing more than 3 NIC on commodity devices increases the
collision. Therefore in our analysis we have limited the maximum number of NIC to be used per
node to 2.But this approach needs the proper utilization of WNICs and channel assignment
scheme in such a way to reduce interference among neighbouring nodes and maximize the
throughput. This paper does analysis of algorithms and schemes used for channel assignment.
3. PROBLEM FORMULATION
3.1. Wireless mesh network Architecture
Wireless mesh network consist of fixed routers that provide a strong backbone to network to
aggregate traffic and retransmit traffic to mesh gateways which in turn provides access to
internet over a large coverage area. In, turn wireless mesh routing plays a role relaying nodes to
and fro from mesh gateways forming multi-hop wireless mesh network. The gateways are
interface to wired internetworking which contains infrastructure resources such as file servers
and application servers. The link between gateway and the wired network is point-to-point IEEE
802.11 standard or IEEE 802.16.
Each wireless mesh router consists of multiple radios which can be tuned to any of 3 IEEE
802.11b non-overlapping channels or 12 IEEE 802.11a/g non-overlapping channels. For two
4. International Journal on AdHoc Networking Systems (IJANS) Vol. 1, No. 1, July 2011
4
nodes to have successfully communication, the two nodes should be in direct communication
range of each other. Moreover the NICs of two mesh points should be tuned to same frequency.
The two nodes in the interfering range of each other can interfere with each other if they are
tuned to same channel.
3.2. Transmission and Interference Model
Transmission and interference from nearby wireless mesh nodes can be described using two
models. These are protocol model and physical model.
3.2.1. Protocol Model
Let Rt and Ri denote the fixed transmission range and interference of all wireless interfaces
respectively where Rt
Ri > (approximately Ri = 2Rt Rt
Ri 2
= ). Let distance )
,
( v
u represent
the Euclidean distance between two nodes V
v
u ∈
, . For two nodes V
v
u ∈
, direct
communication is only possible if the distance Rt
v
u
d <
)
,
( and at least one of the interfaces of
the nodes operate in same channel. We assume that wireless links are symmetric that is if u can
transmit to v than v can also receive successful transmission from u. Two links )
1
,
1
(
1 v
u
e and
)
2
,
2
(
2 v
u
e interfere with each other if both edges operate on a common channel and any of the
distances )
2
,
1
( u
u
d , )
1
,
1
( v
u
d , )
2
,
1
( u
v
d , )
2
,
1
( v
v
d Ri
≤ .
3.2.2. Physical Model
The transmission is successful if SNRij (Signal to noise ratio) is greater than SNRthres
(threshold) where SNRij denotes the signal-to-noise ratio at node nj for transmission
received from node ni .
3.2.3. Channel Assignment problem formulation
The channel assignment problem is divided into two sub-problems. One is assigning interfaces
to the virtual link between communicating nodes known as neighbour-to-interface binding.
Second is assigning channels to interfaces known as interface-to-channel binding. The channel
should be assigned to virtual link so that its available bandwidth should be proportional to the
load it carries.
The goal of channel assignment is assigning channels to each node from set of non-overlapping
channels such that the sum of loads on interfering link is minimized. The objective is to assign
available interfaces on the nodes with the goal of minimizing the overall network interference
i.e. minimizing interfering links.
CA problem is NP-Hard even with the knowledge of network topology and network traffic. NP-
Hardness was proved by reducing multiple subset problems to CA problem [11]. It is also
shown that minimum edge colouring is subset problem of CA problem [7]. Solution to the CA
problem should address two important issues of wireless mesh networks: Connectivity and
Interference. Connectivity changes in the network topology can cause problems by affecting
network partitions, and affecting paths used by existing flows.
4. PROPOSED CA
We did some simulations on topology design for channel assignment to minimize interference
and maximize throughput by giving priority to reduce interference due to hidden terminal
problem rather than maximizing channel diversity. The simulations were performed for below 3
Topologies.
5. International Journal on AdHoc Networking Systems (IJANS) Vol. 1, No. 1, July 2011
5
We found from simulation results that increasing channel diversity does not affect much to
aggregate throughput of network but minimizing interference considerably increases aggregate
throughput of network.
4.1. Proposed Channel Assignment Scheme
In this section we explain in details of our proposed algorithm and the pseudo code. We propose
a Distributed Channel Assignment scheme. Given a WMN topology graph proposed algorithm
works in three phases. The first phase involves two parts. In the first part calculation of
Euclidean distance between two wirelesses mesh points is calculated. In second part, formation
of clusters takes place. In second phase interface allocation and channel assignment takes place
in greedy fashion. In third phase Channel reassignment takes place considering interference
from nearby nodes operating on same channel.
We say that mesh routers are placed in 3-dimensional space with x, y, z coordinates. The
distance between two nodes will be calculated by Euclidean distance. If the distance Dij
between two mesh nodes is less than the transmission range Xij than two nodes can receive
and transmit data successfully without error and will result in formation of wireless link.
2
)
1
(
2
)
1
(
2
)
1
( z
z
y
y
x
x
Dij −
+
−
+
−
=
Clustering method used in proposed CA is based on the technique proposed by Gonzalez [16].
The algorithm makes uniform r-hop clusters where r is the maximum hop distance from cluster
head. In our implementation we selected r=2 because it represents interference domain size.
A B C D E
F
G
1
6
1
1
6
1
Figure 3. Interference-Aware multi-channel
multi-radio topology design
B C D E
F
G
A
1 6
1
1 6
6
Figure 2. Multi-Radio Multi-Channel
Topology
A B C D E
F
G
1 1 1 1
1
1
Figure 1. Single-Channel Single-Radio
Topology
6. International Journal on AdHoc Networking Systems (IJANS) Vol. 1, No. 1, July 2011
6
Initially clusters are formed by selecting mesh gateways as cluster heads. Each mesh node
selects one of the cluster heads with minimum hop distance as its cluster head.
In the second phase interfaces are allocated to links. The binding is necessary to facilitate
communication over a link by assigning the same channel to both interfaces assigned to link.
The number of NICS required is equal to number of incident links on the mesh nodes. This is
required to preserve connectivity within the network.
The channels are allocated to logical links in an greedy fashion, each type of channel is equally
distributed all over the network. Distinct channels are assigned first to links incident on
gateways. This makes sure that the load is balanced on the different links operating on different
channels. The channels are assigned in way to provide maximum channel diversity.
In the third phase we find out the wireless links that operate in interference range of
each other and operate on same channel. Our algorithm reassigns the channels on links
in a way to minimize interference.
4.1. Pseudo Code
In this subsection we explain proposed algorithm pseudo code. First, we explain the notations
used in our pseudo codes. Let G<V, E> be the set of N nodes and E VxV
⊆ be the set of L
links. Let Vg V
⊆ is the set of gateway nodes. M(u) represent the number of radio interfaces
available on mesh router u V
∈ . Let K be the set of orthogonal channels available in the
network. X represents the set of Clusters in the network.
The abstract pseudo code is as follows.
Procedure ConstructLinks(G)
begin
1. for all V
vi∈ do
2. for all V
vj ∈
3. 2
)
(
2
)
(
2
)
( zj
zi
yj
yi
xj
xi
Dij −
+
−
+
−
=
4. if( Rt
Dij < )
5. Eij
E
E ∪
←
6. End if
A
B C
D
E
F
G
H
I J K
L
Figure 4. Mesh Grid Network and cluster
creation
7. International Journal on AdHoc Networking Systems (IJANS) Vol. 1, No. 1, July 2011
7
7. End for
8. End for
9. End ConstructLinks()
In AllocateInterface() procedure we calculate number of incident links on the mesh nodes. The
mesh nodes are assigned number of NICs equal to number of incident links.
Procedure AllocateInterface(G,E)
begin
1. for all V
vi ∈ do
2. count = 0
3. for all E
ei ∈ do
4. if( )
( ei
V
vi ∈
∃ )
5. count++
6. End if
7. End for
8. )
(count
Cs
allocateNI
vi =
9. End for
10.End AllocateInterface()
In ConstructCluster() one cluster is created per gateway node and gateway node acts as cluster
headline. Mesh nodes joins appropriate cluster head depending on the minimum hop distance
from the cluster head.
Procedure ConstructCluster(G,Vg,HopCount,C)
Begin
1. for all Vg
v∈ do
2. createCluster(Xv)
3. Xv
X
X ∪
←
4. Vg
v
CHID ←
)
(
5. End for
6. for all }
{ Vg
V
v −
∈ do
7. )
(HopCount
opGateway
selectMinH
g ←
8. addClusterMember )
,
( v
Xg
9. CHID g
v ←
)
(
10. End for
11. for all X
x∈ do
12. if )
)
(
( r
x
t
ClusterDis >
13. )
(x
opNode
selectMaxH
v ←
14. )
(v
CHID
i ←
15. )
,
( v
Xi
terMember
removeClus
16. )
,
( Xv
X
ter
createClus
17. Xv
X
X ∪
←
18. v
v
CHID ←
)
(
19. for all }
{ Vg
V
u −
∈ do
20. )
(u
CHID
w ←
21. if )
,
(
)
,
( v
u
HopDist
w
u
HopDist 〉
22. )
,
( u
Xv
terMember
deleteClus
8. International Journal on AdHoc Networking Systems (IJANS) Vol. 1, No. 1, July 2011
8
23. )
,
( u
Xv
Member
addCluster
24. v
u
CHID ←
)
(
25. end if
26. end for
27. end if
28. end for
29. End ConstructCluster()
In second phase of channel assignment links at 3 hop distances is observed. If the links within 3
hop distance interfere with each other than channels are swapped with non-interfering channels.
Thus in second phase we try to eliminate interfering links.
Procedure ChannelReAssignment(G,X,E)
Begin
1. E
Erassign =
2. φ
=
1
Etemp
3. φ
=
2
Etemp
A B C
D
E
F
G
H
I J K
L
1
2
2
3
3
1
1
2
2
3
1
3
1
3
3
1
3
Fig. 7 Channel Assignment at border nodes
A B C
D
E F
G
H
I J K
L
1
2
2
3
3
1
1
2
2
3
1
3
1
Fig 6. Interference-Aware Channel Re-
assignment within cluster
A
B C
D
E F
G
H
I J K L
1
2
3
1
3
2
1
2
3
1
1
3
2
Fig. 5. Channel assignment within
cluster
9. International Journal on AdHoc Networking Systems (IJANS) Vol. 1, No. 1, July 2011
9
4. for all Ereassign
e∈ do
5. if ))
(
( ei
V
vi∈
∃
6. ei
Etemp
Etemp ∪
= 1
1
7. End if
8. for all 1
1 Etemp
e ∈
9. if ))
1
(
1
( i
e
V
i
v ∈
∃
10. i
e
Etemp
Etemp 1
2
2 ∪
=
11. End if
12. End for
13. If )
2
( φ
≠
Etemp
14. )
(ei
getChannel
ci =
15. )
1
(
1 i
e
getChannel
i
c =
16. )
2
(
2 i
e
getChannel
i
c =
17. if )
2
( i
c
ci =
18. )
2
(
2 i
e
nel
selectChan
i
c =
19. End if
20. End if
21. i
e
ei
Erassign
Erassign 2
−
−
=
22. End for
23. End Begin
4. SIMULATION RESULTS
Our proposed work was analyzed using NS-3 Simulator. Mesh network coverage on area 600m
* 600m was established using fixed distribution of mesh router. Each mesh router are equipped
first with four WNIC. The performance metrics will be obtained by averaging the results from
thirty simulation runs for every experiment.
The network model was constructed with a propagation loss model of 50 db for the direct link
between two nodes. The link is symmetric in nature. The distance between to communicating
nodes is set 200m abroad. The propagation loss model of 200 db was assigned as a default loss
model which implicitly means that there is no link between the two nodes or the two nodes are
outside the reception range of each other. The channels used were non-overlapping channels
(CH-34, CH-38 to CH-42) of IEEE 802.11a standard. The mobility of the mesh nodes is set to
constant position mobility model. An UDPSocket were opened at the transmit end that
generated packets of size 200 bytes at a data rate of 10kbps.This ensured the Constant Bit Rate
(CBR) streams saturating the channels. The standard protocol stack containing HWMP for
routing was used for all scenarios. The IEEE 802.11s link layer peer management link protocol
was used. The positions of the mesh nodes are fixed and nodes are having zero mobility. The
delay experienced by the packets to traverse from the transmitter to reception is kept constant.
The maximum queue length at each interface is set to 255 packets. Total number of packets in
queue will be used as a metric to estimate interference.
Simulation was run for 100 seconds. The .pcap files and trace files and flow monitor statistics
was studied for analysis. The use of flow monitor was to collect flow statistics of every flow.
Aggregate throughput of network was calculated as the summation of throughput for individual
flows. The packet loss is calculated as the number of packets lost after time period of 10sec or
dropped by receiving node due to interference, ttl timeout or invalid checksum.
10. International Journal on AdHoc Networking Systems (IJANS) Vol. 1, No. 1, July 2011
10
TABLE I. INPUT PARAMETERS FOR SIMULATION
Parameters Values
Simulation Time 100 Seconds
Simulation Area 600m * 600m
Propogation Model Two-ray Ground Reflection
Transmission range 250 meter, 50db loss model
Traffic Type CBR (UDP)
Packet Size 128,256,1024,2048 bytes
Data Rates 10 kbps
Number of nodes 12
Number of radios 4
Number of connections 17
Link layer max queue length 255
Figure 8. Aggregate Throughput Vs
Packet Size (128,256,1024,2048)
Figure 9. Aggregate Delay Vs Packet
Size
Figure 9. Aggregate Packet loss Vs Packet
size
Figure 10. Aggregate Queue length
Vs packet size
11. International Journal on AdHoc Networking Systems (IJANS) Vol. 1, No. 1, July 2011
11
From simulation results our proposed channel assignment scheme shows increase in throughput
as compared to BFSCA. Initially less packet size results in smaller contention time. As the
packet size increases from 128 bytes to 1024 bytes packets needs large transmission time which
increases the contention time for interference between the flows that makes the property of
collision between simultaneous transmissions becomes high due to many flows use the same
channel to communicate with each other. Results show that our proposed heuristic performs
better than BFSCA and Distributed Greedy Channel Assignment Schemes.
5. CONCLUSION
The Simulation were studied with respect to Aggregate throughput, Aggregate Delay Aggregate
packet loss and Aggregate Queue length experienced by the mesh network when BFSCA,
Greedy Channel Assignment and Our Proposed CA heuristic was operated. The BFSCA
reserves one channel and one radio as an default channel as common to preserve connectivity.
Though this BFSCA does preserve connectivity but one channel and one radio is always
reserved which does not efficiently utilizes available resources. The Greedy channel assignment
scheme selects the channels in greedy way. The less interfering channels are selected for
channel assignment for wireless links. Our proposed channel assignment scheme allocates the
channels that do not interfere with other channels in two hop distances. In doing so some of the
nodes may be operating on one channel and one radio and other nodes may be inactive. This
may lead to inefficient use of available resources in terms of channels and radio at nodes. This
inefficient use is resources in our proposed work is acceptable since use of all channels and
radios may increase interference and decrease throughput.
From the simulated results SNIR of our proposed work is high as compared to BFSCA
and Greedy CA scheme. The average queue length was calculated at each interfaces of each
node. From queue length results it is seen that the total interference experienced by each flow
through our proposed channel assignment scheme is less than BFSCA and Greedy CA scheme.
Aggregate throughput, Packet loss, Aggregate Delay experienced by simulating our proposed
channel assignment scheme is better than BFSCA and Greedy CA.
Figure 11. Flow Id Vs Throughput Figure 12. SNIR vs time
12. International Journal on AdHoc Networking Systems (IJANS) Vol. 1, No. 1, July 2011
12
REFERENCES
[1] G. Eason, Raju, B. Athota, K. Negi, A. ” A Distributed Cluster based Interference-Traffic aware CA
for MRMC WMN” proc. WCSN 2009 IEEE, Allahabad,India.
[2] Sadiq Ali Makram,Mesut Gunes, “Distributed Channel Assignment for Multi-Radio Wireless Mesh
Networks” proc. ISCC 2008 IEEE , on Pages 272-277.
[3] Naveed, A. Kanhere, S.S. , “Cluster-based Channel Assignment in Multi-Radio Multi-Channel
Wireless Mesh Networks” proc. LCN 2009, Rawalpindi,Pakistan.
[4] J. So and N.H. Vaidya, “multi-channel mac for ad-hoc networks : Handling multi-channel hidden
terminals using a single transreceiver”, in proceedings of the ACM symposium on Mobile ad hoc
networking and computing (MOBIHOC) 2004, pp. 223-233.
[5] A. Nasipura, J. Zhang, and S.R Das, “A multichannel csma mac protocol for multihop wireless
networks” in proceedings of IEEE Wireless Communications and Networking Conference (WCNC),
1999.
[6] K. Ramachandran, E. Belding, K. Almeroth, and M. Buddhikot, “Interference-aware channel
assignment in multi-radio wireless mesh networks”, in INFOCOM, 2006.
[7] M.K. Marina and S.R Das., “A topology control approach for utilizing multiple channels in multi-
radio wireless mesh networks”, in proceedings of IEEE BroadNets, Boston, 2005. Pp. 381-390.
[8] A. Das, H. Alazemi, R. Vijayakumar, and S. Roy., “Optimization models for fixed channel
assignment in wireless mesh networks with multiple radios”, in proceedings of IEEE
Communications Society Conference on Sensor, Mesh and Ad-hoc Communication and Networks
(SECON 2007) 2007.
[9] A. P. Subramanian, H. Gupta, and S.R. Das,”Minimum interference channel assignment in multi-
radio wireless mesh network”, in Fourth Annual IEEE communications society conference on sensor,
mesh, and ad-hoc Communications and Networks (SECON 2007).
[10] B.-J.Ko, V.Mishra, J.Padhye, and D.Rubenstein, “Distributed channel assignment for multi-radio
802.11 mesh networks”, Colombia University, Tech. Rep., 2006.
[11] Raniwala K. Gopalan, and T.Cker Chiueh, “A Centralized channel Assignment and Routing
Algorithms for multi channel WMNs”, ACM SIGMOBILE Mobile Computing and Communiacations
Review,2004
[12] saskalli, S. Ghose, S. K. Das, L. Lenzini, and M. Conti, “Channel assignment strategies for multi-
radio wireless mesh networks: issues and solutions”, IEEE Communications Magazine, vol. 45, no.
11, pp. 86-93, 2007.
[13] Minho Shin; Seungjoon Lee; Yoo-ah Kim; “Distributed Channel Assignement for multi-radio
wireless networks” , Mobile adhoc and sensor systems (MASS) 2006 IEEE International conference,
pp.417-426 2006.
[14] Naveed, A. Kanhere, S.S. Jha, S.K. “Topology Control and Channel Assignment in Multi-Radio
Multi-Channel Wireless Mesh Networks”, Mobile Adhoc and Sensor Systems, 2007. MASS 2007.
[15] IEEE Internatonal Conference on 8-11 Oct. 2007, pages 1 – 9, pisa.
[16] Teofilo F. Gonzalez, Clustering to minimize the maximum intercluster distance Theoratical
Computer Science, 38: 293-306,1985.