Waveform Optimization for Integrated Radar and Communication Systems Using Meta-Heuristic Algorithms

2011 ◽  
pp. 183-203 ◽  
Author(s):  
Momin Jamil ◽  
Hans-Jürgen Zepernick
Keyword(s):  
Communication Systems ◽  
Heuristic Algorithms ◽  
Waveform Optimization

Heuristic algorithm for optimal redundancy allocation in complex systems

2019 ◽  
Vol 25 (1) ◽  
pp. 54-64 ◽  
Author(s):  
Sudhanshu Aggarwal
Keyword(s):  
Complex Systems ◽  
Heuristic Algorithm ◽  
Communication Systems ◽  
Heuristic Algorithms ◽  
Real Life ◽  
Optimal Solution ◽  
Systems Design ◽  
Computational Time ◽  
Coherent System ◽  
Content Type

PurposeThe purpose of this paper is to present an efficient heuristic algorithm based on the 3-neighborhood approach. In this paper, search is made from sides of both feasible and infeasible regions to find near-optimal solutions.Design/methodology/approachThe algorithm performs a series of selection and exchange operations in 3-neighborhood to see whether this exchange yields still an improved feasible solution or converges to a near-optimal solution in which case the algorithm stops.FindingsThe proposed algorithm has been tested on complex system structures which have been widely used. The results show that this 3-neighborhood approach not only can obtain various known solutions but also is computationally efficient for various complex systems.Research limitations/implicationsIn general, the proposed heuristic is applicable to any coherent system with no restrictions on constraint functions; however, to enforce convergence, inferior solutions might be included only when they are not being too far from the optimum.Practical implicationsIt is observed that the proposed heuristic is reasonably proficient in terms of various measures of performance and computational time.Social implicationsReliability optimization is very important in real life systems such as computer and communication systems, telecommunications, automobile, nuclear, defense systems, etc. It is an important issue prior to real life systems design.Originality/valueThe utilization of 3-neighborhood strategy seems to be encouraging as it efficiently enforces the convergence to a near-optimal solution; indeed, it attains quality solutions in less computational time in comparison to other existing heuristic algorithms.

scholarly journals On Applications of Graph/Network Theory to Problems in Communication Systems

1970 ◽  
Vol 5 (1) ◽  
pp. 15-21
Author(s):  
Hiroshi Tamura ◽  
Keisuke Nakano ◽  
Masakazu Sengoku ◽  
Shoji Shinoda
Keyword(s):  
Graph Theory ◽  
Network Theory ◽  
Channel Assignment ◽  
Assignment Problem ◽  
Communication Systems ◽  
Heuristic Algorithms ◽  
Network Location ◽  
Coloring Problem ◽  
Channel Assignment Problem ◽  
Server Allocation

Graph/network theory results are applicable to problems in communications. As a representative example, the node coloring problem in graph theory is applicable to the channel assignment problem in cellular mobile communication systems. The node coloring problem is NP-complete, meaning that optimally solving it is very difficult. Therefore, we use heuristic algorithms for the channel assignment problem. In this case, the graph theory results show the legitimacy of using heuristic techniques. On the other hand, we can directly apply graph theory to communication problems. For example, on contents delivery services in the Internet, we place mirror servers that provide the same contents on the network. Location problems on flow networks are applicable to mirror server allocation problems. In a simple case, we can efficiently solve the problem. In this paper, we concentrate on multi-hop wireless networks and consider the relationship between their problems and the results of graph/network theory.

scholarly journals QoS Aware and Fault Tolerance Based Software-Defined Vehicular Networks Using Cloud-Fog Computing

Sensors ◽  
2022 ◽  
Vol 22 (1) ◽  
pp. 401
Author(s):  
Sidra Abid Syed ◽  
Munaf Rashid ◽  
Samreen Hussain ◽  
Fahad Azim ◽  
Hira Zahid ◽  
...  
Keyword(s):  
Fault Tolerance ◽  
Response Time ◽  
Communication Systems ◽  
Vehicular Networks ◽  
Heuristic Algorithms ◽  
Fog Computing ◽  
Research Work ◽  
Tolerance Mechanism ◽  
Proposed Model ◽  
Sdn Controller

Software-defined network (SDN) and vehicular ad-hoc network (VANET) combined provided a software-defined vehicular network (SDVN). To increase the quality of service (QoS) of vehicle communication and to make the overall process efficient, researchers are working on VANET communication systems. Current research work has made many strides, but due to the following limitations, it needs further investigation and research: Cloud computing is used for messages/tasks execution instead of fog computing, which increases response time. Furthermore, a fault tolerance mechanism is used to reduce the tasks/messages failure ratio. We proposed QoS aware and fault tolerance-based software-defined V vehicular networks using Cloud-fog computing (QAFT-SDVN) to address the above issues. We provided heuristic algorithms to solve the above limitations. The proposed model gets vehicle messages through SDN nodes which are placed on fog nodes. SDN controllers receive messages from nearby SDN units and prioritize the messages in two different ways. One is the message nature way, while the other one is deadline and size way of messages prioritization. SDN controller categorized in safety and non-safety messages and forward to the destination. After sending messages to their destination, we check their acknowledgment; if the destination receives the messages, then no action is taken; otherwise, we use a fault tolerance mechanism. We send the messages again. The proposed model is implemented in CloudSIm and iFogSim, and compared with the latest models. The results show that our proposed model decreased response time by 50% of the safety and non-safety messages by using fog nodes for the SDN controller. Furthermore, we reduced the execution time of the safety and non-safety messages by up to 4%. Similarly, compared with the latest model, we reduced the task failure ratio by 20%, 15%, 23.3%, and 22.5%.

scholarly journals Resource Management in Satellite Communication Systems: Heuristic Schemes and Algorithms

2012 ◽  
Vol 2012 ◽  
pp. 1-10 ◽  
Author(s):  
Shahaf I. Wayer ◽  
Arie Reichman
Keyword(s):  
Resource Allocation ◽  
Resource Management ◽  
Communication Systems ◽  
Satellite Communication ◽  
Heuristic Algorithms ◽  
Traffic Model ◽  
Resource Allocation Problem ◽  
Frequency Bandwidth ◽  
Simulation Based ◽  
Priority Levels

The high cost of frequency bandwidth in satellite communication emphasizes the need for good algorithms to cope with the resource allocation problem. In systems using DVB-S2 links, the optimization of resource allocation may be related to the classical multi-knapsack problem. Resource management should be carried out according to the requests of subscribers, their priority levels, and assured bandwidths. A satisfaction measure is defined to estimate the allocation processes. Heuristic algorithms together with some innovative scaling schemes are presented and compared using Monte Carlo simulation based on a traffic model introduced here.

Sign in / Sign up

Export Citation Format

Share Document