Performance evaluation of alternative network architectures for sensor-satellite integrated networks
KeywordNode layout schemes; Wireless sensor networks; Satellite networks; Hybrid networks; Data aggregation
MetadataShow full item record
AbstractThe last decade has seen an exponential rise in the use of wireless sensor networks (WSNs) in various applications. While these have been primarily used on their own, researchers are now looking into ways of integrating these WSNs with other existing communication technologies. One such network is the satellite network which provides significant advantage in providing communication access to remote locations due to their inherent large coverage areas. Combining WSNs and satellite will enable us to perform efficient remotely monitoring in areas where terrestrial networks may not be present. However in such a scenario, the placement of sensor nodes is crucial in order to ensure efficient routing and energy-efficiency. This paper presents four network architectures for sensor-satellite hybrid networks, sensor-satellite direct communication, connections via a gateway node employing random node layout, grid-based node layout and cluster-based node layout with data aggregation. These architectures were simulated using network simulator 2 (ns-2) and then their packet loss rate, average end-to-end packet delay, and overall energy consumption were compared. The paper concludes by proposing a suitable network topology for environmental monitoring applications.
VersionNo full-text available in the repository
CitationVerma S, Pillai P and Hu YF (2013) Performance evaluation of alternative network architectures for sensor-satellite integrated networks. In: Proceedings of the 27th International Conference on Advanced Information Networking and Applications Workshops (WAINA). 25-28 Mar 2013. Barcelona, Spain: 120-125.
Link to publisher’s versionhttps://doi.org/10.1109/WAINA.2013.56
Showing items related by title, author, creator and subject.
Network Coding for Multihop Wireless Networks: Joint Random Linear Network Coding and Forward Error Correction with Interleaving for Multihop Wireless NetworksHu, Yim Fun; Pillai, Prashant; Susanto, Misfa (University of BradfordFaculty of Engineering and Informatics. School of Electrical Engineering and Computer Science, 2015)Optimising the throughput performance for wireless networks is one of the challenging tasks in the objectives of communication engineering, since wireless channels are prone to errors due to path losses, random noise, and fading phenomena. The transmission errors will be worse in a multihop scenario due to its accumulative effects. Network Coding (NC) is an elegant technique to improve the throughput performance of a communication network. There is the fact that the bit error rates over one modulation symbol of 16- and higher order- Quadrature Amplitude Modulation (QAM) scheme follow a certain pattern. The Scattered Random Network Coding (SRNC) system was proposed in the literature to exploit the error pattern of 16-QAM by using bit-scattering to improve the throughput of multihop network to which is being applied the Random Linear Network Coding (RLNC). This thesis aims to improve further the SRNC system by using Forward Error Correction (FEC) code; the proposed system is called Joint RLNC and FEC with interleaving. The first proposed system (System-I) uses Convolutional Code (CC) FEC. The performances analysis of System-I with various CC rates of 1/2, 1/3, 1/4, 1/6, and 1/8 was carried out using the developed simulation tools in MATLAB and compared to two benchmark systems: SRNC system (System-II) and RLNC system (System- III). The second proposed system (System-IV) uses Reed-Solomon (RS) FEC code. Performance evaluation of System IV was carried out and compared to three systems; System-I with 1/2 CC rate, System-II, and System-III. All simulations were carried out over three possible channel environments: 1) AWGN channel, 2) a Rayleigh fading channel, and 3) a Rician fading channel, where both fading channels are in series with the AWGN channel. The simulation results show that the proposed system improves the SRNC system. How much improvement gain can be achieved depends on the FEC type used and the channel environment.
An Exposition of Performance-Security Trade-offs in RANETs Based on Quantitative Network ModelsMiskeen, Guzlan M.A.; Kouvatsos, Demetres D.; Habib Zadeh, Esmaeil (2013)Security mechanisms, such as encryption and authentication protocols, require extra computing resources and therefore, have an adverse effect upon the performance of robotic mobile wireless ad hoc networks (RANETs). Thus, an optimal performance and security trade-off should be one of the main aspects that should be taken into consideration during the design, development, tuning and upgrading of such networks. In this context, an exposition is initially undertaken on the applicability of Petri nets (PNs) and queueing networks (QNs) in conjunction with their generalisations and hybrid integrations as robust quantitative modelling tools for the performance analysis of discrete flow systems, such as computer systems, communication networks and manufacturing systems. To overcome some of the inherent limitations of these models, a novel hybrid modelling framework is explored for the quantitative evaluation of RANETs, where each robotic node is represented by an abstract open hybrid G-GSPN_QN model with head-of-line priorities, subject to combined performance and security metrics (CPSMs). The proposed model focuses on security processing and state-based control and it is based on an open generalised stochastic PN (GSPN) with a gated multi-class 'On-Off' traffic and mobility model. Moreover, it employs a power consumption model and is linked in tandem with an arbitrary QN consisting of finite capacity channel queues with blocking for 'intra' robot component-to-component communication and 'inter' robot-to-robot transmission. Conclusions and future research directions are included.
A Hybrid Topological-Stochastic Partitioning Method for Scaling QoS Routing Algorithms.Woodward, Mike E.; Gao, Feng (2007)This paper presents a new partitioning strategy with the objective of increasing scalability by reducing computational effort of routing in networks. The original network is partitioned into blocks (subnetworks) so that there is a bi-directional link between any two blocks. When there is a connection request between a pair of nodes, if the nodes are in the same block, we only use the small single block to derive routings. Otherwise we combine the two blocks where the two nodes locate and in this way the whole network will never be used. The strategy is generic in that it can be used in any underlying routing algorithms in the network layer and can be applied to any networks with fixed topology such as fixed wired subnetworks of the Internet. The performance of this strategy has been investigated by building a simulator in Java and a comparison with existing stochastic partitioning techniques is shown to give superior performance in terms of trade-off in blocking probability (the probability of failure to find a path between source and destination satisfying QoS constraints) and reduction of computational effort.