In vehicular ad
-
hoc networks the packets are sent using multi
-
hop methods and the receiving limit of a
message is gradually extended, but the exponential increment of the number of nodes re
-
broadcasting a
message results in broadcast storm problem in data
broadcasting in this case. Some characteristics like
high speed of nodes, rapid topological changes and repetitive discontinuities have made it difficult
to
design an efficient broadcasting protocol for these networks.
We have offered a novel fuzzy method
based on multi
-
criteria decision
-
making (MCDM) for prioritizing the
vehicles in selection of the most proper neighbor to broadcast data in this paper. With using this f
uzzy
method, the most proper vehicles participate in data broadcasting. The results of
simulation using NS show
that because of selecting the neighboring vehicles with high priority in data broadcasting, the spee
d of
sending the packs is increased and the network load is considerably decreased. This method also
considerably decreases broadca
sting traffic.
Performance analysis of multilayer multicast MANET CRN based on steiner minim...TELKOMNIKA JOURNAL
In this study, the multicast mobile ad hoc (MANET) CRN has been developed, which involves multi-hop and multilayer consideration and Steiner minimal tree (SMT) algorithm is employed as the router protocol. To enhance the network performance with regards to throughput and packet delivery rate (PDR), as channel assignment scheme, the probability of success (POS) is employed that accounts for the channel availability and the time needed for transmission when selecting the best channel from the numerous available channels for data transmission from the source to all destinations nodes effectively. Within Rayleigh fading channels under various network parameters, a comparison is done for the performance of SMT multicast (MANET) CRN with POS scheme versus maximum data rate (MDR), maximum average spectrum availability (MASA) and random channel assignment schemes. Based on the simulation results, the SMT multicast (MANET) CRN with POS scheme was seen to demonstrate the best performance versus other schemes. Also, the results proved that the throughput and PDR performance are improved as the number the primary channels and the channel’s bandwidth increased while dropped as the value of packet size D increased. The network’s performance grew with rise in the value of idle probability (푃퐼) since the primary user’s (PU) traffic load is low when the value of 푃퐼 is high.
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.
A NOVEL HYBRID OPPORTUNISTIC SCALABLE ENERGY EFFICIENT ROUTING DESIGN FOR LOW...IJCNCJournal
Opportunistic Routing (OR) scheme increases the transmission reliability despite the lossy wireless radio links by exploiting the broadcast nature of the wireless medium. However, OR schemes in low power Wireless Sensor Network (WSN) leads to energy drain in constrained sensor nodes due to constant
overhearing, periodic beaconing for Neighbourhood Management (NM) and increase in packet header length to append priority wise sorted Forwarding Candidates Set (FCS) prior to data transmission. The timer-based coordination mechanism incurs the least overhead to coordinate among the FCS that has successfully received the data packet for relaying the data in a multi-hop manner. This timer-based mechanism suffers from duplicate transmissions if the FCS is either not carefully selected or coordinated. The focus of this work is to propose a hybrid opportunistic energy efficient routing design for large scale, low power and lossy WSN. This design avoids periodic 'hello' beacons for NM, limits constant overhearing and increase in packet header length. There are two modes of operation i) opportunistic ii) unicast mode. The sender node adopts opportunistic forwarding for its initial data packet transmission and instead of pre-computing the FCS, it is dynamically computed in a completely distributed manner. The
eligible nodes to be part of FCS will be neighbour nodes at lower corona level than the sender with respect to the sink and remaining energy above the minimum threshold. The nodes part of FCS based on crosslayered multi-metrics and fuzzy decision logic determines its priority level to compute Dynamic Holding
Delay (DHD) for effective timer coordination. The differentiated back off implementation along with DHD enables the higher priority candidate that had received data packet to forward the packet first and facilitates others to cancel its timer upon overhearing. The sender node switches to unicast mode of
forwarding for successive transmissions by choosing the forwarding node with maximum trust value as it
denotes the stability of the temporally varying link with respect to the forwarder. The sender node will revert to opportunistic mode to increase transmission reliability in case of link-level transmission error or no trustworthy forwarders. Simulation results in NS2 show significant increase in Packet Delivery Ratio (PDR),decrease in both average energy consumption per node and Normalized Energy Consumption (NEC) per packet in comparison with existing protocols.
Improved Algorithm for Throughput Maximization in MC-CDMAVLSICS Design
The Multi-Carrier Code Division Multiple Access (MC-CDMA) is becoming a very significant downlink multiple access technique for high-rate data transmission in the fourth generation wireless communication systems. By means of efficient resource allocation higher data rate i.e. throughput can be achieved. This paper evaluates the performance of group (subchannel) allocation criteria employed in downlink transmission, which results in throughput maximization. Proposed algorithm gives the modified technique of sub channel allocation in the downlink transmission of MC-CDMA systems. Simulation are carried out for all the three combining schemes, results shows that for the given power and BER proposed algorithm comparatively gives far better results .
A MANET is an autonomous collection of mobile users that communicate over relatively bandwidth constrained wireless links. When designing mobile ad hoc networks, several interesting and difficult problems arise because of the shared nature of the wireless medium, limited transmission power (range) of wireless devices, node mobility, and battery limitations. This paper aims at providing a new schema to improve Dynamic Source Routing (DSR) Protocol. The aim
behind the proposed enhancement is to find the best route in acceptable time limit without having broadcast storm. Moreover, O-DSR enables network not only to overcome congestion but also maximize the lifetime of mobile nodes. Some simulations results show that the Route Request (RREQ) and the Control Packet Overhead decrease by 15% when O-DSR is used, consequently. Also the global energy consumption in O-DSR is lower until to 60 % , which leads to a long lifetime of the network.
Long-Term Evolution (LTE), an emerging and promising fourth generation mobile technology, is expected
to offer ubiquitous broadband access to the mobile subscribers. In this paper, the performance of Frame
Level Scheduler (FLS), Exponential (EXP) rule, Logarithmic (LOG) rule and Maximum-Largest Weighted
Delay First (M-LWDF) packet scheduling algorithms has been studied in the downlink 3GPP LTE cellular
network. To this aim, a single cell with interference scenario has been considered. The performance
evaluation is made by varying the number of UEs ranging from 10 to 50 (Case 1) and user speed in the
range of [3, 120] km/h (Case 2). Results show that while the number of UEs and user speed increases, the
performance of the considered scheduling schemes degrades and in both case FLS outperforms other three
schemes in terms of several performance indexes such as average throughput, packet loss ratio (PLR),
packet delay and fairness index.
Performance analysis of multilayer multicast MANET CRN based on steiner minim...TELKOMNIKA JOURNAL
In this study, the multicast mobile ad hoc (MANET) CRN has been developed, which involves multi-hop and multilayer consideration and Steiner minimal tree (SMT) algorithm is employed as the router protocol. To enhance the network performance with regards to throughput and packet delivery rate (PDR), as channel assignment scheme, the probability of success (POS) is employed that accounts for the channel availability and the time needed for transmission when selecting the best channel from the numerous available channels for data transmission from the source to all destinations nodes effectively. Within Rayleigh fading channels under various network parameters, a comparison is done for the performance of SMT multicast (MANET) CRN with POS scheme versus maximum data rate (MDR), maximum average spectrum availability (MASA) and random channel assignment schemes. Based on the simulation results, the SMT multicast (MANET) CRN with POS scheme was seen to demonstrate the best performance versus other schemes. Also, the results proved that the throughput and PDR performance are improved as the number the primary channels and the channel’s bandwidth increased while dropped as the value of packet size D increased. The network’s performance grew with rise in the value of idle probability (푃퐼) since the primary user’s (PU) traffic load is low when the value of 푃퐼 is high.
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.
A NOVEL HYBRID OPPORTUNISTIC SCALABLE ENERGY EFFICIENT ROUTING DESIGN FOR LOW...IJCNCJournal
Opportunistic Routing (OR) scheme increases the transmission reliability despite the lossy wireless radio links by exploiting the broadcast nature of the wireless medium. However, OR schemes in low power Wireless Sensor Network (WSN) leads to energy drain in constrained sensor nodes due to constant
overhearing, periodic beaconing for Neighbourhood Management (NM) and increase in packet header length to append priority wise sorted Forwarding Candidates Set (FCS) prior to data transmission. The timer-based coordination mechanism incurs the least overhead to coordinate among the FCS that has successfully received the data packet for relaying the data in a multi-hop manner. This timer-based mechanism suffers from duplicate transmissions if the FCS is either not carefully selected or coordinated. The focus of this work is to propose a hybrid opportunistic energy efficient routing design for large scale, low power and lossy WSN. This design avoids periodic 'hello' beacons for NM, limits constant overhearing and increase in packet header length. There are two modes of operation i) opportunistic ii) unicast mode. The sender node adopts opportunistic forwarding for its initial data packet transmission and instead of pre-computing the FCS, it is dynamically computed in a completely distributed manner. The
eligible nodes to be part of FCS will be neighbour nodes at lower corona level than the sender with respect to the sink and remaining energy above the minimum threshold. The nodes part of FCS based on crosslayered multi-metrics and fuzzy decision logic determines its priority level to compute Dynamic Holding
Delay (DHD) for effective timer coordination. The differentiated back off implementation along with DHD enables the higher priority candidate that had received data packet to forward the packet first and facilitates others to cancel its timer upon overhearing. The sender node switches to unicast mode of
forwarding for successive transmissions by choosing the forwarding node with maximum trust value as it
denotes the stability of the temporally varying link with respect to the forwarder. The sender node will revert to opportunistic mode to increase transmission reliability in case of link-level transmission error or no trustworthy forwarders. Simulation results in NS2 show significant increase in Packet Delivery Ratio (PDR),decrease in both average energy consumption per node and Normalized Energy Consumption (NEC) per packet in comparison with existing protocols.
Improved Algorithm for Throughput Maximization in MC-CDMAVLSICS Design
The Multi-Carrier Code Division Multiple Access (MC-CDMA) is becoming a very significant downlink multiple access technique for high-rate data transmission in the fourth generation wireless communication systems. By means of efficient resource allocation higher data rate i.e. throughput can be achieved. This paper evaluates the performance of group (subchannel) allocation criteria employed in downlink transmission, which results in throughput maximization. Proposed algorithm gives the modified technique of sub channel allocation in the downlink transmission of MC-CDMA systems. Simulation are carried out for all the three combining schemes, results shows that for the given power and BER proposed algorithm comparatively gives far better results .
A MANET is an autonomous collection of mobile users that communicate over relatively bandwidth constrained wireless links. When designing mobile ad hoc networks, several interesting and difficult problems arise because of the shared nature of the wireless medium, limited transmission power (range) of wireless devices, node mobility, and battery limitations. This paper aims at providing a new schema to improve Dynamic Source Routing (DSR) Protocol. The aim
behind the proposed enhancement is to find the best route in acceptable time limit without having broadcast storm. Moreover, O-DSR enables network not only to overcome congestion but also maximize the lifetime of mobile nodes. Some simulations results show that the Route Request (RREQ) and the Control Packet Overhead decrease by 15% when O-DSR is used, consequently. Also the global energy consumption in O-DSR is lower until to 60 % , which leads to a long lifetime of the network.
Long-Term Evolution (LTE), an emerging and promising fourth generation mobile technology, is expected
to offer ubiquitous broadband access to the mobile subscribers. In this paper, the performance of Frame
Level Scheduler (FLS), Exponential (EXP) rule, Logarithmic (LOG) rule and Maximum-Largest Weighted
Delay First (M-LWDF) packet scheduling algorithms has been studied in the downlink 3GPP LTE cellular
network. To this aim, a single cell with interference scenario has been considered. The performance
evaluation is made by varying the number of UEs ranging from 10 to 50 (Case 1) and user speed in the
range of [3, 120] km/h (Case 2). Results show that while the number of UEs and user speed increases, the
performance of the considered scheduling schemes degrades and in both case FLS outperforms other three
schemes in terms of several performance indexes such as average throughput, packet loss ratio (PLR),
packet delay and fairness index.
Hierarchical Genetic Algorithm For Dynamic Channel Units Allocation in TD-CDM...ijwmn
Hierarchical Genetic Algorithms (HGA) as a tool for search and optimizing methodology have now reached a mature stage. The minimum resource facility to carry user traffic, termed a channel unit (CU), is composed of a one time-slot and one code in the TD-CDMA/TDD system. The control of the number of CUs depends on the traffic load solves varied and asymmetrical traffic problems in the 3G system. In a cellular network, the call arrival rate, call duration and the communication overhead between the base stations and the control center are vague and uncertain, regardless of whether the criteria of concern are nonlinear, constrained, discrete or NP hard. In this paper, the HGA is used to tackle the neural network (NN) topology as well as the fuzzy logic controller for the dynamic CU allocation scheme in wireless cellular networks. Therefore, we propose a new efficient HGA CUs Allocation (HGACA) in cellular networks. It aims to efficiently satisfy the diverse quality-of-service (QoS) requirements of multimedia traffic. The results show our algorithm has a lower blocking rate, lower dropping rate, less update overhead, and shorter channel-acquisition delay than previous methods
A QUALITY OF SERVICE ARCHITECTURE FOR RESOURCE PROVISIONING AND RATE CONTROL ...ijasuc
Prioritized flow control is a type of QoS provisioning in which each class is provided a different QoS by
assigning priority to one class over another in terms of allocating resources. It is an effective means to
provide service differentiation to different class of service in mobile ad hoc networks. So the objective is to
achieve a desired level of service to high-priority flows so that the wireless medium is completely utilized
using adaptive rate control. In this paper, we propose to design QoS architecture for Bandwidth
Management and Rate Control in MANET. Our proposed QoS architecture contains an adaptive
bandwidth management technique which measures the available bandwidth at each node in real-time and
it is then propagated on demand by the QoS routing protocol. The source nodes perform call admission
control for different priority of flows based on the bandwidth information provided by the QoS routing.
The network bandwidth utilization is monitored continuously and network congestion is detected in
advance. Then a rate control mechanism is used to regulate best-effort traffic.
Destination Aware APU Strategy for Geographic Routing in MANETEditor IJCATR
In this paper, we have explained the Enhanced Adaptive Position Update strategy for geographic routing in mobile ad hoc
network In Adaptive Position Update strategy, there are two techniques: Mobility prediction rule and On-demand learning rule. Proposed
system is based on the destination aware routing in which path to transfer the data over the network is based on the distance from highly
stable node to the destination node. Results of the proposed system are compared with Periodic Beaconing on the basis of packet delivery
ratio, beacon overhead, energy consumption. Experiment results show a high improvement in results on the parameters energy
consumption, packet delivery ratio and beacon overhead. Proposed work is implemented on the NS2 (Network Simulator) Environment
to perform experiments.
PARTIAL HARQ RETRANSMISSION FOR BROADCAST IN FADING CHANNELScsandit
In this paper, we study the feasibility of a hybrid scheduling approach for broadcast systems in frequency selective fading channels. The hybrid scheduling approach consists of two
components: a first broadcast component and a second unicast component. The unicast component is activated if the mobile fails to correctly decode the packet and thus sends back a
negative acknowledge to the base station. In this paper, we show that there is an optimal modulation and coding schemeto be used for each one of the components presented. The
broadcast optimal modulation and coding scheme depends on the best alignment in fading between different receivers. On the other hand, the unicast optimal modulation and coding
scheme depends on the particular fading profile of each mobile separately.
A Review on Geographical Location Based Energy Efficient Direction Restricted...IJRES Journal
Delay Tolerant Network (DTNs) is a wireless network that experiences frequent connectivity and due to mobility of nodes long duration partitions occurred during transmission of data. DTN has the main feature that there is not full path present from source to destination. In Delay Tolerant Network (DTN), traditional routing protocol for mobile Ad-hoc protocol to be ineffective to extend of message transmission between different nodes. Delay tolerant networks (DTNs) are used in many applications like in deep space communications, under water Acoustic Network, Sparsely Populated Areas Networks Etc. In such network a routing with minimum energy congumption is major issue. In this paper, we try to explore a routing issue in DTN. First energy requirement and routing with their corresponding countermeasures in DTN are explained. Moving nodes in DTN keep the updating of network as well energy at every stage. By using the geographical concept the location of each node is maintained by updating in topology. There are many routing protocols are available for routing purpose in DTN.
A scalable and power efficient solution for routing in mobile ad hoc network ...ijmnct
Mobile Ad Hoc Network (MANET) is a very dynamic and infrastructure-less ad hoc network. The actual
network size depends on the application and the protocols developed for the routing for this kind of
networks should be scalable. MANET is a resource limited network and therefore the developed routing
algorithm for packet transmission should be power and bandwidth efficient. These kinds of dynamic
networks should operate with minimal management overhead. The management functionality of the
network increases with number of nodes and reduces the performance of the network. Here, in this paper,
we have designed all identical nodes in the cluster except the cluster head and this criterion reduces the
management burden on the network. Graph theoretic routing algorithm is used to develop route for packet
transmission by using the minimum resources. In this paper, we developed routing algorithm for cluster
based MANET and finds a path from source to destination using minimum cumulative degree path. Our
simulation results show that this routing algorithm provide efficient routing path with the increasing
number of nodes and uses multi-hop connectivity for intra-cluster to utilize minimum power for packet
transmission irrespective of number of nodes in the network.
Congestion Control in Wireless Sensor Networks- An overview of Current TrendsEditor IJCATR
In WSN congestion occurs when traffic load exceeds the capacity available at any point in a network. Congestion
acts an important role in degrading the performance of the network or failure of the network. So it is essential to detect and
control the congestion in the entire WSN. Thus one can improve the performance of the network. Different factors are involved
in the congestion; the main factor is buffer over flow, packet loss, lowers network throughput and energy wastage. To address
this challenge this is essential for a distributed algorithm that mitigate congestion and allocate appropriate source rate to a sink
node for wireless sensor network. This paper gives some ideas how to control and manage the congestion in a wireless sensor
network.
DYNAMIC CONGESTION CONTROL IN WDM OPTICAL NETWORKcscpconf
This paper is based on Wavelength Division Multiplexing (WDM) optical networking. In this optical networking, prior to data transfer, lightpath establishment between source and
destination nodes is usually carried out through a wavelength reservation protocol. This wavelength is reserved corresponding to a route between the source and destination and the
route is chosen following any standard routing protocol based on shortest path. The backward reservation protocol is implemented initially. A fixed connected and weighted network is
considered. The inputs of this implementation are the fixed network itself and its corresponding shortest path matrix. After this initial level of implementation, the average node usage over a time period is calculated and various thresholds for node usage are considered. Above threshold value, request arriving at that path selects its next shortest path. This concept is
implemented on various wavelengths. The output represents the performance issues of dynamic congestion control.
Quadrant Based DIR in CWin Adaptation Mechanism for Multihop Wireless NetworkIJCI JOURNAL
In Multihop Wireless Networks, traffic forwarding capability of each node varies according to its level of contention. Each node can yield its channel access opportunity to its neighbouring nodes, so that all the nodes can evenly share the channel and have similar forwarding capability. In this manner the wireless channel is utilized effectively, which is achieved using Contention Window Adaptation Mechanism (CWAM). This mechanism achieves a higher end-to-end throughout but consumes the network power to a higher level. So, a newly proposed algorithm Quadrant- Based Directional Routing Protocol (Q-DIR) is implemented as a cross-layer with CWAM, to reduce the total network power consumption through limited flooding and also reduce the routing overheads, which eventually increases overall network throughput. This algorithm limits the broadcast region to a quadrant where the source node and the destination nodes are located. Implementation of the algorithm is done in Linux based NS-2 simulator
Self-Pruning based Probabilistic Approach to Minimize Redundancy Overhead for...IJCNCJournal
The Broadcast storm problem causes severe interference, intense collision and channel contention, which greatly degrades the QoS performance metrics of the routing protocols. So, we suggest a neighbourhood coverage knowledge probabilistic broadcasting model (NCKPB) integrating with AODV protocol with knowledge on 2-hop neighbourhood coverage; a connectivity function to control a node’s forwarding probability of retransmission to alleviate significant overhead redundancy. Our objective is to minimize the broadcast RREQ overhead while ensuring fair retransmission bandwidth. We considered two more important measures called Saved Rebroadcast and Reachability. The outcomes of NCKPB, Fixed probability (FP) and Flooding (FL) routing schemes are examined under three major operating conditions, such as node density, mobility and traffic load. The NS-2 results demonstrate the efficacy of the proposed NCKPB model by illustrating its performance superiority over all key metrics such as redundancy overhead, end to end latency, throughput, reachability, saved rebroadcast and collision contrast to FP and FL.
A comparative study in wireless sensor networksijwmn
Sensor networks consist of a large number of small, low-powered wireless nodes with limited computation,
communication, and sensing abilities, in a battery-powered sensor network, energy and communication
bandwidth are a precious resources. Thus, there is a need to adapt the networking process to match the
application in order to minimize the resources consumed and extend the life of the network. In this paper,
we introduce a comparative study in different routing algorithms that propose vital solutions to the most
important issues that should be taken into account when designing wireless network which are reliability,
lifetime, communication bandwidth, transmission rand, and finally the limited energy issue, so we will
introduce their algorithms and discuss how did they propose to solve such of these challenges and finally
we will do some evaluation to each approach.
EFFICIENT PACKET DELIVERY APPROACH FOR ADHOC WIRELESS NETWORKS cscpconf
A wireless ad-hoc network is a collection of nodes which are selfconfiguring,
connected by wireless links. The nodes are free to move randomly and
organize themselves arbitrarily; thus, the network's topology may change rapidly and
unpredictably. These kinds of networks are very flexible and they do not require any
existing infrastructure. Therefore, ad-hoc wireless networks are suitable for temporary
communication links. The biggest challenge in these kinds of networks is to find a path
between the communication end points of nodes that are mobile. Due to the limited
transmission range of wireless interfaces, the communication traffic has to be relayed
over several intermediate nodes to enable the communication between two nodes.
Therefore, these kinds of networks are also called multi-hop ad-hoc networks. The
proposed model is designed to improve the problems of real-time event-based
communication. It improves the packet delivery ratio by prior prediction and reduces
end-to-end packet delay. This in turn improves performance of the routing process
significantly and increases the Quality of Service (QoS).
Qo s oriented distributed routing protocols : anna university 2nd review pptAAKASH S
To find a QoS path between source and destination, Which satisfies
The QoS requirements for each admitted connection and
Optimizes the use of network resources
Quality encompasses the data loss, latency, jitter, efficient use of network resources,..
QoS mechanisms for unfairness: managing queuing behavior, shaping traffic, control admission, routing, …
Usually, a hybrid network has widespread base stations
The data transmission in hybrid networks has two features:
An AP can be a source or a destination to any mobile node
It allows a stream to have anycast transmission along multiple transmission paths to its destination through base stations
The number of transmission hops between a mobile node and an AP is small
It enables a source node to connect to an AP through an intermediate node
In this paper introduce the QoS-Oriented Distributed routing protocol(QOD)
This QOD protocol makes five contributions:
QoS-guaranteed neighbor selection algorithm
Distributed packet scheduling algorithm
Mobility-based segment resizing algorithm
Soft-deadline based forwarding scheduling algorithm
Data redundancy elimination based transmission
A Low Overhead Reachability Guaranteed Dynamic Route Discovery Mechanism for ...ijasuc
A crucial issue for a mobile ad hoc network is the handling of a large number of nodes. As more nodes join
the mobile ad hoc network, contention and congestion are more likely. The on demand routing protocols
which broadcasts control packets to discover routes to the destination nodes, generate a high number of
broadcast packets in a larger networks causing contention and collision. We propose an efficient route
discovery protocol, which reduces the number of broadcast packet, using controlled flooding technique.
The simulation results show that the proposed probabilistic flooding decreases the number of control
packets floating in the network during route discovery phase, without lowering the success ratio of path
discoveries. Furthermore, the proposed method adapts to the normal network conditions. The results show
that up to 70% of control packet traffic is saved in route discovery phase when the network is denser.
SECONDARY USER UNDERCOVER COOPERATIVE DYNAMIC ACCESS PROTOCOL FOR OVERLAY COG...ijmnct
A secondary cooperative overlay dynamic spectrum access protocol in cognitive radio networks is proposed, allowing secondary users to access the primary system using full power without causing harmful
interference to primary users. Moreover, an enhancement in the primary system will be achieved as a result of secondary relaying of primary messages. A detailed description of the protocol is given and illustrated with network scenarios.
SECONDARY USER UNDERCOVER COOPERATIVE DYNAMIC ACCESS PROTOCOL FOR OVERLAY CO...ijmnct
A secondary cooperative overlay dynamic spectrum access protocol in cognitive radio networks is proposed, allowing secondary users to access the primary system using full power without causing harmful interference to primary users. Moreover, an enhancement in the primary system will be achieved as a result of secondary relaying of primary messages. A detailed description of the protocol is given and illustrated with network scenarios.
EFFICIENT BROADCASTING MECHANISMS FOR DATA DISSEMINATION IN VEHICULAR AD HOC ...ijmnct
Broadcasting is the process of sending a message from one node to all other nodes in an ad hoc network. It
is a fundamental operation for communication in ad hoc networks as it allows for the update of network
information, route discovery and other operations as well. In this paper, we review the pros and cons of
different broadcasting methods in VANET. Also, the broadcast storm problem and broadcast suppression
techniques for broadcasting in Vehicular Ad hoc Networks (VANET) are discussed, because blindly
broadcasting the packets cause several problems that affect the quality of service in VANET. In order to
avoid broadcast storm problem this paper provides a survey of some of the existing broadcast suppression
techniques in vehicular environment
Broadcast Scheduling Protocols in Multi-Hop Mobile Ad hoc NetworksIJCNCJournal
When packets are sending in multi-hop mobile unintended networks numerous problems occur like flooding, rebroadcast, broadcast latency, power conservation and collision. If multiple transmission of packets simultaneously in MANETs that using the slot assignments approach, when additional channels are transmitting at the same time as the first slot allocations, interference may occur at the nodes. Because of the multi-hops data transfer, the network performance is hampered by the constrained bandwidth and therefore the self-initiated topological alterations. Therefore, a broadcast algorithm is important within the mobile ad hoc network for collision control and reliable communication. This paper proposes two new broadcasting protocols: modify SRBS and DSB algorithms. The planned algorithms outperform context of efficiency, reliability, traffic overload and reachability in highly mobile networks is an enhanced performance within the different environments. Evaluation of simulation results with other well-known exiting protocols as DFCN and PEGSP algorithms shows that the proposed protocol performance is best within the wireless network and channel bandwidths are well utilized within the network.
BROADCAST SCHEDULING PROTOCOLS IN MULTIHOP MOBILE AD HOC NETWORKSIJCNCJournal
When packets are sending in multi-hop mobile unintended networks numerous problems occur like
flooding, rebroadcast, broadcast latency, power conservation and collision. If multiple transmission of
packets simultaneously in MANETs that using the slot assignments approach, when additional channels are
transmitting at the same time as the first slot allocations, interference may occur at the nodes. Because of
the multi-hops data transfer, the network performance is hampered by the constrained bandwidth and
therefore the self-initiated topological alterations. Therefore, a broadcast algorithm is important within the
mobile ad hoc network for collision control and reliable communication. This paper proposes two new
broadcasting protocols: modify SRBS and DSB algorithms. The planned algorithms outperform context of
efficiency, reliability, traffic overload and reachability in highly mobile networks is an enhanced
performance within the different environments. Evaluation of simulation results with other well-known
exiting protocols as DFCN and PEGSP algorithms shows that the proposed protocol performance is best
within the wireless network and channel bandwidths are well utilized within the network.
Hierarchical Genetic Algorithm For Dynamic Channel Units Allocation in TD-CDM...ijwmn
Hierarchical Genetic Algorithms (HGA) as a tool for search and optimizing methodology have now reached a mature stage. The minimum resource facility to carry user traffic, termed a channel unit (CU), is composed of a one time-slot and one code in the TD-CDMA/TDD system. The control of the number of CUs depends on the traffic load solves varied and asymmetrical traffic problems in the 3G system. In a cellular network, the call arrival rate, call duration and the communication overhead between the base stations and the control center are vague and uncertain, regardless of whether the criteria of concern are nonlinear, constrained, discrete or NP hard. In this paper, the HGA is used to tackle the neural network (NN) topology as well as the fuzzy logic controller for the dynamic CU allocation scheme in wireless cellular networks. Therefore, we propose a new efficient HGA CUs Allocation (HGACA) in cellular networks. It aims to efficiently satisfy the diverse quality-of-service (QoS) requirements of multimedia traffic. The results show our algorithm has a lower blocking rate, lower dropping rate, less update overhead, and shorter channel-acquisition delay than previous methods
A QUALITY OF SERVICE ARCHITECTURE FOR RESOURCE PROVISIONING AND RATE CONTROL ...ijasuc
Prioritized flow control is a type of QoS provisioning in which each class is provided a different QoS by
assigning priority to one class over another in terms of allocating resources. It is an effective means to
provide service differentiation to different class of service in mobile ad hoc networks. So the objective is to
achieve a desired level of service to high-priority flows so that the wireless medium is completely utilized
using adaptive rate control. In this paper, we propose to design QoS architecture for Bandwidth
Management and Rate Control in MANET. Our proposed QoS architecture contains an adaptive
bandwidth management technique which measures the available bandwidth at each node in real-time and
it is then propagated on demand by the QoS routing protocol. The source nodes perform call admission
control for different priority of flows based on the bandwidth information provided by the QoS routing.
The network bandwidth utilization is monitored continuously and network congestion is detected in
advance. Then a rate control mechanism is used to regulate best-effort traffic.
Destination Aware APU Strategy for Geographic Routing in MANETEditor IJCATR
In this paper, we have explained the Enhanced Adaptive Position Update strategy for geographic routing in mobile ad hoc
network In Adaptive Position Update strategy, there are two techniques: Mobility prediction rule and On-demand learning rule. Proposed
system is based on the destination aware routing in which path to transfer the data over the network is based on the distance from highly
stable node to the destination node. Results of the proposed system are compared with Periodic Beaconing on the basis of packet delivery
ratio, beacon overhead, energy consumption. Experiment results show a high improvement in results on the parameters energy
consumption, packet delivery ratio and beacon overhead. Proposed work is implemented on the NS2 (Network Simulator) Environment
to perform experiments.
PARTIAL HARQ RETRANSMISSION FOR BROADCAST IN FADING CHANNELScsandit
In this paper, we study the feasibility of a hybrid scheduling approach for broadcast systems in frequency selective fading channels. The hybrid scheduling approach consists of two
components: a first broadcast component and a second unicast component. The unicast component is activated if the mobile fails to correctly decode the packet and thus sends back a
negative acknowledge to the base station. In this paper, we show that there is an optimal modulation and coding schemeto be used for each one of the components presented. The
broadcast optimal modulation and coding scheme depends on the best alignment in fading between different receivers. On the other hand, the unicast optimal modulation and coding
scheme depends on the particular fading profile of each mobile separately.
A Review on Geographical Location Based Energy Efficient Direction Restricted...IJRES Journal
Delay Tolerant Network (DTNs) is a wireless network that experiences frequent connectivity and due to mobility of nodes long duration partitions occurred during transmission of data. DTN has the main feature that there is not full path present from source to destination. In Delay Tolerant Network (DTN), traditional routing protocol for mobile Ad-hoc protocol to be ineffective to extend of message transmission between different nodes. Delay tolerant networks (DTNs) are used in many applications like in deep space communications, under water Acoustic Network, Sparsely Populated Areas Networks Etc. In such network a routing with minimum energy congumption is major issue. In this paper, we try to explore a routing issue in DTN. First energy requirement and routing with their corresponding countermeasures in DTN are explained. Moving nodes in DTN keep the updating of network as well energy at every stage. By using the geographical concept the location of each node is maintained by updating in topology. There are many routing protocols are available for routing purpose in DTN.
A scalable and power efficient solution for routing in mobile ad hoc network ...ijmnct
Mobile Ad Hoc Network (MANET) is a very dynamic and infrastructure-less ad hoc network. The actual
network size depends on the application and the protocols developed for the routing for this kind of
networks should be scalable. MANET is a resource limited network and therefore the developed routing
algorithm for packet transmission should be power and bandwidth efficient. These kinds of dynamic
networks should operate with minimal management overhead. The management functionality of the
network increases with number of nodes and reduces the performance of the network. Here, in this paper,
we have designed all identical nodes in the cluster except the cluster head and this criterion reduces the
management burden on the network. Graph theoretic routing algorithm is used to develop route for packet
transmission by using the minimum resources. In this paper, we developed routing algorithm for cluster
based MANET and finds a path from source to destination using minimum cumulative degree path. Our
simulation results show that this routing algorithm provide efficient routing path with the increasing
number of nodes and uses multi-hop connectivity for intra-cluster to utilize minimum power for packet
transmission irrespective of number of nodes in the network.
Congestion Control in Wireless Sensor Networks- An overview of Current TrendsEditor IJCATR
In WSN congestion occurs when traffic load exceeds the capacity available at any point in a network. Congestion
acts an important role in degrading the performance of the network or failure of the network. So it is essential to detect and
control the congestion in the entire WSN. Thus one can improve the performance of the network. Different factors are involved
in the congestion; the main factor is buffer over flow, packet loss, lowers network throughput and energy wastage. To address
this challenge this is essential for a distributed algorithm that mitigate congestion and allocate appropriate source rate to a sink
node for wireless sensor network. This paper gives some ideas how to control and manage the congestion in a wireless sensor
network.
DYNAMIC CONGESTION CONTROL IN WDM OPTICAL NETWORKcscpconf
This paper is based on Wavelength Division Multiplexing (WDM) optical networking. In this optical networking, prior to data transfer, lightpath establishment between source and
destination nodes is usually carried out through a wavelength reservation protocol. This wavelength is reserved corresponding to a route between the source and destination and the
route is chosen following any standard routing protocol based on shortest path. The backward reservation protocol is implemented initially. A fixed connected and weighted network is
considered. The inputs of this implementation are the fixed network itself and its corresponding shortest path matrix. After this initial level of implementation, the average node usage over a time period is calculated and various thresholds for node usage are considered. Above threshold value, request arriving at that path selects its next shortest path. This concept is
implemented on various wavelengths. The output represents the performance issues of dynamic congestion control.
Quadrant Based DIR in CWin Adaptation Mechanism for Multihop Wireless NetworkIJCI JOURNAL
In Multihop Wireless Networks, traffic forwarding capability of each node varies according to its level of contention. Each node can yield its channel access opportunity to its neighbouring nodes, so that all the nodes can evenly share the channel and have similar forwarding capability. In this manner the wireless channel is utilized effectively, which is achieved using Contention Window Adaptation Mechanism (CWAM). This mechanism achieves a higher end-to-end throughout but consumes the network power to a higher level. So, a newly proposed algorithm Quadrant- Based Directional Routing Protocol (Q-DIR) is implemented as a cross-layer with CWAM, to reduce the total network power consumption through limited flooding and also reduce the routing overheads, which eventually increases overall network throughput. This algorithm limits the broadcast region to a quadrant where the source node and the destination nodes are located. Implementation of the algorithm is done in Linux based NS-2 simulator
Self-Pruning based Probabilistic Approach to Minimize Redundancy Overhead for...IJCNCJournal
The Broadcast storm problem causes severe interference, intense collision and channel contention, which greatly degrades the QoS performance metrics of the routing protocols. So, we suggest a neighbourhood coverage knowledge probabilistic broadcasting model (NCKPB) integrating with AODV protocol with knowledge on 2-hop neighbourhood coverage; a connectivity function to control a node’s forwarding probability of retransmission to alleviate significant overhead redundancy. Our objective is to minimize the broadcast RREQ overhead while ensuring fair retransmission bandwidth. We considered two more important measures called Saved Rebroadcast and Reachability. The outcomes of NCKPB, Fixed probability (FP) and Flooding (FL) routing schemes are examined under three major operating conditions, such as node density, mobility and traffic load. The NS-2 results demonstrate the efficacy of the proposed NCKPB model by illustrating its performance superiority over all key metrics such as redundancy overhead, end to end latency, throughput, reachability, saved rebroadcast and collision contrast to FP and FL.
A comparative study in wireless sensor networksijwmn
Sensor networks consist of a large number of small, low-powered wireless nodes with limited computation,
communication, and sensing abilities, in a battery-powered sensor network, energy and communication
bandwidth are a precious resources. Thus, there is a need to adapt the networking process to match the
application in order to minimize the resources consumed and extend the life of the network. In this paper,
we introduce a comparative study in different routing algorithms that propose vital solutions to the most
important issues that should be taken into account when designing wireless network which are reliability,
lifetime, communication bandwidth, transmission rand, and finally the limited energy issue, so we will
introduce their algorithms and discuss how did they propose to solve such of these challenges and finally
we will do some evaluation to each approach.
EFFICIENT PACKET DELIVERY APPROACH FOR ADHOC WIRELESS NETWORKS cscpconf
A wireless ad-hoc network is a collection of nodes which are selfconfiguring,
connected by wireless links. The nodes are free to move randomly and
organize themselves arbitrarily; thus, the network's topology may change rapidly and
unpredictably. These kinds of networks are very flexible and they do not require any
existing infrastructure. Therefore, ad-hoc wireless networks are suitable for temporary
communication links. The biggest challenge in these kinds of networks is to find a path
between the communication end points of nodes that are mobile. Due to the limited
transmission range of wireless interfaces, the communication traffic has to be relayed
over several intermediate nodes to enable the communication between two nodes.
Therefore, these kinds of networks are also called multi-hop ad-hoc networks. The
proposed model is designed to improve the problems of real-time event-based
communication. It improves the packet delivery ratio by prior prediction and reduces
end-to-end packet delay. This in turn improves performance of the routing process
significantly and increases the Quality of Service (QoS).
Qo s oriented distributed routing protocols : anna university 2nd review pptAAKASH S
To find a QoS path between source and destination, Which satisfies
The QoS requirements for each admitted connection and
Optimizes the use of network resources
Quality encompasses the data loss, latency, jitter, efficient use of network resources,..
QoS mechanisms for unfairness: managing queuing behavior, shaping traffic, control admission, routing, …
Usually, a hybrid network has widespread base stations
The data transmission in hybrid networks has two features:
An AP can be a source or a destination to any mobile node
It allows a stream to have anycast transmission along multiple transmission paths to its destination through base stations
The number of transmission hops between a mobile node and an AP is small
It enables a source node to connect to an AP through an intermediate node
In this paper introduce the QoS-Oriented Distributed routing protocol(QOD)
This QOD protocol makes five contributions:
QoS-guaranteed neighbor selection algorithm
Distributed packet scheduling algorithm
Mobility-based segment resizing algorithm
Soft-deadline based forwarding scheduling algorithm
Data redundancy elimination based transmission
A Low Overhead Reachability Guaranteed Dynamic Route Discovery Mechanism for ...ijasuc
A crucial issue for a mobile ad hoc network is the handling of a large number of nodes. As more nodes join
the mobile ad hoc network, contention and congestion are more likely. The on demand routing protocols
which broadcasts control packets to discover routes to the destination nodes, generate a high number of
broadcast packets in a larger networks causing contention and collision. We propose an efficient route
discovery protocol, which reduces the number of broadcast packet, using controlled flooding technique.
The simulation results show that the proposed probabilistic flooding decreases the number of control
packets floating in the network during route discovery phase, without lowering the success ratio of path
discoveries. Furthermore, the proposed method adapts to the normal network conditions. The results show
that up to 70% of control packet traffic is saved in route discovery phase when the network is denser.
SECONDARY USER UNDERCOVER COOPERATIVE DYNAMIC ACCESS PROTOCOL FOR OVERLAY COG...ijmnct
A secondary cooperative overlay dynamic spectrum access protocol in cognitive radio networks is proposed, allowing secondary users to access the primary system using full power without causing harmful
interference to primary users. Moreover, an enhancement in the primary system will be achieved as a result of secondary relaying of primary messages. A detailed description of the protocol is given and illustrated with network scenarios.
SECONDARY USER UNDERCOVER COOPERATIVE DYNAMIC ACCESS PROTOCOL FOR OVERLAY CO...ijmnct
A secondary cooperative overlay dynamic spectrum access protocol in cognitive radio networks is proposed, allowing secondary users to access the primary system using full power without causing harmful interference to primary users. Moreover, an enhancement in the primary system will be achieved as a result of secondary relaying of primary messages. A detailed description of the protocol is given and illustrated with network scenarios.
EFFICIENT BROADCASTING MECHANISMS FOR DATA DISSEMINATION IN VEHICULAR AD HOC ...ijmnct
Broadcasting is the process of sending a message from one node to all other nodes in an ad hoc network. It
is a fundamental operation for communication in ad hoc networks as it allows for the update of network
information, route discovery and other operations as well. In this paper, we review the pros and cons of
different broadcasting methods in VANET. Also, the broadcast storm problem and broadcast suppression
techniques for broadcasting in Vehicular Ad hoc Networks (VANET) are discussed, because blindly
broadcasting the packets cause several problems that affect the quality of service in VANET. In order to
avoid broadcast storm problem this paper provides a survey of some of the existing broadcast suppression
techniques in vehicular environment
Broadcast Scheduling Protocols in Multi-Hop Mobile Ad hoc NetworksIJCNCJournal
When packets are sending in multi-hop mobile unintended networks numerous problems occur like flooding, rebroadcast, broadcast latency, power conservation and collision. If multiple transmission of packets simultaneously in MANETs that using the slot assignments approach, when additional channels are transmitting at the same time as the first slot allocations, interference may occur at the nodes. Because of the multi-hops data transfer, the network performance is hampered by the constrained bandwidth and therefore the self-initiated topological alterations. Therefore, a broadcast algorithm is important within the mobile ad hoc network for collision control and reliable communication. This paper proposes two new broadcasting protocols: modify SRBS and DSB algorithms. The planned algorithms outperform context of efficiency, reliability, traffic overload and reachability in highly mobile networks is an enhanced performance within the different environments. Evaluation of simulation results with other well-known exiting protocols as DFCN and PEGSP algorithms shows that the proposed protocol performance is best within the wireless network and channel bandwidths are well utilized within the network.
BROADCAST SCHEDULING PROTOCOLS IN MULTIHOP MOBILE AD HOC NETWORKSIJCNCJournal
When packets are sending in multi-hop mobile unintended networks numerous problems occur like
flooding, rebroadcast, broadcast latency, power conservation and collision. If multiple transmission of
packets simultaneously in MANETs that using the slot assignments approach, when additional channels are
transmitting at the same time as the first slot allocations, interference may occur at the nodes. Because of
the multi-hops data transfer, the network performance is hampered by the constrained bandwidth and
therefore the self-initiated topological alterations. Therefore, a broadcast algorithm is important within the
mobile ad hoc network for collision control and reliable communication. This paper proposes two new
broadcasting protocols: modify SRBS and DSB algorithms. The planned algorithms outperform context of
efficiency, reliability, traffic overload and reachability in highly mobile networks is an enhanced
performance within the different environments. Evaluation of simulation results with other well-known
exiting protocols as DFCN and PEGSP algorithms shows that the proposed protocol performance is best
within the wireless network and channel bandwidths are well utilized within the network.
Optimize the Network Coding Paths to Enhance the Coding Protection in Wireles...IJCNCJournal
Efficient protection techniques for multimedia data transfer over Wireless Sensor Network (WSN) are very essential issues. In noisy Wireless Multimedia Sensor Networks (WMSN) Quality of Service (QoS) is a challenging task due to bandwidth and limited energy, and unpredictable channel conditions. Therefore, Forward Error Correction (FEC), a class of channel coding has been widely used in WSN. Nevertheless, the bulky size of multimedia data makes it more difficult to be transported over the noisy multi-hop wireless network. Moreover, the efficiency of FEC drops as the number of hops increases. In this paper, an optimized protection technique based on network coding and rateless code has been proposed to enhance the throughput and reduce overhead during data transfer in WMSN. The performance of NCP-OPR is enhanced via Optimal Network Path Model (ONPM) where the best available paths are optimally selected using Particle Swarm Optimization (PSO). In conjunction with the proposed protection scheme, the proposed ONPM is intended for limited power WSN by optimally distributing the power usage among the network paths so that the throughput can be improved.
Optimize the Network Coding Paths to Enhance the Coding Protection in Wireles...IJCNCJournal
Efficient protection techniques for multimedia data transfer over Wireless Sensor Network (WSN) are very essential issues. In noisy Wireless Multimedia Sensor Networks (WMSN) Quality of Service (QoS) is a challenging task due to bandwidth and limited energy, and unpredictable channel conditions. Therefore, Forward Error Correction (FEC), a class of channel coding has been widely used in WSN. Nevertheless, the bulky size of multimedia data makes it more difficult to be transported over the noisy multi-hop wireless network. Moreover, the efficiency of FEC drops as the number of hops increases. In this paper, an optimized protection technique based on network coding and rateless code has been proposed to enhance the throughput and reduce overhead during data transfer in WMSN. The performance of NCP-OPR is enhanced via Optimal Network Path Model (ONPM) where the best available paths are optimally selected using Particle Swarm Optimization (PSO). In conjunction with the proposed protection scheme, the proposed ONPM is intended for limited power WSN by optimally distributing the power usage among the network paths so that the throughput can be improved.
Energy Saving DSR and Probabilistic Rebroadcast Mechanism are used to Increas...IJTET Journal
Abstract- MANETs are infrastructure less and can be set up anytime anywhere. Due to high mobility of nodes in mobile ad hoc networks (MANETs), there exist frequent link breakages which lead to frequent path failures and route discoveries. The overhead of a route discovery cannot be neglected. In a route discovery, broadcasting is a fundamental and effective data broadcasting mechanism, where a mobile node blindly rebroadcasts the first received route request packets unless it has a route to the destination, and thus it causes the broadcast storm problem and without consider the nodes energy level of route selection it leads to reduce the network lifetime. In this paper proposed to focus is on a two mechanism ESDSR and Neighbor coverage based Probabilistic rebroadcast to overcome those problems. A Energy Saving Dynamic Source Routing in MANETs (ESDSR) which will efficiently utilize the battery power consideration in the route selection time of mobile nodes in such a way that the network will get more life time and Neighbor coverage based Probabilistic rebroadcast mechanism, which can significantly decrease the number of retransmissions so as to reduce the routing overhead, and can also improve the routing performance. The simulation was carried out using the NS-2 network simulator.
An optimistic sector oriented approach to mitigate broadcast storm problem in...IAEME Publication
In mobile ad hoc networks (MANETs), due to frequent changes in topology there exist more
link breakages which lead to high rate of path failures and route discoveries, which cause an
increased routing control overhead. Thus, it is necessary to reduce the overhead of route discovery in
the design of routing protocols for MANETs. In a route discovery, broadcasting may be an
elementary and effective data dissemination mechanism, wherever a mobile node blindly
rebroadcasts the first received route request packets unless it has a route to the destination, and
therefore it causes the broadcast storm problem. This paper proposes an optimistic approach OpSOA
to mitigate the broadcasting storm problem and to scale back the communication overheads of
routing protocols by forming sectors within the network and finding the route to destination by two
sectors at a time. The simulation result shows that the proposed mechanism substantially reduces
route requests. Since the proposed protocol searches for the destination sector wise thereby reducing
network wide broadcast of routing requests, traffic, collision and contention. There by there can be
an increase in the packet delivery ratio and decrease in the average end-to-end delay
Hexagonal based Clustering for Reducing Rebroadcasts in Mobile Ad Hoc NetworksIJTET Journal
Abstract— In mobile ad hoc networks multihop routing is performed in order to communicate the packets from the source to destination. The nodes within these networks are dynamic due which frequent path change occurs which can cause frequent link breakages and induces route discoveries. These route discoveries can introduce overhead in terms of contention, collision and rebroadcasts which are non-negligible. Here, the paper discusses a hexagonal based clustering for reducing rebroadcasts thus maximizing the lifetime of the networks and providing coverage area thus reducing the end – end delays.
Mobile environment pretense a number of novel
theoretical and optimization issues such as position, operation
and following in that a lot of requests rely on them for
desirable information. The precedent works are sprinkled
across the entire network layer: from the medium of physical
to link layer to routing and then application layer. In this
invention, we present outline solutions in Medium Access
Control (MAC), data distribution, coverage resolve issues
under mobile ad-hoc network environment based on
congestion control technique using Transmission Control
Protocol (TCP). In mobile ad-hoc network issues can arise
such as link disconnections, channel contention and recurrent
path loss. To resolve this issue, we propose a Cross Layer
based Hybrid fuzzy ad-hoc rate based Congestion Control
(CLHCC) approach to maximize network performance. Based
on the destination report it regulates the speed of data flow to
control data loss by monitoring the present network status
and transmits this report to the source as advice. The source
adjusts the sending flow rate as per the advice. This is
monitored by channel usage, ultimate delay, short term
throughput.
Congestion Prediction and Adaptive Rate Adjustment Technique for Wireless Sen...IJORCS
In general, nodes in Wireless Sensor Networks (WSNs) are equipped with limited battery and computation capabilities but the occurrence of congestion consumes more energy and computation power by retransmitting the data packets. Thus, congestion should be regulated to improve network performance. In this paper, we propose a congestion prediction and adaptive rate adjustment technique for Wireless Sensor Networks. This technique predicts congestion level using fuzzy logic system. Node degree, data arrival rate and queue length are taken as inputs to the fuzzy system and congestion level is obtained as an outcome. When the congestion level is amidst moderate and maximum ranges, adaptive rate adjustment technique is triggered. Our technique prevents congestion by controlling data sending rate and also avoids unsolicited packet losses. By simulation, we prove the proficiency our technique. It increases system throughput and network performance significantly.
Mtadf multi hop traffic aware data for warding for congestion control in wir...ijwmn
In the past few years there is a remarkable change in the field of wireless sensor networks. Congestion occurs when there is a heavy traffic in the network. The heavy traffic in the network leads to wastage of energy and packet loss. Traffic Aware Dynamic Routing algorithm mitigates congestion by using one hop neighbor routing, hence throughput of the network is low. This paper proposed a Multi hop based Data Forwarding Technique to mitigate congestion. Queue length field and depth potential field play a major role to divert the traffic in the network to the alternate paths. The high traffic load leads to data queue overflow in the sensor nodes, these results in loss of important information about important events. Multi hop Traffic-Aware Dynamic Routing algorithm addresses congestion using depth potential field and queue length potential field. The algorithm forwards data packets around the congestion areas and scatters the excessive along multiple paths. The nodes with less load are efficiently utilized in response to congestion. The main aspect of the algorithm is to construct two independent potential fields using depth and queue length. Queue length field solves the traffic-aware problem. Depth field creates a backbone to forward packets to the sink. Both fields are combined to yield a hybrid potential field to make dynamic decision for data forwarding. Simulations are conducted to evaluate the performance of our proposed algorithm and our proposed scheme performs better compared to previous work.
Channel feedback scheduling for wireless communicationseSAT Journals
Abstract Opportunistic scheduling can significantly improve wireless network performance by exploiting the underlying channel condition. There has been a lot of work on opportunistic scheduling, but the problem of finding the right feedback mechanism to convey channel information has largely been untouched. In emerging multichannel systems, the per-channel feedback induces a substantial amount of feedback overhead and requires high computational complexity. To reduce the feedback overhead, we consider an opportunistic feedback strategy that activates the channel feedback opportunistically according to the channel condition. Then, we combine the opportunistic feedback with the best-n channel feedback scheme where a mobile user chooses the best n channels and transfers this information to the base station. We analyze the throughput and the amount of channel feedback information for proportionally fair opportunistic scheduling under Rayleigh fading i.i.d. channels. The numerical results confirm that our partial feedback schemes achieve a remarkable reduction in the amount of feedback information without significant throughput degradation, thereby saving the scarce wireless bandwidth and limited battery power.
Definitive broadcasting in vehicular ad hoc networks is the key to success for various services and applications on an intelligent transportation system. Many trusted broadcasting protocols have been proposed but none of them has been evaluated in realistic scenario. In this paper, we discuss these reliable broadcasting protocols on VANET. Basic mechanism in broadcasting, and also we are providing collective research of Broadcasting protocols in vanet in that some real time protocols with their pros cons we have studied.
Definitive broadcasting in vehicular ad hoc networks is the key to success for various services and applications on an intelligent transportation system. Many trusted broadcasting protocols have been proposed but none of them has been evaluated in realistic scenario. In this paper, we discuss these reliable broadcasting protocols on VANET. Basic mechanism in broadcasting, and also we are providing collective research of Broadcasting protocols in vanet in that some real time protocols with their pros cons we have studied.
ISSUES AND CHALLENGES IN BROADCAST STORM SUPPRESSION ALGORITHMS OF VEHICULAR ...ieijjournal
Vehicular Ad-Hoc Networks (VANETs) are the networks of vehicles which are characterized with high mobility and dynamic changing topology. Most of the communication interchanges in VANETs take place in broadcasting mode, which is supposed to be the simplest way to disseminate (spread) emergency
messages all over the vehicular network. This broadcasting technique assures the optimal delivery of emergency messages all over the VANET. However, it also results in unwanted flooding of messages which causes severe contention and collisions in VANETs leading to Broadcast Storm Problem (BSP) and in turn affects the overall performance of VANETs. A Multitude of research work have proposed Broadcast Storm
Suppression Algorithms (BSSA) to control this Broadcast Storm. These mechanisms tried to control BSP by either reducing the number of rebroadcasting/ relaying nodes or by identifying the best relay node. The suppression mechanisms help to overcome BSP to certain extent, still there is need to still reduce the number of rebroadcasting nodes in existing mechanisms and also to identify the best possible rebroadcasting node.
Issues and Challenges in Broadcast Storm Suppression Algorithms of Vehicular ...ieijjournal1
Vehicular Ad-Hoc Networks (VANETs) are the networks of vehicles which are characterized with high
mobility and dynamic changing topology. Most of the communication interchanges in VANETs take place in broadcasting mode, which is supposed to be the simplest way to disseminate (spread) emergency messages all over the vehicular network. This broadcasting technique assures the optimal delivery of emergency messages all over the VANET. However, it also results in unwanted flooding of messages which causes severe contention and collisions in VANETs leading to Broadcast Storm Problem (BSP) and in turn affects the overall performance of VANETs. A Multitude of research work have proposed Broadcast Storm Suppression Algorithms (BSSA) to control this Broadcast Storm. These mechanisms tried to control BSP by either reducing the number of rebroadcasting/ relaying nodes or by identifying the best relay node. The suppression mechanisms help to overcome BSP to certain extent, still there is need to still reduce the number of rebroadcasting nodes in existing mechanisms and also to identify the best possible rebroadcasting node. This would help to mitigate BSP completely and efficiently. This paper presents comparative analysis of various prominent BSSA in order to identify the underlying issues and challenges in controlling BSP completely. The outcome of this paper would provide the requirements for developing an efficient BSSA overcoming the identified issues and challenges.
Adaptive congestion control protocol (accp) for wireless sensor networksijwmn
In Wireless Sensor Networks (WSN) when an event is detected there is an increase in data traffic that might
lead to packets being transmitted through the network close to the packet handling capacity of the WSN.
The WSN experiences a decrease in network performance due to packet loss, long delays, and reduction in
throughput. In this paper we developed an adaptive congestion control algorithm that monitors network
utilization and adjust traffic levels and/or increases network resources to improve throughput and conserve
energy. The traffic congestion control protocol DelStatic is developed by introducing backpressure
mechanism into NOAH. We analyzed various routing protocols and established that DSR has a higher
resource congestion control capability. The proposed protocol, ACCP uses a sink switching algorithm to
trigger DelStatic or DSR feedback to a congested node based on its Node Rank. From the simulation
results, ACCP protocol does not only improve throughput but also conserves energy which is critical to
sensor application survivability on the field. Our Adaptive Congestion control achieved reliability, high
throughput and energy efficiency.
Similar to Improving data transmission in the vanet using multi criteria decision making method based on fuzzy logic (20)
ENHANCING ENGLISH WRITING SKILLS THROUGH INTERNET-PLUS TOOLS IN THE PERSPECTI...ijfcstjournal
This investigation delves into incorporating a hybridized memetic strategy within the framework of English
composition pedagogy, leveraging Internet Plus resources. The study aims to provide an in-depth analysis
of how this method influences students’ writing competence, their perceptions of writing, and their
enthusiasm for English acquisition. Employing an explanatory research design that combines qualitative
and quantitative methods, the study collects data through surveys, interviews, and observations of students’
writing performance before and after the intervention. Findings demonstrate a beneficial impact of
integrating the memetic approach alongside Internet Plus tools on the writing aptitude of English as a
Foreign Language (EFL) learners. Students reported increased engagement with writing, attributing it to
the use of Internet plus tools. They also expressed that the memetic approach facilitated a deeper
understanding of cultural and social contexts in writing. Furthermore, the findings highlight a significant
improvement in students’ writing skills following the intervention. This study provides significant insights
into the practical implementation of the memetic approach within English writing education, highlighting
the beneficial contribution of Internet Plus tools in enriching students' learning journeys.
A SURVEY TO REAL-TIME MESSAGE-ROUTING NETWORK SYSTEM WITH KLA MODELLINGijfcstjournal
Messages routing over a network is one of the most fundamental concept in communication which requires
simultaneous transmission of messages from a source to a destination. In terms of Real-Time Routing, it
refers to the addition of a timing constraint in which messages should be received within a specified time
delay. This study involves Scheduling, Algorithm Design and Graph Theory which are essential parts of
the Computer Science (CS) discipline. Our goal is to investigate an innovative and efficient way to present
these concepts in the context of CS Education. In this paper, we will explore the fundamental modelling of
routing real-time messages on networks. We study whether it is possible to have an optimal on-line
algorithm for the Arbitrary Directed Graph network topology. In addition, we will examine the message
routing’s algorithmic complexity by breaking down the complex mathematical proofs into concrete, visual
examples. Next, we explore the Unidirectional Ring topology in finding the transmission’s
“makespan”.Lastly, we propose the same network modelling through the technique of Kinesthetic Learning
Activity (KLA). We will analyse the data collected and present the results in a case study to evaluate the
effectiveness of the KLA approach compared to the traditional teaching method.
A COMPARATIVE ANALYSIS ON SOFTWARE ARCHITECTURE STYLESijfcstjournal
Software architecture is the structural solution that achieves the overall technical and operational
requirements for software developments. Software engineers applied software architectures for their
software system developments; however, they worry the basic benchmarks in order to select software
architecture styles, possible components, integration methods (connectors) and the exact application of
each style.
The objective of this research work was a comparative analysis of software architecture styles by its
weakness and benefits in order to select by the programmer during their design time. Finally, in this study,
the researcher has been identified architectural styles, weakness, and Strength and application areas with
its component, connector and Interface for the selected architectural styles.
SYSTEM ANALYSIS AND DESIGN FOR A BUSINESS DEVELOPMENT MANAGEMENT SYSTEM BASED...ijfcstjournal
A design of a sales system for professional services requires a comprehensive understanding of the
dynamics of sale cycles and how key knowledge for completing sales is managed. This research describes
a design model of a business development (sales) system for professional service firms based on the Saudi
Arabian commercial market, which takes into account the new advances in technology while preserving
unique or cultural practices that are an important part of the Saudi Arabian commercial market. The
design model has combined a number of key technologies, such as cloud computing and mobility, as an
integral part of the proposed system. An adaptive development process has also been used in implementing
the proposed design model.
AN ALGORITHM FOR SOLVING LINEAR OPTIMIZATION PROBLEMS SUBJECTED TO THE INTERS...ijfcstjournal
Frank t-norms are parametric family of continuous Archimedean t-norms whose members are also strict
functions. Very often, this family of t-norms is also called the family of fundamental t-norms because of the
role it plays in several applications. In this paper, optimization of a linear objective function with fuzzy
relational inequality constraints is investigated. The feasible region is formed as the intersection of two
inequality fuzzy systems defined by frank family of t-norms is considered as fuzzy composition. First, the
resolution of the feasible solutions set is studied where the two fuzzy inequality systems are defined with
max-Frank composition. Second, some related basic and theoretical properties are derived. Then, a
necessary and sufficient condition and three other necessary conditions are presented to conceptualize the
feasibility of the problem. Subsequently, it is shown that a lower bound is always attainable for the optimal
objective value. Also, it is proved that the optimal solution of the problem is always resulted from the
unique maximum solution and a minimal solution of the feasible region. Finally, an algorithm is presented
to solve the problem and an example is described to illustrate the algorithm. Additionally, a method is
proposed to generate random feasible max-Frank fuzzy relational inequalities. By this method, we can
easily generate a feasible test problem and employ our algorithm to it.
LBRP: A RESILIENT ENERGY HARVESTING NOISE AWARE ROUTING PROTOCOL FOR UNDER WA...ijfcstjournal
Underwater detector network is one amongst the foremost difficult and fascinating analysis arenas that
open the door of pleasing plenty of researchers during this field of study. In several under water based
sensor applications, nodes are square measured and through this the energy is affected. Thus, the mobility
of each sensor nodes are measured through the water atmosphere from the water flow for sensor based
protocol formations. Researchers have developed many routing protocols. However, those lost their charm
with the time. This can be the demand of the age to supply associate degree upon energy-efficient and
ascendable strong routing protocol for under water actuator networks. During this work, the authors tend
to propose a customary routing protocol named level primarily based routing protocol (LBRP), reaching to
offer strong, ascendable and energy economical routing. LBRP conjointly guarantees the most effective use
of total energy consumption and ensures packet transmission which redirects as an additional reliability in
compare to different routing protocols. In this work, the authors have used the level of forwarding node,
residual energy and distance from the forwarding node to the causing node as a proof in multicasting
technique comparisons. Throughout this work, the authors have got a recognition result concerning about
86.35% on the average in node multicasting performances. Simulation has been experienced each in a
wheezy and quiet atmosphere which represents the endorsement of higher performance for the planned
protocol.
STRUCTURAL DYNAMICS AND EVOLUTION OF CAPSULE ENDOSCOPY (PILL CAMERA) TECHNOLO...ijfcstjournal
This research paper examined and re-evaluates the technological innovation, theory, structural dynamics
and evolution of Pill Camera(Capsule Endoscopy) technology in redirecting the response manner of small
bowel (intestine) examination in human. The Pill Camera (Endoscopy Capsule) is made up of sealed
biocompatible material to withstand acid, enzymes and other antibody chemicals in the stomach is a
technology that helps the medical practitioners especially the general physicians and the
gastroenterologists to examine and re-examine the intestine for possible bleeding or infection. Before the
advent of the Pill camera (Endoscopy Capsule) the colonoscopy was the local method used but research
showed that some parts (bowel) of the intestine can’t be reach by mere traditional method hence the need
for Pill Camera. Countless number of deaths from stomach disease such as polyps, inflammatory bowel
(Crohn”s diseases), Cancers, Ulcer, anaemia and tumours of small intestines which ordinary would have
been detected by sophisticated technology like Pill Camera has become norm in the developing nations.
Nevertheless, not only will this paper examine and re-evaluate the Pill Camera Innovation, theory,
Structural dynamics and evolution it unravelled and aimed to create awareness for both medical
practitioners and the public.
AN OPTIMIZED HYBRID APPROACH FOR PATH FINDINGijfcstjournal
Path finding algorithm addresses problem of finding shortest path from source to destination avoiding
obstacles. There exist various search algorithms namely A*, Dijkstra's and ant colony optimization. Unlike
most path finding algorithms which require destination co-ordinates to compute path, the proposed
algorithm comprises of a new method which finds path using backtracking without requiring destination
co-ordinates. Moreover, in existing path finding algorithm, the number of iterations required to find path is
large. Hence, to overcome this, an algorithm is proposed which reduces number of iterations required to
traverse the path. The proposed algorithm is hybrid of backtracking and a new technique(modified 8-
neighbor approach). The proposed algorithm can become essential part in location based, network, gaming
applications. grid traversal, navigation, gaming applications, mobile robot and Artificial Intelligence.
EAGRO CROP MARKETING FOR FARMING COMMUNITYijfcstjournal
The Major Occupation in India is the Agriculture; the people involved in the Agriculture belong to the poor
class and category. The people of the farming community are unaware of the new techniques and Agromachines, which would direct the world to greater heights in the field of agriculture. Though the farmers
work hard, they are cheated by agents in today’s market. This serves as a opportunity to solve
all the problems that farmers face in the current world. The eAgro crop marketing will serve as a better
way for the farmers to sell their products within the country with some mediocre knowledge about using
the website. This would provide information to the farmers about current market rate of agro-products,
their sale history and profits earned in a sale. This site will also help the farmers to know about the market
information and to view agricultural schemes of the Government provided to farmers.
EDGE-TENACITY IN CYCLES AND COMPLETE GRAPHSijfcstjournal
It is well known that the tenacity is a proper measure for studying vulnerability and reliability in graphs.
Here, a modified edge-tenacity of a graph is introduced based on the classical definition of tenacity.
Properties and bounds for this measure are introduced; meanwhile edge-tenacity is calculated for cycle
graphs and also for complete graphs.
COMPARATIVE STUDY OF DIFFERENT ALGORITHMS TO SOLVE N QUEENS PROBLEMijfcstjournal
This Paper provides a brief description of the Genetic Algorithm (GA), the Simulated Annealing (SA)
Algorithm, the Backtracking (BT) Algorithm and the Brute Force (BF) Search Algorithm and attempts to
explain the way as how the Proposed Genetic Algorithm (GA), the Proposed Simulated Annealing (SA)
Algorithm using GA, the Backtracking (BT) Algorithm and the Brute Force (BF) Search Algorithm can be
employed in finding the best solution of N Queens Problem and also, makes a comparison between these
four algorithms. It is entirely a review based work. The four algorithms were written as well as
implemented. From the Results, it was found that, the Proposed Genetic Algorithm (GA) performed better
than the Proposed Simulated Annealing (SA) Algorithm using GA, the Backtracking (BT) Algorithm and
the Brute Force (BF) Search Algorithm and it also provided better fitness value (solution) than the
Proposed Simulated Annealing Algorithm (SA) using GA, the Backtracking (BT) Algorithm and the Brute
Force (BF) Search Algorithm, for different N values. Also, it was noticed that, the Proposed GA took more
time to provide result than the Proposed SA using GA.
PSTECEQL: A NOVEL EVENT QUERY LANGUAGE FOR VANET’S UNCERTAIN EVENT STREAMSijfcstjournal
In recent years, the complex event processing technology has been used to process the VANET’s temporal
and spatial event streams. However, we usually cannot get the accurate data because the device sensing
accuracy limitations of the system. We only can get the uncertain data from the complex and limited
environment of the VANET. Because the VANET’s event streams are consist of the uncertain data, so they
are also uncertain. How effective to express and process these uncertain event streams has become the core
issue for the VANET system. To solve this problem, we propose a novel complex event query language
PSTeCEQL (probabilistic spatio-temporal constraint event query language). Firstly, we give the definition
of the possible world model of VANET’s uncertain event streams. Secondly, we propose an event query
language PSTeCEQL and give the syntax and the operational semantics of the language. Finally, we
illustrate the validity of the PSTeCEQL by an example.
CLUSTBIGFIM-FREQUENT ITEMSET MINING OF BIG DATA USING PRE-PROCESSING BASED ON...ijfcstjournal
Now a day enormous amount of data is getting explored through Internet of Things (IoT) as technologies
are advancing and people uses these technologies in day to day activities, this data is termed as Big Data
having its characteristics and challenges. Frequent Itemset Mining algorithms are aimed to disclose
frequent itemsets from transactional database but as the dataset size increases, it cannot be handled by
traditional frequent itemset mining. MapReduce programming model solves the problem of large datasets
but it has large communication cost which reduces execution efficiency. This proposed new pre-processed
k-means technique applied on BigFIM algorithm. ClustBigFIM uses hybrid approach, clustering using kmeans algorithm to generate Clusters from huge datasets and Apriori and Eclat to mine frequent itemsets
from generated clusters using MapReduce programming model. Results shown that execution efficiency of
ClustBigFIM algorithm is increased by applying k-means clustering algorithm before BigFIM algorithm as
one of the pre-processing technique.
A MUTATION TESTING ANALYSIS AND REGRESSION TESTINGijfcstjournal
Software testing is a testing which conducted a test to provide information to client about the quality of the
product under test. Software testing can also provide an objective, independent view of the software to
allow the business to appreciate and understand the risks of software implementation. In this paper we
focused on two main software testing –mutation testing and mutation testing. Mutation testing is a
procedural testing method, i.e. we use the structure of the code to guide the test program, A mutation is a
little change in a program. Such changes are applied to model low level defects that obtain in the process
of coding systems. Ideally mutations should model low-level defect creation. Mutation testing is a process
of testing in which code is modified then mutated code is tested against test suites. The mutations used in
source code are planned to include in common programming errors. A good unit test typically detects the
program mutations and fails automatically. Mutation testing is used on many different platforms, including
Java, C++, C# and Ruby. Regression testing is a type of software testing that seeks to uncover
new software bugs, or regressions, in existing functional and non-functional areas of a system after
changes such as enhancements, patches or configuration changes, have been made to them. When defects
are found during testing, the defect got fixed and that part of the software started working as needed. But
there may be a case that the defects that fixed have introduced or uncovered a different defect in the
software. The way to detect these unexpected bugs and to fix them used regression testing. The main focus
of regression testing is to verify that changes in the software or program have not made any adverse side
effects and that the software still meets its need. Regression tests are done when there are any changes
made on software, because of modified functions.
GREEN WSN- OPTIMIZATION OF ENERGY USE THROUGH REDUCTION IN COMMUNICATION WORK...ijfcstjournal
Advances in micro fabrication and communication techniques have led to unimaginable proliferation of
WSN applications. Research is focussed on reduction of setup operational energy costs. Bulk of operational
energy costs are linked to communication activities of WSN. Any progress towards energy efficiency has a
potential of huge savings globally. Therefore, every energy efficient step is an endeavour to cut costs and
‘Go Green’. In this paper, we have proposed a framework to reduce communication workload through: Innetwork compression and multiple query synthesis at the base-station and modification of query syntax
through introduction of Static Variables. These approaches are general approaches which can be used in
any WSN irrespective of application.
A NEW MODEL FOR SOFTWARE COSTESTIMATION USING HARMONY SEARCHijfcstjournal
Accurate and realistic estimation is always considered to be a great challenge in software industry.
Software Cost Estimation (SCE) is the standard application used to manage software projects. Determining
the amount of estimation in the initial stages of the project depends on planning other activities of the
project. In fact, the estimation is confronted with a number of uncertainties and barriers’, yet assessing the
previous projects is essential to solve this problem. Several models have been developed for the analysis of
software projects. But the classical reference method is the COCOMO model, there are other methods
which are also applied such as Function Point (FP), Line of Code(LOC); meanwhile, the expert`s opinions
matter in this regard. In recent years, the growth and the combination of meta-heuristic algorithms with
high accuracy have brought about a great achievement in software engineering. Meta-heuristic algorithms
which can analyze data from multiple dimensions and identify the optimum solution between them are
analytical tools for the analysis of data. In this paper, we have used the Harmony Search (HS)algorithm for
SCE. The proposed model which is a collection of 60 standard projects from Dataset NASA60 has been
assessed.The experimental results show that HS algorithm is a good way for determining the weight
similarity measures factors of software effort, and reducing the error of MRE.
AGENT ENABLED MINING OF DISTRIBUTED PROTEIN DATA BANKSijfcstjournal
Mining biological data is an emergent area at the intersection between bioinformatics and data mining
(DM). The intelligent agent based model is a popular approach in constructing Distributed Data Mining
(DDM) systems to address scalable mining over large scale distributed data. The nature of associations
between different amino acids in proteins has also been a subject of great anxiety. There is a strong need to
develop new models and exploit and analyze the available distributed biological data sources. In this study,
we have designed and implemented a multi-agent system (MAS) called Agent enriched Quantitative
Association Rules Mining for Amino Acids in distributed Protein Data Banks (AeQARM-AAPDB). Such
globally strong association rules enhance understanding of protein composition and are desirable for
synthesis of artificial proteins. A real protein data bank is used to validate the system.
International Journal on Foundations of Computer Science & Technology (IJFCST)ijfcstjournal
International Journal on Foundations of Computer Science & Technology (IJFCST) is a Bi-monthly peer-reviewed and refereed open access journal that publishes articles which contribute new results in all areas of the Foundations of Computer Science & Technology. Over the last decade, there has been an explosion in the field of computer science to solve various problems from mathematics to engineering. This journal aims to provide a platform for exchanging ideas in new emerging trends that needs more focus and exposure and will attempt to publish proposals that strengthen our goals. Topics of interest include, but are not limited to the following:
Because the technology is used largely in the last decades; cybercrimes have become a significant
international issue as a result of the huge damage that it causes to the business and even to the ordinary
users of technology. The main aims of this paper is to shed light on digital crimes and gives overview about
what a person who is related to computer science has to know about this new type of crimes. The paper has
three sections: Introduction to Digital Crime which gives fundamental information about digital crimes,
Digital Crime Investigation which presents different investigation models and the third section is about
Cybercrime Law.
DISTRIBUTION OF MAXIMAL CLIQUE SIZE UNDER THE WATTS-STROGATZ MODEL OF EVOLUTI...ijfcstjournal
In this paper, we analyze the evolution of a small-world network and its subsequent transformation to a
random network using the idea of link rewiring under the well-known Watts-Strogatz model for complex
networks. Every link u-v in the regular network is considered for rewiring with a certain probability and if
chosen for rewiring, the link u-v is removed from the network and the node u is connected to a randomly
chosen node w (other than nodes u and v). Our objective in this paper is to analyze the distribution of the
maximal clique size per node by varying the probability of link rewiring and the degree per node (number
of links incident on a node) in the initial regular network. For a given probability of rewiring and initial
number of links per node, we observe the distribution of the maximal clique per node to follow a Poisson
distribution. We also observe the maximal clique size per node in the small-world network to be very close
to that of the average value and close to that of the maximal clique size in a regular network. There is no
appreciable decrease in the maximal clique size per node when the network transforms from a regular
network to a small-world network. On the other hand, when the network transforms from a small-world
network to a random network, the average maximal clique size value decreases significantly
Securing your Kubernetes cluster_ a step-by-step guide to success !KatiaHIMEUR1
Today, after several years of existence, an extremely active community and an ultra-dynamic ecosystem, Kubernetes has established itself as the de facto standard in container orchestration. Thanks to a wide range of managed services, it has never been so easy to set up a ready-to-use Kubernetes cluster.
However, this ease of use means that the subject of security in Kubernetes is often left for later, or even neglected. This exposes companies to significant risks.
In this talk, I'll show you step-by-step how to secure your Kubernetes cluster for greater peace of mind and reliability.
JMeter webinar - integration with InfluxDB and GrafanaRTTS
Watch this recorded webinar about real-time monitoring of application performance. See how to integrate Apache JMeter, the open-source leader in performance testing, with InfluxDB, the open-source time-series database, and Grafana, the open-source analytics and visualization application.
In this webinar, we will review the benefits of leveraging InfluxDB and Grafana when executing load tests and demonstrate how these tools are used to visualize performance metrics.
Length: 30 minutes
Session Overview
-------------------------------------------
During this webinar, we will cover the following topics while demonstrating the integrations of JMeter, InfluxDB and Grafana:
- What out-of-the-box solutions are available for real-time monitoring JMeter tests?
- What are the benefits of integrating InfluxDB and Grafana into the load testing stack?
- Which features are provided by Grafana?
- Demonstration of InfluxDB and Grafana using a practice web application
To view the webinar recording, go to:
https://www.rttsweb.com/jmeter-integration-webinar
LF Energy Webinar: Electrical Grid Modelling and Simulation Through PowSyBl -...DanBrown980551
Do you want to learn how to model and simulate an electrical network from scratch in under an hour?
Then welcome to this PowSyBl workshop, hosted by Rte, the French Transmission System Operator (TSO)!
During the webinar, you will discover the PowSyBl ecosystem as well as handle and study an electrical network through an interactive Python notebook.
PowSyBl is an open source project hosted by LF Energy, which offers a comprehensive set of features for electrical grid modelling and simulation. Among other advanced features, PowSyBl provides:
- A fully editable and extendable library for grid component modelling;
- Visualization tools to display your network;
- Grid simulation tools, such as power flows, security analyses (with or without remedial actions) and sensitivity analyses;
The framework is mostly written in Java, with a Python binding so that Python developers can access PowSyBl functionalities as well.
What you will learn during the webinar:
- For beginners: discover PowSyBl's functionalities through a quick general presentation and the notebook, without needing any expert coding skills;
- For advanced developers: master the skills to efficiently apply PowSyBl functionalities to your real-world scenarios.
Elevating Tactical DDD Patterns Through Object CalisthenicsDorra BARTAGUIZ
After immersing yourself in the blue book and its red counterpart, attending DDD-focused conferences, and applying tactical patterns, you're left with a crucial question: How do I ensure my design is effective? Tactical patterns within Domain-Driven Design (DDD) serve as guiding principles for creating clear and manageable domain models. However, achieving success with these patterns requires additional guidance. Interestingly, we've observed that a set of constraints initially designed for training purposes remarkably aligns with effective pattern implementation, offering a more ‘mechanical’ approach. Let's explore together how Object Calisthenics can elevate the design of your tactical DDD patterns, offering concrete help for those venturing into DDD for the first time!
Generating a custom Ruby SDK for your web service or Rails API using Smithyg2nightmarescribd
Have you ever wanted a Ruby client API to communicate with your web service? Smithy is a protocol-agnostic language for defining services and SDKs. Smithy Ruby is an implementation of Smithy that generates a Ruby SDK using a Smithy model. In this talk, we will explore Smithy and Smithy Ruby to learn how to generate custom feature-rich SDKs that can communicate with any web service, such as a Rails JSON API.
Encryption in Microsoft 365 - ExpertsLive Netherlands 2024Albert Hoitingh
In this session I delve into the encryption technology used in Microsoft 365 and Microsoft Purview. Including the concepts of Customer Key and Double Key Encryption.
Dev Dives: Train smarter, not harder – active learning and UiPath LLMs for do...UiPathCommunity
💥 Speed, accuracy, and scaling – discover the superpowers of GenAI in action with UiPath Document Understanding and Communications Mining™:
See how to accelerate model training and optimize model performance with active learning
Learn about the latest enhancements to out-of-the-box document processing – with little to no training required
Get an exclusive demo of the new family of UiPath LLMs – GenAI models specialized for processing different types of documents and messages
This is a hands-on session specifically designed for automation developers and AI enthusiasts seeking to enhance their knowledge in leveraging the latest intelligent document processing capabilities offered by UiPath.
Speakers:
👨🏫 Andras Palfi, Senior Product Manager, UiPath
👩🏫 Lenka Dulovicova, Product Program Manager, UiPath
Epistemic Interaction - tuning interfaces to provide information for AI supportAlan Dix
Paper presented at SYNERGY workshop at AVI 2024, Genoa, Italy. 3rd June 2024
https://alandix.com/academic/papers/synergy2024-epistemic/
As machine learning integrates deeper into human-computer interactions, the concept of epistemic interaction emerges, aiming to refine these interactions to enhance system adaptability. This approach encourages minor, intentional adjustments in user behaviour to enrich the data available for system learning. This paper introduces epistemic interaction within the context of human-system communication, illustrating how deliberate interaction design can improve system understanding and adaptation. Through concrete examples, we demonstrate the potential of epistemic interaction to significantly advance human-computer interaction by leveraging intuitive human communication strategies to inform system design and functionality, offering a novel pathway for enriching user-system engagements.
The Art of the Pitch: WordPress Relationships and SalesLaura Byrne
Clients don’t know what they don’t know. What web solutions are right for them? How does WordPress come into the picture? How do you make sure you understand scope and timeline? What do you do if sometime changes?
All these questions and more will be explored as we talk about matching clients’ needs with what your agency offers without pulling teeth or pulling your hair out. Practical tips, and strategies for successful relationship building that leads to closing the deal.
DevOps and Testing slides at DASA ConnectKari Kakkonen
My and Rik Marselis slides at 30.5.2024 DASA Connect conference. We discuss about what is testing, then what is agile testing and finally what is Testing in DevOps. Finally we had lovely workshop with the participants trying to find out different ways to think about quality and testing in different parts of the DevOps infinity loop.
Key Trends Shaping the Future of Infrastructure.pdfCheryl Hung
Keynote at DIGIT West Expo, Glasgow on 29 May 2024.
Cheryl Hung, ochery.com
Sr Director, Infrastructure Ecosystem, Arm.
The key trends across hardware, cloud and open-source; exploring how these areas are likely to mature and develop over the short and long-term, and then considering how organisations can position themselves to adapt and thrive.
Assuring Contact Center Experiences for Your Customers With ThousandEyes
Improving data transmission in the vanet using multi criteria decision making method based on fuzzy logic
1. International Journal in Foundations of Computer Science & Technology (IJFCST), Vol. 3, No.6, November 2013
IMPROVING DATA TRANSMISSION IN THE VANET
USING MULTI-CRITERIA DECISION MAKING
METHOD BASED ON FUZZY LOGIC
Javad Badali 1 Mortaza Mokhtari Nazarlou2 parvin fartut3
1,2,3
Department of Computer, maku Branch, Islamic Azad University, maku, Iran
ABSTRACT
In vehicular ad-hoc networks the packets are sent using multi-hop methods and the receiving limit of a
message is gradually extended, but the exponential increment of the number of nodes re-broadcasting a
message results in broadcast storm problem in data broadcasting in this case. Some characteristics like
high speed of nodes, rapid topological changes and repetitive discontinuities have made it difficult to
design an efficient broadcasting protocol for these networks.
We have offered a novel fuzzy method based on multi-criteria decision-making (MCDM) for prioritizing the
vehicles in selection of the most proper neighbor to broadcast data in this paper. With using this fuzzy
method, the most proper vehicles participate in data broadcasting. The results of simulation using NS show
that because of selecting the neighboring vehicles with high priority in data broadcasting, the speed of
sending the packs is increased and the network load is considerably decreased. This method also
considerably decreases broadcasting traffic.
KEYWORDS
VANET, Data Dissemination, Broadcast Storm, Fuzzy Decision Making
1. INTRODUCTION
VANETs are subset of MANET known as new generation of ad-hoc networks [4,6]. In order to
establish the communication VANET, each vehicle is as a node which can act both as receiver
and sender and hereby broadcast different information between the vehicles. In these networks,
the vehicles are equipped with wireless terminals with standards like DSRC with sending limit
extendable up to 1000m. Because of limited radio range of each node in VANETs, it is required
to re-broadcast the received broadcasted message for the neighbors. This type of sending is called
multi-hop and requires routing algorithms. Routing in VANETs is very complicated and difficult
because of some characteristics like high dynamism, high speed of vehicles and high broadcasting
scale of information and the old routing methods are not sufficient in these networks.
In multi-hop sending, the received limit of a message is gradually extended; but in this case the
exponential increasing of the number of nodes re-broadcasting the message brings the problem of
broadcast storm in broadcasting of information. The following cases can be mentioned among the
important characteristics of VANETs [2]:
VANETs have dynamic topology but they are geographically limited.
These networks have potentially wide scale in broadcasting of information
They mostly suffer from desultoriness
DOI:10.5121/ijfcst.2013.3606
61
2. International Journal in Foundations of Computer Science & Technology (IJFCST), Vol. 3, No.6, November 2013
The density of network is variable and is a function of traffic of vehicles
Topology of the network highly depends on the treatment of the driver
VANETs have very low diameter in comparison with public networks
Existence of obstacles in urban environments in the networks can disturb routing
The vehicle-to-vehicle communications in VANET networks, data and message exchange
between the nodes (vehicle) is done in two ways as follows:
Vehicle-to-vehicle communications (V2V)
Vehicle-to-road side equipment communications (V2R)
Many studies are performed on V2V and V2R communications and it has been determined that
VANETs with V2V-based data communication have some priorities over V2R-based VANETs
[14] and that is why we have concentrated on V2V communications. Considering the importance
of creating a dedicated frequency band for wireless communication in VANET networks, the
Federal Communications Commission of the USA (FCC) has dedicated a 75MHz bandwidth in
5.9GHz for Dedicated Short-Range Communications. The channel dedication method in this band
is briefly shown in figure 1.The frequency limit is divided into 7 channels with 10MHz
bandwidth; out of which 1 channel is mainly dedicated to increase the safety coefficient of roads
and the remained 6 channels are dedicated for service-welfare applications [3].
Figure1. Method of Dedicating Frequency Band & Division of Its Channels for DSRC/WAVE [14]
The messages exchanged in V2V networks for safety application are divided into two categories
in terms of their nature and schedule of broadcasting [15]:
Periodic messages alternatively broadcasted by each vehicle: These periodic messages contain the
motional status of each vehicle in the route. By analyzing these messages in each vehicle, we can
obtain complete data about the status of the rout. In other words, these messages are called
beacon.
Emergency messages (event driven): these messages are issued from time to time and in case of
hazardous events in the rout in order to warn other vehicles. In case of receiving emergency
messages, we can prevent from more damages by making proper decisions without losing the
time.
62
3. International Journal in Foundations of Computer Science & Technology (IJFCST), Vol. 3, No.6, November 2013
On the whole, some problems like weakening of the received signal level, saturation of channel
loading, high mobility network nodes and broadcast storm should be overcame in order to have a
reliable and safe communication in VANETs. The problem of Broadcast Storm in these networks
occurs because of some characteristics like high mobility of nodes, high scale and structure in
broadcasting and we try to solve these problems in this paper.
In this paper, a fuzzy method is proposed to select the vehicles participating in broadcasting,
which is compatible with special characteristics of VANE networks. As fuzzy inference systems
and fuzzy theories in general have an important role in optimization and prioritization process,
this paper wants to describe the application of fuzzy decision-making in improvement of
broadcast storm. The fuzzy theory in general and fuzzy sets will be described in section3 to get
more familiar with fuzzy theory.
2. R ELATED WORK
Different methods are described in order to solve the problem of Broadcast Storm in VANETs.
One of the methods used to solve this problem in MANET Networks is that it limits the number
of steps coursed in one multi-hop sending by defining some thresholds [9]. Some changes are
made in these networks to generalize these methods to VANETs. For example, from the received
signal strength (RSS) of a message, one part is used as a criterion for decision-making for rebroadcasting as follows:
pij 1
RSSij RSS min
RSS max RSS MIN
(1)
In Equation (1), RSSmin is the minimum receivable signal level and RSSmax is the maximum sent
signal strength. For each message reaching from node i to j, the received signal strength is
calculated and placed in RSSij. The pij variable is re-broadcasting probability of the received
message. The higher the level of received signal, the closer it is to the source node and the
received message will be re-broadcasted with less probability in this case. This will finally result
in reduction of broadcast storm near the sender [12].
In another method, all message-receiving nodes don’t re-broadcast it and only the receiver in
extreme point of the destination should re-broadcast it for other nodes. Of course, we will need a
communication with location-finding equipment such as GPS in order to implement this protocol.
Request to Broadcast/Clear to Broadcast (RTB/CTB) hand-shale messages are used in this
protocol [7].
In another method, repeating method is used to send emergency messages. In this definition if an
accident occurs, emergency warning messages (EWM) are sent with a high rate and then the rate
of sending is decreased [13].As a simple method to discover broadcast storm, each node
investigates the sequence number of its received packs and calculates the receiving rate of packs
based on it. If the receiving rate is decreased in the present time in comparison with the previous
times, then the problem of hidden node and collision of frames occur in network. So, it is better to
increase the waiting time to occupy the channel. This is done by increasing the contention
windows. In this case, by decreasing the competition for sending and decreasing of network
loading, the rate of collision is decreased and receiving rate of broadcasting frames is increased.
Here the estimated receipt rate in communication between two nodes in the receiver is calculated
according to the following accumulated equation:
63
4. International Journal in Foundations of Computer Science & Technology (IJFCST), Vol. 3, No.6, November 2013
Est Re cpt Est Re cpt 1 (1 ) Sample Re cp
(2)
Alpha coefficient in equation 2 is used to change the important of receiving rate in the past in
comparison with the present in order to calculate the estimated receipt rate. The average local
receipt rate is calculated from all sending nodes for the receiver according to equation 3 [1].
Local Re cpRate
Est Re cp
Nodes
(3)
Another solution for decreasing the flooding traffic for discovering the route is optimal routing
method. Clustering routing is one of the routing methods which is called CBRP (Cluster Based
Routing Protocol) and decreases broadcast storm. In clustering methods, the moving nodes are
divided into different categories and are placed next to each other in one cluster according to
special rules. In one cluster, the nodes can have different roles such as head cluster, gate and
ordinary nodes. In this method, the clusters are determined and then some criteria like node's
attribute, cluster and head cluster are provided. Ei criterion is considered to determine head cluster
which is calculated as follows:
d
Ei e t
t 0, Tmax
(4)
t is the time of presence in road and d is speed deviation rate. Each node with bigger E is selected
as head cluster. That is, a vehicle moving for a longer time in the road with lower speed deviation
is selected. All nodes broadcast Hello messages alternatively with specific intervals. The
messages contain all data of the neighboring table and the adjacent cluster table.
3. F UZZY THEORY
Fuzzy systems are based on rules or knowledge. The heart of a fuzzy system is a database which
is formed of fuzzy if-then, conclusion and decision-making rules. Fuzzy decision-making is an
action of decision-making, some words of which are determined using continuous functions. Here
some advantages of fuzzy logic are mentioned [11].
-
Simple conceptual understanding
Flexibility
Production of complex non-linear mathematical methods
Logical and rational justifiability
Possibility of designing based on experimental theories of experts
Unlike its apparent similarity with probabilities, Fuzzy theory is a theory independent of
probabilities. Using of fuzzy systems in two following states is very important:
1- In studying of very complex systems
2- Under conditions where access to an approximate but very rapid method is preferred
3.1. Fuzzy Sets
Global set in fuzzy sets is all accessible data about a problem. Membership functions are
expresses with 0 or 1 in classic sets and this means that: is the considered component a member
64
5. International Journal in Foundations of Computer Science & Technology (IJFCST), Vol. 3, No.6, November 2013
of the set or not. But membership functions in fuzzy sets allocate an amount between 1 and 0 to
themselves.
If the members of global set are discontinuous in fuzzy theory, the fuzzy theory is defined as
follows:
(5)
Fuzzification Stages of sets are done in four stages:
1- First, the minimum and maximum amounts of global set are determined.
2- The basic verbal amounts are determined. For example, we can use verbal amounts such as:
Very Low, Low, Medium, Lower Medium, Higher Medium, High and Very High.
3- The space between minimum and maximum of global set is divided into proper sections.
This division can be linear or non-linear. The number of these sections can be or cannot
be equal to the number of verbal amounts.
4- Proper membership functions for members of global set are define to represent the verbal
amount.
The best method for obtaining the membership functions is using of mathematical equations,
because the neutrality is kept by using this method. Several mathematical functions are suggested
for this purpose, among which three functions including Triangular, Bell-Shape and Gaussian are
used more than others.
The main characteristics of Gaussian and Bell-Shape functions is that they are closer to the
thinking method of human and the advantages of triangular function is that we can cite more
theoretic reasoning to prove the theories[8]. Therefore, we will use this method in the present
paper.
The following equation should be also used to determine the membership degree of members in
global set in a fuzzy quantity which follows a triangular function:
0
x a
A ( c, a , b ) c a
bx
b c
0
, xa
, axc
, cxb
, xb
(6)
3.2. Fuzzy Decision-Making
Multi-Criteria Decision Making (MCDM) is the most common modeling method in decisionmaking problems which tries to model the decision-making problem under condition where the
number of objections and attributes of decision-making is more than one. The aim of MCDM
technique is to design and help decision-making process to distinguish the most proper solution
according to the will of the decision maker about the problem. MCDM is divided into two
categories: MODM (Multi-Objective Decision Making) and MADM (Multi-Attributable Decision
Making) [5]. Methods of solving multi-objective decisions-making problem can be also easily
used for fuzzy numbers such that calculations are done on membership functions of fuzzy sets
65
6. International Journal in Foundations of Computer Science & Technology (IJFCST), Vol. 3, No.6, November 2013
instead of numerical amounts. In this state of fuzzy sets, the criteria showing the importance of
objectives (weight of criteria) and fuzzy sets of optimality show also the rate of optimality.
3.3. Multi-Criteria Decision-Making with Multi-Objective Decision-Making View
(MODM)
One of the methods for solving multi-criteria decision-making problems is analyzing it as a multiobjective problem, such that each criterion is considered as an objective where we want to reach
[10]. In multi-objective decision-making, we want to a set of important objectives by selecting the
best alternative. In these issues, we consider that we have a set of objectives as O= {o1 , o2, o3, ….,
on} and a set of alternatives A= {A1, A2, A3, … , An}. We decide to reach these objectives. In
other words, we want to reach o1, o2,… and on. If we show the decision with D, so we have:
D = o1 ^o2^o3 ^…^on
That is, o1, o2,… and on objectives are reached. The rate of reaching to jth objective is shown as
Dij. In other word, the rate of reaching to jth objective is equal to Dij. If the importance of jth
objective is Bj, then selecting ith alternative will fulfill this need as aij.
And using maximum method for gathering we can reach the Dij.
Dij max( B , aij )
(7)
Considering the combination (and) in reaching the set of objectives, the rate of decision for
ithalternative is obtained as follows:
D ( Ai ) min
n
n
Dij min
max( B , aij )
j 1
j 1
(8)
4. R ESEARCH METHOD
Our Proposed method in this paper is prioritization method for data broadcasting in urban VANE
which acts in accordance with Multi-Criteria Decision-Making (MCDM) with Multi-Objective
Decision-Making method (MODM) in fuzzy theory.
In the suggested method, we assume that the data about speed, the distance between the nodes
and the number of neighbors of each node are kept in a table. We have used GPS to determine the
location and distance between the vehicles and we have also taken advantage of beacon messages
to calculate the number of neighbors. The characteristics of the suggested protocol are as follows:
Fuzzy Variable of Vehicle's Speed:
The criterion of speed in urban environments for each vehicle are Vmax and the minimum speed
is Vmin. We consider a fuzzy set of {very high, high, higher medium, medium, lower medium,
low, very low} for vehicle's speed. We consider the "medium speed" for speed criterion weight.
Fuzzy Variable of the Number of Neighbors:
66
7. International Journal in Foundations of Computer Science & Technology (IJFCST), Vol. 3, No.6, November 2013
We also consider a fuzzy set including seven members {very high, high, higher medium, medium,
lower medium, low, very low} for the number of neighbors. About the criterion weight of the
number of neighbors, "the highest number of neighbors “is considered.
Fuzzy Variable of Distance between Vehicles:
We consider a fuzzy set of {very high, high, higher medium, medium, lower medium, low, very
low} for the distance between vehicles. We use the equation in GPS to calculate the criterion
weight of optimal distance. We select the weight "very high “for distance criterion.
After calculating the total amounts of criteria membership for every single vehicle, we start to
calculate fuzzy decision-making in each vehicle according to equations. After calculation, we use
the gravity center method for defuzzification of the obtained amounts. When broadcasting the
data, each vehicle like Vi prioritizes the neighboring node according to the updated data of the
neighboring nodes and fuzzy decision-making and selects the node with high priority as the next
step to send the data. This method will considerably decrease the broadcasting traffic and will
increase its efficiency.
The aim of the suggested method is to select a node with highest number of neighbors and
average speed and the possible farthest distance. The node having the three criterion mentioned
above with high weights is selected as optimal node for data broadcasting. If the link between the
present node and the node with high priority is broken for some reasons such as high speed, going
beyond 1000m sending limit and increased loading on network, then a node with the next priority
order will be selected for data broadcasting. The priority level of each node will be created by
multi-objective decision-making in a set according to the order priorities. In the neighboring table
of each node, the data about the neighboring nodes such as distance, number of neighbors and
speed are mentioned. Each node prioritizes these nodes with fuzzy decision-making. When a
vehicle wants to broadcast data, a vehicle with highest priority is selected according to the
available prioritization and that vehicle will be used to transmit the data.
5. SIMULATION
Simulation environment is 4000×4000m and the maximum sending range of each node is 1000m.
The packets are sent with fixed size of 128 bytes and fixed rate of 4 pkts/sec. The maximum
number of packets which can be sent in each section is 6000 packs and can be received by 20
destinations. The calculation method of FMRBS in VANET was compared with other mobile
models. The criteria evaluated in simulations include the following cases:
Packets dissemination Speed (m/s):is equal to the distance passed by a pack divided by delay
Load Generated per Broadcast Packet: The number of bits sent for broadcasting of a pack in the
whole network
The Average Data Packet Receipt: expresses the rate of vehicles that received the broadcasted
pack to the total packs
Methods compared with our suggested protocol include: UMB (Urban Multi-Hop Broadcast
Protocol) and 802.11-Distance.
67
8. International Journal in Foundations of Computer Science & Technology (IJFCST), Vol. 3, No.6, November 2013
5.1 Simulation Results
- Packets dissemination Speed:
Average packet dissemination speed (m/s)
In FMRBS, as packets are not sent to all neighbors to broadcast the date and only the vehicles
with high priority are selected as the next step, the broadcasting speed of packs is more than that
in other methods.
Average packet generation rate of each vehicle (packets/s)
Figure 2. Packets dissemination Speed
- Load Generated per Broadcast Packet
Average load generated for each broadcast
packet (bits)
In broadcasting of data using FMRBS method, instead of sending the pack to all neighbors only
the neighboring vehicles with higher priority are selected and the load on network in sending the
packs considerably decreases.
Average packet generation rate of each vehicle (packets/s)
Figure 3. Load Generated per Broadcast Packet
- The Average of Data Pack Receipt
As all vehicles are not involved in data broadcasting, the vehicles with less neighbors and low
speed cannot receive a pack. The results of simulation show that this rate is very low and is
almost equal to other methods.
68
9. Average success percentage (%)
International Journal in Foundations of Computer Science & Technology (IJFCST), Vol. 3, No.6, November 2013
Average packet generation rate of each vehicle (packets/s)
Figure 4. The Average of Data Pack Receipt
6.C ONCLUSION
A new method based on Fuzzy Multi-Criteria Decision Making (MCDM) for vehicle-2-vehcile
networks, called FMRBS, to solve the problem of Broadcast Storm in this paper. The next node
for sending emergency method is selected using fuzzy rules in this method. The parameters of
vehicle's speed, the number of neighbors and distance between vehicles are used as parameters
effective on determining the priority of vehicles for data broadcasting. The vehicle with high
priority is used as the next step in data broadcasting.
In simulation, the FMRBS method was compared with UMB and 802.11-distance methods. The
results of simulation show that because of selecting the most proper neighboring nodes as the next
stage in data broadcasting, the speed of sending the packs is increased and the network load is
considerably decreased. Also, because of high reliability of paths, sending the control packs is
considerably increased.
REFERENCES
[1]
Balon N., “Increasing Broadcast Reliability in Vehicular Ad Hoc Networks,” International Workshop
on Vehicular Ad Hoc Network, pp. 104-105, 2004.
[2] Blum J., Eskandarian A., Hoffman L., “Challenges of Intervehicle Ad Hoc Networks,” IEEE
Transaction on Intelligent Transportation Systems, vol. 5, pp. 347–351, 2004.
[3] Federal Communications Commission, “FCC 03-324. FCC Report and Other,” February 2004.
[4] Jones W. D., “Keeping cars from crashing,” IEEE Spectrum, volume. 38, pp. 40-45, September 2001.
[5] Kahraman CH., “Fuzzy multi-criteria decision making,” Theory and Applications with Recent
Developments, Springer, 2008.
[6] Kato S., Tsugawa S., Tokuda K., Matsani T., Fujii H., “Vehicle control algorithms for cooperative
driving with automated vehicles and intervehicle communications,” IEEE Transactions on Intelligent
Transportation Systems, no. 3, pp. 155-16, 2002.
[7] Kurkmaz G., Ekici E., “Urban Multi-Hop Broadcast Protocol for Inter-Vehicular Communication
Systems,” International Conference on Vehicular Ad hoc Networks, pp. 76-85, 2004.
[8] Kwang H. L., “First Course on Fuzzy Theory and Applications,” Springer, 2005.
[9] Ni S., Tsang Y., “The Broadcast Strom problem in A Mobile Ad Hoc Network,” International
Conference on Mobile Computing and Networking, pp. 11-162, 1993.
[10] Triantaphyllou E., “Multi–Criteria Decision Making Methods: A Comparative Study,” Kluwer
Academic Publishers, 2000.
[11] Wang L.X., “a Course in Fuzzy Systems and Controls,” Prentice-Hall International, Inc., 1997.
69
10. International Journal in Foundations of Computer Science & Technology (IJFCST), Vol. 3, No.6, November 2013
[12] Wisitponghan N., Tongaz O. K., “Broadcast Storm Mitigation Techniques in Vehicular Ad Hoc
Networks,” IEEE Wireless Communications, Vol. 14, No. 6, pp. 84-94, 2007.
[13] Yang X., Liu J., “A Vehicle to Vehicle Communication Protocol for Cooperative Collision Warning,”
International Conference on Mobile and Ubiquitous Systems: Networking and Services, pp. 114-123,
2004.
[14] Yu J.Y., Chong P.H.J., “A survey of clustering schemes for mobile ad hoc networks,” IEEE
Communication Survey and Tutorial, vol. 7, no. 1, pp. 32–48, 2005.
[15] Yusefy S., Fathey M., “Performance of Beacon Safety Message Dissemination in Vehicular AdHoc Networks (VANETs),” Journal of Zhejiang University-Science, Vol. 8, No. 12, pp. 1990-2004,
2006.
70