APNOMS
2015
Springer
8 years 6 months ago
2015
Springer
—In this paper, we study the relay-aided cooperative modeling that supports the load-sharing in uplink two-tier cellular networks. In our model, users in heavily loaded macrocell...
APNOMS
2015
Springer
8 years 6 months ago
2015
Springer
— The increase in the number of connected smart mobile devices has fueled the exponential growth in mobile data. The nextgeneration networks must meet the demand for higher capac...
APNOMS
2015
Springer
8 years 6 months ago
2015
Springer
—Internet has grown very rapidly in the last couple of decades and still growing because of the expansion and utilization of various services and applications. Consequently, dema...
APNOMS
2015
Springer
8 years 6 months ago
2015
Springer
—At the present, the traffic is really in a mess when the number of vehicles is increasing rapidly. As a consequence, finding a parking space is remarkably difficult and expen...
APNOMS
2015
Springer
8 years 6 months ago
2015
Springer
—Content Centric Networking (CCN) is one of the most promising network architectures of future Internet. In CCN, Content Router (CR) floods request in the network to find the c...
APNOMS
2015
Springer
8 years 6 months ago
2015
Springer
— Recently cloud service has been introduced in order for many enterprises to achieve purposes such as improvement in efficiency, cost reduction and revolution in business proces...
APN
2015
Springer
8 years 6 months ago
2015
Springer
This paper investigates the feature negotiation procedure of the Datagram Congestion Control Protocol (DCCP) in RFC 4340 using Coloured Petri Nets (CPNs). After obtaining a formal ...
APN
2015
Springer
8 years 6 months ago
2015
Springer
APN
2015
Springer
8 years 6 months ago
2015
Springer
Abstract. SIFT (Scale Invariant Feature Transform) is a complex image processing procedure for matching objects or patterns in images. Involving the computation of Euclidean distan...
APN
2015
Springer
8 years 6 months ago
2015
Springer
A finite word is called Petri net solvable if it is isomorphic to the reachability graph of some unlabelled Petri net. In this paper, the class of two-letter Petri net solvable wo...