Results 121 to 129 of about 32,826 (129)
Frequency-hopping codes for multimedia services in mobile telecommunications
IEEE Transactions on Vehicular Technology, 1999 In this paper, "multilength" frequency-hopping (FH) codes are constructed by modifying the generalized prime codes (GPCs). The new codes have asymptotically optimal cardinality as well as zero autocorrelation sidelobes and cross-correlation functions of no greater than one. They are suitable for the integration of multimedia services (e.g., data, voice,
W.C. Kwong, null Guu-Chang Yang
openaire +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
On Minimum HOP Flow Assignment in Message-Switched Telecommunication Networks *
IFAC Proceedings Volumes, 1981Abstract A dynamic programming algorithm for minimum hop flow assignment in message-switched telecommunication networks is developed. The algorithm is a significant improvement over previous ones since it is applicable to any network topology, to any set of link capacities, and to any set of traffic requirements.
F.D. Gorecki, J.S. Meditch
openaire +1 more source
2011 IEEE International Conference on Automation and Logistics (ICAL), 2011
In this essay, the author carried on a research of the application of Port-Hopping Techniques in the defense against DoS/DDoS attacks and improved the Port-Hopping scheme with a new scheme based on ciphers, thus he provided a solution to improve the tolerance capacity of system without increasing the calculating and loading abilities.
Xu Guo, Xu Na
openaire +1 more source
In this essay, the author carried on a research of the application of Port-Hopping Techniques in the defense against DoS/DDoS attacks and improved the Port-Hopping scheme with a new scheme based on ciphers, thus he provided a solution to improve the tolerance capacity of system without increasing the calculating and loading abilities.
Xu Guo, Xu Na
openaire +1 more source
Lexicographical Minimization of Routing Hops in Telecommunication Networks
2011Consider a telecommunications network with given link capacities and a set of commodities with known demands that must be routed over the network. We aim to determine a single routing path for each commodity such that the whole set of paths does not violate the link capacities and the number of routing hops is minimized in a lexicographical sense, i.e.,
Gouveia, Luís +2 more
openaire +2 more sources
2014
A multi-hop wireless transmission system employing both half duplex and imperfect full duplex relays is proposed. In this scheme, which uses Ksub-channels for transmission and reception over Rayleigh fading channels, we aim to mitigate the most dominant source of interference in each node by allocating different sub-channels to various groups of nodes.
A. Sadeghi +3 more
openaire +1 more source
A multi-hop wireless transmission system employing both half duplex and imperfect full duplex relays is proposed. In this scheme, which uses Ksub-channels for transmission and reception over Rayleigh fading channels, we aim to mitigate the most dominant source of interference in each node by allocating different sub-channels to various groups of nodes.
A. Sadeghi +3 more
openaire +1 more source