A wireless network enables people to communicate and access applications and information without wires. This provides freedom of movement and the ability to extend applications to different parts of a building, city, or nearly anywhere in the world. Wireless networks allow people to interact with e-mail or browse the Internet from a location that they prefer. Adhoc Networks are self-organizing wireless networks, absent any fixed infrastructure. broadcasting of data through proper channel is essential. Various protocols are designed to avoid the loss of data. In this paper an overview of different broadcast protocols are discussed.
Advancement in VANET Routing by Optimize the Centrality with ANT Colony Approachijceronline
In a wireless ad hoc network, an opportunistic routing strategy is a strategy where there is no predefined rule for choosing the next node to destination (as it is the case in conventional schemes such as OLSR, DSR or even Geo-Routing). A popular example of opportunistic routing is the “delay tolerant” forwarding to VANET network when a direct path to destination does not exist. Conventional routing in this case would just “drop” the packet. With opportunistic routing, a node acts upon the available information, In this thesis optimize the routing by centrality information then refine by ant colony metaheuristics. In this method validate our approach on different parameter like overhead, throughput.
Jamming aware traffic allocation for multiple-path routing using portfolio se...Saad Bare
Multiple-path source routing protocols allow a data source node to distribute the total traffic among available paths. we consider the problem of jamming-aware source routing in which the source node performs traffic allocation based on empirical jamming statistics at individual network nodes. We formulate this traffic allocation as a lossy network flow optimization problem using portfolio selection theory from financial statistics. We show that in multisource networks, this centralized optimization problem can be solved using a distributed algorithm based on decomposition in network utility maximization (NUM). We demonstrate the network's ability to estimate the impact of jamming and incorporate these estimates into the traffic allocation problem. Finally, we simulate the achievable throughput using our proposed traffic allocation method in several scenarios.
An Opportunistic AODV Routing Scheme : A Cognitive Mobile Agents Approachijasuc
In Manet’s Dynamics and Robustness are the key features of the nodes and are governed by several routing protocols such as AODV, DSR and so on. However in the network the growing resource demand leads to resource scarcity. The Node Mobility often leads to the link breakages and high routing overhead
decreasing the stability and reliability of the network connectivity. In this context, the paper proposes a novel opportunistic AODV routing scheme which implements a cognitive agent based intelligent technique to set up a stable connectivity over the Manet. The Scheme computes the routing metric (rf) based on the collaboration sensitivity levels of the nodes obtained based through the knowledge-based decision. This Routing Metric is subsequently used to set up the stable path for network connectivity. Thus minimizes the route overhead and increases the stability of the path. The Performance evaluation is conducted in comparison with the AODV and sleep AODV routing protocol and validated.
Performance evaluation of data filtering approach in wireless sensor networks...ijmnct
Wireless Sensor Network is a field of research which is viable in every application area like security
services, patient care, traffic regulations, habitat monitoring and so on. The resource limitation of small
sized tiny nodes has always been an issue in wireless sensor networks. Various techniques for improving
network lifetime have been proposed in the past. Now the attention has been shifted towards heterogeneous
networks rather than having homogeneous sensor nodes in a network. The concept of partial mobility has
also been suggested for network longevity. In all the major proposals; clustering and data aggregation in
heterogeneous networks has played an integral role. This paper contributes towards a new concept of
clustering and data filtering in wireless sensor networks. In this paper we have compared voronoi based
ant systems with standard LEACH-C algorithm and MTWSW with TWSW algorithm. Both the techniques
have been applied in heterogeneous wireless sensor networks. This approach is applicable both for critical
as well as for non-critical applications in wireless sensor networks. Both the approaches presented in this
paper outperform LEACH-C and TWSW in terms of energy efficiency and shows promising results for
future work.
BIO-INSPIRED SEAMLESS VERTICAL HANDOVER ALGORITHM FOR VEHICULAR AD HOC NETWORKSijwmn
One of the most important factors to implement VANET is by considering the variety of wireless networks available around the city as well as the vehicles traffic scenarios. However, by providing a diverse range of wireless access technologies, it is necessary to provide continuous network connectivity as well as selecting the most suitable network technology and performance. Many researchers have worked on building algorithms for selecting the best network to improve the handover process. However, with high-speed vehicles mobility, the vertical handover process became the most challenging task in order to achieve realtime network selection. This paper proposes a bio-inspired network selection algorithm influenced by insect's behaviour which combines Artificial Bee Colony (ABC) and Particle Swarm Optimization (PSO). The proposed algorithm is applied to process multi-criteria parameters to evaluate the best available network and then execute the handover process seamlessly. The results demonstrate the benefits of the proposed Multi-Criteria ABC-PSO method by reducing the handover decision delays by 25%. It gives the optimum performance in terms of network selections and reduces the handover latency by 14.5%. The proposed algorithm also reduces the number of unnecessary handovers by 48% for three different mobility scenarios based on traffic environments (highway, urban and traffic jam).
ENERGY-EFFICIENT MULTI-HOP ROUTING WITH UNEQUAL CLUSTERING APPROACH FOR WIREL...IJCNCJournal
The development of an energy-efficient routing protocol, capable of extending the life of the network, is one of the main constraints of wireless sensor networks (WSN). Research studies on WSN routing prove that clustering offers an effective approach to prolong the lifetime of a WSN, particularly when it is combined with multi-hop communication that can reduces energy costs by minimizing the distance between transmitter and receiver. Most clustering algorithms using multi-hop in data transmission encounter the hotspot problem. In this work, an Energy-efficient Multi-hop routing with Unequal Clustering approach (EMUC) is proposed, to create clusters of different sizes, which depend on the distance between the sensor node and the base station. Equilibrate the energy dissipation between the cluster heads is the purpose of this approach by adopting multi-hop communication to relay data to the base station. The implementation of multi-hop mode to transmit data to the base station reduces the energy cost of transmission over long distances. The effectiveness of this approach is validated through performed simulations, which prove that EMUC balances energy consumption between sensor nodes, mitigates the hotspots problem, saves more energy and significantly extends the network lifetime.
Advancement in VANET Routing by Optimize the Centrality with ANT Colony Approachijceronline
In a wireless ad hoc network, an opportunistic routing strategy is a strategy where there is no predefined rule for choosing the next node to destination (as it is the case in conventional schemes such as OLSR, DSR or even Geo-Routing). A popular example of opportunistic routing is the “delay tolerant” forwarding to VANET network when a direct path to destination does not exist. Conventional routing in this case would just “drop” the packet. With opportunistic routing, a node acts upon the available information, In this thesis optimize the routing by centrality information then refine by ant colony metaheuristics. In this method validate our approach on different parameter like overhead, throughput.
Jamming aware traffic allocation for multiple-path routing using portfolio se...Saad Bare
Multiple-path source routing protocols allow a data source node to distribute the total traffic among available paths. we consider the problem of jamming-aware source routing in which the source node performs traffic allocation based on empirical jamming statistics at individual network nodes. We formulate this traffic allocation as a lossy network flow optimization problem using portfolio selection theory from financial statistics. We show that in multisource networks, this centralized optimization problem can be solved using a distributed algorithm based on decomposition in network utility maximization (NUM). We demonstrate the network's ability to estimate the impact of jamming and incorporate these estimates into the traffic allocation problem. Finally, we simulate the achievable throughput using our proposed traffic allocation method in several scenarios.
An Opportunistic AODV Routing Scheme : A Cognitive Mobile Agents Approachijasuc
In Manet’s Dynamics and Robustness are the key features of the nodes and are governed by several routing protocols such as AODV, DSR and so on. However in the network the growing resource demand leads to resource scarcity. The Node Mobility often leads to the link breakages and high routing overhead
decreasing the stability and reliability of the network connectivity. In this context, the paper proposes a novel opportunistic AODV routing scheme which implements a cognitive agent based intelligent technique to set up a stable connectivity over the Manet. The Scheme computes the routing metric (rf) based on the collaboration sensitivity levels of the nodes obtained based through the knowledge-based decision. This Routing Metric is subsequently used to set up the stable path for network connectivity. Thus minimizes the route overhead and increases the stability of the path. The Performance evaluation is conducted in comparison with the AODV and sleep AODV routing protocol and validated.
Performance evaluation of data filtering approach in wireless sensor networks...ijmnct
Wireless Sensor Network is a field of research which is viable in every application area like security
services, patient care, traffic regulations, habitat monitoring and so on. The resource limitation of small
sized tiny nodes has always been an issue in wireless sensor networks. Various techniques for improving
network lifetime have been proposed in the past. Now the attention has been shifted towards heterogeneous
networks rather than having homogeneous sensor nodes in a network. The concept of partial mobility has
also been suggested for network longevity. In all the major proposals; clustering and data aggregation in
heterogeneous networks has played an integral role. This paper contributes towards a new concept of
clustering and data filtering in wireless sensor networks. In this paper we have compared voronoi based
ant systems with standard LEACH-C algorithm and MTWSW with TWSW algorithm. Both the techniques
have been applied in heterogeneous wireless sensor networks. This approach is applicable both for critical
as well as for non-critical applications in wireless sensor networks. Both the approaches presented in this
paper outperform LEACH-C and TWSW in terms of energy efficiency and shows promising results for
future work.
BIO-INSPIRED SEAMLESS VERTICAL HANDOVER ALGORITHM FOR VEHICULAR AD HOC NETWORKSijwmn
One of the most important factors to implement VANET is by considering the variety of wireless networks available around the city as well as the vehicles traffic scenarios. However, by providing a diverse range of wireless access technologies, it is necessary to provide continuous network connectivity as well as selecting the most suitable network technology and performance. Many researchers have worked on building algorithms for selecting the best network to improve the handover process. However, with high-speed vehicles mobility, the vertical handover process became the most challenging task in order to achieve realtime network selection. This paper proposes a bio-inspired network selection algorithm influenced by insect's behaviour which combines Artificial Bee Colony (ABC) and Particle Swarm Optimization (PSO). The proposed algorithm is applied to process multi-criteria parameters to evaluate the best available network and then execute the handover process seamlessly. The results demonstrate the benefits of the proposed Multi-Criteria ABC-PSO method by reducing the handover decision delays by 25%. It gives the optimum performance in terms of network selections and reduces the handover latency by 14.5%. The proposed algorithm also reduces the number of unnecessary handovers by 48% for three different mobility scenarios based on traffic environments (highway, urban and traffic jam).
ENERGY-EFFICIENT MULTI-HOP ROUTING WITH UNEQUAL CLUSTERING APPROACH FOR WIREL...IJCNCJournal
The development of an energy-efficient routing protocol, capable of extending the life of the network, is one of the main constraints of wireless sensor networks (WSN). Research studies on WSN routing prove that clustering offers an effective approach to prolong the lifetime of a WSN, particularly when it is combined with multi-hop communication that can reduces energy costs by minimizing the distance between transmitter and receiver. Most clustering algorithms using multi-hop in data transmission encounter the hotspot problem. In this work, an Energy-efficient Multi-hop routing with Unequal Clustering approach (EMUC) is proposed, to create clusters of different sizes, which depend on the distance between the sensor node and the base station. Equilibrate the energy dissipation between the cluster heads is the purpose of this approach by adopting multi-hop communication to relay data to the base station. The implementation of multi-hop mode to transmit data to the base station reduces the energy cost of transmission over long distances. The effectiveness of this approach is validated through performed simulations, which prove that EMUC balances energy consumption between sensor nodes, mitigates the hotspots problem, saves more energy and significantly extends the network lifetime.
Traffic Congestion Prediction using Deep Reinforcement Learning in Vehicular ...IJCNCJournal
In recent years, a new wireless network called vehicular ad-hoc network (VANET), has become a popular research topic. VANET allows communication among vehicles and with roadside units by providing information to each other, such as vehicle velocity, location and direction. In general, when many vehicles likely to use the common route to proceed to the same destination, it can lead to a congested route that should be avoided. It may be better if vehicles are able to predict accurately the traffic congestion and then avoid it. Therefore, in this work, the deep reinforcement learning in VANET to enhance the ability to predict traffic congestion on the roads is proposed. Furthermore, different types of neural networks namely Convolutional Neural Network (CNN), Multilayer Perceptron (MLP) and Long Short-Term Memory (LSTM) are investigated and compared in this deep reinforcement learning model to discover the most effective one. Our proposed method is tested by simulation. The traffic scenarios are created using traffic simulator called Simulation of Urban Mobility (SUMO) before integrating with deep reinforcement learning model. The simulation procedures, as well as the programming used, are described in detail. The performance of our proposed method is evaluated using two metrics; the average travelling time delay and average waiting time delay of vehicles. According to the simulation results, the average travelling time delay and average waiting time delay are gradually improved over the multiple runs, since our proposed method receives feedback from the environment. In addition, the results without and with three different deep learning algorithms, i.e., CNN, MLP and LSTM are compared. It is obvious that the deep reinforcement learning model works effectively when traffic density is neither too high nor too low. In addition, it can be concluded that the effective algorithms for traffic congestion prediction models in descending order are MLP, CNN, and LSTM, respectively.
Vehicles Awake Routing Protocol with Analysis Determine Knowledge Perception ...ijtsrd
The Vehicular Ad-hoc Networks VANET ascents as an surface technology for smart transport as observed in the latter date decennary.The routing is the important element for keeping effectual communication between smart vehicles, which need to be entreated snappily. A traffic-aware routing protocol TARCO that considers integrated real-time traffic conditions for integrating delivery paths over a vehicular environs is presented. Routing in VANETs plays 0 crucial role in production of networks.VANET protocols are classified as topology based and position based concordat. Device-to-device D2D communication is admired as a propitious technique as granting the reliable integration between vehicles. The D2D-based vehicle-to-vehicle communication links coincide by recycling the similar sequence property, solution in a more intricate Combat scenario. Thus the access mode switch and resource allocation between cellular and VANETs become a challenging issue. Each road segment was then assigned a weight according to the overall view of the traffic conditions and updated systematically to reflect traffic variations. Finally, the road segments providing operative and dependable data paths were used to frame a routing path with latched connectivity and a short distribution lag to the destination. Simulation results showed that the use of TARCO leads to high network performance in terms of the packet delivery ratio, end-to-end delay and communication upward. Mr. P. Senthil | Mrs. A. Jayanthi | R. Shobana "Vehicles Awake Routing Protocol with Analysis Determine Knowledge Perception for VANET" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Special Issue | Active Galaxy , June 2018, URL: http://www.ijtsrd.com/papers/ijtsrd14569.pdf
http://www.ijtsrd.com/engineering/computer-engineering/14569/vehicles-awake-routing-protocol-with-analysis-determine-knowledge-perception-for-vanet/mr-p-senthil
A vertical handover decision approaches in next generation wireless networks ...ijmnct
In next generation wireless network the most desirable feature is its ability to move seamlessly over various
access network regardless of the network infrastructure is used. The handover between these dissimilar
networks can be explored by using vertical handover algorithms. This paper focuses on the vertical
handover decision methods and algorithms effectiveness. Most of the algorithms which are based on RSS
values provide vertical handover with small delay at a lower rate of throughput. There are such algorithms
which provide significant improvements in throughput but at a cost of higher delays. As per the need for the
real time applications in next generation wireless networks there is a requirement of developing new
optimized algorithms that are able to produce high throughput and minimizing signalling cost and delay.
Interpolation Techniques for Building a Continuous Map from Discrete Wireless...M H
Wireless sensor networks (WSNs) typically gather data at a discrete number of locations. However, it is desirable to be able to design applications and reason about the data in more abstract forms than in points of data. By bestowing the ability to predict inter-node values upon the network, it is proposed that it will become possible to build applications that are unaware of the concrete reality of sparse data. This interpolation capability is realised as a service of the network. In this paper, the ‘map’ style of presentation has been identified as a suitable sense data visualisation format. Although map generation is essentially a problem of interpolation between points, a new WSN service, called the map generation service, which is based on a Shepard interpolation method, is presented. A modified Shepard method that aims to deal with the special characteristics of WSNs is proposed. It requires small storage, can be localised and integrates the information about the application domain to further reduce the map generation cost and improve the mapping accuracy. Flood management application is considered to demonstrate how MGS-generated maps can be used in various applications. Empirical analysis has shown that the map generation service is an accurate, a flexible and an efficient method.
An Efficient Approach for Data Gathering and Sharing with Inter Node Communi...cscpconf
In today’s era Wireless sensor networks (WSNs) have emerged as a solution for a wide range of
applications. Most of the traditional WSN architectures consist of static nodes which are densely deployed
over a sensing area. Recently, several WSN architectures based on mobile elements (MEs) have been
proposed. Most of them exploit mobility to address the problem of data collection in WSNs. The common
drawback among them is to data sharing between interconnected nodes. In this paper we propose an
Efficient Approach for Data Gathering and Sharing with Inter Node Communication in Mobile-Sink. Our
algorithm is divided into seven parts: Registration Phase, Authentication Phase, Request and Reply Phase,
Setup Phase, Setup Phase (NN), Data Gathering, and Forwarding to Sink. Our approach provides an
efficient way to handle data in between the intercommunication nodes. By the above approach we can
access the data from the node which is not in the list, by sharing the data from the node which is
approachable to the desired node. For accessing and sharing we need some security so that the data can
be shared between authenticated nodes. For this we use two way security approach one for the accessing
node and other for the sharing.
An Overview of Information Extraction from Mobile Wireless Sensor NetworksM H
Information Extraction (IE) is a key research area within the field of Wireless Sensor Networks (WSNs). It has been characterised in a variety of ways, ranging from the description of its purposes, to reasonably abstract models of its processes and components. There has been only a handful of papers addressing IE over mobile WSNs directly, these dealt with individual mobility related problems as the need arises. This paper is presented as a tutorial that takes the reader from the point of identifying data about a dynamic (mobile) real world problem, relating the data back to the world from which it was collected, and finally discovering what is in the data. It covers the entire process with special emphasis on how to exploit mobility in maximising information return from a mobile WSN. We present some challenges introduced by mobility on the IE process as well as its effects on the quality of the extracted information. Finally, we identify future research directions facing the development of efficient IE approaches for WSNs in the presence of mobility.
Energy- Aware QoS Based Routing Protocols for Heterogeneous WSNs: A Survey ...............................1
Sridevi S., Rumeniya G. and Usha M.
Optimization of Outsourcing ICT Projects in Public Organizations; Case Study: Public Center of Iranian
ICT Studies ................................................................................................................................................. 20
Majid Nili Ahmadabadi, Abbas Bagheri and Fariba Abolghasemi
An Optimized CBIR Using Particle Swarm Optimization Algorithm ......................................................... 40
Subhakala S., Bhuvana S. and Radhakrishnan R.
Study of Satisfaction Assessment Techniques for Textual Requirements .............................................. 56
K. S. Divya, R. Subha and Dr. S. Palaniswami
Survey of MAC Protocols for Heterogeneous Traffic in Wireless Sensor Networks ............................... 67
Sridevi S., Priyadharshini R. and Usha M.
Harnessing Social Media for Business Success. Case Study of Zimbabwe ............................................... 80
Musungwini Samuel, Zhou Tinashe Gwendolyn, Zhou Munyaradzi and Ruvinga Caroline
Quality Platforms for Innovation and Breakthrough................................................................................ 90
Dr. Hima Gupta
Development of Virtual Experiment on Waveform Conversion Using Virtual Intelligent SoftLab ...... 107
Bhaskar Y. Kathane
Map as a Service: A Framework for Visualising and Maximising Information Retu...M H
This paper presents a distributed information extraction and visualisation service, called the mapping service, for maximising information return from large-scale wireless sensor networks. Such a service would greatly simplify the production of higher-level, information-rich, representations suitable for informing other network services and the delivery of field information visualisations. The mapping service utilises a blend of inductive and deductive models to map sense data accurately using externally available knowledge. It utilises the special characteristics of the application domain to render visualisations in a map format that are a precise reflection of the concrete reality. This service is suitable for visualising an arbitrary number of sense modalities. It is capable of visualising from multiple independent types of the sense data to overcome the limitations of generating visualisations from a single type of sense modality. Furthermore, the mapping service responds dynamically to changes in the environmental conditions, which may affect the visualisation performance by continuously updating the application domain model in a distributed manner. Finally, a distributed self-adaptation function is proposed with the goal of saving more power and generating more accurate data visualisation. We conduct comprehensive experimentation to evaluate the performance of our mapping service and show that it achieves low communication overhead, produces maps of high fidelity, and further minimises the mapping predictive error dynamically through integrating the application domain model in the mapping service.
A Fast Convergence and Quick Route Updates Based Energy Aware Tree-Based Rout...iosrjce
IOSR Journal of Computer Engineering (IOSR-JCE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of computer engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in computer technology. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
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
International Journal of Engineering Research and Development (IJERD)IJERD Editor
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals,
yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal
Algorithmic Construction of Optimal and Load Balanced Clusters in Wireless Se...M H
This paper proposes a clustering algorithm - Ba-lanced Minimum Radius Clustering (BMRC) - for use in large scale, distributed Wireless Sensor Networks (WSN). Cluster balancing is an intractable problem to solve in a distributed manner, and distribution is important, by reason of both avoiding specialised node vulnerability and minimising message overhead.The BMRC algorithm described here distributes several of the cluster balancing functions to the cluster-heads. In proposing this algorithm, several tentative claims have been made for it, namely that it is suitable for arbitrary number of cluster heads; that its pecifies a way to elect cluster heads and use them to create the local models; that it accomplishes optimal balanced clusters in distributed manner; that it is scalable and it uses the number-of-hops as a clustering parameter; that it is energy efficient. These claims were studied and verified by simulation.
SHADOWING EFFECTS ON ROUTING PROTOCOL OF MULTIHOP AD HOC NETWORKSijasuc
Two-ray ground reflection model has been widely used as the propagation model to investigate the
performance of an ad hoc network. But two-ray model is too simple to represent a real world network. A
more realistic model namely shadowing propagation model has been used in this investigation. Under
shadowing propagation model, a mobile node may receive a packet at a signal level that is below a
required threshold level. This low signal level affects the routing protocol as well as the medium access
control protocol of a network. An analytical model has been presented in this paper to investigate the
shadowing effects on the network performance. The analytical model has been verified via simulation
results. Simulation results show that the performance of a network becomes very poor if shadowing
propagation model is used in compare to the simple two-ray model. Two solutions have also been proposed
in this paper to overcome the effects of shadowing. One solution is a physical layer solution and the other
one is a Medium Access Control (MAC) layer solution. Simulation results show that these two solutions
reduce the shadowing effect and improve network performance.
A Framework for Improving the Performance of MANET by Controlling Data Traffi...rahulmonikasharma
A mobile ad-hoc network is a category of wireless network which does not depend on a predefined network structure or topology. Ad hoc networks require no centralized administration or fixed network infrastructure such as base stations or access points, and can be quickly and inexpensively set up as needed. Two mobile nodes can exchange data directly if they are in the defined range of each other. If not, nodes can communicate via a multi-hop route with the help of other mobile nodes. This paper proposed an approach to improve data transmission by reducing the data traffic and it also increase data availability in the mobile ad-hoc network. In the proposed approach, MANET is server client based network, means a mobile host acts as a server and fulfill the others node’s request. Each mobile node has a buffer for temporarily storing data fragment for a specific time, If a mobile node requests for a particular data fragment and the request is multi hoped, then first request is sent to its neighbor node, neighbor node first match requested data fragment with stored data, if it is matched the request will be responded by this neighbor otherwise request will be routed to mobile server. In this way the overhead of the server and server traffic will be reduced. The proposed method reduces time consumed by data fetching directly from server routing through multiple nodes and thus, it also enhances data availability.
Designing an opportunistic routing scheme for adaptive clustering in mobile a...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
Designing an opportunistic routing scheme for adaptive clustering in mobile a...eSAT Journals
Abstract Mobile networks have received great deal of attention during last few decades due to their potential applications such as large scale, improved flexibility and reduced costs. This proposed work addresses two problems associated with mobile network such as method to reduce overhead between the nodes, and energy balanced routing of packets by Co-Operative opportunistic routing for cluster based communication. We propose a modified algorithm that uses On-Demand Opportunistic Group mobility based clustering (ODOGMBC) for forming the cluster and predicting the cluster mobility by neighbourhood update algorithm. Cluster formation involves election of a mobile node as Cluster head. Each cluster comprises of cluster head and non-cluster head node that forms a cluster dynamically. Each node in the network continuously finds it neighbour by communicating with them, and nodes have consistent updated routing information in route cache by neighbourhood update algorithm. In routing process packet forwarded by the source node is updated by intermediate forwarder if topology undergo changes. This opportunistic routing scheme provides responsive data transportation and managing the node effectively, even in heavily loaded environment. Thus, our proposed routing technique helps us to reduce overhead, increases efficiency and better control of path selection. Keywords- Clustering, Forwarder, MANET, Prediction, Reactive, opportunistic routing.
Traffic Congestion Prediction using Deep Reinforcement Learning in Vehicular ...IJCNCJournal
In recent years, a new wireless network called vehicular ad-hoc network (VANET), has become a popular research topic. VANET allows communication among vehicles and with roadside units by providing information to each other, such as vehicle velocity, location and direction. In general, when many vehicles likely to use the common route to proceed to the same destination, it can lead to a congested route that should be avoided. It may be better if vehicles are able to predict accurately the traffic congestion and then avoid it. Therefore, in this work, the deep reinforcement learning in VANET to enhance the ability to predict traffic congestion on the roads is proposed. Furthermore, different types of neural networks namely Convolutional Neural Network (CNN), Multilayer Perceptron (MLP) and Long Short-Term Memory (LSTM) are investigated and compared in this deep reinforcement learning model to discover the most effective one. Our proposed method is tested by simulation. The traffic scenarios are created using traffic simulator called Simulation of Urban Mobility (SUMO) before integrating with deep reinforcement learning model. The simulation procedures, as well as the programming used, are described in detail. The performance of our proposed method is evaluated using two metrics; the average travelling time delay and average waiting time delay of vehicles. According to the simulation results, the average travelling time delay and average waiting time delay are gradually improved over the multiple runs, since our proposed method receives feedback from the environment. In addition, the results without and with three different deep learning algorithms, i.e., CNN, MLP and LSTM are compared. It is obvious that the deep reinforcement learning model works effectively when traffic density is neither too high nor too low. In addition, it can be concluded that the effective algorithms for traffic congestion prediction models in descending order are MLP, CNN, and LSTM, respectively.
Vehicles Awake Routing Protocol with Analysis Determine Knowledge Perception ...ijtsrd
The Vehicular Ad-hoc Networks VANET ascents as an surface technology for smart transport as observed in the latter date decennary.The routing is the important element for keeping effectual communication between smart vehicles, which need to be entreated snappily. A traffic-aware routing protocol TARCO that considers integrated real-time traffic conditions for integrating delivery paths over a vehicular environs is presented. Routing in VANETs plays 0 crucial role in production of networks.VANET protocols are classified as topology based and position based concordat. Device-to-device D2D communication is admired as a propitious technique as granting the reliable integration between vehicles. The D2D-based vehicle-to-vehicle communication links coincide by recycling the similar sequence property, solution in a more intricate Combat scenario. Thus the access mode switch and resource allocation between cellular and VANETs become a challenging issue. Each road segment was then assigned a weight according to the overall view of the traffic conditions and updated systematically to reflect traffic variations. Finally, the road segments providing operative and dependable data paths were used to frame a routing path with latched connectivity and a short distribution lag to the destination. Simulation results showed that the use of TARCO leads to high network performance in terms of the packet delivery ratio, end-to-end delay and communication upward. Mr. P. Senthil | Mrs. A. Jayanthi | R. Shobana "Vehicles Awake Routing Protocol with Analysis Determine Knowledge Perception for VANET" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Special Issue | Active Galaxy , June 2018, URL: http://www.ijtsrd.com/papers/ijtsrd14569.pdf
http://www.ijtsrd.com/engineering/computer-engineering/14569/vehicles-awake-routing-protocol-with-analysis-determine-knowledge-perception-for-vanet/mr-p-senthil
A vertical handover decision approaches in next generation wireless networks ...ijmnct
In next generation wireless network the most desirable feature is its ability to move seamlessly over various
access network regardless of the network infrastructure is used. The handover between these dissimilar
networks can be explored by using vertical handover algorithms. This paper focuses on the vertical
handover decision methods and algorithms effectiveness. Most of the algorithms which are based on RSS
values provide vertical handover with small delay at a lower rate of throughput. There are such algorithms
which provide significant improvements in throughput but at a cost of higher delays. As per the need for the
real time applications in next generation wireless networks there is a requirement of developing new
optimized algorithms that are able to produce high throughput and minimizing signalling cost and delay.
Interpolation Techniques for Building a Continuous Map from Discrete Wireless...M H
Wireless sensor networks (WSNs) typically gather data at a discrete number of locations. However, it is desirable to be able to design applications and reason about the data in more abstract forms than in points of data. By bestowing the ability to predict inter-node values upon the network, it is proposed that it will become possible to build applications that are unaware of the concrete reality of sparse data. This interpolation capability is realised as a service of the network. In this paper, the ‘map’ style of presentation has been identified as a suitable sense data visualisation format. Although map generation is essentially a problem of interpolation between points, a new WSN service, called the map generation service, which is based on a Shepard interpolation method, is presented. A modified Shepard method that aims to deal with the special characteristics of WSNs is proposed. It requires small storage, can be localised and integrates the information about the application domain to further reduce the map generation cost and improve the mapping accuracy. Flood management application is considered to demonstrate how MGS-generated maps can be used in various applications. Empirical analysis has shown that the map generation service is an accurate, a flexible and an efficient method.
An Efficient Approach for Data Gathering and Sharing with Inter Node Communi...cscpconf
In today’s era Wireless sensor networks (WSNs) have emerged as a solution for a wide range of
applications. Most of the traditional WSN architectures consist of static nodes which are densely deployed
over a sensing area. Recently, several WSN architectures based on mobile elements (MEs) have been
proposed. Most of them exploit mobility to address the problem of data collection in WSNs. The common
drawback among them is to data sharing between interconnected nodes. In this paper we propose an
Efficient Approach for Data Gathering and Sharing with Inter Node Communication in Mobile-Sink. Our
algorithm is divided into seven parts: Registration Phase, Authentication Phase, Request and Reply Phase,
Setup Phase, Setup Phase (NN), Data Gathering, and Forwarding to Sink. Our approach provides an
efficient way to handle data in between the intercommunication nodes. By the above approach we can
access the data from the node which is not in the list, by sharing the data from the node which is
approachable to the desired node. For accessing and sharing we need some security so that the data can
be shared between authenticated nodes. For this we use two way security approach one for the accessing
node and other for the sharing.
An Overview of Information Extraction from Mobile Wireless Sensor NetworksM H
Information Extraction (IE) is a key research area within the field of Wireless Sensor Networks (WSNs). It has been characterised in a variety of ways, ranging from the description of its purposes, to reasonably abstract models of its processes and components. There has been only a handful of papers addressing IE over mobile WSNs directly, these dealt with individual mobility related problems as the need arises. This paper is presented as a tutorial that takes the reader from the point of identifying data about a dynamic (mobile) real world problem, relating the data back to the world from which it was collected, and finally discovering what is in the data. It covers the entire process with special emphasis on how to exploit mobility in maximising information return from a mobile WSN. We present some challenges introduced by mobility on the IE process as well as its effects on the quality of the extracted information. Finally, we identify future research directions facing the development of efficient IE approaches for WSNs in the presence of mobility.
Energy- Aware QoS Based Routing Protocols for Heterogeneous WSNs: A Survey ...............................1
Sridevi S., Rumeniya G. and Usha M.
Optimization of Outsourcing ICT Projects in Public Organizations; Case Study: Public Center of Iranian
ICT Studies ................................................................................................................................................. 20
Majid Nili Ahmadabadi, Abbas Bagheri and Fariba Abolghasemi
An Optimized CBIR Using Particle Swarm Optimization Algorithm ......................................................... 40
Subhakala S., Bhuvana S. and Radhakrishnan R.
Study of Satisfaction Assessment Techniques for Textual Requirements .............................................. 56
K. S. Divya, R. Subha and Dr. S. Palaniswami
Survey of MAC Protocols for Heterogeneous Traffic in Wireless Sensor Networks ............................... 67
Sridevi S., Priyadharshini R. and Usha M.
Harnessing Social Media for Business Success. Case Study of Zimbabwe ............................................... 80
Musungwini Samuel, Zhou Tinashe Gwendolyn, Zhou Munyaradzi and Ruvinga Caroline
Quality Platforms for Innovation and Breakthrough................................................................................ 90
Dr. Hima Gupta
Development of Virtual Experiment on Waveform Conversion Using Virtual Intelligent SoftLab ...... 107
Bhaskar Y. Kathane
Map as a Service: A Framework for Visualising and Maximising Information Retu...M H
This paper presents a distributed information extraction and visualisation service, called the mapping service, for maximising information return from large-scale wireless sensor networks. Such a service would greatly simplify the production of higher-level, information-rich, representations suitable for informing other network services and the delivery of field information visualisations. The mapping service utilises a blend of inductive and deductive models to map sense data accurately using externally available knowledge. It utilises the special characteristics of the application domain to render visualisations in a map format that are a precise reflection of the concrete reality. This service is suitable for visualising an arbitrary number of sense modalities. It is capable of visualising from multiple independent types of the sense data to overcome the limitations of generating visualisations from a single type of sense modality. Furthermore, the mapping service responds dynamically to changes in the environmental conditions, which may affect the visualisation performance by continuously updating the application domain model in a distributed manner. Finally, a distributed self-adaptation function is proposed with the goal of saving more power and generating more accurate data visualisation. We conduct comprehensive experimentation to evaluate the performance of our mapping service and show that it achieves low communication overhead, produces maps of high fidelity, and further minimises the mapping predictive error dynamically through integrating the application domain model in the mapping service.
A Fast Convergence and Quick Route Updates Based Energy Aware Tree-Based Rout...iosrjce
IOSR Journal of Computer Engineering (IOSR-JCE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of computer engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in computer technology. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
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
International Journal of Engineering Research and Development (IJERD)IJERD Editor
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals,
yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal
Algorithmic Construction of Optimal and Load Balanced Clusters in Wireless Se...M H
This paper proposes a clustering algorithm - Ba-lanced Minimum Radius Clustering (BMRC) - for use in large scale, distributed Wireless Sensor Networks (WSN). Cluster balancing is an intractable problem to solve in a distributed manner, and distribution is important, by reason of both avoiding specialised node vulnerability and minimising message overhead.The BMRC algorithm described here distributes several of the cluster balancing functions to the cluster-heads. In proposing this algorithm, several tentative claims have been made for it, namely that it is suitable for arbitrary number of cluster heads; that its pecifies a way to elect cluster heads and use them to create the local models; that it accomplishes optimal balanced clusters in distributed manner; that it is scalable and it uses the number-of-hops as a clustering parameter; that it is energy efficient. These claims were studied and verified by simulation.
SHADOWING EFFECTS ON ROUTING PROTOCOL OF MULTIHOP AD HOC NETWORKSijasuc
Two-ray ground reflection model has been widely used as the propagation model to investigate the
performance of an ad hoc network. But two-ray model is too simple to represent a real world network. A
more realistic model namely shadowing propagation model has been used in this investigation. Under
shadowing propagation model, a mobile node may receive a packet at a signal level that is below a
required threshold level. This low signal level affects the routing protocol as well as the medium access
control protocol of a network. An analytical model has been presented in this paper to investigate the
shadowing effects on the network performance. The analytical model has been verified via simulation
results. Simulation results show that the performance of a network becomes very poor if shadowing
propagation model is used in compare to the simple two-ray model. Two solutions have also been proposed
in this paper to overcome the effects of shadowing. One solution is a physical layer solution and the other
one is a Medium Access Control (MAC) layer solution. Simulation results show that these two solutions
reduce the shadowing effect and improve network performance.
A Framework for Improving the Performance of MANET by Controlling Data Traffi...rahulmonikasharma
A mobile ad-hoc network is a category of wireless network which does not depend on a predefined network structure or topology. Ad hoc networks require no centralized administration or fixed network infrastructure such as base stations or access points, and can be quickly and inexpensively set up as needed. Two mobile nodes can exchange data directly if they are in the defined range of each other. If not, nodes can communicate via a multi-hop route with the help of other mobile nodes. This paper proposed an approach to improve data transmission by reducing the data traffic and it also increase data availability in the mobile ad-hoc network. In the proposed approach, MANET is server client based network, means a mobile host acts as a server and fulfill the others node’s request. Each mobile node has a buffer for temporarily storing data fragment for a specific time, If a mobile node requests for a particular data fragment and the request is multi hoped, then first request is sent to its neighbor node, neighbor node first match requested data fragment with stored data, if it is matched the request will be responded by this neighbor otherwise request will be routed to mobile server. In this way the overhead of the server and server traffic will be reduced. The proposed method reduces time consumed by data fetching directly from server routing through multiple nodes and thus, it also enhances data availability.
Designing an opportunistic routing scheme for adaptive clustering in mobile a...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
Designing an opportunistic routing scheme for adaptive clustering in mobile a...eSAT Journals
Abstract Mobile networks have received great deal of attention during last few decades due to their potential applications such as large scale, improved flexibility and reduced costs. This proposed work addresses two problems associated with mobile network such as method to reduce overhead between the nodes, and energy balanced routing of packets by Co-Operative opportunistic routing for cluster based communication. We propose a modified algorithm that uses On-Demand Opportunistic Group mobility based clustering (ODOGMBC) for forming the cluster and predicting the cluster mobility by neighbourhood update algorithm. Cluster formation involves election of a mobile node as Cluster head. Each cluster comprises of cluster head and non-cluster head node that forms a cluster dynamically. Each node in the network continuously finds it neighbour by communicating with them, and nodes have consistent updated routing information in route cache by neighbourhood update algorithm. In routing process packet forwarded by the source node is updated by intermediate forwarder if topology undergo changes. This opportunistic routing scheme provides responsive data transportation and managing the node effectively, even in heavily loaded environment. Thus, our proposed routing technique helps us to reduce overhead, increases efficiency and better control of path selection. Keywords- Clustering, Forwarder, MANET, Prediction, Reactive, opportunistic routing.
Route optimization in manets with aco and ga eSAT Journals
Abstract A mobile ad-hoc network consists of a collection of mobile nodes which can communicate with each other with the help of wireless links without the help of any pre-existing communication infrastructure. Due to the lack of infrastructure in these type of networks, nodes itself can act as a routers and relay the packets from source to destination. There are so many routing protocols used in MANET which also maintains connectivity from source to destination when links on these paths are break due to some causes like node movements, radio propagation, drainage of battery, and wireless interference. Routing is one of the important issues which are having a significant impact on network performance. Different measures which are concerned with the Quality of Service are like end to end delay, packet delivery ratio, control overhead, pause time, routing overhead, and distance in between source and destination pair. Different optimization techniques can be used to find out an available optimal path from source to destination. In this paper, we are using Ant Colony Optimization for finding out best possible paths, along with Genetic Algorithm which helps in giving the globally optimal solution from all the best possible paths which were produced by Ant colony optimization. This proposed algorithm called as GA-API overcomes the delay in packet delivery by producing the shortest path and also overcomes the problem of communication interruption due to node or link failure by finding multiple paths between pair of source and destination nodes. Index Terms: MANET, Genetic Algorithm, Ant colony Optimization, API.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
QOS ROUTING AND PERFORMANCE EVALUATION FOR MOBILE AD HOC NETWORKS USING OLSR ...ijasuc
Mobile Ad-Hoc network is a collection of mobile nodes in communication without using infrastructure.
As the real-time applications used in today’s wireless network grow, we need some schemes to provide
more suitable service for them. We know that most of actual schemes do not perform well on traffic which
is not strictly CBR. Therefore, in this paper we have studied the impact, respectively, of mobility models
and the density of nodes on the performances (End-to-End Delay, Throughput and Packet Delivery ratio)
of routing protocol (Optimized Link State Routing) OLSR by using in the first a real-time VBR (MPEG-4)
and secondly the Constant Bit Rate (CBR) traffic. Finally we compare the performance on both cases.
Experimentally, we considered the three mobility models as follows Random Waypoint, Random
Direction and Mobgen Steady State. The experimental results illustrate that the behavior of OLSR change
according to the model and the used traffics.
Wireless Mesh Network rose as a promising innovation for providing quick and productive communication for which numerous algorithms have been proposed in networking infrastructure. For routing there are various performance parameters such as throughput, network congestion, resiliency, fairness, robustness, network jitter, delay, stability, optimality, simplicity, completeness etc. Robustness provides the capability to deal with all the failures that come across during the connection in the network to increase the network performance. In this paper we have studied and analyzed three algorithms namely on robustness parameter Resilient multicasting [2], Resilient Opportunistic Mesh Routing for Wireless Mesh Network (ROMER) [3], and Buffer Based Routing (BBR) [4], in Wireless Mesh Networks. Analysis through various parameters such as network congestion, network throughput and resiliency [5], shows network performance of BBR is better.
Performance Evaluation of Mini-sinks Mobility Using Multiple Paths in Wireles...CSCJournals
This paper presents a new approach based on the use of many data collectors, which we designate Mini-Sinks (MSs), instead of a single sink to collect the data in order to improve Wireless Sensor Network (WSN) performance. One or more MS are mobile and move according to a controlled arbitrary mobility model inside the sensor field in order to maintain a fully-connected network topology, collecting data within their coverage areas and forwarding it towards the single main sink. Energy Conserving Routing Protocol (ECRP), based on route diversity, is implemented in MSs and sensors in order to optimize the transmission cost of the forwarding scheme. A set of multiple routing paths between MSs and sensors is generated to distribute the global traffic over the entire network. Simulations were performed in order to validate the performance of our new approach. We compare the results obtained with those for a single static sink and mobile sink, and show that our approach can achieve better performances such as packet delivery ratio, throughput, end-to-end delay, network lifetime, residual energy, energy and routing diversity overhead.
Routing in Wireless Sensor Networks: Improved Energy Efficiency and Coverage ...CSCJournals
This paper proposes a new method for collecting distributed data in Wireless Sensor Networks (WSNs) that can improve the energy efficiency and network coverage; especially in remote areas. In multi-hop communication, sink nodes are responsible for collecting and forwarding data to base stations. The nodes that are located near a sink node usually deplete their battery faster than other nodes because they are responsible for aggregating the data from other sensor nodes. Several studies have proved the advantages of using mobile sink nodes to reduce energy consumption. Nonetheless, the need for compatible and efficient routing algorithms cannot be understated. Accordingly, a hybrid routing algorithm based on the Dijkstra�s and Rendezvous algorithms is proposed. To improve the energy efficiency and coverage, Energy Efficient Hybrid Unmanned Vehicle Based Routing Algorithm (E2HUV) is proposed to create a routing path for Unmanned Aerial Vehicles (UAVs) that can be used as mobile sinks in WSNs. Performance results show that the E2HUV algorithm offers better efficiency as compared to currently existing algorithms.
Effects of mobility models and nodes distribution on wireless sensors networksijasuc
Wireless sensor networks (WSN) is an important future technology, in several applications in military,
health, environment and industries. Currently the integration of social and sensor is very important by
considering the characteristics of social networks in designing wireless sensor networks WSN for
improvement such as (number of messages from source to destination, radius of coverage, connectivity, and
spreading). This area has not received much attention and few researches focus on the performance
evaluation. In this paper we have studied the impact of different mobility and distribution models which is a
variable one should define which model is best for the infrastructure given their differences, also study
include the exact effect of nodes distribution and analyzed by calculation the number of messages of 12
cases to get a real performance evaluation under different conditions and same routing techniques. This
work provides us a greater understanding and clear an idea of the effect of mobility plus distribution.
SIX DEGREES OF SEPARATION TO IMPROVE ROUTING IN OPPORTUNISTIC NETWORKSijujournal
Opportunistic Networks are able to exploit social behavior to create connectivity opportunities. This
paradigm uses pair-wise contacts for routing messages between nodes. In this context we investigated if the
“six degrees of separation” conjecture of small-world networks can be used as a basis to route messages in
Opportunistic Networks. We propose a simple approach for routing that outperforms some popular
protocols in simulations that are carried out with real world traces using ONE simulator. We conclude that
static graph models are not suitable for underlay routing approaches in highly dynamic networks like
Opportunistic Networks without taking account of temporal factors such as time, duration and frequency of
previous encounters.
Optimal Coverage Path Planningin a Wireless Sensor Network for Intelligent Tr...IJCNCJournal
With the enhancement of the intelligent and communication technology, an intelligent transportation plays a vital role to facilitate an essential service to many people, allowing them to travel quickly and conveniently from place to place. Wireless sensor networks (WSNs) are well-known for their ability to detect physical significant barriers due to their diverse movement, self-organizing capabilities, and the integration of this mobile node on the intelligent transportation system to gather data in WSN contexts is becoming more and more popular as these vehicles proliferate. Although these mobile devices might enhance network performance, however it is difficult to design a suitable transportation path with the limited energy resources with network connectivity. To solve this problem, we have proposed a novel itinerary planning schema data gatherer (IPS-DG) model. Furthermore, we use the path planning module (PPM) which finds the transportation path to travel the shortest distance. We have compared our results under different aspect such as life span, energy consumption, and path length with Low Energy Adaptive Clustering Hierarchy (LEACH), Multi-Hop Weighted Revenue (MWR), Single-Hop Data Gathering Procedure (SHDGP). Our model outperforms in terms of energy usage, shortest path, and longest life span of with LEACH, MWR, SHDGP routing protocols.
Optimal Coverage Path Planning in a Wireless Sensor Network for Intelligent T...IJCNCJournal
With the enhancement of the intelligent and communication technology, an intelligent transportation plays a vital role to facilitate an essential service to many people, allowing them to travel quickly and conveniently from place to place. Wireless sensor networks (WSNs) are well-known for their ability to detect physical significant barriers due to their diverse movement, self-organizing capabilities, and the integration of this mobile node on the intelligent transportation system to gather data in WSN contexts is becoming more and more popular as these vehicles proliferate. Although these mobile devices might enhance network performance, however it is difficult to design a suitable transportation path with the limited energy resources with network connectivity. To solve this problem, we have proposed a novel itinerary planning schema data gatherer (IPS-DG) model. Furthermore, we use the path planning module (PPM) which finds the transportation path to travel the shortest distance. We have compared our results under different aspect such as life span, energy consumption, and path length with Low Energy Adaptive Clustering Hierarchy (LEACH), Multi-Hop Weighted Revenue (MWR), Single-Hop Data Gathering Procedure (SHDGP). Our model outperforms in terms of energy usage, shortest path, and longest life span of with LEACH, MWR, SHDGP routing protocols.
Present new mechanisms for modelling multiple interfaces on a node, support for interference-limited links and a frame-work for modelling complex applications running on the nodes. Furthermore, provide an overview of concrete use cases where the simulator has been successfully exploited to study a variety of aspects related to opportunistic, message-based communications. Node movement is implemented by movement models. These are either synthetic models or existing movement traces. Connectivity between the nodes is based on their location, communication range and the bit-rate. The routing function is implemented by routing modules that decide which messages to forward over existing contacts. Finally, the messages themselves are generated either through event generators that generate random traffic between the nodes, or through applications that generate traffic based on application interactions. The main functions of the simulator are the modelling of node movement, inter-node contacts using various interfaces, routing, message handling and application interactions. Result collection and analysis are done through visualization, reports and post-processing tools.
Similar to Broadcasting Scenario under Different Protocols in MANET: A Survey (20)
Data Mining is a significant field in today’s data-driven world. Understanding and implementing its concepts can lead to discovery of useful insights. This paper discusses the main concepts of data mining, focusing on two main concepts namely Association Rule Mining and Time Series Analysis
A Review on Real Time Integrated CCTV System Using Face Detection for Vehicle...rahulmonikasharma
We are describes the technique for real time human face detection and counting the number of passengers in vehicle and also gender of the passengers.The Image processing technology is very popular,now at present all are going to use it for various purpose. It can be applied to various applications for detecting and processing the digital images. Face detection is a part of image processing. It is used for finding the face of human in a given area. Face detection is used in many applications such as face recognition, people tracking, or photography. In this paper,The webcam is installed in public vehicle and connected with Raspberry Pi model. We use face detection technique for detecting and counting the number of passengers in public vehicle via webcam with the help of image processing and Raspberry Pi.
Considering Two Sides of One Review Using Stanford NLP Frameworkrahulmonikasharma
Sentiment analysis is a type of natural language processing for tracking the mood of the public about a particular product or a topic and is useful in several ways. Polarity shift is the most classical task which aims at classifying the reviews either positive or negative. But in many cases, in addition to the positive and negative reviews, there still many neutral reviews exist. However, the performance sometimes limited due to the fundamental deficiencies in handling the polarity shift problem. We propose an Improvised Dual Sentiment Analysis (IDSA) model to address this problem for sentiment classification. We first propose a novel data expansion technique by creating sentiment-reversed review for each training and test review. We develop a corpus based method to construct a pseudo-antonym dictionary. It removes DSA’s dependency on an external antonym dictionary for review reversion. We conduct a range of experiments and the results demonstrates the effectiveness of DSA in addressing the polarity shift in sentiment classification. .
A New Detection and Decoding Technique for (2×N_r ) MIMO Communication Systemsrahulmonikasharma
The requirements of fifth generation new radio (5G- NR) access networks are very high capacity and ultra-reliability. In this paper, we proposed a V-BLAST2 × N_r MIMO system that is analyzed, improved, and expected to achieve both very high throughput and ultra- reliability simultaneously.A new detection technique called parallel detection algorithm is proposed. The performance of the proposed algorithm compared with existing linear detection algorithms. It was seen that the proposed technique increases the speed of signal transmission and prevents error propagation which may be present in serial decoding techniques. The new algorithm reduces the bit error probability and increases the capacity simultaneouslywithout using a standard STC technique. However, it was seen that the BER of systems using the proposed algorithm is slightly higher than a similar system using only STC technique. Simulation results show the advantages of using the proposed technique.
Sybil Attack Analysis and Detection Techniques in MANETrahulmonikasharma
Security is important for many sensor network applications. A particularly harmful attack against sensor and ad hoc networks is known as the Sybil attack [6], where a node Illegitimately claims multiple identities.Mobility cause a main problem when we talk about security in Mobile Ad-hoc networks. It doesn’t depend on fixed architecture, the nodes are continuously moving in a random fashion. In this article we will focus on identifying the Sybil attack in MANET. It uses air medium for communication so it is more prone to the attack. Sybil attack is one in which single node present multiple fake identities to other nodes, which cause destruction.
A Landmark Based Shortest Path Detection by Using A* and Haversine Formularahulmonikasharma
In 1900, less than 20 percent of the world populace lived in cities, in 2007, fair more than 50 percent of the world populace lived in cities. In 2050, it has been anticipated that more than 70 percent of the worldwide population (about 6.4 billion individuals) will be city tenants. There's more weight being set on cities through this increment in population [1]. With approach of keen cities, data and communication technology is progressively transforming the way city regions and city inhabitants organize and work in reaction to urban development. In this paper, we create a nonspecific plot for navigating a route throughout city A asked route is given by utilizing combination of A* Algorithm and Haversine equation. Haversine Equation gives least distance between any two focuses on spherical body by utilizing latitude and longitude. This least distance is at that point given to A* calculation to calculate minimum distance. The method for identifying the shortest path is specify in this paper.
Processing Over Encrypted Query Data In Internet of Things (IoTs) : CryptDBs,...rahulmonikasharma
Internet of Things (IoT) is the developing technologies that would be the biggest agents to modify the current world. Machine-to-machine communications perform with virtual, mobile and instantaneous connections. In IoT system, it consists of data-gathering sensors various other household devices. Intended for protecting IoT system, the end-to-end secure communication is a necessary measure to protect against unauthorized entities (e.g., modification attacks and eavesdropping,) and the data unprotected on the Cloud. The most important concern hereby is how to preserve the insightful information and to provide the privacy of user data. In IoT, the encrypted data computing is based on techniques appear to be promising approaches. In this paper, we discuss about the recent secure database systems, which are capable to execute SQL queries over encrypted data.
Quality Determination and Grading of Tomatoes using Raspberry Pirahulmonikasharma
In India cultivation of tomatoes is carried out by traditional methods and techniques. Today tremendous improvement in field of agriculture technologies and products can be seen. The tomatoes affect the overall production drastically. Image processing technique can be key technique for finding good qualities of tomatoes and grading. This work aimed to study different types of algorithms used for quality grading and sorting of fruit from the acquire image. In previous years several types of techniques are applied to analyses the good quality fruits. A simple system can be implemented using Raspberry pi with computer vision technology and image processing algorithms.
Comparative of Delay Tolerant Network Routings and Scheduling using Max-Weigh...rahulmonikasharma
Network management and Routing is supportively done by performing with the nodes, due to infrastructure-less nature of the network in Ad hoc networks or MANET. The nodes are maintained itself from the functioning of the network, for that reason the MANET security challenges several defects. Routing process and Scheduling is a significant idea to enhance the security in MANET. Other than, scheduling has been recognized to be a key issue for implementing throughput/capacity optimization in Ad hoc networks. Designed underneath conventional (LT) light tailed assumptions, traffic fundamentally faces Heavy-tailed (HT) assumption of the validity of scheduling algorithms. Scheduling policies are utilized for communication networks such as Max-Weight, backpressure and ACO, which are provably throughput optimality and the Pareto frontier of the feasible throughput region under maximal throughput vector. In wireless ad-hoc network, the issue of routing and optimal scheduling performs with time varying channel reliability and multiple traffic streams. Depending upon the security issues within MANETs in this paper presents a comparative analysis of existing scheduling policies based on their performance to progress the delay performance in most scenarios. The security issues of MANETs considered from this paper presents a relative analysis of existing scheduling policies depend on their performance to progress the delay performance in most developments.
DC Conductivity Study of Cadmium Sulfide Nanoparticlesrahulmonikasharma
The dc conductivity of consolidated nanoparticle of CdS has been studied over the temperature range from 303 K to 523 K and the conductivity has been found to be much larger than that of single crystals.
A Survey on Peak to Average Power Ratio Reduction Methods for LTE-OFDMrahulmonikasharma
OFDM (Orthogonal Frequency Division Multiplexing) is generally preferred for high data rate transmission in digital communication. The Long-Term Evolution (LTE) standards for the fourth generation (4G) wireless communication systems. Orthogonal Frequency Division Multiple Access (OFDMA) and Single Carrier Frequency Division Multiple Access (SC-FDMA) are the two multiple access techniques which are generally used in LTE.OFDM system has a major shortcoming of high peak to average power ratio (PAPR) value. This paper explains different PAPR reduction techniques and presents a comparison of the various techniques based on theoretical results. It also presents a survey of the various PAPR reduction techniques and the state of the art in this area.
IOT Based Home Appliance Control System, Location Tracking and Energy Monitoringrahulmonikasharma
Home automation has been a dream of sciences for so many years. It could wind up conceivable in twentieth century simply after power all family units and web administrations were begun being utilized on across the board level. The point of home robotization is to give enhanced accommodation, comfort, vitality effectiveness and security. Vitality checking and protection holds prime significance in this day and age in view of the irregularity between control age and request observing frameworks accessible in the market. Ordinarily, customers are disappointed with the power charge as it doesn't demonstrate the power devoured at the gadget level. This paper shows the outline and execution of a vitality meter utilizing Arduino microcontroller which can be utilized to gauge the power devoured by any individual electrical apparatus. The primary expectation of the proposed vitality meter is to screen the power utilization at the gadget level, transfer it to the server and build up remote control of any apparatus. So we can screen the power utilization remotely and close down gadgets if vital. The car segment is additionally one of the application spaces where vehicle can be made keen by utilizing "IOT". So a vehicle following framework is additionally executed to screen development of vehicles remotely.
Thermal Radiation and Viscous Dissipation Effects on an Oscillatory Heat and ...rahulmonikasharma
An anticipated outcome that is intended chapter is to investigate effects of magnetic field on an oscillatory flow of a viscoelastic fluid with thermal radiation, viscous dissipation with Ohmic heating which bounded by a vertical plane surface, have been studied. Analytical solutions for the quasi – linear hyperbolic partial differential equations are obtained by perturbation technique. Solutions for velocity and temperature distributions are discussed for various values of physical parameters involving in the problem. The effects of cooling and heating of a viscoelastic fluid compared to the Newtonian fluid have been discussed.
Advance Approach towards Key Feature Extraction Using Designed Filters on Dif...rahulmonikasharma
In fast growing database repository system, image as data is one of the important concern despite text or numeric. Still we can’t replace test on any cost but for advancement, information may be managed with images. Therefore image processing is a wide area for the researcher. Many stages of processing of image provide researchers with new ideas to keep information safe with better way. Feature extraction, segmentation, recognition are the key areas of the image processing which helps to enhance the quality of working with images. Paper presents the comparison between image formats like .jpg, .png, .bmp, .gif. This paper is focused on the feature extraction and segmentation stages with background removal process. There are two filters, one is integer filter and second one is floating point Filter, which is used for the key feature extraction from image. These filters applied on the different images of different formats and visually compare the results.
Alamouti-STBC based Channel Estimation Technique over MIMO OFDM Systemrahulmonikasharma
The examination on various looks into on MIMO STBC framework in order to accomplish the higher framework execution is standard that the execution of the remote correspondence frameworks can be improved by usage numerous transmit and get radio wires, that is normally gathered on the grounds that the MIMO procedure, and has been incorporated. The Alamouti STBC might be a promising because of notice the pick up inside the remote interchanges framework misuse MIMO. To broaden the code rate and furthermore the yield of the symmetrical zone time square code for more than 4 transmit reception apparatuses is examined. The outlined framework is beated once forced with M-PSK (i.e upto 32-PSK) regulation. The channel estimation examine in these conditions.
Empirical Mode Decomposition Based Signal Analysis of Gear Fault Diagnosisrahulmonikasharma
A vibration investigation is about the specialty of searching for changes in the vibration example, and after that relating those progressions back to the machines mechanical outline. The level of vibration and the example of the vibration reveal to us something about the interior state of the turning segment. The vibration example can let us know whether the machine is out of adjust or twisted. Al-so blames with the moving components and coupling issues can be distinguished. This paper shows an approach for equip blame investigation utilizing signal handling plans. The information has been taken from college of ohio, joined states. The investigation has done utilizing MATLAB software.
This paper discusses a new algorithm of a univariate method, which is vitally important to develop a short-term load forecasting module for planning and operation of distribution system. It has many applications including purchasing of energy, generation and infrastructure development etc. We have discussed different time series forecasting approaches in this paper. But ARIMA has proved itself as the most appropriate method in forecasting of the load profile for West Bengal using the historical data of the year of 2017. Auto Regressive Integrated Moving Average model gives more accuracy level of load forecast than any other techniques. Mean Absolute Percentage Error (MAPE) has been calculated for the mentioned forecasted model.
Impact of Coupling Coefficient on Coupled Line Couplerrahulmonikasharma
The coupled line coupler is a type of directional coupler which finds practical utility. It is mainly used for sampling the microwave power. In this paper, 3 couplers A,B & C are designed with different values of coupling coefficient 6dB,10dB & 18dB respectively at a frequency of 2.5GHz using ADS tool. The return loss, isolation loss & transmission loss are determined. The design & simulation is done using microstrip line technology.
Design Evaluation and Temperature Rise Test of Flameproof Induction Motorrahulmonikasharma
The ignition of flammable gases, vapours or dust in presence of oxygen contained in the surrounding atmosphere may lead to explosion. Flameproof three phase induction motors are the most common and frequently used in the process industries such as oil refineries, oil rigs, petrochemicals, fertilizers, etc. The design of flameproof motor is such that it allows and sustain explosion within the enclosure caused by ignition of hazardous gases without transmitting it to the external flammable atmosphere. The enclosure is mechanically strong enough to withstand the explosion pressure developed inside it. To prevent an explosion due to hot spot on the surface of the motor, flameproof induction motors are subjected to heat run test to determine the maximum surface temperature and temperature class with respect to the ignition temperature of the surrounding flammable gas atmosphere. This paper highlights the design features of flameproof motors and their surface temperature classification for different sizes.
Advancement in Abrasive Water Jet Machining - A Studyrahulmonikasharma
The abrasive water-jet machining is an unconventional and eco-friendly technology used for hard and brittle material in industrial purpose. As the only cold high-energy beam machining technology, abrasive water-jet (AWJ) is one of the most rapidly developed techniques in material manufacturing industry and can be applied for wide variety of materials. Energy transformation is used to get pressurized jet and to have plastic deformation and fracture, results wear ratio is infinite. The study is focused on abrasive water jet lag info and recharging of abrasives and process parameter such as Influence of pressure, traverse rate, and abrasive flow rate, depth of cut and surface roughness and size and shape of abrasive particles and effectiveness of process to get higher surface finish. Advantageous and comparison will also be part of the concern study.AWJM technique has suitable for precise machining such as polishing, drilling, turning and milling. This technique has sought the benefits of combining with other material removal methods to further expand its applications.
Vaccine management system project report documentation..pdfKamal Acharya
The Division of Vaccine and Immunization is facing increasing difficulty monitoring vaccines and other commodities distribution once they have been distributed from the national stores. With the introduction of new vaccines, more challenges have been anticipated with this additions posing serious threat to the already over strained vaccine supply chain system in Kenya.
Overview of the fundamental roles in Hydropower generation and the components involved in wider Electrical Engineering.
This paper presents the design and construction of hydroelectric dams from the hydrologist’s survey of the valley before construction, all aspects and involved disciplines, fluid dynamics, structural engineering, generation and mains frequency regulation to the very transmission of power through the network in the United Kingdom.
Author: Robbie Edward Sayers
Collaborators and co editors: Charlie Sims and Connor Healey.
(C) 2024 Robbie E. Sayers
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.
Final project report on grocery store management system..pdfKamal Acharya
In today’s fast-changing business environment, it’s extremely important to be able to respond to client needs in the most effective and timely manner. If your customers wish to see your business online and have instant access to your products or services.
Online Grocery Store is an e-commerce website, which retails various grocery products. This project allows viewing various products available enables registered users to purchase desired products instantly using Paytm, UPI payment processor (Instant Pay) and also can place order by using Cash on Delivery (Pay Later) option. This project provides an easy access to Administrators and Managers to view orders placed using Pay Later and Instant Pay options.
In order to develop an e-commerce website, a number of Technologies must be studied and understood. These include multi-tiered architecture, server and client-side scripting techniques, implementation technologies, programming language (such as PHP, HTML, CSS, JavaScript) and MySQL relational databases. This is a project with the objective to develop a basic website where a consumer is provided with a shopping cart website and also to know about the technologies used to develop such a website.
This document will discuss each of the underlying technologies to create and implement an e- commerce website.
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.
COLLEGE BUS MANAGEMENT SYSTEM PROJECT REPORT.pdfKamal Acharya
The College Bus Management system is completely developed by Visual Basic .NET Version. The application is connect with most secured database language MS SQL Server. The application is develop by using best combination of front-end and back-end languages. The application is totally design like flat user interface. This flat user interface is more attractive user interface in 2017. The application is gives more important to the system functionality. The application is to manage the student’s details, driver’s details, bus details, bus route details, bus fees details and more. The application has only one unit for admin. The admin can manage the entire application. The admin can login into the application by using username and password of the admin. The application is develop for big and small colleges. It is more user friendly for non-computer person. Even they can easily learn how to manage the application within hours. The application is more secure by the admin. The system will give an effective output for the VB.Net and SQL Server given as input to the system. The compiled java program given as input to the system, after scanning the program will generate different reports. The application generates the report for users. The admin can view and download the report of the data. The application deliver the excel format reports. Because, excel formatted reports is very easy to understand the income and expense of the college bus. This application is mainly develop for windows operating system users. In 2017, 73% of people enterprises are using windows operating system. So the application will easily install for all the windows operating system users. The application-developed size is very low. The application consumes very low space in disk. Therefore, the user can allocate very minimum local disk space for this application.
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.
Quality defects in TMT Bars, Possible causes and Potential Solutions.PrashantGoswami42
Maintaining high-quality standards in the production of TMT bars is crucial for ensuring structural integrity in construction. Addressing common defects through careful monitoring, standardized processes, and advanced technology can significantly improve the quality of TMT bars. Continuous training and adherence to quality control measures will also play a pivotal role in minimizing these defects.
Planning Of Procurement o different goods and services
Broadcasting Scenario under Different Protocols in MANET: A Survey
1. International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 6 Issue: 7 106 - 108
______________________________________________________________________________________
106
IJRITCC | July 2018, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
Broadcasting Scenario under Different Protocols in MANET: A Survey
Chakradhar Verma
Research Scholar UCE,RTU,Kota(Raj.)
chakradharverma@gmail.com
Manish Jain
ITM,Bhilwara,(Raj.)
dch.mani@yahoo.co.in
Abstract— A wireless network enables people to communicate and access applications and information without wires. This provides freedom
of movement and the ability to extend applications to different parts of a building, city, or nearly anywhere in the world. Wireless networks
allow people to interact with e-mail or browse the Internet from a location that they prefer. Adhoc Networks are self-organizing wireless
networks, absent any fixed infrastructure. broadcasting of data through proper channel is essential. Various protocols are designed to avoid
the loss of data. In this paper an overview of different broadcast protocols are discussed.
Keywords- MANET,Broadcasting,Protocols,Techniques
__________________________________________________*****_________________________________________________
I. INTRODUCTION
Mobile Ad-hoc Network: MANET is a combination of sensor
node that can proceed on their own and connect with the
physical environment. Mobile nodes have the ability of
computing, sensing and communication like static nodes.
Manet is one such network and it is a continuously self-
configuring, infrastructure-less network of mobile devices
connected wires.
Each device in a MANET is free to move independently in any
direction, and will therefore change its links to other devices
frequently. Each must forward traffic unrelated to its own use,
and therefore be a router. The primary challenge in building a
MANET is equipping each device to continuously maintain
the information required to properly route traffic.
The routing protocols for MANET are divided into three major
classifications like reactive protocols, Proactive protocols and
hybrid.
In reactive protocols, paths are determined when they are
required by the source using a route discovery process.
AODV,DSR , ROAM , LMR, SSA , LAR , RDMAR , ARA ,
FORP , CBRP are the examples of reactive routing
protocols[5].
In proactive routing protocols [5] the paths to all the
destination nodes are determined at the start up, and
maintained by using a periodic route update process. DSDV,
GSR, FSR, STAR, DREAM is the examples for the proactive
routing protocols.
Hybrid routing protocols are both reactive and proactive in
nature. Each protocol has unique characteristics and
examples are ZRP, ZHLS, SLURP, and DDR.
In this paper, different techniques used for broadcasting
data in MANET will be discussed.
II. BROADCATING TECHNIQUES
This section defines the different broadcasting
techniques employed in mobile adhoc networks and their
issues during data routing from source to destination.
a) A simple improved distributed algorithm for minimum
CDS in unit disk graphs.
Stefan,Alexander,Ulrich and Segal proposed a routing
scheme in adhoc networks in such a way to construct a
backbone based on minimum connected dominating set. This
approach presents a very simple distributed algorithm for
computing a small CDS. Backbone nodes in networks can
perform efficient routing and broadcasting information. This
approach assumes that time slots assignment to the nodes
exists such that no two nodes transmit in the same time slot[4].
Coloring algorithm is used to determine such assignment.
The execution of this algorithm is divided into rounds
and each round consists of three phases. In each phase a
conflict–free time slot assignment is used and hence each node
is able to transmit once.
This technique has a direct impact on the size of several
CDS constructions and the relationship between the size of
maximal independent set and a minimum CDS in unit disk
graph is analyzed which yields better rounds for many other
algorithms[4].
b) Stochastic Flooding Broadcast Protocols in
Mobile Wireless Networks
Julien Cartigny, David Simplot and Jean Carle have proposed
a paper “Stochastic Flooding Broadcast Protocols in
Mobile Wireless Networks”. The information broadcast based
on the flooding protocol in wireless communication
environment leads to an overload of network bandwidth.
So, each node has to obtain medium access and transmit its
2. International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 6 Issue: 7 106 - 108
______________________________________________________________________________________
107
IJRITCC | July 2018, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
data. However, in dense network the collision probability is
very high. In this paper, some improvements of the stochastic
flooding protocols were proposed that aim to broadcast given
information through the entire network efficiently [2]. The
stochastic flooding protocols and its variants works based on
five modes of stochastic approaches.
The main contributions of this paper are based on stochastic
approach, topology adaptability, internal-node- based
broadcasting algorithms and neighbor elimination scheme. The
mode of flooding protocols may decrease the number of
emitted packets and stochastic can offer good variety to
generate multiple routes. Probabilistic Scheme gives also
better use of energy and offers a better average use of the
battery.
c) Color-Based Broadcasting for Ad Hoc Networks
Alireza Keshavarz-Haddad, Vinay Ribeiroz and Rudolf Riedi
have proposed a paper “Color-Based Broadcasting for Ad
Hoc Networks”. This paper presents a color-based
broadcast technique for wireless ad hoc networks where for
each forwarding of the broadcast message a unique color is
assigned from different set of colors. The message is
forwarded by the node only if a color is assigned from color
set which it has not already overheard after a random time. In
the closely related counter-based broadcast scheme the number
of broadcasts is counted by a node but the colors overheard
are not counted. The forwarding nodes form a backbone,
which is determined by the random timers[3]. The color-
generated backbone nodes exhibit a connectivity graph richer
than the counter-based ones. The different color shows
geometric properties of the backbones which proves that the
sizes of both color- and counter-generated backbones
are within a small constant factor of the optimum. Two
techniques, boosting and edge-growing, are proposed that
improve the performance of color and counter based broadcast
in terms of reachability and number of rebroadcasts.
d) SLAW: A Mobility Model for Human Walks
Kyunghan Lee (KAIST), Seongik Hong (NCSU), Seong
Joon Kim (NCSU), Injong Rhee (NCSU) and Song Chong
(KAIST) have proposed a paper, “SLAW: A Mobility
Model for Human Walks”. In mobile networks, the
movement patterns of mobile holders decide the
performance of networking applications. The humans have
control of mobility and such mobile networks are
simulated by their mobility patterns. Simulation tools are used
to deploy real mobile networks and can be used for
performance evaluation. This paper presents a new mobility
model, called Self similar Least- Action Walk (SLAW), which
produces synthetic mobility traces. SLAW acts as an important
tool for matching human walk behaviors and it can be applied
in traffic predications and biological virus spread evaluation
where human mobility traces are important. SLAW needs only
a few input parameters such as the walk-about area size, the
number of walkers, and the Hurst value used for fractal
waypoints generation. SLAW development relies on GPS
traces of human walks including 226 daily traces collected
from 101 volunteers in five different outdoor sites [6].
Many traces are gathered among people those who share the
common interests like students in the same university and
tourists spot. SLAW expresses the regular and spontaneous
trip patterns available in the daily movement of humans.
People may visit same places but may at the same time, make
irregular trips. The order of visiting places may be random.
The main work of this paper is to express and analyze the
regularity and spontaneity by emulating a human mobility
model. The study shows that SLAW identifies the unique
features of various DTN routing protocols compared to
random mobility techniques. Also it gives a clear
performance analysis about protocols those may and may not
utilize past contact history information among nodes to predict
the future contact probability information.
e) Flash Flooding: Exploring the capture effect for
Rapid flooding in Wireless Sensor Networks
Jiakang Lu and Kamin Whitehouse proposed flash flooding
protocol for rapid network flooding in wireless sensor
networks. The Flash flooding protocol allows concurrent
transmissions among neighboring nodes[5]. It relied on the
capture effect to ensure that each node receives the flood
from at least one of its neighbors.
This flash flooding approach is divided into three parts: Flash-
I illustrates complete concurrency such that the nodes
repeat the message as soon as they receive it, even if their
neighbors are still transmitting. Flash-II illustrates Maintained
Concurrency such that nodes use MAC delay to wait for all
neighbors to finish transmitting. Flash-III illustrates
Controlled Concurrency which improves flooding
throughput in low-duty cycle networks. This protocol
approached the theoretical lower bound on flooding latency
and does not compromise reliability or power consumption.
f) Gossip-Based Ad Hoc Routing
Zygmunt Haas Joseph Y. Halpern Li Li
designed a gossip based approach to reduce the overhead
problem. Gossip protocol acts as a communication protocol
which is used to overcome the unreliable communication, data
redundancy, unbounded information and overhead problem.
The basic idea of the gossip protocol is that few nodes may
receive the message frequently and others don’t receive the
message since gossip message dies out quickly during the
data network transmission. They skipped this problem by
setting a gossiping probability between 0.6 and 0.8 during
every execution in dense network. Gossiping when combined
with flooding technique yields good results which shows that
35% of message overhead is reduced in terms of throughput
3. International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 6 Issue: 7 106 - 108
______________________________________________________________________________________
108
IJRITCC | July 2018, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
and latency [1].The probability rate is increases if it is success
and decreases to 0 if it is a failure and they come to an
conclusion that each intermediate node receiving the packet
will gossip with the probability carried in the route
request packet. Gossiping is still being useful even when
global messages aresent.
III.PERFORMANCE ANALYSIS
From all the above mentioned paper the performance
metrics analyzed are Latency, HOP count, Network
Reachability or Network size and number of retransmissions.
The analyzed metrics are consolidated in the Table.1 below:
Table 1: Performance Metrics
PROTOCOL S
PERFORMANCE METRICS
Latency HOP Count
Size/Rea
chability
Rebroadcast
UDG
<11.4ms 22 3.5 -
SFB .6 30 - 0.7
CBB 3ms 50 95% <2
SLAW 0.7m 40 - -
Flas
h
10.8 sec 20 -10db 6
Gossip-
Based
20ms 150 30-40% 5
IV. CONCLUSION
Broadcasting is one of the primary issues in the entire
wireless network and transmission of data through proper
channel without any loss of data is a very difficult task. In this
paper a review of broadcasting Protocol was made and their
effects on the network are discussed. From all the above
mentioned paper decided that it is possible to reduce the
rebroadcasting, latency time of data by using any one of the
protocol. It is seen that the observations are found to be good
on different broadcasting schemes.
REFERENCES
[1] K. Lee, S. Hong, S. J. Kim, I. Rhee, and S. Chong, “SLAW:
A new mobility model for human walks,” in Proc. IEEE
Conf. Comput. Commun., 2009, pp. 855–863.
[2] G. Eason, B. Noble, and I. N. Sneddon, “On certain integrals
of Lipschitz-Hankel type involving products of Bessel
functions,” Phil. Trans. Roy. Soc. London, vol. A247, pp.
529–551, April 1955. (references)
[3] J. Clerk Maxwell, A Treatise on Electricity and Magnetism,
3rd ed., vol. 2. Oxford: Clarendon, 1892, pp.68–73.
[4] I. S. Jacobs and C. P. Bean, “Fine particles, thin films and
exchange anisotropy,” in Magnetism, vol. III, G. T. Rado and
H. Suhl, Eds. New York: Academic, 1963, pp. 271–350.
[5] K. Elissa, “Title of paper if known,” unpublished.
[6] R. Nicole, “Title of paper with only first word capitalized,” J.
Name Stand. Abbrev., in press.
[7] Y. Yorozu, M. Hirano, K. Oka, and Y. Tagawa, “Electron
spectroscopy studies on magneto-optical media and plastic
substrate interface,” IEEE Transl. J. Magn. Japan, vol. 2, pp.
740–741, August 1987 [Digests 9th Annual Conf. Magnetics
Japan, p. 301, 1982].
[8] M. Young, The Technical Writer’s Handbook. Mill Valley,
CA: University Science, 1989.
[9] Electronic Publication: Digital Object Identifiers (DOIs):
Article in a journal:
[10] D. Kornack and P. Rakic, “Cell Proliferation without
Neurogenesis in Adult Primate Neocortex,” Science, vol. 294,
Dec. 2001, pp. 2127-2130, doi:10.1126/science.1065467.
Article in a conference proceedings:
[11] H. Goto, Y. Hasegawa, and M. Tanaka, “Efficient Scheduling
Focusing on the Duality of MPL Representatives,” Proc.
IEEE Symp. Computational Intelligence in Scheduling (SCIS
07), IEEE Press, Dec. 2007, pp. 57-64,
doi:10.1109/SCIS.2007.357670.
[12] M. Ramkumar, N. Memon, KPI: A Security Infrastructure for
Trusted Devices, Pre-Conference.
[13] J. Cartigny, D. Simplot, and J. Carle, “Stochastic flooding
broadcast protocols in mobile wireless networks,” LIFL,
Univ. Lille1,Lille, France, Tech. Rep.,2003.
[14] J. Lu and K. Whitehouse, “Flash flooding: Exploiting the
capture effect for rapid flooding in wireless sensor networks,”
in Proc. IEEE Conf. Comput. Commun., 2009, pp. 2491–
2499.
[15] Zhou, L. and Haas, Z. J., “Securing ad hoc networks”, IEEE
Network, Volume 13, Issue 6, Nov.-Dec. 1999, pp. 24 – 30
![International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 6 Issue: 7 106 - 108
______________________________________________________________________________________
106
IJRITCC | July 2018, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
Broadcasting Scenario under Different Protocols in MANET: A Survey
Chakradhar Verma
Research Scholar UCE,RTU,Kota(Raj.)
chakradharverma@gmail.com
Manish Jain
ITM,Bhilwara,(Raj.)
dch.mani@yahoo.co.in
Abstract— A wireless network enables people to communicate and access applications and information without wires. This provides freedom
of movement and the ability to extend applications to different parts of a building, city, or nearly anywhere in the world. Wireless networks
allow people to interact with e-mail or browse the Internet from a location that they prefer. Adhoc Networks are self-organizing wireless
networks, absent any fixed infrastructure. broadcasting of data through proper channel is essential. Various protocols are designed to avoid
the loss of data. In this paper an overview of different broadcast protocols are discussed.
Keywords- MANET,Broadcasting,Protocols,Techniques
__________________________________________________*****_________________________________________________
I. INTRODUCTION
Mobile Ad-hoc Network: MANET is a combination of sensor
node that can proceed on their own and connect with the
physical environment. Mobile nodes have the ability of
computing, sensing and communication like static nodes.
Manet is one such network and it is a continuously self-
configuring, infrastructure-less network of mobile devices
connected wires.
Each device in a MANET is free to move independently in any
direction, and will therefore change its links to other devices
frequently. Each must forward traffic unrelated to its own use,
and therefore be a router. The primary challenge in building a
MANET is equipping each device to continuously maintain
the information required to properly route traffic.
The routing protocols for MANET are divided into three major
classifications like reactive protocols, Proactive protocols and
hybrid.
In reactive protocols, paths are determined when they are
required by the source using a route discovery process.
AODV,DSR , ROAM , LMR, SSA , LAR , RDMAR , ARA ,
FORP , CBRP are the examples of reactive routing
protocols[5].
In proactive routing protocols [5] the paths to all the
destination nodes are determined at the start up, and
maintained by using a periodic route update process. DSDV,
GSR, FSR, STAR, DREAM is the examples for the proactive
routing protocols.
Hybrid routing protocols are both reactive and proactive in
nature. Each protocol has unique characteristics and
examples are ZRP, ZHLS, SLURP, and DDR.
In this paper, different techniques used for broadcasting
data in MANET will be discussed.
II. BROADCATING TECHNIQUES
This section defines the different broadcasting
techniques employed in mobile adhoc networks and their
issues during data routing from source to destination.
a) A simple improved distributed algorithm for minimum
CDS in unit disk graphs.
Stefan,Alexander,Ulrich and Segal proposed a routing
scheme in adhoc networks in such a way to construct a
backbone based on minimum connected dominating set. This
approach presents a very simple distributed algorithm for
computing a small CDS. Backbone nodes in networks can
perform efficient routing and broadcasting information. This
approach assumes that time slots assignment to the nodes
exists such that no two nodes transmit in the same time slot[4].
Coloring algorithm is used to determine such assignment.
The execution of this algorithm is divided into rounds
and each round consists of three phases. In each phase a
conflict–free time slot assignment is used and hence each node
is able to transmit once.
This technique has a direct impact on the size of several
CDS constructions and the relationship between the size of
maximal independent set and a minimum CDS in unit disk
graph is analyzed which yields better rounds for many other
algorithms[4].
b) Stochastic Flooding Broadcast Protocols in
Mobile Wireless Networks
Julien Cartigny, David Simplot and Jean Carle have proposed
a paper “Stochastic Flooding Broadcast Protocols in
Mobile Wireless Networks”. The information broadcast based
on the flooding protocol in wireless communication
environment leads to an overload of network bandwidth.
So, each node has to obtain medium access and transmit its](https://image.slidesharecdn.com/22153328576403-08-2018-190131154253/85/Broadcasting-Scenario-under-Different-Protocols-in-MANET-A-Survey-1-320.jpg)
![International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 6 Issue: 7 106 - 108
______________________________________________________________________________________
107
IJRITCC | July 2018, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
data. However, in dense network the collision probability is
very high. In this paper, some improvements of the stochastic
flooding protocols were proposed that aim to broadcast given
information through the entire network efficiently [2]. The
stochastic flooding protocols and its variants works based on
five modes of stochastic approaches.
The main contributions of this paper are based on stochastic
approach, topology adaptability, internal-node- based
broadcasting algorithms and neighbor elimination scheme. The
mode of flooding protocols may decrease the number of
emitted packets and stochastic can offer good variety to
generate multiple routes. Probabilistic Scheme gives also
better use of energy and offers a better average use of the
battery.
c) Color-Based Broadcasting for Ad Hoc Networks
Alireza Keshavarz-Haddad, Vinay Ribeiroz and Rudolf Riedi
have proposed a paper “Color-Based Broadcasting for Ad
Hoc Networks”. This paper presents a color-based
broadcast technique for wireless ad hoc networks where for
each forwarding of the broadcast message a unique color is
assigned from different set of colors. The message is
forwarded by the node only if a color is assigned from color
set which it has not already overheard after a random time. In
the closely related counter-based broadcast scheme the number
of broadcasts is counted by a node but the colors overheard
are not counted. The forwarding nodes form a backbone,
which is determined by the random timers[3]. The color-
generated backbone nodes exhibit a connectivity graph richer
than the counter-based ones. The different color shows
geometric properties of the backbones which proves that the
sizes of both color- and counter-generated backbones
are within a small constant factor of the optimum. Two
techniques, boosting and edge-growing, are proposed that
improve the performance of color and counter based broadcast
in terms of reachability and number of rebroadcasts.
d) SLAW: A Mobility Model for Human Walks
Kyunghan Lee (KAIST), Seongik Hong (NCSU), Seong
Joon Kim (NCSU), Injong Rhee (NCSU) and Song Chong
(KAIST) have proposed a paper, “SLAW: A Mobility
Model for Human Walks”. In mobile networks, the
movement patterns of mobile holders decide the
performance of networking applications. The humans have
control of mobility and such mobile networks are
simulated by their mobility patterns. Simulation tools are used
to deploy real mobile networks and can be used for
performance evaluation. This paper presents a new mobility
model, called Self similar Least- Action Walk (SLAW), which
produces synthetic mobility traces. SLAW acts as an important
tool for matching human walk behaviors and it can be applied
in traffic predications and biological virus spread evaluation
where human mobility traces are important. SLAW needs only
a few input parameters such as the walk-about area size, the
number of walkers, and the Hurst value used for fractal
waypoints generation. SLAW development relies on GPS
traces of human walks including 226 daily traces collected
from 101 volunteers in five different outdoor sites [6].
Many traces are gathered among people those who share the
common interests like students in the same university and
tourists spot. SLAW expresses the regular and spontaneous
trip patterns available in the daily movement of humans.
People may visit same places but may at the same time, make
irregular trips. The order of visiting places may be random.
The main work of this paper is to express and analyze the
regularity and spontaneity by emulating a human mobility
model. The study shows that SLAW identifies the unique
features of various DTN routing protocols compared to
random mobility techniques. Also it gives a clear
performance analysis about protocols those may and may not
utilize past contact history information among nodes to predict
the future contact probability information.
e) Flash Flooding: Exploring the capture effect for
Rapid flooding in Wireless Sensor Networks
Jiakang Lu and Kamin Whitehouse proposed flash flooding
protocol for rapid network flooding in wireless sensor
networks. The Flash flooding protocol allows concurrent
transmissions among neighboring nodes[5]. It relied on the
capture effect to ensure that each node receives the flood
from at least one of its neighbors.
This flash flooding approach is divided into three parts: Flash-
I illustrates complete concurrency such that the nodes
repeat the message as soon as they receive it, even if their
neighbors are still transmitting. Flash-II illustrates Maintained
Concurrency such that nodes use MAC delay to wait for all
neighbors to finish transmitting. Flash-III illustrates
Controlled Concurrency which improves flooding
throughput in low-duty cycle networks. This protocol
approached the theoretical lower bound on flooding latency
and does not compromise reliability or power consumption.
f) Gossip-Based Ad Hoc Routing
Zygmunt Haas Joseph Y. Halpern Li Li
designed a gossip based approach to reduce the overhead
problem. Gossip protocol acts as a communication protocol
which is used to overcome the unreliable communication, data
redundancy, unbounded information and overhead problem.
The basic idea of the gossip protocol is that few nodes may
receive the message frequently and others don’t receive the
message since gossip message dies out quickly during the
data network transmission. They skipped this problem by
setting a gossiping probability between 0.6 and 0.8 during
every execution in dense network. Gossiping when combined
with flooding technique yields good results which shows that
35% of message overhead is reduced in terms of throughput](data:image/gif;base64,R0lGODlhAQABAIAAAAAAAP///yH5BAEAAAAALAAAAAABAAEAAAIBRAA7)