International Journal of Engineering and Science Invention (IJESI) is an international journal intended for professionals and researchers in all fields of computer science and electronics. IJESI publishes research articles and reviews within the whole field Engineering Science and Technology, new teaching methods, assessment, validation and the impact of new technologies and it will continue to provide information on the latest trends and developments in this ever-expanding subject. The publications of papers are selected through double peer reviewed to ensure originality, relevance, and readability. The articles published in our journal can be accessed online.
Fuzzy based clustering and energy efficientIJCNCJournal
Underwater Wireless Sensor Network (UWSN) is a particular kind of sensor networks which is
characterized by using acoustic channels for communication. UWSN is challenged by great issues specially
the energy supply of sensor node which can be wasted rapidly by several factors. The most proposed
routing protocols for terrestrial sensor networks are not adequate for UWSN, thus new design of routing
protocols must be adapted to this constrain. In this paper we propose two new clustering algorithms based
on Fuzzy C-Means mechanisms. In the first proposition, the cluster head is elected initially based on the
closeness to the center of the cluster, then the node having the higher residual energy elects itself as a
cluster head. All non-cluster head nodes transmit sensed data to the cluster head. This latter performs data
aggregation and transmits the data directly to the base station. The second algorithm uses the same
principle in forming clusters and electing cluster heads but operates in multi-hop mode to forward data
from cluster heads to the underwater sink (uw-sink). Furthermore the two proposed algorithms are tested
for static and dynamic deployment. Simulation results demonstrate the effectiveness of the proposed
algorithms resulting in an extension of the network lifetime.
Improving Capacity and Load Distribution of a Node Using Circular Sailing Rou...ijafrc
Routing in wireless networks has been heavily studied in the last decade. In mobile ad-hoc network (MANETs) can route travelled by a packet from the source to the destination usually consists of multiple hops where intermediate nodes act as relays. The packets usually follow the shortest path between source and destination in routing protocols to achieve smallest travelled distance. However, this leads to the uneven distribution of traffic load in a network. The wireless nodes in the center of the network will have heavier traffic. Since most of the shortest routes go through them. There are many algorithms available in the load balancing and improving capacity technique. In this paper, describe a novel routing algorithm called Circular Sailing Routing (CSR), which we can distribute the traffic more evenly in the network. Based on our study, found to reduced traffic distribution and capacity of a node in the wireless network compared to any other algorithm. This is because they proposed maps in the network onto a sphere via a simple stereographic projection and then the route decision is made by the distance on the sphere instead of Euclidean distance in the plane.
In wireless sensor networks (WSNs), ad hoc networks are WSNs without any
prepositioning for the sensor nodes. In modern networks, a WSN is widely distributed to
monitor physical or environmental conditions (e.g., temperature, sound).
Exceedingly large amounts of nodes as well as comparatively high node density, lead to
scalability of the protocols used in WSNs. However, within a large-scale WSN, the routing
process becomes challenging since nodes in this type of network have extremely limited
resources for packet storage and routing table updates.
This paper contributes towards evaluating the performance of the Optimized Cross-Layers
Protocol (OXLP) developed by the authors, focusing on its scalability. The OXLP protocol
improves energy consumption over well-known protocols in the same field. Also, both the
packet delivery ratio and packet delay reached a good level compared to other cross-layer based
protocols.
Integrated Resource Adaptive On Demand Geographic Routing (IRA-ODGR) for MANETijsrd.com
It is a big challenge to develop routing protocol that can meet different application needs and optimize routing paths according to the topology change in mobile ad hoc networks. The existing work presented two self-adaptive on-demand geographic routing schemes to build efficient paths based on the needs of user applications and adapt to various scenarios for provide efficient and reliable routing. To overcome the impact due to inaccurate local topology knowledge, the topology information is updated at a node in the specific time periods. The on-demand routing mechanism reduces to control overhead made on geographic routing. The route optimization scheme adapts routing path according to the topology changes and actual data traffic requirements. Adaptive parameter setting scheme is introduced to allow each node to determine and adjust the protocol parameter values independently. However, existing work did not address resource parameters such as energy, bandwidth and data loss. The proposal presents and Integrated Resource Adaptive on Demand Geographic Routing (IRA-ODGR) for MANET. The node energy resource is optimized with path energy consumption rate and bandwidth utilization of the path is analysed. Loss rate is reduced in geographic routing with dynamic routes. The simulation conducted to demonstrate IRA-ODGR routing protocols.
Power Aware Geocast Based Geocast Region Tracking Using Mobile Node in Wirele...inventionjournals
One of the most significant challenges introduced by mobile networks is the difficulty in coping withthe unpredictable movement of Geocast mobile nodes. If, instead, the Geocast mobile nodes could be programmed totravel through the world in a predictable and useful manner, the task of designing algorithms for mobile networks would be significantly simplified.Geocasting represents today a challengingfield of research due to the numerous application scenariosoffered by ad hoc and sensor networks. Recently, the some Geocast routing protocols have beenproposed, most of which are basically inherited from unicastrouting solutions and consequently are not optimizedfor Geocast applications. Another, more interesting, classof region, which will be referred to as position-awareGeocast routing Algorithm, follow a progressive reductionin the distance to the destination, every time a relaynode must be chosen for forwarding a data packet. Thisallows to avoid the unnecessary dissemination of datapackets to nodes farther away from the destination andthe consequent useless energy consumption. This paperwill focus on the exploitation of this interesting positionawareapproach which seems to be more suitable forthe scenarios under consideration.
Improved routing scheme with ACO in WSN in comparison to DSDVijsrd.com
Routing is the process of selecting best paths in a network in terms of energy and distance. In adhoc it is critical to collect the information in an efficient manner as it has limitations in terms of centralized congestion. In such case to perform the effective communication there is the requirement of some such routing approach that can provide the routing with optimized path. In this work, ACO based routing approach is defined to generate the optimized path in comparison to DSDV over the network. The presented approach is implemented in matlab environment and obtained results shows the effective results in terms of optimized path.
Fuzzy based clustering and energy efficientIJCNCJournal
Underwater Wireless Sensor Network (UWSN) is a particular kind of sensor networks which is
characterized by using acoustic channels for communication. UWSN is challenged by great issues specially
the energy supply of sensor node which can be wasted rapidly by several factors. The most proposed
routing protocols for terrestrial sensor networks are not adequate for UWSN, thus new design of routing
protocols must be adapted to this constrain. In this paper we propose two new clustering algorithms based
on Fuzzy C-Means mechanisms. In the first proposition, the cluster head is elected initially based on the
closeness to the center of the cluster, then the node having the higher residual energy elects itself as a
cluster head. All non-cluster head nodes transmit sensed data to the cluster head. This latter performs data
aggregation and transmits the data directly to the base station. The second algorithm uses the same
principle in forming clusters and electing cluster heads but operates in multi-hop mode to forward data
from cluster heads to the underwater sink (uw-sink). Furthermore the two proposed algorithms are tested
for static and dynamic deployment. Simulation results demonstrate the effectiveness of the proposed
algorithms resulting in an extension of the network lifetime.
Improving Capacity and Load Distribution of a Node Using Circular Sailing Rou...ijafrc
Routing in wireless networks has been heavily studied in the last decade. In mobile ad-hoc network (MANETs) can route travelled by a packet from the source to the destination usually consists of multiple hops where intermediate nodes act as relays. The packets usually follow the shortest path between source and destination in routing protocols to achieve smallest travelled distance. However, this leads to the uneven distribution of traffic load in a network. The wireless nodes in the center of the network will have heavier traffic. Since most of the shortest routes go through them. There are many algorithms available in the load balancing and improving capacity technique. In this paper, describe a novel routing algorithm called Circular Sailing Routing (CSR), which we can distribute the traffic more evenly in the network. Based on our study, found to reduced traffic distribution and capacity of a node in the wireless network compared to any other algorithm. This is because they proposed maps in the network onto a sphere via a simple stereographic projection and then the route decision is made by the distance on the sphere instead of Euclidean distance in the plane.
In wireless sensor networks (WSNs), ad hoc networks are WSNs without any
prepositioning for the sensor nodes. In modern networks, a WSN is widely distributed to
monitor physical or environmental conditions (e.g., temperature, sound).
Exceedingly large amounts of nodes as well as comparatively high node density, lead to
scalability of the protocols used in WSNs. However, within a large-scale WSN, the routing
process becomes challenging since nodes in this type of network have extremely limited
resources for packet storage and routing table updates.
This paper contributes towards evaluating the performance of the Optimized Cross-Layers
Protocol (OXLP) developed by the authors, focusing on its scalability. The OXLP protocol
improves energy consumption over well-known protocols in the same field. Also, both the
packet delivery ratio and packet delay reached a good level compared to other cross-layer based
protocols.
Integrated Resource Adaptive On Demand Geographic Routing (IRA-ODGR) for MANETijsrd.com
It is a big challenge to develop routing protocol that can meet different application needs and optimize routing paths according to the topology change in mobile ad hoc networks. The existing work presented two self-adaptive on-demand geographic routing schemes to build efficient paths based on the needs of user applications and adapt to various scenarios for provide efficient and reliable routing. To overcome the impact due to inaccurate local topology knowledge, the topology information is updated at a node in the specific time periods. The on-demand routing mechanism reduces to control overhead made on geographic routing. The route optimization scheme adapts routing path according to the topology changes and actual data traffic requirements. Adaptive parameter setting scheme is introduced to allow each node to determine and adjust the protocol parameter values independently. However, existing work did not address resource parameters such as energy, bandwidth and data loss. The proposal presents and Integrated Resource Adaptive on Demand Geographic Routing (IRA-ODGR) for MANET. The node energy resource is optimized with path energy consumption rate and bandwidth utilization of the path is analysed. Loss rate is reduced in geographic routing with dynamic routes. The simulation conducted to demonstrate IRA-ODGR routing protocols.
Power Aware Geocast Based Geocast Region Tracking Using Mobile Node in Wirele...inventionjournals
One of the most significant challenges introduced by mobile networks is the difficulty in coping withthe unpredictable movement of Geocast mobile nodes. If, instead, the Geocast mobile nodes could be programmed totravel through the world in a predictable and useful manner, the task of designing algorithms for mobile networks would be significantly simplified.Geocasting represents today a challengingfield of research due to the numerous application scenariosoffered by ad hoc and sensor networks. Recently, the some Geocast routing protocols have beenproposed, most of which are basically inherited from unicastrouting solutions and consequently are not optimizedfor Geocast applications. Another, more interesting, classof region, which will be referred to as position-awareGeocast routing Algorithm, follow a progressive reductionin the distance to the destination, every time a relaynode must be chosen for forwarding a data packet. Thisallows to avoid the unnecessary dissemination of datapackets to nodes farther away from the destination andthe consequent useless energy consumption. This paperwill focus on the exploitation of this interesting positionawareapproach which seems to be more suitable forthe scenarios under consideration.
Improved routing scheme with ACO in WSN in comparison to DSDVijsrd.com
Routing is the process of selecting best paths in a network in terms of energy and distance. In adhoc it is critical to collect the information in an efficient manner as it has limitations in terms of centralized congestion. In such case to perform the effective communication there is the requirement of some such routing approach that can provide the routing with optimized path. In this work, ACO based routing approach is defined to generate the optimized path in comparison to DSDV over the network. The presented approach is implemented in matlab environment and obtained results shows the effective results in terms of optimized path.
A Proactive Greedy Routing Protocol Precludes Sink-Hole Formation in Wireless...ijwmn
The International Journal of Wireless & Mobile Networks (IJWMN) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Wireless & Mobile Networks. The journal focuses on all technical and practical aspects of Wireless & Mobile Networks. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced wireless & mobile networking concepts and establishing new collaborations in these areas.
A REFERENCE BASED, TREE STRUCTURED TIME SYNCHRONIZATION APPROACH AND ITS ANAL...ijasuc
Time synchronization for wireless sensor networks (WSNs) has been studied in recent years as a
fundamental and significant research issue. Many applications based on these WSNs assume local clocks
at each sensor node that need to be synchronized to a common notion of time. Time synchronization in a
WSN is critical for accurate time stamping of events and fine-tuned coordination among the sensor nodes
to reduce power consumption. This paper proposes a bidirectional, reference based, tree structured time
synchronization service for WSNs along with network evaluation phase. This offers a push mechanism for
(i) accurate and (ii) low overhead for global time synchronization. Analysis study of proposed approach
shows that it is lightweight as the number of required broadcasting messages is constant in one
broadcasting domain.
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.
For further details contact:
N.RAJASEKARAN B.E M.S 9841091117,9840103301.
IMPULSE TECHNOLOGIES,
Old No 251, New No 304,
2nd Floor,
Arcot road ,
Vadapalani ,
Chennai-26.
A CRITICAL REVIEW OF THE ROUTING PROTOCOLS FOR COGNITIVE RADIO NETWORKS AND A...cscpconf
We present a critical review and analysis of different categories of routing protocols for cognitive radio networks. We first classify the available solutions to two broad categories: those
based on full spectrum knowledge (typically used to establish performance benchmarks) and those based on local spectrum knowledge (used for real-time implementation). The full spectrum knowledge based routing solutions are analyzed from a graph-theoretic point of view, and we review the layered graph, edge coloring and conflict graph models. We classify the various local spectrum knowledge based routing protocols into the following five categories: Minimum power, Minimum delay, Maximum throughput, Geographic and Class-based routing. A total of 25 routing protocols proposed for cognitive radio networks have been reviewed. We discuss the working principle and analyze the pros and cons of the routing protocols. Finally, we propose an idea of a load balancing-based local spectrum knowledge-based routing protocol for cognitive radio ad hoc networks.
Mobile data gathering with load balanced clustering and dual data uploading i...Shakas Technologies
In this paper, a three-layer framework is proposed for mobile data collection in wireless sensor networks, which includes the sensor layer, cluster head layer, and mobile collector (called SenCar) layer.
Multipath routing protocol for effective local route recoveryIJARBEST JOURNAL
In mobile Ad hoc network, frequent mobility during the data transmission of data
causes route failure which results in route discovery. In this we propose multipath routing protocol
for effective local route recovery in mobile Ad hoc networks. In this protocol each source and
destination pair establishes multiple paths in single route discovery and they are cached in their route
caches. The cached routes are sorted on the basis of their bandwidth availability. In case of route
failure in the primary route, a recovery node which is an over heading neighbor, detects it and
establishes a local recovery path with maximum bandwidth from its route cache. This proposed
technique improves network performance and it prevents frequent collision.
Investigating VANET for Unwavering Ways with Flawless Connectivitypaperpublications3
Abstract: This paper is investigating the VANET techniques by understanding the various papers published by the authors in IEEE transactions. In this paper the new technique is explored where no of the routing method is applied for connecting the nodes. But using the other information such as speed ,density, time, range and calculating the time required by the vehicle on the road of interests we can link them full time period of their run. We can use the standard frequency bands widths allocated by the Governments.
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) aims to cover the latest outstanding developments in the field of all Engineering Technologies & science.
International Journal of Engineering Research and Applications (IJERA) is a team of researchers not publication services or private publications running the journals for monetary benefits, we are association of scientists and academia who focus only on supporting authors who want to publish their work. The articles published in our journal can be accessed online, all the articles will be archived for real time access.
Our journal system primarily aims to bring out the research talent and the works done by sciaentists, academia, engineers, practitioners, scholars, post graduate students of engineering and science. This journal aims to cover the scientific research in a broader sense and not publishing a niche area of research facilitating researchers from various verticals to publish their papers. It is also aimed to provide a platform for the researchers to publish in a shorter of time, enabling them to continue further All articles published are freely available to scientific researchers in the Government agencies,educators and the general public. We are taking serious efforts to promote our journal across the globe in various ways, we are sure that our journal will act as a scientific platform for all researchers to publish their works online.
A Proactive Greedy Routing Protocol Precludes Sink-Hole Formation in Wireless...ijwmn
The International Journal of Wireless & Mobile Networks (IJWMN) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Wireless & Mobile Networks. The journal focuses on all technical and practical aspects of Wireless & Mobile Networks. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced wireless & mobile networking concepts and establishing new collaborations in these areas.
A REFERENCE BASED, TREE STRUCTURED TIME SYNCHRONIZATION APPROACH AND ITS ANAL...ijasuc
Time synchronization for wireless sensor networks (WSNs) has been studied in recent years as a
fundamental and significant research issue. Many applications based on these WSNs assume local clocks
at each sensor node that need to be synchronized to a common notion of time. Time synchronization in a
WSN is critical for accurate time stamping of events and fine-tuned coordination among the sensor nodes
to reduce power consumption. This paper proposes a bidirectional, reference based, tree structured time
synchronization service for WSNs along with network evaluation phase. This offers a push mechanism for
(i) accurate and (ii) low overhead for global time synchronization. Analysis study of proposed approach
shows that it is lightweight as the number of required broadcasting messages is constant in one
broadcasting domain.
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.
For further details contact:
N.RAJASEKARAN B.E M.S 9841091117,9840103301.
IMPULSE TECHNOLOGIES,
Old No 251, New No 304,
2nd Floor,
Arcot road ,
Vadapalani ,
Chennai-26.
A CRITICAL REVIEW OF THE ROUTING PROTOCOLS FOR COGNITIVE RADIO NETWORKS AND A...cscpconf
We present a critical review and analysis of different categories of routing protocols for cognitive radio networks. We first classify the available solutions to two broad categories: those
based on full spectrum knowledge (typically used to establish performance benchmarks) and those based on local spectrum knowledge (used for real-time implementation). The full spectrum knowledge based routing solutions are analyzed from a graph-theoretic point of view, and we review the layered graph, edge coloring and conflict graph models. We classify the various local spectrum knowledge based routing protocols into the following five categories: Minimum power, Minimum delay, Maximum throughput, Geographic and Class-based routing. A total of 25 routing protocols proposed for cognitive radio networks have been reviewed. We discuss the working principle and analyze the pros and cons of the routing protocols. Finally, we propose an idea of a load balancing-based local spectrum knowledge-based routing protocol for cognitive radio ad hoc networks.
Mobile data gathering with load balanced clustering and dual data uploading i...Shakas Technologies
In this paper, a three-layer framework is proposed for mobile data collection in wireless sensor networks, which includes the sensor layer, cluster head layer, and mobile collector (called SenCar) layer.
Multipath routing protocol for effective local route recoveryIJARBEST JOURNAL
In mobile Ad hoc network, frequent mobility during the data transmission of data
causes route failure which results in route discovery. In this we propose multipath routing protocol
for effective local route recovery in mobile Ad hoc networks. In this protocol each source and
destination pair establishes multiple paths in single route discovery and they are cached in their route
caches. The cached routes are sorted on the basis of their bandwidth availability. In case of route
failure in the primary route, a recovery node which is an over heading neighbor, detects it and
establishes a local recovery path with maximum bandwidth from its route cache. This proposed
technique improves network performance and it prevents frequent collision.
Investigating VANET for Unwavering Ways with Flawless Connectivitypaperpublications3
Abstract: This paper is investigating the VANET techniques by understanding the various papers published by the authors in IEEE transactions. In this paper the new technique is explored where no of the routing method is applied for connecting the nodes. But using the other information such as speed ,density, time, range and calculating the time required by the vehicle on the road of interests we can link them full time period of their run. We can use the standard frequency bands widths allocated by the Governments.
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) aims to cover the latest outstanding developments in the field of all Engineering Technologies & science.
International Journal of Engineering Research and Applications (IJERA) is a team of researchers not publication services or private publications running the journals for monetary benefits, we are association of scientists and academia who focus only on supporting authors who want to publish their work. The articles published in our journal can be accessed online, all the articles will be archived for real time access.
Our journal system primarily aims to bring out the research talent and the works done by sciaentists, academia, engineers, practitioners, scholars, post graduate students of engineering and science. This journal aims to cover the scientific research in a broader sense and not publishing a niche area of research facilitating researchers from various verticals to publish their papers. It is also aimed to provide a platform for the researchers to publish in a shorter of time, enabling them to continue further All articles published are freely available to scientific researchers in the Government agencies,educators and the general public. We are taking serious efforts to promote our journal across the globe in various ways, we are sure that our journal will act as a scientific platform for all researchers to publish their works online.
At present we can communicate instantly to any one in any corner of the world due to the internet, while next phase of internet will take us beyond the earth ,i.e. “interplanetary internet(IPN)” which will provide basis for communication system for a manned mission to the mars and planets beyond.
The existing internet on the earth and similar one on other planet linked by gateways, which will relay the information between the internets ,forms interplanetary internet. Thus interplanetary internet can be thought as “the network of disconnected internets”.
Deep space Network satellites around mars and new protocols constitute interplanetary Internet. Where DSN will serve as gate way of earth. A group of six micro satellites and a large mars at satellite is to be placed for implementation of interplanetary internet (IPN). IPN deals with new protocols like SCPS (Space Communication Protocols Standards), NTP (Network Time Protocol) and PTP(Parcel Transfer Protocol ).
The objective of interplanetary project is to define the architecture and protocols necessary to permit interoperation of the internet resident on the earth with other remotely located internets resident on the other planets or spacecrafts in transit.
Time and Energy Minimized Trajectories for LANs of DronesDr. Amarjeet Singh
Controlling UAV movements in a UAV network is a
critical but not well-studied research area in UAV network
research. In this paper, we consider the problem of finding
time and energy minimized trajectories for LANs of Drones
(LoDs) by computationally inexpensive method. A LoD is a
novel type of UAV network, which uses a minimum number
of UAVs to perform any collaborative task. For both
criterions of time and energy minimization, we formulate
separate nonlinear constrained optimization problems and
use Sequential Quadratic Programming method to obtain
local optimum solutions. These minimization methods were
tested by carrying out a range of simulations in MATLAB
environment.
Location-aware hybrid microscopic routing scheme for mobile opportunistic net...IAESIJAI
Mobile opportunistic networks (MON) have been used for provisioning delaytolerant applications. In MON the device communicates with each other with
no assured end-to-end paths from source and destination because of frequent
topology changes, node mobility, low density, and intermittent connectivity.
In MON the device battery drains very fast for performing activities such as
scanning, transceiver, and other computational processes, impacting the
overall performance thus, designing energy-efficient routing is a challenging
task. The routing employs a store-carry-and-forward mechanism for packet
communication, where the packet is composed of time-to-live (TTL) and is
kept in buffer till the opportunity arises. In improving delivery ratio message
replication has been adopted; however, induces high network congestion.
Here we present a location-aware hybrid microscopic routing (LAHMR)
scheme for MON. The LAHMR provides an effective packet transmission
scheme with location awareness and high reliability by limiting unnecessary
packets being circulated in the network. Experiment outcome shows the
LAHMR scheme achieves a much better delivery ratio with less delay, and
also reduces the number of a forwarder for transmitting a packet, aiding in the
reduction of network overhead concerning recent routing method namely the
social-aware reliable forwarding (SCARF) technique.
PERFORMANCE ANALYSIS OF OLSR PROTOCOL IN MANET CONSIDERING DIFFERENT MOBILITY...ijwmn
A Mobile Ad Hoc Network (MANET) is created when an independent mobile node network is connected
dynamically via wireless links. MANET is a self-organizing network that does not rely on pre-existing
infrastructure such as wired or wireless network routers. Mobile nodes in this network move randomly,
thus, the topology is always changing. Routing protocols in MANET are critical in ensuring dependable
and consistent connectivity between the mobile nodes. They conclude logically based on the interaction
between mobile nodes in MANET routing and encourage them to choose the optimum path between source
and destination. Routing protocols are classified as proactive, reactive, or hybrid. The focus of this project
will be on Optimized Link State Routing (OLSR) protocol, a proactive routing technique. OLSR is known as
the optimized variant of link state routing in which packets are sent throughout the network using the
multipoint relay (MPR) mechanism. This article evaluates the performance of the OLSR routing protocol
under condition of changing mobility speed and network density. The study's performance indicators are
average packet throughput, packet delivery ratio (PDR), and average packet latency. Network Simulator 2
(NS-2) and an external patch UM-OLSR are used to simulate and evaluate the performance of such
protocol. As a result of research, the approach of implementing the MPR mechanism are able to minimise
redundant data transmission during the normal message broadcast. The MPRs enhance the link state
protocols’ traditional diffusion mechanism by selecting the right MPRs. Hence, the number of undesired
broadcasts can be reduced and limited. Further research will focus on different scenario and environment
using different mobility model
PERFORMANCE ANALYSIS OF OLSR PROTOCOL IN MANET CONSIDERING DIFFERENT MOBILITY...ijwmn
A Mobile Ad Hoc Network (MANET) is created when an independent mobile node network is connected dynamically via wireless links. MANET is a self-organizing network that does not rely on pre-existing infrastructure such as wired or wireless network routers. Mobile nodes in this network move randomly, thus, the topology is always changing. Routing protocols in MANET are critical in ensuring dependable and consistent connectivity between the mobile nodes. They conclude logically based on the interaction between mobile nodes in MANET routing and encourage them to choose the optimum path between source and destination. Routing protocols are classified as proactive, reactive, or hybrid. The focus of this project will be on Optimized Link State Routing (OLSR) protocol, a proactive routing technique. OLSR is known as the optimized variant of link state routing in which packets are sent throughout the network using the multipoint relay (MPR) mechanism. This article evaluates the performance of the OLSR routing protocol under condition of changing mobility speed and network density. The study's performance indicators are average packet throughput, packet delivery ratio (PDR), and average packet latency. Network Simulator 2 (NS-2) and an external patch UM-OLSR are used to simulate and evaluate the performance of such protocol. As a result of research, the approach of implementing the MPR mechanism are able to minimise redundant data transmission during the normal message broadcast. The MPRs enhance the link state protocols’ traditional diffusion mechanism by selecting the right MPRs. Hence, the number of undesired broadcasts can be reduced and limited. Further research will focus on different scenario and environment using different mobility model.
Throughput Maximization using Spatial Reusability in Multi Hop Wireless Networkijtsrd
Energy is a valuable resource in wireless networks. For many multi hop networking scenarios, nodes require power for performing their operation, so requiring capable power management to make certain connectivity across the network. Though when wireless networks are attached outside power source due to obstruction between lively links the network may demand excessive energy per unit time Power due to this the overall performance is reduced. Since network life time or network capacity is depend on the power efficiency, many efforts to study energy efficient networks in the wireless network community. In multi hop wireless networks well organized routing algorithms are significant for network performance. We dispute that by carefully considering spatial reusability of the wireless communication media, we can reduce the overhead in multi hop wireless networks. To support our argument, propose Broadcast Tree Construction BTC and compare them with existing routing and multi path routing protocols, respectively. Our estimate outcome shows that proposed protocols significantly improve the end to end throughput compared with existing protocols. We also introduce the sleep scheduling approach for energy consumption and hybrid cryptography for security of data that can be prevent the data leakage and jammer attacks. Twinkal P. Dudhagawali | Prof. L. K. Gautam | Prof. V. P. Vaidya ""Throughput Maximization using Spatial Reusability in Multi Hop Wireless Network"" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-3 | Issue-3 , April 2019, URL: https://www.ijtsrd.com/papers/ijtsrd23489.pdf
Paper URL: https://www.ijtsrd.com/engineering/information-technology/23489/throughput-maximization-using-spatial-reusability-in-multi-hop-wireless-network/twinkal-p-dudhagawali
On performance analysis of non-orthogonal multiple access downlink for cellul...IJECEIAES
This paper presents the unmanned aerial vehicle (UAV) relays’ assisted vehicle-to-everything (V2X) network to implement the internet of things (IoT) systems with improvement in the coverage area. Such a network benefits from many advantages of the non-orthogonal multiple access (NOMA) scheme. We have implemented a decode-and-forward (DF) scheme for these UAVs. Then, we characterize the channels as Nakagami-m fading to evaluate the performance of the system. We derive closed-form expressions of outage probability (OP), ergodic capacity (EC), and throughput. The results show that the performance of the system depends on the transmitted signal-to-noise ratio (SNR) at the base station and the heights of the UAV relays. Target rate and power allocation factors are two main parameters that can be adjusted to achieve better performance. The results also compare to the system without UAV and OMA technique that shows the advantages of deploying UAV-assisted NOMA. Therefore, the design of NOMA for UAV relay-assisted V2X systems provides sufficient demand. The simulation results verified the effectiveness of the proposed UAV network and the precision of the theoretical analysis.
SHADOWING EFFECTS ON ROUTING PROTOCOL OF MULTIHOP AD HOC NETWORKSijasuc
Two-ray ground reflection model has been widely used as the propagation model to investigate the
performance of an ad hoc network. But two-ray model is too simple to represent a real world network. A
more realistic model namely shadowing propagation model has been used in this investigation. Under
shadowing propagation model, a mobile node may receive a packet at a signal level that is below a
required threshold level. This low signal level affects the routing protocol as well as the medium access
control protocol of a network. An analytical model has been presented in this paper to investigate the
shadowing effects on the network performance. The analytical model has been verified via simulation
results. Simulation results show that the performance of a network becomes very poor if shadowing
propagation model is used in compare to the simple two-ray model. Two solutions have also been proposed
in this paper to overcome the effects of shadowing. One solution is a physical layer solution and the other
one is a Medium Access Control (MAC) layer solution. Simulation results show that these two solutions
reduce the shadowing effect and improve network performance.
SHADOWING EFFECTS ON ROUTING PROTOCOL OF MULTIHOP AD HOC NETWORKSijasuc
Two-ray ground reflection model has been widely used as the propagation model to investigate the
performance of an ad hoc network. But two-ray model is too simple to represent a real world network. A
more realistic model namely shadowing propagation model has been used in this investigation. Under
shadowing propagation model, a mobile node may receive a packet at a signal level that is below a
required threshold level. This low signal level affects the routing protocol as well as the medium access
control protocol of a network. An analytical model has been presented in this paper to investigate the
shadowing effects on the network performance. The analytical model has been verified via simulation
results. Simulation results show that the performance of a network becomes very poor if shadowing
propagation model is used in compare to the simple two-ray model. Two solutions have also been proposed
in this paper to overcome the effects of shadowing. One solution is a physical layer solution and the other
one is a Medium Access Control (MAC) layer solution. Simulation results show that these two solutions
reduce the shadowing effect and improve network performance.
SHADOWING EFFECTS ON ROUTING PROTOCOL OF MULTIHOP AD HOC NETWORKSijasuc
Two-ray ground reflection model has been widely used as the propagation model to investigate the
performance of an ad hoc network. But two-ray model is too simple to represent a real world network. A
more realistic model namely shadowing propagation model has been used in this investigation. Under
shadowing propagation model, a mobile node may receive a packet at a signal level that is below a
required threshold level. This low signal level affects the routing protocol as well as the medium access
control protocol of a network. An analytical model has been presented in this paper to investigate the
shadowing effects on the network performance. The analytical model has been verified via simulation
results. Simulation results show that the performance of a network becomes very poor if shadowing
propagation model is used in compare to the simple two-ray model. Two solutions have also been proposed
in this paper to overcome the effects of shadowing. One solution is a physical layer solution and the other
one is a Medium Access Control (MAC) layer solution. Simulation results show that these two solutions
reduce the shadowing effect and improve network performance.
Inspecting Vanet for Determined Ways with Watertight Connectivityiosrjce
This paper is examining the VANET techniques by understanding the various papers published by the
authors in IEEE transactions. In this paper the new technique is explored where no of the routing method is
applied for connecting the nodes. But using the other information such as speed ,density,time,range and
calculating the time required by the vehicle on the road of interests we can link them full time period of their
run. We can use the standard frequency bands widths allocated by the Governments
Underwater localization and node mobility estimationIJECEIAES
In this paper, localizing a moving node in the context of underwater wireless sensor networks (UWSNs) is considered. Most existing algorithms have had designed to work with a static node in the networks. However, in practical case, the node is dynamic due to relative motion between the transmitter and receiver. The main idea is to record the time of arrival message (ToA) stamp and estimating the drift in the sampling frequency accordingly. It should be emphasized that, the channel conditions such as multipath and delay spread, and ambient noise is considered to make the system pragmatic. A joint prediction of the node mobility and speed are estimated based on the sampling frequency offset estimation. This sampling frequency offset drift is detected based on correlating an anticipated window in the orthogonal frequency division multiplexing (OFDM) of the received packet. The range and the distance of the mobile node is predicted from estimating the speed at the received packet and reused in the position estimation algorithm. The underwater acoustic channel is considered in this paper with 8 paths and maximum delay spread of 48 ms to simulate a pragmatic case. The performance is evaluated by adopting different nodes speeds in the simulation in two scenarios of expansion and compression. The results show that the proposed algorithm has a stable profile in the presence of severe channel conditions. Also, the result shows that the maximum speed that can be adopted in this algorithm is 9 km/h and the expansion case profile is more stable than the compression scenario. In addition, a comparison with a dynamic triangular algorithm (DTN) is presented in order to evaluate the proposed system.
Encryption in Microsoft 365 - ExpertsLive Netherlands 2024Albert Hoitingh
In this session I delve into the encryption technology used in Microsoft 365 and Microsoft Purview. Including the concepts of Customer Key and Double Key Encryption.
Observability Concepts EVERY Developer Should Know -- DeveloperWeek Europe.pdfPaige Cruz
Monitoring and observability aren’t traditionally found in software curriculums and many of us cobble this knowledge together from whatever vendor or ecosystem we were first introduced to and whatever is a part of your current company’s observability stack.
While the dev and ops silo continues to crumble….many organizations still relegate monitoring & observability as the purview of ops, infra and SRE teams. This is a mistake - achieving a highly observable system requires collaboration up and down the stack.
I, a former op, would like to extend an invitation to all application developers to join the observability party will share these foundational concepts to build on:
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.
UiPath Test Automation using UiPath Test Suite series, part 3DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 3. In this session, we will cover desktop automation along with UI automation.
Topics covered:
UI automation Introduction,
UI automation Sample
Desktop automation flow
Pradeep Chinnala, Senior Consultant Automation Developer @WonderBotz and UiPath MVP
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
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.
PHP Frameworks: I want to break free (IPC Berlin 2024)Ralf Eggert
In this presentation, we examine the challenges and limitations of relying too heavily on PHP frameworks in web development. We discuss the history of PHP and its frameworks to understand how this dependence has evolved. The focus will be on providing concrete tips and strategies to reduce reliance on these frameworks, based on real-world examples and practical considerations. The goal is to equip developers with the skills and knowledge to create more flexible and future-proof web applications. We'll explore the importance of maintaining autonomy in a rapidly changing tech landscape and how to make informed decisions in PHP development.
This talk is aimed at encouraging a more independent approach to using PHP frameworks, moving towards a more flexible and future-proof approach to PHP development.
Welocme to ViralQR, your best QR code generator.ViralQR
Welcome to ViralQR, your best QR code generator available on the market!
At ViralQR, we design static and dynamic QR codes. Our mission is to make business operations easier and customer engagement more powerful through the use of QR technology. Be it a small-scale business or a huge enterprise, our easy-to-use platform provides multiple choices that can be tailored according to your company's branding and marketing strategies.
Our Vision
We are here to make the process of creating QR codes easy and smooth, thus enhancing customer interaction and making business more fluid. We very strongly believe in the ability of QR codes to change the world for businesses in their interaction with customers and are set on making that technology accessible and usable far and wide.
Our Achievements
Ever since its inception, we have successfully served many clients by offering QR codes in their marketing, service delivery, and collection of feedback across various industries. Our platform has been recognized for its ease of use and amazing features, which helped a business to make QR codes.
Our Services
At ViralQR, here is a comprehensive suite of services that caters to your very needs:
Static QR Codes: Create free static QR codes. These QR codes are able to store significant information such as URLs, vCards, plain text, emails and SMS, Wi-Fi credentials, and Bitcoin addresses.
Dynamic QR codes: These also have all the advanced features but are subscription-based. They can directly link to PDF files, images, micro-landing pages, social accounts, review forms, business pages, and applications. In addition, they can be branded with CTAs, frames, patterns, colors, and logos to enhance your branding.
Pricing and Packages
Additionally, there is a 14-day free offer to ViralQR, which is an exceptional opportunity for new users to take a feel of this platform. One can easily subscribe from there and experience the full dynamic of using QR codes. The subscription plans are not only meant for business; they are priced very flexibly so that literally every business could afford to benefit from our service.
Why choose us?
ViralQR will provide services for marketing, advertising, catering, retail, and the like. The QR codes can be posted on fliers, packaging, merchandise, and banners, as well as to substitute for cash and cards in a restaurant or coffee shop. With QR codes integrated into your business, improve customer engagement and streamline operations.
Comprehensive Analytics
Subscribers of ViralQR receive detailed analytics and tracking tools in light of having a view of the core values of QR code performance. Our analytics dashboard shows aggregate views and unique views, as well as detailed information about each impression, including time, device, browser, and estimated location by city and country.
So, thank you for choosing ViralQR; we have an offer of nothing but the best in terms of QR code services to meet business diversity!
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.
GDG Cloud Southlake #33: Boule & Rebala: Effective AppSec in SDLC using Deplo...James Anderson
Effective Application Security in Software Delivery lifecycle using Deployment Firewall and DBOM
The modern software delivery process (or the CI/CD process) includes many tools, distributed teams, open-source code, and cloud platforms. Constant focus on speed to release software to market, along with the traditional slow and manual security checks has caused gaps in continuous security as an important piece in the software supply chain. Today organizations feel more susceptible to external and internal cyber threats due to the vast attack surface in their applications supply chain and the lack of end-to-end governance and risk management.
The software team must secure its software delivery process to avoid vulnerability and security breaches. This needs to be achieved with existing tool chains and without extensive rework of the delivery processes. This talk will present strategies and techniques for providing visibility into the true risk of the existing vulnerabilities, preventing the introduction of security issues in the software, resolving vulnerabilities in production environments quickly, and capturing the deployment bill of materials (DBOM).
Speakers:
Bob Boule
Robert Boule is a technology enthusiast with PASSION for technology and making things work along with a knack for helping others understand how things work. He comes with around 20 years of solution engineering experience in application security, software continuous delivery, and SaaS platforms. He is known for his dynamic presentations in CI/CD and application security integrated in software delivery lifecycle.
Gopinath Rebala
Gopinath Rebala is the CTO of OpsMx, where he has overall responsibility for the machine learning and data processing architectures for Secure Software Delivery. Gopi also has a strong connection with our customers, leading design and architecture for strategic implementations. Gopi is a frequent speaker and well-known leader in continuous delivery and integrating security into software delivery.
Monitoring Java Application Security with JDK Tools and JFR Events
C0354021025
1. International Journal of Engineering Science Invention
ISSN (Online): 2319 – 6734, ISSN (Print): 2319 – 6726
www.ijesi.org Volume 3 Issue 5ǁ May 2014 ǁ PP.21-25
www.ijesi.org 21 | Page
A Novel Protocol for Mobile Nodes Adjustable Dynamic Routing
in Spacecraft Networks
Mrs.M.Gomathy1
1
(Lecturer, Department of Computer science, Srimathi Indira Gandhi College for Women, Trichy, Tamilnadu,
India)
ABSTRACT : Spacecraft’s are being used increasingly for an emerging host of applications in almost all
industries like weather prediction, geological conditions, river movements, mining etc. Most of the spacecraft
nodes have predictable nodes with predictable routing topology. Spacecraft networks are mobile networks with
independent, heterogeneous nodes but without spontaneous movement. In regular operation, each spacecraft
flies along a predictable trajectory that can be computed well in advance. Hence, spacecraft networks constitute
a subclass of mobile ad hoc networks that is characterized by its predictability. As in other networks,
unpredictable changes may still occur and influence the evolution of the topology, in particular, when nodes or
links fail. This study proposes a model mobile-routing protocol based on link-state routing, whose performance
is superior to its static and ad hoc counterpart’s dynamic topology. The proposed routing protocol for
spacecraft routing accounts for occurrences of additional, unpredictable changes, as well as their interaction
with predictable changes. The protocol outperforms traditional routing protocols and is well suited for routing
in next-generation space networks. Thus a snapshot of the network topology helps to store the networks model
in various timeframes and solve the problem in case of dynamic requirements either from the base station or
due to some other obvious reasons requiring change of path. This is done without any loss to the data and also
the security is not compromised in such conditions.
KEYWORDS: Spacecraft Network, Mobile Nodes.
I. INTRODUCTION
Paragraph Spacecraft networks are mobile networks which have independent heterogeneous nodes and
no spontaneous movement. They move along a predictable trajectory computed in advance. But these things are
subjected to lots of assumptions.The Spacecraft Tracking and Data (Acquisition) Network (STADAN or STDN)
was established by NASA to satisfy the requirement for long-duration, highly-available space-to-ground
communications. Real-time operational control and scheduling of the network was provided by the Network
Operations Control Center (NOCC) at the Goddard Space Flight Center (GSFC) in Greenbelt,
Maryland.Consisting of parabolic dish antennas and telephone switching equipment deployed around the world,
the STADAN provided space-to-ground communications for approximately 15 minutes of a 90-minute orbit
period. This limited contact period sufficed for unmanned spacecraft, but manned spacecraft require a much
higher data collection time. In May 1971 STADAN was consolidated with the Manned Space Flight Network
(MSFN) to form the Spaceflight Tracking and Data Network (STDN).
Space communications was developed to provide communication services that were specific and
optimized to each mission. The nature, communication needs and inter-spacecraft networking requirements of
such missions vary broadly, and although the interfaces and protocol used in different missions were
standardized, the resulting ―ensemble‖ of different communication systems is not integrated into an overall
autonomous communication infrastructure, wherein the in-space nodes can communicate with each other as well
as with users on Earth through the Internet. The need of a scalable integrated infrastructure is even more
relevant today, and it is reorienting its focus to long-term missions oriented to human missions for exploration
of the Moon, Mars and asteroids; human settlements in space; and large in-space observatories.The need of such
an integrated space communications infrastructure, including requirements identification, concept-architecture
and related technology developments, has been the object of investigations and workshops at the various
centers. Very much like the terrestrial Internet, the architecture of the integrated space communications
infrastructure is composed collection of networks deployed in the immediate vicinity of a celestial body being
observed and/or explored called, generically, <plnet_name>-Vicinity Networks (e.g., Earth, Moon, Mars-
Vicinity Networks) linked together through an inter-planetary backbone network that will likely include relay
satellites placed in the Earth-Moon Lagrange orbit and in the Earth-Sun Lagrange pointsL1, L2, L4 and/or L5 to
provide high data rate backbone capabilities to deep space observing and science missions.
2. A Novel Protocol for Mobile Nodes Adjustable…
www.ijesi.org 22 | Page
The Mars-Vicinity Network in Figure 1, as an example of a planet-vicinity network, will likely evolve
over time to include elements of the communications infrastructure deployed in and around the Earth.The
architecture and key physical-layer and medium access control (MAC) layer technologies for a High-
Throughput Distributed Spacecraft Network (or Hi-DSN) developed for NASA by BBN that could be used as
the basis of future Internet-friendly planet-vicinity networks. The Hi-DSN provides a self-forming vertically
integrated network infrastructure for establishing and maintaining high-throughput multi-hop communications
among spacecraft operating in diverse orbits. It integrates the predictability of orbital movement to establish and
maintain cross-links and multi-hop routes, ad hoc networking capabilities to autonomously discover ―new‖
neighbors, spatial multiplexing to maximize re-use of the allocated spectrum, and variable-rate cross-links with
multi-code spread spectrum to maximize network connectivity under large inter-spacecraft distances and
distance differentials .Transmission is performed in bursts, with one packet per burst. The spectrum is fully re-
usable in the cross-links that are spatially isolated. The spectrum is shared using time and/or time-code
multiplexing during the times in which the spacecraft become ―aligned.‖ Multi-code multiplexing is used, as
described in this paper, to adjust each cross-link data rate to ―close the link‖ between each source-destination
spacecraft pair. The inter-spacecraft communication strategy is QoS-aware, and the number of shift-orthogonal
codes used in the encoding of each packet burst is selected to meet bit error rate (BER) and delay/delay-jitter
requirements of each flow that compose the aggregate packet traffic over each cross-link.
The number of in-range neighbors per each spacecraft, and the distances and link performance (e.g.,
signal to noise ratio or SNR) of each of the cross-links change over time with the constellation movement.
Considering an example, snapshots (STK-tool animation of an OPNET simulation) of the geometry and the
cross-link connectivity of a typical multi-orbit constellation with spacecraft in LEO, MEO and GEO orbits. In
the Hi-DSN system, the transceiver in each spacecraft can establish, ideally, one cross-link per in-range
neighbor spacecraft—at the data rate required to close the link—while using a single modem and a single array
antenna. This capability is used to control the overall link-level connectivity properties of the network as a
whole, including the formation of clusters.The Hi-DSN architecture is hierarchical and can be extended to both
include ground-station gateways as integral part of the space-based network and provide dynamic ―terminal
affiliation and handoff‖ for transferring data from spacecraft to aircraft and spacecraft to ground terminals and
sensors. STK-tool animation of an OPNET simulation illustrates the integration of ground-station gateways in
the space-based constellation and the first-time establishment of cross-links (i.e., neighbor discovery) between
the gateways and each spacecraft in their field of view.
Key aspects of the Hi-DSN architecture in action have been demonstrated using a laboratory prototype
and OPNET simulation. The laboratory prototype enabled evaluating how the modulation, encoding, and
multiplexing technologies perform under extreme differences of distance (attenuation) and synchronization
(frequencies and delays) between space links. The OPNET simulation enabled evaluating how the higher-level
protocols scale to large networks.The descriptions focus on the aspects of the architecture that are relevant for
the planet vicinity network problem, and on the enabling physical-layer, medium access control (MAC) layer
and sub-network level (i.e., below IP) technologies required to create a scalable communications infrastructure
that can be used to extend the (terrestrial) Internet to space. In a follow-on development for NASA, BBN is
designing the architectural extensions and developing the protocols to extend Internet VPNs to space, then
known as Space VPNs.
As the spacecraft arrive at the destination, they will likely spread and self-arrange themselves into
orbits around the planet, possibly at different altitudes. The resulting network, albeit fully deterministic, will
exhibit aspects of an ad hoc network. This is true during its formation stage and when individual spacecraft do
not have pre-stored (or access to) orbital information of ALL other spacecraft in the constellation. Naturally,
with the appropriate communication mechanisms in place (as described in this paper), a spacecraft can learn
about each other’s orbital parameters, measure relative distances and velocities and even, if needed, re-
synchronize their internal clocks to a spacecraft dynamically-selected as reference. In the Hi-DSN the above
initial information gathering and measurements, including the exchange of orbital parameters (when and if
available), happen as part of a distributed protocol called Neighbor Discovery. A Distributed Network
Synchronization protocol establishes, over time, of a common time and frequency among all nodes in the
constellation. Over time, the initial deployed constellation around the planet will eventually be augmented by
new spacecraft.Newcomer nodes may include spacecraft with specialized sensing capabilities and more
powerful (i.e., next generation) communication capabilities and are required to fly at a different altitude orbit. In
the Hi-DSN, newcomer nodes are able to integrate themselves into the network with minimal disturbance to the
existing constellation, leveraging network adaptation techniques developed for terrestrial ad hoc wireless
3. A Novel Protocol for Mobile Nodes Adjustable…
www.ijesi.org 23 | Page
networks. These newly-arrived spacecraft, together with the already in- place spacecraft, creates a more
complex communication environment, where link switchovers occurs very frequently and links with fast
varying capacities are the rule, not the exception. The overall system, albeit fully ―predictable‖ over time,
becomes almost intractable when one considers the amount of information that needs to be ―configured‖ in ALL
spacecraft, and the additional synchronization requirements that would be needed if we were to continue using
conventional, scheduled-link switchover technologies as a means to maintain continued connectivity. The Hi-
DSN uses an ad hoc networking approach, where each spacecraft dynamically ―discovers‖ in-range neighbor
spacecraft, dynamically affiliates to neighbor router spacecraft, and dynamically form a three-level hierarchical
network.
II. RELATED WORK
Satellite communication is traditionally one of two kinds: either 1) direct point-to-point links from
control centers to spacecraft or 2) bent-pipe communication applications, where spacecraft relays a data stream.
Neither approach uses network routing technologies. Earlier attempts to use more sophisticated spacecraft
communication models in the form of Low Earth Orbit constellations with inter spacecraft links had limited
commercial success due to their inability to integrate the spacecraft network with other terrestrial networks
Direct Point to Point control links having direct control centers to the space craft. Does not use network routing
technology. Multiple centers for different crafts use more resources. Bent Pipe Methods: Spacecraft streams data
to the control center also does not use network routing technology. Does not integrate spacecraft with other
ground networks, so to issue commands one has to first issue a request to the original station and then forward
from there to the spacecraft. This is very time consuming and also obliterates the purpose of the command and
makes the information thus retrieved very old.Requires manual commanding by operators, who will man the
base station. To remember all the commands and routes and tasks assigned will be a very difficult proposition.
Hence at one stage it becomes overloaded and efficiency is relinquished at some point of time.Provides a
position-based routing architecture for space networks which is dynamic in nature. It also treats all nodes as
equal in terms of routing protocol behavior and proactively propagates connection information on current and
future links between nodes. All this involves lot of processing power and this in turn increases communication
overheads.
III. PROPOSED MODEL
The proposed model is the Secured Link State Protocol. The proposed framework introduces a model
to handle predictability without any manual intervention required for issuing commands or controls over
routing. The proposed model is autonomous. It takes decisions dynamically in response to the topology
snapshot. Also monitors topology continuously across domains. The model takes a snapshot of spacecraft
topology at a particular time interval. Next it associates the topology of the snapshot with the time interval.
There might be some changes in the sequences. Then observe the changes in the sequence of snapshots. This
brings out any unpredictability and the system reacts. A sequence of snapshots describing predictable changes
can be defined by an initial snapshot and a transition function that maps snapshots to snapshots. The transition
function describes how the network connectivity is expected to change over time. Note that it may be different
for each network topology and sequence of snapshots. Unpredictable changes are not covered by the transition
function and must be discovered by the nodes using link sensing. This means that nodes must check their
neighborhood for unpredictable changes either proactively, at regular time intervals, or reactively. These
unpredictable changes at regular time intervals are captured and dissected by the snapshots.
The system responds reactively to both the states the initial and the present and it pre-computes these
snapshots. Then all the nodes are realigned for all unpredictability. It also has security services against attacks
and data thefts. This is the Secured Link State Protocol.The first problem related to the interaction of predictable
and unpredictable changes at transition points. As the predictable snapshot sequence does not include
unpredictable changes, such changes may be overwritten by the snapshot topology images. The second problem
is the need for regular realignment of the original predicted snapshot incorporate modifications due to past
unpredictable changes. This method provides solutions to both problems. Note that these problems (and
opportunities) do not arise in mobile ad hoc settings without the a priori topology knowledge of node movement
and communication opportunities since all changes are un-predictable. Both the problems are solved thus and
the communication overheads are minimal when compared to the existing solutions. The efficiency is good with
both processing and computing power utilization being minimal in terms of route computation at any point of
time.All the spacecraft, together with the already in-place spacecraft, creates a more complex communication
environment, where link switchovers occurs very frequently and links with fast varying capacities are the rule,
not the exception.
4. A Novel Protocol for Mobile Nodes Adjustable…
www.ijesi.org 24 | Page
The overall system, albeit fully ―predictable‖ over time, becomes almost intractable when one
considers the amount of information that needs to be ―configured‖ in ALL spacecraft, and the additional
synchronization requirements that would be needed if we were to continue using conventional, scheduled-link
switchover technologies as a means to maintain continued connectivity. The space-craft network uses an ad hoc
networking approach, where each spacecraft dynamically ―discovers‖ in-range neighbor spacecraft, dynamically
affiliates to neighbor router spacecraft, and dynamically form a three-level hierarchical network.
Fig 3.1 spacecraft network
Each spacecraft is equipped with a single router, a single transceiver and a single pair of transmit-
receive array antennas to achieve low cost. All router nodes have identical Physical-Layer level characteristics
(e.g., modulation, FEC, multiplexing, etc.) but can have different RF front-end capabilities (e.g., RF power, and
beam gain and agility). Inter-spacecraft cross- links use RF array antenna technology to achieve the required
beam agility and Ka-band frequencies to achieve high-directivity with a relatively small profile antenna. They
also assume the use of spatially isolated transmit-and - receive array antennas to achieve full re-use of the
allocated spectrum in each cross-link. Because of the nearly arbitrary albeit predictable topology, digital beam
forming is used to establish a varying number of cross-links per spacecraft. Because of the nearly arbitrary,
albeit predictable geometry, antenna null steering is used to minimize interference between cross-links. In
addition, because of the large inter-spacecraft distances and, more importantly, because of the typical multiple
order of magnitude difference between such distances, a novel multi-code multi-bit modulation-and-encoding is
used on each cross-link to achieve bit rates varying over a four-order-of-magnitude range (e.g., from 100 Kbit/s
to approximately 1 Gbit/s) to ―close the link‖ to neighbor spacecraft.
In order to optimize the use of on-board power, a BBN-developed patent-pending Split-Phase Shift
Keying (or SPSK) modulation is used to enable signals transmission at a constant power with the SSPA of each
array antenna element operating at or close to saturation. Finally, because of the typical large delays of the inter-
spacecraft links, a multiple access strategy that does not require ―burst transmission coordination‖ among
neighbor spacecraft was developed.Each node in the network does the routing as described below. It looks at the
tag of the incoming data packet. It then does a table look-up with the help of its ingress label which indicates its
QoS parameter. If the transition to the next snapshot is nearing or a transition has just occurred, then the shortest
path is chosen as stated previously. If the ISL along which it is going to send the data is congested or the node at
the other end has failed, then the next suitable shortest path is chosen. It then stamps the data packet with the
egress label obtained from the table entry in place of its old ingress label. It then sends out the packet along the
egress link obtained from the table entry. A space-time routing framework for instances of these networks that
have predictable motion, either over finite time horizons or infinite time horizons due to periodicity.
Specifically, we solve this routing problem: Given a set of nodes and how they move up to a certain time in the
future, our goal is to construct space-time routing tables that specify when and to whom a node must forward a
message in order to meet some routing objective. The proposed solution is based on a space-time graph model
of the network derived from the mobility of nodes. The space-time graph model captures the dynamic evolution
and connectivity over time of the network topology. They devise a routing algorithm using this space-time graph
model to select a suitable next hop node from the current as well as the future neighbors. Consequently, the next
hop for forwarding a message from a node is a function of both the destination and time, unlike traditional
forwarding approaches based only on the destination of a message.
5. A Novel Protocol for Mobile Nodes Adjustable…
www.ijesi.org 25 | Page
IV. CONCLUSION
Thus the model for predictable mobile topologies and used it to design the PLSR routing protocol. The
proposed protocol is correct and performs well compared to other routing protocols in a topology that has been
generated using a random-waypoint model. They have carried out the first detailed study of predictable routing
for space networks. Using realistic simulations based on two application scenarios, we showed that PLSR is
efficient and offers advantages over competing protocols. The simulations are based on actual flight-dynamics
data and show the superiority of PLSR over LSR. Together with the generic simulations, our results provide
strong evidence of PLSR’s general usability. Also adequate security has been developed for data theft
possibilities and optimized in such a manner that provides dynamic routing coupled with data security.
REFERENCES
Papers:
[1] B. Evans, M. Werner, E. Lutz, M. Bousquet, G.E. Corazza, G. Maral, R. Rumeau, and E. Ferro, ―Integration of Satellite and
Terrestrial Systems in Future Multimedia Communications,‖ IEEE Wireless Comm., vol. 12, no. 5, pp. 72-80, Oct. 2005.
[2] ―Space Communications Architecture Working Group. NASA Space Communications and Navigation Architecture
Recommendations for 2005-2030,‖ NASA technical report, May 2006.
[3] B. ―Satellite Tool Kit Fundamentals,‖Analytical Graphics Inc. technical report, Nov. 2007.
[4] R.J. Leopold and A. Miller, ―The Iridium Communications System,‖ IEEE Potentials, vol. 12, no. 2, pp. 6-9, Apr. 1993.
International Conference Papers:
[5] D.P. Patterson, ―Teledesic: A Global Broadband Network,‖ Proc. IEEE Aerospace Conf., pp. 547-552, Mar. 1998.
[6] V.V. Gounder, R. Prakash, and H. Abu-Amara, ―Routing in LEO-Based Satellite Networks,‖ Proc. Emerging Technologies Symp.
Wireless Comm. and Systems, pp. 22.1-22.6, Apr. 1999.
[7] AtmelCooperation, ―TSC695F Sparc 32-Bit Space Processor – User Manual,‖ 2003.
[8] J.M. McQuillan, I. Richer, and E.C. Rosen, ―The New Routing Algorithm for the ARPANET,‖ IEEE/ACM Trans. Comm., vol. 28,
no. 5, pp. 711-719, May 1980.
[9] D. Fischer, D. Basin, and T. Engel, ―Topology Dynamics and Routing for Predictable Mobile Networks,‖ Proc. 16th Int’l Conf.
Network Protocols (ICNP), pp. 207-217, Oct. 2008.
[10] J. Broch, D.A. Maltz, D.B. Johnson, Y.-C. Hu, and J. Jetcheva, ―A Performance Comparison of Multi-Hop Wireless Ad Hoc
Network Routing Protocols,‖ Proc. ACM/IEEE MobiCom, pp. 85-97, 1998.