We propose STR to resolve the main reasons of overall network performance degradation of ZTR, which are the detour path problem and the traffic concentration problem. Second, we prove that the 1-hop neighbor nodes used by STR improve the routing path efficiency and alleviate the traffic load concentrated on tree links in ZTR. Third, we analyze the performance of ZTR, STR, and AODV by differentiating the network conditions such as network density, ZigBee network constraints, traffic types, and the network traffic. For modification security purpose we are also encrypting the data packets during transmission. So that the intermediate nodes are not able to view the data during transmission. For Encryption process, we are using RC4 Algorithm. Short cut tree routing is used for minimizing the routing path from source to destination.
AN INVERTED LIST BASED APPROACH TO GENERATE OPTIMISED PATH IN DSR IN MANETS –...Editor IJCATR
In this paper, we design and formulate the inverted list based approach for providing safer path and effective
communication in DSR protocol.Some nodes in network can participate in network more frequenctly whereas some nodes are not
participating. Because of this there is the requirement of such an approach that will take an intelligent decision regarding the sharing of
bandwidth or the resource to a node or the node group. Dynamic source routing protocol (DSR) is an on-demand, source routing
protocol , whereby all the routing information is maintained (continually updated) at mobile nodes.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Improving the Proactive Routing Protocol using Depth First Iterative Deepenin...Yayah Zakaria
Owing to the wireless and mobility nature, nodes in a mobile ad hoc network are not within the transmission range. It needs to transfer data through the multi-intermediate nodes. Opportunistic data forwarding is an assuring solution to make use of the broadcast environment of wireless communication links. Due to absence of source routing capability with efficient proactive routing protocol, it is not widely used. To rectify the
problem, we proposed memory and routing efficient proactive routing protocol using Depth-First Iterative-Deepening and hello messaging scheme. This protocol can conserve the topology information in every node in the network. In experimental analysis and discussion, we implemented the proposed work using NS2 simulator tool and proved that the proposed technique is performed well in terms of average delay, buffer and throughput.
On the routing overhead in infrastructureless multihop wireless networksNarendra Singh Yadav
Routing in infrastructureless multihop wireless networks is a challenging task and has received a vast amount of attention from researchers. This has lead to development of many different routing protocols each having their own superiorities and pitfalls making it very difficult to decide on a better protocol under vulnerable scenarios in such networks. In this paper the performance of three routing protocols (DSR, AODV and CBRP) in terms of routing overhead in bytes and in packets is presented under growing density and varying mobility in different traffic conditions. The simulation results show that CBRP outperforms both DSR and AODV in all scenarios.
Abstract— A MANETs is a self-configuring network is a collection of mobile hosts that are connected via a wireless link. Opportunistic data forwarding has drawn much attention in the research community of multihop wireless networks. Opportunistic data forwarding is the lack of an efficient, lightweight proactive routing scheme with strong source routing capability. In this project proposed to a lightweight proactive source routing (PSR) protocol. PSR can be maintained at different network topology information than distance vector (DV), link state (LS), optimized link State routing (OLSR), then reactive source routing [e.g., dynamic source routing (DSR)]. In this project concentrate on reducing the overhead at the base line protocols, then testing to the better data transportation. Network Simulator (NS-2) help in testing and implementing to this project for effectively reduced to the overhead in the data transportation.
Detection of Duplicate Address in Mobile Adhoc Networks for On Demand Routing...IJMER
International Journal of Modern Engineering Research (IJMER) is Peer reviewed, online Journal. It serves as an international archival forum of scholarly research related to engineering and science education.
LOAD BALANCING AND PROVIDING SECURITY USING RSA IN WIRELESS SENSOR NETWORKSIJARIIT
This paper presents load balancing and provides security using RSA algorithm. This is brief introduction to handle the traffic on node. This represents the converge-casting protocol in wireless sensor networks. The protocol is localized and distributed, and adapts efficiently to vary traffic. Graphs are analyzed using NS-2 simulator, here end-to-end packet latency, packet delivery ratio, throughput are analyzed. This is done for 30 nodes in NS-2 simulation.
An Enhanced DSR Protocol for Improving QoS in MANETKhushbooGupta145
Ad hoc network is a network without centralized administration in which different users can communicate and exchange information. In such a structure, all the nodes participate in order to achieve the network and ensure the travel of the information. Hence, multihopping techniques are used to achieve this task. The communication reliability within an ad hoc network and how the different nodes act are managed by routing protocols. Nowadays, different types of protocols exist. Nevertheless, the source routing ones, based on information known at the source of the communication, seem to attract more studies. Source routing protocols had shown interesting results in realistic scenarios in areas such as military battlefields or airport stations.
This Paper deals with DSR Protocol and is focused on the multipath aspect of this routing protocol. Since, it is necessary to understand that multipath techniques enhance reliability and can ensure security. We have simulated a new multipath algorithm. The solution had been evaluated with the network Simulator 2. Since we want to know how our protocol reacts in different mobility cases, the random waypoint model which allows us to present relevant results, due to the fact this situation is taken into account.
Simulation results show that the multipath protocol behaves better than DSR, the main actual reactive protocol. The Proposed protocol MSR performs well in high mobility by using much less overhead than DSR. Additionally, it is interesting to see that DSR without any modifications manage poorly in high mobility situation.
AN INVERTED LIST BASED APPROACH TO GENERATE OPTIMISED PATH IN DSR IN MANETS –...Editor IJCATR
In this paper, we design and formulate the inverted list based approach for providing safer path and effective
communication in DSR protocol.Some nodes in network can participate in network more frequenctly whereas some nodes are not
participating. Because of this there is the requirement of such an approach that will take an intelligent decision regarding the sharing of
bandwidth or the resource to a node or the node group. Dynamic source routing protocol (DSR) is an on-demand, source routing
protocol , whereby all the routing information is maintained (continually updated) at mobile nodes.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Improving the Proactive Routing Protocol using Depth First Iterative Deepenin...Yayah Zakaria
Owing to the wireless and mobility nature, nodes in a mobile ad hoc network are not within the transmission range. It needs to transfer data through the multi-intermediate nodes. Opportunistic data forwarding is an assuring solution to make use of the broadcast environment of wireless communication links. Due to absence of source routing capability with efficient proactive routing protocol, it is not widely used. To rectify the
problem, we proposed memory and routing efficient proactive routing protocol using Depth-First Iterative-Deepening and hello messaging scheme. This protocol can conserve the topology information in every node in the network. In experimental analysis and discussion, we implemented the proposed work using NS2 simulator tool and proved that the proposed technique is performed well in terms of average delay, buffer and throughput.
On the routing overhead in infrastructureless multihop wireless networksNarendra Singh Yadav
Routing in infrastructureless multihop wireless networks is a challenging task and has received a vast amount of attention from researchers. This has lead to development of many different routing protocols each having their own superiorities and pitfalls making it very difficult to decide on a better protocol under vulnerable scenarios in such networks. In this paper the performance of three routing protocols (DSR, AODV and CBRP) in terms of routing overhead in bytes and in packets is presented under growing density and varying mobility in different traffic conditions. The simulation results show that CBRP outperforms both DSR and AODV in all scenarios.
Abstract— A MANETs is a self-configuring network is a collection of mobile hosts that are connected via a wireless link. Opportunistic data forwarding has drawn much attention in the research community of multihop wireless networks. Opportunistic data forwarding is the lack of an efficient, lightweight proactive routing scheme with strong source routing capability. In this project proposed to a lightweight proactive source routing (PSR) protocol. PSR can be maintained at different network topology information than distance vector (DV), link state (LS), optimized link State routing (OLSR), then reactive source routing [e.g., dynamic source routing (DSR)]. In this project concentrate on reducing the overhead at the base line protocols, then testing to the better data transportation. Network Simulator (NS-2) help in testing and implementing to this project for effectively reduced to the overhead in the data transportation.
Detection of Duplicate Address in Mobile Adhoc Networks for On Demand Routing...IJMER
International Journal of Modern Engineering Research (IJMER) is Peer reviewed, online Journal. It serves as an international archival forum of scholarly research related to engineering and science education.
LOAD BALANCING AND PROVIDING SECURITY USING RSA IN WIRELESS SENSOR NETWORKSIJARIIT
This paper presents load balancing and provides security using RSA algorithm. This is brief introduction to handle the traffic on node. This represents the converge-casting protocol in wireless sensor networks. The protocol is localized and distributed, and adapts efficiently to vary traffic. Graphs are analyzed using NS-2 simulator, here end-to-end packet latency, packet delivery ratio, throughput are analyzed. This is done for 30 nodes in NS-2 simulation.
An Enhanced DSR Protocol for Improving QoS in MANETKhushbooGupta145
Ad hoc network is a network without centralized administration in which different users can communicate and exchange information. In such a structure, all the nodes participate in order to achieve the network and ensure the travel of the information. Hence, multihopping techniques are used to achieve this task. The communication reliability within an ad hoc network and how the different nodes act are managed by routing protocols. Nowadays, different types of protocols exist. Nevertheless, the source routing ones, based on information known at the source of the communication, seem to attract more studies. Source routing protocols had shown interesting results in realistic scenarios in areas such as military battlefields or airport stations.
This Paper deals with DSR Protocol and is focused on the multipath aspect of this routing protocol. Since, it is necessary to understand that multipath techniques enhance reliability and can ensure security. We have simulated a new multipath algorithm. The solution had been evaluated with the network Simulator 2. Since we want to know how our protocol reacts in different mobility cases, the random waypoint model which allows us to present relevant results, due to the fact this situation is taken into account.
Simulation results show that the multipath protocol behaves better than DSR, the main actual reactive protocol. The Proposed protocol MSR performs well in high mobility by using much less overhead than DSR. Additionally, it is interesting to see that DSR without any modifications manage poorly in high mobility situation.
Efficient routing mechanism using cycle based network and k hop security in a...ijait
In a multi-domain network, Topology Aggregation (TA) may be adopted to provide limited information
regarding intra cluster connectivity without revealing detailed topology information. Nodes are grouped
into the cluster. Every cluster has border nodes, which is used for data transmission between source and
destination. The K-hop security can be used for the purpose of securing the data communication. The
topologies are spanning tree and balanced tree that can be used to reduce bandwidth overhead, delivery
delay and to increase throughput and packet delivery ratio. The shortest path can be found using
Bhandari’s algorithm and Cycle-Based Minimum-Cost Domain-Disjoint Paths (CMCDP) Algorithm for
establish the second path in the network . These topologies are compared to demonstrate the advantage of
finding shortest path using Bhandari’s algorithm.
Improving the scalability by contact information compression in routingijitjournal
The existence of reduced scalability and delivery leads to the development of scalable routing by contact
information compression. The previous work dealt with the result of consistent analysis in the performance
of DTN hierarchical routing (DHR). It increases as the source to destination distance increases with
decreases in the routing performance. This paper focuses on improving the scalability and delivery through
contact information compression algorithm and also addresses the problem of power awareness routing to
increase the lifetime of the overall network. Thus implementing the contact information compression (CIC)
algorithm the estimated shortest path (ESP) is detected dynamically. The scalability and release are more
improved during multipath multicasting, which delivers the information to a collection of target
concurrently in a single transmission from the source.
Tree Based Proactive Source Routing Protocol for MANETspaperpublications3
bstract: A mobile adhoc network (MANET) is a wireless communication network and the node that does not lie within the direct transmission range of each other depends on the intermediate nodes to forward data. Opportunistic data forwarding has not been widely utilized in mobile adhoc networks (MANETs) and the main reason is the lack of an efficient lightweight proactive routing scheme with strong source routing capability. PSR protocol facilitates opportunistic data forwarding in MANETs. In PSR, each node maintains a breadth-first search spanning tree of the network rooted at it-self. This information is periodically exchanged among neighboring nodes for updated network topology information. Here added a Mobile sink to reduce the overhead in case of number of child node increases and also to reduce the delay.
Virtual Backbone Based Content Routing in Wireless Ad-Hoc Networkijwmn
We developed a new content routing based on the virtual backbone structure, which groups wireless nodes and contents into a virtual architecture. Our approach is scalable, works with local information, and does not rely on address information. The naming system uses flat naming to identify nodes and contents, and organizes these identifiers together. Backbone nodes can be selected automatically or predefined to direct their associated normal nodes in a local area. The normal nodes are guided by the backbone nodes to full fill the searching and routing processe
Routing performance of structured overlay in Distributed Hash Tables (DHT) fo...journalBEEI
This paper presents a routing performance analysis of structured P2P overlay network. Due to the rapid development and hectic life, sharing data wirelessly is essential. P2P allows participating peers move freely by joining and leaving the network at any convenience time. Therefore, it exists constraint when one measuring the network performance. Moreover, the design of structured overlay networks is fragmented and with various design. P2P networks need to have a reliable routing protocol. In order to analyse the routing performance, this work simulates three structured overlay protocols-Chord, Pastry and Kademlia using OMNeT++ with INET and OverSim module. The result shows that Pastry is the best among others with 100% routing efficiency. However, Kademlia leads with 12.76% and 18.78% better than Chord and Pastry in lookup hop count and lookup success latency respectively. Hence, Pastry and Kamelia architectures will have a better choice for implementing structured overlay P2P network.
IOSR Journal of Electronics and Communication Engineering(IOSR-JECE) is an open access international journal that provides rapid publication (within a month) of articles in all areas of electronics and communication engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in electronics and communication engineering. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
Comparative Analysis of MANET Routing Protocols and Cluster Head Selection Te...IJERA Editor
Mobile Ad-hoc Network is a kind of wireless network. It is a backbone of new generation advanced communication technology. MANET is an ideal applicant for rescue and emergency situation due to its independence of connected devices of fixed wires. This paper represents a work on trust based system in MANET cluster that can be used to improve the performance of the network even in the existence of not trusted nodes. In the cluster architecture, cluster head and gateway nodes form a communication for routing among neighbouring clusters. But selection of cluster head is the important problem in dynamic Ad-hoc network because cluster head work as coordinator in clustered architecture. In this work, some values have used correspond to the threshold values of forward packet and dropped packet of each node within the network cluster. These values have been used dynamically updated every time and the node is selected as cluster head. In this technique of selecting the node as cluster head, the node which has maximum trusted value is elected as cluster head and this information is updated in every node’s trusted table. After implementation of our desired work, the proposed Dynamic Trust Evaluation of Cluster Head (DTE-CH) technique is analysed with traditional routing protocols and traditional clustering technique viz. Highest Degree Algorithm. The simulation is done by using network simulator software on the basis of different performance metrics throughput, packet delivery ratio, routing overhead, packet drop, average end to end delay and remain energy. Simulation result presents that proposed DTE-CH technique improves the performance of network as compare to most suitable existing AODV MANET protocol based technique as well as traditional highest degree clustering technique.
Optimised Proactive Link State Routing For DOS Attack PreventionEditor IJCATR
A Mobile Ad hoc Network is a collection of independent mobile nodes that can communicate to each other via radio waves. The mobile nodes that are in radio range of each other can directly communicate, whereas others need the aid of intermediate nodes to route their packets. Each node has a wireless interface to communicate with each other. These networks are fully distributed, and can work at any place without the help of any fixed infrastructure as access points or base stations. Routing protocols are divided into two broad classes – Reactive and Proactive. In Reactive or on demand routing protocols the routes are created only when they are needed. The application of this protocol can be seen in the Dynamic Source Routing Protocol (DSR) and the Ad-hoc On-demand Distance Vector Routing Protocol (AODV). Wherein Proactive or Table-driven routing protocols the nodes keep updating their routing tables by periodical messages. OPSR proposes a proactive mechanism in source routing.
PERFORMANCE ANALYSIS AND COMPARISON OF IMPROVED DSR WITH DSR, AODV AND DSDV R...ijp2p
Mobile Ad-hoc networks are categorized by multi-hop wireless connectivity and numbers of nodes are connecting each other through wireless network. It includes several routing protocols specifically designed for ad-hoc routing. The most widely used ad hoc routing protocols are Ad-hoc On Demand Distance Vector (AODV), Destination Sequence Distance Vector (DSDV), and Dynamic Source Routing (DSR). In this paper, we present an analysis of DSR protocol and propose our algorithm to improve the performance of DSR protocol by using small delay applied on last route ACK path when an original route fails in Mobile Ad Hoc networks. Past researchers the MANET have focused on simulation study by varying network parameters, such as network size, number of nodes. The simulation results shows that the M-DSR protocol
having some excellent performance Metrics then other protocols. We have taken different performance parameters over the comparison of Modified -DSR with other three protocols in mobility as well as Nonmobility scenario up to 300 nodes in MANETs using NS2 simulator. To achieve this goal DSR is modified by using modified algorithm technique in order to load balancing, to avoid congestion and lower packet
delivery.
Our area of interest for the paper is the improvement of performance of DSR routing protocol by
changing in algorithm and this Improved DSR protocol should compare with remaining protocols
taken in this research paper.
2. In this paper we made changesin traditional DSR protocol and generation of new improved DSR the
different performance parameters and compare with AODV/DSR/DSDV protocols in mobility and
non- mobility scenarios nodes up to 300.
3. We can plot the graphs throughput, End to end Delay, Packet delivery Ratio, Dropping Ratio, and
average energy consumption on Mobility and Non-Mobility scenario by using Network Simulator
version 2.34 for Modified DSR protocols. M-DSR, DSDV perform well when Mobility is low.
JPN1409 Neighbor Table Based Shortcut Tree Routing in ZigBee Wireless Networkschennaijp
Get the latest IEEE ns2 projects in JP INFOTECH; we are having following category wise projects like Industrial Informatics, Vehicular Technology, Networking, WSN and Manet.
For More Details:
http://jpinfotech.org/final-year-ieee-projects/2014-ieee-projects/ns2-projects/
Effect of activator solution on compressive strength of flyash geopolymer ble...IJERA Editor
The influence of the composition of activator solution on the strength of fly ash geopolymer blended with slag was investigated. The research variable include % Na2O and sodium silicate under typical controlled parameters like curing profile, water content, base material and supplementary material. In this study, the monitoring response variable was compressive strength. Finding suggests that activator solution combination has a significant effect on the properties of the GP (non-blended geopolymer) and GB (geopolymer blended with 15% slag). The experiment concludes that higher percentage of Na2O gives lower strength for GB specimens but corresponding higher strength for GP specimens. Silicate modulus has similar impact on GP and GB. Both for GP and GB specimens compressive strength is increase with higher silicate modulus.
Identification Of Ground Water Potential Zones In Tamil Nadu By Remote Sensin...IJERA Editor
A case study was conducted to find out the groundwater potential zones in Salem, Erode and Namakkal districts, Tamil Nadu, India with an aerial extent of 360.60 km2. The thematic maps such as geology, geomorphology, soil hydrological group, land use / land cover and drainage map were prepared for the study area. The Digital Elevation Model (DEM) has been generated from the 10 m interval contour lines (which is derived from SOI, Toposheet 1:25000 scale) and obtained the slope (%) of the study area. The groundwater potential zones were obtained by overlaying all the thematic maps in terms of weighted overlay methods using the spatial analysis tool in Arc GIS 9.3. During weighted overlay analysis, the ranking has been given for each individual parameter of each thematic map and weights were assigned according to the influence such as soil −25%, geomorphology − 25%, land use/land cover −25%, slope − 15%, lineament − 5% and drainage / streams − 5% and find out the potential zones in terms of good, moderate and poor zones with the area of 49.70 km2, 261.61 km2 and 46.04 km2 respectively. The potential zone wise study area was overlaid with village boundary map and the village wise groundwater potential zones with three categories such as good, moderate and poor zones were obtained. This GIS based output result was validated by conducting field survey by randomly selecting wells in different villages using GPS instruments. The coordinates of each well location were obtained by GPS and plotted in the GIS platform and it was clearly shown that the well coordinates were exactly seated with the classified zones.
An Efficient Block Matching Algorithm Using Logical ImageIJERA Editor
Motion estimation, which has been widely used in various image sequence coding schemes, plays a key role in the transmission and storage of video signals at reduced bit rates. There are two classes of motion estimation methods, Block matching algorithms (BMA) and Pel-recursive algorithms (PRA). Due to its implementation simplicity, block matching algorithms have been widely adopted by various video coding standards such as CCITT H.261, ITU-T H.263, and MPEG. In BMA, the current image frame is partitioned into fixed-size rectangular blocks. The motion vector for each block is estimated by finding the best matching block of pixels within the search window in the previous frame according to matching criteria. The goal of this work is to find a fast method for motion estimation and motion segmentation using proposed model. Recent day Communication between ends is facilitated by the development in the area of wired and wireless networks. And it is a challenge to transmit large data file over limited bandwidth channel. Block matching algorithms are very useful in achieving the efficient and acceptable compression. Block matching algorithm defines the total computation cost and effective bit budget. To efficiently obtain motion estimation different approaches can be followed but above constraints should be kept in mind. This paper presents a novel method using three step and diamond algorithms with modified search pattern based on logical image for the block based motion estimation. It has been found that, the improved PSNR value obtained from proposed algorithm shows a better computation time (faster) as compared to original Three step Search (3SS/TSS ) method .The experimental results based on the number of video sequences were presented to demonstrate the advantages of proposed motion estimation technique.
Modeling the transport of charge carriers in the active devices diode submicr...IJERA Editor
A Monte Carlo simulation program was developed to simulate the movement of electrons in a submicron GaInP diode three dimensional (3D) with 0.1 microns-long active layer. The algorithm couples a standard Monte Carlo particle simulator for the Boltzmann equation with a 3D Poisson solver. Thus a series of hits for a specific MC submicron diode (GaInP), with an active layer (n = 2x1015cm-3) of length 0.1μm surrounded by two regions doped with n = 5x1017cm-3, are presented. The lattice temperature is 300K and the anode voltage Va is 1V. The analysis also showed that the average drift velocity to the electrons in the channel is about 5x106 cm/sec
Efficient routing mechanism using cycle based network and k hop security in a...ijait
In a multi-domain network, Topology Aggregation (TA) may be adopted to provide limited information
regarding intra cluster connectivity without revealing detailed topology information. Nodes are grouped
into the cluster. Every cluster has border nodes, which is used for data transmission between source and
destination. The K-hop security can be used for the purpose of securing the data communication. The
topologies are spanning tree and balanced tree that can be used to reduce bandwidth overhead, delivery
delay and to increase throughput and packet delivery ratio. The shortest path can be found using
Bhandari’s algorithm and Cycle-Based Minimum-Cost Domain-Disjoint Paths (CMCDP) Algorithm for
establish the second path in the network . These topologies are compared to demonstrate the advantage of
finding shortest path using Bhandari’s algorithm.
Improving the scalability by contact information compression in routingijitjournal
The existence of reduced scalability and delivery leads to the development of scalable routing by contact
information compression. The previous work dealt with the result of consistent analysis in the performance
of DTN hierarchical routing (DHR). It increases as the source to destination distance increases with
decreases in the routing performance. This paper focuses on improving the scalability and delivery through
contact information compression algorithm and also addresses the problem of power awareness routing to
increase the lifetime of the overall network. Thus implementing the contact information compression (CIC)
algorithm the estimated shortest path (ESP) is detected dynamically. The scalability and release are more
improved during multipath multicasting, which delivers the information to a collection of target
concurrently in a single transmission from the source.
Tree Based Proactive Source Routing Protocol for MANETspaperpublications3
bstract: A mobile adhoc network (MANET) is a wireless communication network and the node that does not lie within the direct transmission range of each other depends on the intermediate nodes to forward data. Opportunistic data forwarding has not been widely utilized in mobile adhoc networks (MANETs) and the main reason is the lack of an efficient lightweight proactive routing scheme with strong source routing capability. PSR protocol facilitates opportunistic data forwarding in MANETs. In PSR, each node maintains a breadth-first search spanning tree of the network rooted at it-self. This information is periodically exchanged among neighboring nodes for updated network topology information. Here added a Mobile sink to reduce the overhead in case of number of child node increases and also to reduce the delay.
Virtual Backbone Based Content Routing in Wireless Ad-Hoc Networkijwmn
We developed a new content routing based on the virtual backbone structure, which groups wireless nodes and contents into a virtual architecture. Our approach is scalable, works with local information, and does not rely on address information. The naming system uses flat naming to identify nodes and contents, and organizes these identifiers together. Backbone nodes can be selected automatically or predefined to direct their associated normal nodes in a local area. The normal nodes are guided by the backbone nodes to full fill the searching and routing processe
Routing performance of structured overlay in Distributed Hash Tables (DHT) fo...journalBEEI
This paper presents a routing performance analysis of structured P2P overlay network. Due to the rapid development and hectic life, sharing data wirelessly is essential. P2P allows participating peers move freely by joining and leaving the network at any convenience time. Therefore, it exists constraint when one measuring the network performance. Moreover, the design of structured overlay networks is fragmented and with various design. P2P networks need to have a reliable routing protocol. In order to analyse the routing performance, this work simulates three structured overlay protocols-Chord, Pastry and Kademlia using OMNeT++ with INET and OverSim module. The result shows that Pastry is the best among others with 100% routing efficiency. However, Kademlia leads with 12.76% and 18.78% better than Chord and Pastry in lookup hop count and lookup success latency respectively. Hence, Pastry and Kamelia architectures will have a better choice for implementing structured overlay P2P network.
IOSR Journal of Electronics and Communication Engineering(IOSR-JECE) is an open access international journal that provides rapid publication (within a month) of articles in all areas of electronics and communication engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in electronics and communication engineering. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
Comparative Analysis of MANET Routing Protocols and Cluster Head Selection Te...IJERA Editor
Mobile Ad-hoc Network is a kind of wireless network. It is a backbone of new generation advanced communication technology. MANET is an ideal applicant for rescue and emergency situation due to its independence of connected devices of fixed wires. This paper represents a work on trust based system in MANET cluster that can be used to improve the performance of the network even in the existence of not trusted nodes. In the cluster architecture, cluster head and gateway nodes form a communication for routing among neighbouring clusters. But selection of cluster head is the important problem in dynamic Ad-hoc network because cluster head work as coordinator in clustered architecture. In this work, some values have used correspond to the threshold values of forward packet and dropped packet of each node within the network cluster. These values have been used dynamically updated every time and the node is selected as cluster head. In this technique of selecting the node as cluster head, the node which has maximum trusted value is elected as cluster head and this information is updated in every node’s trusted table. After implementation of our desired work, the proposed Dynamic Trust Evaluation of Cluster Head (DTE-CH) technique is analysed with traditional routing protocols and traditional clustering technique viz. Highest Degree Algorithm. The simulation is done by using network simulator software on the basis of different performance metrics throughput, packet delivery ratio, routing overhead, packet drop, average end to end delay and remain energy. Simulation result presents that proposed DTE-CH technique improves the performance of network as compare to most suitable existing AODV MANET protocol based technique as well as traditional highest degree clustering technique.
Optimised Proactive Link State Routing For DOS Attack PreventionEditor IJCATR
A Mobile Ad hoc Network is a collection of independent mobile nodes that can communicate to each other via radio waves. The mobile nodes that are in radio range of each other can directly communicate, whereas others need the aid of intermediate nodes to route their packets. Each node has a wireless interface to communicate with each other. These networks are fully distributed, and can work at any place without the help of any fixed infrastructure as access points or base stations. Routing protocols are divided into two broad classes – Reactive and Proactive. In Reactive or on demand routing protocols the routes are created only when they are needed. The application of this protocol can be seen in the Dynamic Source Routing Protocol (DSR) and the Ad-hoc On-demand Distance Vector Routing Protocol (AODV). Wherein Proactive or Table-driven routing protocols the nodes keep updating their routing tables by periodical messages. OPSR proposes a proactive mechanism in source routing.
PERFORMANCE ANALYSIS AND COMPARISON OF IMPROVED DSR WITH DSR, AODV AND DSDV R...ijp2p
Mobile Ad-hoc networks are categorized by multi-hop wireless connectivity and numbers of nodes are connecting each other through wireless network. It includes several routing protocols specifically designed for ad-hoc routing. The most widely used ad hoc routing protocols are Ad-hoc On Demand Distance Vector (AODV), Destination Sequence Distance Vector (DSDV), and Dynamic Source Routing (DSR). In this paper, we present an analysis of DSR protocol and propose our algorithm to improve the performance of DSR protocol by using small delay applied on last route ACK path when an original route fails in Mobile Ad Hoc networks. Past researchers the MANET have focused on simulation study by varying network parameters, such as network size, number of nodes. The simulation results shows that the M-DSR protocol
having some excellent performance Metrics then other protocols. We have taken different performance parameters over the comparison of Modified -DSR with other three protocols in mobility as well as Nonmobility scenario up to 300 nodes in MANETs using NS2 simulator. To achieve this goal DSR is modified by using modified algorithm technique in order to load balancing, to avoid congestion and lower packet
delivery.
Our area of interest for the paper is the improvement of performance of DSR routing protocol by
changing in algorithm and this Improved DSR protocol should compare with remaining protocols
taken in this research paper.
2. In this paper we made changesin traditional DSR protocol and generation of new improved DSR the
different performance parameters and compare with AODV/DSR/DSDV protocols in mobility and
non- mobility scenarios nodes up to 300.
3. We can plot the graphs throughput, End to end Delay, Packet delivery Ratio, Dropping Ratio, and
average energy consumption on Mobility and Non-Mobility scenario by using Network Simulator
version 2.34 for Modified DSR protocols. M-DSR, DSDV perform well when Mobility is low.
JPN1409 Neighbor Table Based Shortcut Tree Routing in ZigBee Wireless Networkschennaijp
Get the latest IEEE ns2 projects in JP INFOTECH; we are having following category wise projects like Industrial Informatics, Vehicular Technology, Networking, WSN and Manet.
For More Details:
http://jpinfotech.org/final-year-ieee-projects/2014-ieee-projects/ns2-projects/
Effect of activator solution on compressive strength of flyash geopolymer ble...IJERA Editor
The influence of the composition of activator solution on the strength of fly ash geopolymer blended with slag was investigated. The research variable include % Na2O and sodium silicate under typical controlled parameters like curing profile, water content, base material and supplementary material. In this study, the monitoring response variable was compressive strength. Finding suggests that activator solution combination has a significant effect on the properties of the GP (non-blended geopolymer) and GB (geopolymer blended with 15% slag). The experiment concludes that higher percentage of Na2O gives lower strength for GB specimens but corresponding higher strength for GP specimens. Silicate modulus has similar impact on GP and GB. Both for GP and GB specimens compressive strength is increase with higher silicate modulus.
Identification Of Ground Water Potential Zones In Tamil Nadu By Remote Sensin...IJERA Editor
A case study was conducted to find out the groundwater potential zones in Salem, Erode and Namakkal districts, Tamil Nadu, India with an aerial extent of 360.60 km2. The thematic maps such as geology, geomorphology, soil hydrological group, land use / land cover and drainage map were prepared for the study area. The Digital Elevation Model (DEM) has been generated from the 10 m interval contour lines (which is derived from SOI, Toposheet 1:25000 scale) and obtained the slope (%) of the study area. The groundwater potential zones were obtained by overlaying all the thematic maps in terms of weighted overlay methods using the spatial analysis tool in Arc GIS 9.3. During weighted overlay analysis, the ranking has been given for each individual parameter of each thematic map and weights were assigned according to the influence such as soil −25%, geomorphology − 25%, land use/land cover −25%, slope − 15%, lineament − 5% and drainage / streams − 5% and find out the potential zones in terms of good, moderate and poor zones with the area of 49.70 km2, 261.61 km2 and 46.04 km2 respectively. The potential zone wise study area was overlaid with village boundary map and the village wise groundwater potential zones with three categories such as good, moderate and poor zones were obtained. This GIS based output result was validated by conducting field survey by randomly selecting wells in different villages using GPS instruments. The coordinates of each well location were obtained by GPS and plotted in the GIS platform and it was clearly shown that the well coordinates were exactly seated with the classified zones.
An Efficient Block Matching Algorithm Using Logical ImageIJERA Editor
Motion estimation, which has been widely used in various image sequence coding schemes, plays a key role in the transmission and storage of video signals at reduced bit rates. There are two classes of motion estimation methods, Block matching algorithms (BMA) and Pel-recursive algorithms (PRA). Due to its implementation simplicity, block matching algorithms have been widely adopted by various video coding standards such as CCITT H.261, ITU-T H.263, and MPEG. In BMA, the current image frame is partitioned into fixed-size rectangular blocks. The motion vector for each block is estimated by finding the best matching block of pixels within the search window in the previous frame according to matching criteria. The goal of this work is to find a fast method for motion estimation and motion segmentation using proposed model. Recent day Communication between ends is facilitated by the development in the area of wired and wireless networks. And it is a challenge to transmit large data file over limited bandwidth channel. Block matching algorithms are very useful in achieving the efficient and acceptable compression. Block matching algorithm defines the total computation cost and effective bit budget. To efficiently obtain motion estimation different approaches can be followed but above constraints should be kept in mind. This paper presents a novel method using three step and diamond algorithms with modified search pattern based on logical image for the block based motion estimation. It has been found that, the improved PSNR value obtained from proposed algorithm shows a better computation time (faster) as compared to original Three step Search (3SS/TSS ) method .The experimental results based on the number of video sequences were presented to demonstrate the advantages of proposed motion estimation technique.
Modeling the transport of charge carriers in the active devices diode submicr...IJERA Editor
A Monte Carlo simulation program was developed to simulate the movement of electrons in a submicron GaInP diode three dimensional (3D) with 0.1 microns-long active layer. The algorithm couples a standard Monte Carlo particle simulator for the Boltzmann equation with a 3D Poisson solver. Thus a series of hits for a specific MC submicron diode (GaInP), with an active layer (n = 2x1015cm-3) of length 0.1μm surrounded by two regions doped with n = 5x1017cm-3, are presented. The lattice temperature is 300K and the anode voltage Va is 1V. The analysis also showed that the average drift velocity to the electrons in the channel is about 5x106 cm/sec
Статья Ольги Гопкало «Тенденции и проблемы развития инфраструктуры для контей...Olga Gopkalo
В статье дан обзор тенденций российского рынка контейнерных перевозок (перевалка в морских портах, железнодорожные и автомобильные перевозки, перевалка на железнодорожных терминалах): анализ грузопотоков по основным направлениям, структуре грузов, игрокам рынка. Описаны тенденции и перспективы развития контейнерных терминалов, морских и сухопутных/
An Intelligent Human Computer Communication with Real Time Hand Gesture for M...IJERA Editor
This paper may be helpful in making the living of handicapped people easy which will be helpful for the handicapped people to drive their wheelchair through finger operation. It is an opportunity to be a handicapped as independent. System comprises of integration of finger operation using digital image processing and embedded technology .According to the World Health Organization (WHO), between the 7 and 10% of the population worldwide suffer from some physical disability. In Latin-America the physically disabled are estimated in 55 million people, which represent the 9% of its total population. This census indicates that the most common disability is motor, followed by blindness, deafness, intellectual and language. All alone, the motor-disabled achieve 20 million in Latin-America and there is an anticipated continued growth due to increasing aging, longevity and accident related injuries. Wheelchairs make up a significant portion of the mobility assistive devices in use for those. Since the 1930s, the design concept of a wheelchair has been the same: a main frame, two large rear wheels and two small front wheels called casters. This basic design has been used to develop many of today’ wheelchairs by applying slight design modifications to produce lighter, more durable and more comfortable wheelchairs for people who use them on a daily basis. Finally it means that is affordable and beneficial by the people.
Determination Of Iron, Cobalt, Chromium And Copper Metals In Commercially Ava...IJERA Editor
Khat (Catha sedulous foresk) is a plant that grows in a certain area of east Africa and Arab peninsula. A large number of peoples in Ethiopia chew chat leaves because of its pleasurable and stimulating effects. In the present study the levels of selected trace metals (Cu, Co, Cr and Fe) in two different kinds of Khat sampled from different khat shops in Arba Minch were analyzed. The discern weights of oven dried khat samples were digested by wet digestion using 3ml of HNO3, 1ml of HClO4 and 1ml of H2O2 by setting the temperature first to 60oc for 30 min and then increased to 210oc for the next 2h and 30 min. The content of minerals in the digests was analyzed using flame atomic spectrometry. The concentration of the trace metals in dry weight (μg/g) were obtained in the khat samples Co 5μg/g, Cu 4μg/g, Fe 2.9μg/g and Cr 3μg/g. Among the metal content analyzed Co was the most abundant one followed by Cu and Cr whereas Fe was less abundant metal in khat sample that grown in Arba Minch area.
Studying the factors affecting solar power generation systems performance ( S...IJERA Editor
Solar energy is a huge, clean and renewable source of energy. It is also available everywhere on the earth. However, there are many technical and economic difficulties need to be solved so that solar energy becomes a strong competition against the traditional energy sources. Energy from the sun can be used successfully in electric power generation systems. Depending on the climate conditions and the use of a properly designed, installing and maintained system can meet a large demand in this request. Work plane for this research will include many steps, the first step will include an introduction to solar energy. The second step will be a short review of the solar energy availability, geometry, fields of applications and the largest commercial application of solar energy is the solar thermal power generation. In addition, the most common types of solar thermal power plants, the solar field, heat transfer fluid and the power conversion system types will be explained in detail. The third step, a simple analysis for the solar thermal power plant will be explained in order to predict the optimum conditions leading to maximum performance. Discussions of results will be the fourth step. The last step a conclusion and recommendation for future work will also be included.
Exergy analysis of inlet water temperature of condenserIJERA Editor
The most of the power plant designed by energetic performance criteria based on first law of thermodynamics. According to First law of thermodynamics energy analysis cannot be justified the losses of energy.The method of exergy analysis is well suited to describe true magnitude of waste and loss to be determined. Such information can be used in the design of new energy efficient system and increasing the efficiency of existing systems.In the present study exergy analysis of the shell and tube condenser is carried out. As the condenser is one of the major components of the power plant, so it is necessary to operate the condenser efficiently under the various operating condition to increase the overall efficiency of the power plant. In the present study inlet temperature of the condenser is optimized using the exergy method. The main aim of paper is to be find out causes of energy destruction that can be helpful to redesign the system and to increase the efficiency
The Opportunity of Using Wind to Generate Power as a Renewable Energy:"Case o...IJERA Editor
The demand ofsustainable energy is increased daily by expanding our cities and creating new cities and suburbswith huge towers besides increasing in population,moreover the environment and human life is threatening by the pollutions resulted from energy generation. For this reason the researchersattracted todevelop renewable energy and explore its large benefits and unit capacity. Wind power is one of the clean renewable energy resources.Therefore the importance of implementing this resource in Kuwait draws our attention to make this research to emphasis on the technical and economic aspects due to acceptable environmental conditions. Whereas, in some areas of the world, such as in Japan, has some geographical and electrical restrictions such as power fluctuating for land wind generation. And the introductionof large amount of wind power generation tends to be extremely difficult and even impossible in some location. This research is aimed to concentrate on the visibility of utilizing the wind energy as complementary source for the existing steam and gas turbine power stations in Kuwait, furthermore point out the economical perspectives that will guide us to take the right decision. The location of wind farms is very important in this aspect where we cannot build such projects inside the cities between buildings besides meeting the minimum requirements for economic generation. The study prove to us that even at a location which is almost close to the inhabitants buildings ( Kuwait airport ) can get accepted results the historical data was collected from the weather station at internet. The implementation of wind turbine farms is foreseen to be economic in generation for long run and encouragestepping up toward putting the infrastructure design. Furthermoreit is an opportunity for creating new job vacancies.
Simulation of Height of Stack Pile using SCREEN3 module for Particulate Matte...IJERA Editor
This study is regarding the air pollution in selected areas near to port (beside stack yards of port) interested in particulate matter pollution. In this study, the amount of air pollution due to particulates is analyzed. The amount of air pollution is estimated using SCREEN 3 Methodology. In this study, SCREEN 3 methodology is a predefined software tool which can be used to estimate particulate matter pollution levels at different source release heights, terrain heights and at particular receptor height. The results obtained are reported and finally concluded that to avoid the pollution in the selected area, it is better to construct a periphery along the sides of stack yard (source of pollution).
Shortcut Path Tress for Zigbee based Wireless NetworkIJERA Editor
Neighbour Table based shortcut tree routing protocol provides the near optimal routing path as well as maintains the advantages of the ZigBee tree routing such as no route discovery overhead and low memory consumption. However, in Neighbour table based Shortcut tree routing the limitation is that route discovery is only on basis of Distance between Nodes; thus, it cannot provide optimized paths. Here, the concept of link quality factor between nodes along with the distance between two nodes to calculate the shortest path between source and destination. Where the Link quality will depend upon traffic between two nodes, higher the traffic lesser the link quality and vice versa. Score will be calculated for links which is function of Distance and Link Quality between nodes i.e score= f(d,lq), this is the idea proposed in OPTIMIZING ROUTING PATHS UING SHORTCUT TREES FOR ZIGBEE BASED WIRELESS NETWORK.
Routing Protocols in Zigbee Based networks: A SurveyIJEEE
ZigBee is the new standard developed wireless personal area network (WPAN) based on IEEE 802.15.4 for low cost, low data rate and low power consumption wireless network. In present times, zigbee has become a hot topic for research and development all over the world. This paper briefly describes various ZigBee network topologies including star, cluster tree and mesh topology and further introduces different ZigBee routing protocols such as AODV, AODVjr, Hierarchical, Integrated and Enhanced hierarchical routing protocol (EHRP).
E-Lins Technology provides an insight on routing. E-Lins Technology are the manufacturers and providers of the one of the best 3G/4G routers across the globe.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Performance Evaluation and Comparison of Ad-Hoc Source Routing ProtocolsNarendra Singh Yadav
Mobile ad hoc network is a reconfigurable network of mobile nodes connected by multi-hop wireless links and capable of operating without any fixed infrastructure support. In order to facilitate communication within such self-creating, self-organizing and self-administrating network, a dynamic routing protocol is needed. The primary goal of such an ad hoc network routing protocol is to discover and establish a correct and efficient route between a pair of nodes so that messages may be delivered in a timely manner. Route construction should be done with a minimum of overhead and bandwidth consumption. This paper examines two routing protocols, both on-demand source routing, for mobile ad hoc networks– the Dynamic Source Routing (DSR), an flat architecture based and the Cluster Based Routing Protocol (CBRP), a cluster architecture based and evaluates both routing protocols in terms of packet delivery fraction normalized routing load, average end to end delay by varying speed of nodes, traffic sources and mobility.
Influence of Clustering on the Performance of MobileAd Hoc Networks (MANETs)Narendra Singh Yadav
Clustering is an important research area for mobile ad hoc networks (MANETs) as it increases the capacity of network, reduces the routing overhead and makes the network more scalable in the presence of both high mobility and a large number of mobile nodes. Routing protocols based on flat topology are not scalable because of their built-in characteristics. However, clustering cause overhead which consumes considerable bandwidth, drain mobile nodes energy quickly, likely cause congestion, collision and data delay in larger networks. This paper uses an implementation of the Dynamic Source Routing (DSR), an flat architecture based and the Cluster Based Routing Protocol (CBRP), a cluster architecture based routing protocol to examine the influence of clustering on the performance of mobile ad hoc networks. This paper evaluates channel utilization and control overhead as a function of number of nodes per sq. km to show the effect of clustering. Simulation results show that in high mobility scenarios, CBRP outperforms DSR. CBRP scales well with increasing number of nodes.
Comparatively analysis of AODV and DSR in MAC layer for Ad Hoc Environmentijsrd.com
In Wireless Adhoc Network is a group of wireless mobile nodes is an autonomous system of mobile nodes connected by wireless links. Every node operates as an end system and as a router to forward packets. In this paper mainly focused on Mac layer because this layer is most important for the data communication using control the packet loss and we worked on the comparison based performance of wimax802.16 and wireless802.11 networks using Ad hoc on- demand Distance Vector Routing Protocol and Dynamic Source Routing Protocol. In this paper we used the different maximum speed for the network. And this comparison based on unicast On-demand routing procedure and our simulation for mobile ad hoc networks discover and maintain only needed the design and follows the idea that each node by sending routing packets whenever a communication is requested and compared various parameter packet delivery ratio, normalized routing load and e-e delay. These simulations are carried out using the Network simulator version-2. The results presented in this work illustrate the importance in carefully evaluating and implementing routing protocols in an ad hoc environment.
Performance Comparison of AODV and DSDV Routing Protocols for Ad-hoc Wireless...Narendra Singh Yadav
An ad hoc network is a collection of mobile nodes communicating through wireless channels without any existing network infrastructure or centralized administration. Because of the limited transmission range of wireless network interfaces, multiple “hops” may be needed to exchange data across the network. Consequently, many routing algorithms have come into existence to satisfy the needs of communications in such networks. This paper presents performance comparison of the three routing protocols AODV and DSDV. Protocols were simulated using the ns-2 and were compared in terms of packet delivery fraction, normalized routing load and average delay, while varying number of nodes, and pause time. Simulation revealed that although DSDV perfectly scales to small networks with low node speeds, AODV is preferred due to its more efficient use of bandwidth.
Improving the Proactive Routing Protocol using Depth First Iterative Deepenin...IJECEIAES
Owing to the wireless and mobility nature, nodes in a mobile ad hoc network are not within the transmission range. It needs to transfer data through the multi-intermediate nodes. Opportunistic data forwarding is an assuring solution to make use of the broadcast environment of wireless communication links. Due to absence of source routing capability with efficient proactive routing protocol, it is not widely used. To rectify the problem, we proposed memory and routing efficient proactive routing protocol using Depth-First Iterative-Deepening and hello messaging scheme. This protocol can conserve the topology information in every node in the network. In experimental analysis and discussion, we implemented the proposed work using NS2 simulator tool and proved that the proposed technique is performed well in terms of average delay, buffer and throughput.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Cost Effective Routing Protocols Based on Two Hop Neighborhood Information (2...Eswar Publications
Ad hoc networks are collections of mobile nodes communicating with each other using wireless media without any fixed infrastructure. During both route discovery and traversal of route-reply packets from destination to source,
broadcast of packets is required which incurs huge message cost. The present article deals with the message cost
reduction during transmission of route-reply from destination to source. Also the redundancy that is visible within the 2-hop neighborhood of a node is minimized during broadcasting of route-reply. This improves the average lifetime of network nodes by decreasing the possibility of network partition. The scheme of 2NI can be used with any reactive routing protocol in MANETs.
Mobility is one of the basic features that define an ad hoc network, an asset that leaves the field
free for the nodes to move. The most important aspect of this kind of network turns into a great
disadvantage when it comes to commercial applications, take as an example: the automotive
networks that allow communication between a groups of vehicles. The ad hoc on-demand
distance vector (AODV) routing protocol, designed for mobile ad hoc networks, has two main
functions. First, it enables route establishment between a source and a destination node by
initiating a route discovery process. Second, it maintains the active routes, which means finding
alternative routes in a case of a link failure and deleting routes when they are no longer
desired. In a highly mobile network those are demanding tasks to be performed efficiently and
accurately. In this paper, we focused in the first point to enhance the local decision of each node
in the network by the quantification of the mobility of their neighbours. Quantification is made
around RSSI algorithm a well known distance estimation method.
Shortest path algorithm for data transmission in wireless ad hoc sensor networksijasuc
Wireless sensor networks determine probable in military, environments, health and commercial
applications. The process of transferring of information from a remote sensor node to other nodes in a
network holds importance for such applications. Various constraints such as limited computation, storage
and power makes the process of transferring of information routing interesting and has opened new arenas
for researchers. The fundamental problem in sensor networks states the significance and routing of
information through a real path as path length decides some basic performance parameters for sensor
networks. This paper strongly focuses on a shortest path algorithm for wireless adhoc networks. The
simulations are performed on NS2 and the results obtained discuss the role of transferring of information
through a shortest path.
Similar to Shortest Tree Routing With Security In Wireless Sensor Networks (20)
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.
UiPath Test Automation using UiPath Test Suite series, part 4DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 4. In this session, we will cover Test Manager overview along with SAP heatmap.
The UiPath Test Manager overview with SAP heatmap webinar offers a concise yet comprehensive exploration of the role of a Test Manager within SAP environments, coupled with the utilization of heatmaps for effective testing strategies.
Participants will gain insights into the responsibilities, challenges, and best practices associated with test management in SAP projects. Additionally, the webinar delves into the significance of heatmaps as a visual aid for identifying testing priorities, areas of risk, and resource allocation within SAP landscapes. Through this session, attendees can expect to enhance their understanding of test management principles while learning practical approaches to optimize testing processes in SAP environments using heatmap visualization techniques
What will you get from this session?
1. Insights into SAP testing best practices
2. Heatmap utilization for testing
3. Optimization of testing processes
4. Demo
Topics covered:
Execution from the test manager
Orchestrator execution result
Defect reporting
SAP heatmap example with demo
Speaker:
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
Smart TV Buyer Insights Survey 2024 by 91mobiles.pdf91mobiles
91mobiles recently conducted a Smart TV Buyer Insights Survey in which we asked over 3,000 respondents about the TV they own, aspects they look at on a new TV, and their TV buying preferences.
Transcript: Selling digital books in 2024: Insights from industry leaders - T...BookNet Canada
The publishing industry has been selling digital audiobooks and ebooks for over a decade and has found its groove. What’s changed? What has stayed the same? Where do we go from here? Join a group of leading sales peers from across the industry for a conversation about the lessons learned since the popularization of digital books, best practices, digital book supply chain management, and more.
Link to video recording: https://bnctechforum.ca/sessions/selling-digital-books-in-2024-insights-from-industry-leaders/
Presented by BookNet Canada on May 28, 2024, with support from the Department of Canadian Heritage.
Connector Corner: Automate dynamic content and events by pushing a buttonDianaGray10
Here is something new! In our next Connector Corner webinar, we will demonstrate how you can use a single workflow to:
Create a campaign using Mailchimp with merge tags/fields
Send an interactive Slack channel message (using buttons)
Have the message received by managers and peers along with a test email for review
But there’s more:
In a second workflow supporting the same use case, you’ll see:
Your campaign sent to target colleagues for approval
If the “Approve” button is clicked, a Jira/Zendesk ticket is created for the marketing design team
But—if the “Reject” button is pushed, colleagues will be alerted via Slack message
Join us to learn more about this new, human-in-the-loop capability, brought to you by Integration Service connectors.
And...
Speakers:
Akshay Agnihotri, Product Manager
Charlie Greenberg, Host
Accelerate your Kubernetes clusters with Varnish CachingThijs Feryn
A presentation about the usage and availability of Varnish on Kubernetes. This talk explores the capabilities of Varnish caching and shows how to use the Varnish Helm chart to deploy it to Kubernetes.
This presentation was delivered at K8SUG Singapore. See https://feryn.eu/presentations/accelerate-your-kubernetes-clusters-with-varnish-caching-k8sug-singapore-28-2024 for more details.
Essentials of Automations: Optimizing FME Workflows with ParametersSafe Software
Are you looking to streamline your workflows and boost your projects’ efficiency? Do you find yourself searching for ways to add flexibility and control over your FME workflows? If so, you’re in the right place.
Join us for an insightful dive into the world of FME parameters, a critical element in optimizing workflow efficiency. This webinar marks the beginning of our three-part “Essentials of Automation” series. This first webinar is designed to equip you with the knowledge and skills to utilize parameters effectively: enhancing the flexibility, maintainability, and user control of your FME projects.
Here’s what you’ll gain:
- Essentials of FME Parameters: Understand the pivotal role of parameters, including Reader/Writer, Transformer, User, and FME Flow categories. Discover how they are the key to unlocking automation and optimization within your workflows.
- Practical Applications in FME Form: Delve into key user parameter types including choice, connections, and file URLs. Allow users to control how a workflow runs, making your workflows more reusable. Learn to import values and deliver the best user experience for your workflows while enhancing accuracy.
- Optimization Strategies in FME Flow: Explore the creation and strategic deployment of parameters in FME Flow, including the use of deployment and geometry parameters, to maximize workflow efficiency.
- Pro Tips for Success: Gain insights on parameterizing connections and leveraging new features like Conditional Visibility for clarity and simplicity.
We’ll wrap up with a glimpse into future webinars, followed by a Q&A session to address your specific questions surrounding this topic.
Don’t miss this opportunity to elevate your FME expertise and drive your projects to new heights of efficiency.
State of ICS and IoT Cyber Threat Landscape Report 2024 previewPrayukth K V
The IoT and OT threat landscape report has been prepared by the Threat Research Team at Sectrio using data from Sectrio, cyber threat intelligence farming facilities spread across over 85 cities around the world. In addition, Sectrio also runs AI-based advanced threat and payload engagement facilities that serve as sinks to attract and engage sophisticated threat actors, and newer malware including new variants and latent threats that are at an earlier stage of development.
The latest edition of the OT/ICS and IoT security Threat Landscape Report 2024 also covers:
State of global ICS asset and network exposure
Sectoral targets and attacks as well as the cost of ransom
Global APT activity, AI usage, actor and tactic profiles, and implications
Rise in volumes of AI-powered cyberattacks
Major cyber events in 2024
Malware and malicious payload trends
Cyberattack types and targets
Vulnerability exploit attempts on CVEs
Attacks on counties – USA
Expansion of bot farms – how, where, and why
In-depth analysis of the cyber threat landscape across North America, South America, Europe, APAC, and the Middle East
Why are attacks on smart factories rising?
Cyber risk predictions
Axis of attacks – Europe
Systemic attacks in the Middle East
Download the full report from here:
https://sectrio.com/resources/ot-threat-landscape-reports/sectrio-releases-ot-ics-and-iot-security-threat-landscape-report-2024/
Search and Society: Reimagining Information Access for Radical FuturesBhaskar Mitra
The field of Information retrieval (IR) is currently undergoing a transformative shift, at least partly due to the emerging applications of generative AI to information access. In this talk, we will deliberate on the sociotechnical implications of generative AI for information access. We will argue that there is both a critical necessity and an exciting opportunity for the IR community to re-center our research agendas on societal needs while dismantling the artificial separation between the work on fairness, accountability, transparency, and ethics in IR and the rest of IR research. Instead of adopting a reactionary strategy of trying to mitigate potential social harms from emerging technologies, the community should aim to proactively set the research agenda for the kinds of systems we should build inspired by diverse explicitly stated sociotechnical imaginaries. The sociotechnical imaginaries that underpin the design and development of information access technologies needs to be explicitly articulated, and we need to develop theories of change in context of these diverse perspectives. Our guiding future imaginaries must be informed by other academic fields, such as democratic theory and critical theory, and should be co-developed with social science scholars, legal scholars, civil rights and social justice activists, and artists, among others.
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.
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.
LF Energy Webinar: Electrical Grid Modelling and Simulation Through PowSyBl -...
Shortest Tree Routing With Security In Wireless Sensor Networks
1. P.T Arshad Int. Journal of Engineering Research and Applications www.ijera.com
ISSN : 2248-9622, Vol. 4, Issue 12( Part 6), December 2014, pp.136-140
www.ijera.com 136 | P a g e
Shortest Tree Routing With Security In Wireless Sensor
Networks
P.T Arshad 1
, Dr. C. Chandrasekar 2
1
(M.Phil Research Scholar, Sree Narayana Guru College, K.G.Chavadi, Coimbatore, India.)
2
( Asst. Professor, Department of Computer Science and Applications, Sree Narayana Guru College,
K.G.Chavadi, Coimbatore, India.)
ABSTRACT
We propose STR to resolve the main reasons of overall network performance degradation of ZTR, which are the
detour path problem and the traffic concentration problem. Second, we prove that the 1-hop neighbor nodes
used by STR improve the routing path efficiency and alleviate the traffic load concentrated on tree links in ZTR.
Third, we analyze the performance of ZTR, STR, and AODV by differentiating the network conditions such as
network density, ZigBee network constraints, traffic types, and the network traffic. For modification security
purpose we are also encrypting the data packets during transmission. So that the intermediate nodes are not able
to view the data during transmission. For Encryption process, we are using RC4 Algorithm. Short cut tree
routing is used for minimizing the routing path from source to destination.
Keywords- RC4, Short Cut Routing , Wireless network ,Zigbee tree routing.
I. INTRODUCTION
The ZigBee network layer, which is the core of
the standard, provides dynamic network formation,
addressing, routing, and network management
functions. ZigBee supports up to 64,000 devices in a
network with the multihop tree and mesh topologies
as well as star topology. Every node is assigned a
unique 16-bit short address dynamically using either
distributed addressing or stochastic addressing
scheme. The routing protocols of ZigBee are diverse
so that a system or users can choose the optimal
routing strategy according to the applications. The
reactive routing protocol in ZigBee is derived from
AODVjr (AODV junior), which is one of the
representative routing protocols in mobile ad hoc
networks. Similar with other MANET routing
protocols, ZigBee reactive routing protocol provides
the optimal routing path for the arbitrary source and
destination pair through the on-demand route
discovery.
It requires the route discovery process for each
communication pair, so the route discovery overhead
and the memory consumption proportionally
increases with the number of traffic sessions.
Moreover, route discovery packets are flooded to the
overall network, which interfere with transmission
of other packets even in the spatially uncorrelated
area with the route discovery. On the other hand,
ZigBee tree routing (ZTR) prevents the route
discovery overhead in both memory and bandwidth
using the distributed block addressing scheme. In
ZTR, since each node is assigned a hierarchical
address, a source or an intermediate node only
decides whether to forward a packet to the parent or
one of the children by comparing its address with the
destination address. The most benefit of ZTR is that
any source node can transmit a packet to an arbitrary
destination in a network without any route discovery
overheads. Due to this efficiency, ZTR is considered
as a promising protocol for resource constrained
devices in diverse applications such as smart grid
project and Internet of Things (IoT).
However, in ZTR, packets are forwarded along
the tree topology to the destination even if the
destination is located nearby. Thus, ZTR cannot
provide the optimal routing path, while it does not
require any route discovery overhead. Our objective
is to provide the near optimal routing path like the
reactive routing protocol as well as to maintain the
advantages of ZTR such as no route discovery
overhead and little memory consumption for the
routing table. We propose the shortcut tree routing
(STR) that significantly enhances the path efficiency
of ZTR by only adding the 1-hop neighbor
information. Whereas ZTR only uses tree links
connecting the parent and child nodes, STR exploits
the neighbor nodes by focusing that there exist the
neighbor nodes shortcutting the tree routing path in
the mesh topology.
In other words, in STR, a source or an
intermediate node selects the next hop node having
the smallest remaining tree hops to the destination
regardless of whether it is a parent, one of children,
RESEARCH ARTICLE OPEN ACCESS
2. P.T Arshad Int. Journal of Engineering Research and Applications www.ijera.com
ISSN : 2248-9622, Vol. 4, Issue 12( Part 6), December 2014, pp.136-140
www.ijera.com 137 | P a g e
or neighboring node. The routing path selection in
STR is decided by individual node in a distributed
manner, and STR is fully compatible with the
ZigBee standard that applies the different routing
strategies according to each node’s status. Also, it
requires neither any additional cost nor change of the
ZigBee standard including the creation and
maintenance mechanism of 1-hop neighbor
information.
II RELATED WORKS
Among many useful functions in ZigBee
network layer, the tree routing algorithm supports
simple but reliable routing for any destination
address. In ZigBee, network addresses are assigned
using a distributed addressing scheme that is
designed to provide every potential parent with a
finite sub block of network addresses. Due to such
addressing scheme, the network constructs a tree
topology; each device can manage the address space
of its descendant. If the destination address is in the
address space that a node is managing. Otherwise, it
forwards the packet to its parent node. The parent or
child node which receives the packet selects the next
hop node according to the destination address in the
same manner.
2.1 Zigbee Network
Based on IEEE 802.15.4 PHY/MAC, the
ZigBee network layer provides functionality such as
dynamic network formation, addressing, routing, and
discovering 1 hop neighbors. The size of the
network address is 16 bits, so ZigBee is capable to
accept about 65535 devices in a network, and the
network address is assigned in a hierarchical tree
structure. ZigBee provides not only star topology,
but also mesh topology. Since any device can
communicate with other devices except the PAN
Coordinator, the network has high scalability and
flexibility. Besides, the self-formation and self
healing features makes ZigBee more attractive. The
deployed ZigBee devices automatically construct the
network, and then changes such as joining/leaving of
devices are automatically reflected in the network
configuration. The routing protocols that ZigBee
provides are tree routing and table-driven routing.
Tree routing is based on the block address allocation
mechanism, called Cskip, so each device has an
address spaces to distribute to their children. When a
device has no capability of routing table and route
discovery table, it simply follows the hierarchical
tree by comparing the destination address. The most
significant benefit of tree routing is its simplicity and
limited use of resources. Therefore, any device with
low resources can participate in any ZigBee
compliant network. On the other hand, table driven
routing is basically similar to the Ad hoc On-demand
Distance Vector (AODV) routing protocol for
general multihop ad hoc network. Whereas tree
routing is very simple and inefficient, the table-
driven routing provides optimal routes to the
destination.
III. OUR WORK
3.1 Tree Routing Algorithm
Every potential parent is provided with a finite
sub-block of the address space, which is used to
assign network addresses to its children. Given
nwkmaxChildren (Cm), nwkcMaxDepth (Lm), and
nwkmaxRouters (Rm), we can compute the function
Cskip (d) as the size of the address sub-block
distributed by each parent at depth d as follows:
For example, the kth router and nth end
device shall be assigned the network address by their
parent at depth d as in the following equation.
A kth
router that has positive Cskip (d) can
distribute address spaces to its child nodes. Since
every device in the network is a descendant of the
ZigBee coordinator and no device in the network is
the descendant of any ZigBee end device, any device
with address A at depth d has the destination device
with address D if the following equation is satisfied.
A<D<A+ Cskip (d_1)
In tree routing, if the destination is a
descendant, the device sends the data to one of its
children; otherwise, it sends to its parent.
3.2 Neighbor table
Each device in ZigBee maintains a
neighbor table which has all the neighbor
information in the 1-hop transmission range. If users
limit the size of the neighbor table, the selected
numbers of neighbor entries are stored in the table.
The contents for a neighbor entry are the network’s
PAN identifier; node’s extended address, network
address, device type and relationship. Optionally,
additional information such as beacon order, depth
or permit joining can be included. Entries in the
table are created when the node joins to an existing
network. When a joining node requests a
nlmenetwork- discovery, it receives response
beacons from already joined nodes. The newly
joined node stores neighbors’ information from the
information contained in beacon packets.
Conversely, the neighbor entry is removed
when the neighbor node leaves the network. Nodes
can know this fact by receiving NLME-LEAVE.
Indication messages. Since the information on the
neighbor table is updated every time a device
receives any frame from the some neighbor node,
the information of the neighbor table can be said to
be up-to-date all the time.
3. P.T Arshad Int. Journal of Engineering Research and Applications www.ijera.com
ISSN : 2248-9622, Vol. 4, Issue 12( Part 6), December 2014, pp.136-140
www.ijera.com 138 | P a g e
IV. PROBLEM FORMULATION
The tree routing protocol uses only parent and
child relationship for routing, ignoring neighbor
nodes. As a result, packets may be routed through
several hops towards the destination even if this is
within sender’s 1-hop transmission range. Fig. 1
shows an example of the described problem. In Fig.
1, the packet from the source node goes up to the
root node following the parent node, and goes back
to the destination. In this way, 4 hops are required to
reach the destination. However, if the source node
sends the packet directly to the destination, it needs
only 1 hop routing cost. In many cases, the routing
overhead of tree routing algorithm can not be
avoided if only parent-child relationships are
considered in the routing. In order to overcome such
problem, each node should consider its neighbor
nodes as next hop nodes.
Fig. 1. Problem of Tree Routing
Fig. 2. Candidates for Next Hop
4.1 Shortcut Tree Routing Algorithm
We propose the shortcut tree routing algorithm
that improves existing ZigBee tree routing by using
the neighbor table. In other words, the proposed
algorithm basically follows ZigBee tree routing
algorithm, but chooses neighbor nodes as next hop
nodes if the routing cost to the destination can be
reduced. The neighbor table that we use in the
proposed algorithm is defined in the ZigBee
specification, so we don’t need to make an effort to
search neighbor list. In order to choose the next hop
node that can reduce the routing cost, the remaining
hop count from the next hop node to the destination
is computed for all the neighbor nodes including
parent and children nodes. As Fig. 2 shows, the
remaining hops to the destination for each neighbor
can be computed assuming that the route from the
neighbor to the destination goes along the tree. In the
above Fig.2, the route cost can be minimized if the
sender transmits the data directly to the destination.
Find_NextHopAddr() function described on table 1
is the algorithm for an intermediate or source node
to select the next hop node which has the minimum
remaining hop count for the given destination.
Because the proposed algorithm follows
fundamentally the ZigBee tree routing, the parent or
child node is selected as the next hop node in lines
2-3. In addition, the remaining routing cost when we
follow ZigBee tree routing is stored into
minNHRouteCost. In line 4-13, intermediate or
source nodes check the remaining routing cost
myRouteCost when selecting a neighbor node as the
next hop node. The remaining routing cost is
calculated based on the remaining hop count to the
destination assuming that the packet goes along the
ZigBee tree routing. In order to calculate the
remaining hop count, the hierarchical address
structure is used.
Algorithm Implementation Steps
• A symmetric key encryption algo. Invented
by Ron Rivest.
• Normally uses 64 bit and 128 bit key sizes.
• Most popular implementation is in WEP for
802.11 wireless networks and in SSL.
• Cryptographically very strong yet very easy
to implement.
• Consists of 2 parts: Key Scheduling
Algorithm (KSA) & Pseudo-Random
Generation Algorithm
• Using a secret key generate the RC4
keystream using the KSA and PRGA.
• Read the file and xor each byte of the file
with the corresponding keystream byte.
• Write this encrypted output to a file.
• Transmit file over an insecure channel.
4.2 AODV Routing Protocol
4. P.T Arshad Int. Journal of Engineering Research and Applications www.ijera.com
ISSN : 2248-9622, Vol. 4, Issue 12( Part 6), December 2014, pp.136-140
www.ijera.com 139 | P a g e
The Ad-hoc On-demand Distance Vector
(AODV) routing protocol is a routing protocol used
for dynamic wireless networks where nodes can
enter and leave the network at will. To find a route
to a particular destination node, the source node
broadcasts a RREQ to its immediate neighbors. If
one of these neighbors has a route to the destination,
then it replies back with a RREP. Otherwise the
neighbors in turn rebroadcast the request. This
continues until the RREQ hits the final destination or
a node with a route to the destination. At that point a
chain of RREP messages is sent back and the
original source node finally has a route to the
destination.
We proved that AODV protocol never produces
routing loops by proving that a combination of
sequence numbers and hop counts is monotonic
along a route. This means that there can't be any
loop in the routing table. The proof was done
completely automatically and our algorithm was able
to generate all the predicates needed. The Ad hoc On
Demand Distance Vector (AODV) routing algorithm
is a routing protocol designed for ad hoc mobile
networks. AODV is capable of both unicast and
multicast routing. It is an on demand algorithm,
meaning that it builds routes between nodes only as
desired by source nodes. It maintains these routes as
long as they are needed by the sources. Additionally,
AODV forms trees which connect multicast group
members. The trees are composed of the group
members and the nodes needed to connect the
members. AODV uses sequence numbers to ensure
the freshness of routes. It is loop-free, self-starting,
and scales to large numbers of mobile nodes.
AODV builds routes using a route request /
route reply query cycle. When a source node desires
a route to a destination for which it does not already
have a route, it broadcasts a route request (RREQ)
packet across the network. Nodes receiving this
packet update their information for the source node
and set up backwards pointers to the source node in
the route tables. In addition to the source node's IP
address, current sequence number, and broadcast ID,
the RREQ also contains the most recent sequence
number for the destination of which the source node
is aware. A node receiving the RREQ may send a
route reply (RREP) if it is either the destination or if
it has a route to the destination with corresponding
sequence number greater than or equal to that
contained in the RREQ. If this is the case, it unicasts
a RREP back to the source. Otherwise, it
rebroadcasts the RREQ. Nodes keep track of the
RREQ's source IP address and broadcast ID. If they
receive a RREQ which they have already processed,
they discard the RREQ and do not forward it. As the
RREP propagates back to the source, nodes set up
forward pointers to the destination. Once the source
node receives the RREP, it may begin to forward
data packets to the destination. If the source later
receives a RREP containing a greater sequence
number or contains the same sequence number with
a smaller hopcount, it may update its routing
information for that destination and begin using the
better route. As long as the route remains active, it
will continue to be maintained. A route is considered
active as long as there are data packets periodically
travelling from the source to the destination along
that path. Once the source stops sending data
packets, the links will time out and eventually be
deleted from the intermediate node routing tables. If
a link break occurs while the route is active, the
node upstream of the break propagates a route error
(RERR) message to the source node to inform it of
the now unreachable destination(s). After receiving
the RERR, if the source node still desires the route,
it can reinitiate route discovery.
V. CONCLUSION
This paper introduces the problem of ZigBee
tree routing and proposes a shortcut tree routing
protocol that overcomes the overhead occurred when
following the tree topology. In the proposed
algorithm, the neighbor table that is originally
defined in the ZigBee standard is used to find the
optimal next hop node that has the smallest
remaining hop count to the destination. The shortcut
tree routing algorithm is efficient in terms of both
routing performance and time complexity: it reduces
significantly the required routing costs and it can be
solved within polynomial time even when the
number of neighbors is not limited. We have
identified the detour path problem and traffic
concentration problem of the ZTR. These are the
fundamental problems of the general tree routing
protocols, which cause the overall network
performance degradation. To overcome these
problems, we propose STR that uses the neighbor
table, originally defined in the ZigBee standard. In
STR, each node can find the optimal next hop node
based on the remaining tree hops to the destination.
The mathematical analyses prove that the 1-hop
neighbor information in STR reduces the traffic load
concentrated on the tree links as well as provides an
efficient routing path. The network simulations show
that STR provides the comparable routing
performance to AODV as well as scalability respect
to the network density and the network traffic
volume by suppressing the additional route
discovery process.
REFERENCES
[1] ZigBee Alliance, Network Layer Specification
1.0, Dec. 2004.
[2] ZigBee Alliance, www.ZigBee.org
5. P.T Arshad Int. Journal of Engineering Research and Applications www.ijera.com
ISSN : 2248-9622, Vol. 4, Issue 12( Part 6), December 2014, pp.136-140
www.ijera.com 140 | P a g e
[3] “Wireless Medium Access Control and
Physical Layer Specifications for Low-Rate
Wireless Personal Area Networks (LR-
WPANs),” IEEE Std 802.15.4-2003, IEEE
Computer Society, 01 October 2003.
[4] G. Ding, Z. Sahinoglu, P. Orlik, J. Zhang, and
B. Bhargava, "Efficient and Reliable
Broadcast in ZigBee Networks,” IEEE
Transaction on Mobile Computing, IEEE
SECON’05.
[5] D. Kim, Y. Doh, S. Yoo, K. Chang, W. Park,
C. Seo, “Low Rate WPAN Technologies and
Standards,” KISS Information and
Communications Journal, Dec. 2004.
[6] J. Kim, H. Lee, D. Hwang, B. Kim,
“Development Trend of Standards for Low-
Rate, Low-cost, and Low-Power Wireless
PAN,“ Vol. 18, No. 2, pp. 37, ETRI trends,
2003.
[7] E. Callaway, P. Gorday, L. Hester, J. A.
Gutierrez, and M. Naeve, “Home networking
with IEEE 802.15.4: A developing standard
for lowrate wireless personal area
networks,” IEEE Communications
Magazine, page 70-77, August 2002.
[8] D. Han and J. Lim, “Smart Home Energy
Management System Using IEEE 802.15.4
and ZigBee,” IEEE Trans. Consumer
Electronics, vol. 56, no. 3, pp. 1403-1410,
Oct. 2010.
[9] S. Chen et al., “A Reliable Transmission
Protocol for ZigBee-Based Wireless Patient
Monitoring,” IEEE Trans. Information
Technology in Biomedicine, vol. 16, no. 1,
pp. 6-16, Nov. 2012.